{"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09320393,0.00029312132,0.8897892,0.000860684,0.00011333958,0.00015459555,0.00024183514,0.00055235275,0.014790828],"genre_scores_gemma":[0.951178,0.00017117593,0.044966802,0.00007442563,0.000025418825,0.00012865986,0.000060125436,0.000099115045,0.003296351],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985983,0.00031424034,0.000081173996,0.00028659648,0.00020264325,0.00051711197],"domain_scores_gemma":[0.99629265,0.002094973,0.0003996561,0.0003292313,0.00038146254,0.0005019589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018959886,0.0012418866,0.0019783417,0.0007695675,0.0008421278,0.0033198535,0.0022328554,0.0019362341,0.0051738876],"category_scores_gemma":[0.005858811,0.0009172584,0.000843489,0.00077730673,0.0019673111,0.003759094,0.0026447026,0.0024010695,0.000546534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037915155,0.00011129201,0.00026876692,0.00013916861,0.000061850296,0.00013688863,0.00013295161,0.8320647,0.0058464273,0.14741908,0.0015594003,0.011880348],"study_design_scores_gemma":[0.000024932271,0.000041114447,0.00006608238,0.000015533953,0.0000143213865,0.000013418065,0.000039522936,0.9369639,0.0008934306,0.061667733,0.0002463904,0.000013517913],"about_ca_topic_score_codex":0.0033485705,"about_ca_topic_score_gemma":0.0027468356,"teacher_disagreement_score":0.0051738876,"about_ca_system_score_codex":0.0022851916,"about_ca_system_score_gemma":0.003042583,"threshold_uncertainty_score":0.017308414},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058018826,0.00022687089,0.93777066,0.0003985762,0.00003924157,0.000050476683,0.000045322024,0.0002135772,0.0032364284],"genre_scores_gemma":[0.97792983,0.000097407894,0.019796751,0.00006162563,0.000024482608,0.000092961796,0.00003538781,0.000017654707,0.0019438283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989139,0.00040977218,0.00003984583,0.00023024903,0.00025349215,0.00015268323],"domain_scores_gemma":[0.99716717,0.0018050533,0.00043655848,0.0001632193,0.00029408126,0.00013387928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018451149,0.0006493318,0.001234451,0.00032229727,0.0005401138,0.0008220479,0.0010502893,0.0009071714,0.0013988388],"category_scores_gemma":[0.0052638724,0.00038299247,0.000462158,0.00037753262,0.0016289295,0.00093106716,0.0011304714,0.00112436,0.00012992449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029531075,0.000016132357,0.00021745081,0.000020181991,0.000015289635,0.000047577385,0.000030187737,0.9798839,0.00034703437,0.015517325,0.00013786247,0.0037374632],"study_design_scores_gemma":[0.000008735938,0.0000118839125,0.00004344886,0.0000015061051,0.0000019026375,0.0000042740485,0.0000032720643,0.9948249,0.00007134319,0.0049387366,0.000087738226,0.00000226643],"about_ca_topic_score_codex":0.008796854,"about_ca_topic_score_gemma":0.0043916716,"teacher_disagreement_score":0.008796854,"about_ca_system_score_codex":0.0015408576,"about_ca_system_score_gemma":0.0013894354,"threshold_uncertainty_score":0.017491281},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024338601,0.00025656514,0.9686969,0.00019362158,0.0000224769,0.000072899646,0.000026589994,0.00012840674,0.006263972],"genre_scores_gemma":[0.9668813,0.0002793444,0.029151693,0.00006165171,0.00002448709,0.0001533226,0.00003559773,0.000031866664,0.0033808025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947697,0.00013872642,0.000022235972,0.00012287937,0.00017970297,0.00005948862],"domain_scores_gemma":[0.99919003,0.00030978926,0.00021746069,0.00004383041,0.00020392376,0.00003487194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010425071,0.0010098052,0.00054047606,0.00052878197,0.00041204446,0.0010946733,0.00081541215,0.0009281182,0.0018067559],"category_scores_gemma":[0.0021405404,0.00024700692,0.00050532696,0.00030402432,0.0010473501,0.0007685269,0.0012378407,0.00066837965,0.0002757338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038634036,0.000019771815,0.00017855884,0.00006375242,0.000022849123,0.00009550842,0.00009375513,0.9583873,0.008529765,0.022529457,0.00035215876,0.009688358],"study_design_scores_gemma":[0.0000026898888,0.00003437772,0.00004451727,0.000004919722,0.0000037025181,0.000008139277,0.000009374195,0.99738187,0.0005627368,0.0017675918,0.00017680808,0.0000033290025],"about_ca_topic_score_codex":0.0041193883,"about_ca_topic_score_gemma":0.0021888202,"teacher_disagreement_score":0.0041193883,"about_ca_system_score_codex":0.0011348147,"about_ca_system_score_gemma":0.00094002625,"threshold_uncertainty_score":0.008233666},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87351805,0.001552355,0.10843887,0.00077856693,0.00012900576,0.00015810548,0.00043513047,0.000944358,0.014045454],"genre_scores_gemma":[0.9911171,0.00030129202,0.006909046,0.00003422185,0.000050485243,0.000034316367,0.0001455599,0.000048648053,0.0013592833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985447,0.00047130647,0.000056205154,0.00015114182,0.0004270512,0.00034958217],"domain_scores_gemma":[0.9899039,0.0065133236,0.0007739699,0.00083983404,0.0017149204,0.00025390933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036828332,0.00068187,0.00075875066,0.0014961517,0.00070326333,0.0011821549,0.0010007675,0.00057892845,0.002863189],"category_scores_gemma":[0.01081947,0.00022176585,0.0002406518,0.0021938747,0.0005509363,0.0016979018,0.0006059016,0.00061837357,0.00026779616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021131414,0.0006556612,0.0101100635,0.00018749849,0.0000868446,0.0001583605,0.00015036429,0.84407896,0.007736987,0.028278291,0.007752357,0.09869133],"study_design_scores_gemma":[0.0000055385744,0.00012823632,0.00075119775,0.0000034385532,0.000016345934,0.000021404947,0.000032002474,0.9967284,0.0010424361,0.0010823237,0.00018455571,0.0000041160606],"about_ca_topic_score_codex":0.0045604757,"about_ca_topic_score_gemma":0.0044809887,"teacher_disagreement_score":0.0045604757,"about_ca_system_score_codex":0.0022660508,"about_ca_system_score_gemma":0.001109556,"threshold_uncertainty_score":0.01947695},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066639013,0.00037282603,0.94767994,0.00037509727,0.00024293453,0.0009139375,0.00044926652,0.0078917,0.035410333],"genre_scores_gemma":[0.20734204,0.0011465143,0.74360806,0.001438689,0.0003656135,0.0024929086,0.0036400517,0.004165298,0.03580094],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.97150886,0.006563215,0.0026902389,0.002951391,0.0148629,0.0014234574],"domain_scores_gemma":[0.96977913,0.009297182,0.0023996572,0.009953106,0.008220904,0.0003499845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009845951,0.0017910796,0.0010590567,0.0039994936,0.0013066336,0.002785944,0.004969625,0.0019240561,0.021567032],"category_scores_gemma":[0.037740678,0.0008826059,0.0018911788,0.002490509,0.0023858594,0.0045219297,0.0037695013,0.003121772,0.008255034],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047712412,0.0005779755,0.0064788614,0.0012139659,0.00023693446,0.0014088687,0.0019472298,0.020770242,0.039847426,0.23788792,0.052570924,0.63658255],"study_design_scores_gemma":[0.00031184577,0.001447154,0.0035490375,0.00115205,0.0003667576,0.0066757104,0.0011788999,0.15976797,0.12385976,0.219717,0.48167405,0.00029987484],"about_ca_topic_score_codex":0.0018748563,"about_ca_topic_score_gemma":0.0015670321,"teacher_disagreement_score":0.021567032,"about_ca_system_score_codex":0.0010742637,"about_ca_system_score_gemma":0.0022059516,"threshold_uncertainty_score":0.07214886},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084969245,0.003202059,0.71488607,0.16907583,0.003397279,0.00007704134,0.0006567972,0.00075453013,0.022981161],"genre_scores_gemma":[0.945058,0.0026328892,0.029385662,0.014255733,0.0018352906,0.00013065973,0.00014654758,0.00014553395,0.0064097075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995455,0.00021170931,0.000027043103,0.00009108639,0.000060725706,0.000063854844],"domain_scores_gemma":[0.99384755,0.004587576,0.00039694473,0.00051634153,0.00040523938,0.0002464553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025896057,0.000736776,0.0019311723,0.00029177035,0.00047669123,0.001288472,0.0020125657,0.005308772,0.0036187787],"category_scores_gemma":[0.02635946,0.00037054656,0.00072320877,0.00032930681,0.0012499398,0.004618709,0.0008085484,0.0037847455,0.0010263793],"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.000352196,0.00013574053,0.004561114,0.0005410886,0.00022746855,0.0009969654,0.00027748404,0.33428025,0.0021586514,0.5466775,0.05047358,0.059318013],"study_design_scores_gemma":[0.000064209686,0.00004761844,0.00047866948,0.000043236592,0.00003661332,0.00018884562,0.00004640065,0.5547043,0.00032254818,0.44032493,0.0037108206,0.00003179489],"about_ca_topic_score_codex":0.0060527176,"about_ca_topic_score_gemma":0.0034829676,"teacher_disagreement_score":0.0060527176,"about_ca_system_score_codex":0.0012206429,"about_ca_system_score_gemma":0.00077287137,"threshold_uncertainty_score":0.01369524},"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":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013328083,0.017228143,0.022842491,0.23968677,0.116442494,0.0020305472,0.05334366,0.009648966,0.5254488],"genre_scores_gemma":[0.059215132,0.019347703,0.029873801,0.06964964,0.024353705,0.0024887486,0.07753799,0.0050538327,0.7124795],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9949674,0.0003443954,0.0002870734,0.00032828547,0.0033794253,0.0006934861],"domain_scores_gemma":[0.9797968,0.0009054273,0.0015059302,0.0008869212,0.0148813445,0.0020235402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073250076,0.0010058398,0.0006324744,0.0069145337,0.0032533924,0.010994178,0.0016248603,0.0046537537,0.056182288],"category_scores_gemma":[0.01932748,0.00054337847,0.0008750941,0.012151719,0.0007176901,0.00545993,0.0021174648,0.0041382695,0.03546017],"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.00002793993,0.000031122254,0.0011057057,0.000080743004,0.000004044931,0.00003086328,0.0000614568,0.00011310613,0.00021653723,0.0018389067,0.96156496,0.03492466],"study_design_scores_gemma":[0.000011497848,0.000053410313,0.0071436623,0.0003863982,0.000012887398,0.000057012,0.00025696625,0.0004444647,0.0007847495,0.0018319428,0.98897344,0.00004354473],"about_ca_topic_score_codex":0.02978699,"about_ca_topic_score_gemma":0.058394074,"teacher_disagreement_score":0.056182288,"about_ca_system_score_codex":0.0045742337,"about_ca_system_score_gemma":0.014189458,"threshold_uncertainty_score":0.18794852},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039981306,0.0019293958,0.9463609,0.0006768339,0.00046060863,0.000201182,0.00035947625,0.0003204613,0.00970986],"genre_scores_gemma":[0.8000876,0.0024438642,0.18853267,0.0002956921,0.00068405445,0.00021736127,0.00041111998,0.00012417893,0.0072035315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855095,0.00038066963,0.000102247635,0.00033522784,0.0003833385,0.00024758765],"domain_scores_gemma":[0.99677235,0.0014830865,0.00060261687,0.0003113869,0.0004799807,0.00035068314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002167663,0.0013128282,0.001271169,0.001016596,0.0009650104,0.0017113286,0.0021174739,0.0010340209,0.0040636756],"category_scores_gemma":[0.006537976,0.00042283465,0.0006821738,0.0013346818,0.00071657955,0.0030099899,0.0016913611,0.001438773,0.0006596127],"study_design_candidate":"theoretical_or_conceptual","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.0003300821,0.00014757723,0.002407513,0.00038057312,0.00007440562,0.00029070268,0.00020347584,0.7801869,0.005778042,0.12302731,0.0042647943,0.08290861],"study_design_scores_gemma":[0.00002650992,0.00018169309,0.00050157355,0.000022178509,0.00002979559,0.0001834889,0.00006359903,0.94611675,0.001811018,0.044208992,0.0068259235,0.000028621473],"about_ca_topic_score_codex":0.0015903005,"about_ca_topic_score_gemma":0.0012081331,"teacher_disagreement_score":0.0040636756,"about_ca_system_score_codex":0.0015485766,"about_ca_system_score_gemma":0.0017960311,"threshold_uncertainty_score":0.013594329},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08328893,0.0022832174,0.91190684,0.00028571798,0.000072194736,0.00007070026,0.00004891896,0.00027965353,0.0017639485],"genre_scores_gemma":[0.9484286,0.0011753244,0.04882926,0.00008364632,0.00006150648,0.00003451342,0.000060655893,0.000030719104,0.0012958418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992793,0.00014896202,0.000049957354,0.00010898461,0.0002457032,0.0001670362],"domain_scores_gemma":[0.9983542,0.0005695395,0.00020943658,0.00023270097,0.0005369374,0.00009715297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00106193,0.00056514505,0.00084208284,0.0007736528,0.0006847245,0.0015344773,0.0012454896,0.0006857576,0.00040389737],"category_scores_gemma":[0.0037907893,0.0002601294,0.00033016436,0.0012022405,0.0005882739,0.0017617028,0.0009941933,0.0005843502,0.00012224008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060135225,0.0001535059,0.00631505,0.00059297646,0.00016775701,0.00083201996,0.00060436636,0.61539465,0.082761325,0.10363723,0.0037323239,0.18520747],"study_design_scores_gemma":[0.000014434369,0.0001298142,0.00039343775,0.000015977816,0.000044671327,0.00022049082,0.000107836124,0.9789571,0.009353311,0.008734611,0.0020035445,0.000024776327],"about_ca_topic_score_codex":0.0048182937,"about_ca_topic_score_gemma":0.004783721,"teacher_disagreement_score":0.0048182937,"about_ca_system_score_codex":0.0013424673,"about_ca_system_score_gemma":0.0017222312,"threshold_uncertainty_score":0.009740293},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11601033,0.00052436296,0.88042456,0.0004478265,0.00006717195,0.00004640785,0.000034483834,0.0005457306,0.0018989817],"genre_scores_gemma":[0.97110724,0.000091482245,0.027589533,0.000108630906,0.000016265332,0.00003477779,0.000027494787,0.000022910293,0.0010015431],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995509,0.0001565205,0.00001939607,0.00006902917,0.0000820408,0.00012198843],"domain_scores_gemma":[0.9982645,0.0011899963,0.00015790097,0.00006940567,0.00022098512,0.00009723554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015704174,0.00056841766,0.0006579737,0.00021965474,0.00031820635,0.00047355043,0.0008707138,0.0006132945,0.0013233337],"category_scores_gemma":[0.004349368,0.0002430247,0.00021060075,0.0002549629,0.00070187537,0.00083898887,0.0007442052,0.0010797314,0.00013717035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001583925,0.0001011544,0.00079240906,0.000035149173,0.00002007993,0.000034479483,0.000030082234,0.9619443,0.0018210838,0.003672994,0.00065548485,0.030734446],"study_design_scores_gemma":[0.0000064460964,0.00001871128,0.000038518192,0.0000011369955,0.0000018702673,0.000002500719,0.0000023715447,0.9983412,0.00025794015,0.0012748758,0.00005348139,0.0000010454962],"about_ca_topic_score_codex":0.0059829354,"about_ca_topic_score_gemma":0.0044488003,"teacher_disagreement_score":0.0059829354,"about_ca_system_score_codex":0.0010970399,"about_ca_system_score_gemma":0.0015978052,"threshold_uncertainty_score":0.011896193},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028470058,0.00012126428,0.9693201,0.00013144423,0.000035695146,0.00004963197,0.000015376263,0.0001966085,0.0016597285],"genre_scores_gemma":[0.91791433,0.00007947855,0.08056362,0.00007966797,0.000028615144,0.000095151045,0.000031443717,0.000021528564,0.0011860535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995828,0.00016434534,0.00002005765,0.00007637521,0.00009307197,0.00006339317],"domain_scores_gemma":[0.99883825,0.0006164227,0.00016932219,0.000075823846,0.0002244569,0.000075809454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012486926,0.0005271575,0.00071112596,0.00029763905,0.0005731428,0.00055368163,0.0011540189,0.0005434129,0.0011368039],"category_scores_gemma":[0.0023908939,0.00024701585,0.00028117545,0.00032797366,0.0006426806,0.000600216,0.0007656398,0.00061735715,0.00019577716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052566807,0.00004594146,0.0004340602,0.000020115003,0.00001559809,0.000025261164,0.000029825165,0.9726282,0.001002511,0.0033211114,0.00039336478,0.022031348],"study_design_scores_gemma":[0.000007067771,0.000014228464,0.000029969138,7.497127e-7,0.0000014333244,0.000003465797,0.000002242087,0.99915826,0.00013037755,0.00054459163,0.00010625539,0.0000012864864],"about_ca_topic_score_codex":0.005030986,"about_ca_topic_score_gemma":0.0037487028,"teacher_disagreement_score":0.005030986,"about_ca_system_score_codex":0.0008325883,"about_ca_system_score_gemma":0.0011946087,"threshold_uncertainty_score":0.010003388},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09760363,0.0003395213,0.8870131,0.0006398939,0.000078616016,0.000094180294,0.00015396043,0.00030502994,0.013772058],"genre_scores_gemma":[0.9794446,0.00013584111,0.015198249,0.00007099719,0.0000374648,0.00014103274,0.00007126948,0.000034818677,0.0048657293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877983,0.00038095884,0.000042276675,0.00033183832,0.00021507594,0.00025007228],"domain_scores_gemma":[0.99843365,0.00088143005,0.0002656744,0.000095204516,0.00021529644,0.00010872407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014828227,0.0011025891,0.0016963691,0.00047371365,0.0006195221,0.0015059393,0.0011468765,0.0011588213,0.0021219754],"category_scores_gemma":[0.0027485865,0.00067344046,0.00070781837,0.00064957904,0.0015897759,0.00086648157,0.0024340046,0.0011460558,0.00025208312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113239046,0.00003123562,0.00023330156,0.00005879809,0.00004745571,0.00008335323,0.00006792318,0.9735851,0.0015617954,0.017716508,0.00044779823,0.0060534854],"study_design_scores_gemma":[0.000023712897,0.000033664015,0.00009661921,0.0000028801046,0.0000067710066,0.0000065827367,0.000014282464,0.9928549,0.00016631755,0.0065809325,0.00020773086,0.0000056600807],"about_ca_topic_score_codex":0.008790752,"about_ca_topic_score_gemma":0.005457209,"teacher_disagreement_score":0.008790752,"about_ca_system_score_codex":0.0013911036,"about_ca_system_score_gemma":0.0014111963,"threshold_uncertainty_score":0.017479181},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25679338,0.0017031848,0.72865933,0.0008075085,0.00021732593,0.00029098266,0.00043477153,0.0031969778,0.007896569],"genre_scores_gemma":[0.9395615,0.00019140288,0.058579102,0.00017296559,0.00003381069,0.00006059984,0.00015412469,0.00013862648,0.0011078062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992322,0.00015831034,0.000029295756,0.00014359878,0.00018415919,0.00025242637],"domain_scores_gemma":[0.9983931,0.00076313823,0.0001669113,0.00016005387,0.0003008377,0.00021593254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011956932,0.0012198729,0.0007035053,0.00047591372,0.00075983634,0.0011206255,0.0014001929,0.00070317695,0.001899474],"category_scores_gemma":[0.0039717928,0.00029810792,0.00030722772,0.00062852487,0.00058740185,0.001362786,0.0010104174,0.0009168639,0.00024437907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036537927,0.00016775505,0.0020437664,0.00012761085,0.00003267331,0.00012537271,0.00008390645,0.8929957,0.013398359,0.0053820587,0.004200712,0.081076786],"study_design_scores_gemma":[0.000019698029,0.000095311094,0.00029461266,0.000006114491,0.0000071143413,0.000030502151,0.00004496299,0.9940644,0.002086646,0.0026197883,0.0007237163,0.0000071284817],"about_ca_topic_score_codex":0.009252915,"about_ca_topic_score_gemma":0.011667925,"teacher_disagreement_score":0.009252915,"about_ca_system_score_codex":0.0016593972,"about_ca_system_score_gemma":0.0024995261,"threshold_uncertainty_score":0.018398106},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40401876,0.0009413742,0.59003514,0.0007677024,0.00011358568,0.0001374046,0.00005890741,0.00041946722,0.0035076789],"genre_scores_gemma":[0.9853204,0.00013768306,0.01392047,0.000033584376,0.000026196876,0.0000247439,0.000015281903,0.000021744707,0.00049991347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990884,0.00035021626,0.000047942263,0.0001492515,0.00018841049,0.00017571622],"domain_scores_gemma":[0.9933056,0.0046976325,0.0010937453,0.0002178261,0.00039774564,0.00028742355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022519813,0.0007067106,0.0006754456,0.0006986797,0.00066463224,0.0008406258,0.0008846973,0.00069718214,0.00073120644],"category_scores_gemma":[0.0074097305,0.00035579223,0.00023562327,0.0006213919,0.0009456087,0.0016925733,0.0007100046,0.0007418363,0.00009174413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015773467,0.00006493154,0.0011702953,0.00006302991,0.000023455432,0.00007239321,0.00007917281,0.9721248,0.0054524336,0.004901461,0.000336769,0.015553632],"study_design_scores_gemma":[0.000013199778,0.00006171993,0.00038869536,0.000004254949,0.0000078101075,0.00002695226,0.000032896394,0.99321014,0.0015819535,0.004403864,0.00026223107,0.00000632255],"about_ca_topic_score_codex":0.0037608016,"about_ca_topic_score_gemma":0.0022557965,"teacher_disagreement_score":0.0037608016,"about_ca_system_score_codex":0.0017856711,"about_ca_system_score_gemma":0.0009202374,"threshold_uncertainty_score":0.012955964},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1608116,0.005016887,0.82679635,0.0005486992,0.000083900144,0.00013498988,0.00015794157,0.00034395282,0.0061057545],"genre_scores_gemma":[0.9777158,0.0022304568,0.018319096,0.000067384026,0.000055829925,0.0000857458,0.00009022303,0.00003563294,0.0013999415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871385,0.00035765208,0.00006628966,0.00018564974,0.00046261333,0.00021383916],"domain_scores_gemma":[0.9926237,0.005427542,0.00075954996,0.00027597262,0.00083702663,0.000076252385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029448408,0.0009952072,0.0009285428,0.000868024,0.0004318912,0.0010985453,0.0009261157,0.0008320112,0.0006912355],"category_scores_gemma":[0.011778353,0.00028568457,0.00038573032,0.0011512877,0.0009810718,0.0019927495,0.0011506446,0.0007584582,0.00016858056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015159872,0.000053484644,0.0016990844,0.00013905499,0.000036271027,0.000112965536,0.00006422437,0.9717246,0.0034688932,0.007471827,0.0002838494,0.014794148],"study_design_scores_gemma":[0.0000035797211,0.00006492052,0.00042580743,0.000009993133,0.000016708827,0.000065554166,0.000024970244,0.9963716,0.0013609208,0.0014850026,0.00016113125,0.000009895226],"about_ca_topic_score_codex":0.0028661308,"about_ca_topic_score_gemma":0.0017740501,"teacher_disagreement_score":0.0029448408,"about_ca_system_score_codex":0.0015623374,"about_ca_system_score_gemma":0.0010516569,"threshold_uncertainty_score":0.015573978},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001388364,0.0076762415,0.0005087562,0.03542338,0.95176315,0.000030873653,0.00009510135,0.0000959914,0.0042677275],"genre_scores_gemma":[0.00089814456,0.006105516,0.00015592505,0.01095159,0.9750817,0.00001829599,0.000055281205,0.000029965317,0.0067036413],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979851,0.00025721133,0.00026140735,0.00034374787,0.0009394251,0.00021309417],"domain_scores_gemma":[0.98818296,0.0040346314,0.0007841709,0.00041957854,0.0046076765,0.0019710087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030875143,0.002002585,0.002481638,0.0020621016,0.0016266211,0.0066178907,0.0032458308,0.010275326,0.015857205],"category_scores_gemma":[0.00964027,0.0007195673,0.0019522541,0.0015136228,0.0019053675,0.002956722,0.0009984748,0.011731049,0.0096309325],"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.00005857818,0.000031669468,0.00009896025,0.00030363354,0.000027331187,0.00016788878,0.000009116546,0.00010035888,0.00014225414,0.0009854132,0.984327,0.013747842],"study_design_scores_gemma":[0.0000321774,0.00005575834,0.00048873766,0.0002717985,0.00004487467,0.00030581985,0.000026908001,0.0005057026,0.00019379913,0.001741635,0.9963082,0.000024570723],"about_ca_topic_score_codex":0.0007702796,"about_ca_topic_score_gemma":0.0016330789,"teacher_disagreement_score":0.015857205,"about_ca_system_score_codex":0.001560826,"about_ca_system_score_gemma":0.001304649,"threshold_uncertainty_score":0.053047597},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10767043,0.0012669131,0.8877129,0.00012161745,0.000068532056,0.00005945005,0.00011757579,0.0005867655,0.002395812],"genre_scores_gemma":[0.9447988,0.0003165731,0.054275267,0.000042273114,0.000020111474,0.00003431183,0.00007681847,0.000034846013,0.0004009461],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957114,0.00009750666,0.000027730623,0.000061245715,0.0001230237,0.00011941799],"domain_scores_gemma":[0.9991246,0.00032479494,0.00011680602,0.000115466544,0.00022788259,0.00009050817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070168974,0.0007660646,0.0006525559,0.00062120653,0.0005904633,0.0008557771,0.0010153198,0.000364967,0.0007260965],"category_scores_gemma":[0.0018266559,0.00023201005,0.00041539993,0.00058683363,0.0005347495,0.0014046951,0.0008905656,0.0005235226,0.00011503029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022284215,0.00003947923,0.0016275728,0.00014619659,0.00006108054,0.00030305795,0.00021592241,0.8722375,0.028478201,0.023704324,0.0013123406,0.0716515],"study_design_scores_gemma":[0.0000063171483,0.00005501028,0.0001584114,0.000010505738,0.000016509823,0.000054886088,0.000053237665,0.9893339,0.0039260066,0.0057051936,0.0006690137,0.000010914346],"about_ca_topic_score_codex":0.007940706,"about_ca_topic_score_gemma":0.009662698,"teacher_disagreement_score":0.007940706,"about_ca_system_score_codex":0.0010952277,"about_ca_system_score_gemma":0.0013090039,"threshold_uncertainty_score":0.015788972},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039366927,0.00069236057,0.95517665,0.00052432704,0.00010923708,0.000034862467,0.00008737666,0.00036518602,0.0036430599],"genre_scores_gemma":[0.95524496,0.00027864648,0.0395146,0.00022372372,0.00006866682,0.00006715758,0.00009484774,0.000045862525,0.004461502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971586,0.0000758229,0.000012028865,0.00006792587,0.000052762967,0.00007558991],"domain_scores_gemma":[0.999218,0.00044218192,0.00008422896,0.000039723553,0.00015274194,0.00006315236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072068797,0.00062564056,0.00103673,0.0002829155,0.0003090656,0.00069197797,0.001249854,0.00086019095,0.0016878367],"category_scores_gemma":[0.0020579854,0.0003887535,0.000392394,0.0003788493,0.00068725063,0.00076149125,0.00078159507,0.001248343,0.00020659753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038675964,0.000033976372,0.00046851797,0.00002522248,0.00002278229,0.000035752233,0.000018501973,0.97780013,0.0006285369,0.005570879,0.0007508458,0.014606224],"study_design_scores_gemma":[0.0000020754135,0.000005577168,0.000025049563,0.0000010748226,0.000002048638,0.0000024632707,0.0000014010591,0.9988086,0.000050697297,0.001038172,0.00006176774,0.0000011009579],"about_ca_topic_score_codex":0.01209377,"about_ca_topic_score_gemma":0.011488898,"teacher_disagreement_score":0.01209377,"about_ca_system_score_codex":0.0014045627,"about_ca_system_score_gemma":0.0013597497,"threshold_uncertainty_score":0.024046779},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1478481,0.0009061378,0.84634066,0.000722931,0.00018304173,0.0000632562,0.00006161229,0.0008119044,0.0030622957],"genre_scores_gemma":[0.9687613,0.00008965849,0.029591067,0.00018468678,0.000028337901,0.00004041888,0.00005239708,0.00003894875,0.0012131535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956685,0.00014252112,0.000018284121,0.000103382314,0.00006829505,0.000100783116],"domain_scores_gemma":[0.99836427,0.0010721158,0.00016974988,0.000072556795,0.00020800869,0.00011334956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014308153,0.00096692337,0.0009685825,0.00032336186,0.00034710896,0.0005741294,0.001133785,0.00092661957,0.0008892959],"category_scores_gemma":[0.0038884934,0.00044193948,0.0003575491,0.00029808033,0.00069407426,0.00088114047,0.0007716593,0.0011813994,0.00013521397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007585152,0.00005134182,0.00069256424,0.0000328851,0.00003522287,0.000050157363,0.00002078409,0.97974753,0.0012087717,0.0015799267,0.00042716562,0.016077766],"study_design_scores_gemma":[0.000004116968,0.0000156345,0.000047159177,0.0000017632999,0.00000269368,0.0000035774842,0.0000021370345,0.9989477,0.00017847745,0.00074241456,0.000052936244,0.0000014938825],"about_ca_topic_score_codex":0.0057640024,"about_ca_topic_score_gemma":0.005466757,"teacher_disagreement_score":0.0057640024,"about_ca_system_score_codex":0.0007656133,"about_ca_system_score_gemma":0.0010595522,"threshold_uncertainty_score":0.0114609},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008791268,0.004658413,0.00042035696,0.01675622,0.9761331,0.000020199428,0.000055707023,0.00005129393,0.0018167554],"genre_scores_gemma":[0.0008288808,0.0045953607,0.00019318436,0.006312625,0.9818346,0.00001820173,0.0000396815,0.00004429418,0.0061331335],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99634403,0.00045350633,0.0004640706,0.00053642207,0.0019001407,0.00030182072],"domain_scores_gemma":[0.9777295,0.006308687,0.001371043,0.0005606106,0.011089753,0.002940383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004941084,0.0021635632,0.002545261,0.0030595455,0.0020399322,0.005909408,0.0026040645,0.007911115,0.014056476],"category_scores_gemma":[0.013298236,0.00064785714,0.002120412,0.0014198492,0.002055841,0.002934052,0.0009821797,0.010252007,0.007880338],"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.000043432043,0.000021249467,0.000061075414,0.00028921347,0.000022051301,0.00013937741,0.0000115477715,0.00010315331,0.0001890166,0.00094321737,0.9895913,0.008585418],"study_design_scores_gemma":[0.000039829007,0.00008216676,0.0004574242,0.00038585655,0.000060985494,0.00038914534,0.000039375347,0.0006200661,0.00036121294,0.0025517757,0.99497885,0.0000333353],"about_ca_topic_score_codex":0.000844648,"about_ca_topic_score_gemma":0.0020851733,"teacher_disagreement_score":0.014056476,"about_ca_system_score_codex":0.0018763035,"about_ca_system_score_gemma":0.002927514,"threshold_uncertainty_score":0.047023594},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067301996,0.0019635335,0.9264482,0.0005103309,0.00013279718,0.000074922864,0.00006774109,0.000095782045,0.0034047067],"genre_scores_gemma":[0.89592755,0.0013706022,0.097968616,0.00014436821,0.00024736076,0.00008881086,0.000050301947,0.00006306137,0.004139389],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828404,0.00062238285,0.000083640414,0.00038251217,0.00032378003,0.00030352513],"domain_scores_gemma":[0.9933828,0.0050049885,0.00064339273,0.00031404567,0.00035335447,0.00030147925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004033131,0.0010472838,0.0017402297,0.000738519,0.0010805015,0.001697223,0.001735607,0.0014742076,0.0015135463],"category_scores_gemma":[0.008811772,0.0005847009,0.0004566142,0.0015126028,0.0010981425,0.003154624,0.0016075409,0.0011730576,0.00023676366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037796854,0.00019927327,0.002035561,0.00017931113,0.00006917221,0.00019923411,0.00020477427,0.86844194,0.005094773,0.05126879,0.0011875163,0.07074168],"study_design_scores_gemma":[0.000021183629,0.000121920806,0.00048589054,0.000016542002,0.000023952378,0.00013844836,0.00005993176,0.9630687,0.0019427533,0.03275416,0.0013464101,0.000020030182],"about_ca_topic_score_codex":0.0014949413,"about_ca_topic_score_gemma":0.0013768453,"teacher_disagreement_score":0.004033131,"about_ca_system_score_codex":0.0016142881,"about_ca_system_score_gemma":0.0015338259,"threshold_uncertainty_score":0.021329522},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6132617,0.004996134,0.3085702,0.0048754583,0.00037192774,0.00009128129,0.002443302,0.0006624223,0.06472763],"genre_scores_gemma":[0.9913454,0.00075516314,0.002723941,0.0002579193,0.00017210716,0.00005668492,0.0002874248,0.000026625874,0.0043746666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988348,0.00034599894,0.000030208552,0.00013365246,0.00026203593,0.00039327887],"domain_scores_gemma":[0.99145526,0.0053796014,0.0009935251,0.0005137524,0.0010801828,0.00057768525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002281382,0.00092568557,0.0010587052,0.0012864347,0.0005942624,0.0015860806,0.0013228573,0.0012273963,0.0035957957],"category_scores_gemma":[0.012151875,0.00060797855,0.0005089047,0.0011717986,0.0022548372,0.0027837483,0.002310197,0.0014936158,0.00065299106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035698633,0.00007113194,0.003099177,0.00022742561,0.000086266555,0.0009520072,0.00037215152,0.59518963,0.004588528,0.38391247,0.0056049237,0.0055392594],"study_design_scores_gemma":[0.00002785451,0.000046756515,0.0010888216,0.00004538232,0.000021116537,0.0002358648,0.00009572775,0.89966947,0.0009814064,0.09668006,0.0010468453,0.000060654405],"about_ca_topic_score_codex":0.0042290688,"about_ca_topic_score_gemma":0.0015727982,"teacher_disagreement_score":0.0042290688,"about_ca_system_score_codex":0.001711542,"about_ca_system_score_gemma":0.0009818592,"threshold_uncertainty_score":0.0124182105},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035405684,0.0023519734,0.952355,0.0012216864,0.00011461264,0.00006907107,0.00008725208,0.00007508764,0.008319537],"genre_scores_gemma":[0.8807787,0.0029564109,0.10924145,0.00032888268,0.00018412193,0.0001586522,0.000062157545,0.000102654376,0.0061870683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990631,0.0004440472,0.000029135952,0.00015904618,0.0001596778,0.00014500377],"domain_scores_gemma":[0.99729,0.0020373447,0.00024537693,0.000107039305,0.00020229981,0.00011794823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018221716,0.0009362583,0.0012886659,0.0006839774,0.00041410487,0.0016102216,0.0012337276,0.001200874,0.0022384077],"category_scores_gemma":[0.008064874,0.0005160233,0.0004955768,0.0010374537,0.0012531953,0.0029801938,0.0011552244,0.0010706909,0.000217899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012313246,0.00006752773,0.00048749393,0.00013716808,0.00004497189,0.000099820754,0.00008349392,0.90435654,0.0025185226,0.07344354,0.001274618,0.017363163],"study_design_scores_gemma":[0.000008688552,0.000043619577,0.00015068724,0.000014647713,0.000012046582,0.000037664624,0.0000452383,0.97155917,0.0006457234,0.026743386,0.0007296101,0.000009400929],"about_ca_topic_score_codex":0.0015904156,"about_ca_topic_score_gemma":0.0011375957,"teacher_disagreement_score":0.0022384077,"about_ca_system_score_codex":0.0014195868,"about_ca_system_score_gemma":0.0011262225,"threshold_uncertainty_score":0.010299861},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03794235,0.0007541099,0.9565104,0.00048586528,0.000114539565,0.000036268353,0.0000853509,0.00037512265,0.0036958207],"genre_scores_gemma":[0.95669067,0.00028742172,0.038188472,0.00022821043,0.00006646549,0.00006817794,0.00009294802,0.00004374004,0.0043339264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997069,0.00007391776,0.000012524879,0.000069605856,0.00005669785,0.000080283506],"domain_scores_gemma":[0.9992416,0.00041609159,0.0000834248,0.000037296322,0.00015955958,0.00006213111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071027427,0.00065207377,0.001079921,0.00028145761,0.00031790862,0.0006851814,0.0013193092,0.00086097495,0.0017369955],"category_scores_gemma":[0.0019312239,0.00039198386,0.00040487287,0.00038828497,0.0006706588,0.0007588038,0.00077740307,0.0012578837,0.00021544495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039597173,0.000035930683,0.00047674726,0.000027433285,0.000023769122,0.000040182164,0.000019741843,0.9769713,0.0006904141,0.0049581127,0.00075756205,0.015959123],"study_design_scores_gemma":[0.0000021458702,0.000006104912,0.00002472704,0.0000011094473,0.0000022323568,0.0000027086894,0.0000014849472,0.9989825,0.000052416934,0.000861741,0.000061698425,0.0000011621199],"about_ca_topic_score_codex":0.012964747,"about_ca_topic_score_gemma":0.012668838,"teacher_disagreement_score":0.012964747,"about_ca_system_score_codex":0.0013548861,"about_ca_system_score_gemma":0.0013937372,"threshold_uncertainty_score":0.025778592},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022269536,0.00015836832,0.97474253,0.0001890732,0.000049452967,0.00004019386,0.000044029875,0.0005389559,0.0019679025],"genre_scores_gemma":[0.9554911,0.00011902622,0.04271785,0.00014829816,0.000035344838,0.00007936194,0.00007823325,0.000056870704,0.0012738949],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987363,0.0002661151,0.00007211712,0.00040494552,0.0003619498,0.00015851966],"domain_scores_gemma":[0.9970119,0.0013419887,0.00054891634,0.00048117642,0.00042039357,0.00019572586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017660478,0.0006543622,0.00073798996,0.00066518516,0.00063444796,0.0012588222,0.0017165256,0.00059822015,0.0017548933],"category_scores_gemma":[0.006846575,0.0003440713,0.00046286115,0.0005347665,0.0013374608,0.0019990478,0.0023624136,0.0019391848,0.00032768017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004058076,0.00013902874,0.0017016177,0.00012558882,0.000058095582,0.00015092808,0.0003082861,0.8025354,0.01272935,0.10983101,0.0026672918,0.06934758],"study_design_scores_gemma":[0.0000090831345,0.00003467834,0.0000788361,0.0000036644415,0.0000033554281,0.000008695619,0.000007725124,0.9862234,0.0010027084,0.012158898,0.0004635022,0.0000055615988],"about_ca_topic_score_codex":0.0026270873,"about_ca_topic_score_gemma":0.0019975957,"teacher_disagreement_score":0.0026270873,"about_ca_system_score_codex":0.0010559618,"about_ca_system_score_gemma":0.0011918197,"threshold_uncertainty_score":0.009339809},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26544273,0.0054073506,0.72162163,0.00045841304,0.00023032042,0.00014114697,0.00022537158,0.0008764516,0.0055966],"genre_scores_gemma":[0.98823464,0.0005289928,0.010489037,0.00003383961,0.000028016535,0.000017633884,0.000063350046,0.000015758835,0.0005886611],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999081,0.00019022249,0.000045083234,0.00013508592,0.000250131,0.0002984218],"domain_scores_gemma":[0.9983303,0.0006446214,0.00020684913,0.00021281425,0.0005125435,0.000092890565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009473645,0.0007462391,0.0008032305,0.00070608215,0.0009315849,0.001503278,0.001558593,0.000712033,0.0005585214],"category_scores_gemma":[0.0034083512,0.00029688972,0.00026686155,0.001333542,0.00067542016,0.0020270352,0.0009791707,0.00050951866,0.00017151085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078709057,0.00011570304,0.0064249616,0.000674135,0.00013442463,0.00080524303,0.0005090613,0.7767847,0.034304474,0.04560734,0.003642934,0.13020985],"study_design_scores_gemma":[0.000013872138,0.00018794571,0.0007988977,0.000018928462,0.00005528356,0.0002558915,0.00023443528,0.97830325,0.007993691,0.008629026,0.003482515,0.000026185677],"about_ca_topic_score_codex":0.007394602,"about_ca_topic_score_gemma":0.009122414,"teacher_disagreement_score":0.007394602,"about_ca_system_score_codex":0.0017396815,"about_ca_system_score_gemma":0.001539057,"threshold_uncertainty_score":0.014703155},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0334515,0.0004320169,0.9628109,0.00024584873,0.00007044718,0.000031855852,0.000037022863,0.000121423844,0.0027989852],"genre_scores_gemma":[0.9622159,0.00026452544,0.035657268,0.00007602032,0.000048001686,0.00003799151,0.000043803007,0.000024850186,0.0016317298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995309,0.0001352267,0.000019599323,0.0001293786,0.00009670744,0.00008820945],"domain_scores_gemma":[0.99898,0.0005143171,0.00021304698,0.0000655677,0.00013203597,0.00009504002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010384416,0.00067638286,0.00080568815,0.00032233386,0.00041237945,0.0007518439,0.0010710638,0.0006604695,0.0010036138],"category_scores_gemma":[0.0024336595,0.0002923406,0.00027533082,0.00041909041,0.0006213481,0.0010592621,0.0009909912,0.0010434858,0.00014396154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006841456,0.00004548565,0.00074396824,0.000047553447,0.000018195344,0.000057639965,0.000042392716,0.96301866,0.0015513276,0.011198687,0.00069995236,0.022507692],"study_design_scores_gemma":[0.0000029315906,0.000012927804,0.00007381896,0.0000018184372,0.000002829721,0.0000072015437,0.0000049747055,0.9969188,0.00021970822,0.0025420452,0.00021060834,0.0000023270236],"about_ca_topic_score_codex":0.0025305022,"about_ca_topic_score_gemma":0.0025083274,"teacher_disagreement_score":0.0025305022,"about_ca_system_score_codex":0.0009704774,"about_ca_system_score_gemma":0.001089949,"threshold_uncertainty_score":0.0070413947},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06624761,0.0011903095,0.92913616,0.00029725375,0.00009332868,0.000053246757,0.00011690888,0.00016780461,0.002697487],"genre_scores_gemma":[0.97030926,0.00043073203,0.027819023,0.000073733776,0.00006222414,0.000044123954,0.000050104525,0.000028404682,0.0011823963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881905,0.00043855712,0.00004967084,0.00018999823,0.00025456888,0.0002481066],"domain_scores_gemma":[0.99675983,0.0022462497,0.00040117864,0.00016652324,0.00024199499,0.00018425957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018865964,0.0007675165,0.0011292208,0.00045632504,0.0005061781,0.0010322655,0.000685524,0.0006222527,0.0012810633],"category_scores_gemma":[0.004170092,0.00044426855,0.0003638392,0.0006980045,0.00075966225,0.0010184374,0.00094601425,0.0008446247,0.00021091041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109435496,0.0000361007,0.0007066836,0.00006014882,0.000030567204,0.00008036904,0.00006953172,0.9693638,0.002618816,0.013039574,0.0005121125,0.013372766],"study_design_scores_gemma":[0.000006505844,0.00003496789,0.00017220632,0.0000036405522,0.0000064993264,0.000017545035,0.000010951858,0.99422175,0.00068374834,0.004610339,0.00022647688,0.0000053873605],"about_ca_topic_score_codex":0.0027236652,"about_ca_topic_score_gemma":0.0024107413,"teacher_disagreement_score":0.0027236652,"about_ca_system_score_codex":0.00127897,"about_ca_system_score_gemma":0.001358266,"threshold_uncertainty_score":0.009977341},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0223001,0.00018664717,0.97485083,0.00014614855,0.00003361708,0.00004239316,0.000017246664,0.00014085737,0.0022821475],"genre_scores_gemma":[0.9576559,0.00017425333,0.040556498,0.0000721693,0.000035006597,0.0001338078,0.000032926637,0.000022233347,0.001317193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989567,0.00025544252,0.000060005877,0.00030903245,0.00026316187,0.00015565929],"domain_scores_gemma":[0.99851686,0.00060643203,0.00033392498,0.000104996325,0.00037059787,0.000067256624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010787675,0.0009249952,0.0008190641,0.00041075377,0.00060540484,0.0009780634,0.0012111063,0.000688954,0.0009747252],"category_scores_gemma":[0.0031682854,0.00053463964,0.00052425393,0.0004781368,0.00087800145,0.0013781696,0.0017294489,0.0008257417,0.00022059625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017176114,0.00012008678,0.001419232,0.00014573008,0.00008330425,0.00022492901,0.0003866141,0.9059374,0.01452134,0.014651495,0.0009429178,0.061395098],"study_design_scores_gemma":[0.0000042381926,0.00005444571,0.00010561968,0.000004435738,0.000009727677,0.000020602252,0.000019494832,0.99752504,0.0009807512,0.0010578247,0.00021264907,0.000005232865],"about_ca_topic_score_codex":0.0025287154,"about_ca_topic_score_gemma":0.0024451134,"teacher_disagreement_score":0.0025287154,"about_ca_system_score_codex":0.00070183125,"about_ca_system_score_gemma":0.0011576947,"threshold_uncertainty_score":0.005705118},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060037762,0.00023091119,0.93526316,0.00046607698,0.00004268825,0.000049574992,0.000051243493,0.00024508275,0.0036134988],"genre_scores_gemma":[0.97680265,0.0000996299,0.020741815,0.000064218264,0.000026276946,0.000087738714,0.00003778316,0.000019452833,0.0021203067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989813,0.00038297818,0.00003692668,0.00021436733,0.00024147404,0.0001429335],"domain_scores_gemma":[0.99726677,0.0017753165,0.00038541024,0.00016747102,0.00027744018,0.00012753044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016932011,0.0006201927,0.0011300612,0.00030407216,0.00055167696,0.00082783453,0.0010141506,0.0008946779,0.0015264243],"category_scores_gemma":[0.005224466,0.00036050173,0.00044483852,0.0003731754,0.001613234,0.0009752714,0.00112091,0.0011546881,0.00014046994],"study_design_candidate":"theoretical_or_conceptual","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.000032741365,0.0000169617,0.00023427815,0.000021701939,0.000015469497,0.000049551465,0.00003339758,0.97516406,0.00037145687,0.019369911,0.0001749811,0.004515468],"study_design_scores_gemma":[0.000008881322,0.000011256386,0.00004461597,0.0000015593845,0.0000018612872,0.000004368204,0.0000033996155,0.99349266,0.000077202785,0.006248633,0.00010311208,0.0000023193293],"about_ca_topic_score_codex":0.00935167,"about_ca_topic_score_gemma":0.0046679177,"teacher_disagreement_score":0.00935167,"about_ca_system_score_codex":0.0015708378,"about_ca_system_score_gemma":0.0014118871,"threshold_uncertainty_score":0.018594503},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0835347,0.00071808766,0.91066355,0.0004964635,0.000097763295,0.00008645115,0.00010008474,0.0002791109,0.0040238886],"genre_scores_gemma":[0.9770786,0.00019619557,0.021269504,0.00007938926,0.000026487009,0.000052812677,0.000048325088,0.000025623292,0.0012231075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995801,0.000094301366,0.000018943554,0.00011200039,0.000077811135,0.00011682963],"domain_scores_gemma":[0.99884975,0.00064142945,0.00023845329,0.000044067336,0.00013575403,0.00009048396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007004174,0.0008381846,0.00099219,0.00036016403,0.00042962638,0.00075841096,0.0008811279,0.00083736447,0.0013540514],"category_scores_gemma":[0.002329114,0.00043673304,0.00030472834,0.00033945986,0.00078731513,0.0008799654,0.00089630065,0.000896173,0.00017661307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053571523,0.000042414184,0.00062243815,0.00005324757,0.00001732956,0.00007190552,0.000037722697,0.9832371,0.0013568216,0.0031331517,0.0004968019,0.010877505],"study_design_scores_gemma":[0.0000045196994,0.000020650576,0.00009593482,0.0000034439754,0.0000038714347,0.000007356683,0.000009180327,0.9986449,0.00016609614,0.0009510418,0.000090899026,0.0000021984151],"about_ca_topic_score_codex":0.0064663105,"about_ca_topic_score_gemma":0.0046700896,"teacher_disagreement_score":0.0064663105,"about_ca_system_score_codex":0.0008704786,"about_ca_system_score_gemma":0.0014754407,"threshold_uncertainty_score":0.012857318},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099806525,0.00088995066,0.8951085,0.00046845298,0.00011158877,0.000060786642,0.000090043206,0.00034046892,0.0031236706],"genre_scores_gemma":[0.96234804,0.00022760718,0.035803434,0.00008103441,0.000039446044,0.000035897538,0.00006358511,0.000032945958,0.0013680377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956983,0.00009500657,0.000021054713,0.0001121031,0.00010326378,0.00009867125],"domain_scores_gemma":[0.998681,0.0006827039,0.00019393713,0.00008975206,0.00024235206,0.000110192545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000977106,0.0005482412,0.0007480733,0.0003292305,0.00044679618,0.0007867245,0.0010016365,0.00051901856,0.0009519604],"category_scores_gemma":[0.0037112,0.0002803732,0.00025880663,0.0005253742,0.00049816415,0.0009846353,0.00068247295,0.0008373892,0.0001375191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001542004,0.00006702234,0.0015034492,0.000048796308,0.00002449237,0.000041275358,0.000049634837,0.95397973,0.0026615597,0.008036571,0.0014089004,0.032024298],"study_design_scores_gemma":[0.0000026634611,0.000012288102,0.00008307148,0.0000012843866,0.0000033198655,0.0000058237347,0.0000038896346,0.9985287,0.00029690203,0.0009622529,0.00009808574,0.0000016642672],"about_ca_topic_score_codex":0.007693219,"about_ca_topic_score_gemma":0.0085507035,"teacher_disagreement_score":0.007693219,"about_ca_system_score_codex":0.0014715182,"about_ca_system_score_gemma":0.002176291,"threshold_uncertainty_score":0.015296876},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15145099,0.00024922006,0.8435411,0.0012334165,0.00010259271,0.00025110669,0.00018874205,0.00066381216,0.0023189613],"genre_scores_gemma":[0.9681901,0.000056614164,0.030431807,0.00013982947,0.000042096915,0.00009753843,0.00006204918,0.000028478114,0.00095147017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99307185,0.0024080283,0.00059348607,0.0014075319,0.0013082301,0.001210834],"domain_scores_gemma":[0.9777369,0.009813431,0.0028592027,0.005390993,0.0021607932,0.0020386316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013162588,0.0009496282,0.0020128004,0.0007479324,0.0019081396,0.002511196,0.0035360174,0.002334433,0.0021613324],"category_scores_gemma":[0.030917093,0.0005452569,0.0007181834,0.0014059707,0.0017630055,0.00710256,0.005217098,0.0025996915,0.0004174453],"study_design_candidate":"theoretical_or_conceptual","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.0041443054,0.0012187227,0.010325854,0.0004319097,0.00017359834,0.0012789082,0.0016405713,0.53566104,0.025477117,0.18757883,0.0068792757,0.22518998],"study_design_scores_gemma":[0.00007271265,0.0002359157,0.0006618413,0.000021230486,0.00002260159,0.00025463747,0.00013124813,0.93672967,0.0027618348,0.05753422,0.0015392859,0.000034807523],"about_ca_topic_score_codex":0.0011741013,"about_ca_topic_score_gemma":0.00082351954,"teacher_disagreement_score":0.013162588,"about_ca_system_score_codex":0.0017936289,"about_ca_system_score_gemma":0.003329742,"threshold_uncertainty_score":0.06961125},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021993896,0.0003275613,0.97440004,0.00031037585,0.000060049355,0.00008698171,0.0000798218,0.00059699704,0.0021443688],"genre_scores_gemma":[0.76552504,0.00020108932,0.22996926,0.0003369831,0.00010184667,0.0002791973,0.00029564576,0.00022060293,0.003070372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861073,0.00060382765,0.000055429708,0.00025052115,0.0003180601,0.0001613311],"domain_scores_gemma":[0.9949121,0.0037499594,0.00023414336,0.00044738105,0.00041672515,0.00023967648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027969785,0.0010257942,0.0017718055,0.00062080944,0.0004905959,0.0011788849,0.0019185535,0.0013588733,0.0040569883],"category_scores_gemma":[0.012424276,0.00062005053,0.0005792196,0.0005711069,0.0014599492,0.0022997994,0.0020157536,0.0023148453,0.0004952203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039828982,0.00016547185,0.0023039028,0.00016032149,0.00006130727,0.00013601598,0.00012745742,0.82708764,0.001995848,0.06422979,0.003993247,0.09934073],"study_design_scores_gemma":[0.000017015904,0.000022754037,0.00006771975,0.0000072178686,0.0000045653824,0.000013892732,0.000004893785,0.98493063,0.0004033507,0.014274757,0.00024886406,0.0000042874017],"about_ca_topic_score_codex":0.0036313152,"about_ca_topic_score_gemma":0.0046595973,"teacher_disagreement_score":0.0040569883,"about_ca_system_score_codex":0.0012499559,"about_ca_system_score_gemma":0.0023384965,"threshold_uncertainty_score":0.014792025},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0858823,0.00067155773,0.9077486,0.00078778487,0.00009935979,0.00008881642,0.00023118044,0.00030061288,0.0041898736],"genre_scores_gemma":[0.95947903,0.00043100442,0.035911288,0.0001274465,0.000057164892,0.00009178858,0.0001427226,0.000057556626,0.0037020321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988368,0.0003037381,0.0000661889,0.0002791301,0.00022734315,0.00028681208],"domain_scores_gemma":[0.9949557,0.0032207551,0.0007017943,0.00019032073,0.0006518593,0.0002795589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016201186,0.0010919003,0.0011777994,0.0009544261,0.00068985345,0.0012919571,0.0013104309,0.0011646692,0.0028584974],"category_scores_gemma":[0.007455271,0.00051961356,0.00048159715,0.00079246325,0.0012345886,0.002155731,0.0014251582,0.0014041214,0.0003305524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023869453,0.000065851986,0.0012918381,0.00013912907,0.000046719346,0.000250254,0.0001993835,0.9147424,0.0042532044,0.062181503,0.0014924983,0.015098538],"study_design_scores_gemma":[0.0000133072535,0.00003815999,0.00017284419,0.000009606315,0.000009951117,0.000049917988,0.000021867554,0.98571056,0.0006133866,0.013109064,0.0002389063,0.000012523204],"about_ca_topic_score_codex":0.004825156,"about_ca_topic_score_gemma":0.0023722,"teacher_disagreement_score":0.004825156,"about_ca_system_score_codex":0.00227304,"about_ca_system_score_gemma":0.0018808069,"threshold_uncertainty_score":0.016492128},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026547186,0.0006264607,0.96961874,0.0004126032,0.00010006762,0.000055030498,0.000081893995,0.00026424666,0.0022937271],"genre_scores_gemma":[0.857661,0.0008382043,0.13585867,0.00027302583,0.00019161681,0.00014318393,0.00014964791,0.00015118853,0.0047334977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988117,0.0003559914,0.00006370254,0.0002762603,0.00030085712,0.0001914271],"domain_scores_gemma":[0.9964799,0.002018093,0.00043218822,0.0003171494,0.000474,0.0002787047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021337385,0.0010421938,0.0012593487,0.0008831485,0.000629347,0.0012677327,0.0018564316,0.001113481,0.0019426561],"category_scores_gemma":[0.0076127434,0.00047648317,0.0004325995,0.0010635894,0.0014589945,0.0034919658,0.0014470271,0.0015003284,0.00030905823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014770702,0.000079380625,0.00066932937,0.0000935724,0.000036222682,0.00006720364,0.00007902501,0.9158439,0.0023273116,0.041538943,0.0016352203,0.03748217],"study_design_scores_gemma":[0.0000049760597,0.00003836255,0.00008510495,0.0000056605218,0.0000049206155,0.000014688438,0.000008719633,0.98474115,0.00063000765,0.014136872,0.00032243054,0.00000708135],"about_ca_topic_score_codex":0.0027433035,"about_ca_topic_score_gemma":0.0021416864,"teacher_disagreement_score":0.0027433035,"about_ca_system_score_codex":0.0019843783,"about_ca_system_score_gemma":0.0018028377,"threshold_uncertainty_score":0.014397681},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.119953446,0.00023618896,0.87489593,0.00025131227,0.00007026044,0.00006219846,0.000054889373,0.00044398766,0.004031785],"genre_scores_gemma":[0.9819342,0.000040726492,0.017040402,0.000036919642,0.000011620362,0.000018783981,0.000024025721,0.000017658376,0.0008756984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965715,0.000076458586,0.000016164553,0.000088776105,0.0000643237,0.000096998985],"domain_scores_gemma":[0.9993113,0.0002618186,0.0001116851,0.00006244744,0.00014283299,0.000109880835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062312814,0.00046339663,0.0005168055,0.00026329755,0.0004601848,0.00056954677,0.0009407489,0.00037646614,0.0013463444],"category_scores_gemma":[0.0017877411,0.00020881201,0.00018268841,0.0002360586,0.00049923087,0.00066220935,0.0006875107,0.0006231893,0.00019462024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001736328,0.000085684056,0.0007139701,0.000025990144,0.0000126808845,0.000046906676,0.00005109212,0.95755917,0.0031537788,0.004876277,0.0006143126,0.03268649],"study_design_scores_gemma":[0.000003006603,0.000016164227,0.00005864468,7.0170415e-7,0.0000011273869,0.0000030065887,0.0000048202473,0.998744,0.00023698922,0.0008298177,0.00010020945,0.0000014665608],"about_ca_topic_score_codex":0.00508117,"about_ca_topic_score_gemma":0.0049871816,"teacher_disagreement_score":0.00508117,"about_ca_system_score_codex":0.0008160037,"about_ca_system_score_gemma":0.0010639025,"threshold_uncertainty_score":0.010103226},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23849845,0.0091287205,0.03747185,0.17869182,0.010877679,0.001592408,0.0058918092,0.002302634,0.5155446],"genre_scores_gemma":[0.7816273,0.002071021,0.02751939,0.011645628,0.00343782,0.0027310052,0.006246574,0.0016841168,0.16303721],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9411919,0.036700606,0.0012693062,0.0023324373,0.00993706,0.008568602],"domain_scores_gemma":[0.88670963,0.026008453,0.004438292,0.009377289,0.015917381,0.057549056],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.05827078,0.0005589145,0.00084098516,0.0030739373,0.022813657,0.011825116,0.002231492,0.0029465395,0.036103766],"category_scores_gemma":[0.060021996,0.0005826931,0.00060857396,0.0045062895,0.003503785,0.009774299,0.04073402,0.004814445,0.00794809],"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.0011343339,0.0006516612,0.02086431,0.0004707098,0.00007741204,0.0005851138,0.1385805,0.0005160338,0.0022471144,0.10360524,0.4727449,0.25852263],"study_design_scores_gemma":[0.00008719888,0.0002491871,0.013765391,0.00026599725,0.000009742263,0.00019779759,0.028805561,0.0002457158,0.00079394993,0.022476045,0.93300223,0.000101311],"about_ca_topic_score_codex":0.0057143704,"about_ca_topic_score_gemma":0.008031486,"teacher_disagreement_score":0.9977685,"about_ca_system_score_codex":0.004279862,"about_ca_system_score_gemma":0.012610258,"threshold_uncertainty_score":0.308169},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13752024,0.0005635665,0.8584449,0.00035056839,0.00007996901,0.0000701514,0.000060216353,0.00029457797,0.0026158076],"genre_scores_gemma":[0.9797743,0.00012803072,0.018914666,0.000059592247,0.000027399272,0.000028587137,0.000031576066,0.000014595299,0.0010212606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996112,0.000078780824,0.000029017578,0.00012132748,0.00008317375,0.000076434364],"domain_scores_gemma":[0.9988311,0.0006652633,0.0001633997,0.000092701615,0.0001822605,0.00006528939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009818419,0.0005413443,0.00082078617,0.00028359474,0.00043255478,0.0009730314,0.0009960718,0.00063791126,0.00090263924],"category_scores_gemma":[0.0028177288,0.00033750111,0.00028220812,0.00047645913,0.00047990892,0.0012713912,0.0009622662,0.0005917222,0.00012915715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023397991,0.0000961398,0.0016847156,0.000062382416,0.00003885451,0.00015414211,0.0001243585,0.9204046,0.007394906,0.007452138,0.00092031184,0.061433487],"study_design_scores_gemma":[0.0000049859486,0.000026983076,0.00016055263,0.0000017333261,0.0000065128947,0.000016096128,0.000009896432,0.9980262,0.0006279955,0.0009956023,0.00011984344,0.0000036610586],"about_ca_topic_score_codex":0.002359738,"about_ca_topic_score_gemma":0.0020845563,"teacher_disagreement_score":0.002359738,"about_ca_system_score_codex":0.00061091426,"about_ca_system_score_gemma":0.0006865842,"threshold_uncertainty_score":0.0051925182},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011439812,0.0002603678,0.9859309,0.00025031826,0.000056363817,0.000057085676,0.00005535108,0.00040726602,0.0015424308],"genre_scores_gemma":[0.7456163,0.00026608352,0.24892427,0.0003582451,0.00013520318,0.00028938192,0.0002249589,0.00017810095,0.004007357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991335,0.0003607175,0.000034456687,0.00017217996,0.00019734958,0.00010175984],"domain_scores_gemma":[0.99719125,0.0019029537,0.00019575677,0.00023020603,0.00029112818,0.00018864295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019373188,0.00093160453,0.0016799978,0.0006252388,0.00040412188,0.00094219984,0.0021928134,0.0011534991,0.0033991507],"category_scores_gemma":[0.007741715,0.0005312114,0.000532401,0.0005788562,0.0013368216,0.0017040961,0.00170141,0.002420574,0.0004022988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001757334,0.00015338532,0.0014532559,0.00010364435,0.000065459,0.000094753785,0.000086141285,0.8524188,0.0018358581,0.05179756,0.0032561524,0.0885593],"study_design_scores_gemma":[0.000009825643,0.00001908773,0.000037206035,0.000005184421,0.0000040834566,0.000008221322,0.0000022219544,0.9902166,0.0002353854,0.009242525,0.00021664565,0.0000030761703],"about_ca_topic_score_codex":0.0037031022,"about_ca_topic_score_gemma":0.004568234,"teacher_disagreement_score":0.0037031022,"about_ca_system_score_codex":0.0013212357,"about_ca_system_score_gemma":0.0019042207,"threshold_uncertainty_score":0.0113713145},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033120703,0.0003729427,0.96246797,0.00046519516,0.000058366266,0.0000659592,0.000045242825,0.0007020306,0.0027015365],"genre_scores_gemma":[0.76641196,0.00025454623,0.22866881,0.00037754953,0.00008734703,0.00027532564,0.00016406206,0.00027208816,0.0034883462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99677867,0.0014916449,0.00013684794,0.00057108357,0.0006219655,0.0003997748],"domain_scores_gemma":[0.9886207,0.008223229,0.0006222662,0.0013580166,0.00083484733,0.00034085862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048288167,0.0012314111,0.0019850621,0.0005385713,0.00067277113,0.0016482953,0.0025293722,0.0017840331,0.00343134],"category_scores_gemma":[0.028140055,0.0007238632,0.000926053,0.00060029235,0.0022473156,0.0041250223,0.0024883589,0.0035226,0.00063207065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045237222,0.00014384362,0.0010702019,0.0000996635,0.00007135309,0.000098845485,0.00012301483,0.91836494,0.0012256008,0.045947514,0.0012093068,0.03119329],"study_design_scores_gemma":[0.000015193513,0.0000481677,0.000039206476,0.0000060042908,0.0000041801413,0.000011924263,0.000005144678,0.98976433,0.0003832482,0.009585139,0.0001337072,0.0000038323556],"about_ca_topic_score_codex":0.0036095455,"about_ca_topic_score_gemma":0.0021161153,"teacher_disagreement_score":0.0048288167,"about_ca_system_score_codex":0.0018017867,"about_ca_system_score_gemma":0.0025012053,"threshold_uncertainty_score":0.02553749},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06375908,0.00057373266,0.92965096,0.0006610349,0.00012945879,0.000056981124,0.000058413112,0.0003509292,0.004759301],"genre_scores_gemma":[0.9855494,0.00013815875,0.012391713,0.000117132775,0.000029843131,0.000053898984,0.000038955717,0.000021478092,0.0016593968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994727,0.00019950132,0.000025940653,0.0001171301,0.00010489747,0.000079933474],"domain_scores_gemma":[0.9975078,0.0017084118,0.00028796998,0.0000871415,0.0002824742,0.00012616233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014825742,0.0010639243,0.0012269544,0.0003227108,0.00032619157,0.0011054813,0.0011846218,0.0012367882,0.0010504419],"category_scores_gemma":[0.0037809862,0.0004745638,0.0005045088,0.00034207126,0.00115606,0.00078705413,0.00091710285,0.001559183,0.00017085437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042596235,0.000019089553,0.0004125442,0.00002110147,0.000022692915,0.000046132813,0.000018743534,0.9939027,0.00032408797,0.0020085261,0.00018627642,0.002995428],"study_design_scores_gemma":[0.0000034599846,0.000006292186,0.000025304194,0.0000013989911,0.0000025309441,0.0000021332514,0.0000019948193,0.9994814,0.000039271894,0.00040611267,0.00002912442,0.000001098219],"about_ca_topic_score_codex":0.009357079,"about_ca_topic_score_gemma":0.0063238316,"teacher_disagreement_score":0.009357079,"about_ca_system_score_codex":0.0010600544,"about_ca_system_score_gemma":0.0010888351,"threshold_uncertainty_score":0.018605173},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17219083,0.0012331466,0.81556135,0.0006902932,0.00009798249,0.0001435517,0.00012443404,0.00036458485,0.009593872],"genre_scores_gemma":[0.9782185,0.00038209214,0.019652482,0.000051618583,0.000024531933,0.000052252304,0.000024379147,0.000021986236,0.0015721782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870765,0.0005118688,0.000036647136,0.00019206469,0.00031972173,0.000232034],"domain_scores_gemma":[0.99513716,0.003564516,0.00049659854,0.0003417133,0.0003363989,0.00012366174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002485204,0.0005238648,0.000531423,0.00083277945,0.0006381007,0.0010167578,0.00090027857,0.0005983599,0.0016812505],"category_scores_gemma":[0.0072032274,0.000304987,0.00046639258,0.00078680395,0.001023818,0.001979418,0.00096691825,0.00060925266,0.00018682156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030359178,0.00008318335,0.0012424242,0.00009439349,0.000030346864,0.00017412126,0.00013737132,0.8898251,0.004754056,0.083092675,0.0007176234,0.019545104],"study_design_scores_gemma":[0.00000881756,0.000044697477,0.00020017411,0.000005396836,0.000008225802,0.000034759843,0.000027946675,0.98982316,0.00056987494,0.009016774,0.00025334753,0.0000068560903],"about_ca_topic_score_codex":0.002700055,"about_ca_topic_score_gemma":0.003349575,"teacher_disagreement_score":0.002700055,"about_ca_system_score_codex":0.001507638,"about_ca_system_score_gemma":0.0013712341,"threshold_uncertainty_score":0.013143182},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0669573,0.0006505449,0.9267167,0.0005248857,0.00015507478,0.000049845785,0.00009502014,0.0004984629,0.004352236],"genre_scores_gemma":[0.98222244,0.00013342293,0.014952041,0.00011462804,0.000032593274,0.000042701875,0.000047410726,0.000018443392,0.0024363094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994715,0.000108343724,0.000021950258,0.00014688516,0.00008287678,0.00016842909],"domain_scores_gemma":[0.99923456,0.00037416135,0.00009282108,0.000041764546,0.00018759817,0.00006908397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007620964,0.0007316672,0.00083917874,0.00035251272,0.00052370003,0.00089238473,0.0019174143,0.001406359,0.0018903328],"category_scores_gemma":[0.002053511,0.00035984843,0.00047531142,0.0004180721,0.0009476217,0.0013540521,0.0011489416,0.001426957,0.00029571794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010598044,0.00005278562,0.0006130432,0.000062536994,0.0000346772,0.00016535757,0.00010812783,0.9533354,0.0025885983,0.014866679,0.0009039603,0.027162876],"study_design_scores_gemma":[0.0000032432872,0.000014091812,0.00003229301,0.0000016297746,0.000003473356,0.000007852562,0.000006153427,0.99763536,0.00018800463,0.0020023976,0.00010242615,0.0000029861585],"about_ca_topic_score_codex":0.012865649,"about_ca_topic_score_gemma":0.010043461,"teacher_disagreement_score":0.012865649,"about_ca_system_score_codex":0.0011546616,"about_ca_system_score_gemma":0.0011960497,"threshold_uncertainty_score":0.025581539},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05037809,0.0006733675,0.9442298,0.0008460195,0.00006965879,0.000059984206,0.00007255632,0.0003819698,0.0032885268],"genre_scores_gemma":[0.9383416,0.00027002502,0.057080057,0.00030189817,0.000073820665,0.00012294711,0.000113910784,0.00006807082,0.0036276234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995203,0.0001552635,0.000023387645,0.00012326428,0.000076998054,0.000100818404],"domain_scores_gemma":[0.99795353,0.0012575637,0.0002684384,0.000074893804,0.0003165941,0.00012903445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016573044,0.0011504896,0.0014524879,0.00058647577,0.00042853184,0.0008822045,0.0017987586,0.0015771007,0.0015145887],"category_scores_gemma":[0.004280157,0.00068951293,0.00048131536,0.0004975847,0.0011976999,0.0013438188,0.0012424439,0.0018236447,0.00021694021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027509428,0.000026560776,0.00047645834,0.00002329464,0.000017549808,0.000030213314,0.000025873444,0.9885388,0.00023555288,0.002441843,0.00030061777,0.00785566],"study_design_scores_gemma":[0.0000027659735,0.0000063400284,0.00002164896,0.0000016073349,0.0000019477282,0.0000016522872,0.000002094641,0.9991228,0.000036880312,0.00075720495,0.00004371821,0.0000011919277],"about_ca_topic_score_codex":0.0144246435,"about_ca_topic_score_gemma":0.009774581,"teacher_disagreement_score":0.0144246435,"about_ca_system_score_codex":0.00184109,"about_ca_system_score_gemma":0.0016819839,"threshold_uncertainty_score":0.028681397},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63478434,0.0032929003,0.32092023,0.0009703107,0.0007579892,0.00038694014,0.0024549868,0.015429752,0.021002492],"genre_scores_gemma":[0.9109255,0.00060809636,0.08060806,0.00025536158,0.00004617111,0.00016607062,0.0041080047,0.0009554148,0.0023272976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997773,0.00068822,0.0001486626,0.00037601258,0.0007252008,0.00028889583],"domain_scores_gemma":[0.99710256,0.0009523064,0.00015052437,0.00082286296,0.00079515536,0.0001765771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00295103,0.0013966458,0.00057473796,0.00086610805,0.00033879204,0.001320723,0.0020471243,0.0010383159,0.0031865204],"category_scores_gemma":[0.008633826,0.0002537576,0.00043316485,0.0011828475,0.0007191224,0.0019608214,0.001641959,0.0017235145,0.0012481402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010702652,0.00093121757,0.010964136,0.00080136606,0.00036376817,0.0002542888,0.0002179538,0.61534095,0.028800454,0.0100668045,0.023927454,0.3072614],"study_design_scores_gemma":[0.00007486424,0.0006525141,0.005579391,0.0000836763,0.000040872772,0.00008279749,0.00015557773,0.9314884,0.044004828,0.006844951,0.010950219,0.000041957683],"about_ca_topic_score_codex":0.0036085546,"about_ca_topic_score_gemma":0.0039991457,"teacher_disagreement_score":0.0036085546,"about_ca_system_score_codex":0.0010100425,"about_ca_system_score_gemma":0.00092080294,"threshold_uncertainty_score":0.015606701},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12665561,0.004090096,0.5914398,0.0015406396,0.007656598,0.0008659212,0.07676911,0.10342206,0.08756012],"genre_scores_gemma":[0.36014998,0.00089271745,0.37945402,0.0009405589,0.0006634904,0.0009415273,0.14899005,0.0123685,0.09559919],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99960643,0.00003395745,0.000017046274,0.00017808628,0.00010086489,0.000063733154],"domain_scores_gemma":[0.99941766,0.0000771033,0.000019262006,0.00017753633,0.00027529613,0.000033095555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094653893,0.0022953157,0.0009015176,0.0013130421,0.0005880612,0.0014358973,0.0020098458,0.001278008,0.03726442],"category_scores_gemma":[0.004913813,0.0006609462,0.0010395136,0.0012583301,0.00032629515,0.0016049691,0.0009936264,0.0018402536,0.021292761],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004971619,0.0002456213,0.003901022,0.00047187158,0.00034882835,0.00014125305,0.00007973738,0.14984234,0.011350782,0.006357052,0.37728998,0.44947433],"study_design_scores_gemma":[0.0001262158,0.00018776335,0.004374706,0.000126632,0.0001480601,0.00020940142,0.00009906244,0.848298,0.024436932,0.013478468,0.10842929,0.00008542477],"about_ca_topic_score_codex":0.0118035115,"about_ca_topic_score_gemma":0.021703675,"teacher_disagreement_score":0.03726442,"about_ca_system_score_codex":0.0011650537,"about_ca_system_score_gemma":0.0013966749,"threshold_uncertainty_score":0.12466198},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28797415,0.0003662495,0.70334536,0.00047425687,0.000056081022,0.00012593395,0.00019437476,0.0006703956,0.006793244],"genre_scores_gemma":[0.9751486,0.000063668034,0.02320783,0.00003306609,0.0000067799447,0.000035770398,0.00009085708,0.000032891883,0.0013805719],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996669,0.00005435664,0.000012565054,0.00007748214,0.0000591447,0.00012960963],"domain_scores_gemma":[0.9987213,0.0007092838,0.00014101899,0.00008547126,0.00019304517,0.00014998899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008701211,0.0007965265,0.00063050294,0.00047394374,0.00045341149,0.00093798555,0.0010140317,0.00077025243,0.0021119737],"category_scores_gemma":[0.0028702305,0.0004221413,0.00030838334,0.00036327983,0.0006586359,0.0011495486,0.0012461216,0.0008439248,0.00020205813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011559265,0.000036678364,0.0005112169,0.000027915805,0.00001025189,0.000044357887,0.00004459436,0.98099893,0.0030095798,0.0030259828,0.0002918675,0.011883055],"study_design_scores_gemma":[0.0000059027325,0.00003351817,0.000090134294,0.0000021690971,0.0000035779149,0.000007038814,0.000016759477,0.99744475,0.00075228803,0.0014767722,0.00016455135,0.0000026290618],"about_ca_topic_score_codex":0.004844812,"about_ca_topic_score_gemma":0.004219359,"teacher_disagreement_score":0.004844812,"about_ca_system_score_codex":0.0012536519,"about_ca_system_score_gemma":0.0014594891,"threshold_uncertainty_score":0.009633243},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06300944,0.0022355493,0.92550606,0.00047508295,0.0001744087,0.00010326753,0.00033002053,0.000300282,0.007865982],"genre_scores_gemma":[0.90759456,0.0014642649,0.087312974,0.00012128566,0.00020016218,0.000116834104,0.00033945162,0.00006117487,0.002789312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982364,0.00036848037,0.00013366247,0.00040495888,0.00065356924,0.00020294765],"domain_scores_gemma":[0.9938984,0.002487579,0.0013596319,0.0006687474,0.0013172369,0.0002684362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017129122,0.0009833481,0.0009204517,0.0016032768,0.0006125511,0.0014529271,0.0010917604,0.0008040741,0.0010041833],"category_scores_gemma":[0.0087655,0.0003705948,0.0006110234,0.0017598213,0.0006868496,0.0035408947,0.00179087,0.0009559555,0.00028170485],"study_design_candidate":"theoretical_or_conceptual","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.0002797479,0.000120941026,0.018789427,0.00055696146,0.00022660823,0.00055609184,0.00046212366,0.6648926,0.027049666,0.09073307,0.0042131324,0.19211963],"study_design_scores_gemma":[0.00000942139,0.00019638085,0.005321546,0.000045026227,0.0000658271,0.00040325834,0.00012972904,0.95595473,0.00899495,0.02271894,0.0060987393,0.000061416096],"about_ca_topic_score_codex":0.0019043249,"about_ca_topic_score_gemma":0.0018911859,"teacher_disagreement_score":0.0019043249,"about_ca_system_score_codex":0.0010669042,"about_ca_system_score_gemma":0.0011535452,"threshold_uncertainty_score":0.009058893},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41033733,0.0011434986,0.58361804,0.00071972376,0.0001563777,0.00008616089,0.000105667255,0.00034525842,0.0034879327],"genre_scores_gemma":[0.9947708,0.00013859366,0.0045475084,0.000036555033,0.000019460276,0.000016378057,0.0000130454655,0.000012278301,0.00044525164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983956,0.00052083936,0.00004850344,0.00017948338,0.00040935847,0.0004462291],"domain_scores_gemma":[0.9878982,0.008862621,0.0014936951,0.0003778317,0.0011164077,0.0002512084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003447016,0.00090822525,0.0010377562,0.0006575856,0.00064639054,0.0014708191,0.0011090407,0.00091336225,0.0011218687],"category_scores_gemma":[0.01255444,0.0004782503,0.0003266568,0.0008006949,0.0017431497,0.0017432742,0.0012875472,0.0011026999,0.00011504982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014321416,0.00004173935,0.0013291418,0.000059069363,0.000024488696,0.00021191432,0.000085472966,0.9809232,0.0028560704,0.009869736,0.00025529735,0.004200682],"study_design_scores_gemma":[0.0000051943657,0.000040324172,0.00022808649,0.0000031652962,0.0000061835995,0.000022545917,0.000025538273,0.99812156,0.0003539989,0.001145991,0.000040814793,0.0000066441894],"about_ca_topic_score_codex":0.0043826695,"about_ca_topic_score_gemma":0.0025366202,"teacher_disagreement_score":0.0043826695,"about_ca_system_score_codex":0.0013708652,"about_ca_system_score_gemma":0.0009911461,"threshold_uncertainty_score":0.018229783},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10402144,0.0015437892,0.89046675,0.0005348379,0.00009102221,0.00008166753,0.000118540775,0.000172756,0.0029692017],"genre_scores_gemma":[0.96130866,0.00076156476,0.03619769,0.00010855677,0.0000604127,0.000089668174,0.000075531134,0.000051040686,0.0013468163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984383,0.00042370998,0.00008733575,0.00036983262,0.0004614935,0.0002194015],"domain_scores_gemma":[0.9937536,0.004524524,0.0007541747,0.00029074692,0.0005302852,0.00014669198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020405524,0.0013489993,0.0009961126,0.0006489145,0.00058184424,0.0010337599,0.0010390383,0.00093119364,0.00077865156],"category_scores_gemma":[0.008308581,0.00047715654,0.00050120556,0.0008518147,0.0010249615,0.002447344,0.001099981,0.0009896363,0.000111239475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009650981,0.000040652278,0.001190143,0.00016760714,0.000058453814,0.00022909767,0.00008609002,0.9574161,0.006639683,0.012583609,0.0005061745,0.020985898],"study_design_scores_gemma":[0.000005108117,0.00008351148,0.0005396508,0.0000132525065,0.000019920852,0.00007999635,0.00002657065,0.9891242,0.00195934,0.007837913,0.0002980667,0.000012474119],"about_ca_topic_score_codex":0.0017522592,"about_ca_topic_score_gemma":0.0012455301,"teacher_disagreement_score":0.0020405524,"about_ca_system_score_codex":0.0013447906,"about_ca_system_score_gemma":0.001057369,"threshold_uncertainty_score":0.0107916},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011826967,0.054008543,0.8811944,0.012307028,0.0027183546,0.00014053927,0.0010402129,0.00056275196,0.036201168],"genre_scores_gemma":[0.45028746,0.07423427,0.44033664,0.0032690305,0.014087672,0.0006790554,0.0011926162,0.0009645213,0.0149486745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9924402,0.002617372,0.00071059086,0.0013740315,0.0025051138,0.00035270487],"domain_scores_gemma":[0.97039133,0.019678693,0.002737114,0.0034100062,0.0024813113,0.0013015111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008052833,0.0016741371,0.0023175462,0.008448303,0.0019935728,0.010551007,0.0025818038,0.0028508976,0.003214812],"category_scores_gemma":[0.032532472,0.0008117399,0.0013616198,0.009402356,0.010557933,0.032894626,0.0061527267,0.0059242975,0.0012122737],"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.000034676545,0.000021696675,0.00086683396,0.00021864021,0.000031904885,0.00005756423,0.0003490034,0.0028801558,0.0003467878,0.9601386,0.0038208247,0.031233318],"study_design_scores_gemma":[0.000008732285,0.00006002777,0.00051107415,0.0002604674,0.000037075122,0.00041181306,0.00035032592,0.017161602,0.00079056754,0.89752674,0.08281173,0.00006984666],"about_ca_topic_score_codex":0.0012568886,"about_ca_topic_score_gemma":0.00059443514,"teacher_disagreement_score":0.010551007,"about_ca_system_score_codex":0.0035956828,"about_ca_system_score_gemma":0.0021522453,"threshold_uncertainty_score":0.042587996},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008962411,0.0015554075,0.98384374,0.00035194037,0.0001639371,0.00010422742,0.00003766783,0.00014848117,0.0048322836],"genre_scores_gemma":[0.6126477,0.004854694,0.37103692,0.00069509714,0.000643352,0.00063841994,0.00017124494,0.00013462042,0.009177934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973116,0.000935396,0.00020550156,0.00041281426,0.00086375984,0.0002709035],"domain_scores_gemma":[0.99672514,0.0013713813,0.00039131974,0.00031129498,0.0010775466,0.00012335548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004004481,0.00090306514,0.0006953696,0.0009220778,0.00079446536,0.0022085032,0.0019662122,0.0013162863,0.0018089801],"category_scores_gemma":[0.006202941,0.00045526124,0.00044492717,0.0009828887,0.0013424584,0.0039407136,0.0014676228,0.0015221491,0.00060905237],"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.00014877481,0.000081278886,0.0008905342,0.0003773128,0.0000693637,0.0004532404,0.0005780642,0.24893932,0.010808058,0.65088576,0.0037745028,0.0829938],"study_design_scores_gemma":[0.00003145157,0.00022906098,0.00020979505,0.00006301052,0.0000688935,0.00045035564,0.00016643989,0.8624174,0.004764238,0.10845375,0.023097523,0.00004814383],"about_ca_topic_score_codex":0.0014663866,"about_ca_topic_score_gemma":0.001064881,"teacher_disagreement_score":0.004004481,"about_ca_system_score_codex":0.0018016221,"about_ca_system_score_gemma":0.0013234441,"threshold_uncertainty_score":0.021177948},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045130122,0.00092751154,0.9506391,0.0003473367,0.000081164486,0.00010505548,0.00013784558,0.00022184658,0.0024099867],"genre_scores_gemma":[0.8642424,0.0012389383,0.13073471,0.0001437838,0.00009385323,0.00019602393,0.0002137839,0.00010788809,0.0030286545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914956,0.00022449368,0.000046335725,0.00020692177,0.00019645985,0.0001762666],"domain_scores_gemma":[0.9959757,0.0027544817,0.0005331807,0.00017124011,0.00037027677,0.00019503823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016667593,0.0013446126,0.0011738737,0.00082305545,0.0007289988,0.0016477823,0.0017124254,0.0010099424,0.0011883548],"category_scores_gemma":[0.005571703,0.00070482097,0.00054708624,0.0013366338,0.0010123281,0.00209243,0.0015860111,0.001263708,0.00021345688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091902744,0.00005082273,0.00078136486,0.00011940992,0.000023827519,0.00010697019,0.00007958254,0.95974755,0.0022102417,0.01295315,0.000820544,0.023014681],"study_design_scores_gemma":[0.0000032951043,0.000028203462,0.00011595565,0.0000069720713,0.00000784324,0.000026795333,0.00002207475,0.99322236,0.00074523,0.005575176,0.00024036584,0.000005713936],"about_ca_topic_score_codex":0.00400944,"about_ca_topic_score_gemma":0.0038903113,"teacher_disagreement_score":0.00400944,"about_ca_system_score_codex":0.0020674712,"about_ca_system_score_gemma":0.0017533964,"threshold_uncertainty_score":0.015000641},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014233854,0.0003479695,0.9831392,0.00017626416,0.000034932826,0.000026321444,0.000017266273,0.00013199638,0.0018922293],"genre_scores_gemma":[0.92952365,0.00039636352,0.06705108,0.000167357,0.00008563849,0.000078946185,0.000055763452,0.000044883367,0.0025962768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994804,0.00011009706,0.000022419836,0.00016157882,0.00013544752,0.00009001642],"domain_scores_gemma":[0.99884784,0.0006400333,0.00016315376,0.000079521844,0.00018175186,0.00008776532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001152638,0.0009317367,0.0011350153,0.0004529607,0.00037823274,0.0009230118,0.0016914175,0.0009802342,0.0012187248],"category_scores_gemma":[0.0022994734,0.0003849073,0.00045678613,0.0005377308,0.0010058493,0.0014066778,0.0014670107,0.0014754975,0.0001605175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048132588,0.000046971527,0.00044053452,0.000053814103,0.00002773401,0.00006586002,0.000051265662,0.95470023,0.0018510591,0.010153725,0.0004887372,0.032071926],"study_design_scores_gemma":[0.0000023901691,0.000011319376,0.000030382607,0.0000021409712,0.0000032904154,0.000005734062,0.0000035583641,0.9976546,0.00018145876,0.0019764798,0.00012645857,0.000002201274],"about_ca_topic_score_codex":0.0035381736,"about_ca_topic_score_gemma":0.0029263785,"teacher_disagreement_score":0.0035381736,"about_ca_system_score_codex":0.0009670495,"about_ca_system_score_gemma":0.0009996931,"threshold_uncertainty_score":0.007035136},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07221026,0.0005123327,0.91733295,0.0006305548,0.00007968587,0.00013721256,0.00015681317,0.00008299219,0.0088572],"genre_scores_gemma":[0.9706632,0.0003716541,0.025765834,0.000112080874,0.000032092266,0.00010129826,0.00006276055,0.000024187486,0.0028670263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998803,0.0004394678,0.000047426416,0.0002491658,0.00020321355,0.00025768098],"domain_scores_gemma":[0.9974136,0.0016405587,0.0002875841,0.00009922901,0.00031997717,0.00023907382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016449358,0.0010205003,0.0010338239,0.00064162764,0.0007356138,0.0018424165,0.0013606766,0.0011069097,0.0020546673],"category_scores_gemma":[0.0047918004,0.00037023693,0.00065518473,0.0007885183,0.0014906944,0.0027153147,0.0017202605,0.0015225143,0.00013797922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013134399,0.000052594572,0.0009572257,0.000112463895,0.000057965804,0.00028783423,0.000117196825,0.8899004,0.0023002597,0.09400157,0.0011650958,0.010915927],"study_design_scores_gemma":[0.000009995141,0.000037417725,0.00010365513,0.0000062569115,0.000010875209,0.000035675617,0.000028525474,0.98400754,0.00022420233,0.01519912,0.00032927303,0.0000075006647],"about_ca_topic_score_codex":0.006507478,"about_ca_topic_score_gemma":0.004315079,"teacher_disagreement_score":0.006507478,"about_ca_system_score_codex":0.0019404644,"about_ca_system_score_gemma":0.0020670414,"threshold_uncertainty_score":0.014079094},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02511399,0.00206458,0.9436455,0.0009783062,0.00036525753,0.00007070361,0.00033656415,0.0003701761,0.027054979],"genre_scores_gemma":[0.9144425,0.001835023,0.035888847,0.00025739177,0.00020366027,0.00019095528,0.00021423455,0.000099885474,0.046867605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997744,0.0000613089,0.000007582817,0.000055279157,0.000053082822,0.000048321443],"domain_scores_gemma":[0.9996598,0.00018711899,0.000039733233,0.000029476081,0.00006394722,0.000019986157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045990857,0.0006941778,0.0006828874,0.00024818347,0.00036063165,0.0012669022,0.0012879358,0.0013066758,0.0067080846],"category_scores_gemma":[0.0013117103,0.00026054887,0.00045942172,0.000451605,0.0006571383,0.0010935966,0.00071989757,0.0013944793,0.0011104684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033780827,0.000030010495,0.00039496107,0.00005375957,0.000021960212,0.00008421943,0.00006010889,0.919372,0.000590477,0.06701758,0.0020245973,0.010316577],"study_design_scores_gemma":[0.0000016237015,0.000008562229,0.000058694408,0.0000026024986,0.000002283928,0.000009104845,0.000007161231,0.99215066,0.000044400243,0.0069930074,0.0007196064,0.0000022124686],"about_ca_topic_score_codex":0.005722281,"about_ca_topic_score_gemma":0.0046129297,"teacher_disagreement_score":0.0067080846,"about_ca_system_score_codex":0.0008448404,"about_ca_system_score_gemma":0.0005107,"threshold_uncertainty_score":0.022440791},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73356634,0.0014041862,0.2536537,0.00041845924,0.00014877136,0.00012525656,0.0001544859,0.0013181074,0.009210692],"genre_scores_gemma":[0.99175066,0.000093564246,0.0077120615,0.000013830174,0.000007392607,0.000007656214,0.000025333919,0.000003826053,0.0003855304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997186,0.00008000722,0.000011797296,0.00002797843,0.00007823902,0.000083300336],"domain_scores_gemma":[0.9996594,0.00010884343,0.00003747789,0.00003609927,0.00012113563,0.000036991947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037744245,0.00028954126,0.0003245853,0.0002968478,0.00058872154,0.0005821957,0.00039801575,0.0003664084,0.00081346347],"category_scores_gemma":[0.0008330747,0.00007280808,0.0001814655,0.00036803997,0.00027728922,0.0007719282,0.00046479396,0.0002510642,0.000107699605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009879004,0.0002690404,0.0050520618,0.00021875917,0.00007014076,0.0009239687,0.000413977,0.7434466,0.08446481,0.026688151,0.00473199,0.13273267],"study_design_scores_gemma":[0.000010573519,0.0001786541,0.000926232,0.0000043460805,0.0000194385,0.0000890633,0.000076104225,0.9920621,0.0036178976,0.0016750332,0.0013270307,0.000013680959],"about_ca_topic_score_codex":0.0096424185,"about_ca_topic_score_gemma":0.011252664,"teacher_disagreement_score":0.0096424185,"about_ca_system_score_codex":0.0010708597,"about_ca_system_score_gemma":0.00057377137,"threshold_uncertainty_score":0.019172609},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7259672,0.004190055,0.04056085,0.0023743939,0.0021246886,0.00030516123,0.16944419,0.005684856,0.04934859],"genre_scores_gemma":[0.8846463,0.0009215702,0.012558809,0.00033395496,0.00031182813,0.0001266837,0.07850446,0.001173202,0.021423148],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9992817,0.00009696218,0.000091352784,0.00024632507,0.00018552216,0.00009812928],"domain_scores_gemma":[0.99544924,0.001954028,0.00077100366,0.0004340208,0.0012336964,0.00015800969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008785655,0.0003980275,0.00037331058,0.0020967706,0.00021898307,0.00059315586,0.0007078211,0.00034356964,0.020270396],"category_scores_gemma":[0.007065217,0.00015711415,0.00032222172,0.002400553,0.00020745501,0.0005768201,0.00046527604,0.00066219864,0.005454373],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020132712,0.00019055561,0.43064553,0.001160418,0.00036414596,0.0006073734,0.00082725176,0.010276454,0.029172804,0.008440029,0.16935296,0.34694922],"study_design_scores_gemma":[0.000085370026,0.0003314344,0.79559743,0.00013040546,0.00009652017,0.001325381,0.0016126708,0.021802854,0.014183523,0.003958937,0.16077997,0.00009548715],"about_ca_topic_score_codex":0.0056519867,"about_ca_topic_score_gemma":0.0036992286,"teacher_disagreement_score":0.020270396,"about_ca_system_score_codex":0.00032287577,"about_ca_system_score_gemma":0.000302541,"threshold_uncertainty_score":0.06781125},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10821319,0.0057273144,0.80441356,0.0032879496,0.00030647803,0.000083076855,0.000673722,0.00058743946,0.07670723],"genre_scores_gemma":[0.98052627,0.0017185193,0.014321733,0.00030751203,0.00018802568,0.00010470226,0.00010460086,0.000047665228,0.002680994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873585,0.0004213075,0.000041459003,0.00012390812,0.00038658656,0.00029089337],"domain_scores_gemma":[0.9905624,0.0070937523,0.00063502113,0.0006761831,0.00078431587,0.0002483964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026815224,0.0010002361,0.0008857547,0.00095033745,0.000629043,0.0026643544,0.0012322934,0.0008415779,0.0026741403],"category_scores_gemma":[0.014832603,0.00055056415,0.0005192301,0.0012002769,0.0021393683,0.0025289957,0.002480866,0.0017724389,0.00047239623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018887263,0.000050371094,0.00084785547,0.0002746537,0.00005583117,0.00031526553,0.0002672772,0.49673432,0.00662126,0.47524855,0.004007823,0.015387889],"study_design_scores_gemma":[0.0000116928095,0.00005216863,0.00037696958,0.00007754393,0.000018068102,0.00015701712,0.000060663155,0.850824,0.0022911124,0.14431551,0.0017899702,0.000025275383],"about_ca_topic_score_codex":0.0016460387,"about_ca_topic_score_gemma":0.0015663152,"teacher_disagreement_score":0.0026815224,"about_ca_system_score_codex":0.0021996556,"about_ca_system_score_gemma":0.0014581924,"threshold_uncertainty_score":0.01595968},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023442918,0.0006995272,0.97191423,0.0003337939,0.00015417628,0.00007089555,0.000084423315,0.00020730567,0.0030927213],"genre_scores_gemma":[0.9359148,0.00069988886,0.060564846,0.00026997676,0.00011432319,0.000098578705,0.000096306525,0.000020915026,0.0022203259],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926203,0.00017406506,0.000039796287,0.00014844694,0.00024206514,0.00013356943],"domain_scores_gemma":[0.9987148,0.00052012067,0.0001974534,0.0001172899,0.00039090333,0.00005959333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010396409,0.0006512524,0.0005196307,0.00043912572,0.00078010466,0.00054329,0.0011045502,0.00048445733,0.0008740137],"category_scores_gemma":[0.0030535762,0.0002073846,0.00033303042,0.0006184994,0.0008738826,0.001035684,0.0011010714,0.0009601722,0.00014799685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030890584,0.00010160118,0.0019805802,0.00023056091,0.000068546666,0.0005705387,0.0006815735,0.63388366,0.032880396,0.20057799,0.0051489444,0.123566665],"study_design_scores_gemma":[0.000011300202,0.000051990697,0.0001801523,0.000009327108,0.00001719895,0.00009993086,0.000032435066,0.98421764,0.001599738,0.012402581,0.0013523373,0.000025300333],"about_ca_topic_score_codex":0.005253306,"about_ca_topic_score_gemma":0.005771552,"teacher_disagreement_score":0.005253306,"about_ca_system_score_codex":0.0011082449,"about_ca_system_score_gemma":0.0014038533,"threshold_uncertainty_score":0.010445476},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03146626,0.000948816,0.96387875,0.00045178251,0.00014235858,0.00012240962,0.00007597194,0.0004698485,0.0024437206],"genre_scores_gemma":[0.95649505,0.0005525456,0.04104682,0.00017816719,0.000085073225,0.00021406016,0.00006790803,0.000031995325,0.0013284582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778,0.0007317241,0.00014383423,0.00039851136,0.0005807172,0.00036529027],"domain_scores_gemma":[0.99615484,0.0022146495,0.0005746678,0.0002959903,0.0006210071,0.00013893428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002069502,0.000786738,0.0009123872,0.00092390785,0.0009062868,0.0010814263,0.0014530912,0.0007287317,0.0009760737],"category_scores_gemma":[0.009067253,0.00033727725,0.00054031896,0.0010364644,0.0012386056,0.0019915872,0.0015984534,0.0011706571,0.00020450553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007296494,0.00020084207,0.003067325,0.00042185013,0.00018141903,0.00083640637,0.0010628345,0.60881126,0.034397956,0.23881575,0.0054287775,0.10604586],"study_design_scores_gemma":[0.000048895927,0.00015690524,0.00027827415,0.000021699218,0.000043241092,0.00027418154,0.00006223333,0.96043056,0.0026817736,0.034214657,0.0017289107,0.000058723257],"about_ca_topic_score_codex":0.0022235825,"about_ca_topic_score_gemma":0.0025851044,"teacher_disagreement_score":0.0022235825,"about_ca_system_score_codex":0.0011621696,"about_ca_system_score_gemma":0.0016665118,"threshold_uncertainty_score":0.010944724},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16213529,0.0004944598,0.82865345,0.0006373006,0.00017595587,0.0002350007,0.0001871262,0.0004435971,0.007037849],"genre_scores_gemma":[0.9684645,0.00020501157,0.028399816,0.00008146891,0.000048765432,0.000100047866,0.000114176226,0.000014727029,0.002571566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990387,0.00017275094,0.000090226175,0.00018560834,0.0003392928,0.00017340938],"domain_scores_gemma":[0.99838006,0.00048623496,0.00029837713,0.00034091878,0.00035384163,0.0001405371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011180142,0.0003867209,0.0005774582,0.00047390853,0.0010170208,0.00066327624,0.0010496426,0.00058006926,0.0017165551],"category_scores_gemma":[0.0027564636,0.00016349868,0.0003240031,0.00060716673,0.00060823763,0.0016941967,0.0013049279,0.0006561539,0.00023450759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010291979,0.00018841388,0.0034196551,0.00047213683,0.00010849737,0.0011000003,0.0015606071,0.45866176,0.060667694,0.3063819,0.006815834,0.15959428],"study_design_scores_gemma":[0.00007051725,0.00020131437,0.00036289394,0.000024678175,0.000028858203,0.00025333525,0.00009244767,0.932132,0.008537276,0.05433056,0.0039237463,0.00004230912],"about_ca_topic_score_codex":0.0016707431,"about_ca_topic_score_gemma":0.0015580063,"teacher_disagreement_score":0.0017165551,"about_ca_system_score_codex":0.0009783966,"about_ca_system_score_gemma":0.0015034791,"threshold_uncertainty_score":0.007098794},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029119661,0.00028052027,0.9679576,0.0006201885,0.000045838417,0.00016998278,0.00010985646,0.00065763126,0.0010387317],"genre_scores_gemma":[0.73913765,0.00022506171,0.25543848,0.0007771115,0.00010617605,0.0006353254,0.00052528316,0.00020878883,0.0029461319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974146,0.0013642344,0.000119081065,0.00053993036,0.00030961388,0.00025245594],"domain_scores_gemma":[0.9873585,0.009906199,0.00073974446,0.0005893607,0.00086058374,0.00054550904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069297166,0.0014742553,0.0022023595,0.00075506227,0.000767721,0.0012039028,0.0023083154,0.0019965293,0.0040733125],"category_scores_gemma":[0.022541443,0.0010302587,0.0012151385,0.00062149117,0.001796362,0.0018032909,0.0027618732,0.0031919624,0.00060002203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002662663,0.00014146461,0.0020697233,0.000094566334,0.000072270144,0.000088068795,0.00014254477,0.9527079,0.00063939934,0.008152427,0.0010596297,0.034565818],"study_design_scores_gemma":[0.000028258557,0.000028770351,0.000104377395,0.000004921595,0.000005740313,0.000006857733,0.0000065259896,0.991297,0.00015548538,0.008207847,0.00015000974,0.0000042407223],"about_ca_topic_score_codex":0.010334305,"about_ca_topic_score_gemma":0.009482187,"teacher_disagreement_score":0.010334305,"about_ca_system_score_codex":0.0017786633,"about_ca_system_score_gemma":0.0042724945,"threshold_uncertainty_score":0.036648273},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13446245,0.0007813277,0.85913336,0.0006029043,0.00009252558,0.00007707009,0.000029036244,0.00069450797,0.0041268608],"genre_scores_gemma":[0.99122226,0.000096064934,0.0078028473,0.00004656703,0.00001676162,0.000021618043,0.000010561485,0.0000118065855,0.00077147986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893934,0.00036149847,0.00005195621,0.0001669644,0.00026416988,0.00021617228],"domain_scores_gemma":[0.9970631,0.0018866559,0.00033857118,0.00011694214,0.00034869215,0.00024595472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020216655,0.00063448155,0.0010933642,0.0003587024,0.00047047425,0.0010006326,0.0012517858,0.0007185113,0.0009861783],"category_scores_gemma":[0.005575067,0.00030189962,0.00028472932,0.00030389737,0.001323642,0.0008205813,0.00097034295,0.001596784,0.00012776004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010908295,0.000054929078,0.00038281875,0.000025828282,0.000016365104,0.00003492041,0.000040785817,0.98180526,0.00092977606,0.004919758,0.00022235418,0.011458111],"study_design_scores_gemma":[0.0000056751383,0.000012275063,0.000034864046,0.0000011279985,0.0000013585034,0.0000024699436,0.0000019258373,0.99855417,0.00011168449,0.0012305867,0.000042058353,0.0000016726475],"about_ca_topic_score_codex":0.014655127,"about_ca_topic_score_gemma":0.0046288637,"teacher_disagreement_score":0.014655127,"about_ca_system_score_codex":0.0019348799,"about_ca_system_score_gemma":0.0018419834,"threshold_uncertainty_score":0.029139638},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05865881,0.0005317062,0.9361101,0.00068066665,0.000068587266,0.00004796856,0.00006256745,0.00027232338,0.0035673124],"genre_scores_gemma":[0.9402226,0.00019471756,0.0560731,0.00024219429,0.000028710352,0.000084681895,0.0000709552,0.000061200924,0.0030218058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995419,0.00015549446,0.000014626135,0.00008305178,0.00009824811,0.00010665667],"domain_scores_gemma":[0.99866736,0.00092079345,0.00012736824,0.000044924684,0.00014270733,0.0000968246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010923987,0.00077879,0.0011222216,0.00034858898,0.0003979713,0.0007245188,0.0008330572,0.001070157,0.0019006026],"category_scores_gemma":[0.0036632163,0.0005096214,0.000313728,0.0003517666,0.0010178094,0.001252149,0.0011523667,0.0012224766,0.00020239597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044285094,0.000022266711,0.00026796878,0.000022721999,0.000010106364,0.000022167975,0.000020926858,0.9835354,0.00040360796,0.006570933,0.0004967508,0.008582851],"study_design_scores_gemma":[0.000004838468,0.000012675222,0.000026514352,0.0000017007702,0.0000017004653,0.0000029345729,0.000003161365,0.9973507,0.000103139915,0.0023905411,0.00010065195,0.0000013437311],"about_ca_topic_score_codex":0.008354783,"about_ca_topic_score_gemma":0.0055014133,"teacher_disagreement_score":0.008354783,"about_ca_system_score_codex":0.0013832946,"about_ca_system_score_gemma":0.0021012991,"threshold_uncertainty_score":0.016612291},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046388797,0.00025459187,0.9507999,0.00011774469,0.00003285506,0.000023129476,0.000020132642,0.00019559666,0.0021671534],"genre_scores_gemma":[0.8504193,0.00025736357,0.14687958,0.000072187686,0.000031667118,0.00004832058,0.000040853898,0.000068621484,0.002182199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997062,0.00009237792,0.000009905662,0.00005657833,0.00007742787,0.00005741146],"domain_scores_gemma":[0.99955827,0.00024153957,0.00006736948,0.000052013,0.000055626886,0.000025184054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005398495,0.00072352175,0.00064772164,0.0003491354,0.00024891525,0.00065434823,0.0006207396,0.00060040166,0.0008324966],"category_scores_gemma":[0.0012606063,0.00024705686,0.00033703423,0.00043037118,0.000590364,0.0010142883,0.0006871308,0.00056671066,0.00015722954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008328437,0.000039509945,0.00035884275,0.000042246735,0.00002059287,0.00005989202,0.000034651905,0.9475216,0.010913261,0.008968288,0.0004240867,0.031533755],"study_design_scores_gemma":[0.0000030468311,0.00004507309,0.00005276639,0.0000017036203,0.000003708437,0.000013194529,0.00000689208,0.9966221,0.0013129822,0.001659894,0.0002759198,0.000002677943],"about_ca_topic_score_codex":0.0008257932,"about_ca_topic_score_gemma":0.0008342365,"teacher_disagreement_score":0.0008324966,"about_ca_system_score_codex":0.00049610855,"about_ca_system_score_gemma":0.0004891852,"threshold_uncertainty_score":0.0035995245},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010573082,0.00013618561,0.9881671,0.00007248182,0.000024020197,0.000015995714,0.000011104681,0.00006920096,0.00093075994],"genre_scores_gemma":[0.88387144,0.00036989074,0.11355314,0.00009342443,0.000062620056,0.00009711575,0.00005587919,0.000034086934,0.0018625235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995987,0.000103471226,0.000021274887,0.00011655925,0.000106800144,0.00005324449],"domain_scores_gemma":[0.9996449,0.00017423093,0.000058433838,0.000038185008,0.000066572786,0.000017722894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005125756,0.0006815737,0.0005510492,0.0002238142,0.00034733253,0.00054437225,0.0006420045,0.00057367404,0.0007618694],"category_scores_gemma":[0.0014468156,0.00023494467,0.00035428567,0.00042742034,0.00039040248,0.0010313847,0.0007282475,0.0006212889,0.00013450785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020323653,0.00010028348,0.0014746996,0.00015007232,0.000030196172,0.00009257492,0.00012457032,0.85266954,0.024154795,0.015985416,0.0012241603,0.10379047],"study_design_scores_gemma":[0.0000025912443,0.000020966902,0.00011467629,0.0000029663745,0.0000027630726,0.00000992477,0.000007953404,0.99680126,0.0014960816,0.0013117437,0.0002255877,0.000003419366],"about_ca_topic_score_codex":0.002014465,"about_ca_topic_score_gemma":0.0018132188,"teacher_disagreement_score":0.002014465,"about_ca_system_score_codex":0.0004240731,"about_ca_system_score_gemma":0.00064442493,"threshold_uncertainty_score":0.0040054917},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072660975,0.0005606883,0.906319,0.001015439,0.00010349489,0.00031082315,0.00028416008,0.0006839183,0.01806151],"genre_scores_gemma":[0.8905136,0.0003913395,0.102197655,0.00009904312,0.000052722142,0.0002392419,0.00025380004,0.000054777513,0.006197787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877316,0.000492526,0.000048083202,0.00015989934,0.00031569946,0.00021050205],"domain_scores_gemma":[0.99869066,0.00050671614,0.00010878265,0.0002771419,0.00018645916,0.00023028169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017983041,0.00046817813,0.00067197264,0.00045861883,0.0010925432,0.0018667066,0.0015777113,0.0014024075,0.0061423783],"category_scores_gemma":[0.002388109,0.00024666896,0.0005125673,0.00092167204,0.0010882408,0.0027054788,0.0023650087,0.001188703,0.00070696656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003231106,0.00029407704,0.0019185826,0.00012416128,0.0000589867,0.000750787,0.00031193328,0.70897627,0.004647921,0.21310584,0.004244937,0.065243274],"study_design_scores_gemma":[0.00003747704,0.00004361565,0.000094933144,0.000012619109,0.0000071349664,0.00006281343,0.00004872165,0.9533108,0.0006850999,0.041456208,0.00423004,0.000010602971],"about_ca_topic_score_codex":0.004739281,"about_ca_topic_score_gemma":0.0063085062,"teacher_disagreement_score":0.0061423783,"about_ca_system_score_codex":0.0011195355,"about_ca_system_score_gemma":0.0025160345,"threshold_uncertainty_score":0.020548284},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08044931,0.0005827737,0.8957887,0.0012144067,0.00011021403,0.00031321018,0.00028988527,0.00067098084,0.020580465],"genre_scores_gemma":[0.9017691,0.0003684296,0.09096164,0.00009586637,0.0000513494,0.00020918701,0.00023579266,0.00004884594,0.0062597618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998787,0.00049047085,0.00004557889,0.0001609652,0.00029838464,0.00021766983],"domain_scores_gemma":[0.9987571,0.0004916171,0.00009970952,0.00025571955,0.00017463956,0.00022118066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001732976,0.00045556814,0.00066732685,0.00043271916,0.0010885332,0.0018863676,0.0015156448,0.001384697,0.0062873666],"category_scores_gemma":[0.0023299882,0.00024231646,0.0004997446,0.00090609165,0.0010645706,0.00267295,0.0022321248,0.0011795711,0.00067994755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003233196,0.00028347946,0.0017673877,0.00011512006,0.0000537046,0.00072547834,0.00029730727,0.7108296,0.0042872448,0.2132593,0.004351737,0.0637064],"study_design_scores_gemma":[0.000035539422,0.000040322437,0.000091287715,0.000011803176,0.0000062779827,0.000054158907,0.00005180877,0.95481145,0.00061622827,0.040387712,0.0038836463,0.000009670797],"about_ca_topic_score_codex":0.0054806154,"about_ca_topic_score_gemma":0.0070742574,"teacher_disagreement_score":0.0062873666,"about_ca_system_score_codex":0.0012030322,"about_ca_system_score_gemma":0.002577228,"threshold_uncertainty_score":0.021033347},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014450529,0.0008475812,0.97992915,0.0003011309,0.000054460746,0.00002930924,0.000034729357,0.00005714114,0.0042959224],"genre_scores_gemma":[0.8084815,0.0023394197,0.18429972,0.000288808,0.0001257725,0.00014896094,0.000085547435,0.000056843364,0.004173339],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995359,0.00014142194,0.000023377754,0.00006280362,0.00015601519,0.000080521255],"domain_scores_gemma":[0.9991504,0.0004309195,0.000103544626,0.000070474394,0.00020659147,0.000038214414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009836935,0.0007721485,0.0005439923,0.00059457286,0.0004423941,0.0010155806,0.00091635826,0.0007557555,0.0011983921],"category_scores_gemma":[0.0023811825,0.00035326747,0.000492157,0.0006089958,0.0012302346,0.0014315029,0.0012711587,0.001063021,0.00021823477],"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.00006173017,0.000033987053,0.0005042868,0.00013379243,0.000032097196,0.00017859612,0.0001988572,0.7567619,0.008241997,0.20686617,0.0010788792,0.025907714],"study_design_scores_gemma":[0.000006148476,0.000022195996,0.000040720202,0.000011803684,0.000007287388,0.000035360787,0.000019547551,0.9795726,0.00079255144,0.018914698,0.00056453614,0.000012490977],"about_ca_topic_score_codex":0.0041317227,"about_ca_topic_score_gemma":0.0025712412,"teacher_disagreement_score":0.0041317227,"about_ca_system_score_codex":0.0012035066,"about_ca_system_score_gemma":0.0014163366,"threshold_uncertainty_score":0.00873208},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05398288,0.00022965936,0.93836963,0.00054083875,0.00007751096,0.00014644052,0.000089531124,0.000120229946,0.0064433278],"genre_scores_gemma":[0.9255197,0.0002144381,0.06988266,0.00025653158,0.00004397683,0.00019283743,0.000077524324,0.000043432286,0.0037689095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992212,0.00034329607,0.0000317837,0.00013855542,0.000137357,0.00012783961],"domain_scores_gemma":[0.9983741,0.0010389641,0.0001950297,0.00007238272,0.00013066368,0.00018878965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015510558,0.0009769645,0.0010544444,0.0005327348,0.0006229972,0.0009285012,0.0014146873,0.0012014088,0.0018174622],"category_scores_gemma":[0.004421532,0.0003278983,0.0007673812,0.0005068784,0.001270381,0.0017692241,0.0016641881,0.0013182925,0.00016410093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015584905,0.0001308489,0.0012352219,0.000096564676,0.000085230626,0.0001931943,0.00018885055,0.9034161,0.0017719015,0.06911778,0.002056032,0.021552399],"study_design_scores_gemma":[0.000010578515,0.000049199425,0.000102032966,0.000004573886,0.000007392216,0.000021966736,0.000022293138,0.98541474,0.00014749213,0.013864525,0.00034871136,0.0000065437216],"about_ca_topic_score_codex":0.0027251497,"about_ca_topic_score_gemma":0.0024344064,"teacher_disagreement_score":0.0027251497,"about_ca_system_score_codex":0.0010644986,"about_ca_system_score_gemma":0.0011964724,"threshold_uncertainty_score":0.00820291},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11929491,0.000793387,0.8703101,0.001358926,0.00007191464,0.00008891492,0.00027501266,0.00023945021,0.0075673787],"genre_scores_gemma":[0.9698751,0.0006074664,0.024879336,0.00011529044,0.000057213834,0.000098436685,0.00012147566,0.000083333805,0.0041623972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825984,0.0008010367,0.0000753753,0.00027673188,0.00027400756,0.00031294738],"domain_scores_gemma":[0.98580265,0.011868757,0.0011393419,0.00034430122,0.00048774495,0.00035721026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035829863,0.0013260109,0.0014772303,0.00072977727,0.0006051614,0.0017472742,0.0019396389,0.0020181234,0.0029595247],"category_scores_gemma":[0.015056115,0.00089724065,0.0008171324,0.0010161086,0.0022137023,0.002699435,0.0014812456,0.0020639002,0.00029423335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018939885,0.00003273466,0.00023004458,0.000075050244,0.000028872619,0.000106407395,0.00008215958,0.95172554,0.0010520759,0.041715555,0.0003547289,0.004407464],"study_design_scores_gemma":[0.000017889897,0.000038309918,0.000081181264,0.000009142852,0.000008033389,0.000025877525,0.000016701317,0.98696136,0.00050372956,0.012207608,0.00012017979,0.000010083885],"about_ca_topic_score_codex":0.005741358,"about_ca_topic_score_gemma":0.0029038314,"teacher_disagreement_score":0.005741358,"about_ca_system_score_codex":0.0035048558,"about_ca_system_score_gemma":0.0018857841,"threshold_uncertainty_score":0.025429666},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04482135,0.0006374564,0.94957876,0.00047546218,0.0000976114,0.000045068966,0.00005401101,0.00032391312,0.003966389],"genre_scores_gemma":[0.9701821,0.00016646562,0.026987294,0.00018732302,0.00004228519,0.00005070866,0.000043253833,0.000025494704,0.0023149385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995023,0.00014465168,0.00002145412,0.00011530383,0.00008713074,0.00012917149],"domain_scores_gemma":[0.99899703,0.0005560825,0.00012694602,0.00006140441,0.00017675273,0.00008181553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093709765,0.0008499738,0.0011156959,0.0002812165,0.00043301375,0.00058489986,0.0011771327,0.0009827305,0.0015944062],"category_scores_gemma":[0.0024241174,0.00033985422,0.00035167002,0.00034439343,0.00078564347,0.0011195041,0.00101093,0.0013399689,0.00020451316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007605144,0.00005472892,0.00056367635,0.000036131267,0.000021172324,0.00006484832,0.00004035096,0.9694401,0.0010605705,0.005096065,0.0009710819,0.022575187],"study_design_scores_gemma":[0.0000037983073,0.000011736791,0.00003625658,0.0000015876977,0.0000024988783,0.000007216105,0.0000032382327,0.9985688,0.00010446601,0.0011824637,0.000076094846,0.0000017644172],"about_ca_topic_score_codex":0.0054684235,"about_ca_topic_score_gemma":0.005252038,"teacher_disagreement_score":0.0054684235,"about_ca_system_score_codex":0.0009943078,"about_ca_system_score_gemma":0.0012437926,"threshold_uncertainty_score":0.0108731985},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19193697,0.0014194801,0.800645,0.00044864783,0.00009962029,0.00010372167,0.00026670605,0.00019004953,0.0048898235],"genre_scores_gemma":[0.9775302,0.00074840116,0.019545987,0.00007902091,0.00005734334,0.00006179261,0.00006121872,0.000028880522,0.0018870905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986565,0.00046132415,0.000060324717,0.00022587719,0.00029510865,0.00030073896],"domain_scores_gemma":[0.99188435,0.0056296485,0.0011384819,0.00032007054,0.0007880582,0.00023944439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00294738,0.0009064003,0.0008984014,0.0006579856,0.00045905903,0.001337154,0.0010562369,0.0007158885,0.001335453],"category_scores_gemma":[0.012856913,0.00046736523,0.000395086,0.0007517124,0.0015492869,0.0021886325,0.0012284542,0.0009995931,0.00022305155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013300712,0.000019732994,0.0007306764,0.00005885069,0.000024521949,0.0001642331,0.0001136357,0.95818084,0.0021311317,0.03217677,0.00036578145,0.0059007932],"study_design_scores_gemma":[0.0000056893005,0.00004637809,0.00019616242,0.000007853204,0.0000098420105,0.000037708644,0.000023570701,0.9911343,0.0005497753,0.0078053246,0.00017453503,0.000008769308],"about_ca_topic_score_codex":0.0031151786,"about_ca_topic_score_gemma":0.002097521,"teacher_disagreement_score":0.0031151786,"about_ca_system_score_codex":0.0016217622,"about_ca_system_score_gemma":0.0010811214,"threshold_uncertainty_score":0.0155873895},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09804064,0.0001852514,0.8977297,0.00042483135,0.00003422195,0.000051480143,0.00011168163,0.0001497664,0.0032723865],"genre_scores_gemma":[0.97347,0.00013322386,0.024783941,0.00004055836,0.00001793196,0.000042641703,0.000066613495,0.000031255884,0.0014137431],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931073,0.00022160864,0.000024321624,0.0001512119,0.00012211368,0.00017007715],"domain_scores_gemma":[0.99862623,0.00088979496,0.00019398956,0.00008730921,0.000121467136,0.00008125868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012571369,0.00083359046,0.0010025707,0.00036886206,0.00051421474,0.0011552596,0.0009515297,0.0015394768,0.0014386654],"category_scores_gemma":[0.003657229,0.0005565157,0.00058176025,0.0005723526,0.0008410656,0.0013264669,0.0012449103,0.0012998384,0.000180615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015426933,0.000006468324,0.00013043174,0.0000072079174,0.0000040049026,0.000030612548,0.000007987405,0.9957402,0.00035819845,0.0021315885,0.00009047616,0.001477366],"study_design_scores_gemma":[0.0000015992987,0.0000068923505,0.000043196,9.3666927e-7,0.0000012266938,0.0000042205606,0.0000074833233,0.9982393,0.00013975617,0.0015074606,0.00004633291,0.0000016261162],"about_ca_topic_score_codex":0.007170636,"about_ca_topic_score_gemma":0.0040790485,"teacher_disagreement_score":0.007170636,"about_ca_system_score_codex":0.0012976514,"about_ca_system_score_gemma":0.0009554274,"threshold_uncertainty_score":0.014257848},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37663427,0.0016236609,0.60712683,0.00062596577,0.000051857794,0.0000836043,0.00021177146,0.00025144528,0.013390616],"genre_scores_gemma":[0.9932434,0.0002533082,0.0049115145,0.00002032433,0.00000833015,0.00002484617,0.000027970595,0.000014758427,0.0014957287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967945,0.000104867846,0.000011308242,0.000045464738,0.00008048329,0.00007844185],"domain_scores_gemma":[0.99825937,0.001127643,0.00025482982,0.00005836671,0.00024786592,0.00005200469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009449602,0.0005101271,0.00034250645,0.0006592036,0.00037499113,0.0007924874,0.0004823072,0.00046512837,0.0010646309],"category_scores_gemma":[0.0032574215,0.00021772245,0.0003482769,0.00046673525,0.00063141674,0.0010731571,0.0006380031,0.00047184047,0.00011603724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056852456,0.000020864527,0.0012842586,0.000041105322,0.000013136999,0.000078911195,0.00007258328,0.9753103,0.0027643119,0.016137633,0.0002074193,0.004012654],"study_design_scores_gemma":[5.896522e-7,0.000012168231,0.00018221451,0.000002448814,0.0000026088953,0.0000105375275,0.000015748154,0.9977889,0.00026169265,0.0016486509,0.00007165471,0.000002749219],"about_ca_topic_score_codex":0.0048210067,"about_ca_topic_score_gemma":0.0024901135,"teacher_disagreement_score":0.0048210067,"about_ca_system_score_codex":0.0014677934,"about_ca_system_score_gemma":0.00063625426,"threshold_uncertainty_score":0.0106496215},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56496835,0.0018231339,0.42821124,0.000563679,0.000087114226,0.000068970425,0.0001525487,0.00033348994,0.0037915618],"genre_scores_gemma":[0.9917481,0.00021406478,0.007348299,0.000031242645,0.000007266221,0.000016039494,0.000019586494,0.000011900605,0.0006034828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935466,0.0002549095,0.000028078084,0.00010564431,0.00011394834,0.00014277556],"domain_scores_gemma":[0.9959455,0.003028751,0.00043069237,0.0001348244,0.0003273252,0.00013284762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026365472,0.0005873263,0.0004214393,0.00060586206,0.0005482976,0.0010360226,0.0007651931,0.00068757194,0.0007190011],"category_scores_gemma":[0.0063226665,0.00034446712,0.0003000969,0.0006484749,0.0011146314,0.0015138809,0.0007654925,0.0006881639,0.00005783226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006237761,0.00002401456,0.0012674514,0.0000221613,0.0000114879795,0.00005090267,0.00005618534,0.98733145,0.0015106614,0.0071409754,0.000092105074,0.002430263],"study_design_scores_gemma":[0.0000017001477,0.000027479426,0.00020125009,0.0000019548247,0.0000041634776,0.000008664284,0.000015378117,0.99799395,0.00036744436,0.0013266745,0.000047149348,0.0000041741882],"about_ca_topic_score_codex":0.00821775,"about_ca_topic_score_gemma":0.005276634,"teacher_disagreement_score":0.00821775,"about_ca_system_score_codex":0.0024930371,"about_ca_system_score_gemma":0.00093322573,"threshold_uncertainty_score":0.01808834},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009714065,0.03425091,0.0039816196,0.050845012,0.12466857,0.00028970267,0.0043224087,0.0014688266,0.77045876],"genre_scores_gemma":[0.016789867,0.008535242,0.00074724527,0.0044526025,0.0046624844,0.0000659804,0.0011225104,0.00022401853,0.9634],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99916995,0.00008334311,0.000043139727,0.00010261824,0.00036790664,0.0002330742],"domain_scores_gemma":[0.9969591,0.00018095408,0.00015029144,0.00021046207,0.0014117773,0.0010873908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014808951,0.0010796002,0.0005133325,0.0009852223,0.00227356,0.006254084,0.00068997504,0.001876982,0.12529032],"category_scores_gemma":[0.0022289993,0.00033194255,0.000351354,0.00095601013,0.0013959376,0.0030557022,0.0025235272,0.0028451588,0.06363759],"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.00003383028,0.000014343206,0.0004925764,0.00015409771,0.000005006431,0.00009528852,0.00018077616,0.00004414809,0.00039109593,0.005379706,0.9643457,0.02886336],"study_design_scores_gemma":[0.0000015895621,0.00001579496,0.0011677302,0.000050618924,0.0000028501468,0.00005421862,0.00016187756,0.000033618526,0.00018773238,0.00022358092,0.9980934,0.00000691534],"about_ca_topic_score_codex":0.024486024,"about_ca_topic_score_gemma":0.037212484,"teacher_disagreement_score":0.12529032,"about_ca_system_score_codex":0.0038245926,"about_ca_system_score_gemma":0.004749895,"threshold_uncertainty_score":0.4191379},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011333248,0.0017716731,0.97663,0.0004213329,0.00013079174,0.000040732957,0.000067131296,0.00011878257,0.009486204],"genre_scores_gemma":[0.84553033,0.004101159,0.13992633,0.0005057848,0.0005801932,0.00016336488,0.0001172931,0.00019364865,0.008881843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840325,0.00050040695,0.00005730766,0.00020502396,0.00058963755,0.00024431627],"domain_scores_gemma":[0.9940322,0.003883921,0.0005096348,0.00038472554,0.0010566475,0.00013287165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035162338,0.0012103993,0.00089094555,0.0011292363,0.00062759884,0.0021641757,0.0013089721,0.0008385905,0.0031352784],"category_scores_gemma":[0.010745235,0.0004648746,0.00074373087,0.0010409387,0.002069093,0.0031076432,0.0016993055,0.0019351173,0.0006347954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010853373,0.00006923382,0.0009589598,0.00032667784,0.000066216955,0.00023039884,0.00038576577,0.5487507,0.0067105545,0.40112972,0.0032493705,0.03801376],"study_design_scores_gemma":[0.0000061658543,0.000048151443,0.00020362617,0.000031779393,0.000025097575,0.00009966665,0.000051559146,0.95272267,0.0011082318,0.044015005,0.0016669922,0.00002103928],"about_ca_topic_score_codex":0.0023106488,"about_ca_topic_score_gemma":0.0017408883,"teacher_disagreement_score":0.0035162338,"about_ca_system_score_codex":0.0017453748,"about_ca_system_score_gemma":0.0014801832,"threshold_uncertainty_score":0.018595815},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.165034,0.00038202075,0.82911897,0.0008740265,0.000112670175,0.00016661786,0.00011164954,0.0003051672,0.0038948506],"genre_scores_gemma":[0.98817307,0.00009433321,0.011040352,0.00004544509,0.00001956475,0.000024842058,0.00001756518,0.000013127888,0.0005716289],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834204,0.00044848525,0.00007423477,0.00023963483,0.00031895915,0.0005766319],"domain_scores_gemma":[0.99806803,0.000868186,0.00041072984,0.000124087,0.00031904498,0.00020993518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019097715,0.00087755476,0.00096504163,0.00048199555,0.0010550442,0.0018906803,0.0011963369,0.00093476265,0.0019164811],"category_scores_gemma":[0.004420088,0.0003474155,0.0004815026,0.00054866826,0.0010750192,0.0013109678,0.0013547228,0.0013074296,0.00019087941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002973461,0.00008466285,0.001225189,0.00005825728,0.00003159914,0.00012653971,0.00008728864,0.94788355,0.0051345923,0.02912376,0.0011031777,0.014844092],"study_design_scores_gemma":[0.000009596721,0.00003280086,0.00017444955,0.000003931956,0.000007390897,0.000017955435,0.000026305912,0.99445784,0.000767846,0.0043693944,0.00012518818,0.0000072526936],"about_ca_topic_score_codex":0.0072599454,"about_ca_topic_score_gemma":0.0049811373,"teacher_disagreement_score":0.0072599454,"about_ca_system_score_codex":0.0024423108,"about_ca_system_score_gemma":0.0032362863,"threshold_uncertainty_score":0.017720342},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14914168,0.0005512255,0.8432682,0.00022597454,0.0001653612,0.00017558027,0.000080197366,0.0014389406,0.004952776],"genre_scores_gemma":[0.94764954,0.00007880459,0.05034037,0.00006906628,0.00004875597,0.000051971783,0.00004249101,0.000023659848,0.0016952867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996013,0.000064319,0.000021235051,0.000091045615,0.00009970428,0.00012237667],"domain_scores_gemma":[0.99927586,0.00017688908,0.00013888342,0.00017578826,0.00011402947,0.00011851446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033808014,0.00056634995,0.00051083945,0.00064022146,0.0009734863,0.00066793134,0.0016946646,0.0004788527,0.0014896976],"category_scores_gemma":[0.0010395967,0.00015962492,0.0002687133,0.00059009955,0.0005346987,0.0008564024,0.0013308249,0.0005632492,0.00027956787],"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.0016572549,0.00028411782,0.0030952296,0.00020926131,0.0001426857,0.0011153766,0.00050961407,0.3795882,0.12737821,0.04049116,0.008190592,0.43733826],"study_design_scores_gemma":[0.000049576487,0.00031970075,0.00055164925,0.000009485999,0.0000390144,0.00048398942,0.0000799431,0.9764971,0.012538547,0.0053951903,0.0039973324,0.000038424925],"about_ca_topic_score_codex":0.0019020948,"about_ca_topic_score_gemma":0.0026026643,"teacher_disagreement_score":0.0019020948,"about_ca_system_score_codex":0.0007115795,"about_ca_system_score_gemma":0.0005365489,"threshold_uncertainty_score":0.005162835},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06615776,0.00044962091,0.9264395,0.00027743806,0.00009459802,0.00014492191,0.000099581805,0.00067939825,0.0056571565],"genre_scores_gemma":[0.93309915,0.00023059033,0.06457335,0.00015999249,0.000030674062,0.000085815635,0.00007256185,0.00004130883,0.0017065866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990834,0.00026571704,0.000035150377,0.00018682623,0.0002838303,0.00014515518],"domain_scores_gemma":[0.99816364,0.0007524257,0.00025409294,0.00033730708,0.000345808,0.0001468276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007964783,0.0007590627,0.00054997933,0.00072319264,0.0008159688,0.00091052655,0.0017086978,0.00056833995,0.0015032586],"category_scores_gemma":[0.0030754313,0.0002559869,0.0005232991,0.0009857073,0.0011869033,0.0016083989,0.001675975,0.0008522816,0.00038009553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032433184,0.0001729763,0.0020501805,0.00024482247,0.00016097,0.00061392784,0.00046821247,0.74028176,0.03677758,0.11408408,0.003401524,0.10141962],"study_design_scores_gemma":[0.000017540635,0.00012424024,0.00023552091,0.000007845061,0.000029600571,0.0002297647,0.00006542557,0.97793716,0.0030699037,0.016809473,0.0014480116,0.000025551233],"about_ca_topic_score_codex":0.0029618149,"about_ca_topic_score_gemma":0.0039819903,"teacher_disagreement_score":0.0029618149,"about_ca_system_score_codex":0.0009909803,"about_ca_system_score_gemma":0.0013400223,"threshold_uncertainty_score":0.007190168},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06271321,0.0005185187,0.9323396,0.00038995693,0.00009707804,0.00006046147,0.00007016959,0.00024690863,0.00356416],"genre_scores_gemma":[0.9888993,0.00011648912,0.009744278,0.00007902611,0.00003220015,0.00002817803,0.000026556098,0.000009372593,0.0010646207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921525,0.00014130943,0.00003729708,0.00025213894,0.00015696071,0.0001969515],"domain_scores_gemma":[0.99866045,0.0005762638,0.00030321855,0.00010222414,0.00021821442,0.00013961778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095728657,0.000622122,0.00074774004,0.00036422184,0.0005364538,0.0009514771,0.0013326711,0.00072378176,0.00123355],"category_scores_gemma":[0.0025401902,0.00022104767,0.00037542338,0.000385405,0.00083119504,0.0012224999,0.001364805,0.0012040059,0.00016190819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001978904,0.00011518553,0.0027713478,0.000108719956,0.00005028471,0.0004164956,0.00022302315,0.90058136,0.01144847,0.024848333,0.0016144353,0.057624515],"study_design_scores_gemma":[0.000006440687,0.000032632353,0.00020514101,0.0000033625236,0.000011175303,0.00004142767,0.00001533223,0.99509,0.0006544893,0.00361115,0.00032185396,0.000006926038],"about_ca_topic_score_codex":0.0051538693,"about_ca_topic_score_gemma":0.005219841,"teacher_disagreement_score":0.0051538693,"about_ca_system_score_codex":0.0009170404,"about_ca_system_score_gemma":0.0008444545,"threshold_uncertainty_score":0.010247707},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09832557,0.0006996464,0.8954373,0.00047814407,0.00010541152,0.000101948,0.00003863057,0.00057887664,0.0042344197],"genre_scores_gemma":[0.9818503,0.00007093901,0.016732141,0.00008548964,0.00001634137,0.000048438425,0.000020279871,0.000014781848,0.0011611661],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994764,0.00018626003,0.000023780382,0.00009455525,0.000086690205,0.00013232474],"domain_scores_gemma":[0.9983564,0.0010637328,0.00016193518,0.00006889751,0.0002251468,0.00012373613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012486867,0.00055390864,0.0008204788,0.00025498477,0.0003283319,0.0005934341,0.001041321,0.0005979454,0.0017781681],"category_scores_gemma":[0.003571376,0.00022925172,0.00024274911,0.00024126614,0.0007929293,0.00074999797,0.0007743646,0.0011654367,0.00023405324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015412491,0.00012887263,0.00070992217,0.000031538286,0.000028695624,0.00006254015,0.000045887497,0.9569854,0.0015338715,0.0042621703,0.0008074952,0.03524944],"study_design_scores_gemma":[0.0000089031955,0.000021267391,0.000048233698,0.0000014326132,0.0000021367198,0.000005215209,0.0000029736088,0.99863774,0.0001500228,0.0010355192,0.00008450645,0.000001961604],"about_ca_topic_score_codex":0.00574766,"about_ca_topic_score_gemma":0.0043187356,"teacher_disagreement_score":0.00574766,"about_ca_system_score_codex":0.0008177926,"about_ca_system_score_gemma":0.0010743657,"threshold_uncertainty_score":0.011428356},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058173373,0.0010749811,0.9364483,0.0003226718,0.000115982795,0.00005588364,0.00009166538,0.00025396084,0.0034632315],"genre_scores_gemma":[0.9455596,0.00043015074,0.05202692,0.00012996422,0.00005657118,0.00006495494,0.000089481764,0.000045140216,0.001597173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908924,0.00031410536,0.00003750116,0.00018876928,0.00016840194,0.00020196382],"domain_scores_gemma":[0.99823296,0.0010798546,0.0002487988,0.00013761154,0.00018834452,0.000112364774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015531109,0.0013929437,0.0012747536,0.000543079,0.0007474124,0.0014946451,0.0015968052,0.0010138343,0.0011034781],"category_scores_gemma":[0.003370171,0.00063674897,0.0006504302,0.001048636,0.0012015852,0.001823624,0.0015739797,0.001040476,0.00027857808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000825802,0.000039792514,0.0003890994,0.0000640846,0.00003378529,0.000121418496,0.000055471126,0.9749834,0.0022811608,0.006128137,0.00062891387,0.015192112],"study_design_scores_gemma":[0.000003986496,0.000037259804,0.00009918311,0.0000041849894,0.000009284549,0.0000240303,0.000021042857,0.9968353,0.00037990435,0.0023734106,0.0002060886,0.0000062180393],"about_ca_topic_score_codex":0.0033283606,"about_ca_topic_score_gemma":0.0042437385,"teacher_disagreement_score":0.0033283606,"about_ca_system_score_codex":0.0010331371,"about_ca_system_score_gemma":0.0011118678,"threshold_uncertainty_score":0.0082137585},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032322448,0.0020056856,0.9516764,0.0004356728,0.000102690356,0.000051667823,0.000106096304,0.0002650257,0.013034347],"genre_scores_gemma":[0.9342905,0.0020626984,0.05753727,0.00032420445,0.00018711672,0.00009209203,0.00008113431,0.00014188194,0.0052829715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852425,0.00046268874,0.000050518836,0.00018679275,0.0005042317,0.00027164398],"domain_scores_gemma":[0.99386036,0.0038991584,0.0005943273,0.00049604935,0.0010194025,0.00013075338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035453646,0.0012028825,0.00093002315,0.000966112,0.00057810027,0.0019250163,0.001341793,0.0010823847,0.0030250698],"category_scores_gemma":[0.013566705,0.00043152578,0.0004741279,0.0007736926,0.0020911938,0.0031687764,0.0019120269,0.0014168371,0.0007160307],"study_design_candidate":"theoretical_or_conceptual","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.0000747195,0.000046575806,0.0008518864,0.00018201875,0.00004119538,0.00013446035,0.00023377419,0.75240374,0.0063225008,0.21888688,0.001667499,0.019154774],"study_design_scores_gemma":[0.0000049094824,0.00004800676,0.00022779411,0.000028010883,0.00001309384,0.00009440961,0.00004690815,0.97213304,0.0015068597,0.025016328,0.0008609224,0.000019607709],"about_ca_topic_score_codex":0.0023262957,"about_ca_topic_score_gemma":0.0014096864,"teacher_disagreement_score":0.0035453646,"about_ca_system_score_codex":0.0017674447,"about_ca_system_score_gemma":0.0014915329,"threshold_uncertainty_score":0.018749893},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07497409,0.0006215756,0.9204327,0.00041756802,0.00006686385,0.000060157123,0.00008838056,0.00015438425,0.0031843837],"genre_scores_gemma":[0.95076835,0.00029518202,0.046533376,0.00006357627,0.00004305759,0.000060704773,0.00007215439,0.00004211571,0.0021214727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937856,0.00022778362,0.000025727622,0.000116501134,0.00011540617,0.00013597132],"domain_scores_gemma":[0.9985802,0.0008338238,0.00024243901,0.000056920548,0.00017368472,0.00011291925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013232077,0.0007858561,0.0011263277,0.0005727928,0.00056751986,0.00084911735,0.0013003375,0.0007037514,0.0009567058],"category_scores_gemma":[0.0040891413,0.00040112121,0.00031218963,0.0006669028,0.00060867344,0.0011074413,0.00094242924,0.0007944309,0.00013936365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055457574,0.000030382913,0.00038779428,0.000033601387,0.000017071558,0.000030558866,0.00004745737,0.9791988,0.00092003733,0.007601305,0.00044943692,0.011228077],"study_design_scores_gemma":[0.0000039701395,0.000016770045,0.000068739806,0.0000018456174,0.0000029111275,0.000007086265,0.000010868067,0.99629444,0.00021382603,0.0031858666,0.00019163806,0.00000205004],"about_ca_topic_score_codex":0.005021107,"about_ca_topic_score_gemma":0.0049124467,"teacher_disagreement_score":0.005021107,"about_ca_system_score_codex":0.0016523973,"about_ca_system_score_gemma":0.0015155085,"threshold_uncertainty_score":0.011989117},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028081376,0.00017690181,0.9688173,0.00034461234,0.000042944528,0.00004725484,0.000017743667,0.00023589192,0.002235982],"genre_scores_gemma":[0.9405001,0.00011927725,0.057325654,0.00021655553,0.000056056542,0.00006804702,0.000029513592,0.00004458872,0.0016402062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948585,0.00017857461,0.000021025657,0.00012212808,0.000096300355,0.00009623526],"domain_scores_gemma":[0.99882466,0.0006964897,0.00015515795,0.00008986973,0.00015248828,0.00008126273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012449464,0.0007338502,0.00096157606,0.00034578386,0.00046569825,0.00086212007,0.001375752,0.0009920695,0.0011078538],"category_scores_gemma":[0.0029921758,0.00031615497,0.00040366602,0.00029382014,0.0009513167,0.0011834308,0.00089737365,0.0012468748,0.00016596692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004904052,0.00007545626,0.000626216,0.000025998119,0.000035439032,0.000049022463,0.000049622187,0.96769756,0.0014517849,0.005733377,0.0005620483,0.023644473],"study_design_scores_gemma":[0.000005482922,0.000013058955,0.000042472442,0.0000019948327,0.000002956647,0.0000062475506,0.0000042851816,0.9978872,0.00017054513,0.0017259314,0.0001376123,0.000002285901],"about_ca_topic_score_codex":0.0033816323,"about_ca_topic_score_gemma":0.0025976743,"teacher_disagreement_score":0.0033816323,"about_ca_system_score_codex":0.0008729854,"about_ca_system_score_gemma":0.0010820919,"threshold_uncertainty_score":0.0067239404},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08725429,0.00066523574,0.9062605,0.00021358005,0.000060857128,0.000019794817,0.00007025996,0.00013742462,0.0053181117],"genre_scores_gemma":[0.9366784,0.00030264037,0.059144147,0.00006289532,0.000039854673,0.000033480952,0.00005385758,0.000025414574,0.0036593636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996593,0.000112818554,0.000008847535,0.00008287971,0.000064791995,0.00007135927],"domain_scores_gemma":[0.9995789,0.00022784948,0.00006866289,0.000032234577,0.00006304595,0.000029294295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037543377,0.00085093663,0.00077534595,0.00022621728,0.0002258886,0.000667953,0.0007325631,0.0006685128,0.0010841829],"category_scores_gemma":[0.00083699106,0.00028221132,0.00043462968,0.00046073698,0.0004904834,0.000692161,0.00066597713,0.0005901342,0.00020805463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012239121,0.00003139545,0.0005789895,0.00006995155,0.000039099556,0.00022807148,0.000052905634,0.9640096,0.005720035,0.00904136,0.00070814975,0.019398041],"study_design_scores_gemma":[0.0000053918825,0.00004689012,0.00010625745,0.0000022345057,0.000007790255,0.000048139114,0.000015623162,0.9972927,0.00091207,0.0012352942,0.00032344155,0.0000042075085],"about_ca_topic_score_codex":0.0017583501,"about_ca_topic_score_gemma":0.0015515073,"teacher_disagreement_score":0.0017583501,"about_ca_system_score_codex":0.00048078824,"about_ca_system_score_gemma":0.0005001461,"threshold_uncertainty_score":0.0036269426},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036946055,0.00043833104,0.95339644,0.00026063522,0.00012820934,0.00022597394,0.00021197577,0.00037634335,0.008015977],"genre_scores_gemma":[0.70514697,0.0006635993,0.28334948,0.00017357011,0.00010350111,0.00040963793,0.00046753936,0.00029500035,0.009390681],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992341,0.00019175478,0.000045228477,0.00018864276,0.00018603934,0.0001542604],"domain_scores_gemma":[0.9990307,0.00046666007,0.00014354875,0.00008141681,0.00016607999,0.00011153752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008574692,0.0017417918,0.0014766374,0.0006313951,0.0006903217,0.0013551752,0.0012512959,0.0011231588,0.0061955345],"category_scores_gemma":[0.0032028107,0.0005455072,0.0005975107,0.0010495057,0.00058769475,0.0015412449,0.0013897364,0.0010430461,0.0007432576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024093543,0.00013083687,0.00051243225,0.0002586201,0.000030408086,0.00019119272,0.00008880034,0.934656,0.006050075,0.018364623,0.0033245885,0.036151413],"study_design_scores_gemma":[0.00001805424,0.00012023946,0.00013109528,0.000009486861,0.000010091374,0.00006478815,0.000041387775,0.98913854,0.0016109211,0.0075811385,0.0012655773,0.00000866822],"about_ca_topic_score_codex":0.002116652,"about_ca_topic_score_gemma":0.0022707724,"teacher_disagreement_score":0.0061955345,"about_ca_system_score_codex":0.0011077784,"about_ca_system_score_gemma":0.0014426709,"threshold_uncertainty_score":0.020726144},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006043134,0.017664818,0.014180526,0.015247325,0.010652701,0.0005443504,0.011797495,0.0031873703,0.9261211],"genre_scores_gemma":[0.017766297,0.054606955,0.039298713,0.012496004,0.0036609108,0.0014849806,0.047637008,0.004147011,0.8189022],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99730396,0.0003732716,0.0001055722,0.0002641192,0.0016188895,0.00033416663],"domain_scores_gemma":[0.99782526,0.00027147014,0.00007354203,0.00020830124,0.0014350117,0.00018644777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030143058,0.0020193628,0.0008692527,0.0035912711,0.0013632268,0.0062872167,0.0032925333,0.0043847486,0.15858616],"category_scores_gemma":[0.004671047,0.00063295045,0.0010983099,0.003856937,0.00074045657,0.00648965,0.003438143,0.004421641,0.12980236],"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.000030905856,0.000057236935,0.00008890683,0.0005659674,0.0000058773667,0.00004883266,0.00006435899,0.0018085445,0.00031615674,0.07304113,0.8134514,0.11052059],"study_design_scores_gemma":[0.00000167034,0.0000076155734,0.00006173867,0.00015659432,0.0000013293321,0.000014591901,0.000021367428,0.000119999786,0.000055646393,0.0035832615,0.9959706,0.0000056472236],"about_ca_topic_score_codex":0.014067992,"about_ca_topic_score_gemma":0.009768339,"teacher_disagreement_score":0.15858616,"about_ca_system_score_codex":0.0042372253,"about_ca_system_score_gemma":0.008603049,"threshold_uncertainty_score":0.53052354},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030575547,0.0006489974,0.9657764,0.00025012085,0.000037673934,0.000038637732,0.00006391157,0.000110085144,0.0024987422],"genre_scores_gemma":[0.8519371,0.0009314087,0.14227128,0.00012701488,0.00006406358,0.00013234554,0.00015324587,0.00008596413,0.0042975512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995493,0.00014306523,0.000017661405,0.00009299654,0.00012562062,0.00007135754],"domain_scores_gemma":[0.9990677,0.0005759762,0.00013310797,0.000039700764,0.0001452256,0.000038336122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000987446,0.0007436823,0.00094672607,0.0005370583,0.0003349322,0.0007567749,0.0008192406,0.00075687916,0.0009280607],"category_scores_gemma":[0.0022163442,0.00037555583,0.00048296942,0.00078239053,0.0006289725,0.0009810359,0.00076185603,0.0007242837,0.00018604402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004087679,0.000022239463,0.00041582482,0.000057310644,0.00002315162,0.00006287024,0.000046508787,0.9736477,0.0016251953,0.0059233624,0.0006889409,0.017445913],"study_design_scores_gemma":[0.0000032503622,0.000026268632,0.00010917763,0.0000032655869,0.000005190766,0.00001550806,0.000010024794,0.9978161,0.00048595498,0.0012539573,0.00026836866,0.0000029751716],"about_ca_topic_score_codex":0.004694438,"about_ca_topic_score_gemma":0.002775597,"teacher_disagreement_score":0.004694438,"about_ca_system_score_codex":0.0011412215,"about_ca_system_score_gemma":0.0011146739,"threshold_uncertainty_score":0.009334207},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030160319,0.0011424791,0.96323603,0.0006206057,0.000043192395,0.00007962129,0.00006338695,0.00014641958,0.0045079207],"genre_scores_gemma":[0.71620315,0.0013736425,0.27577576,0.00023644156,0.00009776151,0.00056614814,0.00021701878,0.00017592777,0.0053541213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917644,0.00042506136,0.00003750772,0.00012517355,0.00016194413,0.00007375239],"domain_scores_gemma":[0.99625766,0.0031101976,0.00020070538,0.00006408296,0.00032771614,0.00003974056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027758083,0.0012827,0.00096767995,0.0007476125,0.00040566135,0.0012822297,0.0005838814,0.0016514891,0.0022277366],"category_scores_gemma":[0.007341537,0.00040518367,0.00083020487,0.0006072471,0.0009246846,0.00076978357,0.00088053744,0.0015603363,0.0003499757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017349425,0.00001618968,0.00027492564,0.0000515927,0.000016964,0.00001773675,0.000014807713,0.9903604,0.00026946364,0.0026388168,0.00018835289,0.006133391],"study_design_scores_gemma":[0.000001490948,0.000011451337,0.000052608473,0.0000071578943,0.0000027016226,0.000003282459,0.0000026279088,0.9988422,0.00010422987,0.0008758707,0.00009480558,0.0000015156853],"about_ca_topic_score_codex":0.0042282115,"about_ca_topic_score_gemma":0.0021809817,"teacher_disagreement_score":0.0042282115,"about_ca_system_score_codex":0.0013266413,"about_ca_system_score_gemma":0.0014024408,"threshold_uncertainty_score":0.014680028},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06796452,0.00043667678,0.9270418,0.00054377544,0.00005902382,0.0000422913,0.000032406755,0.0003394038,0.00354005],"genre_scores_gemma":[0.96220785,0.00014150498,0.034958407,0.00013814439,0.000024442093,0.00006569099,0.0000469918,0.000039196602,0.0023778046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998167,0.00005161055,0.000008429948,0.000030204932,0.00004287463,0.00005006647],"domain_scores_gemma":[0.999331,0.0003843754,0.00007015296,0.000022919685,0.00014013029,0.00005147412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006502957,0.000692166,0.0007632905,0.00029956122,0.000301388,0.0005453998,0.00085084134,0.0006083591,0.0011042661],"category_scores_gemma":[0.0016455011,0.00033955032,0.00028162752,0.00027685837,0.00056672253,0.00050765567,0.00069223257,0.0008730432,0.00013504968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017586182,0.000018163577,0.00027820235,0.00001379534,0.000007976711,0.000015984117,0.000012629507,0.9898662,0.00038770607,0.0014746414,0.00023994209,0.0076672556],"study_design_scores_gemma":[0.0000012085347,0.000004453125,0.0000130225235,6.698458e-7,6.5056435e-7,8.648548e-7,0.000001115714,0.999686,0.000037117814,0.0002294466,0.000024949304,5.025638e-7],"about_ca_topic_score_codex":0.01214943,"about_ca_topic_score_gemma":0.009607124,"teacher_disagreement_score":0.01214943,"about_ca_system_score_codex":0.0009160946,"about_ca_system_score_gemma":0.0015438779,"threshold_uncertainty_score":0.024157405},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019190608,0.00014292366,0.97884107,0.00012198578,0.000043167216,0.000027419708,0.000027092403,0.00034942795,0.0012562826],"genre_scores_gemma":[0.9188048,0.00010145663,0.079011686,0.00016955954,0.000048441434,0.00008052652,0.00009673427,0.000062634805,0.0016242693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912053,0.00017166782,0.000060040224,0.0003036126,0.00022164678,0.00012251383],"domain_scores_gemma":[0.9976186,0.0013030005,0.00024310182,0.00020331395,0.00049345376,0.00013854167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017510827,0.0011367449,0.0011861654,0.00042927312,0.00056721945,0.001127553,0.0023188475,0.000993422,0.0013868304],"category_scores_gemma":[0.0061406028,0.0005544521,0.00069799053,0.0004979553,0.0008580466,0.0017187388,0.0020648686,0.0017197038,0.00023543328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006832973,0.00003182037,0.000662803,0.000026900723,0.000026796946,0.0000579258,0.000039339215,0.97104114,0.0012108547,0.0027363412,0.000360505,0.023737231],"study_design_scores_gemma":[0.00000300402,0.0000061597184,0.00003096868,0.0000011646079,0.0000032915962,0.0000042055017,0.0000018645165,0.9989115,0.00024694874,0.0007449273,0.00004404985,0.0000019654176],"about_ca_topic_score_codex":0.0098296795,"about_ca_topic_score_gemma":0.0109115355,"teacher_disagreement_score":0.0098296795,"about_ca_system_score_codex":0.0012557918,"about_ca_system_score_gemma":0.0016830532,"threshold_uncertainty_score":0.0195449},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030723684,0.0012108333,0.9636847,0.00071774225,0.00017615604,0.000051818188,0.000072785886,0.0002754229,0.0030868503],"genre_scores_gemma":[0.91265666,0.0010125808,0.08045688,0.00016863724,0.00026906992,0.00009414837,0.00010404373,0.0001720739,0.005065935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986167,0.00059620704,0.000049239694,0.00019005612,0.00027989535,0.0002679071],"domain_scores_gemma":[0.9960425,0.0028272907,0.0003071302,0.00026616608,0.00033725897,0.00021971324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030687572,0.000998899,0.0019352048,0.0010581934,0.00084852247,0.0020491213,0.0025984577,0.0012937253,0.0019812917],"category_scores_gemma":[0.011652609,0.00089603814,0.0007785469,0.0018067644,0.0015908821,0.0023579819,0.0019377448,0.0019913996,0.00024686495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020621906,0.00005633147,0.00029344318,0.000057041598,0.00004312325,0.000031183747,0.000046980243,0.9187714,0.0011722294,0.06171935,0.0016522425,0.015950419],"study_design_scores_gemma":[0.000006781434,0.000010076852,0.000027727008,0.0000020891323,0.0000055614964,0.0000052860873,0.0000030676645,0.9882671,0.00012441668,0.011395491,0.000148953,0.0000033707677],"about_ca_topic_score_codex":0.0050069955,"about_ca_topic_score_gemma":0.0035832026,"teacher_disagreement_score":0.0050069955,"about_ca_system_score_codex":0.003117817,"about_ca_system_score_gemma":0.0025210993,"threshold_uncertainty_score":0.022621453},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024130952,0.00013663026,0.9660564,0.00013727599,0.00003735976,0.000060204376,0.00040726902,0.0011545155,0.007879479],"genre_scores_gemma":[0.90387726,0.0001561277,0.08730723,0.000054214655,0.000025929923,0.00015845257,0.00035000924,0.00018617147,0.0078846775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981636,0.00004396823,0.000010998036,0.000042996144,0.000065095395,0.000020658283],"domain_scores_gemma":[0.99970275,0.00012453535,0.000034218465,0.000041273102,0.00008130858,0.000015944966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042801685,0.0005742783,0.0007631468,0.00032705505,0.00033617008,0.0011219821,0.0010838065,0.00089320086,0.006221487],"category_scores_gemma":[0.0009643904,0.0003933254,0.0007331619,0.00044542665,0.00027291803,0.00080038636,0.0005748629,0.0006903796,0.0007109861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001780105,0.00000883756,0.000145344,0.000024433744,0.0000090747535,0.000026180154,0.000012782353,0.9901248,0.0009276892,0.0018011649,0.00025086766,0.0066510253],"study_design_scores_gemma":[0.000002039033,0.00000506732,0.000043129236,0.0000012957966,0.000003788124,0.0000039444017,0.0000015062959,0.99896884,0.00015114721,0.00062650384,0.00019116749,0.0000015779644],"about_ca_topic_score_codex":0.0082376795,"about_ca_topic_score_gemma":0.007888957,"teacher_disagreement_score":0.0082376795,"about_ca_system_score_codex":0.0005771456,"about_ca_system_score_gemma":0.00083925395,"threshold_uncertainty_score":0.020812929},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03170499,0.0012148201,0.96119124,0.00064074976,0.000095647454,0.00006913514,0.00011606191,0.00014633258,0.0048209615],"genre_scores_gemma":[0.92083734,0.0007506653,0.072419584,0.0005031286,0.0001012215,0.00012911053,0.00017670219,0.00006861796,0.0050136624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993801,0.00016489612,0.000029673984,0.00017031701,0.00012252577,0.00013254792],"domain_scores_gemma":[0.9985902,0.0008253699,0.00015735666,0.000053493502,0.00028095362,0.000092600356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018139742,0.0009829234,0.0014537312,0.00054075406,0.00042799296,0.0010659649,0.0018763159,0.0012630648,0.002020096],"category_scores_gemma":[0.003739424,0.0005826101,0.00046198926,0.0006447493,0.001075613,0.0018815697,0.0013882014,0.0012785925,0.00022662897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005567654,0.000048612266,0.00075145776,0.000077934616,0.00002761053,0.000051927233,0.000039515307,0.96617323,0.0009352484,0.011548848,0.0008973479,0.019392561],"study_design_scores_gemma":[0.0000042492024,0.000012973612,0.000056562738,0.0000042064194,0.0000047431763,0.000010791853,0.000005764691,0.99657357,0.00015855215,0.0029504877,0.00021533314,0.0000027901785],"about_ca_topic_score_codex":0.005943472,"about_ca_topic_score_gemma":0.0055099167,"teacher_disagreement_score":0.005943472,"about_ca_system_score_codex":0.0020404467,"about_ca_system_score_gemma":0.0013735292,"threshold_uncertainty_score":0.014804542},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015446435,0.0008182333,0.9782299,0.0004047946,0.0003232488,0.000111414316,0.00006752866,0.0027753403,0.001823125],"genre_scores_gemma":[0.6209238,0.000687007,0.36843467,0.0009103377,0.0003514821,0.00027505684,0.0004468954,0.0014002736,0.006570548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965938,0.0012035603,0.00023942585,0.00068922463,0.000942124,0.000331967],"domain_scores_gemma":[0.9924385,0.0043401243,0.0005419203,0.0011651546,0.0012608093,0.00025350318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005660394,0.0020578238,0.0024229484,0.00095152477,0.0007037323,0.0019965712,0.003169861,0.0023739596,0.003458638],"category_scores_gemma":[0.03520822,0.0010213217,0.00077868643,0.000843881,0.0015660297,0.0030570477,0.0029654314,0.004439165,0.001238526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000590297,0.0002638183,0.0027464754,0.00028556795,0.00017819347,0.00014817755,0.0002037413,0.59868354,0.00386878,0.031290825,0.0084329,0.35330772],"study_design_scores_gemma":[0.000041075335,0.000054766257,0.00017527808,0.000026278214,0.000017551134,0.000035223715,0.000011277334,0.9833028,0.0028065525,0.011933247,0.0015810061,0.000014956491],"about_ca_topic_score_codex":0.0060324846,"about_ca_topic_score_gemma":0.0059340815,"teacher_disagreement_score":0.0060324846,"about_ca_system_score_codex":0.0018858659,"about_ca_system_score_gemma":0.0039837607,"threshold_uncertainty_score":0.02993542},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13380389,0.00078720856,0.8589742,0.00034562094,0.000101440506,0.0001078358,0.00007709103,0.0004517042,0.0053510303],"genre_scores_gemma":[0.9727298,0.00028596548,0.025711,0.00006733976,0.000028349486,0.0000374451,0.000041794785,0.000015002292,0.0010834143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909306,0.00021523902,0.00005159425,0.00016263309,0.00031104454,0.00016645205],"domain_scores_gemma":[0.9980007,0.0006853684,0.00032692886,0.00016840882,0.00071891915,0.000099649405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010520046,0.00076904194,0.000526387,0.0005466963,0.00082790636,0.0013578933,0.00077405764,0.00048721276,0.00068366196],"category_scores_gemma":[0.0035749923,0.0002694794,0.00019180842,0.00062692247,0.0008166867,0.0015260195,0.0011880429,0.00064475456,0.00018750846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006651207,0.00013612937,0.0051901094,0.0002298703,0.00006596933,0.0004937222,0.00062827737,0.72446656,0.070228785,0.046650223,0.0024068905,0.14883825],"study_design_scores_gemma":[0.000022639879,0.00017398948,0.0004667853,0.000011205437,0.000032830434,0.00018146147,0.00007622582,0.98366815,0.009824042,0.004549758,0.0009630239,0.000029811941],"about_ca_topic_score_codex":0.0030653863,"about_ca_topic_score_gemma":0.0025488809,"teacher_disagreement_score":0.0030653863,"about_ca_system_score_codex":0.000969315,"about_ca_system_score_gemma":0.0017224917,"threshold_uncertainty_score":0.007032931},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01283058,0.00015793218,0.98570156,0.00006126713,0.00002827418,0.000032949356,0.000011643028,0.00007497733,0.0011008912],"genre_scores_gemma":[0.869991,0.00031815932,0.12706617,0.000102471065,0.000078309364,0.00021179997,0.000052640746,0.000037382633,0.002142195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987394,0.00038199915,0.000058937247,0.0002829924,0.00043548545,0.00010109699],"domain_scores_gemma":[0.998904,0.00045943065,0.0002644063,0.000071570306,0.0002377462,0.000062869105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016202242,0.00080017466,0.0007417151,0.00057315425,0.0005828275,0.00079081906,0.0012714511,0.000513646,0.00074861594],"category_scores_gemma":[0.0029763284,0.00032348707,0.0005661835,0.0006715879,0.0006234792,0.001055574,0.0009912791,0.0007515032,0.00014016287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015490303,0.00009323668,0.0012389354,0.00010703932,0.000060578746,0.00009020656,0.00016683727,0.8759864,0.01294138,0.01918016,0.0007785653,0.08920179],"study_design_scores_gemma":[0.000009845728,0.00010200148,0.00023445679,0.0000049030705,0.0000135420205,0.000027220543,0.0000148097615,0.99426115,0.0015344778,0.00336001,0.0004305452,0.00000709055],"about_ca_topic_score_codex":0.0011197095,"about_ca_topic_score_gemma":0.0014807583,"teacher_disagreement_score":0.0016202242,"about_ca_system_score_codex":0.0007906917,"about_ca_system_score_gemma":0.0010301258,"threshold_uncertainty_score":0.0085686445},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007510156,0.0042242217,0.00025918556,0.018761732,0.9733541,0.000023068525,0.00004131463,0.00007268508,0.0031886068],"genre_scores_gemma":[0.0006305048,0.0049810633,0.00012742597,0.009213206,0.970565,0.0000178107,0.000029439074,0.000038971655,0.0143965],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977695,0.00025887767,0.00023784924,0.0003019385,0.001235685,0.00019610299],"domain_scores_gemma":[0.9932094,0.0019370372,0.0004386892,0.00017185142,0.0030829546,0.001160026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029093898,0.0028649715,0.0023156616,0.002069229,0.0018485104,0.005430414,0.0021270046,0.008699381,0.015020983],"category_scores_gemma":[0.008514495,0.0006996855,0.0016378266,0.0010018164,0.0014911536,0.0033131153,0.0010062471,0.013914844,0.014584682],"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.00004462413,0.000016459831,0.000028109804,0.00025106853,0.000011248473,0.00018329422,0.000010555049,0.000049763155,0.00015224796,0.00064340973,0.98962855,0.008980772],"study_design_scores_gemma":[0.00002789337,0.00003834252,0.00016849485,0.00022903371,0.000020050911,0.00031919804,0.000025484083,0.00018245485,0.00021949211,0.0008829729,0.9978719,0.000014839495],"about_ca_topic_score_codex":0.00058738224,"about_ca_topic_score_gemma":0.0015137705,"teacher_disagreement_score":0.015020983,"about_ca_system_score_codex":0.0015324638,"about_ca_system_score_gemma":0.0015161898,"threshold_uncertainty_score":0.050250232},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043550273,0.00057141104,0.986312,0.00012574017,0.00014459954,0.000048106325,0.000026212538,0.00009244191,0.008324459],"genre_scores_gemma":[0.42884123,0.0015158422,0.55882674,0.0004256524,0.00032704565,0.000302169,0.00007044183,0.000078844096,0.0096120825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934083,0.00017462017,0.000034888846,0.00016405988,0.00023557465,0.000050035007],"domain_scores_gemma":[0.9996283,0.00008172713,0.0000615624,0.00006789375,0.00013937712,0.000021016664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004952099,0.00073565834,0.0005272796,0.00048720793,0.0004942938,0.00089719443,0.000967168,0.0007046228,0.0018423989],"category_scores_gemma":[0.0009838294,0.00030223053,0.00051172276,0.00044822568,0.0005769735,0.0006776746,0.00064168725,0.0007972179,0.0007490541],"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.00025174354,0.00019533488,0.00075395324,0.0005736362,0.00017925006,0.00041175622,0.00029098094,0.16955036,0.20577165,0.38134748,0.0049105245,0.23576328],"study_design_scores_gemma":[0.000042386473,0.00046519504,0.00048242867,0.000060045953,0.00007953916,0.0010393856,0.000041422678,0.8872788,0.029920883,0.03609672,0.044419054,0.00007419446],"about_ca_topic_score_codex":0.00034624583,"about_ca_topic_score_gemma":0.00045853952,"teacher_disagreement_score":0.0018423989,"about_ca_system_score_codex":0.00046722204,"about_ca_system_score_gemma":0.00049926917,"threshold_uncertainty_score":0.006163478},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017734587,0.00050723995,0.9771477,0.00059168873,0.00009922325,0.00006951689,0.000117317315,0.00044737052,0.003285387],"genre_scores_gemma":[0.7901152,0.00044632962,0.20074013,0.0006976785,0.00027307193,0.0002861813,0.00036969472,0.00023060273,0.0068410323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926335,0.00022060456,0.00003030712,0.00017289874,0.00015756143,0.0001552575],"domain_scores_gemma":[0.99785405,0.001385369,0.0001940715,0.00015509251,0.00027366565,0.00013778107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021302437,0.0012119464,0.001661629,0.00039863316,0.00059376244,0.001340159,0.0027122227,0.0015755309,0.003117445],"category_scores_gemma":[0.005463403,0.0007184079,0.00065444177,0.00083015655,0.0010994959,0.0016090393,0.0015360394,0.0019208348,0.0005886907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015002595,0.000080512145,0.00039906322,0.00006803749,0.000023011022,0.000048815436,0.000026970634,0.9672218,0.00060675456,0.006915606,0.0022408646,0.022218514],"study_design_scores_gemma":[0.0000053609797,0.0000063191455,0.000018861096,0.0000014841187,0.0000014013855,0.0000027325327,0.0000020729512,0.9983317,0.00007369622,0.0014797088,0.00007544726,0.0000011969722],"about_ca_topic_score_codex":0.00947391,"about_ca_topic_score_gemma":0.008790328,"teacher_disagreement_score":0.00947391,"about_ca_system_score_codex":0.0015888738,"about_ca_system_score_gemma":0.0020928492,"threshold_uncertainty_score":0.018837571},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017800208,0.00047654295,0.9774868,0.0005431514,0.00009206049,0.000071841125,0.000106317064,0.00040528175,0.0030178307],"genre_scores_gemma":[0.79268086,0.00043008884,0.19884698,0.00067970745,0.00026659225,0.00029268346,0.00035010203,0.00022189743,0.0062310714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992544,0.00021891487,0.000029951307,0.0001755856,0.00016273554,0.0001584211],"domain_scores_gemma":[0.99778134,0.0014359603,0.00020231474,0.00015932991,0.0002765594,0.00014445606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021738023,0.0012269906,0.0016763269,0.00040968694,0.0006054011,0.0013119659,0.0026633774,0.0015307057,0.0029011779],"category_scores_gemma":[0.0056997724,0.00070908666,0.0006660618,0.0008119525,0.0011251812,0.0016098206,0.001531622,0.0019468043,0.00054590247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015477701,0.00008712994,0.00041339835,0.00007106254,0.000023728311,0.000047789457,0.000028130542,0.96742904,0.0006570114,0.0073578954,0.0021761276,0.021553885],"study_design_scores_gemma":[0.0000059090876,0.0000073904544,0.000020655234,0.0000016062099,0.0000015753834,0.000003070062,0.000002237003,0.9981646,0.000085811305,0.0016272736,0.00007852956,0.000001331332],"about_ca_topic_score_codex":0.00840543,"about_ca_topic_score_gemma":0.008284492,"teacher_disagreement_score":0.00840543,"about_ca_system_score_codex":0.0015980783,"about_ca_system_score_gemma":0.0020906506,"threshold_uncertainty_score":0.016712964},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055522937,0.0072839446,0.91338676,0.0024144885,0.00088492,0.00018824465,0.00036133133,0.000349628,0.019607749],"genre_scores_gemma":[0.9432622,0.003994556,0.04481381,0.00026533168,0.0005962248,0.00015771107,0.00015773514,0.00004790378,0.006704568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978902,0.0006092017,0.00014718885,0.00046311252,0.00063791027,0.0002524971],"domain_scores_gemma":[0.98712033,0.0074763503,0.0020093482,0.0011107157,0.0019389793,0.00034413062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037301178,0.0009276165,0.0014162166,0.0014810581,0.0012308711,0.0031459806,0.0021126312,0.001554424,0.0023487012],"category_scores_gemma":[0.024896812,0.0007185664,0.00038694902,0.0021647296,0.0019967745,0.006977517,0.0022162253,0.0015089723,0.000776175],"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.00053844217,0.0001300265,0.0047724545,0.00084736274,0.000115253475,0.0016252175,0.0016423579,0.34383145,0.006863609,0.45001152,0.008667061,0.18095529],"study_design_scores_gemma":[0.00003795272,0.0002630178,0.00085922563,0.00008995818,0.00007314449,0.00064211874,0.00039932868,0.8153495,0.002757075,0.1662372,0.013197705,0.00009375346],"about_ca_topic_score_codex":0.0015084228,"about_ca_topic_score_gemma":0.0012767653,"teacher_disagreement_score":0.0037301178,"about_ca_system_score_codex":0.0015396014,"about_ca_system_score_gemma":0.0012067616,"threshold_uncertainty_score":0.019726992},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13866788,0.0034518677,0.83002174,0.0048001125,0.000516986,0.00016245563,0.0010934151,0.0005881178,0.020697435],"genre_scores_gemma":[0.9379494,0.0019225536,0.037959,0.00075066497,0.00078386755,0.00013207251,0.00040085037,0.00023406894,0.019867372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942009,0.002473834,0.00020756818,0.000862921,0.0010478235,0.0012069733],"domain_scores_gemma":[0.9483887,0.04199501,0.0028224522,0.0024862986,0.0029185899,0.0013890358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011516143,0.001658857,0.0033131076,0.0016451323,0.0012623424,0.004077931,0.002543907,0.0028357827,0.0071799303],"category_scores_gemma":[0.049023163,0.0017819258,0.0008695932,0.0024660653,0.0046513425,0.0076046353,0.0031500207,0.0038165275,0.0011776648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007346124,0.00009049569,0.0014480939,0.00016212462,0.00011649569,0.0003144187,0.00030025726,0.6699797,0.0016732854,0.3026502,0.005479644,0.017050676],"study_design_scores_gemma":[0.000030100451,0.000057733505,0.0005436956,0.000038987182,0.000024170182,0.00009993433,0.000066409935,0.84753513,0.0007406325,0.15012334,0.0006843436,0.000055478635],"about_ca_topic_score_codex":0.004689557,"about_ca_topic_score_gemma":0.0042348336,"teacher_disagreement_score":0.011516143,"about_ca_system_score_codex":0.0037351134,"about_ca_system_score_gemma":0.0036205826,"threshold_uncertainty_score":0.060903907},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008860119,0.00028289648,0.9867823,0.00023605935,0.000053876574,0.000047979956,0.000036093148,0.000103910155,0.0035966425],"genre_scores_gemma":[0.87765646,0.0007098441,0.11499568,0.00019720147,0.00015573787,0.00023776855,0.00012459303,0.00014720955,0.0057755257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930835,0.00024438763,0.00002733051,0.00013167062,0.00017969955,0.00010861134],"domain_scores_gemma":[0.99794704,0.0013303306,0.00027795212,0.00007487947,0.0002461526,0.000123717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016182823,0.0013396485,0.0013491401,0.00056112243,0.00046025543,0.0010614465,0.0012559587,0.0008155719,0.0021962046],"category_scores_gemma":[0.0037991197,0.00059996115,0.00057696603,0.0006064192,0.0009374776,0.0011639023,0.001080866,0.001291385,0.0003105794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000405999,0.000047223635,0.00019117547,0.00008324762,0.000024249854,0.000057711968,0.00005359494,0.95955247,0.0011995359,0.027432851,0.00072878896,0.010588578],"study_design_scores_gemma":[0.0000027827293,0.000012752911,0.000024727493,0.0000034439215,0.0000020628786,0.000004314865,0.000005336971,0.9957022,0.00012484411,0.0039537493,0.0001613455,0.0000024534884],"about_ca_topic_score_codex":0.0029046172,"about_ca_topic_score_gemma":0.0020093054,"teacher_disagreement_score":0.0029046172,"about_ca_system_score_codex":0.0015043591,"about_ca_system_score_gemma":0.0016928448,"threshold_uncertainty_score":0.010914981},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029077413,0.0002563269,0.95911086,0.00062361767,0.000051830513,0.00019210928,0.00007651336,0.00010520959,0.010506131],"genre_scores_gemma":[0.9367237,0.00033591842,0.056272376,0.00020599479,0.000037917136,0.00027342263,0.000046743608,0.0000337718,0.0060701133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849963,0.0005313872,0.000056690005,0.00028197095,0.00029196366,0.00033834865],"domain_scores_gemma":[0.9984824,0.00083953276,0.00018857188,0.00006460694,0.00025920154,0.00016564252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016067283,0.0011381909,0.001122678,0.0006852696,0.00066264626,0.0020382826,0.0018147988,0.0018814685,0.0037294573],"category_scores_gemma":[0.0033036058,0.0006357321,0.00084020133,0.00055240444,0.0018885828,0.0022006922,0.0018389839,0.001739814,0.00029064424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095480566,0.00006441332,0.00040506743,0.000101938684,0.000047000474,0.0001968654,0.000121793746,0.8859072,0.0025129041,0.10032771,0.001022661,0.009197018],"study_design_scores_gemma":[0.000012223875,0.000025803003,0.000052021598,0.0000063423945,0.000009999916,0.000020259151,0.000016809287,0.9852234,0.00021572389,0.014032115,0.0003784296,0.000006824542],"about_ca_topic_score_codex":0.0068742493,"about_ca_topic_score_gemma":0.005097385,"teacher_disagreement_score":0.0068742493,"about_ca_system_score_codex":0.0028186815,"about_ca_system_score_gemma":0.0027974278,"threshold_uncertainty_score":0.020451128},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11592863,0.0009764216,0.875994,0.00097175635,0.00012982279,0.00007595974,0.00008935933,0.0005452842,0.0052886987],"genre_scores_gemma":[0.9634385,0.00021331417,0.03320048,0.00015191048,0.00002469995,0.00004389574,0.00005424615,0.000049165723,0.0028238215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993919,0.00015599717,0.000024417497,0.00016953112,0.00010320347,0.00015495867],"domain_scores_gemma":[0.99839896,0.0010554348,0.00014662097,0.00005755092,0.0001909861,0.00015044305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011955742,0.00066644786,0.00096420903,0.00032333966,0.00045688066,0.00088831305,0.0008469441,0.0010817044,0.0033824134],"category_scores_gemma":[0.0037994157,0.00036432358,0.0003588064,0.00034325712,0.0007552912,0.0013600101,0.00089237833,0.0014378978,0.00031401677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003019316,0.00009893798,0.00059701694,0.00008893151,0.000015052574,0.00008950499,0.00007069929,0.95889235,0.0043376866,0.010284087,0.0013825895,0.02384112],"study_design_scores_gemma":[0.0000056405834,0.000024050667,0.000055511566,0.000002412191,0.0000026647024,0.000007946725,0.000007003363,0.9972892,0.0004552137,0.0020331435,0.00011441108,0.0000028429226],"about_ca_topic_score_codex":0.003563391,"about_ca_topic_score_gemma":0.003297819,"teacher_disagreement_score":0.003563391,"about_ca_system_score_codex":0.001303888,"about_ca_system_score_gemma":0.0017432201,"threshold_uncertainty_score":0.011315286},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09073208,0.00022850145,0.9029703,0.00014369506,0.00004400557,0.00004633902,0.00004045417,0.00026931346,0.0055252993],"genre_scores_gemma":[0.93543637,0.000127465,0.062421516,0.000041484007,0.000017726312,0.000048714617,0.000053158325,0.000039818,0.001813712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995413,0.00011356656,0.000016470603,0.0000950886,0.00011159878,0.000121970035],"domain_scores_gemma":[0.9996728,0.000112131325,0.000059075537,0.000045592347,0.00006584045,0.00004468681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045659937,0.00051729317,0.00041825985,0.00023278869,0.00048367406,0.000766574,0.00060501235,0.00039953616,0.0010122124],"category_scores_gemma":[0.0007694942,0.0002258537,0.00042173953,0.0003188365,0.00043091513,0.0009363756,0.0008631574,0.0005907031,0.00017544386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011588907,0.00008784684,0.0013534322,0.000049399852,0.000019225932,0.00012915765,0.00006276214,0.93345875,0.010875341,0.008437174,0.0008383356,0.044572655],"study_design_scores_gemma":[0.0000027292558,0.00004794726,0.00021271709,0.000002567936,0.000003920986,0.00002666227,0.000023155173,0.995634,0.0015856501,0.0018064389,0.00064936175,0.0000047583226],"about_ca_topic_score_codex":0.0023350338,"about_ca_topic_score_gemma":0.0037629926,"teacher_disagreement_score":0.0023350338,"about_ca_system_score_codex":0.00050999824,"about_ca_system_score_gemma":0.000929011,"threshold_uncertainty_score":0.004642844},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056145757,0.0010371,0.9315742,0.0024206624,0.00013254044,0.00006200037,0.0001120304,0.00016646775,0.00834915],"genre_scores_gemma":[0.93548864,0.0010025378,0.058401633,0.00032476074,0.00014095486,0.00008632864,0.000052272062,0.000059743383,0.0044431016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991086,0.00032336338,0.000029595221,0.000215569,0.00015159568,0.00017126922],"domain_scores_gemma":[0.9980572,0.0013741291,0.00017526171,0.00013246667,0.00015269945,0.0001083363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013490167,0.00077352236,0.00075574254,0.0002887105,0.00058600336,0.0015091541,0.0014799724,0.0015262935,0.0019560365],"category_scores_gemma":[0.004655525,0.0004558192,0.00043166894,0.0006449331,0.0017517162,0.002668911,0.0012852191,0.0013234932,0.00018835925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013026784,0.000047439004,0.00059864385,0.00007296967,0.000023964483,0.00017694493,0.00008453578,0.85791165,0.0013011104,0.12611783,0.0013106101,0.012224066],"study_design_scores_gemma":[0.000008081795,0.000017780689,0.00010179434,0.000005304378,0.0000058229257,0.000016013619,0.000023694396,0.9753981,0.00025451026,0.02360793,0.00055377436,0.000007257378],"about_ca_topic_score_codex":0.0066428715,"about_ca_topic_score_gemma":0.0055203624,"teacher_disagreement_score":0.0066428715,"about_ca_system_score_codex":0.0012549297,"about_ca_system_score_gemma":0.0010354621,"threshold_uncertainty_score":0.013208449},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06915569,0.00092784694,0.9239641,0.00022881174,0.00007788499,0.000038122347,0.000078280034,0.0001559187,0.005373281],"genre_scores_gemma":[0.9609736,0.0004066056,0.036513634,0.000076749304,0.00005737649,0.000052222313,0.000049373353,0.000021832246,0.0018484795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990345,0.00039266897,0.000027126269,0.00015276343,0.0001867364,0.00020612494],"domain_scores_gemma":[0.99861205,0.0008309216,0.00019476537,0.0001209614,0.00017546554,0.00006577323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011641235,0.0010393101,0.0008886899,0.00039355026,0.00048178056,0.00094628823,0.00090795837,0.00068605895,0.0006345496],"category_scores_gemma":[0.0028503446,0.0004083914,0.00037434054,0.0008096463,0.00087643,0.0010791061,0.0012478271,0.0008116548,0.00022730978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013444298,0.000046523084,0.0005623399,0.00007586667,0.00003722542,0.00014775405,0.000072414994,0.9562292,0.004837135,0.0118573,0.0007581413,0.025241613],"study_design_scores_gemma":[0.0000050887393,0.00005575559,0.00014748781,0.0000045400507,0.000011138597,0.000039272603,0.000022499255,0.99496967,0.0010243914,0.0032890672,0.00042415143,0.000006950701],"about_ca_topic_score_codex":0.0020428814,"about_ca_topic_score_gemma":0.0028007817,"teacher_disagreement_score":0.0020428814,"about_ca_system_score_codex":0.00080953754,"about_ca_system_score_gemma":0.0009839376,"threshold_uncertainty_score":0.0061565638},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058572553,0.0011599185,0.9314669,0.00057947164,0.0000965211,0.000046447785,0.000108240456,0.00017240566,0.0077975513],"genre_scores_gemma":[0.9629542,0.0005849252,0.031151956,0.00012073542,0.00004998761,0.000077732686,0.000065146225,0.000062526895,0.004932935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994411,0.00018921522,0.000017874918,0.000124193,0.00011330345,0.000114340415],"domain_scores_gemma":[0.99851066,0.0009859542,0.00019677696,0.00006468046,0.00016874702,0.000073122705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009975657,0.00094837864,0.0008947828,0.00041572753,0.00039916745,0.0011153304,0.00080626184,0.001103654,0.0016693232],"category_scores_gemma":[0.0031984309,0.0004875635,0.0004251184,0.00055156945,0.0012280312,0.0012686568,0.0011373276,0.001086057,0.00021120683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020502332,0.000010625256,0.00014950719,0.000019546509,0.000008568802,0.000031269003,0.000014798996,0.9890187,0.0003387949,0.0073483316,0.00019186469,0.0028476003],"study_design_scores_gemma":[0.0000023210891,0.000012049422,0.000045332843,0.000002208791,0.0000025151824,0.000004898969,0.000005534766,0.99676704,0.00012340808,0.0028889328,0.00014365466,0.0000021941453],"about_ca_topic_score_codex":0.0049475282,"about_ca_topic_score_gemma":0.0031593507,"teacher_disagreement_score":0.0049475282,"about_ca_system_score_codex":0.0015096155,"about_ca_system_score_gemma":0.0011941105,"threshold_uncertainty_score":0.010953128},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019945702,0.0005596211,0.97456115,0.00061336346,0.00009839784,0.000050755116,0.00006234788,0.00025806026,0.003850521],"genre_scores_gemma":[0.9456868,0.0003292279,0.04960603,0.00030693534,0.00008341692,0.00013183084,0.000119606884,0.00009264353,0.0036435155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993649,0.00021835731,0.00002998274,0.00015249453,0.00012616611,0.00010804596],"domain_scores_gemma":[0.99776304,0.0015554581,0.00025356765,0.00007565877,0.00023419237,0.0001180188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001557855,0.0015836254,0.0013369501,0.00050203106,0.00039128796,0.0011081015,0.0010443949,0.0013265661,0.0014602628],"category_scores_gemma":[0.0033729975,0.0006650238,0.0006109556,0.00040921097,0.0011919502,0.0010893279,0.0014994629,0.0020288485,0.00022479135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059691956,0.000021340835,0.0003293416,0.00004309298,0.000025671108,0.00006622128,0.000033158845,0.9842753,0.0006188924,0.0068590916,0.00046783054,0.0072003207],"study_design_scores_gemma":[0.0000047700837,0.000011491513,0.000025508141,0.000004073374,0.000003932485,0.0000047103044,0.0000035376218,0.99758685,0.00013056576,0.0020975803,0.00012467812,0.0000022242348],"about_ca_topic_score_codex":0.0052538826,"about_ca_topic_score_gemma":0.0043238853,"teacher_disagreement_score":0.0052538826,"about_ca_system_score_codex":0.0011303384,"about_ca_system_score_gemma":0.001744105,"threshold_uncertainty_score":0.010446608},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40531206,0.0003162745,0.56664634,0.00028406933,0.00010626147,0.00016311016,0.00022771429,0.0018320729,0.025112119],"genre_scores_gemma":[0.9903655,0.000036543886,0.008986593,0.00001466302,0.0000037068055,0.00001962488,0.00003540465,0.000012775051,0.00052530307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978477,0.000051270406,0.0000102071035,0.000037511803,0.000065897075,0.0000503537],"domain_scores_gemma":[0.99974996,0.000079973186,0.00005094568,0.000027730453,0.000058023477,0.000033408825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004209727,0.0003862622,0.00034735142,0.00026167836,0.00032471094,0.00062230433,0.0006467948,0.0002280307,0.0018003054],"category_scores_gemma":[0.0006834425,0.000120527744,0.00024985897,0.0003012659,0.00039212045,0.00041368348,0.0005847408,0.00035551062,0.00015349784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010133534,0.00003481496,0.0010042442,0.000028358021,0.000014986171,0.00004938318,0.000031898744,0.98236334,0.0017849279,0.0026886016,0.0004104062,0.011487581],"study_design_scores_gemma":[0.00001062373,0.000052173673,0.0002480084,0.0000022771078,0.0000059041604,0.000007827801,0.000016551066,0.9976956,0.00083863124,0.000578743,0.0005403952,0.0000032507478],"about_ca_topic_score_codex":0.008214113,"about_ca_topic_score_gemma":0.006955277,"teacher_disagreement_score":0.008214113,"about_ca_system_score_codex":0.0006942274,"about_ca_system_score_gemma":0.0008424413,"threshold_uncertainty_score":0.016332626},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027772225,0.0005058146,0.9685707,0.00021662006,0.00010284336,0.00007947961,0.00006282505,0.0004978868,0.002191658],"genre_scores_gemma":[0.9404924,0.00038200014,0.057191577,0.00018789682,0.000112279355,0.00016355114,0.000086204556,0.00003354119,0.0013506727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860954,0.00042894125,0.00008744649,0.0002609535,0.00038922322,0.00022375735],"domain_scores_gemma":[0.99775213,0.000871658,0.00039103674,0.0004339467,0.00044241105,0.00010873257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014385688,0.00076249294,0.00072117883,0.0007871583,0.0008543395,0.00063781854,0.0014543912,0.0006143712,0.0015049744],"category_scores_gemma":[0.0044425298,0.0002476913,0.000660287,0.0009024261,0.0007845612,0.0014460152,0.0010107091,0.00096881646,0.00034373833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012687424,0.0002684478,0.0052822083,0.00049918407,0.00023260574,0.0012457757,0.0009924711,0.4067793,0.11137555,0.2339323,0.0071919975,0.23093148],"study_design_scores_gemma":[0.00010353641,0.00031303565,0.0009262962,0.00002802117,0.00010167443,0.0008151994,0.00005805241,0.9573381,0.00889624,0.02664753,0.004691227,0.00008113485],"about_ca_topic_score_codex":0.00122837,"about_ca_topic_score_gemma":0.001578304,"teacher_disagreement_score":0.0015049744,"about_ca_system_score_codex":0.00074490724,"about_ca_system_score_gemma":0.0007345092,"threshold_uncertainty_score":0.0076079965},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6027461,0.0021149358,0.38607287,0.00043874193,0.000068369605,0.00006197904,0.00018883379,0.00029012017,0.0080178995],"genre_scores_gemma":[0.99511576,0.00029060038,0.0037173938,0.000025521365,0.000012475256,0.000010036776,0.000026813126,0.000013861163,0.0007875928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993406,0.00013689633,0.00003205723,0.0000897152,0.00023317894,0.00016764602],"domain_scores_gemma":[0.9974406,0.001354333,0.000365197,0.00018920729,0.0005912618,0.00005941431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009732507,0.000545457,0.00053004554,0.0007941744,0.00040150707,0.0007261093,0.0004957795,0.00039937146,0.0012464996],"category_scores_gemma":[0.003930914,0.00016305,0.0002455937,0.0007492779,0.00069647754,0.0015365647,0.0005712027,0.00044443904,0.00014325263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015847609,0.000034119577,0.0034117661,0.00007938277,0.000032175343,0.00017906354,0.00019647498,0.9391011,0.014030907,0.026255744,0.000608787,0.015912002],"study_design_scores_gemma":[0.0000018274753,0.000036596488,0.0007294818,0.0000049546948,0.000009582284,0.000052724383,0.000034250643,0.99566627,0.0015855955,0.0017106461,0.00015952298,0.000008589119],"about_ca_topic_score_codex":0.004037165,"about_ca_topic_score_gemma":0.0025410217,"teacher_disagreement_score":0.004037165,"about_ca_system_score_codex":0.0012801565,"about_ca_system_score_gemma":0.000645361,"threshold_uncertainty_score":0.009288251},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113800324,0.00047343865,0.88120294,0.0001808521,0.00011747907,0.00010958674,0.000056205827,0.0006511729,0.0034079475],"genre_scores_gemma":[0.95087093,0.0000878111,0.047722243,0.000060040886,0.00004537183,0.000041741525,0.0000330518,0.000015901893,0.001122961],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963474,0.00006730842,0.000021969823,0.00009143361,0.00008617281,0.000098369],"domain_scores_gemma":[0.9992982,0.00021266354,0.00014554837,0.00015226276,0.000101490885,0.00008982055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034327203,0.00053703546,0.00040855104,0.0005457451,0.00064286654,0.00057268306,0.0013709161,0.00040762016,0.0010817524],"category_scores_gemma":[0.0012106374,0.00014845775,0.00025535654,0.00046057653,0.00047601218,0.00085449783,0.0010396235,0.00045070468,0.00017212292],"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.0011266699,0.00024388089,0.00377733,0.00022864042,0.00012070596,0.0009974572,0.00042137312,0.3744356,0.11389695,0.0469735,0.005026409,0.45275152],"study_design_scores_gemma":[0.00004316294,0.00030380464,0.0005236394,0.000011509694,0.000044304245,0.00055345544,0.000065666216,0.9771549,0.011478346,0.0069177607,0.0028739502,0.000029622739],"about_ca_topic_score_codex":0.0013104354,"about_ca_topic_score_gemma":0.0018847173,"teacher_disagreement_score":0.0013709161,"about_ca_system_score_codex":0.0005325538,"about_ca_system_score_gemma":0.00051745714,"threshold_uncertainty_score":0.0038639307},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048235677,0.0004905496,0.9476143,0.00029628436,0.00011430473,0.00013967429,0.00014933676,0.00029366987,0.0026661793],"genre_scores_gemma":[0.92778236,0.0003272543,0.06960793,0.00012315427,0.00004696268,0.000118624645,0.00011564861,0.00001840043,0.0018596363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993057,0.00013067103,0.00004847969,0.00015016954,0.00019200255,0.00017295193],"domain_scores_gemma":[0.99830973,0.0006522989,0.00025885538,0.00020064159,0.00044288102,0.00013561014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011046707,0.0006984227,0.0005578009,0.0006773537,0.0009012458,0.0007192416,0.0016874648,0.00061098643,0.0011232524],"category_scores_gemma":[0.0037453119,0.00021437796,0.00033942086,0.00060736237,0.0007477575,0.0015761303,0.0018131782,0.0010364377,0.00016038041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046709809,0.00012120728,0.002461475,0.00024528927,0.000061500934,0.0006893211,0.0005654222,0.669272,0.021532975,0.13353086,0.0048422934,0.16621059],"study_design_scores_gemma":[0.000019517143,0.00010297419,0.00022854212,0.000012350299,0.000019755229,0.00016308966,0.00004759197,0.9793854,0.003946183,0.013288692,0.0027573686,0.000028516688],"about_ca_topic_score_codex":0.004291524,"about_ca_topic_score_gemma":0.0046725213,"teacher_disagreement_score":0.004291524,"about_ca_system_score_codex":0.0016866471,"about_ca_system_score_gemma":0.0021029157,"threshold_uncertainty_score":0.012237549},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013108413,0.00017067269,0.9840321,0.00030136626,0.000042106618,0.00006227674,0.000061033472,0.0006227457,0.0015992991],"genre_scores_gemma":[0.70196915,0.00019648045,0.29394582,0.0003595293,0.00010257437,0.0002262507,0.00028365047,0.00018048569,0.0027360013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988426,0.00034785015,0.00005447205,0.00024778637,0.0002659597,0.00024136662],"domain_scores_gemma":[0.9969021,0.0017371055,0.00032271634,0.00032543082,0.000421252,0.00029131505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024313766,0.00084556243,0.0017835152,0.0006534885,0.00081703695,0.0012741333,0.0029331273,0.0011360457,0.002776413],"category_scores_gemma":[0.0058805975,0.00055959035,0.0005890083,0.0010956033,0.0010195058,0.002169701,0.001798049,0.0019578573,0.00060822],"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.0002105244,0.00018791012,0.00089019776,0.00006298884,0.000032008284,0.00006265382,0.00008485004,0.9058275,0.0012121599,0.013893653,0.002637467,0.074898005],"study_design_scores_gemma":[0.0000069606067,0.000009823297,0.000023108902,0.0000019528607,0.000001596416,0.000005418714,0.0000052975934,0.9971967,0.00018593376,0.0024557882,0.00010531078,0.0000020526109],"about_ca_topic_score_codex":0.005611087,"about_ca_topic_score_gemma":0.0060321726,"teacher_disagreement_score":0.005611087,"about_ca_system_score_codex":0.0019955728,"about_ca_system_score_gemma":0.0039073634,"threshold_uncertainty_score":0.0144789815},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012045264,0.00038923958,0.98594344,0.00018621338,0.000026344662,0.000027195712,0.00009368631,0.00008380209,0.0012048648],"genre_scores_gemma":[0.67258686,0.00097144756,0.31989706,0.0002501593,0.00013459196,0.00026799756,0.0005114299,0.00017987376,0.0052005807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936706,0.00019420458,0.00002475159,0.00016637865,0.00016504359,0.00008260639],"domain_scores_gemma":[0.9988269,0.0007491808,0.00015073018,0.00006626416,0.00014390184,0.000062924715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010715884,0.0013456034,0.001061532,0.00053893146,0.00028928273,0.00076394243,0.0011519503,0.0012137648,0.001268266],"category_scores_gemma":[0.002561168,0.0005261151,0.0007330561,0.0008210169,0.00068846333,0.0011809827,0.0010125615,0.0011364234,0.00030573693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005516443,0.00003690161,0.00041875575,0.00008641427,0.00004246486,0.00005784012,0.000040514573,0.9721696,0.001710244,0.0057898983,0.0010397525,0.01855256],"study_design_scores_gemma":[0.0000029273594,0.00002131627,0.00010606806,0.000003917864,0.0000042176134,0.000012374451,0.000007654925,0.99736434,0.00033151126,0.0019194222,0.00022280651,0.0000034234388],"about_ca_topic_score_codex":0.0045758574,"about_ca_topic_score_gemma":0.0029136615,"teacher_disagreement_score":0.0045758574,"about_ca_system_score_codex":0.0010213645,"about_ca_system_score_gemma":0.0012173755,"threshold_uncertainty_score":0.009098411},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05733309,0.0004868662,0.9353308,0.00033856407,0.000113570735,0.00007478699,0.000064960695,0.0008162204,0.005441098],"genre_scores_gemma":[0.9123685,0.00017510347,0.08260848,0.0002704965,0.000051917596,0.00008704667,0.00012770199,0.00010413949,0.004206579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972445,0.000037338443,0.000012413035,0.00006630739,0.00006337857,0.000096128235],"domain_scores_gemma":[0.9995771,0.00016485267,0.000045823883,0.000046925063,0.00010111763,0.00006410104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048754475,0.0007363443,0.00094094157,0.00032266867,0.00048708165,0.00069263775,0.0013503407,0.00069614575,0.002295888],"category_scores_gemma":[0.0011411889,0.00031998332,0.0004259731,0.0004099036,0.0006257005,0.0010741231,0.0010049011,0.0009824104,0.00025669226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019671493,0.00015261989,0.0011206929,0.000068570575,0.00003014567,0.00009542842,0.000056195917,0.8939624,0.003832104,0.0054126414,0.0024317673,0.09264074],"study_design_scores_gemma":[0.0000043289015,0.000011194434,0.00004589827,0.0000017916424,0.000002526016,0.0000051863763,0.000003878375,0.9984603,0.0002596783,0.001052693,0.00015086912,0.0000016770582],"about_ca_topic_score_codex":0.010110654,"about_ca_topic_score_gemma":0.012954043,"teacher_disagreement_score":0.010110654,"about_ca_system_score_codex":0.00088335556,"about_ca_system_score_gemma":0.0017791409,"threshold_uncertainty_score":0.020103574},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059528388,0.0001914779,0.93613046,0.0002625743,0.000056395744,0.00006254972,0.000022544113,0.0006056664,0.003139881],"genre_scores_gemma":[0.974451,0.00003509331,0.024370229,0.00007487551,0.000012371938,0.000041899013,0.00002007,0.00001773923,0.0009767228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928904,0.00022823199,0.000026128835,0.00015212318,0.00016068299,0.00014375438],"domain_scores_gemma":[0.99818414,0.0009357234,0.00021981703,0.00023186614,0.00028745187,0.0001409223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001685282,0.0008458267,0.00082381774,0.0003438003,0.000518427,0.00091732095,0.0013314082,0.001008104,0.0014900096],"category_scores_gemma":[0.004515825,0.00031190013,0.00029866095,0.0003399534,0.0010124805,0.0012323135,0.0017756317,0.0013131015,0.00027507526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010988981,0.00008080156,0.0006734051,0.000020969856,0.000019943298,0.00006002761,0.000041016792,0.9597786,0.0010368929,0.004356048,0.00058259023,0.033239916],"study_design_scores_gemma":[0.0000059578674,0.000026332107,0.000041934687,0.0000018989588,0.0000017874369,0.0000074047857,0.000004729825,0.9977767,0.000251104,0.0017661277,0.00011393009,0.000002119828],"about_ca_topic_score_codex":0.004846233,"about_ca_topic_score_gemma":0.0041147806,"teacher_disagreement_score":0.004846233,"about_ca_system_score_codex":0.00070968363,"about_ca_system_score_gemma":0.0012205878,"threshold_uncertainty_score":0.0096360445},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04225906,0.00030561516,0.95455766,0.00038426224,0.00006156542,0.00007021035,0.00011805886,0.0008407383,0.0014028564],"genre_scores_gemma":[0.8792326,0.00014688243,0.11783842,0.00028612567,0.000066192224,0.00014536141,0.00023650199,0.000094358365,0.0019534745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862707,0.0003982594,0.00006184664,0.00034570292,0.00021417241,0.00035295673],"domain_scores_gemma":[0.99436873,0.003686227,0.00049102085,0.0004766928,0.0005764494,0.000400875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003128771,0.00095066795,0.001788484,0.0005668484,0.0008260753,0.001213774,0.002313062,0.0013791387,0.0018923635],"category_scores_gemma":[0.008157811,0.00059853727,0.000652656,0.0010496401,0.0010668783,0.0020508147,0.0017655855,0.002037245,0.00042988308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023650669,0.00013510139,0.0009736508,0.000047082878,0.000031055013,0.00005444636,0.000054588087,0.9470438,0.0008682806,0.0041542654,0.0013996403,0.04500168],"study_design_scores_gemma":[0.000008521011,0.000015480156,0.000055194858,0.0000018802571,0.0000023265554,0.0000068386876,0.0000069560597,0.99771297,0.00022317622,0.0018997315,0.00006450016,0.0000025729644],"about_ca_topic_score_codex":0.0070208884,"about_ca_topic_score_gemma":0.006914272,"teacher_disagreement_score":0.0070208884,"about_ca_system_score_codex":0.0017100828,"about_ca_system_score_gemma":0.003518493,"threshold_uncertainty_score":0.016546726},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025177112,0.00010882276,0.97337633,0.00011501519,0.000019557887,0.000034668887,0.000029965158,0.00016883726,0.0009696336],"genre_scores_gemma":[0.8288314,0.00011484521,0.16915226,0.0001396722,0.000019459989,0.0001191654,0.00008547432,0.000045040815,0.0014927309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984806,0.00073898124,0.00006899604,0.000203938,0.0003039108,0.00020354979],"domain_scores_gemma":[0.9977137,0.0013043637,0.00027925023,0.00022800654,0.000350011,0.0001246129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026264838,0.0009495459,0.0013655521,0.000601299,0.0007087505,0.00088846846,0.0017438759,0.0009274455,0.0014108287],"category_scores_gemma":[0.0050989646,0.0004094978,0.00073835853,0.0011242577,0.00080245436,0.0013615984,0.0013635922,0.0009628655,0.0002560826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016378857,0.000089422116,0.00037743995,0.00005338376,0.00005420375,0.000055543154,0.00005023633,0.9518737,0.001638956,0.014438332,0.00067432673,0.030530611],"study_design_scores_gemma":[0.000008604579,0.000025735633,0.000042719246,0.0000018859456,0.0000041990393,0.000017893917,0.0000063024954,0.9927941,0.0003747916,0.00658956,0.00013045264,0.0000037569691],"about_ca_topic_score_codex":0.001830893,"about_ca_topic_score_gemma":0.002266936,"teacher_disagreement_score":0.0026264838,"about_ca_system_score_codex":0.0009845467,"about_ca_system_score_gemma":0.0011720557,"threshold_uncertainty_score":0.013890326},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3990611,0.00054633216,0.57320446,0.0011606398,0.00016135261,0.00020781618,0.00031069558,0.00048258173,0.02486502],"genre_scores_gemma":[0.95248955,0.00018225456,0.042387966,0.00007074312,0.00003109088,0.000076302254,0.00010755132,0.00006537498,0.004589193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996444,0.00007521685,0.000013461403,0.00007063126,0.000047362908,0.00014902795],"domain_scores_gemma":[0.998993,0.0006797175,0.000078712575,0.00004728345,0.000088754525,0.000112530564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005819583,0.000686039,0.0010814809,0.00037912026,0.00045960152,0.0010019175,0.0006958456,0.00076122134,0.003958503],"category_scores_gemma":[0.0023046318,0.00034946625,0.00038180512,0.00047076607,0.00063186797,0.000815577,0.0009100391,0.0008349717,0.00025573466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014048161,0.0000633976,0.00020548915,0.000034017954,0.000007692697,0.00005404037,0.000023283428,0.9845057,0.0011462566,0.006254822,0.0007708927,0.006793927],"study_design_scores_gemma":[0.0000072368625,0.000013037177,0.00004724904,0.0000013975603,0.0000014887723,0.000002589867,0.000007989328,0.9983487,0.00019745408,0.0013000601,0.000071220195,0.0000015862097],"about_ca_topic_score_codex":0.009897531,"about_ca_topic_score_gemma":0.0067018247,"teacher_disagreement_score":0.009897531,"about_ca_system_score_codex":0.0013331744,"about_ca_system_score_gemma":0.0022141722,"threshold_uncertainty_score":0.019679844},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23790467,0.00039244004,0.7530335,0.0007407873,0.00010370139,0.00010915167,0.00009579659,0.00036132403,0.0072586224],"genre_scores_gemma":[0.979202,0.00006916035,0.019533226,0.000048210848,0.000021112477,0.00002506442,0.00003755209,0.000020934358,0.0010426271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994031,0.000099053665,0.000019843445,0.00014580942,0.00009608543,0.00023592118],"domain_scores_gemma":[0.999238,0.00033517534,0.00012023305,0.00004475167,0.00014260935,0.000119345874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006775289,0.00073669804,0.000691977,0.00033025348,0.0007753925,0.0011743685,0.00083779654,0.00060746074,0.0011940007],"category_scores_gemma":[0.00156573,0.0003586792,0.00028206687,0.00037174483,0.00053339405,0.0011139389,0.0008243647,0.00070987875,0.00013800817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030084932,0.00010800673,0.0021033809,0.000059645507,0.000022759586,0.00017768623,0.00013010741,0.93783504,0.0058997744,0.007949376,0.001816982,0.04359642],"study_design_scores_gemma":[0.0000040081673,0.000030598552,0.0001951386,0.0000018998246,0.000003995321,0.0000135777,0.00004781101,0.9966174,0.00066116476,0.0021559312,0.00026455458,0.000003986643],"about_ca_topic_score_codex":0.0058271154,"about_ca_topic_score_gemma":0.00817104,"teacher_disagreement_score":0.0058271154,"about_ca_system_score_codex":0.0009558458,"about_ca_system_score_gemma":0.0017633598,"threshold_uncertainty_score":0.011586428},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03094986,0.0009698868,0.9651051,0.0002095234,0.00005192556,0.000026537627,0.000034444907,0.00006671043,0.0025860379],"genre_scores_gemma":[0.9313722,0.0009796921,0.0647538,0.000117830925,0.000086197,0.00006542443,0.000049274204,0.000040313742,0.0025353404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930406,0.00021746312,0.000037501854,0.00013907037,0.00021042561,0.00009147226],"domain_scores_gemma":[0.9985769,0.00082788075,0.00022776613,0.00008261849,0.00022247147,0.00006237514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010847946,0.00069875125,0.00068458356,0.0004029019,0.00039303902,0.00062862464,0.00062011107,0.0006044132,0.00075978175],"category_scores_gemma":[0.0031950136,0.00029642077,0.00031200305,0.00049866515,0.0006908772,0.0012210872,0.00090137246,0.00073594094,0.0001336673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006815096,0.000039978695,0.0008218871,0.000090842346,0.00002857143,0.000067881185,0.00007637344,0.9373915,0.0043349895,0.022820352,0.0007169331,0.033542532],"study_design_scores_gemma":[0.0000033743077,0.0000523668,0.00018396236,0.000006203479,0.000008471384,0.0000318984,0.00001503865,0.9928722,0.0012862498,0.0050797267,0.00045410133,0.0000065181325],"about_ca_topic_score_codex":0.0017097335,"about_ca_topic_score_gemma":0.0016137979,"teacher_disagreement_score":0.0017097335,"about_ca_system_score_codex":0.0009074792,"about_ca_system_score_gemma":0.0010386509,"threshold_uncertainty_score":0.0065842867},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9976248,0.000115465424,0.00043782245,0.00007745449,0.000010965643,0.0000065758195,0.00051714224,0.00003228753,0.0011774974],"genre_scores_gemma":[0.99793833,0.000040232,0.00019102985,0.000020230673,0.0000020609739,0.000009169519,0.0004619899,0.000018832348,0.0013181278],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99991775,0.000003816439,0.0000040599134,0.000024199484,0.000019477124,0.000030750158],"domain_scores_gemma":[0.99976355,0.00007643755,0.00003362029,0.000017525412,0.00005913772,0.000049792925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001615498,0.00021049072,0.00038376433,0.00023724927,0.0006255467,0.00076992076,0.00034386062,0.0004913714,0.002961395],"category_scores_gemma":[0.0006157758,0.0001758376,0.00024317813,0.00026844366,0.00029001315,0.000659713,0.00039527117,0.00075430574,0.0003958315],"study_design_candidate":"observational","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.0017103439,0.00015628777,0.02667965,0.00014575628,0.00006785074,0.00035781792,0.00016979525,0.0071213855,0.95037204,0.0009569068,0.00068775215,0.011574428],"study_design_scores_gemma":[0.00011020394,0.0005936431,0.54390705,0.000040613704,0.000049383547,0.00019193806,0.0010415775,0.06561886,0.37964997,0.0014388143,0.007262208,0.00009573506],"about_ca_topic_score_codex":0.020526066,"about_ca_topic_score_gemma":0.019676877,"teacher_disagreement_score":0.020526066,"about_ca_system_score_codex":0.0011065396,"about_ca_system_score_gemma":0.0005302719,"threshold_uncertainty_score":0.040813148},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049053453,0.09513943,0.7231755,0.0528079,0.0027243895,0.00020275051,0.00022852226,0.0006206905,0.076047346],"genre_scores_gemma":[0.7699233,0.09556386,0.118415125,0.0043399283,0.0040236353,0.00016801535,0.00018186223,0.0001648142,0.0072195027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99788564,0.0008850725,0.000077468394,0.00032079272,0.0005269346,0.00030409836],"domain_scores_gemma":[0.9919409,0.005569422,0.00053402444,0.0006846489,0.0008618143,0.00040928213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004502392,0.0010011867,0.0010016694,0.0007789874,0.0012768632,0.004819161,0.0019512604,0.0026132192,0.0028853812],"category_scores_gemma":[0.008123956,0.0004743415,0.0006467655,0.0013360096,0.002798653,0.010614505,0.0026738339,0.004369948,0.0006452682],"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.0001880116,0.00023393614,0.0031545183,0.0009711069,0.00009215231,0.0003801341,0.0005078712,0.11866843,0.004392416,0.55839616,0.014909201,0.29810598],"study_design_scores_gemma":[0.000022861239,0.00029904116,0.0011696335,0.00069043617,0.000049264516,0.0005013325,0.002070732,0.38364807,0.0022649632,0.52826214,0.08091601,0.00010559233],"about_ca_topic_score_codex":0.001535149,"about_ca_topic_score_gemma":0.0020387007,"teacher_disagreement_score":0.004819161,"about_ca_system_score_codex":0.00097494584,"about_ca_system_score_gemma":0.0018284885,"threshold_uncertainty_score":0.023811162},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015987977,0.0005707602,0.97831726,0.00048063378,0.00012518809,0.000057889894,0.00003982803,0.0004433692,0.003977074],"genre_scores_gemma":[0.90802115,0.0005127748,0.08531903,0.0004062635,0.00013201601,0.00018449368,0.00012917031,0.0000737605,0.0052214423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999613,0.000073671545,0.000019691015,0.00010788258,0.000104391314,0.00008146722],"domain_scores_gemma":[0.99951243,0.00023546415,0.000064362306,0.000057498513,0.00009177814,0.00003855661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006925582,0.0008353438,0.00078797597,0.00018026505,0.00030638938,0.0008550394,0.00081668363,0.00091745675,0.0021284393],"category_scores_gemma":[0.001545754,0.00037463216,0.00036138017,0.00027676465,0.0007536411,0.00090497645,0.0011775425,0.0020100714,0.0002277265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042402102,0.000052118634,0.0005472017,0.00007271187,0.000026824691,0.000043800064,0.00003799407,0.932871,0.0021972607,0.007156669,0.001574999,0.055377044],"study_design_scores_gemma":[0.000003420484,0.000013356826,0.000050470768,0.0000028341803,0.0000021822082,0.0000051163556,0.0000025279123,0.99840695,0.00032929974,0.00086619664,0.00031567432,0.0000020148589],"about_ca_topic_score_codex":0.006807793,"about_ca_topic_score_gemma":0.0052534286,"teacher_disagreement_score":0.006807793,"about_ca_system_score_codex":0.00088190654,"about_ca_system_score_gemma":0.0017422669,"threshold_uncertainty_score":0.013536334},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035784777,0.0002317232,0.9608981,0.00031634586,0.0000641832,0.00005750767,0.000027569806,0.0006644261,0.0019552698],"genre_scores_gemma":[0.9587042,0.00011488878,0.0393208,0.00016700174,0.00004858077,0.000060536706,0.00005868135,0.000044117776,0.0014812597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994093,0.00015856916,0.000029810975,0.00015358705,0.00013245728,0.00011631954],"domain_scores_gemma":[0.9990453,0.0004533591,0.00013977969,0.00008790691,0.00017438717,0.00009919041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072134007,0.0009799363,0.0008971363,0.0006020218,0.000679646,0.0009405781,0.0016435363,0.0008321901,0.0014823526],"category_scores_gemma":[0.0021990445,0.00031566943,0.000430506,0.00078120234,0.0009342177,0.001865164,0.0014647626,0.0012828289,0.00017403548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018596803,0.00016760803,0.0018722356,0.000070683454,0.000048038597,0.00013402634,0.0001350497,0.84108007,0.004250401,0.013779904,0.0023185762,0.13595745],"study_design_scores_gemma":[0.0000041852068,0.000017154356,0.00008714526,0.0000014019515,0.00000412727,0.000012702163,0.00000699508,0.9967102,0.00037865603,0.0026123181,0.00016211112,0.0000029760972],"about_ca_topic_score_codex":0.005733981,"about_ca_topic_score_gemma":0.006873979,"teacher_disagreement_score":0.005733981,"about_ca_system_score_codex":0.0010487145,"about_ca_system_score_gemma":0.001050014,"threshold_uncertainty_score":0.011401176},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036687057,0.0010176374,0.9591633,0.0002469331,0.00008500421,0.00005337773,0.000046924808,0.0001553719,0.0025444785],"genre_scores_gemma":[0.94694597,0.0004416516,0.051187575,0.000114166396,0.000079578705,0.000058602946,0.00005672468,0.000022777165,0.0010929053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869967,0.00040297981,0.00005364513,0.0002069521,0.00045229384,0.00018434388],"domain_scores_gemma":[0.9979304,0.00091320433,0.0004475007,0.00018532253,0.00038401753,0.00013952213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012345086,0.0009285414,0.0008266723,0.00061058416,0.00052274525,0.0008919546,0.0011002755,0.000597985,0.00045005657],"category_scores_gemma":[0.004247924,0.00026298294,0.00032731303,0.0007493218,0.0007284262,0.0013970986,0.0015580524,0.0008425596,0.000120638135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002473221,0.00012961205,0.0040177163,0.00016561578,0.00009769692,0.00014921429,0.00019631382,0.8131014,0.013966033,0.03763753,0.0017911632,0.12850028],"study_design_scores_gemma":[0.0000053680524,0.00020169708,0.00072045234,0.000011784004,0.000026324038,0.000084853404,0.00003965221,0.9845591,0.0030806137,0.01015991,0.0010920834,0.000018097717],"about_ca_topic_score_codex":0.0010217645,"about_ca_topic_score_gemma":0.0010459177,"teacher_disagreement_score":0.0012345086,"about_ca_system_score_codex":0.00089074945,"about_ca_system_score_gemma":0.0011439987,"threshold_uncertainty_score":0.006528735},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07139338,0.0009269436,0.8954237,0.00087440456,0.00035393718,0.00018875048,0.00060438644,0.001289713,0.02894476],"genre_scores_gemma":[0.85524035,0.00043592858,0.12121919,0.00014382708,0.00007845469,0.00012347045,0.00047778137,0.00009721595,0.0221838],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969447,0.00004908086,0.00001610146,0.00005905012,0.00010067224,0.00008068132],"domain_scores_gemma":[0.99964035,0.000092256596,0.00001990115,0.000101824575,0.00009453884,0.00005118787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033398904,0.00026844317,0.00051424635,0.00024594332,0.0008034414,0.0009210627,0.0010761105,0.0007118179,0.012039988],"category_scores_gemma":[0.00074123987,0.00014207646,0.00029877428,0.00062299456,0.00035717897,0.001381899,0.0016259807,0.00079557486,0.0010639359],"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.0010067257,0.00039957764,0.0009653669,0.00046623938,0.00009656537,0.0005619168,0.00040386576,0.3609665,0.0312489,0.1681044,0.030886535,0.4048934],"study_design_scores_gemma":[0.000058400656,0.00013482015,0.0001883965,0.000029215438,0.000017946213,0.00017084084,0.00011450563,0.9120276,0.0065701115,0.06415595,0.016515344,0.000016906082],"about_ca_topic_score_codex":0.0021118794,"about_ca_topic_score_gemma":0.0026562626,"teacher_disagreement_score":0.012039988,"about_ca_system_score_codex":0.0005563985,"about_ca_system_score_gemma":0.0011854514,"threshold_uncertainty_score":0.04027778},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07074727,0.00065393886,0.925998,0.0002241463,0.000061032766,0.000053525473,0.000031874915,0.00017891682,0.0020513225],"genre_scores_gemma":[0.95011705,0.00026635913,0.04843711,0.000084723506,0.00003955279,0.000040887327,0.000016478276,0.000023636547,0.0009742557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940145,0.00017546494,0.000034579876,0.0001149649,0.00014459172,0.00012893227],"domain_scores_gemma":[0.9984274,0.00076040084,0.0002888301,0.00019639649,0.00019621919,0.00013072637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012566725,0.00063131895,0.0009330519,0.00043843975,0.00079457246,0.0007678567,0.0015327156,0.0005443458,0.0005745813],"category_scores_gemma":[0.0031241667,0.0002687451,0.0003428913,0.00055371964,0.000703195,0.001419368,0.0011640049,0.0006916634,0.00011295915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004411989,0.00019647091,0.0016877952,0.00024053716,0.00007683412,0.00036419535,0.00044371677,0.78312796,0.043124482,0.075834624,0.0023653703,0.09209688],"study_design_scores_gemma":[0.000008092686,0.00008909841,0.00017665679,0.0000072141324,0.000011561621,0.00010598988,0.00002644506,0.99033713,0.002788346,0.005930151,0.00050974294,0.000009546543],"about_ca_topic_score_codex":0.0013742206,"about_ca_topic_score_gemma":0.0012966007,"teacher_disagreement_score":0.0015327156,"about_ca_system_score_codex":0.0009663068,"about_ca_system_score_gemma":0.0011133878,"threshold_uncertainty_score":0.0070111156},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024219606,0.0008962934,0.9692899,0.00028006622,0.000071139904,0.00004095953,0.00008086378,0.00009618695,0.0050249267],"genre_scores_gemma":[0.8919906,0.0010363432,0.100515395,0.00019725533,0.00016450507,0.00013993315,0.00013969048,0.0001006842,0.005715608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991412,0.0003000725,0.000034771612,0.00014845857,0.00023718861,0.00013834523],"domain_scores_gemma":[0.9982374,0.0011432562,0.00019358289,0.000092189344,0.00025177305,0.00008169954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012639505,0.0009906981,0.0010062788,0.00052872376,0.00035883015,0.0010201951,0.0008126864,0.00060439535,0.0013349641],"category_scores_gemma":[0.003931008,0.00034432625,0.0004195689,0.00069549785,0.00070897926,0.0014166901,0.0010303161,0.0008839508,0.00021306482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011828568,0.00006519093,0.0009163001,0.00017278598,0.0000577161,0.000121986704,0.00009853841,0.905375,0.0032040963,0.048864897,0.0024125688,0.038592603],"study_design_scores_gemma":[0.0000047524413,0.000035771867,0.00014412886,0.000007252706,0.000009393345,0.000029760717,0.000012987404,0.99162877,0.0005921282,0.006784075,0.00074568193,0.0000053220656],"about_ca_topic_score_codex":0.0018336698,"about_ca_topic_score_gemma":0.001411434,"teacher_disagreement_score":0.0018336698,"about_ca_system_score_codex":0.0010715685,"about_ca_system_score_gemma":0.0012984693,"threshold_uncertainty_score":0.00777483},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16574094,0.0007649858,0.8282809,0.0005507451,0.00011057796,0.000052784268,0.00008704846,0.000715436,0.0036964985],"genre_scores_gemma":[0.97719085,0.00009178464,0.021242218,0.00009504282,0.000022940865,0.000027384081,0.00004434654,0.000021823582,0.0012635654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997168,0.0000646968,0.0000119208435,0.00006907343,0.00005554606,0.00008198684],"domain_scores_gemma":[0.99900466,0.00051998225,0.00015023703,0.00005567455,0.00017066934,0.00009878706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006894032,0.00065692136,0.00081372244,0.00026038272,0.000271979,0.00054709817,0.0012378519,0.00071907684,0.00092075526],"category_scores_gemma":[0.0025586379,0.00030626266,0.0002963623,0.00028752437,0.00053056766,0.0008134565,0.0006888736,0.001035147,0.00015727377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079741745,0.00008352353,0.0014336536,0.000027836413,0.000021264637,0.000041131076,0.000026210311,0.9702087,0.0016317635,0.0021472457,0.0006904256,0.023608418],"study_design_scores_gemma":[0.0000030937688,0.000010006981,0.000044355966,9.2354907e-7,0.00000203785,0.0000026183136,0.0000017463982,0.9993704,0.0001352616,0.0003904142,0.000038049275,0.0000011078901],"about_ca_topic_score_codex":0.010015348,"about_ca_topic_score_gemma":0.012153014,"teacher_disagreement_score":0.010015348,"about_ca_system_score_codex":0.0010464351,"about_ca_system_score_gemma":0.0014327993,"threshold_uncertainty_score":0.01991409},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12058864,0.0012459714,0.8649706,0.00056106324,0.00008982012,0.00007864628,0.00032600632,0.0003128728,0.011826275],"genre_scores_gemma":[0.9807165,0.0005226191,0.017081885,0.000035494406,0.000019699453,0.000041717547,0.000077227014,0.000019522937,0.0014852537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996445,0.00013465263,0.00001262666,0.000055299082,0.00007670447,0.00007617624],"domain_scores_gemma":[0.999345,0.00040234823,0.00007015348,0.00005883945,0.0000931561,0.000030430954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006712017,0.00076585216,0.0005697357,0.0004673218,0.00047255235,0.0011122036,0.00082707364,0.0006159574,0.0017175815],"category_scores_gemma":[0.002208603,0.00029627216,0.0004884092,0.0010852354,0.00053686375,0.0011438085,0.00058282586,0.0006093302,0.00018588534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036652058,0.000014736427,0.00045809592,0.0000417235,0.000013806425,0.000055151067,0.000016777032,0.9752897,0.0010777012,0.007893508,0.00039899215,0.014703145],"study_design_scores_gemma":[0.000003741309,0.000026493888,0.00015577459,0.0000066765288,0.000012471292,0.000033195527,0.000017391512,0.9929997,0.0005904918,0.005377825,0.0007720161,0.0000042056163],"about_ca_topic_score_codex":0.007406049,"about_ca_topic_score_gemma":0.0076933247,"teacher_disagreement_score":0.007406049,"about_ca_system_score_codex":0.0010811322,"about_ca_system_score_gemma":0.00075125054,"threshold_uncertainty_score":0.014725924},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018565346,0.0008525677,0.976065,0.0006588613,0.00009905208,0.00010452819,0.000105641884,0.0008204735,0.0027286108],"genre_scores_gemma":[0.81705076,0.000893427,0.17354214,0.0008744845,0.00023434838,0.00043586898,0.000388473,0.00038088023,0.006199525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977634,0.0011672317,0.00008192924,0.0002763939,0.00036112784,0.00034996282],"domain_scores_gemma":[0.99171525,0.006619162,0.0004009634,0.0003564525,0.00058136444,0.00032674064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051656305,0.0021003815,0.0028840234,0.0010051237,0.001059585,0.0022303658,0.0028687867,0.002706739,0.004504543],"category_scores_gemma":[0.01434853,0.0009326249,0.00079332077,0.0015656294,0.002238594,0.0032692836,0.0024141897,0.0037319807,0.0010620088],"study_design_candidate":"theoretical_or_conceptual","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.00020731945,0.00014859485,0.00042365384,0.00007961564,0.000039941962,0.000033121385,0.000054429755,0.948094,0.0003043582,0.015525083,0.002542471,0.032547355],"study_design_scores_gemma":[0.000011527204,0.000012436038,0.00001707545,0.0000057961265,0.0000026194718,0.00000292954,0.0000047974286,0.99276537,0.000086368,0.006977645,0.0001111418,0.0000024146232],"about_ca_topic_score_codex":0.007381709,"about_ca_topic_score_gemma":0.00563875,"teacher_disagreement_score":0.007381709,"about_ca_system_score_codex":0.00253105,"about_ca_system_score_gemma":0.0027913847,"threshold_uncertainty_score":0.027318835},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016735014,0.00008658964,0.97999245,0.000092813,0.000041761712,0.000028827,0.000023586615,0.000101626385,0.0028973683],"genre_scores_gemma":[0.882053,0.00012996446,0.11496843,0.00011347319,0.000032254906,0.00006880561,0.000042956268,0.000035831792,0.0025552844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950016,0.00011724016,0.000024728153,0.00013013776,0.0001643797,0.00006325242],"domain_scores_gemma":[0.99964166,0.00013150243,0.000043241667,0.000065762215,0.00008232917,0.000035456844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005921137,0.0005454729,0.0005270191,0.00030696712,0.0004971867,0.00071461895,0.0012373227,0.00058417616,0.0015095033],"category_scores_gemma":[0.0014270445,0.00023341742,0.00033399888,0.00039720838,0.0006872604,0.0016072638,0.0016786332,0.0006530141,0.00019703804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023586613,0.0001786885,0.0011908133,0.00016340276,0.00005479851,0.0002614379,0.00018716932,0.7390019,0.05595463,0.078259125,0.0023522594,0.12215998],"study_design_scores_gemma":[0.000004198846,0.00003296962,0.00006036806,0.000002876938,0.000003706345,0.000033748638,0.000014214895,0.9916829,0.0029722406,0.004502647,0.00068306073,0.0000071121563],"about_ca_topic_score_codex":0.0012730998,"about_ca_topic_score_gemma":0.0021016493,"teacher_disagreement_score":0.0015095033,"about_ca_system_score_codex":0.00059951044,"about_ca_system_score_gemma":0.0006544923,"threshold_uncertainty_score":0.0050498247},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022057109,0.00037144826,0.97447914,0.00025122426,0.000050533417,0.000040219344,0.000035752048,0.0002507508,0.0024637324],"genre_scores_gemma":[0.8910912,0.00022427528,0.104037724,0.00028958046,0.00008203606,0.00014042367,0.00008627892,0.000062227526,0.0039862553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990171,0.00026388123,0.000043285105,0.00025841378,0.00022462773,0.00019275829],"domain_scores_gemma":[0.99774617,0.0013884425,0.000245894,0.00015337944,0.00032271247,0.00014348974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018701828,0.0008991568,0.001655278,0.0005604297,0.0005373286,0.00097143813,0.0018975466,0.0013251872,0.0017926388],"category_scores_gemma":[0.0041407933,0.00042068405,0.00056116545,0.00061651337,0.0010981718,0.0014201947,0.0018187413,0.0012131834,0.00026677735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101602825,0.00011853733,0.00067518937,0.000054476262,0.000051008876,0.00007509348,0.000062790714,0.94322634,0.001399295,0.009738247,0.0012220785,0.04327535],"study_design_scores_gemma":[0.000006713491,0.000029435765,0.000043232587,0.0000026130385,0.0000046208306,0.000009181945,0.0000033323658,0.99768806,0.00018614676,0.001886001,0.00013787171,0.0000028004044],"about_ca_topic_score_codex":0.0045281677,"about_ca_topic_score_gemma":0.003792468,"teacher_disagreement_score":0.0045281677,"about_ca_system_score_codex":0.0010430556,"about_ca_system_score_gemma":0.0018100913,"threshold_uncertainty_score":0.009890616},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058351308,0.00044930784,0.9357512,0.00039248873,0.00010196828,0.00009616057,0.000054038916,0.00010236639,0.004701244],"genre_scores_gemma":[0.96332145,0.00024674434,0.033861965,0.000086843436,0.00003369732,0.000060394967,0.00003671744,0.00002392802,0.0023283125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988367,0.0005024194,0.000032263488,0.00014558982,0.00020056398,0.00028248556],"domain_scores_gemma":[0.9994438,0.0003010484,0.00004798068,0.0000454431,0.00008211044,0.000079515135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014289512,0.0010026542,0.0010966006,0.00049936725,0.00067254284,0.001400797,0.0019331033,0.0011067942,0.0014860139],"category_scores_gemma":[0.0020021277,0.00043917596,0.0006735002,0.00069905334,0.0011213463,0.0018824977,0.0012796408,0.0013219946,0.00012419184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008339387,0.00007917696,0.0004319155,0.00004318778,0.000031143296,0.00009664783,0.00005707745,0.93034375,0.0011169378,0.051961165,0.000956888,0.014798802],"study_design_scores_gemma":[0.000005485861,0.000017577002,0.000049989772,0.0000018437913,0.000004460978,0.000012576928,0.000015794843,0.9910096,0.00015709898,0.008487546,0.00023419426,0.0000038403914],"about_ca_topic_score_codex":0.0086990725,"about_ca_topic_score_gemma":0.007686338,"teacher_disagreement_score":0.0086990725,"about_ca_system_score_codex":0.0016965768,"about_ca_system_score_gemma":0.002281267,"threshold_uncertainty_score":0.01729685},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010929459,0.00055495446,0.9840755,0.0003231814,0.00012097178,0.000045283155,0.00008425272,0.0001269616,0.003739402],"genre_scores_gemma":[0.67327255,0.00097597635,0.31332076,0.00027494974,0.00024514945,0.00022351551,0.00023815282,0.00021029262,0.011238706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991905,0.00033135133,0.000039218066,0.00012270037,0.00017895192,0.00013730144],"domain_scores_gemma":[0.9965599,0.002477892,0.00020285176,0.00029144206,0.00030774757,0.00016014195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020709697,0.00086517644,0.0013211947,0.0008455769,0.00075230614,0.0014747805,0.0021781405,0.0013980716,0.004294361],"category_scores_gemma":[0.0096590575,0.00050852424,0.0007114137,0.0012032675,0.0010120899,0.0021988647,0.0021737432,0.0019879236,0.0005184584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105323365,0.000047897844,0.00037696387,0.000073566065,0.000023752229,0.00003258536,0.00008139093,0.91324425,0.00046733057,0.044859055,0.003365053,0.03732285],"study_design_scores_gemma":[0.0000031143968,0.000008742583,0.000025265846,0.0000049813784,0.0000027181745,0.000005618668,0.000009092427,0.9925793,0.00007954108,0.006911737,0.00036799107,0.000001909136],"about_ca_topic_score_codex":0.0057617403,"about_ca_topic_score_gemma":0.0053293584,"teacher_disagreement_score":0.0057617403,"about_ca_system_score_codex":0.001719617,"about_ca_system_score_gemma":0.0013765908,"threshold_uncertainty_score":0.01436609},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2859967,0.00088696845,0.69174,0.0009496305,0.000472818,0.00020593478,0.00043796212,0.0011913955,0.018118659],"genre_scores_gemma":[0.97014284,0.00015219956,0.026825383,0.00007164498,0.000092643284,0.00005522816,0.000072953895,0.00006775698,0.0025192662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985864,0.0004137032,0.00007256193,0.0001781249,0.0002507868,0.00049832556],"domain_scores_gemma":[0.9944022,0.0030267842,0.0005029657,0.0007991537,0.00054902764,0.0007197389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018416668,0.00079106214,0.001461112,0.0008586273,0.0012846568,0.0019497186,0.0022606063,0.0009805968,0.004798889],"category_scores_gemma":[0.007433863,0.0005136969,0.00065184885,0.0017715212,0.0007926396,0.0021825503,0.0016983658,0.0013102626,0.00041792067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009100309,0.00016360769,0.00041265532,0.00015298185,0.00005955958,0.00015977443,0.0001127596,0.89436316,0.0052390643,0.06620207,0.002548842,0.029675562],"study_design_scores_gemma":[0.000049991533,0.00013560368,0.00014016275,0.000009835246,0.000023390596,0.000046584748,0.000038864517,0.9673597,0.0015747594,0.029853994,0.00074889,0.000018136358],"about_ca_topic_score_codex":0.0037073954,"about_ca_topic_score_gemma":0.0025246644,"teacher_disagreement_score":0.004798889,"about_ca_system_score_codex":0.0016977167,"about_ca_system_score_gemma":0.0021750862,"threshold_uncertainty_score":0.016053855},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02179816,0.0004276489,0.97458035,0.00024270384,0.00006770306,0.000028927907,0.000035019297,0.0001302658,0.0026892512],"genre_scores_gemma":[0.89606506,0.00052358425,0.10122254,0.00014346646,0.00012864567,0.00004157574,0.000039981354,0.000040991516,0.0017941152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944264,0.00019362137,0.000018689527,0.00008417336,0.00016111082,0.000099812125],"domain_scores_gemma":[0.99859375,0.0008558559,0.00020230557,0.00013111263,0.0001230407,0.00009389403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013009326,0.0005847491,0.0006917129,0.0002876088,0.00043722105,0.00086999306,0.00093145133,0.00044158788,0.0006983581],"category_scores_gemma":[0.0028852813,0.00024821283,0.00032897136,0.0006950966,0.0006848348,0.0009923228,0.00086138106,0.0008578611,0.00016408639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115760646,0.00007843013,0.00067613414,0.00008368932,0.00003964889,0.00015767608,0.0001133601,0.8991074,0.011084445,0.04139648,0.0012989781,0.045848064],"study_design_scores_gemma":[0.000004883359,0.000051738345,0.00007906056,0.0000038555245,0.00000598171,0.000033920576,0.00001653116,0.9900572,0.0016076473,0.007573748,0.00056010525,0.0000053192894],"about_ca_topic_score_codex":0.0016141059,"about_ca_topic_score_gemma":0.0024274855,"teacher_disagreement_score":0.0016141059,"about_ca_system_score_codex":0.0009356973,"about_ca_system_score_gemma":0.0012826065,"threshold_uncertainty_score":0.006880045},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06648002,0.0046739667,0.9191124,0.001751628,0.00033296325,0.0002318099,0.00046423945,0.0011542644,0.005798717],"genre_scores_gemma":[0.78183466,0.0018919404,0.21118253,0.00028547933,0.00022309595,0.0001701472,0.0008217164,0.00012524362,0.003465167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989555,0.0002976039,0.000092577975,0.00031983582,0.00025469932,0.00007982965],"domain_scores_gemma":[0.99603146,0.002293177,0.0004848312,0.00066093553,0.00037879843,0.00015083965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002628807,0.0007996217,0.0011066551,0.0010218098,0.00058640644,0.0016059667,0.001231929,0.0008472722,0.001008613],"category_scores_gemma":[0.008404091,0.00030414085,0.00061158737,0.0013832755,0.0007665583,0.0035126081,0.0015734858,0.0012361694,0.00026074197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030589767,0.0001857602,0.0054304795,0.00042010462,0.00012697923,0.00014109521,0.00022959136,0.57210404,0.004025093,0.07159533,0.008222916,0.33721256],"study_design_scores_gemma":[0.00001723115,0.00013078593,0.0009812408,0.000030362577,0.000034823952,0.0001333348,0.00007888939,0.91459745,0.0035051438,0.07512373,0.0053465385,0.000020397927],"about_ca_topic_score_codex":0.002386544,"about_ca_topic_score_gemma":0.0020790356,"teacher_disagreement_score":0.002628807,"about_ca_system_score_codex":0.0013139234,"about_ca_system_score_gemma":0.0016740017,"threshold_uncertainty_score":0.013902605},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061395712,0.00035154843,0.9345548,0.0001727685,0.000040368795,0.000052746927,0.0000239436,0.00018972755,0.0032183768],"genre_scores_gemma":[0.95264727,0.00015309636,0.045655087,0.00006561912,0.000019556137,0.000073799165,0.000032128803,0.000029869185,0.0013235653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992956,0.00017774488,0.000022098935,0.00016982917,0.0001449616,0.00018973171],"domain_scores_gemma":[0.99952257,0.00023262895,0.000059821654,0.000046336667,0.00007824546,0.00006041407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007787009,0.0007470324,0.0008025989,0.00035305836,0.00055213436,0.0009603222,0.001250357,0.0006244405,0.0006548077],"category_scores_gemma":[0.0015002391,0.00036310358,0.00044419826,0.00055088167,0.00076668756,0.0010871973,0.0013734343,0.00066324143,0.00013677735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012383444,0.00009643243,0.00060223445,0.00006755066,0.000023946539,0.00010571696,0.00015372151,0.94688386,0.007051438,0.008372939,0.0007822347,0.03573615],"study_design_scores_gemma":[0.0000054219536,0.000036246132,0.00012168609,0.000002418861,0.0000050679187,0.000014192389,0.000034335775,0.99626005,0.00076316355,0.0024468685,0.0003059827,0.000004613557],"about_ca_topic_score_codex":0.006808215,"about_ca_topic_score_gemma":0.0049627703,"teacher_disagreement_score":0.006808215,"about_ca_system_score_codex":0.00082070363,"about_ca_system_score_gemma":0.0016460873,"threshold_uncertainty_score":0.0135371685},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024963472,0.0005460597,0.9698462,0.00047617545,0.000097661214,0.000061277824,0.00008937299,0.0007218355,0.0031979643],"genre_scores_gemma":[0.9244835,0.00027104578,0.07087479,0.00033967942,0.000056681034,0.00016501646,0.00015447906,0.00010845765,0.0035463662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99963856,0.00009860663,0.000017908706,0.00009665976,0.000065688495,0.00008259362],"domain_scores_gemma":[0.9989729,0.00060426927,0.00010141528,0.00006081514,0.00016315692,0.00009745629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007764813,0.0008893954,0.0010505329,0.00035672486,0.0003646954,0.00070903735,0.0016159635,0.00097125076,0.0024547193],"category_scores_gemma":[0.002615364,0.0004292549,0.00050126604,0.00037956814,0.00071192376,0.0009606622,0.0011774113,0.0017469974,0.00030393884],"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.00005131837,0.000053463616,0.00059344625,0.000041437695,0.000029533072,0.000057428424,0.00003376503,0.9662031,0.0008896975,0.0036260057,0.0012836005,0.027137225],"study_design_scores_gemma":[0.0000040758523,0.00000970924,0.00002828614,0.0000018284994,0.0000025437919,0.0000036683705,0.0000023076207,0.99864703,0.00007349353,0.0011160336,0.00010946923,0.0000016650963],"about_ca_topic_score_codex":0.010722965,"about_ca_topic_score_gemma":0.01031987,"teacher_disagreement_score":0.010722965,"about_ca_system_score_codex":0.00090288575,"about_ca_system_score_gemma":0.0015352287,"threshold_uncertainty_score":0.021321118},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20020142,0.0005874163,0.7920039,0.0010482989,0.00009548971,0.000091382775,0.00017535815,0.0010060397,0.0047907527],"genre_scores_gemma":[0.97192883,0.00007223264,0.026089646,0.000115226256,0.000017055983,0.000058161288,0.00009320101,0.000029508821,0.001596151],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955267,0.00016526878,0.00001845403,0.00010301247,0.000052144518,0.00010839242],"domain_scores_gemma":[0.9972332,0.0020079208,0.00022479465,0.00009888008,0.0002936198,0.00014162109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018910888,0.00081640773,0.0008182567,0.00039478388,0.00030608985,0.0006920343,0.001189609,0.00094992056,0.0021413115],"category_scores_gemma":[0.006071298,0.0004115292,0.00035852756,0.0003749298,0.0007929417,0.0009311554,0.0008068979,0.0019423466,0.00020522965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004254523,0.000043670247,0.0006722145,0.00001419853,0.000011193776,0.000017879638,0.00001555926,0.9865469,0.00016676523,0.0014663667,0.00029099354,0.010711837],"study_design_scores_gemma":[0.0000035942662,0.000009569466,0.000032437303,0.0000012870929,0.0000014259123,0.0000012584626,0.0000015676376,0.99930537,0.000059308535,0.0005489835,0.000034413515,9.121182e-7],"about_ca_topic_score_codex":0.015082591,"about_ca_topic_score_gemma":0.013976269,"teacher_disagreement_score":0.015082591,"about_ca_system_score_codex":0.0015954002,"about_ca_system_score_gemma":0.0021150985,"threshold_uncertainty_score":0.0299896},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18919747,0.0032417437,0.7828933,0.001687464,0.00048840727,0.00015010367,0.00014772976,0.0003764121,0.021817386],"genre_scores_gemma":[0.8933769,0.0011569752,0.09742095,0.00014111144,0.000082361075,0.000059630118,0.00009544845,0.00008731079,0.007579423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990126,0.00032242978,0.000055934328,0.00022362746,0.00018511135,0.00020024818],"domain_scores_gemma":[0.9972199,0.0015038626,0.0003173809,0.00032860818,0.0003610659,0.0002691374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014352738,0.0006478686,0.00072906964,0.0007568006,0.0013667172,0.0027167897,0.0011396778,0.0012396082,0.0022237413],"category_scores_gemma":[0.008284814,0.00042625054,0.00032381443,0.0016325037,0.0017288348,0.0054568546,0.0029380512,0.0014036414,0.0003760477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005879572,0.0001320973,0.0039267885,0.00020775007,0.000039415703,0.000394663,0.0008350454,0.55916834,0.003552751,0.23026554,0.005285835,0.19560376],"study_design_scores_gemma":[0.000024483263,0.00016353799,0.00087458553,0.00004255083,0.000032153315,0.00034322753,0.00068469654,0.8710489,0.004186841,0.11042376,0.012127865,0.000047411693],"about_ca_topic_score_codex":0.005320307,"about_ca_topic_score_gemma":0.004075555,"teacher_disagreement_score":0.005320307,"about_ca_system_score_codex":0.0016409681,"about_ca_system_score_gemma":0.0015091879,"threshold_uncertainty_score":0.011906147},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090675816,0.0004016773,0.9036251,0.00023990317,0.00007823906,0.0000602601,0.000040637842,0.00043794423,0.0044404767],"genre_scores_gemma":[0.955678,0.00008218039,0.04275295,0.00006217018,0.000021857486,0.000029589428,0.000024277006,0.00004462279,0.0013042918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993492,0.00018453097,0.000026663325,0.00012681092,0.00015696227,0.00015574673],"domain_scores_gemma":[0.99918634,0.00038198227,0.00010012876,0.00010613756,0.00014987278,0.00007549953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010161351,0.0006092097,0.00077663484,0.00033915514,0.0005613455,0.0009367763,0.00095790887,0.0005123856,0.001044474],"category_scores_gemma":[0.0029030102,0.00022327242,0.00021187769,0.00037333264,0.000549722,0.00075770007,0.000978522,0.00063068664,0.00021175266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022666543,0.00010415106,0.0010630172,0.000047523845,0.000024200504,0.00006897765,0.00007648335,0.9308695,0.009576329,0.010804706,0.0011444567,0.04599384],"study_design_scores_gemma":[0.000005713532,0.000020429397,0.00008947583,0.0000017360002,0.000002250267,0.000008665519,0.000008743142,0.99675304,0.0010421923,0.0018142388,0.00025134857,0.000002202622],"about_ca_topic_score_codex":0.004112557,"about_ca_topic_score_gemma":0.004845099,"teacher_disagreement_score":0.004112557,"about_ca_system_score_codex":0.0007651668,"about_ca_system_score_gemma":0.0012500517,"threshold_uncertainty_score":0.00817728},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071525616,0.00028052312,0.9822172,0.00023671756,0.00006768786,0.000051600695,0.00009722479,0.0018078309,0.0080887405],"genre_scores_gemma":[0.5806576,0.00054817705,0.40451548,0.00023479227,0.000082695005,0.00023692282,0.00045434918,0.00028395106,0.012985987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986625,0.000017579476,0.0000071418876,0.0000347779,0.0000519493,0.000022235918],"domain_scores_gemma":[0.9998846,0.000026779955,0.000010544444,0.000017264587,0.000043165644,0.000017689923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030221324,0.00050704926,0.0003057489,0.00021974836,0.00034319365,0.0007457468,0.0009784013,0.00036514417,0.0038701429],"category_scores_gemma":[0.00041924763,0.0001937718,0.0005119706,0.0001811778,0.00048057587,0.000562578,0.0007128627,0.0009162133,0.0006205175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007235735,0.000047167418,0.0005354061,0.000096935146,0.000043802447,0.000104082355,0.00007536627,0.8487069,0.007840303,0.047921933,0.004686711,0.089869015],"study_design_scores_gemma":[0.000006828812,0.000018133876,0.000071387665,0.0000058813835,0.0000061872292,0.000013253295,0.000007698339,0.9876183,0.0009897143,0.0069251377,0.0043339464,0.0000035350392],"about_ca_topic_score_codex":0.012927382,"about_ca_topic_score_gemma":0.01802926,"teacher_disagreement_score":0.98707265,"about_ca_system_score_codex":0.000884941,"about_ca_system_score_gemma":0.0017389288,"threshold_uncertainty_score":0.025704265},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08531256,0.0020512997,0.9070877,0.00058894773,0.00013755557,0.00017759639,0.0002607599,0.002003942,0.0023796787],"genre_scores_gemma":[0.7776272,0.00096085184,0.21894896,0.00020891352,0.00019919804,0.00012193559,0.00054273143,0.00022609498,0.0011640076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987435,0.00029241035,0.00010637997,0.00023832629,0.00050310977,0.0001162078],"domain_scores_gemma":[0.995216,0.002525504,0.000572953,0.0006011561,0.00086595945,0.00021846287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024882937,0.0013357685,0.0011674373,0.0010409203,0.0005269304,0.0013269035,0.0012140567,0.0007894484,0.0008940844],"category_scores_gemma":[0.01385377,0.00033897345,0.0003504702,0.001113489,0.0007029149,0.0039016826,0.001280482,0.0016481425,0.00029963034],"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.00085929525,0.00033616117,0.005589233,0.00030346023,0.000102251,0.00018724173,0.000291883,0.44559512,0.03126986,0.018322473,0.005763259,0.49137974],"study_design_scores_gemma":[0.000011153381,0.00016835154,0.00071597594,0.000017117622,0.000022590219,0.000065359985,0.00004538238,0.9818793,0.009140501,0.0065317336,0.0013894407,0.000013109399],"about_ca_topic_score_codex":0.0024335715,"about_ca_topic_score_gemma":0.0026529613,"teacher_disagreement_score":0.0024882937,"about_ca_system_score_codex":0.0013135456,"about_ca_system_score_gemma":0.002013542,"threshold_uncertainty_score":0.013159573},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013747483,0.00038958646,0.97913045,0.0003398484,0.00008294489,0.000067343426,0.00010746548,0.00037469593,0.005760205],"genre_scores_gemma":[0.7608841,0.0007160667,0.22949891,0.00028225535,0.00012406935,0.00014122893,0.0001960315,0.00009300452,0.0080642365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904436,0.00022586281,0.000047229685,0.000251141,0.00025933233,0.00017190521],"domain_scores_gemma":[0.9991208,0.00017822499,0.0001371517,0.00019912414,0.00024359771,0.00012112509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010792932,0.000869367,0.0008571449,0.00043193178,0.0006827843,0.0024470435,0.0026255397,0.0013816995,0.0015588825],"category_scores_gemma":[0.0015663763,0.0004434805,0.0006019733,0.0010138405,0.0010463333,0.0026234488,0.002279582,0.0019140963,0.00052783726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017223161,0.00011552976,0.0013323175,0.00011813645,0.00007925779,0.00024259777,0.00022113713,0.7664426,0.014656123,0.13541305,0.004799706,0.076407224],"study_design_scores_gemma":[0.0000051035245,0.000052651136,0.000095298805,0.0000070313204,0.00001756534,0.00004954818,0.00002883259,0.9844328,0.0010853807,0.009825531,0.0043887184,0.000011486687],"about_ca_topic_score_codex":0.011680386,"about_ca_topic_score_gemma":0.014943386,"teacher_disagreement_score":0.011680386,"about_ca_system_score_codex":0.0017900928,"about_ca_system_score_gemma":0.0023515755,"threshold_uncertainty_score":0.02322483},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011278576,0.00018413736,0.9867488,0.00020975409,0.000041066854,0.000025858535,0.000024168727,0.00008871921,0.0013989494],"genre_scores_gemma":[0.88530535,0.00041087734,0.10857611,0.00019640286,0.00010376942,0.00020828069,0.00007774231,0.000102756465,0.0050188107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987324,0.00043342626,0.00006740035,0.00027183405,0.00032792357,0.00016705404],"domain_scores_gemma":[0.99700457,0.0018687567,0.00039555226,0.00018823102,0.0004019154,0.00014099195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002861077,0.0012643419,0.0010675173,0.00045216884,0.00043115654,0.0014039335,0.0014427972,0.0010136251,0.0016637335],"category_scores_gemma":[0.007191847,0.00048708834,0.00048406565,0.00061721826,0.0011593562,0.0017503517,0.001405302,0.0019278299,0.00026585843],"study_design_candidate":"theoretical_or_conceptual","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.000053749216,0.00004177216,0.0002708531,0.00005688766,0.000020753378,0.000046424422,0.000050110386,0.965115,0.0011768414,0.021692885,0.0005039754,0.010970672],"study_design_scores_gemma":[0.0000026736554,0.000011502697,0.000022876893,0.0000019096492,0.0000018135872,0.0000036116883,0.0000030617175,0.9960156,0.00017379051,0.0036537794,0.00010758756,0.000001775657],"about_ca_topic_score_codex":0.0022130958,"about_ca_topic_score_gemma":0.0015229638,"teacher_disagreement_score":0.002861077,"about_ca_system_score_codex":0.0015555004,"about_ca_system_score_gemma":0.0015859251,"threshold_uncertainty_score":0.015131056},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48312163,0.0052755964,0.44682127,0.0020146016,0.00090866536,0.00039393362,0.0067973486,0.040483236,0.014183708],"genre_scores_gemma":[0.7634132,0.00096453936,0.20677267,0.0015957082,0.000109751825,0.00027331075,0.016019601,0.0028068894,0.008044301],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931955,0.00015064166,0.00005101542,0.00020456106,0.00016164404,0.00011264048],"domain_scores_gemma":[0.9993112,0.00020185424,0.000062441366,0.00013097156,0.00021837432,0.00007519299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018700528,0.0019796246,0.00088207034,0.001490681,0.0005430016,0.001667125,0.0015642019,0.0017298764,0.0035226166],"category_scores_gemma":[0.003574026,0.0005466763,0.0009569939,0.00080997625,0.0005054363,0.0014312855,0.0012528563,0.0010803348,0.0016463797],"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.0017221344,0.00051813095,0.017244034,0.0007853965,0.00085170043,0.00058701675,0.00031778222,0.37983358,0.038775854,0.0051073865,0.064923726,0.48933333],"study_design_scores_gemma":[0.0000982668,0.00022647354,0.0021075872,0.00008044318,0.00008590221,0.00024936456,0.000077133955,0.962924,0.021714414,0.0045063356,0.00788623,0.0000437211],"about_ca_topic_score_codex":0.012807617,"about_ca_topic_score_gemma":0.020940522,"teacher_disagreement_score":0.012807617,"about_ca_system_score_codex":0.0010863339,"about_ca_system_score_gemma":0.0017522166,"threshold_uncertainty_score":0.025466144},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053114507,0.00043208047,0.9419259,0.0002662646,0.00007496005,0.00006602899,0.000028767852,0.00024288471,0.0038487017],"genre_scores_gemma":[0.9618204,0.00010176436,0.036318455,0.00011004158,0.000035972418,0.00006223103,0.000017887687,0.000016438036,0.0015168074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993543,0.00023640446,0.000022514812,0.00012354531,0.000106596905,0.00015664277],"domain_scores_gemma":[0.9987601,0.00073817506,0.00015337681,0.00007760404,0.00017103273,0.00009963301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012519283,0.00049408444,0.00081824773,0.00028941545,0.00050386024,0.00063576025,0.0011574565,0.0005502771,0.0015255051],"category_scores_gemma":[0.0023354592,0.00024291882,0.0003350047,0.00033865613,0.0009974412,0.0007843318,0.0009608232,0.0007294081,0.0002570699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018409245,0.00012416492,0.0008193295,0.00006552541,0.000037551403,0.00013096431,0.00009895647,0.93030196,0.002957745,0.011269897,0.0011003409,0.05290948],"study_design_scores_gemma":[0.000013493864,0.000033233628,0.00006387855,0.000002599209,0.000004407254,0.000015856895,0.000008532734,0.9969002,0.00023381073,0.002536969,0.00018368421,0.0000033288484],"about_ca_topic_score_codex":0.0036315739,"about_ca_topic_score_gemma":0.003885842,"teacher_disagreement_score":0.0036315739,"about_ca_system_score_codex":0.000589172,"about_ca_system_score_gemma":0.0013576961,"threshold_uncertainty_score":0.0072208643},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22929877,0.00039175412,0.76379555,0.00039321356,0.00008143371,0.000043542917,0.000039405746,0.00015779505,0.0057985373],"genre_scores_gemma":[0.9858738,0.00006630751,0.01273926,0.0000364743,0.000013435086,0.000012442795,0.000016067383,0.000010640025,0.0012315578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965096,0.00007467363,0.000014046385,0.000096684744,0.00007704323,0.00008653831],"domain_scores_gemma":[0.99943095,0.00026858776,0.00009189521,0.00005196998,0.00008409921,0.0000725302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005842702,0.00042886124,0.000530636,0.00020319164,0.00050741376,0.0008160255,0.0009369008,0.00038988213,0.0013028515],"category_scores_gemma":[0.0016032853,0.00017321449,0.00022561394,0.00028264296,0.00047232286,0.0017017793,0.0012080404,0.00063894445,0.00011439826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047631888,0.0002203601,0.0039352826,0.00016280211,0.00005970074,0.00069858506,0.0003066194,0.7940754,0.02509245,0.0555089,0.0020171928,0.117446385],"study_design_scores_gemma":[0.000005818945,0.000054924556,0.00022773368,0.0000027600015,0.000007883777,0.000052702184,0.00004053287,0.99041826,0.0020229553,0.006664373,0.0004977848,0.000004332942],"about_ca_topic_score_codex":0.0012665264,"about_ca_topic_score_gemma":0.001500434,"teacher_disagreement_score":0.0013028515,"about_ca_system_score_codex":0.0005182121,"about_ca_system_score_gemma":0.0005197909,"threshold_uncertainty_score":0.004358411},"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":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019031035,0.0638168,0.0069844574,0.230877,0.15574858,0.00007747826,0.0031464982,0.00094081205,0.51937735],"genre_scores_gemma":[0.16195846,0.018109322,0.0040561496,0.033210896,0.07287783,0.00010199667,0.00284822,0.0019539653,0.70488316],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99894935,0.00025295926,0.000021990885,0.0001227549,0.0004846173,0.00016825796],"domain_scores_gemma":[0.99739337,0.0003701553,0.000074162395,0.00012841931,0.0007420477,0.0012917774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023482754,0.0010286738,0.00056712807,0.0007588476,0.0014781147,0.0028203523,0.0006519821,0.001672036,0.045268163],"category_scores_gemma":[0.0050899424,0.00024260217,0.00066111184,0.0007056237,0.00070153835,0.0020364048,0.0015902423,0.002666862,0.01247003],"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.000103021426,0.000042850028,0.00012500092,0.000059359383,0.00000704309,0.00011407424,0.0001483667,0.00039842486,0.0004044607,0.009389758,0.9766217,0.012586047],"study_design_scores_gemma":[0.000028782113,0.0000941947,0.00153447,0.00013009434,0.000008748113,0.00028061387,0.00041204673,0.0017417597,0.00089458295,0.017068295,0.9777566,0.000049764196],"about_ca_topic_score_codex":0.0032028973,"about_ca_topic_score_gemma":0.006378621,"teacher_disagreement_score":0.045268163,"about_ca_system_score_codex":0.0020259859,"about_ca_system_score_gemma":0.00084051205,"threshold_uncertainty_score":0.15143704},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022669984,0.001153644,0.9701045,0.00036536032,0.00015183662,0.00008902296,0.00032941217,0.00034757706,0.004788805],"genre_scores_gemma":[0.7271256,0.0021098796,0.26629245,0.00023668446,0.00018725691,0.00030540253,0.0006876959,0.00026059983,0.0027944925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986418,0.00030791498,0.00008552626,0.00023229877,0.0006112913,0.00012121467],"domain_scores_gemma":[0.99431497,0.0031303936,0.00088975363,0.00077945174,0.00068774534,0.00019771914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030874058,0.00094577984,0.00079114916,0.0011347887,0.00053677114,0.00208115,0.0017575986,0.001433217,0.00234437],"category_scores_gemma":[0.012683537,0.00040656846,0.0010383204,0.0015642404,0.0014308883,0.0036973732,0.0019564917,0.0022679619,0.0004530395],"study_design_candidate":"theoretical_or_conceptual","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.00014166086,0.00010312407,0.005927537,0.00029760905,0.00006792724,0.00023272193,0.0002309644,0.79765224,0.0055667115,0.15196058,0.0018313999,0.03598754],"study_design_scores_gemma":[0.000004882159,0.000035801837,0.0008940734,0.00001841308,0.000011534518,0.00009528264,0.000033432236,0.97707295,0.0011706963,0.018806564,0.0018403169,0.000016045597],"about_ca_topic_score_codex":0.0044785114,"about_ca_topic_score_gemma":0.003061648,"teacher_disagreement_score":0.0044785114,"about_ca_system_score_codex":0.0017897187,"about_ca_system_score_gemma":0.0016477745,"threshold_uncertainty_score":0.016327918},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13422339,0.00031685072,0.8600368,0.0006905091,0.00007999667,0.00006497434,0.000121861405,0.00064377225,0.0038217285],"genre_scores_gemma":[0.98184425,0.000096163756,0.016053645,0.000057562636,0.000021353639,0.000050497063,0.000051813167,0.000021077727,0.0018036158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921846,0.0001793829,0.00003983074,0.00025778572,0.00015496621,0.00014954348],"domain_scores_gemma":[0.996761,0.0020227341,0.0005388335,0.00018781461,0.0003074517,0.00018220463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016545831,0.0007401074,0.0011236623,0.00041009882,0.00066538074,0.0016537264,0.0012983895,0.0013034367,0.0020331463],"category_scores_gemma":[0.004758367,0.0005369434,0.0004352406,0.0005267082,0.0011948944,0.0019662795,0.0013577705,0.0011522664,0.0002763428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017291066,0.000035407927,0.0006799396,0.000038111586,0.000021553573,0.00014597033,0.00010494345,0.9755052,0.0017050867,0.00959281,0.00036759162,0.011630503],"study_design_scores_gemma":[0.000008789241,0.000017059478,0.00011385873,0.0000020236628,0.0000046266164,0.000011972067,0.000007870343,0.9975284,0.00021710382,0.0019747056,0.00010821428,0.000005479163],"about_ca_topic_score_codex":0.008291528,"about_ca_topic_score_gemma":0.0044928207,"teacher_disagreement_score":0.008291528,"about_ca_system_score_codex":0.0012639427,"about_ca_system_score_gemma":0.0012314405,"threshold_uncertainty_score":0.016486585},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0734629,0.001724101,0.91398954,0.00037968694,0.00007569437,0.0000543493,0.000104640196,0.000114032824,0.01009512],"genre_scores_gemma":[0.9606567,0.0014555866,0.03477158,0.000118551165,0.00009113998,0.000047355545,0.0000592764,0.000043836753,0.0027559334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933296,0.0002060383,0.00003149486,0.00009895286,0.00023741905,0.000093192306],"domain_scores_gemma":[0.997326,0.0016903094,0.00034565426,0.00017742059,0.0004059674,0.000054623517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014549972,0.00074724073,0.0006613362,0.00064015586,0.00040390118,0.0011083431,0.0005919377,0.00055459596,0.0014269929],"category_scores_gemma":[0.0046594026,0.00026591116,0.0005210844,0.00058267004,0.000978414,0.0016384185,0.00094776764,0.0008292178,0.00021879397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013261527,0.000034437187,0.0020762747,0.00015936082,0.00006139677,0.00022576159,0.00017630147,0.8815232,0.013307777,0.080303594,0.0007569458,0.021242406],"study_design_scores_gemma":[0.0000019553704,0.000035468,0.00035638583,0.000010115062,0.000012980492,0.000073187366,0.000037551417,0.9903452,0.0018814706,0.0067278813,0.0005067315,0.000011108163],"about_ca_topic_score_codex":0.002126535,"about_ca_topic_score_gemma":0.00179853,"teacher_disagreement_score":0.002126535,"about_ca_system_score_codex":0.0012365133,"about_ca_system_score_gemma":0.000887948,"threshold_uncertainty_score":0.008971572},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0803776,0.0005723886,0.91454947,0.00041490674,0.00008565265,0.000053131436,0.000057218807,0.0005148659,0.003374727],"genre_scores_gemma":[0.97747403,0.00008400979,0.02090965,0.000094820556,0.000020936155,0.000041512023,0.00003696126,0.000022588947,0.0013154402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997683,0.00005983545,0.000009263621,0.000056674406,0.000041537103,0.000064289576],"domain_scores_gemma":[0.99929583,0.00040850675,0.00008872015,0.000039294686,0.00010601635,0.00006152854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006926945,0.0006671631,0.0007422012,0.00024730596,0.00024343075,0.0005524123,0.00090025284,0.0005812493,0.00092711905],"category_scores_gemma":[0.00207976,0.0003080184,0.00022877657,0.00022919006,0.00068031246,0.00060472084,0.0007970869,0.0009569579,0.00012480655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004122313,0.000032895325,0.00057085743,0.00001988586,0.000017303713,0.000025690566,0.000020566255,0.97899765,0.0008015015,0.0019972946,0.00045345468,0.017021693],"study_design_scores_gemma":[0.000002619509,0.000008086644,0.00003434043,0.0000010773208,0.0000015955148,0.0000018296715,0.0000018160719,0.999169,0.00010226108,0.0006273517,0.00004908328,9.633254e-7],"about_ca_topic_score_codex":0.007480224,"about_ca_topic_score_gemma":0.006556847,"teacher_disagreement_score":0.007480224,"about_ca_system_score_codex":0.00077864673,"about_ca_system_score_gemma":0.0011998374,"threshold_uncertainty_score":0.014873385},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011390084,0.00016704119,0.98581207,0.00022023922,0.000026332113,0.00005045311,0.000034228717,0.00019760539,0.0021020467],"genre_scores_gemma":[0.8123472,0.00025521574,0.18222184,0.00039484585,0.00006535214,0.00035441597,0.0001577868,0.00012890951,0.004074443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993724,0.0001699978,0.00003160563,0.00014601757,0.00018090926,0.00009903749],"domain_scores_gemma":[0.99807787,0.0012550442,0.00019774173,0.00008253249,0.0003069061,0.0000799092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001796297,0.00091517635,0.001052923,0.0003429559,0.00034603185,0.00074787904,0.0014878178,0.001146658,0.002133788],"category_scores_gemma":[0.0037294324,0.00065688574,0.0004950301,0.00040987154,0.00089397875,0.00091399736,0.0011216465,0.001532048,0.00030110427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035313227,0.00004190039,0.00026863287,0.000042465723,0.000015841442,0.00002582371,0.00002730609,0.97989094,0.00090078916,0.0033535154,0.0004916379,0.014905827],"study_design_scores_gemma":[0.0000050262265,0.000009569755,0.000019646877,0.0000019071766,0.0000017611203,0.0000025132033,0.0000017427353,0.9991049,0.00010636458,0.0006719475,0.000073435775,0.000001225611],"about_ca_topic_score_codex":0.0072658584,"about_ca_topic_score_gemma":0.0059596645,"teacher_disagreement_score":0.0072658584,"about_ca_system_score_codex":0.0012802534,"about_ca_system_score_gemma":0.0022962256,"threshold_uncertainty_score":0.014447153},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33508044,0.012969275,0.010246183,0.0021536297,0.0012952344,0.00060676376,0.017314285,0.0011918112,0.61914235],"genre_scores_gemma":[0.8994172,0.0029229776,0.004236735,0.0003567149,0.000096678225,0.00014074985,0.0046400884,0.00022962205,0.08795919],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99985504,0.000010534845,0.000012928962,0.000040731255,0.000043936194,0.000036799862],"domain_scores_gemma":[0.99981767,0.0000199258,0.000055659635,0.00002229903,0.00005298629,0.000031483465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001124224,0.0006749446,0.00036363324,0.0008369117,0.0011890421,0.00069667905,0.0005684843,0.00054722937,0.014230831],"category_scores_gemma":[0.00037256948,0.00023677609,0.00015915712,0.0006857099,0.00041626248,0.00082097785,0.0010718458,0.0009730546,0.004914907],"study_design_candidate":"observational","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.0010651506,0.00008157814,0.024863018,0.0012791062,0.000100099096,0.0051763877,0.0028754952,0.0010489475,0.2538998,0.00969367,0.047008798,0.65290785],"study_design_scores_gemma":[0.00007500888,0.00015518977,0.20653167,0.00043485052,0.00010729382,0.0038848724,0.0029578884,0.0003916322,0.020048723,0.0013509719,0.7640112,0.000050647996],"about_ca_topic_score_codex":0.031710375,"about_ca_topic_score_gemma":0.042949133,"teacher_disagreement_score":0.031710375,"about_ca_system_score_codex":0.0012055591,"about_ca_system_score_gemma":0.0006018941,"threshold_uncertainty_score":0.06305164},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3199989,0.002081062,0.6339976,0.002863725,0.00052829395,0.00021579978,0.009216203,0.011816517,0.01928187],"genre_scores_gemma":[0.8247156,0.0006023183,0.15066044,0.00022735776,0.00012566238,0.00010480868,0.009827579,0.00078459183,0.012951657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998721,0.000035338882,0.000005515414,0.00003876941,0.000026617607,0.000021691947],"domain_scores_gemma":[0.99939203,0.00035688776,0.000031112853,0.00007017919,0.00011657873,0.00003316808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046755103,0.00066976267,0.00063581817,0.0008933631,0.00047749508,0.00090097915,0.0012504975,0.00085658685,0.0061703864],"category_scores_gemma":[0.002599998,0.00045012546,0.00056624494,0.0009477662,0.00043176382,0.0012224463,0.00060417847,0.0011828352,0.0011400366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025078733,0.000057305944,0.0015686981,0.000050707444,0.00005257154,0.000084754254,0.000040930423,0.92065024,0.0006290763,0.004089767,0.010734199,0.061790932],"study_design_scores_gemma":[0.0000043392083,0.000003141264,0.00015420163,0.0000030429337,0.0000023183575,0.0000032791006,0.000008242951,0.9954972,0.0002277212,0.0037929001,0.0003017397,0.0000019185395],"about_ca_topic_score_codex":0.041732166,"about_ca_topic_score_gemma":0.03875956,"teacher_disagreement_score":0.041732166,"about_ca_system_score_codex":0.0014184903,"about_ca_system_score_gemma":0.0008571808,"threshold_uncertainty_score":0.08297849},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013293734,0.0017157117,0.9722024,0.00077802554,0.00007119339,0.000058034246,0.00003765579,0.00007391611,0.011769247],"genre_scores_gemma":[0.8295559,0.0044272603,0.1607451,0.0004349236,0.00020432357,0.0003677861,0.000080116275,0.000096570126,0.004088029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969997,0.0015249903,0.00016149844,0.00033920925,0.00069902424,0.0002756106],"domain_scores_gemma":[0.9923534,0.0058937347,0.00042031443,0.00032613997,0.0008627854,0.00014371311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005108402,0.00082697003,0.00106356,0.00081587536,0.0005676659,0.0019079627,0.00095408154,0.0010053981,0.0028043785],"category_scores_gemma":[0.014253058,0.00064960786,0.00089108595,0.0007544718,0.0020252927,0.003002474,0.0014787279,0.00238876,0.0003676614],"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.000096116484,0.00009004216,0.0010185434,0.00038555308,0.00005930545,0.00018594359,0.00028475164,0.36400557,0.0030650205,0.5774747,0.0016457508,0.051688734],"study_design_scores_gemma":[0.000014601977,0.0001008217,0.0002935404,0.000093657996,0.000018777422,0.000066269655,0.000040861327,0.80434537,0.0014927129,0.19111499,0.0023993214,0.00001905607],"about_ca_topic_score_codex":0.0018614924,"about_ca_topic_score_gemma":0.0007637423,"teacher_disagreement_score":0.005108402,"about_ca_system_score_codex":0.001782243,"about_ca_system_score_gemma":0.001982147,"threshold_uncertainty_score":0.027016103},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4019571,0.0004939456,0.59298956,0.00028158078,0.000113662434,0.000081575636,0.00008191444,0.0006864076,0.003314166],"genre_scores_gemma":[0.9858298,0.00008691978,0.01336198,0.000028432723,0.000026271531,0.000027824452,0.000023391556,0.000019092578,0.00059614494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930894,0.00021609517,0.000030968535,0.0001239616,0.0001140772,0.00020592826],"domain_scores_gemma":[0.9968016,0.002090037,0.00027321413,0.00022485857,0.00036804687,0.00024227645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010397919,0.0005292126,0.0006381195,0.00048570553,0.000550651,0.0013155569,0.0008658103,0.00059939787,0.0011556278],"category_scores_gemma":[0.0030126856,0.00022961134,0.00026108822,0.00056063297,0.00085438957,0.0010379134,0.000857763,0.0005416266,0.00014081379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040646794,0.00008070843,0.0013448172,0.00004480557,0.000032359647,0.00009184472,0.00012331098,0.95561814,0.0072686826,0.008726484,0.00064991316,0.025612349],"study_design_scores_gemma":[0.000007884876,0.000025640433,0.000084350344,0.0000010340389,0.0000026225118,0.000008215004,0.000018585182,0.9976611,0.0005887935,0.001458146,0.00014025375,0.0000034015561],"about_ca_topic_score_codex":0.004418586,"about_ca_topic_score_gemma":0.0035173064,"teacher_disagreement_score":0.004418586,"about_ca_system_score_codex":0.0009973268,"about_ca_system_score_gemma":0.0011460504,"threshold_uncertainty_score":0.008785725},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2580167,0.011576591,0.061697338,0.05565228,0.0009869545,0.0014649163,0.00026068176,0.0004124242,0.60993207],"genre_scores_gemma":[0.85317147,0.013828832,0.05642943,0.0055055474,0.00014858598,0.00085010903,0.00019263587,0.00012612194,0.06974733],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99898046,0.0006235665,0.000019511734,0.00006425956,0.00017429139,0.00013777029],"domain_scores_gemma":[0.9985708,0.0005372499,0.00010070649,0.00008632369,0.00022894552,0.00047593046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002337927,0.00028046113,0.00025883253,0.0014587964,0.0030090571,0.004589609,0.00084678835,0.00061615824,0.0060915397],"category_scores_gemma":[0.0020781772,0.00013326692,0.00037704635,0.0011237144,0.0027784295,0.0021024263,0.0031383215,0.0015474263,0.0006694436],"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.00014797629,0.0015657914,0.013914237,0.0021109518,0.00007184803,0.00047224606,0.08356045,0.001286481,0.0015267321,0.18091609,0.042860962,0.6715662],"study_design_scores_gemma":[0.00011570156,0.00044056872,0.028586254,0.0035776559,0.00013947477,0.0006300158,0.1737424,0.0029585846,0.00195783,0.12721342,0.6605643,0.00007389203],"about_ca_topic_score_codex":0.03166702,"about_ca_topic_score_gemma":0.13836367,"teacher_disagreement_score":0.03166702,"about_ca_system_score_codex":0.0069707404,"about_ca_system_score_gemma":0.013913804,"threshold_uncertainty_score":0.06296539},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018159224,0.00023538593,0.97930247,0.00018451583,0.00009439556,0.00006855539,0.000056401273,0.00015981389,0.001739266],"genre_scores_gemma":[0.7428077,0.00038336116,0.2536795,0.00018275372,0.00012882362,0.00013051282,0.00016143809,0.00010517207,0.002420745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918336,0.00020100763,0.000048004833,0.00020197417,0.00022981595,0.00013584703],"domain_scores_gemma":[0.9987312,0.0005589221,0.00019733146,0.00011263892,0.00022158746,0.00017834826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014136354,0.00072994735,0.0011209223,0.00061337603,0.0006754572,0.0011201303,0.0017968701,0.0007071856,0.0016426165],"category_scores_gemma":[0.0035416821,0.00033861253,0.00048520204,0.0008005713,0.00084413507,0.0019280904,0.0015169004,0.0010613054,0.00019477285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017649776,0.0001143628,0.00094811956,0.00011419879,0.000039590217,0.00012039845,0.00015584803,0.851486,0.008975229,0.06756547,0.0024676055,0.06783673],"study_design_scores_gemma":[0.000007290707,0.00004035346,0.00006731265,0.0000041527014,0.0000044299045,0.000016038246,0.000009967077,0.99027514,0.0006512154,0.008393661,0.0005231575,0.0000072606067],"about_ca_topic_score_codex":0.00237939,"about_ca_topic_score_gemma":0.002759148,"teacher_disagreement_score":0.00237939,"about_ca_system_score_codex":0.0013563643,"about_ca_system_score_gemma":0.002212582,"threshold_uncertainty_score":0.009841144},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005981281,0.00017809076,0.99246275,0.00007909968,0.000014052639,0.000012090842,0.000029148308,0.000050915412,0.0011925871],"genre_scores_gemma":[0.8651343,0.0010635878,0.12958129,0.00012073236,0.00007839477,0.000098950964,0.00012257772,0.00006226225,0.0037379444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938035,0.00018892586,0.000025413918,0.0001052765,0.00019448591,0.00010562193],"domain_scores_gemma":[0.99880564,0.0007353763,0.00019659536,0.00007132425,0.00014139559,0.000049677372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012485476,0.0010552544,0.0006869402,0.00034361612,0.00031885717,0.000874849,0.00078097114,0.0006932218,0.0013519678],"category_scores_gemma":[0.0025971308,0.00042980668,0.00046224566,0.00073180743,0.00092955586,0.0013398342,0.0011572113,0.0012474017,0.00031471538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005558671,0.000014078413,0.00023782963,0.000055693687,0.00002123299,0.00008393166,0.00004545404,0.94652915,0.004185083,0.030979527,0.00050149736,0.01729101],"study_design_scores_gemma":[0.0000037370546,0.000023681298,0.000042460677,0.000004612596,0.000005464122,0.000016646309,0.000006559836,0.99327326,0.00084969884,0.005468457,0.00029994422,0.000005401823],"about_ca_topic_score_codex":0.0025530476,"about_ca_topic_score_gemma":0.0021219058,"teacher_disagreement_score":0.0025530476,"about_ca_system_score_codex":0.0010501327,"about_ca_system_score_gemma":0.0011993536,"threshold_uncertainty_score":0.0076192617},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026474921,0.00064116745,0.96769977,0.00037294254,0.00007546521,0.000027195496,0.000033234774,0.00019167965,0.0044836127],"genre_scores_gemma":[0.941356,0.00025799213,0.054676116,0.00019292078,0.000033690212,0.00006525433,0.000048246297,0.000036937647,0.0033327828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978286,0.00007351162,0.0000107775695,0.00003908907,0.000051940904,0.000041807954],"domain_scores_gemma":[0.9994954,0.0003185235,0.000045811266,0.000026064889,0.00008895605,0.0000252356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077196566,0.0004143596,0.0006394358,0.00022133133,0.00031517388,0.0006443728,0.00089282525,0.00071345223,0.0015956365],"category_scores_gemma":[0.0017330007,0.00026938875,0.00027353485,0.000290866,0.0008299597,0.0007846375,0.00086557673,0.00090210757,0.00016692647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022745458,0.000012691959,0.0001878619,0.00002777805,0.000012582721,0.000022760605,0.00002021588,0.97275394,0.00067903945,0.011110828,0.00034877585,0.014800789],"study_design_scores_gemma":[0.000001671135,0.0000047950903,0.000017318664,0.0000015599138,0.0000012367361,0.0000020666646,0.000002230441,0.99786633,0.000077375626,0.0019134252,0.00011077133,0.0000012617793],"about_ca_topic_score_codex":0.006568598,"about_ca_topic_score_gemma":0.0065532415,"teacher_disagreement_score":0.006568598,"about_ca_system_score_codex":0.00090659596,"about_ca_system_score_gemma":0.0009334544,"threshold_uncertainty_score":0.013060749},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075098954,0.001225302,0.89895016,0.0019381954,0.00012619184,0.00005486871,0.0001231922,0.000184724,0.022298401],"genre_scores_gemma":[0.94202054,0.0008580691,0.05161142,0.00040548824,0.00008598315,0.00011275303,0.00007408323,0.00003695737,0.0047946484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942505,0.00023257788,0.000016360691,0.00007746916,0.00017622155,0.000072370654],"domain_scores_gemma":[0.99881434,0.0006874042,0.00011541419,0.00020465546,0.00010972339,0.000068504196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009218512,0.00028261737,0.00053344877,0.00030679803,0.0004473986,0.0008776196,0.00094902446,0.0006980424,0.0018811666],"category_scores_gemma":[0.0030497494,0.00019517996,0.00034937565,0.0004364769,0.0023516202,0.0017302749,0.0018543246,0.0015019145,0.00020879568],"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.00007246761,0.000026789987,0.00031617688,0.00006642687,0.000022649885,0.000113193826,0.00016556581,0.13338743,0.002514844,0.8491511,0.001583316,0.012580019],"study_design_scores_gemma":[0.000012728235,0.00002183347,0.00013043983,0.000015533627,0.000006288231,0.000029664563,0.000028627062,0.66235846,0.0007278275,0.3348754,0.0017787318,0.000014456801],"about_ca_topic_score_codex":0.0016654411,"about_ca_topic_score_gemma":0.0016201348,"teacher_disagreement_score":0.0018811666,"about_ca_system_score_codex":0.0011751468,"about_ca_system_score_gemma":0.00092804746,"threshold_uncertainty_score":0.008526325},"labels":[],"label_agreement":null}]}