{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":146,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":146,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"d0474043af5f","filters":{"venue":"Wireless Networks"}},"results":[{"id":"W2156689181","doi":"10.1023/a:1012319418150","title":"Routing with Guaranteed Delivery in Ad Hoc Wireless Networks","year":2001,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1203,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa; Carleton University","funders":"","keywords":"Computer science; Network packet; Computer network; Routing protocol; Wireless ad hoc network; Distributed computing; Wireless; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.009027105612704069,"gpt":0.2084926108908004,"spread":0.1994655052780963,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009310115,0.0007388381,0.000885985,0.0002463086,0.0003590462,0.0004772085,0.002367242,0.0005326526,0.00003575091],"category_scores_gemma":[0.00001025719,0.0006873972,0.0001801636,0.002788413,0.0002130634,0.0009315373,0.0007075401,0.001450364,0.00003536043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002568441,"about_ca_system_score_gemma":0.0001405111,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001450119,"about_ca_topic_score_gemma":0.001473152,"domain_scores_codex":[0.9944808,0.0003495413,0.0009509716,0.001498456,0.0006870829,0.002033114],"domain_scores_gemma":[0.9968641,0.0004670052,0.0004300985,0.001712505,0.0001719959,0.0003542261],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002583888,0.0001914083,0.02280438,0.0000128976,0.00006727898,0.001027078,0.0004400038,0.6219438,0.00001580072,0.006435147,0.0009164702,0.3458874],"study_design_scores_gemma":[0.001880679,0.0001981652,0.005980683,0.0005289081,0.0000202983,0.0002380478,0.00009213209,0.9880247,0.00001070492,0.0001056644,0.002026953,0.0008930261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3018529,0.002780832,0.69174,0.0002050485,0.0008019073,0.0006186752,8.841184e-7,0.0005671682,0.001432612],"genre_scores_gemma":[0.9924511,0.001953444,0.003186017,0.001143117,0.00073765,0.0001593232,0.00001785724,0.0001100815,0.0002413954],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6905982,"threshold_uncertainty_score":0.9995577,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2907095036","doi":"10.1007/s11276-018-01932-1","title":"Smart integrated IoT healthcare system for cancer care","year":2019,"lang":"en","type":"article","venue":"Wireless Networks","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":153,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Interoperability; Variety (cybernetics); Computer science; Interconnectivity; Cloud computing; Analytics; Health care; Internet of Things; Big data; Healthcare industry; Data science; Knowledge management; Computer security; Process management; World Wide Web; Business; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01174229301541405,"gpt":0.2460826660603615,"spread":0.2343403730449474,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001930077,0.0002100807,0.0003266353,0.00006643058,0.0002165717,0.0001591192,0.0007604962,0.0001727614,0.000001659083],"category_scores_gemma":[0.000003353711,0.0001878892,0.0001113361,0.0004176784,0.00001719053,0.0001057243,0.0001879718,0.0002632369,0.00002936984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002763114,"about_ca_system_score_gemma":0.000175155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005592622,"about_ca_topic_score_gemma":0.00009698149,"domain_scores_codex":[0.9983463,0.00006985162,0.0002855831,0.0005123219,0.0001741272,0.000611841],"domain_scores_gemma":[0.9988109,0.0001083021,0.0001302239,0.0005302305,0.0002924581,0.0001278966],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006812539,0.00003367751,0.02923276,0.001397851,0.00009131053,0.0000177008,0.004221822,0.0225654,0.00008633354,0.01340473,0.01990374,0.9089766],"study_design_scores_gemma":[0.0004834426,0.00008335915,0.0007216553,0.0006084038,0.000007213886,0.00000647559,0.0002969417,0.9646556,0.0001518312,0.00002049406,0.03266092,0.0003036278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2125382,0.00486682,0.7184402,0.0009077689,0.0599755,0.001284783,0.000003818462,0.0009586652,0.001024222],"genre_scores_gemma":[0.9944335,0.00001416941,0.002330113,0.0003207013,0.002526276,0.00007569575,0.0000207447,0.00002909129,0.0002496847],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9420902,"threshold_uncertainty_score":0.7661899,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2058242263","doi":"10.1007/s11276-011-0383-2","title":"On batch verification with group testing for vehicular communications","year":2011,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":149,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scheme (mathematics); Group signature; Identity (music); Overhead (engineering); Tracing; Signature (topology); Transmission (telecommunications); Public-key cryptography; Distributed computing; Computer network; Encryption; Telecommunications; Operating system; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05280334535817559,"gpt":0.2409167144077342,"spread":0.1881133690495586,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003874397,0.0002652851,0.0002610535,0.00008684736,0.0004563727,0.0001377162,0.002153228,0.0001919859,0.00000471046],"category_scores_gemma":[0.00004372477,0.0002450344,0.00007413675,0.0007238911,0.0001650941,0.0003299215,0.0002356945,0.0004136137,0.00001709689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006932912,"about_ca_system_score_gemma":0.00003491387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006386759,"about_ca_topic_score_gemma":0.0000572046,"domain_scores_codex":[0.9981582,0.0001368358,0.000336606,0.0005794291,0.000259016,0.0005299131],"domain_scores_gemma":[0.9961206,0.0008715487,0.0002408713,0.002390978,0.0002392159,0.0001368381],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001423014,0.0006371834,0.002343308,0.0000389994,0.0001120246,0.00001731443,0.001947609,0.02902424,0.0001688477,0.7676455,0.00148602,0.1964367],"study_design_scores_gemma":[0.0005765396,0.0003500772,0.003359306,0.0001534425,0.00002094349,0.00001693486,0.00004147211,0.9913556,0.0001257987,0.002991362,0.0006392483,0.0003692831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04436402,0.0002387817,0.9509236,0.0002713394,0.000358023,0.0007197556,0.000002757296,0.0005463259,0.002575408],"genre_scores_gemma":[0.866604,0.00003597192,0.1324857,0.000385863,0.0001469908,0.000251002,0.00003132807,0.00004057677,0.0000185124],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9623314,"threshold_uncertainty_score":0.9992214,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001909640","doi":"10.1007/s11276-008-0146-x","title":"Hierarchical geographic multicast routing for wireless sensor networks","year":2008,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Royal Society; National Science Foundation","keywords":"Computer science; Computer network; Multicast; Protocol Independent Multicast; Source-specific multicast; Distance Vector Multicast Routing Protocol; Xcast; Distributed computing; Pragmatic General Multicast; IP multicast","retraction":null,"screen_n_in":null,"score":{"opus":0.01677078487115667,"gpt":0.2357184712548442,"spread":0.2189476863836875,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008489008,0.0007231778,0.0009036665,0.0002104443,0.001213263,0.0002952821,0.002187588,0.0006664305,0.00001739168],"category_scores_gemma":[0.00004908011,0.0007218437,0.0005313749,0.001349811,0.0004923401,0.0005708839,0.0007576662,0.001306726,0.00002230759],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001011016,"about_ca_system_score_gemma":0.0001157285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006008715,"about_ca_topic_score_gemma":0.00004795813,"domain_scores_codex":[0.9942586,0.0003188225,0.001019031,0.001605201,0.0006299605,0.002168332],"domain_scores_gemma":[0.9955525,0.001381505,0.0003942132,0.001743244,0.0002935365,0.0006350097],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000229683,0.0005293117,0.02092612,0.00005640366,0.0002890854,0.0004899395,0.000726636,0.6380994,0.00008011374,0.07379312,0.006539241,0.2582409],"study_design_scores_gemma":[0.001498419,0.000158105,0.00476278,0.0001219617,0.0000290414,0.0002536107,0.0000195189,0.990005,0.00002764209,0.0002162328,0.002060576,0.0008471075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07503849,0.0005709813,0.9197416,0.0003920176,0.001788028,0.001154128,0.000005353681,0.0009106167,0.0003987282],"genre_scores_gemma":[0.9676257,0.0004796224,0.02768963,0.0009217355,0.00246217,0.0003954482,0.00004544972,0.0001263229,0.0002539396],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8925872,"threshold_uncertainty_score":0.9995233,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2036198192","doi":"10.1007/s11276-009-0220-z","title":"A sustainable heuristic QoS routing algorithm for pervasive multi-layered satellite wireless networks","year":2009,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Satellite Communication Systems","field":"Engineering","cited_by":104,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Quality of service; Computer network; Heuristic; Distributed computing; Packet loss; Routing (electronic design automation); Algorithm; Network packet","retraction":null,"screen_n_in":null,"score":{"opus":0.01803460255802115,"gpt":0.246192164578561,"spread":0.2281575620205399,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007085228,0.0006265696,0.0008097778,0.0001671182,0.0004449782,0.0003075531,0.0008948761,0.0005159696,0.000009620938],"category_scores_gemma":[0.00004293578,0.0006938252,0.0002750062,0.0007506031,0.00007995329,0.0003195936,0.0001175712,0.0007174459,0.00002152902],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003910719,"about_ca_system_score_gemma":0.00004707199,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000539539,"about_ca_topic_score_gemma":0.00002464016,"domain_scores_codex":[0.9964057,0.0001837474,0.0009856692,0.000596535,0.000285256,0.001543061],"domain_scores_gemma":[0.997224,0.0005869205,0.0002393148,0.001221547,0.0004257675,0.000302447],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003457501,0.00009759236,0.0003980313,0.000123945,0.0001448227,0.00004305163,0.0008428421,0.3933945,0.000100013,0.001520304,0.0006363899,0.602664],"study_design_scores_gemma":[0.001344626,0.00006986118,0.0008360902,0.0002612248,0.00004694544,0.00002602759,0.001188699,0.9864708,0.00009742274,0.00006091973,0.00884176,0.0007556595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005528016,0.02222866,0.9672914,0.0000851239,0.001108345,0.001786966,0.00001374586,0.001287673,0.0006700546],"genre_scores_gemma":[0.983858,0.004690008,0.00824424,0.0001890841,0.001460805,0.0003091668,0.0001922284,0.0002007071,0.0008557483],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.97833,"threshold_uncertainty_score":0.9995513,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2076225277","doi":"10.1007/s11276-010-0282-y","title":"Aggregation convergecast scheduling in wireless sensor networks","year":2010,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"University of Alberta","keywords":"Computer science; Scheduling (production processes); Wireless sensor network; Bipartite graph; Schedule; Distributed computing; Graph; Computer network; Mathematical optimization; Theoretical computer science; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.007999662009683224,"gpt":0.217352912624326,"spread":0.2093532506146428,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001076058,0.0007030523,0.0007581531,0.0004240981,0.0003858581,0.0005175605,0.002057861,0.0009043959,0.00004536904],"category_scores_gemma":[0.00005253837,0.0007449941,0.0002323733,0.002260152,0.0002851608,0.0008601224,0.0005904927,0.002476274,0.0000554797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001335243,"about_ca_system_score_gemma":0.0001101468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001356743,"about_ca_topic_score_gemma":0.0008994791,"domain_scores_codex":[0.9947447,0.0003121117,0.001060044,0.001477972,0.0006989969,0.001706205],"domain_scores_gemma":[0.9964837,0.0005784876,0.0004758466,0.001761397,0.0002565149,0.0004440079],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003068691,0.0001590995,0.008642912,0.00001237436,0.00002541424,0.0001442407,0.0001445094,0.8968565,0.000787752,0.03820522,0.0001722431,0.05481907],"study_design_scores_gemma":[0.001126994,0.00004458946,0.002951381,0.0001799441,0.0000115082,0.00008089355,0.00003661196,0.9934726,0.0005989698,0.0000886887,0.0005639098,0.0008439071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.462113,0.0001851694,0.5321566,0.0002808385,0.003679867,0.0003062835,9.965908e-7,0.0005173662,0.0007599],"genre_scores_gemma":[0.9797295,0.0002328834,0.0176619,0.0005164203,0.001420654,0.00007490745,0.00003948437,0.0001074547,0.000216824],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5176165,"threshold_uncertainty_score":0.9998251,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2117632372","doi":"10.1007/s11276-009-0182-1","title":"A cluster-based trust-aware routing protocol for mobile ad hoc networks","year":2009,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":99,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Polytechnique Montréal","keywords":"Computer science; Computer network; Wireless Routing Protocol; Routing protocol; Optimized Link State Routing Protocol; Wireless ad hoc network; Mobile ad hoc network; Distributed computing; Zone Routing Protocol; Dynamic Source Routing; Ad hoc wireless distribution service; Network packet; Wireless; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01484970797598177,"gpt":0.2775410418727535,"spread":0.2626913338967717,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000991937,0.0007238122,0.0007721178,0.0001093774,0.0006161106,0.000612902,0.002313687,0.0006296895,0.00003236111],"category_scores_gemma":[0.00002449019,0.0007009948,0.000428094,0.00111496,0.0001037336,0.0006288719,0.0003114274,0.0008530235,0.0000143233],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002074013,"about_ca_system_score_gemma":0.0001966304,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002895749,"about_ca_topic_score_gemma":0.000022914,"domain_scores_codex":[0.9949493,0.0002563544,0.00100161,0.001450105,0.0005255413,0.00181702],"domain_scores_gemma":[0.9963019,0.0006005286,0.0005723258,0.001821093,0.0002710046,0.0004331198],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001868965,0.0001967036,0.0001477944,0.00002719718,0.00001970063,0.00001735728,0.00007738379,0.57541,0.000003805022,0.001553133,0.008118611,0.4142414],"study_design_scores_gemma":[0.003674051,0.0009684885,0.000254685,0.0003400503,0.00001873145,0.00001512782,0.00001664423,0.9585063,0.00003959162,0.0003539164,0.03502374,0.0007886309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004071606,0.0002512527,0.8853027,0.0003624514,0.000561082,0.1118538,0.000003232194,0.0009488587,0.0003094929],"genre_scores_gemma":[0.5517402,0.00002292054,0.02385941,0.003731213,0.001812518,0.4183752,0.0000467092,0.0001191212,0.0002926415],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8614433,"threshold_uncertainty_score":0.9995441,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2592830952","doi":"10.1007/s11276-017-1482-5","title":"An efficient dynamic traffic light scheduling algorithm considering emergency vehicles for intelligent transportation systems","year":2017,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Traffic control and management","field":"Engineering","cited_by":95,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Intersection (aeronautics); Computer science; Traffic optimization; Scheduling (production processes); Traffic bottleneck; Floating car data; Emergency vehicle; Traffic congestion reconstruction with Kerner's three-phase theory; Traffic conflict; Schedule; Traffic flow (computer networking); Traffic wave; Traffic signal; Real-time computing; Transport engineering; Traffic congestion; Computer network; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.009253508075361034,"gpt":0.2314876299241527,"spread":0.2222341218487917,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002099926,0.0002453535,0.000288812,0.0000685962,0.0003655839,0.0001622956,0.0003049203,0.0001206645,0.000006758416],"category_scores_gemma":[0.000003546132,0.0002544782,0.0001170665,0.00004974403,0.00002473059,0.0001303541,0.00000951791,0.0001525562,0.000004342593],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006619197,"about_ca_system_score_gemma":0.000008928023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000202568,"about_ca_topic_score_gemma":0.0002493192,"domain_scores_codex":[0.9986653,0.00001516339,0.0004286635,0.0003097932,0.0001461253,0.0004349993],"domain_scores_gemma":[0.9992328,0.00002434632,0.0001087895,0.0004556886,0.00005381193,0.0001245072],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009049016,0.00003370878,0.00001813201,0.0001092282,0.00006950356,0.000005912879,0.0002758179,0.7796526,0.0001615398,0.0003027358,0.00004576478,0.219316],"study_design_scores_gemma":[0.0004822149,0.00003686828,0.001407577,0.0001166629,0.00006897077,0.00000114282,0.0002644807,0.9961298,0.00003256993,0.000007219635,0.001149898,0.0003025711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4055036,0.001680566,0.5893723,0.00003647046,0.002413018,0.0005414544,0.00001282866,0.0004060968,0.00003360451],"genre_scores_gemma":[0.9974855,0.0004173655,0.001424983,0.000004661127,0.000320612,0.0001962279,0.00005225413,0.00006584165,0.00003254521],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5919819,"threshold_uncertainty_score":0.9999908,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092946865","doi":"10.1007/s11276-007-0034-9","title":"Graphical properties of easily localizable sensor networks","year":2007,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":95,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Computer science; Wireless sensor network; Social connectedness; Euclidean geometry; Graphical model; Euclidean distance; RADIUS; Theoretical computer science; Topology (electrical circuits); Distributed computing; Artificial intelligence; Computer network; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.00847854785588914,"gpt":0.1892899982370753,"spread":0.1808114503811862,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002730311,0.0002241096,0.0003221602,0.0001435433,0.00007931381,0.00002297218,0.0002489022,0.0004102397,0.00001952574],"category_scores_gemma":[0.00001599815,0.000198935,0.00009905035,0.0006420295,0.0002231017,0.00008575542,0.00005109774,0.0003602261,0.000005607399],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003691835,"about_ca_system_score_gemma":0.000008818622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002097471,"about_ca_topic_score_gemma":0.0000367402,"domain_scores_codex":[0.9985892,0.00001950745,0.0004505375,0.0001904491,0.0001901926,0.0005600989],"domain_scores_gemma":[0.9994055,0.00004503131,0.00005573011,0.0003207942,0.00009222441,0.00008073013],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004525422,0.00003000487,0.004464116,0.00008242078,0.00005569479,0.00001592892,0.00006943726,0.9747937,0.001018541,0.003447478,0.001242485,0.01473499],"study_design_scores_gemma":[0.0003249774,0.0000337659,0.0008598461,0.0001342932,0.00001976877,0.00001069536,0.000184272,0.9766966,0.01998763,0.00006674836,0.001380212,0.0003011524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1492761,0.002793203,0.8446643,0.00001842845,0.0005775043,0.0001816767,0.000001286627,0.001027756,0.001459756],"genre_scores_gemma":[0.9987404,0.000503106,0.0003529142,0.00005745844,0.0002081271,0.00001025653,0.000007726069,0.0000565882,0.00006339218],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8494643,"threshold_uncertainty_score":0.8112335,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2142573375","doi":"10.1007/s11276-005-5265-z","title":"Fault-Tolerant and 3-Dimensional Distributed Topology Control Algorithms in Wireless Multi-hop Networks","year":2005,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":93,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Topology control; Topology (electrical circuits); Algorithm; Hop (telecommunications); Node (physics); Wireless network; Fault tolerance; Computer network; Network topology; Wireless; Distributed algorithm; Power control; Distributed computing; Power (physics); Key distribution in wireless sensor networks; Mathematics; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.009062143242365433,"gpt":0.233984949971443,"spread":0.2249228067290776,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000804448,0.0006288499,0.0009526654,0.0001688693,0.0003046091,0.0002337114,0.001221503,0.0006778188,0.00003477701],"category_scores_gemma":[0.00001883069,0.0006149678,0.0001508222,0.0008795669,0.0003471487,0.0006113339,0.0006047005,0.001221162,0.00002009048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002014901,"about_ca_system_score_gemma":0.00008771281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001554207,"about_ca_topic_score_gemma":0.0007877593,"domain_scores_codex":[0.9952423,0.00043668,0.0009796788,0.001344511,0.0004287996,0.001568038],"domain_scores_gemma":[0.9974092,0.0006467714,0.0003127996,0.001014691,0.0001632831,0.0004532289],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000742942,0.0002637569,0.003437311,0.00000754768,0.0000574001,0.0001667044,0.0001208343,0.7911956,0.00002785306,0.006456387,0.001371008,0.1968213],"study_design_scores_gemma":[0.004232395,0.00009148596,0.007786317,0.0001057799,0.00001897159,0.0001250325,0.00001739484,0.9853697,0.00001623759,0.00008508004,0.001487982,0.0006635929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06805216,0.00250089,0.9258199,0.001423134,0.001079225,0.0007160066,0.00001517568,0.0003407415,0.00005271941],"genre_scores_gemma":[0.9873732,0.0003002748,0.009145173,0.001748186,0.001036398,0.0001769944,0.00007224031,0.00005801805,0.00008945385],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9193211,"threshold_uncertainty_score":0.9996302,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1481274137","doi":"10.1023/a:1019130823870","title":"Scheduling of real‐time traffic in IEEE 802.11 wireless LANs","year":2000,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Federation for the Humanities and Social Sciences","keywords":"Computer science; Computer network; Asynchronous communication; Distributed coordination function; Access control; Network packet; Wireless network; Wireless; Protocol (science); Network allocation vector; IEEE 802.11; Distributed computing; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01118100435878801,"gpt":0.2389932913511009,"spread":0.2278122869923129,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007622296,0.0004303705,0.0007941973,0.0001858033,0.0001437908,0.0001562997,0.001691936,0.0004121144,0.0001915228],"category_scores_gemma":[0.000004211232,0.0004272079,0.0002026873,0.001433598,0.0001457122,0.0005154184,0.0001271136,0.0005487252,0.00007847715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007835816,"about_ca_system_score_gemma":0.0001255751,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002406783,"about_ca_topic_score_gemma":0.000312489,"domain_scores_codex":[0.9965562,0.0002867823,0.0009109243,0.0008248764,0.000412422,0.001008848],"domain_scores_gemma":[0.9980594,0.0002924004,0.0002570248,0.001078853,0.0000858456,0.0002264704],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006287757,0.0002011966,0.001766574,0.00003840283,0.00002291575,0.00006115987,0.0004315931,0.6902167,0.0002340594,0.002310176,0.0006140514,0.3040403],"study_design_scores_gemma":[0.001092007,0.0001084989,0.002021723,0.0005194836,0.000008748591,0.00001596388,0.00001492023,0.9945581,0.0002778416,0.0001530788,0.0007234859,0.0005061639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9547197,0.0001834825,0.03965055,0.0001787024,0.0003338642,0.002259249,0.000004765028,0.0003665801,0.002303168],"genre_scores_gemma":[0.9944587,0.0004299888,0.003372862,0.0001379953,0.0004956968,0.0006047193,0.00001176818,0.00005619945,0.0004321068],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3043414,"threshold_uncertainty_score":0.999818,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2261702034","doi":"10.1007/s11276-016-1199-x","title":"Delay and energy consumption analysis of priority guaranteed MAC protocol for wireless body area networks","year":2016,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Body Area Networks","field":"Engineering","cited_by":78,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta; Dalhousie University","funders":"","keywords":"Computer science; Retransmission; Energy consumption; Computer network; Superframe; Throughput; Network packet; Quality of service; Markov chain; Node (physics); Body area network; Wireless network; Wireless sensor network; Real-time computing; Wireless; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01365714931753993,"gpt":0.2455499756150728,"spread":0.2318928262975329,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004980292,0.00063502,0.001228136,0.0004085581,0.0001765405,0.00007407203,0.0004258409,0.0006655296,0.00009289623],"category_scores_gemma":[0.00001615408,0.000522036,0.0003798674,0.0009564366,0.0003219088,0.000265006,0.0001288468,0.0002955539,0.00000141359],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001535278,"about_ca_system_score_gemma":0.00003204063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005300142,"about_ca_topic_score_gemma":0.0004122441,"domain_scores_codex":[0.9967563,0.0001311308,0.001057567,0.0007188399,0.0003350071,0.001001114],"domain_scores_gemma":[0.9976554,0.0007514391,0.0003505409,0.0007640955,0.0002095632,0.0002689524],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001015286,0.0002003142,0.06217064,0.0004203494,0.003678181,0.00002441538,0.0001249675,0.7381949,0.002299826,0.006482145,0.003600975,0.1817879],"study_design_scores_gemma":[0.002538841,0.00009424784,0.009920848,0.0004428324,0.0006527843,0.000009615148,0.000009891085,0.9829274,0.0004541484,0.00006406763,0.002211269,0.0006740111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1138894,0.0002791383,0.8674447,0.00002827289,0.000382586,0.01706035,0.00008286273,0.0005623005,0.0002703591],"genre_scores_gemma":[0.9461091,0.0003153977,0.0002989214,0.00004861395,0.0004225231,0.05251082,0.00006971067,0.0001398368,0.00008512061],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8671458,"threshold_uncertainty_score":0.9997231,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2603855048","doi":"10.1007/s11276-017-1493-2","title":"New path planning model for mobile anchor-assisted localization in wireless sensor networks","year":2017,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":72,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University; Dalhousie University","funders":"","keywords":"Computer science; Wireless sensor network; Path (computing); Collinearity; Energy consumption; Distributed computing; Set (abstract data type); Computer network; Energy (signal processing); Event (particle physics); Real-time computing","retraction":null,"screen_n_in":null,"score":{"opus":0.01833921180851266,"gpt":0.2525537816487973,"spread":0.2342145698402847,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001817796,0.0003376137,0.000432299,0.0001322878,0.0003908327,0.0002249398,0.0005151799,0.0005659128,0.000008003372],"category_scores_gemma":[0.00002435066,0.0003591724,0.00009994685,0.0002064463,0.00007417532,0.0002911416,0.0000889617,0.0003743217,0.000002641458],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001331224,"about_ca_system_score_gemma":0.00003479204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004047853,"about_ca_topic_score_gemma":0.00009101934,"domain_scores_codex":[0.9983171,0.00001986684,0.0004628627,0.000375005,0.0001569671,0.0006682537],"domain_scores_gemma":[0.9989136,0.0000717295,0.0001542652,0.000675193,0.0000747187,0.0001104835],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003541768,0.0000155091,0.004031394,0.00004647817,0.00002215736,0.000009389112,0.0001491757,0.9328424,0.00003626567,0.0007803809,0.005051774,0.05697969],"study_design_scores_gemma":[0.00104979,0.00002862643,0.0008223403,0.0002389709,0.00001904493,0.000003135066,0.0001106223,0.9963105,0.0002300891,0.0001908574,0.0005673706,0.0004286271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02876224,0.0005893377,0.9680604,0.00002437553,0.0006876829,0.0006193903,0.000009574779,0.0008348131,0.000412238],"genre_scores_gemma":[0.9962177,0.0003472556,0.002372694,0.00006643916,0.0003876025,0.0002013561,0.0001021794,0.0001132908,0.0001914516],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9674555,"threshold_uncertainty_score":0.999886,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068173146","doi":"10.1007/s11276-005-3517-6","title":"A Performance Evaluation of a Novel Energy-Aware Data-Centric Routing Algorithm in Wireless Sensor Networks","year":2005,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Routing protocol; Wireless Routing Protocol; Wireless sensor network; Dynamic Source Routing; Distance-vector routing protocol; Distributed computing; Hierarchical routing; Ad hoc On-Demand Distance Vector Routing; Zone Routing Protocol; Algorithm; Routing (electronic design automation)","retraction":null,"screen_n_in":null,"score":{"opus":0.03208166225354081,"gpt":0.261222222430897,"spread":0.2291405601773562,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00319698,0.0006782424,0.0009063011,0.000490366,0.0002734167,0.0002007687,0.003315319,0.0005559642,0.00001831406],"category_scores_gemma":[0.00003275521,0.0007095866,0.0001561156,0.003123086,0.0001749227,0.001375673,0.001414855,0.0008465982,0.000005627208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004733629,"about_ca_system_score_gemma":0.0002795185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002081198,"about_ca_topic_score_gemma":0.0003470052,"domain_scores_codex":[0.9929209,0.0005418625,0.001512717,0.0016951,0.001749643,0.001579746],"domain_scores_gemma":[0.9950137,0.0004700326,0.0008645335,0.002751624,0.0006245556,0.0002756142],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001421981,0.0002876702,0.001007092,0.000007453683,0.00002903197,0.000006251491,0.00008691991,0.5734151,0.00001915522,0.0007027689,0.0001189742,0.4243054],"study_design_scores_gemma":[0.002721689,0.0000584307,0.001501777,0.0004315774,0.00006306318,0.00004421888,0.00004545419,0.9940006,0.0001450491,0.000003092106,0.0002522716,0.0007327936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1546651,0.0008729947,0.8422962,0.0001414387,0.0009236631,0.0004162719,0.000011689,0.000265032,0.000407605],"genre_scores_gemma":[0.972818,0.000660864,0.02464982,0.000238264,0.001189055,0.0000709295,0.0002202248,0.00008882227,0.00006405355],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8181528,"threshold_uncertainty_score":0.9995355,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2904344771","doi":"10.1007/s11276-018-01896-2","title":"A framework for social media data analytics using Elasticsearch and Kibana","year":2018,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; NoSQL; Search engine indexing; Context (archaeology); Process (computing); Analytics; Set (abstract data type); Social media; Relational database; Enhanced Data Rates for GSM Evolution; Database; Big data; Data science; World Wide Web; Data mining; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.1618337897448391,"gpt":0.3728418159850527,"spread":0.2110080262402136,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005558152,0.0001538767,0.0002230873,0.00008615308,0.0003203132,0.0003112236,0.001943662,0.0001975414,0.000004257918],"category_scores_gemma":[0.0002626541,0.0001544767,0.00002551514,0.0004193572,0.0002965232,0.0003928442,0.001848662,0.0002447437,0.000002177457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003139503,"about_ca_system_score_gemma":0.0000732217,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001458414,"about_ca_topic_score_gemma":0.00004429342,"domain_scores_codex":[0.9984645,0.00005102538,0.0002165627,0.0005837248,0.0002302412,0.0004539342],"domain_scores_gemma":[0.9977524,0.0008016233,0.0001072003,0.001101075,0.0001328149,0.0001048791],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005376646,0.00009355866,0.00111336,0.00004571728,0.0001154533,0.00001881088,0.002006458,0.00008273643,0.00005991014,0.4015271,0.03732884,0.5575542],"study_design_scores_gemma":[0.0001284428,0.00005102274,0.0003131437,0.00006830417,0.00002306641,0.000006512427,0.00002435523,0.9799745,0.00005161812,0.01772685,0.001445836,0.0001863539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006653709,0.00006661608,0.9921959,0.0002051373,0.0003891026,0.0001421783,0.0000718223,0.0002211508,0.00005435347],"genre_scores_gemma":[0.4841464,0.00002061525,0.5143785,0.0001041932,0.001274227,0.000005343038,0.00005008633,0.00001714547,0.000003542278],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9798918,"threshold_uncertainty_score":0.6299376,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2883723754","doi":"10.1007/s11276-018-1796-y","title":"Next generation wireless cellular networks: ultra-dense multi-tier and multi-cell cooperation perspective","year":2018,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":63,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Reliability (semiconductor); Computer network; Low latency (capital markets); Wireless; Telecommunications; Wireless network; Key (lock); Open research; Efficient energy use; Cellular network; Latency (audio); Heterogeneous network; Next-generation network; The Internet; Electrical engineering; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.01902428644199325,"gpt":0.2265689387290187,"spread":0.2075446522870255,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002028033,0.0004308478,0.0003753499,0.000105013,0.0003431131,0.0002023355,0.00015276,0.0003896247,0.00003002712],"category_scores_gemma":[0.00001251389,0.0004663441,0.00006073372,0.00030736,0.0001561021,0.0006169594,0.00003432419,0.0003502948,0.0000355283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003154319,"about_ca_system_score_gemma":0.0000247333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008139839,"about_ca_topic_score_gemma":0.0004263374,"domain_scores_codex":[0.9981603,0.0001206567,0.000466639,0.0005679078,0.0001483435,0.000536127],"domain_scores_gemma":[0.9989351,0.00005408134,0.0001211878,0.0003973159,0.000316996,0.0001753202],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001914418,0.00004983813,0.0001299494,0.00002317341,0.00003957469,0.000007217086,0.0009580284,0.96234,0.03178122,0.0002455313,0.0006761582,0.003730185],"study_design_scores_gemma":[0.001323643,0.00006157329,0.00002848902,0.00006285616,0.00003791938,0.00001020941,0.0004390817,0.9889912,0.008379916,0.000002165687,0.0001461364,0.000516814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06760875,0.003404494,0.925975,0.00001426082,0.001621421,0.0006558856,0.000006943741,0.00046654,0.0002467558],"genre_scores_gemma":[0.9869502,0.001076972,0.008778171,0.00005433337,0.002416687,0.00008986003,0.000125411,0.0001583492,0.0003500627],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9193414,"threshold_uncertainty_score":0.9997788,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1502585607","doi":"10.1023/a:1019166304306","title":"User mobility profile prediction: An adaptive fuzzy inference approach","year":2000,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Base station; Code division multiple access; Quality of service; Channel (broadcasting); Wireless; Computer network; Wireless network; Cellular network; Real-time computing; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.03071548595568414,"gpt":0.2781505992398886,"spread":0.2474351132842045,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009428558,0.0003413792,0.0003725928,0.0001058198,0.0005205005,0.0004211703,0.003535627,0.0003171718,0.0003115818],"category_scores_gemma":[0.00001639373,0.0003288818,0.0001067509,0.001367378,0.0003091592,0.001653704,0.0006395127,0.001044681,0.0001304013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001425754,"about_ca_system_score_gemma":0.0001847641,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009414787,"about_ca_topic_score_gemma":0.00003427276,"domain_scores_codex":[0.9960382,0.0008077829,0.000538271,0.001033341,0.0007266238,0.0008557733],"domain_scores_gemma":[0.9957184,0.0002903491,0.0001250881,0.003167475,0.0002925792,0.0004061261],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001274947,0.0009587941,0.002646235,0.00001845571,0.00005455473,0.000008314664,0.0006866269,0.3811981,0.00001410386,0.04993283,0.003238359,0.5611161],"study_design_scores_gemma":[0.0003956962,0.0001946688,0.01149713,0.0000350463,0.000005137289,0.00001265609,0.00004623917,0.9842423,0.00002134656,0.0005947127,0.002632207,0.0003229011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05911764,0.0005095386,0.8995351,0.0002692535,0.0002549511,0.00110004,0.00001485824,0.001094208,0.03810446],"genre_scores_gemma":[0.9708645,0.000361827,0.02625695,0.0001624425,0.0003966862,0.0004657223,0.00008013636,0.0000356829,0.001376065],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9117469,"threshold_uncertainty_score":0.9999163,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3035632193","doi":"10.1007/s11276-020-02385-1","title":"End-edge-cloud collaborative computation offloading for multiple mobile users in heterogeneous edge-server environment","year":2020,"lang":"en","type":"article","venue":"Wireless Networks","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Science Foundation of Fujian Province; National Natural Science Foundation of China","keywords":"Computer science; Cloud computing; Computation offloading; Server; Enhanced Data Rates for GSM Evolution; Mobile edge computing; Distributed computing; Benchmark (surveying); Edge computing; Quality of service; Mobile device; Computer network; Operating system; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0171948016925145,"gpt":0.2288166706288136,"spread":0.2116218689362991,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002511985,0.0002690375,0.0003497434,0.00006773332,0.0002174107,0.000173753,0.0005615693,0.0001434152,0.000003452417],"category_scores_gemma":[0.00001989521,0.0002914762,0.0001034184,0.0005135403,0.00005272435,0.0002695004,0.0003279687,0.0002336648,0.00002675196],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001563658,"about_ca_system_score_gemma":0.0000585216,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001593705,"about_ca_topic_score_gemma":0.00001106707,"domain_scores_codex":[0.9979696,0.0001232096,0.0004350032,0.00067221,0.0002265487,0.0005734855],"domain_scores_gemma":[0.9989555,0.0003638609,0.0001837677,0.0002555929,0.00006010414,0.0001811149],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005517402,0.000083012,0.003506087,0.00003776597,0.00003573126,0.00002740119,0.003926819,0.9309028,0.000235557,0.000126062,0.003570767,0.05749283],"study_design_scores_gemma":[0.001031457,0.0001854389,0.0005378354,0.00004448687,0.000007097378,0.000003039072,0.00007317564,0.9903702,0.0008659395,0.00006277054,0.006492477,0.000326074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2990788,0.0003892975,0.6965414,0.0002103772,0.002865318,0.0007367204,0.000001566171,0.000136763,0.00003981057],"genre_scores_gemma":[0.9867505,0.00003416048,0.01069474,0.0005169744,0.001797892,0.0001233015,0.00003279721,0.00003340948,0.00001616443],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6876718,"threshold_uncertainty_score":0.9999537,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1191960083","doi":"10.1007/s11276-015-1028-7","title":"QoE in video streaming over wireless networks: perspectives and research challenges","year":2015,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Quality of experience; Service provider; Multimedia; Wireless network; Wireless; Quality of service; Real Time Streaming Protocol; Mobile device; Computer network; Service (business); Video quality; Software deployment; Metric (unit); Telecommunications; The Internet; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.08883615033826404,"gpt":0.3613824640278664,"spread":0.2725463136896024,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003094952,0.0002847152,0.00042235,0.0002752902,0.0002121853,0.0004517785,0.0009046043,0.0002374739,0.000005279097],"category_scores_gemma":[0.00006038229,0.0002761212,0.00005857426,0.0008336031,0.0002490446,0.001000581,0.0009164977,0.0009179952,0.000007510269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002610416,"about_ca_system_score_gemma":0.0001566519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000403728,"about_ca_topic_score_gemma":0.0006217594,"domain_scores_codex":[0.9960605,0.0008523217,0.0004047797,0.0009415267,0.0007441847,0.0009966772],"domain_scores_gemma":[0.9978551,0.0006275755,0.0001085753,0.0008087576,0.0002830006,0.000317007],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001407607,0.0007853431,0.007628785,0.0001243153,0.0001156888,0.000462343,0.05893415,0.02571526,0.00004281693,0.2803778,0.005541475,0.6201313],"study_design_scores_gemma":[0.001172773,0.0001969932,0.01355405,0.0002828492,0.000005586401,0.00001768791,0.01327035,0.9672438,0.00002654481,0.002613934,0.001160191,0.0004552495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5200874,0.04854702,0.4184581,0.005433293,0.0009694485,0.0008811929,0.00000200085,0.0003877826,0.005233756],"genre_scores_gemma":[0.9935336,0.004347588,0.00115977,0.0001407478,0.0005937181,0.00006230923,0.000002802234,0.00002927177,0.0001302392],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9415285,"threshold_uncertainty_score":0.9999691,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2730287276","doi":"10.1007/s11276-017-1551-9","title":"A hierarchical learning approach to anti-jamming channel selection strategies","year":2017,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Stackelberg competition; Computer science; Jamming; Channel (broadcasting); Selection (genetic algorithm); Convergence (economics); Interference (communication); Adversarial system; Mathematical optimization; Artificial intelligence; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01907749977353366,"gpt":0.2549604267114776,"spread":0.235882926937944,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006117931,0.0004038605,0.0004929902,0.0001827296,0.001953592,0.002558562,0.002621547,0.0003600761,0.000004195648],"category_scores_gemma":[0.00007145566,0.0004207229,0.0001464607,0.0004530206,0.0001681439,0.001264717,0.0009129413,0.001322013,0.00003686253],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008829793,"about_ca_system_score_gemma":0.00008651878,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001422275,"about_ca_topic_score_gemma":0.00004143485,"domain_scores_codex":[0.9967209,0.0002278256,0.0004020889,0.001039248,0.0005111617,0.001098785],"domain_scores_gemma":[0.9978122,0.000150663,0.0003106783,0.001222313,0.0001517741,0.0003524154],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002273928,0.0001244984,0.001170935,0.0000248137,0.00004989218,0.00002547482,0.001840576,0.8778567,0.0001451144,0.05416599,0.0006756224,0.06389762],"study_design_scores_gemma":[0.0003494148,0.0001104469,0.005044136,0.00009111551,0.000009716564,0.00006253488,0.0001751898,0.9918672,0.00009361902,0.0006959984,0.0009824994,0.000518085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1569601,0.00008656756,0.833629,0.0005317021,0.0009703831,0.0003330238,4.448387e-7,0.0006209044,0.00686795],"genre_scores_gemma":[0.9864212,0.00007068047,0.01162112,0.0002201582,0.001368544,0.00006596275,0.000007500422,0.00005181705,0.0001730611],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.829461,"threshold_uncertainty_score":0.9998245,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W856882214","doi":"10.1007/s11276-015-1010-4","title":"Towards a novel trust-based opportunistic routing protocol for wireless networks","year":2015,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Routing protocol; Wireless; Wireless Routing Protocol; Dynamic Source Routing; Wireless network; Routing (electronic design automation); Geographic routing; Distributed computing; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.06011457483464218,"gpt":0.3011187145857745,"spread":0.2410041397511323,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002118259,0.0008382933,0.0009703678,0.000164739,0.0004631171,0.0007489847,0.002862596,0.0006734359,0.0000199618],"category_scores_gemma":[0.0001069032,0.0008136137,0.0003704714,0.001238089,0.0002208506,0.0006465227,0.0007128636,0.0008934871,0.00001401213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003859777,"about_ca_system_score_gemma":0.001032715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007916107,"about_ca_topic_score_gemma":0.00005494158,"domain_scores_codex":[0.9941144,0.0002260032,0.001225289,0.001565522,0.0008835243,0.001985253],"domain_scores_gemma":[0.9950305,0.0005216449,0.000764153,0.001973812,0.0006472456,0.001062691],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003999913,0.0005444901,0.0006317072,0.0001097955,0.0000919165,0.00007544891,0.0001958795,0.6377733,0.00002011546,0.1114626,0.01784396,0.2308508],"study_design_scores_gemma":[0.005399076,0.0004098665,0.0001097862,0.0003350869,0.00003389705,0.00003244834,0.0000316742,0.9778975,0.00003920642,0.0004837531,0.0142618,0.000965931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001616322,0.00002283426,0.9243292,0.0004132079,0.001299246,0.0713954,0.00001043593,0.0008997839,0.00146831],"genre_scores_gemma":[0.6165543,0.00000292041,0.04620918,0.001907617,0.002990048,0.3316202,0.00009493434,0.000219985,0.0004007798],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8781199,"threshold_uncertainty_score":0.9994315,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116000736","doi":"10.1007/s11276-008-0126-1","title":"On routing with guaranteed delivery in three-dimensional ad hoc wireless networks","year":2008,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University; University of British Columbia; University of Waterloo","funders":"","keywords":"Computer science; Wireless ad hoc network; Computer network; Routing (electronic design automation); Combinatorics; Destination-Sequenced Distance Vector routing; Dynamic Source Routing; Node (physics); Wireless; Mathematics; Routing protocol; Telecommunications; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01146744949775763,"gpt":0.2028211736862423,"spread":0.1913537241884846,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006674941,0.0007651724,0.0008832017,0.0002481339,0.0005793462,0.0001733959,0.00180999,0.0005186635,0.0000306426],"category_scores_gemma":[0.00001264247,0.0006841923,0.000195228,0.001830129,0.0003211086,0.0006012313,0.0006087365,0.001634507,0.00004724954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002519207,"about_ca_system_score_gemma":0.0002125228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001298778,"about_ca_topic_score_gemma":0.001209093,"domain_scores_codex":[0.9946179,0.0002795431,0.0008793799,0.001549177,0.000954442,0.001719538],"domain_scores_gemma":[0.9967004,0.000824056,0.0004109697,0.001554102,0.0001766721,0.0003338197],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003838459,0.0002498489,0.007969097,0.000008346606,0.00006132683,0.001141528,0.000216041,0.919975,0.00000984284,0.009814391,0.001527919,0.05864283],"study_design_scores_gemma":[0.0021186,0.0003756234,0.009861439,0.0006057874,0.00001339429,0.0002843269,0.00001269636,0.9854707,0.00001658945,0.0002300821,0.0001616139,0.0008491051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5693025,0.001386404,0.4270329,0.0001272197,0.0007517588,0.0005661225,0.000001522767,0.0004088521,0.0004227473],"genre_scores_gemma":[0.9940543,0.00030371,0.003219475,0.001541009,0.0005161657,0.0001327252,0.00002129764,0.0001059943,0.0001053137],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4247518,"threshold_uncertainty_score":0.999561,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070488564","doi":"10.1007/s11276-006-6547-9","title":"Energy-aware on-demand routing protocols for wireless ad hoc networks","year":2006,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Routing protocol; Overhead (engineering); Distributed computing; Wireless Routing Protocol; Routing (electronic design automation); Wireless ad hoc network; Optimized Link State Routing Protocol; Wireless; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01257399456037238,"gpt":0.2452391926679784,"spread":0.232665198107606,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009043761,0.000836339,0.0009214273,0.000155243,0.0007685382,0.0007674263,0.002408611,0.0007008788,0.00001755694],"category_scores_gemma":[0.000008368181,0.0008157996,0.0004139475,0.001079522,0.00016106,0.0006011999,0.000585114,0.0007605145,0.00001436886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002217573,"about_ca_system_score_gemma":0.0001309156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003862165,"about_ca_topic_score_gemma":0.000197556,"domain_scores_codex":[0.9942392,0.000277412,0.001110077,0.001698836,0.0006759579,0.001998492],"domain_scores_gemma":[0.9959875,0.0008397094,0.0006461311,0.00190188,0.0002834223,0.000341324],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001655719,0.0002884806,0.0004742012,0.00004278108,0.00006242604,0.00005617001,0.00005439158,0.4474075,0.00001853798,0.09506063,0.03029178,0.4260775],"study_design_scores_gemma":[0.001765985,0.0003588117,0.0002594288,0.0005069863,0.00002127233,0.00002174965,0.00001076438,0.9685928,0.0001395414,0.001886519,0.02549381,0.0009423404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001480397,0.000922543,0.9855624,0.0002786855,0.00109641,0.008511748,0.00000792579,0.00089089,0.00124894],"genre_scores_gemma":[0.9682193,0.0001428271,0.004186496,0.001129177,0.003540309,0.02143071,0.0001015813,0.0001741704,0.001075477],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.981376,"threshold_uncertainty_score":0.9994293,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1990243878","doi":"10.1007/s11276-010-0285-8","title":"Application layer QoS optimization for multimedia transmission over cognitive radio networks","year":2010,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia; Carleton University","funders":"Defense Advanced Research Projects Agency","keywords":"Computer science; Cognitive radio; Quality of service; Partially observable Markov decision process; Channel (broadcasting); Markov decision process; Transmission (telecommunications); Computer network; Wireless; Multimedia; Markov process; Markov model; Markov chain; Telecommunications; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.008221511219649393,"gpt":0.2385539700797366,"spread":0.2303324588600872,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004304866,0.0003531184,0.0003651195,0.0001139732,0.0004343322,0.0002653658,0.0004808781,0.0004078724,0.00004374171],"category_scores_gemma":[0.00002648325,0.0003456069,0.0001901683,0.0005960256,0.0001047677,0.00049793,0.00008203255,0.0006499354,0.000004567848],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004338624,"about_ca_system_score_gemma":0.00005351224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002152006,"about_ca_topic_score_gemma":0.00004789049,"domain_scores_codex":[0.9976907,0.00008622421,0.0004237351,0.0008278103,0.0002708252,0.0007007078],"domain_scores_gemma":[0.9981306,0.000664948,0.0002275603,0.0004485601,0.0002644727,0.0002638215],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008024557,0.0000867412,0.0002719045,0.00000876437,0.00003832589,0.000005188063,0.0001616874,0.3524515,0.0004129055,0.002605578,0.001016004,0.6428612],"study_design_scores_gemma":[0.001489814,0.00006574509,0.00152146,0.00008007384,0.00004296214,0.0000188661,0.00001023187,0.9940634,0.0002755489,0.0001515323,0.001827182,0.0004531305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006224879,0.0003054997,0.9898783,0.0002519682,0.00153426,0.001145119,0.000004358195,0.0003370363,0.0003185719],"genre_scores_gemma":[0.9366238,0.0002123191,0.05980359,0.0004045964,0.002537153,0.0001492492,0.0001453718,0.00006031102,0.00006363615],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9303989,"threshold_uncertainty_score":0.9998996,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2009080156","doi":"10.1007/s11276-007-0062-5","title":"Supporting voice and video applications over IEEE 802.11n WLANs","year":2007,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria; University of Waterloo","funders":"","keywords":"Computer science; Computer network; Bottleneck; Network allocation vector; IEEE 802.1X; IEEE 802; Inter-Access Point Protocol; Frame (networking); IEEE 802.11e-2005; IEEE 802.11; Throughput; Protocol (science); IEEE 802.11u; Access control; Wi-Fi; Wireless Multimedia Extensions; Local area network; Transmission (telecommunications); IEEE 802.11s; Wireless; Wireless network; Quality of service; Telecommunications; Embedded system; Wi-Fi array","retraction":null,"screen_n_in":null,"score":{"opus":0.0109424668334721,"gpt":0.2873895053159818,"spread":0.2764470384825097,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001137415,0.0002815469,0.0003147297,0.00009585389,0.0003920286,0.0003110713,0.0008269565,0.000240746,0.00001736954],"category_scores_gemma":[0.000006132257,0.0002731053,0.00008760147,0.00069604,0.0001049899,0.0004446909,0.0002644881,0.0004499791,0.00002829618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004512093,"about_ca_system_score_gemma":0.00004646099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004834111,"about_ca_topic_score_gemma":0.0001138551,"domain_scores_codex":[0.997444,0.00006379905,0.0005565283,0.0006893054,0.000310797,0.0009355707],"domain_scores_gemma":[0.99813,0.0004192024,0.0002774982,0.000772958,0.00008728109,0.0003131186],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004938157,0.0001671639,0.02343636,0.00008903811,0.0000730945,0.00008458014,0.0006188984,0.01117429,0.0004526151,0.059505,0.01297342,0.8913761],"study_design_scores_gemma":[0.001010233,0.0001055866,0.02100777,0.0001494369,0.00002332841,0.00007337932,0.00004479281,0.8702847,0.0004522069,0.002303408,0.1036661,0.0008790173],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01319325,0.0003700259,0.9812155,0.0002272987,0.0003172384,0.002547701,0.000002253548,0.0003268495,0.001799839],"genre_scores_gemma":[0.9894169,0.00007732471,0.006635727,0.00102215,0.001307209,0.001188047,0.000008597032,0.0000372266,0.0003067983],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9762236,"threshold_uncertainty_score":0.9999721,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1544319190","doi":"10.1023/a:1020329719692","title":"A Homogeneous PCS network with Markov Call Arrival Process and Phase Type Cell Residence Time","year":2002,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"University of New South Wales; University of Windsor","keywords":"Handover; Computer science; Call duration; Call blocking; Markov process; Computer network; Residence time (fluid dynamics); Channel (broadcasting); Blocking (statistics); Call management; Markov chain; Phase-type distribution; Distribution (mathematics); Call control; Real-time computing; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01493732817999705,"gpt":0.2537436457440505,"spread":0.2388063175640535,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005605707,0.0004103566,0.0004608684,0.0001122291,0.0005430754,0.0004865824,0.002399505,0.0002418205,0.00009566839],"category_scores_gemma":[0.0000233359,0.0003660776,0.00005572455,0.001748162,0.000323979,0.0005319879,0.0007877534,0.0008351576,0.0001046606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006740959,"about_ca_system_score_gemma":0.00009496577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001691934,"about_ca_topic_score_gemma":0.0000355061,"domain_scores_codex":[0.9964257,0.0003883427,0.0004459827,0.0008941457,0.0007134782,0.001132374],"domain_scores_gemma":[0.9966457,0.000495763,0.0002329105,0.00182642,0.0003493379,0.0004498153],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007716006,0.001459664,0.003682042,0.0002223806,0.0002104187,0.001085689,0.002285426,0.440675,0.0003657686,0.003064781,0.1040042,0.442173],"study_design_scores_gemma":[0.001204205,0.0003990468,0.0001771464,0.0001803975,0.00001553921,0.000145333,0.00001042647,0.9952239,0.00008147306,0.0001397298,0.001922066,0.00050075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4251085,0.02592492,0.5272855,0.003553726,0.0006737317,0.002413626,0.00001010738,0.001672443,0.01335741],"genre_scores_gemma":[0.9843408,0.002009875,0.01050447,0.0003259041,0.0004410114,0.00007916798,0.00001308651,0.0000672982,0.002218385],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5592323,"threshold_uncertainty_score":0.9998791,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2080294240","doi":"10.1007/s11276-008-0142-1","title":"Analysis of the Bluetooth device discovery protocol","year":2008,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Bluetooth and Wireless Communication Technologies","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Bluetooth; Exponential backoff; Limit (mathematics); Neighbor Discovery Protocol; Network packet; Protocol (science); Computer network; Train; Throughput; Wireless; Telecommunications; Internet Protocol; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.02168873109121416,"gpt":0.2528424534039493,"spread":0.2311537223127351,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001874786,0.0001560969,0.0003319144,0.0001783679,0.0002907365,0.00006889116,0.00331067,0.0001371207,0.000005194637],"category_scores_gemma":[0.00002703303,0.0001048385,0.0002492624,0.003402751,0.0003061613,0.0004658897,0.0009826353,0.0002954095,0.000002930415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000282311,"about_ca_system_score_gemma":0.00008513679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006113136,"about_ca_topic_score_gemma":0.00008653244,"domain_scores_codex":[0.9986071,0.0001303516,0.0003809204,0.000299396,0.0003007641,0.0002814637],"domain_scores_gemma":[0.9971083,0.0001621315,0.000317949,0.002270083,0.0001006468,0.00004085236],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000645075,0.0007521444,0.3552893,0.00008313775,0.001611671,0.00001733669,0.001580758,0.1783665,0.0003991792,0.2604995,0.005360791,0.1959752],"study_design_scores_gemma":[0.0004428874,0.00004124088,0.1499166,0.0000522429,0.00009747277,0.000007778323,0.0000467906,0.8406911,0.002802068,0.0003544525,0.005229727,0.0003176618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.151892,0.0001984345,0.8265224,0.001353111,0.0002345475,0.01644629,0.000005305738,0.000683893,0.002664016],"genre_scores_gemma":[0.9909256,0.00004504954,0.001528022,0.0002457724,0.00002259302,0.007024507,0.00000204642,0.000008611632,0.0001978399],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8390336,"threshold_uncertainty_score":0.6152104,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2024953999","doi":"10.1007/s11276-006-7530-1","title":"Admission control with load balancing in IEEE 802.11-based ESS mesh networks","year":2006,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Blocking (statistics); Computer network; Admission control; Wireless mesh network; IEEE 802.11s; Connection (principal bundle); Mesh networking; Scheme (mathematics); IEEE 802; Load balancing (electrical power); Path (computing); IEEE 802.11; Switched mesh; Distributed computing; Wireless lan; Wireless network; Telecommunications; Wireless; Grid; Quality of service","retraction":null,"screen_n_in":null,"score":{"opus":0.005709340021392484,"gpt":0.2139631560438297,"spread":0.2082538160224373,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001026601,0.0006337798,0.00082513,0.0001680454,0.0003024289,0.0004710975,0.001406378,0.0004864691,0.00002680434],"category_scores_gemma":[0.000008673122,0.0005308424,0.0001669062,0.001437455,0.0001233514,0.0005645023,0.0001267866,0.0008448124,0.000009969426],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002816828,"about_ca_system_score_gemma":0.0003751812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006322079,"about_ca_topic_score_gemma":0.001875977,"domain_scores_codex":[0.9954178,0.0003742327,0.0008187245,0.001119157,0.0007811057,0.001489013],"domain_scores_gemma":[0.9974247,0.0004749834,0.000405855,0.001154258,0.0002116193,0.000328573],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002155052,0.0001795462,0.0331244,0.00002612122,0.00001610848,0.0002131694,0.00002978445,0.9389827,0.00003519615,0.003301583,0.004020787,0.01985505],"study_design_scores_gemma":[0.004439159,0.0001801696,0.009097023,0.0008069798,0.00001567009,0.0000195753,0.000005680852,0.9827102,0.0001373669,0.000162277,0.001683439,0.0007424346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02161245,0.0004295435,0.9721467,0.0004146436,0.0006464404,0.003539379,0.000002402297,0.0004442435,0.0007642277],"genre_scores_gemma":[0.9930559,0.00001918043,0.00281578,0.000986218,0.001212874,0.001684373,0.00001733538,0.00007589672,0.000132437],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9714435,"threshold_uncertainty_score":0.9997143,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3088296267","doi":"10.1007/s11276-020-02459-0","title":"TCP CERL+: revisiting TCP congestion control in wireless networks with random loss","year":2020,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University","funders":"","keywords":"TCP global synchronization; TCP Friendly Rate Control; Computer science; TCP Westwood plus; TCP acceleration; CUBIC TCP; H-TCP; Zeta-TCP; TCP tuning; Computer network; Compound TCP; TCP Westwood; HSTCP; Network congestion; Network packet","retraction":null,"screen_n_in":null,"score":{"opus":0.00746378198499164,"gpt":0.1944920434541066,"spread":0.187028261469115,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008547278,0.0006229252,0.001096905,0.0001154528,0.0002983762,0.0004515392,0.0012988,0.0003883363,0.00003480438],"category_scores_gemma":[0.00005945565,0.0005623992,0.0001919126,0.001434501,0.0001971749,0.0006728335,0.0001884,0.001203816,0.00003445962],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001029787,"about_ca_system_score_gemma":0.0001256909,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003285065,"about_ca_topic_score_gemma":0.0000675051,"domain_scores_codex":[0.9954033,0.0006172544,0.0009354044,0.001245655,0.0005849352,0.001213478],"domain_scores_gemma":[0.9970787,0.0008475255,0.0004792998,0.0007187377,0.0003247917,0.0005510007],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007961128,0.00004916287,0.00886365,0.00002705466,0.00008290563,0.0002714331,0.000158899,0.6499718,0.000008982272,0.009261572,0.001113917,0.3293945],"study_design_scores_gemma":[0.01049715,0.0001857473,0.002007398,0.0004037655,0.00005254681,0.00003265687,0.00004046495,0.9843093,0.000003820222,0.00003038835,0.001746184,0.0006905539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02816908,0.001528673,0.9616,0.005763636,0.0007680557,0.000964827,0.000003176757,0.0007001114,0.000502428],"genre_scores_gemma":[0.9909798,0.0003700198,0.0007774468,0.00485854,0.002699826,0.0001644408,0.00002198488,0.00006980755,0.00005811439],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9628108,"threshold_uncertainty_score":0.9996827,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2005590005","doi":"10.1007/s11276-011-0335-x","title":"A constrained MDP-based vertical handoff decision algorithm for 4G heterogeneous wireless networks","year":2011,"lang":"en","type":"article","venue":"Wireless Networks","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Handover; Markov decision process; Roaming; Wireless; Wireless network; Computer network; Optimal decision; Constraint (computer-aided design); Bandwidth (computing); Mathematical optimization; Algorithm; Markov process; Telecommunications; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01372115977683878,"gpt":0.2147521597284606,"spread":0.2010309999516219,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007321506,0.0009393417,0.001153331,0.0001668029,0.0003469466,0.0001679277,0.0007411779,0.001060832,0.0001929444],"category_scores_gemma":[0.00004356916,0.0009767183,0.0005710175,0.0005675977,0.0004355875,0.0002384975,0.0001626091,0.0009720986,0.00002621284],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002858544,"about_ca_system_score_gemma":0.0001017901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004587613,"about_ca_topic_score_gemma":0.0003346864,"domain_scores_codex":[0.9951832,0.0001658282,0.001160256,0.001039097,0.0005142023,0.001937384],"domain_scores_gemma":[0.9967197,0.001130932,0.0001251509,0.001136116,0.0002503617,0.0006376934],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000821626,0.0004107172,0.0005255694,0.0001342362,0.0003119882,0.0001465429,0.0002096808,0.5876963,0.00006289695,0.0004107481,0.002230748,0.407039],"study_design_scores_gemma":[0.004427785,0.0002767268,0.0002776867,0.0002943333,0.0001858757,0.00005035577,0.00002434855,0.9911459,0.001066079,0.0004163549,0.0007756384,0.001058925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.113589,0.002151205,0.877523,0.00001176598,0.003762651,0.001476121,0.00005329708,0.001085998,0.0003469631],"genre_scores_gemma":[0.9865822,0.0002834362,0.01027544,0.0002848331,0.001585115,0.0005029414,0.000171284,0.000292984,0.00002173678],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8729932,"threshold_uncertainty_score":0.9992684,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2050014989","doi":"10.1007/s11276-008-0123-4","title":"TCP CERL: congestion control enhancement over wireless networks","year":2008,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"TCP global synchronization; Zeta-TCP; TCP Friendly Rate Control; TCP Westwood; TCP Westwood plus; TCP Vegas; TCP acceleration; Compound TCP; Computer science; H-TCP; CUBIC TCP; Computer network; TCP tuning; Network congestion; Network packet","retraction":null,"screen_n_in":null,"score":{"opus":0.00892784627774226,"gpt":0.2061153436293754,"spread":0.1971874973516332,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005472804,0.0006128252,0.0007671103,0.0001329844,0.0006941564,0.0002288196,0.001387962,0.0004517942,0.0001405872],"category_scores_gemma":[0.00001351511,0.0006006884,0.0002777565,0.0007776974,0.000275169,0.000663931,0.0002224362,0.0008056312,0.0001011851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001642608,"about_ca_system_score_gemma":0.0001346686,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004126179,"about_ca_topic_score_gemma":0.00003977395,"domain_scores_codex":[0.9956823,0.000348089,0.0008255695,0.001128296,0.0007204719,0.001295269],"domain_scores_gemma":[0.9972546,0.0004503636,0.000415068,0.001175369,0.0002400084,0.0004646685],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001994969,0.000311534,0.003949727,0.0000136915,0.0002139785,0.0002320048,0.0002140924,0.3799792,0.00006753417,0.03709616,0.0228867,0.5548359],"study_design_scores_gemma":[0.00311487,0.000168904,0.004718736,0.00009520076,0.00004227205,0.00008229799,0.000008725766,0.9835517,0.00002418718,0.00008873884,0.00740737,0.0006969431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05520249,0.001839213,0.9365599,0.0008628906,0.002902351,0.0006834476,0.000002766333,0.0007491966,0.00119777],"genre_scores_gemma":[0.9923134,0.001243124,0.0006918082,0.002536389,0.001761942,0.0002316762,0.00002574474,0.00005908564,0.001136804],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.937111,"threshold_uncertainty_score":0.9996445,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2795249660","doi":"10.1007/s11276-018-1720-5","title":"Spectrum and energy efficiency of cooperative spectrum prediction in cognitive radio networks","year":2018,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Cognitive radio; Computer science; Efficient energy use; Spectral efficiency; Hidden Markov model; Multilayer perceptron; Energy (signal processing); Artificial neural network; Perceptron; Channel (broadcasting); Artificial intelligence; Algorithm; Telecommunications; Wireless; Statistics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.008679502226986534,"gpt":0.2191921873015131,"spread":0.2105126850745266,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004720931,0.0003672282,0.0005625552,0.0002728633,0.0002679445,0.0001516993,0.0003853532,0.0002313196,0.00003565917],"category_scores_gemma":[0.00002657057,0.0003615861,0.00008675568,0.001532319,0.0005630617,0.0004184617,0.0002694353,0.0004305136,0.000002520889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009727337,"about_ca_system_score_gemma":0.00008053288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001821173,"about_ca_topic_score_gemma":0.001304375,"domain_scores_codex":[0.9971783,0.000253779,0.0005919519,0.0008613117,0.0002957235,0.0008190003],"domain_scores_gemma":[0.9986591,0.000401765,0.0002427981,0.0003732766,0.0001446851,0.000178371],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001242858,0.00142744,0.05564059,0.00005947192,0.0005721197,0.0006045588,0.006690893,0.1317644,0.000506742,0.2960762,0.003178391,0.5022364],"study_design_scores_gemma":[0.001172976,0.0006177779,0.01457488,0.0003197638,0.0000208956,0.00008291853,0.0000793697,0.9811136,0.0008057597,0.0007487882,0.0001068459,0.0003563953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1492706,0.001343228,0.8441837,0.0002178631,0.000813176,0.000190663,0.000004491619,0.0001190964,0.003857221],"genre_scores_gemma":[0.9974307,0.000713143,0.0002989695,0.0002013069,0.001153533,0.00001199642,0.00001256533,0.00003014775,0.0001475777],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8493493,"threshold_uncertainty_score":0.9998836,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1972421518","doi":"10.1007/s11276-014-0774-2","title":"Bandwidth-aware routing and admission control for efficient video streaming over MANETs","year":2014,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Computer network; Bandwidth (computing); Quality of service; Admission control; Backup; Multipath routing; Handover; Video quality; Real-time computing; Distributed computing; Routing (electronic design automation); Routing protocol; Dynamic Source Routing","retraction":null,"screen_n_in":null,"score":{"opus":0.00611654782247942,"gpt":0.2207886688417067,"spread":0.2146721210192273,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007412366,0.0002981618,0.0003929372,0.0000603917,0.0003644969,0.0002807587,0.0005842885,0.0002143098,0.00001019224],"category_scores_gemma":[0.00004728533,0.0002710198,0.00009843744,0.0002178975,0.00005297911,0.0001847472,0.0002723918,0.0002700267,0.000003365953],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000526751,"about_ca_system_score_gemma":0.0000300717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001971286,"about_ca_topic_score_gemma":0.00001794907,"domain_scores_codex":[0.9976948,0.0001407633,0.0003931452,0.0007588427,0.0002746893,0.0007377331],"domain_scores_gemma":[0.9978703,0.0008901474,0.0002185013,0.0006520072,0.00008160603,0.0002874804],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006601487,0.00007000808,0.00322671,0.00004974162,0.00003919769,0.0000095955,0.0002206006,0.4108481,0.0001119175,0.02426861,0.002083517,0.559006],"study_design_scores_gemma":[0.001710096,0.000112868,0.003335731,0.0002032184,0.00001972512,0.00001138809,0.000009587842,0.9916156,0.00004615994,0.0002266989,0.002385881,0.0003230612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05629212,0.0003499275,0.9414923,0.000184414,0.0006655693,0.0005827958,0.000002356573,0.0002286798,0.0002018378],"genre_scores_gemma":[0.9958189,0.00002306144,0.002661282,0.0005723429,0.0007069766,0.00008970674,0.000009081989,0.00003700576,0.00008163452],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9395268,"threshold_uncertainty_score":0.9999742,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030959711","doi":"10.1007/s11276-015-0914-3","title":"A prediction-based clustering algorithm for tracking targets in quantized areas for wireless sensor networks","year":2015,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Wireless sensor network; Cluster analysis; Context (archaeology); Event (particle physics); Overhead (engineering); Tracking (education); Kalman filter; Node (physics); Set (abstract data type); Data mining; Real-time computing; Task (project management); Algorithm; Field (mathematics); Distributed computing; Machine learning; Artificial intelligence; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.03490619296519645,"gpt":0.254930594871996,"spread":0.2200244019067996,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001867307,0.0007939252,0.001092612,0.0004301057,0.0004175989,0.0005110079,0.0015575,0.0007274215,0.000002676719],"category_scores_gemma":[0.0001021756,0.000844584,0.0004275313,0.001354471,0.0001554974,0.0006186076,0.0002769276,0.0006925141,0.00000294896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004330262,"about_ca_system_score_gemma":0.0002620541,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008892531,"about_ca_topic_score_gemma":0.0003157195,"domain_scores_codex":[0.9940805,0.0003172692,0.001297759,0.001626389,0.0006643056,0.002013797],"domain_scores_gemma":[0.9954507,0.001549042,0.0005578711,0.001191265,0.000659189,0.0005918933],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002058086,0.0002208137,0.0006940855,0.00003798093,0.00005031124,0.00003123729,0.0002027195,0.8699313,0.00002241378,0.001004931,0.001079648,0.1265187],"study_design_scores_gemma":[0.006475036,0.0002919792,0.0002546171,0.0004019191,0.00003789202,0.00002221991,0.00009914173,0.9898499,0.0001775848,0.00009975808,0.001415201,0.000874807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007411219,0.0008736375,0.9842654,0.0003321717,0.00408084,0.002051593,0.00003475839,0.0008661691,0.00008422109],"genre_scores_gemma":[0.810034,0.00005864955,0.1861317,0.0005279226,0.001729032,0.0009902617,0.0002294668,0.0001832599,0.0001156461],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8026228,"threshold_uncertainty_score":0.9994005,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4292416280","doi":"10.1007/s11276-022-03093-8","title":"A wide axial-ratio beamwidth circularly-polarized oval patch antenna with sunlight-shaped slots for gnss and wimax applications","year":2022,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Antenna Design and Analysis","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Beamwidth; GNSS applications; Computer science; WiMAX; Antenna (radio); Sunlight; Optics; Patch antenna; Physics; Telecommunications; Global Positioning System; Wireless","retraction":null,"screen_n_in":null,"score":{"opus":0.007315468559528059,"gpt":0.1915837022772999,"spread":0.1842682337177718,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002163525,0.0002717089,0.0004085439,0.0001115439,0.0005048957,0.0001049305,0.0002292631,0.00009249905,0.00004345008],"category_scores_gemma":[0.0000048814,0.0002623875,0.0001212528,0.0005561479,0.00006875479,0.0001352484,0.00006560473,0.0003346395,0.000002451188],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007404126,"about_ca_system_score_gemma":0.00003456079,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005816622,"about_ca_topic_score_gemma":0.00007537803,"domain_scores_codex":[0.9985653,0.00005106304,0.0003059137,0.0003906937,0.0002328881,0.0004541303],"domain_scores_gemma":[0.9992437,0.0001330203,0.00007992158,0.0003371864,0.00006589436,0.0001402164],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001862637,0.001115672,0.07050189,0.0010744,0.005855422,0.0002741218,0.004462517,0.1051798,0.7562109,0.01897149,0.002914558,0.03157661],"study_design_scores_gemma":[0.00110189,0.00007583768,0.00051195,0.00002180876,0.0001744821,0.00002221519,0.0002613874,0.9953235,0.00002138188,0.000145467,0.001956661,0.0003834369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02038631,0.001254485,0.9770188,0.000141149,0.00008443231,0.0007142075,0.00004760675,0.000308565,0.00004441555],"genre_scores_gemma":[0.9964339,0.0001689682,0.001391129,0.0001976881,0.0002219957,0.001084433,0.0002059158,0.00009160684,0.0002043382],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9760476,"threshold_uncertainty_score":0.9999828,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1979724779","doi":"10.1007/s11276-013-0545-5","title":"A token circulation scheme for code assignment and cooperative transmission scheduling in CDMA-based UAV ad hoc networks","year":2013,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Security token; Code division multiple access; Network packet; Scheduling (production processes); Schedule; Token passing; Real-time computing; Wireless; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01393945821473998,"gpt":0.2369988082996166,"spread":0.2230593500848766,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006228882,0.0003978549,0.0004803718,0.0001230453,0.0002789088,0.0004051055,0.0005917412,0.0003840469,0.00002898129],"category_scores_gemma":[0.00001575854,0.0003834569,0.0001024124,0.000628839,0.00009187126,0.0007319914,0.0001398313,0.0004233441,0.00000525289],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000172516,"about_ca_system_score_gemma":0.0001041467,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000241315,"about_ca_topic_score_gemma":0.00005986737,"domain_scores_codex":[0.997099,0.0002125662,0.0006215394,0.0009188055,0.0003165456,0.0008315428],"domain_scores_gemma":[0.9982859,0.0004756042,0.000209665,0.000568566,0.0001745155,0.0002856998],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003970867,0.00007510892,0.0009704355,0.00002026004,0.00001873009,0.000004728313,0.0001685159,0.78321,0.0002411895,0.001360245,0.0002682644,0.2136227],"study_design_scores_gemma":[0.001928015,0.0001412552,0.002902989,0.000338405,0.00001118013,0.00000384292,0.00003206731,0.9929545,0.0001098449,0.0003630132,0.0007599581,0.0004549289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05674592,0.003164854,0.9369627,0.000709119,0.0003090548,0.00187375,0.000001605253,0.0001742225,0.00005882565],"genre_scores_gemma":[0.943603,0.0003216737,0.05415995,0.0006738081,0.0002660581,0.0008611578,0.00003859787,0.00004705063,0.00002869461],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8868571,"threshold_uncertainty_score":0.9998617,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4382240482","doi":"10.1007/s11276-023-03414-5","title":"NMal-Droid: network-based android malware detection system using transfer learning and CNN-BiGRU ensemble","year":2023,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Brandon University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Malware; Android (operating system); Convolutional neural network; Network packet; Artificial intelligence; Machine learning; Computer security; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01165765042397046,"gpt":0.2343927391909054,"spread":0.222735088766935,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005919033,0.0003332547,0.0003834644,0.0002446497,0.0007014208,0.0002319982,0.00036499,0.0002928461,0.000003814205],"category_scores_gemma":[0.0000156837,0.0003604741,0.0001078696,0.001619792,0.00006985469,0.0004793883,0.0001617448,0.0005927909,0.00001331345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001708537,"about_ca_system_score_gemma":0.00004249095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003761448,"about_ca_topic_score_gemma":0.00004488398,"domain_scores_codex":[0.997488,0.0002377195,0.0004122798,0.0007609678,0.0003248838,0.0007761075],"domain_scores_gemma":[0.9989406,0.0002117425,0.0001184116,0.000429686,0.0001238087,0.0001757478],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004415001,0.0000117584,0.0006650222,0.0001045761,0.00002170497,0.00008476015,0.00009581279,0.8378266,0.004567933,0.0007087933,0.00007135715,0.1557976],"study_design_scores_gemma":[0.0004201886,0.0001354218,0.0002257852,0.0002380592,0.0000165807,0.00008186641,0.00006765864,0.9862456,0.01104955,0.0001217172,0.0009967736,0.0004008392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1207802,0.0002702312,0.8742308,0.00003438839,0.0005731986,0.0003370548,0.000001067843,0.003669037,0.000103966],"genre_scores_gemma":[0.9895245,0.0001003699,0.009710359,0.00006935929,0.0003512316,0.00008111543,0.000008068218,0.00006387586,0.00009115219],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8687443,"threshold_uncertainty_score":0.9998847,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2025510467","doi":"10.1007/s11276-010-0292-9","title":"Optimal channel access for TCP performance improvement in cognitive radio networks","year":2010,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia; Carleton University","funders":"","keywords":"Computer science; Computer network; Cognitive radio; Throughput; TCP tuning; Transport layer; Channel (broadcasting); TCP acceleration; TCP global synchronization; TCP Friendly Rate Control; Transmission Control Protocol; Zeta-TCP; Frame (networking); CUBIC TCP; Layer (electronics); Network packet; Telecommunications; Wireless","retraction":null,"screen_n_in":null,"score":{"opus":0.01590826134524986,"gpt":0.2579545616929469,"spread":0.2420463003476971,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007210117,0.0004355296,0.0005131457,0.0002012903,0.0003662769,0.0005609028,0.001126679,0.0003125195,0.00001770944],"category_scores_gemma":[0.00002768283,0.0004360314,0.0001705434,0.0008380624,0.0001400965,0.0009647055,0.0004660174,0.001046915,0.000003216703],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007837182,"about_ca_system_score_gemma":0.00008819586,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004164321,"about_ca_topic_score_gemma":0.00033541,"domain_scores_codex":[0.9968886,0.00005635819,0.0005505428,0.0009563054,0.0002814456,0.001266761],"domain_scores_gemma":[0.9983147,0.0004744813,0.0002419889,0.0005092043,0.0002181826,0.0002414158],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002414026,0.0002242635,0.00264413,0.00003125754,0.00008066682,0.00005324695,0.000371583,0.3549031,0.0001183883,0.00284159,0.001013787,0.6374766],"study_design_scores_gemma":[0.001779077,0.0002317735,0.007510209,0.000173858,0.00001815944,0.00003101035,0.00003012596,0.9888817,0.0003627221,0.0001191504,0.000292558,0.0005696288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3599148,0.0001805907,0.6365752,0.0001964452,0.001778483,0.0007567471,0.000002851541,0.0001355916,0.0004593437],"genre_scores_gemma":[0.9948758,0.0002581819,0.002156826,0.0005946176,0.001727892,0.0001990197,0.000030804,0.00005154392,0.0001052407],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6369069,"threshold_uncertainty_score":0.9998091,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029320761","doi":"10.1007/s11276-011-0333-z","title":"Use of flip ambiguity probabilities in robust sensor network localization","year":2011,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Ambiguity; Computer science; Wireless sensor network; Set (abstract data type); Algorithm; Expression (computer science); Graph; Data mining; Theoretical computer science; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.04435432677390935,"gpt":0.1927970434991228,"spread":0.1484427167252134,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014362,0.0001760769,0.0002732721,0.00009666199,0.00004168872,0.00001891132,0.0001559233,0.0002695045,0.00004563952],"category_scores_gemma":[0.00003133298,0.0001785975,0.00005073896,0.0005576059,0.0001305379,0.0001861741,0.00004754588,0.0002027556,0.0000035531],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000592436,"about_ca_system_score_gemma":0.00001039725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001800687,"about_ca_topic_score_gemma":0.0004277739,"domain_scores_codex":[0.9988921,0.00004446382,0.0004132946,0.0001727652,0.0001144286,0.0003629456],"domain_scores_gemma":[0.9994751,0.00005503801,0.00006008445,0.000303478,0.00007203205,0.00003429222],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001708754,0.00002361998,0.04128057,0.00005528448,0.00001419852,0.000003691663,0.0003152966,0.9483645,0.000008173473,0.004242494,0.0007962942,0.004878806],"study_design_scores_gemma":[0.0001800784,0.00002521517,0.009904817,0.0001215441,0.000009667767,0.000001752789,0.00012357,0.9871423,0.001289568,0.0005785839,0.0004004293,0.0002225284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3082736,0.0003477423,0.6882752,0.000007725658,0.0005803833,0.0003818493,0.000005758841,0.0009010709,0.001226721],"genre_scores_gemma":[0.9971618,0.0002730275,0.002323859,0.00002744413,0.00008272736,0.00002804429,0.00001813371,0.00003960258,0.00004534532],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6888883,"threshold_uncertainty_score":0.7282995,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3198512847","doi":"10.1007/s11276-021-02772-2","title":"A novel multi-band and multi-generation (2G, 3G,4G, and 5G) 9-elements MIMO antenna system for 5G smartphone applications","year":2021,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Antenna Design and Analysis","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec","funders":"","keywords":"UMTS frequency bands; Computer science; MIMO; GSM; Antenna (radio); Omnidirectional antenna; Electronic engineering; Antenna efficiency; Antenna array; Telecommunications; Channel (broadcasting); Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02349398237941203,"gpt":0.2291932445095786,"spread":0.2056992621301666,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001355775,0.0002070031,0.0003007183,0.00006162408,0.0002025074,0.0001118418,0.00006899692,0.0001354816,0.000004070216],"category_scores_gemma":[0.000006359425,0.0002118663,0.00006729079,0.0002367423,0.00003801018,0.00009520244,0.00001461484,0.0001160125,0.000002482698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004016683,"about_ca_system_score_gemma":0.00001291694,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003145672,"about_ca_topic_score_gemma":0.0002372639,"domain_scores_codex":[0.9989352,0.00002128474,0.0003261333,0.0003378679,0.00008912545,0.0002904469],"domain_scores_gemma":[0.9994491,0.00004741683,0.00006081569,0.0002127869,0.0001095825,0.0001203353],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002487863,0.0002344361,0.005554685,0.0007571619,0.0006393303,0.00001389488,0.0003650593,0.01636469,0.940451,0.000379653,0.0005097159,0.03470548],"study_design_scores_gemma":[0.001386333,0.00001003759,0.001091422,0.00009460958,0.0001041146,0.00001577576,0.0001914569,0.9947376,0.001670115,0.000001212649,0.0004617743,0.000235607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02370497,0.003907863,0.971622,0.00003540783,0.0001408923,0.0003820625,0.00004380292,0.0001428021,0.00002012136],"genre_scores_gemma":[0.9862497,0.0007420675,0.01185619,0.00005663645,0.0003034578,0.0002876742,0.0001917423,0.00004722007,0.0002653018],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9783729,"threshold_uncertainty_score":0.8639656,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062674546","doi":"10.1007/s11276-010-0287-6","title":"Novel algorithms for the network lifetime problem in wireless settings","year":2010,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Wireless network; Wireless ad hoc network; Algorithm; Wireless; Transmission (telecommunications); Wireless sensor network; Energy (signal processing); Computer network; Telecommunications; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01003714670304063,"gpt":0.2334820884078254,"spread":0.2234449417047848,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002107103,0.000500754,0.0005515671,0.00006424401,0.0005310955,0.00049194,0.003169873,0.0004994943,0.00001927925],"category_scores_gemma":[0.00003010848,0.0003964138,0.0002230085,0.001355798,0.0002190341,0.0005014709,0.0007618985,0.00162388,0.00001918726],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000616033,"about_ca_system_score_gemma":0.0001458258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001072281,"about_ca_topic_score_gemma":0.0005839778,"domain_scores_codex":[0.99594,0.00009319108,0.0007871471,0.00109314,0.0004645474,0.001621976],"domain_scores_gemma":[0.9959131,0.001641362,0.0003721639,0.001647408,0.0001824591,0.0002435374],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005534381,0.0002475614,0.0017247,0.0000416749,0.00009076574,0.00002048933,0.000452936,0.2993169,0.0004739287,0.1364866,0.02923094,0.5318582],"study_design_scores_gemma":[0.001049454,0.00006353002,0.001526194,0.0001136586,0.0000173504,0.00004334784,0.00001407071,0.9729266,0.00004396199,0.001401848,0.02228779,0.0005122679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003927324,0.0003860684,0.9870613,0.002644673,0.003148619,0.001879536,0.000005092007,0.0003850466,0.0005623377],"genre_scores_gemma":[0.8318048,0.0001425407,0.1576723,0.002632082,0.005505593,0.001592278,0.00002726346,0.0001352604,0.0004878991],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.829389,"threshold_uncertainty_score":0.9998488,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1990241714","doi":"10.1007/s11276-010-0255-1","title":"RADAR: A reputation-driven anomaly detection system for wireless mesh networks","year":2010,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Intrusion detection system; Wireless mesh network; Anomaly detection; Backup; Computer network; Constant false alarm rate; Radar; Wireless network; Wireless; Node (physics); Real-time computing; Telecommunications; Data mining; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.007287493965365962,"gpt":0.2176164156765996,"spread":0.2103289217112337,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009730169,0.0005809766,0.0007034735,0.0001815368,0.0007356737,0.0006476392,0.001828398,0.0007576692,0.00001140355],"category_scores_gemma":[0.00002826728,0.000598303,0.0003524241,0.001130112,0.0001521529,0.0008977976,0.0003856324,0.001142284,0.0000208109],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001880444,"about_ca_system_score_gemma":0.0001256308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000813547,"about_ca_topic_score_gemma":0.0007198809,"domain_scores_codex":[0.9957002,0.0002099618,0.0009325432,0.001390737,0.0005067054,0.001259838],"domain_scores_gemma":[0.9961391,0.000657202,0.0006198497,0.001770015,0.0004086835,0.0004051279],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002052055,0.0001963579,0.001262199,0.000167171,0.0002453206,0.00008868956,0.0003793238,0.2164948,0.003125702,0.1521423,0.003522105,0.6221708],"study_design_scores_gemma":[0.001102145,0.0001531285,0.0006292973,0.0001188269,0.00004796419,0.0001331944,0.00004258577,0.9944255,0.0007143606,0.0001912554,0.001775623,0.0006660626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0498496,0.0001273439,0.9396968,0.0001361619,0.007008301,0.001458778,0.000004901143,0.00122497,0.0004931262],"genre_scores_gemma":[0.9784107,0.00004368954,0.01734829,0.0002097617,0.002864445,0.0008009159,0.00004348113,0.0001115262,0.0001671916],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9285611,"threshold_uncertainty_score":0.9996468,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1989582478","doi":"10.1007/s11276-013-0592-y","title":"Reinforcement learning based routing in wireless mesh networks","year":2013,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"Indian Institute of Management Ahmedabad","keywords":"Computer science; Reinforcement learning; Wireless mesh network; Computer network; Routing (electronic design automation); Wireless; Distributed computing; Wireless network; Artificial intelligence; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.009361942659421276,"gpt":0.2149593549571089,"spread":0.2055974122976876,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001103418,0.0005896149,0.000686279,0.0002205436,0.0003697604,0.0006645509,0.001910595,0.0004673036,0.0001887265],"category_scores_gemma":[0.00003041234,0.0006044991,0.0001983855,0.001596416,0.0001127653,0.001047438,0.00075549,0.001640924,0.0001096655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002876705,"about_ca_system_score_gemma":0.0001124217,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000452089,"about_ca_topic_score_gemma":0.0001214717,"domain_scores_codex":[0.9949446,0.0004322432,0.001060987,0.001132653,0.0006267327,0.001802825],"domain_scores_gemma":[0.9971667,0.0005563803,0.0004555831,0.001269939,0.0001758914,0.0003755304],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001060767,0.00005155468,0.00680558,0.00001162692,0.000019859,0.00003766902,0.0001273868,0.8813391,0.00001772657,0.01954051,0.001356729,0.0906816],"study_design_scores_gemma":[0.001037194,0.00009925434,0.003333932,0.0002930702,0.000008187534,0.000008170834,0.00004156544,0.9940622,0.00003939568,0.0001079897,0.0002900836,0.0006789501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02657937,0.0001342069,0.9679171,0.000342441,0.000978045,0.0009557246,1.139856e-7,0.0006199791,0.002472965],"genre_scores_gemma":[0.9951664,0.0001211667,0.001977861,0.001094221,0.0006359075,0.0004574358,0.00002825773,0.00007933886,0.0004393805],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.968587,"threshold_uncertainty_score":0.9996406,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1971493099","doi":"10.1007/s11276-013-0626-5","title":"Efficient and practical resource block allocation for LTE-based D2D network via graph coloring","year":2013,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Graph coloring; Reuse; Graph; Distributed computing; Scheduling (production processes); Computer network; Throughput; Mathematical optimization; Theoretical computer science; Wireless; Mathematics; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.0072538837413604,"gpt":0.2132806340937186,"spread":0.2060267503523582,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002640944,0.0003432358,0.0003436682,0.00008694574,0.0002642948,0.0001122961,0.0001146488,0.000282484,0.00001410147],"category_scores_gemma":[0.00002203143,0.0003737324,0.00007811453,0.0005018878,0.00009492912,0.0001381936,0.0000468971,0.0003516267,0.000008699893],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001073479,"about_ca_system_score_gemma":0.00001882264,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007359445,"about_ca_topic_score_gemma":0.00001251451,"domain_scores_codex":[0.9980927,0.00006283449,0.0004462001,0.0004262886,0.0002082164,0.0007638117],"domain_scores_gemma":[0.9985971,0.0005901142,0.0001244688,0.0003414932,0.0001337793,0.0002129878],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004404027,0.0000329009,0.0002097036,0.00005519244,0.00003727018,0.000002006979,0.00003282748,0.9829343,0.0001259711,0.0004425233,0.003783592,0.01229969],"study_design_scores_gemma":[0.0007601588,0.00005922321,0.000348139,0.0001127043,0.00004303157,0.000009347477,0.00002276252,0.9963127,0.0001154486,0.000159312,0.00164975,0.0004074487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07268147,0.0006442243,0.9240199,0.0002145023,0.0004574658,0.001184834,0.000001915614,0.0005781659,0.0002175338],"genre_scores_gemma":[0.9674861,0.00009238807,0.03054489,0.0001890243,0.000824789,0.0006258333,0.00007334806,0.000135151,0.00002839926],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8948047,"threshold_uncertainty_score":0.9998714,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2728571229","doi":"10.1007/s11276-017-1554-6","title":"Load balancing routing with queue overflow prediction for WSNs","year":2017,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Abitibi-Témiscamingue","funders":"European Regional Development Fund; Université Clermont-Auvergne; Université de Lyon; Université Claude Bernard Lyon 1; Agence Nationale de la Recherche","keywords":"Computer science; Computer network; Queuing delay; Routing protocol; Queue; Dynamic Source Routing; Static routing; Distributed computing; Network packet","retraction":null,"screen_n_in":null,"score":{"opus":0.01035186622314835,"gpt":0.2237675820650589,"spread":0.2134157158419105,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006471677,0.0003620409,0.0003964246,0.00006117097,0.001552048,0.0009613537,0.001772006,0.0002616002,0.000003456514],"category_scores_gemma":[0.00006682851,0.0003237939,0.0001311713,0.00019536,0.0001460428,0.0008801758,0.0003887624,0.000401193,0.000005985124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002171021,"about_ca_system_score_gemma":0.0001390835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001344326,"about_ca_topic_score_gemma":0.0003189342,"domain_scores_codex":[0.9971706,0.000064218,0.0003934848,0.0008925692,0.000527802,0.0009512757],"domain_scores_gemma":[0.9968807,0.0002489989,0.0005160392,0.001867122,0.0002846694,0.0002025031],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000695484,0.00006686282,0.01090695,0.00002150049,0.00006262126,0.00002769463,0.0002352744,0.9176893,0.00009919233,0.02643395,0.001333354,0.04305375],"study_design_scores_gemma":[0.001135601,0.0001398519,0.006427314,0.0003082374,0.00002209146,0.00002742942,0.00001852221,0.9898826,0.0002872685,0.00007669746,0.001287008,0.0003873723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05888022,0.0001402836,0.9354275,0.0003598041,0.001767298,0.0004047288,0.000005227094,0.0004997716,0.002515117],"genre_scores_gemma":[0.9793978,0.00004644635,0.01848646,0.000191685,0.001280018,0.00008812598,0.00001438437,0.00005844628,0.0004365821],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9205176,"threshold_uncertainty_score":0.9999214,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128813719","doi":"10.1023/a:1012375503129","title":"The Peril of Evaluating Location Management Proposals through Simulations","year":2001,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Paging; Mobility model; Mobility management; Computer network; Overhead (engineering); Cellular network; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.04750086316816222,"gpt":0.348516220591127,"spread":0.3010153574229648,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001023682,0.0001539081,0.0001776459,0.00005912241,0.0007364639,0.000236646,0.002158991,0.00008243577,0.00001750292],"category_scores_gemma":[0.00004395037,0.000119585,0.00006233317,0.001571164,0.0001891561,0.0004578936,0.0007971433,0.0002849162,0.00001422197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008223418,"about_ca_system_score_gemma":0.00007541517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002950792,"about_ca_topic_score_gemma":0.00005313037,"domain_scores_codex":[0.9975604,0.0004493819,0.0005167536,0.0003353176,0.0006821625,0.0004559382],"domain_scores_gemma":[0.9967174,0.0007315157,0.0002398684,0.001780534,0.0004709952,0.00005966534],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001516395,0.000057086,0.0005055632,0.00001308119,0.00003766655,0.000001788561,0.0003008018,0.5865785,0.00002528546,0.1411649,0.0004242945,0.2708759],"study_design_scores_gemma":[0.0002891081,0.00004091948,0.00147548,0.00008180981,0.000007579386,0.000004381889,0.00009291501,0.9910169,0.00004436261,0.003333682,0.003483931,0.0001288802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01665795,0.00156367,0.9735248,0.001960013,0.0002417433,0.000708344,4.749912e-7,0.0001489171,0.005194072],"genre_scores_gemma":[0.985908,0.001501999,0.01173614,0.00008167487,0.0001158341,0.00009881009,0.000008570737,0.00001855931,0.0005304092],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9692501,"threshold_uncertainty_score":0.5664359,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1593326840","doi":"10.1023/a:1009095931769","title":"A Pseudo-Bayesian ALOHA Algorithm with Mixed Priorities","year":2001,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Aloha; Network packet; Computer network; Channel (broadcasting); Base station; Transmission (telecommunications); Protocol (science); Wireless; Real-time computing; Throughput; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01371624700241095,"gpt":0.2452421415064527,"spread":0.2315258945040418,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005867551,0.0003789167,0.0004316907,0.0002077708,0.0005077964,0.0006009652,0.003213784,0.0002272216,0.00004063036],"category_scores_gemma":[0.00001198514,0.0003334294,0.0001060671,0.001748814,0.0002842286,0.0008013879,0.0008660596,0.0008304681,0.00005288515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000128207,"about_ca_system_score_gemma":0.0001897302,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001072635,"about_ca_topic_score_gemma":0.000209319,"domain_scores_codex":[0.9965149,0.0003846918,0.0004448448,0.0007379586,0.0008122883,0.00110537],"domain_scores_gemma":[0.9964538,0.0003899481,0.0001780424,0.002330199,0.0002897761,0.0003582468],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004651228,0.0001638777,0.003279723,0.00001322826,0.00009038275,0.0002308687,0.0003635077,0.02073148,0.0000161609,0.02510382,0.004626145,0.9453343],"study_design_scores_gemma":[0.0007601103,0.0001176107,0.002595796,0.0001141485,0.000007555735,0.000226563,0.00006456714,0.9843473,0.00004025215,0.0004702547,0.01078765,0.0004682308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008341874,0.0009448983,0.9833732,0.00189641,0.0003263614,0.0004116382,0.000001564778,0.0006452973,0.004058731],"genre_scores_gemma":[0.9018945,0.001425481,0.094187,0.0003818584,0.0005023219,0.0001703939,0.00001852737,0.00006535267,0.001354635],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9636158,"threshold_uncertainty_score":0.9999118,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2127783162","doi":"10.1007/s11276-013-0559-z","title":"A ring-based multicast routing topology with QoS support in wireless mesh networks","year":2013,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer network; Multicast; Computer science; Protocol Independent Multicast; Distance Vector Multicast Routing Protocol; Distributed computing; Xcast; Source-specific multicast; Wireless mesh network; Inter-domain; Pragmatic General Multicast; Topology (electrical circuits); Wireless network; Wireless; Telecommunications; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.009230560273041116,"gpt":0.2235935872610726,"spread":0.2143630269880315,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007561914,0.0006996248,0.0009061807,0.0002358706,0.0002842019,0.0004702254,0.002049482,0.0005662945,0.0002061035],"category_scores_gemma":[0.00001924823,0.0006358618,0.0001575968,0.00151337,0.0003360292,0.0008193871,0.0006117019,0.00138188,0.00008841693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002233062,"about_ca_system_score_gemma":0.0002022633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007093066,"about_ca_topic_score_gemma":0.001289998,"domain_scores_codex":[0.9945554,0.0003874594,0.0009665269,0.001447442,0.0005297064,0.002113425],"domain_scores_gemma":[0.9965519,0.0006505978,0.000426088,0.001681545,0.0002220772,0.0004677371],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001057197,0.0004531564,0.05705851,0.00004084165,0.0000958074,0.000566388,0.0004682469,0.7320241,0.00004103985,0.05041647,0.003417207,0.1553125],"study_design_scores_gemma":[0.0019219,0.0002534745,0.01121721,0.000205737,0.00001368973,0.00006501313,0.00005465733,0.9851699,0.00004860918,0.0000728013,0.0002024576,0.0007745699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1101176,0.00007545701,0.8848787,0.0006069237,0.001101118,0.001193608,9.53451e-7,0.000534847,0.001490823],"genre_scores_gemma":[0.9904524,0.00003534364,0.006246831,0.001518807,0.0008430173,0.000616475,0.00002611574,0.0001018528,0.0001591396],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8803348,"threshold_uncertainty_score":0.9996093,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2767464508","doi":"10.1007/s11276-017-1605-z","title":"Power allocation policy and performance analysis of secure and reliable communication in cognitive radio networks","year":2017,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Electronic Components and Systems for European Leadership; Bộ Giáo dục và Ðào tạo","keywords":"Eavesdropping; Computer science; Cognitive radio; Constraint (computer-aided design); Interference (communication); Performance metric; Channel (broadcasting); Computer network; Power (physics); Metric (unit); Channel state information; Computer security; Mathematical optimization; Telecommunications; Wireless; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0102967172569725,"gpt":0.2577734306187461,"spread":0.2474767133617736,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004038654,0.0001671577,0.0003798586,0.0003127837,0.0002049001,0.0000951914,0.0004074118,0.0002165825,0.000007648733],"category_scores_gemma":[0.00003504312,0.000190732,0.00003885892,0.0004476287,0.0002464782,0.0003938236,0.0002132901,0.0003845995,2.395417e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005795728,"about_ca_system_score_gemma":0.00001401343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002861688,"about_ca_topic_score_gemma":0.000460758,"domain_scores_codex":[0.9990909,0.00006156285,0.0003467721,0.0001778399,0.0001045027,0.00021843],"domain_scores_gemma":[0.998561,0.0001609287,0.0001941534,0.0009227056,0.000101105,0.000060063],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001454278,0.0001446528,0.4397143,0.00018511,0.001065867,0.000002438927,0.004975463,0.4512692,0.0001575877,0.01306688,0.0005248386,0.08874828],"study_design_scores_gemma":[0.0002422113,0.0000172486,0.2483774,0.0002068592,0.00006901116,0.000001247177,0.00006880223,0.7506449,0.00009092912,0.000046321,0.0000905894,0.0001445631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9799047,0.003902702,0.01289468,0.0001265991,0.00002760026,0.0002476939,0.000005487129,0.0001302333,0.002760365],"genre_scores_gemma":[0.9763191,0.02306022,0.0004122135,0.00002960493,0.00002411821,0.00004812681,0.00006295794,0.00002684663,0.00001683844],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2993757,"threshold_uncertainty_score":0.7777827,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2725362229","doi":"10.1007/s11276-017-1546-6","title":"RF energy harvesting: an analysis of wireless sensor networks for reliable communication","year":2017,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Medical Research Council; Electronic Components and Systems for European Leadership","keywords":"Computer science; Network packet; Computer network; Wireless sensor network; Energy harvesting; Reliability (semiconductor); Telecommunications link; Timeout; Efficient energy use; Real-time computing; Energy (signal processing); Electrical engineering; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01797795364701607,"gpt":0.247668720670076,"spread":0.2296907670230599,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008848885,0.0006219835,0.001274742,0.000333332,0.0009970518,0.0004344659,0.001973123,0.0007128916,0.00002304807],"category_scores_gemma":[0.00008260441,0.0006980054,0.0004356609,0.0007176999,0.0004188715,0.0007553248,0.0002632873,0.0005847347,0.000001152094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001421985,"about_ca_system_score_gemma":0.00003751709,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001099315,"about_ca_topic_score_gemma":0.002903833,"domain_scores_codex":[0.9966777,0.0001179156,0.001100688,0.0006984012,0.0003534913,0.001051804],"domain_scores_gemma":[0.9942622,0.0006920977,0.0007986336,0.003512118,0.0003914426,0.0003434646],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005452276,0.00007718698,0.008989711,0.00005485141,0.0009012909,0.000004569307,0.00006827901,0.9583537,0.0002499953,0.005593906,0.00082756,0.02482445],"study_design_scores_gemma":[0.0006793107,0.00006820108,0.008966084,0.000283416,0.0008505563,0.000003602907,0.00005039937,0.9859517,0.0004604486,0.00008634568,0.001879443,0.0007205096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.31818,0.001425063,0.6751671,0.00005350392,0.001079899,0.0003466518,0.00003831206,0.0008818927,0.002827604],"genre_scores_gemma":[0.9907718,0.001478261,0.005267472,0.00007193413,0.000717081,0.000216923,0.0006378392,0.0002449282,0.0005938187],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6725917,"threshold_uncertainty_score":0.9995471,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}