{"meta":{"query_hash":"d3b7d40aee05","filters":{"venue":"Computer Communications"},"cohort_total":189,"direct_labels_cover":0,"predictions_cover":189,"exported":189,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/d3b7d40aee05","api":"https://metacan.xera.ac/api/v1/cohort?venue=Computer+Communications"},"results":[{"id":"W1163710461","doi":"10.1016/j.comcom.2015.08.006","title":"Performance of the MAC protocol in wireless recharging under E-limited scheduling","year":2015,"lang":"en","type":"article","venue":"Computer Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Science Council","keywords":"Computer science; Polling; Computer network; Scheduling (production processes); Network packet; Queueing theory; Wireless; Probabilistic logic; Wireless sensor network; Real-time computing; Telecommunications","score_opus":0.054944744507932096,"score_gpt":0.2694635796143856,"score_spread":0.2145188351064535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1163710461","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9056031,0.00015080812,0.0681057,0.0008699395,0.0005720983,0.014160709,0.000002872708,0.00067264755,0.009862102],"genre_scores_gemma":[0.9536994,0.000014839696,0.041649003,0.00004187951,0.00004307767,0.0045044157,0.0000046066743,0.000026449408,0.00001629506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992288,0.00011198291,0.00029616483,0.0000899155,0.00011213115,0.00016105593],"domain_scores_gemma":[0.99832517,0.00013636875,0.00006499022,0.0013527827,0.00007912579,0.00004153774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002578776,0.000104207946,0.00013105341,0.00007248779,0.00007454693,0.000021558732,0.0011463204,0.00006489354,0.0000013257608],"category_scores_gemma":[0.000012302605,0.00009279071,0.000030910753,0.0004928743,0.000089895475,0.000113552735,0.0004587444,0.00035658004,0.000004280228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022119618,0.00003141592,0.007725889,0.000041299616,0.000010124379,1.1100186e-7,0.0002631171,0.98346543,0.00019289667,0.002811895,0.00010519062,0.0053504244],"study_design_scores_gemma":[0.00030125558,0.000009336784,0.0072885826,0.00037884474,0.0000029952678,0.0000027467768,0.000019900097,0.99034965,0.00047191716,0.000091463065,0.0009818702,0.000101421494],"about_ca_topic_score_codex":0.000014616421,"about_ca_topic_score_gemma":0.000043304935,"teacher_disagreement_score":0.04809631,"about_ca_system_score_codex":0.00009403711,"about_ca_system_score_gemma":0.000041101852,"threshold_uncertainty_score":0.37838954},"labels":[],"label_agreement":null},{"id":"W1182960591","doi":"10.1016/j.comcom.2015.08.003","title":"A compression approach to reducing power consumption of TCAMs in regular expression matching","year":2015,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Natural Science Foundation of China","keywords":"Computer science; Regular expression; Throughput; Parallel computing; Content-addressable memory; Matching (statistics); Set (abstract data type); Artificial intelligence; Operating system","score_opus":0.06838275011301369,"score_gpt":0.2977764274054741,"score_spread":0.2293936772924604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1182960591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025924109,0.0005270817,0.9705316,0.00045386032,0.0001750904,0.00022694696,8.1154997e-7,0.0001339436,0.0020265547],"genre_scores_gemma":[0.5030842,0.000020633493,0.49675605,0.000071685696,0.000014728354,0.000017311628,0.000012914505,0.0000068316403,0.000015656935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852103,0.00031597714,0.00040845067,0.00031573963,0.00024469596,0.0001941234],"domain_scores_gemma":[0.99744755,0.00010646266,0.00018203225,0.0019432278,0.00018479644,0.00013591762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006036405,0.00013015262,0.00021098171,0.000247181,0.00014661894,0.00011939809,0.0018683738,0.00007310605,8.25222e-7],"category_scores_gemma":[0.000023121976,0.00012814775,0.000036742676,0.0006176746,0.00006248129,0.00050965266,0.00141333,0.00020164912,0.000010861542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044070912,0.0014994141,0.0032641247,0.00011856732,0.000021987571,0.0000022007969,0.045821212,0.8308977,0.0051398133,0.043851852,0.0077980845,0.061541002],"study_design_scores_gemma":[0.00054193655,0.000054913027,0.0016644408,0.00062720786,0.0000038246462,0.000012555981,0.00012640428,0.99191225,0.00087483815,0.002914979,0.0010436001,0.00022306027],"about_ca_topic_score_codex":0.000024875204,"about_ca_topic_score_gemma":0.0000023800706,"teacher_disagreement_score":0.4771601,"about_ca_system_score_codex":0.000068472655,"about_ca_system_score_gemma":0.00007078919,"threshold_uncertainty_score":0.5225713},"labels":[],"label_agreement":null},{"id":"W1183861445","doi":"10.1016/j.comcom.2015.08.010","title":"A real-time lane marking localization, tracking and communication system","year":2015,"lang":"en","type":"article","venue":"Computer Communications","topic":"Autonomous Vehicle Technology and Safety","field":"Engineering","cited_by":72,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Hough transform; Computer vision; Artificial intelligence; Line (geometry); Kalman filter; Tracking (education); Filter (signal processing); Probabilistic logic; Tracking system; Pattern recognition (psychology); Image (mathematics)","score_opus":0.021138602947175022,"score_gpt":0.22406486004019147,"score_spread":0.20292625709301645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1183861445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0500091,0.0056032315,0.8826586,0.0016859996,0.00022704243,0.000627999,0.000017677356,0.00702912,0.052141223],"genre_scores_gemma":[0.938227,0.0005552734,0.06102182,0.000026890932,0.000022486398,0.000023418317,0.00007434493,0.000024322262,0.000024468758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993373,0.000114702394,0.00024571025,0.000104448474,0.000065142856,0.00013265522],"domain_scores_gemma":[0.9982082,0.00011904115,0.000047558475,0.0014680233,0.000089102505,0.00006804435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031119038,0.00010823582,0.00015176124,0.000086598884,0.00024624798,0.000047389385,0.000663109,0.000109638524,0.0000026455075],"category_scores_gemma":[0.0000093158815,0.0001222455,0.000019716186,0.00018637092,0.0001334124,0.00014818998,0.00036362698,0.0001982052,0.00005397664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003092127,0.00031786048,0.023966646,0.0004900713,0.0005650437,0.0000145456515,0.015994191,0.094773315,0.001215758,0.5002179,0.027780462,0.33463326],"study_design_scores_gemma":[0.00024455294,0.000013044453,0.0023262058,0.00008423349,0.000017601766,0.000041046496,0.00015134703,0.986188,0.00003747656,0.00080281997,0.009941156,0.00015252901],"about_ca_topic_score_codex":0.000034384728,"about_ca_topic_score_gemma":0.000018743074,"teacher_disagreement_score":0.8914147,"about_ca_system_score_codex":0.000110250854,"about_ca_system_score_gemma":0.00001912355,"threshold_uncertainty_score":0.49850267},"labels":[],"label_agreement":null},{"id":"W1230326749","doi":"10.1016/j.comcom.2015.08.013","title":"Handover-related self-optimization in femtocells: A survey and an interaction study","year":2015,"lang":"en","type":"article","venue":"Computer Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Waterloo","funders":"Ministère de l'Education Nationale, de l'Enseignement Superieur et de la Recherche; Ministry of Higher Education and Scientific Research; Ministry of Education, Libya","keywords":"Femtocell; Handover; Computer science; Self-organizing network; Computer network; Optimization problem; MATLAB; Base station; Algorithm","score_opus":0.053987245070856095,"score_gpt":0.30087304709437435,"score_spread":0.24688580202351826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1230326749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10268257,0.0004165387,0.89407,0.000035260324,0.00037879913,0.0008555303,0.000006035889,0.0006618998,0.00089331414],"genre_scores_gemma":[0.92004013,0.0000829718,0.07961897,0.000008435131,0.000018383093,0.000047754846,0.00014646119,0.000027179207,0.0000097356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899787,0.00035945218,0.00032111086,0.0001485775,0.000066147135,0.00010685942],"domain_scores_gemma":[0.9988247,0.000117217984,0.000056096742,0.0008017195,0.00012320385,0.00007704317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040536534,0.00011660274,0.00015049752,0.0001650951,0.000063020416,0.00006998682,0.00028691633,0.00005639596,0.0000022524262],"category_scores_gemma":[0.000024030189,0.00013559776,0.000010137901,0.000371138,0.000019642112,0.000556327,0.00014702995,0.00017106762,0.000008455429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043497507,0.00020951657,0.015700119,0.0000052963683,0.000018518698,4.6381547e-7,0.003861819,0.97883177,0.000003860366,0.000032537537,0.000084907784,0.001246817],"study_design_scores_gemma":[0.00084972096,0.000075538075,0.007852622,0.000017044193,0.0000070042397,0.000004731014,0.0003610676,0.9905486,0.0000025352074,0.00003204901,0.00011740498,0.00013164444],"about_ca_topic_score_codex":0.00013449539,"about_ca_topic_score_gemma":0.00090044324,"teacher_disagreement_score":0.81735754,"about_ca_system_score_codex":0.00013918379,"about_ca_system_score_gemma":0.000016031552,"threshold_uncertainty_score":0.55295163},"labels":[],"label_agreement":null},{"id":"W1697178956","doi":"10.1016/j.comcom.2016.05.009","title":"Energy management in communication networks: a journey through modeling and optimization glasses","year":2016,"lang":"en","type":"article","venue":"Computer Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Energy consumption; Context (archaeology); The Internet; Energy management; Routing (electronic design automation); Distributed computing; Telecommunications; Computer network; Energy (signal processing); World Wide Web","score_opus":0.04040951515697943,"score_gpt":0.2644876302538345,"score_spread":0.22407811509685505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1697178956","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014139994,0.0036609701,0.9892399,0.005647842,0.00010507126,0.00013486594,7.535539e-7,0.0002044436,0.00086476956],"genre_scores_gemma":[0.36143005,0.018684218,0.6191671,0.00057457626,0.00003163229,0.0000564205,0.000010930835,0.000012269671,0.00003279973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986454,0.00027314937,0.0003828737,0.0003080701,0.00013849122,0.0002519975],"domain_scores_gemma":[0.99668914,0.00041503346,0.00011584065,0.0026241678,0.00009393293,0.000061878636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002902617,0.00015695693,0.0001720136,0.00013610267,0.000321525,0.00023276506,0.002392291,0.000072529925,0.000003279599],"category_scores_gemma":[0.0000082572615,0.00013037393,0.000040438546,0.00051499734,0.00009227198,0.0008725695,0.0025069285,0.00012777765,0.0000031368804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003666817,0.00011612016,0.0003653638,0.0000047298663,0.000033457207,0.0000016616401,0.00040695554,0.52879125,9.662346e-7,0.2648628,0.0010390013,0.20437403],"study_design_scores_gemma":[0.0004792961,0.000018327377,0.00023974574,0.00017374469,0.0000073444326,0.000009449139,0.000015484968,0.98116,9.779495e-7,0.014691025,0.00303215,0.00017245694],"about_ca_topic_score_codex":0.00006400131,"about_ca_topic_score_gemma":0.00006827608,"teacher_disagreement_score":0.45236877,"about_ca_system_score_codex":0.000069227826,"about_ca_system_score_gemma":0.000019189081,"threshold_uncertainty_score":0.5316495},"labels":[],"label_agreement":null},{"id":"W1964826331","doi":"10.1016/j.comcom.2008.08.026","title":"ODMCA: An adaptive data mining control algorithm in multicarrier networks","year":2008,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Data stream mining; Data stream; Controller (irrigation); PID controller; Stability (learning theory); Computation; Adaptability; Data transmission; Transmission (telecommunications); Real-time computing; Distributed computing; Data mining; Algorithm; Computer network; Telecommunications; Machine learning","score_opus":0.08629176346109502,"score_gpt":0.2839526139897091,"score_spread":0.1976608505286141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964826331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006642881,0.0011774717,0.995361,0.0015108656,0.0003300904,0.0003102091,0.000015396568,0.00029357112,0.00033714733],"genre_scores_gemma":[0.5540844,0.00013456581,0.44477957,0.00070667086,0.0001675585,0.00003758413,0.000056038443,0.000010738632,0.00002281184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785364,0.000528503,0.0004389564,0.0005847021,0.0001985782,0.00039560825],"domain_scores_gemma":[0.9927479,0.00069415756,0.00012764514,0.0060883276,0.00015148162,0.0001905114],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00046428293,0.00020577572,0.00030070616,0.00013235671,0.0004704716,0.00011598386,0.007063556,0.00010262957,0.000005387078],"category_scores_gemma":[0.00001914628,0.00021640038,0.00005056961,0.0005401748,0.00023954907,0.0010454329,0.0018778647,0.00041599345,0.0000224878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008426634,0.00028032344,0.0008379335,7.2460995e-7,0.000045234785,0.000027302665,0.0008978273,0.018475205,0.0000013070468,0.008174557,0.0018936532,0.9693575],"study_design_scores_gemma":[0.0011326519,0.00008682801,0.003704211,0.000023754614,0.000010596592,0.000047417485,0.000030294848,0.98970747,2.9250444e-7,0.00008933013,0.004929415,0.00023771629],"about_ca_topic_score_codex":0.000044917713,"about_ca_topic_score_gemma":0.00013119745,"teacher_disagreement_score":0.9712323,"about_ca_system_score_codex":0.000046317073,"about_ca_system_score_gemma":0.00013694621,"threshold_uncertainty_score":0.9983087},"labels":[],"label_agreement":null},{"id":"W1968139495","doi":"10.1016/s0140-3664(01)00296-1","title":"An efficient location management scheme for PCS networks","year":2001,"lang":"en","type":"article","venue":"Computer Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"National Research Council Canada","keywords":"Computer science; Scheme (mathematics); Computer network; Telecommunications; Distributed computing","score_opus":0.05241319166920264,"score_gpt":0.33651487744287206,"score_spread":0.2841016857736694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968139495","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000676565,0.00097435917,0.9905499,0.004241896,0.00021539476,0.00093420385,0.0000014191335,0.0005042858,0.0019019617],"genre_scores_gemma":[0.46384314,0.00060509506,0.53448784,0.00036981064,0.00009918725,0.00039338708,0.00008738565,0.000019348337,0.000094787916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978808,0.00037910542,0.000450637,0.00048751532,0.000312407,0.0004894969],"domain_scores_gemma":[0.98988557,0.00045247228,0.0001508719,0.008763091,0.00054524385,0.00020272435],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0008215572,0.00020195084,0.00019386312,0.00024435594,0.0008968879,0.00047647985,0.00945428,0.000094820854,0.000005821491],"category_scores_gemma":[0.0000120398145,0.00021974534,0.00008976984,0.0013853724,0.00016293065,0.00044201818,0.0026911707,0.00031520525,0.00005229566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009576077,0.0006888515,0.00028704313,0.000017164004,0.000053010754,0.0000014657513,0.0003136943,0.3100857,0.000012766297,0.4461154,0.0031814256,0.2392339],"study_design_scores_gemma":[0.00042356917,0.00006770368,0.0026594289,0.00004171399,0.000006718712,0.000010302094,0.000021718462,0.94792974,0.000005087944,0.0008812725,0.04772552,0.00022719862],"about_ca_topic_score_codex":0.000011220664,"about_ca_topic_score_gemma":0.000020991356,"teacher_disagreement_score":0.637844,"about_ca_system_score_codex":0.00013767272,"about_ca_system_score_gemma":0.000059055263,"threshold_uncertainty_score":0.99590504},"labels":[],"label_agreement":null},{"id":"W1968845049","doi":"10.1016/j.comcom.2004.12.010","title":"Analysis of virtual-time complexity in weighted fair queuing","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Queueing theory; Real-time computing; Computer network","score_opus":0.03432446640692584,"score_gpt":0.2669674836539469,"score_spread":0.23264301724702108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968845049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027066642,0.00024156932,0.96767306,0.0036358205,0.00009587925,0.00015717841,0.00000553499,0.00019010488,0.0009342361],"genre_scores_gemma":[0.84136474,0.000036747162,0.15825146,0.00025217308,0.000017688622,0.000015714608,0.000030312729,0.000005055435,0.000026089278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986649,0.00021520062,0.00046770295,0.0002720146,0.0001748598,0.00020532218],"domain_scores_gemma":[0.99696136,0.00027320796,0.00016425275,0.0023874543,0.0001403859,0.00007335182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003031884,0.00013040431,0.0003717563,0.0004968463,0.00014121013,0.000066543915,0.0027801748,0.00005666253,0.000014652465],"category_scores_gemma":[0.000009009337,0.00013741701,0.0001594026,0.0024363305,0.00018651207,0.00027015703,0.00083863846,0.00020101559,0.00003859129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004338383,0.00042951605,0.0013916679,0.000002487811,0.00034181782,0.0000027160843,0.0013866922,0.05870087,0.00006282972,0.78977776,0.0001157494,0.14778358],"study_design_scores_gemma":[0.00053343293,0.000039980012,0.016276503,0.000031358435,0.00006450352,0.0000017049741,0.000010857139,0.97822124,0.000012109104,0.0039214552,0.00074242573,0.00014443375],"about_ca_topic_score_codex":0.000110984714,"about_ca_topic_score_gemma":0.00036521794,"teacher_disagreement_score":0.9195204,"about_ca_system_score_codex":0.00007708663,"about_ca_system_score_gemma":0.000091899885,"threshold_uncertainty_score":0.5603703},"labels":[],"label_agreement":null},{"id":"W1969873693","doi":"10.1016/j.comcom.2013.02.002","title":"Reliability analysis of a channel restoration mechanism for opportunistic spectrum access","year":2013,"lang":"en","type":"article","venue":"Computer Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Reliability (semiconductor); Mechanism (biology); Channel (broadcasting); Reliability engineering; Computer network; Spectrum (functional analysis); Telecommunications","score_opus":0.06569505529225894,"score_gpt":0.3071792950027381,"score_spread":0.24148423971047916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969873693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032440184,0.0000340191,0.9903986,0.00506554,0.00017148853,0.0005476414,0.000013737382,0.00011079648,0.00041418176],"genre_scores_gemma":[0.8619363,0.00006375323,0.13745618,0.0003102439,0.000049772367,0.00007368399,0.000077704615,0.000007870393,0.000024499495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870825,0.0001597123,0.00043290728,0.00032963976,0.00014955021,0.0002199636],"domain_scores_gemma":[0.99597377,0.00060428097,0.00025361445,0.0025514667,0.00052491983,0.00009193662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031660774,0.00013252725,0.00032067334,0.00034979766,0.00029642083,0.00027255833,0.0021463942,0.000055553934,0.0000095147025],"category_scores_gemma":[0.000057062596,0.00013371279,0.00020234102,0.0013174432,0.00009381734,0.0006387863,0.00091599487,0.000119368684,0.00000512409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042380784,0.00029292773,0.0001524115,0.000022631726,0.0004275883,5.760806e-7,0.0006971922,0.0036333178,0.00019286432,0.9716815,0.0012867484,0.021607999],"study_design_scores_gemma":[0.00012579288,0.000056816363,0.009938784,0.000015251725,0.00012910052,0.0000014448646,0.000008337793,0.90728575,0.000068819376,0.0820815,0.00015793154,0.00013049734],"about_ca_topic_score_codex":0.00021947316,"about_ca_topic_score_gemma":0.00014877958,"teacher_disagreement_score":0.9036524,"about_ca_system_score_codex":0.00006407317,"about_ca_system_score_gemma":0.00006852254,"threshold_uncertainty_score":0.54526496},"labels":[],"label_agreement":null},{"id":"W1970417156","doi":"10.1016/s0140-3664(02)00238-4","title":"Evolutionary approach to optimize the assignment of cells to switches in personal communication networks","year":2003,"lang":"en","type":"article","venue":"Computer Communications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Heuristic; Mathematical optimization; Convergence (economics); Evolutionary algorithm; Optimization problem; Combinatorial optimization; Distributed computing; Artificial intelligence; Algorithm; Mathematics","score_opus":0.0186540089955976,"score_gpt":0.2036066731379924,"score_spread":0.1849526641423948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970417156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01878363,0.0031643722,0.9578573,0.00060664274,0.00022790559,0.0009522127,0.0000096755375,0.000118530355,0.018279722],"genre_scores_gemma":[0.91446424,0.000091462556,0.08507251,0.00011418783,0.000013897371,0.00018774973,0.0000144724845,0.0000145557415,0.000026926935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989966,0.00033580404,0.0002998604,0.000107205036,0.00010060691,0.00015992988],"domain_scores_gemma":[0.9980446,0.00025537726,0.000035772475,0.0015563812,0.000044049684,0.00006378625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004905433,0.00011265629,0.0001559456,0.00009858849,0.00015091574,0.000023515053,0.0010913857,0.000051652514,0.0000058231003],"category_scores_gemma":[0.0000073554256,0.00010064837,0.000056611323,0.00045642303,0.00006564542,0.000055868655,0.00022580357,0.0002201499,0.000013708264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037484708,0.00015502048,0.0003187774,0.000014164801,0.000033816526,4.7965703e-8,0.0040838337,0.96252036,0.00028200092,0.027940981,0.0036191416,0.001028103],"study_design_scores_gemma":[0.00025485706,0.000031142197,0.0045992956,0.00010605148,0.00001411768,0.000006260261,0.001045631,0.97602046,0.00019775581,0.00067412463,0.016816521,0.00023380642],"about_ca_topic_score_codex":0.000016137748,"about_ca_topic_score_gemma":0.000009892572,"teacher_disagreement_score":0.8956806,"about_ca_system_score_codex":0.000072057774,"about_ca_system_score_gemma":0.000013712801,"threshold_uncertainty_score":0.41043216},"labels":[],"label_agreement":null},{"id":"W1970968921","doi":"10.1016/j.comcom.2009.12.010","title":"Vehicular telematics over heterogeneous wireless networks: A survey","year":2010,"lang":"en","type":"article","venue":"Computer Communications","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":204,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Toronto Metropolitan University; University of British Columbia; University of Manitoba","funders":"","keywords":"Telematics; Computer science; Computer network; Vehicular ad hoc network; Wireless; Open research; Heterogeneous network; Wireless network; Telecommunications; Access control; Wireless ad hoc network; World Wide Web","score_opus":0.015016459038990793,"score_gpt":0.23249381761828936,"score_spread":0.21747735857929856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970968921","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6473266,0.0012345297,0.34818116,0.000108129396,0.0012085203,0.00043597593,0.000024516054,0.0009407274,0.0005398228],"genre_scores_gemma":[0.9711932,0.0002979888,0.027719595,0.00015313423,0.00025163262,0.00004835862,0.00023802191,0.00008196874,0.00001612189],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986571,0.00018229634,0.00039173194,0.00019564517,0.00016441233,0.0004088184],"domain_scores_gemma":[0.99609977,0.0004060513,0.000060341972,0.0031587959,0.0001072181,0.00016781727],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040517937,0.00024812398,0.00028299147,0.00007675695,0.00021559688,0.00014045091,0.0015977842,0.00018981623,0.000041468207],"category_scores_gemma":[0.000014725306,0.00027030462,0.00011257178,0.00034302147,0.00013481519,0.000115053444,0.0005441382,0.0008577004,0.00008182821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011749082,0.000064148495,0.0023297672,0.0000165289,0.000105050945,0.000005386821,0.00009254844,0.98434436,0.00017052857,0.0005359494,0.004322735,0.008011825],"study_design_scores_gemma":[0.00018695825,0.00001164777,0.012096728,0.00002769797,0.000020088888,0.000044505414,0.0000013997648,0.97348183,0.000033448858,0.00008388555,0.013723336,0.00028846785],"about_ca_topic_score_codex":0.00003524783,"about_ca_topic_score_gemma":0.0013249819,"teacher_disagreement_score":0.32386658,"about_ca_system_score_codex":0.000041857616,"about_ca_system_score_gemma":0.000021315363,"threshold_uncertainty_score":0.9999749},"labels":[],"label_agreement":null},{"id":"W1971785410","doi":"10.1016/j.comcom.2005.01.013","title":"A new energy efficient and fault-tolerant protocol for data propagation in smart dust networks using varying transmission range","year":2005,"lang":"en","type":"article","venue":"Computer Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Protocol (science); Wireless sensor network; Fault tolerance; Transmission (telecommunications); Efficient energy use; Energy consumption; Data transmission; Range (aeronautics); Computer network; Propagation delay; Communications protocol; Real-time computing; Distributed computing; Telecommunications; Electrical engineering; Engineering","score_opus":0.08116099532961196,"score_gpt":0.32249232112719756,"score_spread":0.2413313257975856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971785410","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020890543,0.0002519702,0.9824562,0.0017717775,0.00008158571,0.014970382,0.0000019768488,0.0001633525,0.00009385071],"genre_scores_gemma":[0.06979658,0.000026229647,0.9211885,0.00029993587,0.00021472659,0.00835471,0.000062385705,0.000030559248,0.000026368873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979541,0.00025624436,0.0005584066,0.00062372535,0.00021006897,0.00039747483],"domain_scores_gemma":[0.99614143,0.00035558612,0.00019016663,0.0030527117,0.00010196938,0.0001581383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047701865,0.00023401117,0.00025718025,0.00020298322,0.00044216175,0.000268358,0.003034858,0.00012628977,0.0000021960964],"category_scores_gemma":[0.000009242797,0.00022978317,0.000049576665,0.0006138633,0.00007188611,0.00048117212,0.0016490348,0.00025325743,9.108627e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014799482,0.00016490425,0.000051455296,0.000013976238,0.000007351645,7.353199e-7,0.00031936477,0.7031736,0.00005023114,0.0046973075,0.00029287703,0.2912134],"study_design_scores_gemma":[0.0015232442,0.000037232,0.00014387749,0.0002815863,0.000008448373,0.000017236698,0.0000027944955,0.95974433,0.000043773318,0.000046178975,0.037900925,0.0002503583],"about_ca_topic_score_codex":0.00017304621,"about_ca_topic_score_gemma":0.00013955169,"teacher_disagreement_score":0.29096302,"about_ca_system_score_codex":0.00010179485,"about_ca_system_score_gemma":0.00012631575,"threshold_uncertainty_score":0.9370286},"labels":[],"label_agreement":null},{"id":"W1971829800","doi":"10.1016/s0140-3664(02)00143-3","title":"Call admission control for wireless personal communications","year":2002,"lang":"en","type":"article","venue":"Computer Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Wireless; Computer network; Wireless network; Call Admission Control; Quality of service; Wireline; Wireless site survey; Telecommunications; Wi-Fi array","score_opus":0.0918478749385074,"score_gpt":0.3245223122840761,"score_spread":0.23267443734556867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971829800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020257439,0.003788109,0.9366793,0.054043036,0.0001905381,0.0010372563,0.00003395287,0.00056898425,0.0034562317],"genre_scores_gemma":[0.66885716,0.0017936087,0.32665557,0.001246934,0.00011104392,0.000623473,0.00007702476,0.000035864523,0.00059933227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99685025,0.0008827142,0.00067086704,0.0005328134,0.00044087213,0.00062250695],"domain_scores_gemma":[0.9836605,0.002806465,0.00025864266,0.012204604,0.0007078555,0.0003619223],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007584597,0.0003017991,0.00038699203,0.00027873553,0.0017586305,0.00048342426,0.017435757,0.00017162826,0.00004216225],"category_scores_gemma":[0.00008723575,0.0003158305,0.00025939415,0.00087752065,0.0005247533,0.00071590615,0.0050212704,0.0007383102,0.00021385368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014460406,0.0015622855,0.0005935098,0.00004613129,0.00018471939,0.0000017418948,0.0035280196,0.00029760203,0.00038696997,0.3356948,0.09788471,0.55980504],"study_design_scores_gemma":[0.0009475775,0.00007849765,0.00042579218,0.000053064894,0.000012938928,0.000016737169,0.000015989992,0.8184681,0.00001643611,0.00084607216,0.17883225,0.00028652247],"about_ca_topic_score_codex":0.000025058365,"about_ca_topic_score_gemma":0.000049489692,"teacher_disagreement_score":0.8181705,"about_ca_system_score_codex":0.00017132821,"about_ca_system_score_gemma":0.00010935596,"threshold_uncertainty_score":0.99992937},"labels":[],"label_agreement":null},{"id":"W1972806349","doi":"10.1016/s0140-3664(00)00160-2","title":"A real-time residential gateway operating system","year":2000,"lang":"en","type":"article","venue":"Computer Communications","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Computer science; Gateway (web page); Real-time computing; Telecommunications; Computer network; Operating system; Embedded system; World Wide Web","score_opus":0.019829572885594407,"score_gpt":0.26044668360783085,"score_spread":0.24061711072223646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972806349","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056774467,0.0005415236,0.7615368,0.003801976,0.0007962112,0.0012584039,0.000009328417,0.0038394816,0.17144185],"genre_scores_gemma":[0.4691071,0.000069985974,0.5293167,0.000073993506,0.00023235766,0.00006676656,0.000019854431,0.0000275484,0.0010856625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972632,0.00073345675,0.00071324385,0.0005253886,0.00034303594,0.0004216581],"domain_scores_gemma":[0.9936334,0.00032239247,0.0001664032,0.0055174734,0.00018114831,0.00017919252],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007292867,0.00024255252,0.00034205313,0.00015153993,0.00086753274,0.0009741799,0.0056286626,0.00010320547,0.00008210606],"category_scores_gemma":[0.000013041726,0.0002493732,0.00013576559,0.0006385935,0.00009924446,0.0010304347,0.001427192,0.00027552852,0.002758038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021266515,0.00092488824,0.00076498464,0.00038948678,0.0005750893,0.00016683062,0.019253798,0.02975305,0.034342952,0.5307772,0.03266924,0.35036117],"study_design_scores_gemma":[0.00033962264,0.0000456044,0.00093019305,0.00025396224,0.00001264201,0.0001826602,0.000042165644,0.99296135,0.00024749793,0.0001548094,0.004487991,0.00034151043],"about_ca_topic_score_codex":0.0004922808,"about_ca_topic_score_gemma":0.000014210003,"teacher_disagreement_score":0.9632083,"about_ca_system_score_codex":0.0001529702,"about_ca_system_score_gemma":0.00014167906,"threshold_uncertainty_score":0.9999958},"labels":[],"label_agreement":null},{"id":"W1973540464","doi":"10.1016/j.comcom.2009.08.015","title":"Towards cross layer mobility support in metropolitan networks","year":2009,"lang":"en","type":"article","venue":"Computer Communications","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Roaming; Computer science; Computer network; Mobility management; Metropolitan area; Homogeneous; Quality of service; Mobility model; Heterogeneous network; Wireless network; Wireless; Distributed computing; Telecommunications","score_opus":0.026366328586720538,"score_gpt":0.2955830949233269,"score_spread":0.26921676633660635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973540464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2833364,0.008533635,0.6455912,0.0018266536,0.0026143328,0.0018921875,0.00007218711,0.0025734925,0.05355992],"genre_scores_gemma":[0.9807278,0.00031178325,0.018187566,0.00036099768,0.0002106996,0.000048077516,0.00009346519,0.000029005814,0.000030590356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982405,0.00018759654,0.0005827792,0.0002953173,0.00016946421,0.00052439736],"domain_scores_gemma":[0.99639845,0.00016526904,0.00005130161,0.0031339235,0.000107904525,0.0001431774],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058050134,0.00025850342,0.00035279823,0.000121916324,0.0001666095,0.00012973978,0.0015942021,0.00019032862,0.00006277553],"category_scores_gemma":[0.000017663058,0.00029373638,0.00013624885,0.0005644186,0.00019025664,0.00028791183,0.00045667856,0.0007432806,0.000035860234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007372935,0.0030875641,0.05005127,0.00015448256,0.00023793773,0.000027804632,0.0037461172,0.6256494,0.00009442501,0.06705221,0.019899376,0.2299257],"study_design_scores_gemma":[0.00063427904,0.00007220017,0.17141952,0.000025793415,0.000016946167,0.000008652548,0.000028968783,0.80620056,0.00004100669,0.004367689,0.016800152,0.00038421343],"about_ca_topic_score_codex":0.00011265176,"about_ca_topic_score_gemma":0.00046090005,"teacher_disagreement_score":0.6973914,"about_ca_system_score_codex":0.0005499499,"about_ca_system_score_gemma":0.00003814097,"threshold_uncertainty_score":0.9999515},"labels":[],"label_agreement":null},{"id":"W1976181481","doi":"10.1016/s0140-3664(00)00185-7","title":"Design and analysis of per-flow queueing switches and VC-merge switches based on per-VC queueing architecture","year":2000,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Queueing theory; Merge (version control); Layered queueing network; Weighted fair queueing; Mean value analysis; Queueing system; Architecture; Computer network; Parallel computing","score_opus":0.018952602545834106,"score_gpt":0.2349403952438114,"score_spread":0.2159877926979773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976181481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021536486,0.0014011925,0.97189164,0.0043001473,0.00004306298,0.00023111378,0.000004055094,0.00016453746,0.0004277795],"genre_scores_gemma":[0.69887584,0.00022257306,0.30024248,0.0005467607,0.0000280566,0.000025037152,0.000010900806,0.000010028175,0.000038312366],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840117,0.00034167757,0.00036978876,0.00043487537,0.00020329123,0.0002491872],"domain_scores_gemma":[0.9967218,0.0010504381,0.00012845134,0.0018731197,0.000093438626,0.00013275775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042297828,0.00022873242,0.0004019492,0.00034860274,0.00041635687,0.00018896829,0.0013262681,0.00008521802,0.000034889454],"category_scores_gemma":[0.000010810198,0.00021569555,0.00012198942,0.00071263866,0.00018026457,0.00018532127,0.00030589398,0.00029542163,0.0000066490843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001738765,0.00011714387,0.0011988039,0.000010738002,0.00022847847,9.773476e-7,0.0016222359,0.24533065,0.0000966352,0.0024350828,0.00009216736,0.7488497],"study_design_scores_gemma":[0.00035766079,0.00009256653,0.008206945,0.0000634221,0.00017415016,0.000004646241,0.000014326466,0.9889688,0.000023189112,0.00029827142,0.0015795479,0.00021651205],"about_ca_topic_score_codex":0.00004743571,"about_ca_topic_score_gemma":0.00005568461,"teacher_disagreement_score":0.7486332,"about_ca_system_score_codex":0.000023149072,"about_ca_system_score_gemma":0.00007051915,"threshold_uncertainty_score":0.8795809},"labels":[],"label_agreement":null},{"id":"W1978172438","doi":"10.1016/j.comcom.2004.07.014","title":"Editorial for the special issue of computer communications ‘performance issues of wireless LANs, PANs, and Ad Hoc networks’","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Wireless ad hoc network; Computer network; Telecommunications; Wireless; Wireless lan; Computer security","score_opus":0.019965872658338917,"score_gpt":0.26309069918131034,"score_spread":0.24312482652297143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978172438","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003004553,0.007820536,0.96665496,0.007598531,0.013853655,0.0007192345,0.00002453145,0.00014716959,0.00017682569],"genre_scores_gemma":[0.264163,0.024682438,0.6797443,0.00035942238,0.030729484,0.00012635568,0.00009904651,0.00004675214,0.000049192317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980944,0.00021182255,0.0007032586,0.0003377278,0.0003166305,0.00033615206],"domain_scores_gemma":[0.99246144,0.0013638781,0.000420952,0.005178156,0.00048930757,0.00008624788],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00052502984,0.00024929474,0.000429548,0.0001186106,0.00065274595,0.0001239266,0.006426491,0.0001597616,0.000002077523],"category_scores_gemma":[0.000013318882,0.00021485025,0.00013632319,0.00057464215,0.00087257684,0.00031704534,0.002902336,0.00038919062,0.000003872217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050394672,0.00090520806,0.00042791973,0.00010359163,0.0002539534,3.6294807e-7,0.0049418476,0.29875305,0.00007619456,0.1415415,0.08342888,0.4695171],"study_design_scores_gemma":[0.00076188106,0.00019118075,0.0008852486,0.00014174779,0.00003188304,0.0000046769896,0.00003121738,0.698591,0.000096604905,0.0002753627,0.29877704,0.00021217963],"about_ca_topic_score_codex":0.000047264588,"about_ca_topic_score_gemma":0.0001312674,"teacher_disagreement_score":0.46930495,"about_ca_system_score_codex":0.00004773628,"about_ca_system_score_gemma":0.00009241188,"threshold_uncertainty_score":0.9989492},"labels":[],"label_agreement":null},{"id":"W1978433263","doi":"10.1016/j.comcom.2004.07.006","title":"Assigning cells to switches in mobile networks using an ant colony optimization heuristic","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Ant colony optimization algorithms; Heuristic; Mathematical optimization; Optimization problem; Metaheuristic; Algorithm; Artificial intelligence; Mathematics","score_opus":0.04141503808203103,"score_gpt":0.29967456980762996,"score_spread":0.25825953172559896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978433263","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03093136,0.0002569944,0.9677058,0.000056230907,0.0002204346,0.0003568086,0.0000027549893,0.00035431475,0.000115288174],"genre_scores_gemma":[0.43954954,0.000060726994,0.5601937,0.00006586768,0.000043323515,0.000031691663,0.0000226084,0.000030967236,0.0000015782374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989638,0.00015294031,0.00036324674,0.00018526964,0.0000888204,0.00024597472],"domain_scores_gemma":[0.9985299,0.00015620759,0.0000513271,0.001071324,0.000078992576,0.000112235786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034800504,0.00015176626,0.00018906382,0.00019985785,0.00018177163,0.000105866726,0.0006574664,0.00008993626,0.000006235828],"category_scores_gemma":[0.00001809565,0.00019019561,0.000029977979,0.0006971029,0.000035965877,0.00020863402,0.00024787587,0.00025691988,0.0000065635704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011256261,0.000075732896,0.00019117858,0.0000070797314,0.0000075035396,8.927619e-7,0.00069749536,0.9957139,0.00068561133,0.0000700581,0.000017992777,0.0025314142],"study_design_scores_gemma":[0.00025305888,0.00003600076,0.00033288257,0.00008522469,0.000009807359,0.0000042986608,0.00004408381,0.9985409,0.00029269527,0.00003591691,0.00016197104,0.00020320027],"about_ca_topic_score_codex":0.000036893274,"about_ca_topic_score_gemma":0.00003473529,"teacher_disagreement_score":0.40861815,"about_ca_system_score_codex":0.00026375396,"about_ca_system_score_gemma":0.00003778802,"threshold_uncertainty_score":0.77559525},"labels":[],"label_agreement":null},{"id":"W1978642186","doi":"10.1016/j.comcom.2007.08.037","title":"Quality of service based resource allocation for scheduled lightpath demands","year":2007,"lang":"en","type":"article","venue":"Computer Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Backup; Integer programming; Computer network; Heuristic; Quality of service; Routing (electronic design automation); Resource allocation; Path (computing); Linear programming; Service (business); Idle; Path protection; Metric (unit); Mathematical optimization; Distributed computing; Wavelength-division multiplexing; Algorithm; Wavelength; Mathematics","score_opus":0.04868393157740157,"score_gpt":0.3092076100395707,"score_spread":0.2605236784621691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978642186","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013368358,0.00040360144,0.98311216,0.0013080173,0.00004307667,0.00024630837,0.0000063141033,0.0005976172,0.0009145258],"genre_scores_gemma":[0.4629543,0.000013228264,0.5368075,0.00012405582,0.000018677632,0.000023421571,0.000043771754,0.000012341753,0.000002694058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926597,0.000026581298,0.00036519847,0.00010023934,0.00007621572,0.00016579761],"domain_scores_gemma":[0.9973935,0.0008995754,0.00006515385,0.0014464237,0.00015968112,0.00003568733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039798804,0.00009506594,0.00016038064,0.000079409525,0.00008848828,0.000009489673,0.000815095,0.00009267336,0.0000014719942],"category_scores_gemma":[0.00005163955,0.00010242443,0.00004931657,0.00034988692,0.00007463869,0.0000641657,0.00017588955,0.00014460295,0.000003789297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070757924,0.00041572534,0.0014212703,0.0006092938,0.00014895495,3.3761984e-7,0.0005178813,0.46312448,0.009971682,0.33008894,0.0016262949,0.19200437],"study_design_scores_gemma":[0.00041760007,0.000030429106,0.004697875,0.000051692736,0.000010953853,3.8095433e-7,0.000045534678,0.97348505,0.0024061524,0.0032518203,0.015439956,0.00016254792],"about_ca_topic_score_codex":0.000002656741,"about_ca_topic_score_gemma":0.00006800504,"teacher_disagreement_score":0.5103606,"about_ca_system_score_codex":0.000043574666,"about_ca_system_score_gemma":0.000009843548,"threshold_uncertainty_score":0.4176747},"labels":[],"label_agreement":null},{"id":"W1979635763","doi":"10.1016/j.comcom.2007.08.012","title":"Global stability of Peer-to-Peer file sharing systems","year":2007,"lang":"en","type":"article","venue":"Computer Communications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"BitTorrent; Computer science; File sharing; Stability (learning theory); Peer-to-peer; BitTorrent tracker; Distributed computing; File system; Simple (philosophy); Computer network; World Wide Web; The Internet; Operating system","score_opus":0.057790733831157536,"score_gpt":0.31231022042678497,"score_spread":0.25451948659562745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979635763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01358484,0.00022500496,0.9696263,0.008838929,0.00057356444,0.00055673503,0.0001457269,0.0009562717,0.005492603],"genre_scores_gemma":[0.56185836,0.000002950694,0.43764612,0.00022980085,0.00004884685,0.00004500607,0.000035665988,0.000009029437,0.00012422737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974029,0.00009659367,0.0006890093,0.0005669655,0.0007047318,0.0005398224],"domain_scores_gemma":[0.9903646,0.00056142855,0.00018025802,0.007534148,0.0011239484,0.00023560709],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001725712,0.00022554777,0.00035224325,0.00023431658,0.00026367008,0.00024085813,0.010597523,0.00013088858,0.00001646054],"category_scores_gemma":[0.00033737265,0.00024013293,0.000103074606,0.0020973103,0.000160594,0.0003131844,0.009449704,0.00026569312,0.0001208254],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019737765,0.0008579461,0.03543973,0.000089256915,0.00016012297,0.000013249414,0.003696323,0.009445835,0.00029308637,0.44096965,0.32675564,0.18225944],"study_design_scores_gemma":[0.0005248731,0.00037230272,0.15476765,0.00032110355,0.000025472576,0.00006308272,0.00033562398,0.4056737,0.00062175875,0.0072475364,0.42896184,0.0010850261],"about_ca_topic_score_codex":0.00027303354,"about_ca_topic_score_gemma":0.00029199178,"teacher_disagreement_score":0.5482735,"about_ca_system_score_codex":0.00028311872,"about_ca_system_score_gemma":0.000080394675,"threshold_uncertainty_score":0.9985617},"labels":[],"label_agreement":null},{"id":"W1980714833","doi":"10.1016/s0140-3664(00)00189-4","title":"Towards a generic real-time transport and adaptation protocol for IP networks","year":2000,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Interoperability; Software portability; Protocol (science); Flexibility (engineering); Adaptation (eye); Quality of service; Distributed computing; Leverage (statistics); Concurrency; Embedded system; Computer architecture; Computer network; Operating system","score_opus":0.05368359127031896,"score_gpt":0.2882589755263415,"score_spread":0.23457538425602253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980714833","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011279942,0.00003459149,0.9519019,0.0011697822,0.000040179693,0.044051718,0.0000029996897,0.00031116113,0.00237486],"genre_scores_gemma":[0.0063527245,0.00013114246,0.8033822,0.000631054,0.0001316365,0.18888347,0.00006248158,0.000023674176,0.00040157555],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986156,0.00015230941,0.00040421626,0.00039166192,0.00015100626,0.0002851899],"domain_scores_gemma":[0.99726593,0.00013704241,0.00011328144,0.0022876768,0.00008602828,0.00011004328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035414798,0.0001808231,0.00018801735,0.00008086327,0.00036025234,0.00014340391,0.0019353897,0.000058713213,0.000038746446],"category_scores_gemma":[0.0000018360071,0.00018555699,0.00008124202,0.00039896945,0.00008300984,0.00031477056,0.0003523693,0.00011188401,0.000024156941],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016799202,0.0001480166,0.000042320866,0.000027824562,0.000036940262,0.000001556168,0.00044833348,0.05809384,0.000004545736,0.017148068,0.005190165,0.9188416],"study_design_scores_gemma":[0.00060183706,0.000110259716,0.0018889132,0.000032102453,0.000012248311,0.0000037274435,0.0000023747561,0.8594169,0.0000022675088,0.0009281956,0.13682847,0.00017271392],"about_ca_topic_score_codex":0.000046689755,"about_ca_topic_score_gemma":0.000025678679,"teacher_disagreement_score":0.91866887,"about_ca_system_score_codex":0.000060483668,"about_ca_system_score_gemma":0.000069340305,"threshold_uncertainty_score":0.7566794},"labels":[],"label_agreement":null},{"id":"W1980840695","doi":"10.1016/j.comcom.2004.08.004","title":"An adaptive handoff priority scheme for wireless MC-CDMA cellular networks supporting realtime multimedia applications","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Handover; Computer network; Scheme (mathematics); Wireless; Multimedia; Code division multiple access; Wireless network; Telecommunications","score_opus":0.04352984253714887,"score_gpt":0.3326530069047234,"score_spread":0.2891231643675745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980840695","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010973468,0.0007190747,0.9909697,0.0035559854,0.00016355418,0.002323435,0.0000235851,0.0007937335,0.00035354806],"genre_scores_gemma":[0.45705912,0.00022346836,0.54073524,0.00021994968,0.00024030133,0.0011727232,0.00028253757,0.000040183848,0.000026477468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962345,0.00055873976,0.0009497513,0.0008836292,0.00046001194,0.00091337843],"domain_scores_gemma":[0.98713726,0.001187971,0.0005062679,0.009727184,0.0009473315,0.0004939775],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013863596,0.00039160697,0.0004799612,0.00026529664,0.0018240092,0.00058030867,0.010545707,0.00025586082,0.000006336939],"category_scores_gemma":[0.00003895731,0.00043706692,0.00022049744,0.0012664332,0.00048620912,0.00117252,0.0032721397,0.0009437667,0.00006281004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044628177,0.0021994968,0.00041559627,0.00004570281,0.00018944507,0.000004342444,0.0026650021,0.043584272,0.0018743358,0.5522068,0.0011704649,0.39559987],"study_design_scores_gemma":[0.001193993,0.00018194313,0.00056266494,0.00006478626,0.000015669879,0.00000923705,0.000049939703,0.9849549,0.00039016412,0.0047479565,0.0073658763,0.0004628537],"about_ca_topic_score_codex":0.00013675903,"about_ca_topic_score_gemma":0.00015150107,"teacher_disagreement_score":0.94137067,"about_ca_system_score_codex":0.0003141891,"about_ca_system_score_gemma":0.00050520996,"threshold_uncertainty_score":0.99980813},"labels":[],"label_agreement":null},{"id":"W1982350619","doi":"10.1016/j.comcom.2006.04.003","title":"A smooth broadcasting scheme for VBR-encoded hot videos","year":2006,"lang":"en","type":"article","venue":"Computer Communications","topic":"Video Coding and Compression Technologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Council","keywords":"Computer science; Variable bitrate; Bandwidth (computing); Broadcasting (networking); Asynchronous communication; Real-time computing; Upload; Computer network; Variance (accounting); Video server; Bit rate","score_opus":0.055433345927814605,"score_gpt":0.2887298526092142,"score_spread":0.2332965066813996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982350619","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002532777,0.00089298893,0.98728,0.0054183793,0.00023381793,0.00031963477,0.000005535131,0.0015942773,0.0017225555],"genre_scores_gemma":[0.37641957,0.000026863629,0.62286896,0.00024416414,0.0000757395,0.00015511074,0.000014332973,0.0000118110065,0.00018343779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985799,0.00008687229,0.00039880048,0.00040612987,0.00017358248,0.000354708],"domain_scores_gemma":[0.9954328,0.0005675105,0.00018531964,0.0035532126,0.00020739915,0.000053742682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025598094,0.0001910468,0.00022106785,0.0001960653,0.0008389778,0.0003509245,0.005199264,0.00009917605,0.0000026865512],"category_scores_gemma":[0.00005757892,0.00018718069,0.00013547836,0.0005183485,0.00013776055,0.0003712751,0.0025319792,0.00025237238,0.000032261247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007006836,0.00039847707,0.0007546077,0.00003532277,0.000031475913,0.0000024439605,0.00032600414,0.00072111626,0.003917878,0.5463805,0.052918505,0.39450663],"study_design_scores_gemma":[0.0005078705,0.00007985349,0.0011495722,0.000104224266,0.000007733151,0.000013564465,0.000023556493,0.8417993,0.0020018192,0.03940931,0.11456076,0.000342431],"about_ca_topic_score_codex":0.000055507186,"about_ca_topic_score_gemma":0.000017466078,"teacher_disagreement_score":0.84107816,"about_ca_system_score_codex":0.000047074634,"about_ca_system_score_gemma":0.00006552257,"threshold_uncertainty_score":0.96616125},"labels":[],"label_agreement":null},{"id":"W1985719683","doi":"10.1016/j.comcom.2014.02.020","title":"VANET security surveys","year":2014,"lang":"en","type":"article","venue":"Computer Communications","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":497,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Computer security; Vehicular ad hoc network; Wireless ad hoc network; Mobile ad hoc network; Computer network; Architecture; Wireless; Intelligent transportation system; Telecommunications; Transport engineering; Network packet","score_opus":0.011760201959340452,"score_gpt":0.2130870158711024,"score_spread":0.20132681391176194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985719683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020181749,0.0010780522,0.95123756,0.00051301403,0.00057344383,0.00020841869,0.000011531005,0.0012790571,0.024917198],"genre_scores_gemma":[0.9720543,0.00014802888,0.027296077,0.00012783438,0.00017288864,0.000017612374,0.00012608214,0.000030687865,0.000026505855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990173,0.00037457133,0.0001856759,0.00011393547,0.000087288776,0.00022125525],"domain_scores_gemma":[0.9975071,0.00025202025,0.000021935455,0.0020841178,0.000043911023,0.00009093086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005409953,0.00012266704,0.00014451638,0.00004841406,0.00012646226,0.000055127817,0.0010418255,0.00006549446,0.00002616001],"category_scores_gemma":[0.000009816738,0.0001384212,0.000052432657,0.00017320941,0.0000642402,0.00008887935,0.00034347587,0.00028863095,0.00025535165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.52855e-7,0.00008024441,0.0012661954,0.000032218857,0.00008291817,0.0000010340912,0.00048270845,0.8615304,0.000055404158,0.012738719,0.045238428,0.07849127],"study_design_scores_gemma":[0.0001039297,0.000009043968,0.0045479923,0.000012101544,0.0000063684856,0.000005955593,0.000001763402,0.8255679,0.000012773235,0.0010742067,0.16852726,0.000130695],"about_ca_topic_score_codex":0.000015301914,"about_ca_topic_score_gemma":0.00015522643,"teacher_disagreement_score":0.9518725,"about_ca_system_score_codex":0.000035515437,"about_ca_system_score_gemma":0.000007129959,"threshold_uncertainty_score":0.5644653},"labels":[],"label_agreement":null},{"id":"W1985795021","doi":"10.1016/j.comcom.2012.04.001","title":"Multi-layer episode filtering for the multi-step attack detection","year":2012,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Data mining; Correlation; Decision tree; Attack model; Layer (electronics); Reduction (mathematics); Machine learning; Artificial intelligence; Correlation attack; Computer security; Cryptography","score_opus":0.14361034305428277,"score_gpt":0.3375627116951288,"score_spread":0.19395236864084603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985795021","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011299828,0.0012605825,0.9937312,0.0015559609,0.0015053953,0.0004898136,0.0000032539388,0.00027328418,0.0000505274],"genre_scores_gemma":[0.46357277,0.0001297937,0.53533196,0.00042722968,0.00026837416,0.00017705854,0.000004552914,0.000011615773,0.0000766235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988318,0.00018564617,0.0002867827,0.00022142917,0.00011993977,0.00035436774],"domain_scores_gemma":[0.9965672,0.0006298227,0.0001308449,0.0024452687,0.00012956008,0.000097343705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052749924,0.00015187949,0.00013044721,0.00008035454,0.001209468,0.00020371405,0.002364021,0.000083539904,0.0000071384798],"category_scores_gemma":[0.000032907727,0.00012523065,0.0001324466,0.00033775478,0.000088264205,0.000753557,0.0014031776,0.00028888378,0.00008548918],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001052787,0.0006256569,0.00045895655,0.000026889626,0.000100586716,1.9334028e-7,0.003132688,0.0024372258,0.0028819803,0.0073432494,0.004296381,0.9786857],"study_design_scores_gemma":[0.00030091195,0.00003041235,0.0041131056,0.000013642325,0.00001089797,0.000013759677,0.00001386577,0.8097619,0.0006575724,0.000031841602,0.1849163,0.0001358054],"about_ca_topic_score_codex":0.000061007653,"about_ca_topic_score_gemma":0.00031726013,"teacher_disagreement_score":0.97854984,"about_ca_system_score_codex":0.00006036384,"about_ca_system_score_gemma":0.000012628348,"threshold_uncertainty_score":0.93023723},"labels":[],"label_agreement":null},{"id":"W1988213757","doi":"10.1016/j.comcom.2007.05.056","title":"Load sharing in Call Server clusters","year":2007,"lang":"en","type":"article","venue":"Computer Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada); Carleton University","funders":"","keywords":"Computer science; Computer network; Operating system","score_opus":0.06365834836055209,"score_gpt":0.3346072138923558,"score_spread":0.27094886553180375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988213757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010021259,0.0010025158,0.9689132,0.006915303,0.00020073784,0.00035382074,6.637626e-7,0.0003385824,0.012253914],"genre_scores_gemma":[0.7563286,0.00022090884,0.24247561,0.00064809615,0.000048801277,0.00002937155,0.000010259378,0.000016002756,0.00022234971],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978045,0.00023892877,0.0005574913,0.0004147096,0.0004367325,0.00054763455],"domain_scores_gemma":[0.9909288,0.00075614615,0.000112209855,0.0077691483,0.0002608082,0.00017285142],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0021595885,0.0001669625,0.00020076067,0.00032754833,0.00030760208,0.00028000196,0.012073086,0.00010241517,0.0000073936367],"category_scores_gemma":[0.00003851866,0.0001852143,0.00007788848,0.0014241656,0.00016381308,0.00067433476,0.009419747,0.0007192218,0.00014415132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023171859,0.0011296523,0.035878886,0.000048857983,0.00008079687,0.000044734334,0.008781728,0.01190928,0.00018091506,0.4622337,0.007651854,0.47203642],"study_design_scores_gemma":[0.00051627035,0.000025527146,0.047181904,0.00008096981,0.0000018352308,0.000016707536,0.00002385784,0.92290443,0.00003670212,0.0018761235,0.027064105,0.00027156816],"about_ca_topic_score_codex":0.00022892389,"about_ca_topic_score_gemma":0.0020763932,"teacher_disagreement_score":0.9109951,"about_ca_system_score_codex":0.0004112269,"about_ca_system_score_gemma":0.00014232015,"threshold_uncertainty_score":0.9985919},"labels":[],"label_agreement":null},{"id":"W1988598963","doi":"10.1016/j.comcom.2007.02.014","title":"DREAM: A system for detection and reaction against MAC layer misbehavior in ad hoc networks","year":2007,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Timeout; Computer science; Computer network; Network packet; Node (physics); Transmission (telecommunications); Protocol (science); Intrusion detection system; Wireless ad hoc network; Process (computing); Channel (broadcasting); Computer security; Wireless; Telecommunications","score_opus":0.029708930919617512,"score_gpt":0.2769009724109808,"score_spread":0.24719204149136326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988598963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02617551,0.0018814576,0.96973765,0.00027582486,0.00054369407,0.00077354984,0.0000016134694,0.00029864372,0.00031208317],"genre_scores_gemma":[0.8715068,0.00035357286,0.1276188,0.00015320208,0.00011477585,0.0001953724,0.000017515638,0.000018299286,0.000021649983],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856615,0.00013798734,0.00044491424,0.0003807135,0.00011961906,0.00035060322],"domain_scores_gemma":[0.99710447,0.0004843105,0.00016901968,0.002001416,0.00012826278,0.00011253697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008314166,0.00016924755,0.00020488695,0.00019718333,0.00032563414,0.00015663408,0.0012668279,0.00015139458,2.1667708e-7],"category_scores_gemma":[0.00000834832,0.00018749996,0.000066429224,0.00053654,0.00006650419,0.00038022496,0.00069846626,0.00033176574,0.0000051194993],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018281342,0.00013559165,0.00044249694,0.00002439295,0.00001510232,0.000004278099,0.00047401097,0.00097573386,0.0015200736,0.0049126614,0.00017908789,0.9912983],"study_design_scores_gemma":[0.0006575265,0.00008579379,0.015633339,0.00011726839,0.000013400229,0.000041995405,0.00005487336,0.9670551,0.00018255935,0.00010460098,0.015817394,0.00023613939],"about_ca_topic_score_codex":0.00002139807,"about_ca_topic_score_gemma":0.00068752933,"teacher_disagreement_score":0.99106216,"about_ca_system_score_codex":0.00021841927,"about_ca_system_score_gemma":0.000025761094,"threshold_uncertainty_score":0.76460266},"labels":[],"label_agreement":null},{"id":"W1989020533","doi":"10.1016/j.comcom.2012.03.010","title":"Research on secure data collection in wireless multimedia sensor networks","year":2012,"lang":"en","type":"article","venue":"Computer Communications","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Computer network; Wireless sensor network; Adversary; Node (physics); Data collection; Routing (electronic design automation); Scheme (mathematics); Wireless; Efficient energy use; Computer security; Telecommunications","score_opus":0.18755455498471038,"score_gpt":0.3940740306678586,"score_spread":0.20651947568314824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989020533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023351874,0.0019145,0.95941097,0.0073110946,0.0024732503,0.0011125006,0.000011841013,0.0006203428,0.0037936291],"genre_scores_gemma":[0.81291866,0.0005416383,0.18538877,0.00038406393,0.00049624575,0.00005766016,0.00014448992,0.000025851372,0.000042588254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959769,0.0016134912,0.00045009045,0.0005724868,0.00051529723,0.0008716971],"domain_scores_gemma":[0.9874806,0.0027285526,0.00011476414,0.009210689,0.0002333188,0.00023208106],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0021844977,0.00022033718,0.0002688718,0.00050690566,0.00062569196,0.00026338047,0.008570259,0.00023482203,0.000008419539],"category_scores_gemma":[0.000055606237,0.00023744444,0.000048540078,0.002445972,0.00026277185,0.00091684895,0.0061029657,0.0016496895,0.00016804339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007388615,0.006222382,0.025982874,0.00006273633,0.0002031484,0.000034666202,0.020043083,0.03812159,0.00009142837,0.30551898,0.18487553,0.4187697],"study_design_scores_gemma":[0.00035877535,0.000045443736,0.009272092,0.00008850987,0.0000035361838,0.000019702198,0.00008387246,0.97948265,0.000015780337,0.00016157686,0.010231576,0.00023648108],"about_ca_topic_score_codex":0.00014976381,"about_ca_topic_score_gemma":0.00023064135,"teacher_disagreement_score":0.94136107,"about_ca_system_score_codex":0.00022479816,"about_ca_system_score_gemma":0.00007907142,"threshold_uncertainty_score":0.99679387},"labels":[],"label_agreement":null},{"id":"W1992238700","doi":"10.1016/j.comcom.2008.05.002","title":"Performance implications of fluctuating server capacity","year":2008,"lang":"en","type":"article","venue":"Computer Communications","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Blocking (statistics); Context (archaeology); Set (abstract data type); Capacity planning; Service (business); Distributed computing; Computer network; Operating system","score_opus":0.06359400232272992,"score_gpt":0.25381670557372843,"score_spread":0.1902227032509985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992238700","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95281976,0.000073221425,0.034083273,0.0013105449,0.000064892774,0.00014124915,0.0000026677553,0.00018213563,0.01132222],"genre_scores_gemma":[0.96557677,0.000038117898,0.033596862,0.0005142529,0.00015170827,0.00002029516,0.000038175356,0.00001328641,0.000050544037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993165,0.000022022976,0.00029539235,0.0001398357,0.0000941998,0.00013204687],"domain_scores_gemma":[0.9976639,0.00011874259,0.00025481838,0.001669204,0.0002845301,0.00000878378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018827419,0.000098792094,0.00015860838,0.00015492893,0.00060306385,0.000022824615,0.0010371567,0.000029879178,0.00004177712],"category_scores_gemma":[0.000043870554,0.00010347789,0.000080524536,0.0006311114,0.00023944344,0.000716444,0.00066604995,0.00013196246,0.00010584305],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015694259,0.00068206404,0.3566883,0.00025183253,0.0002301019,8.7525734e-7,0.0011690407,0.02896448,0.0021486653,0.5627265,0.0032324481,0.043889996],"study_design_scores_gemma":[0.00041246135,0.000012332294,0.39251593,0.00009249664,0.00011638613,0.000015255339,0.00005240828,0.5679456,0.0001742012,0.01665898,0.02156931,0.00043463707],"about_ca_topic_score_codex":0.00006605499,"about_ca_topic_score_gemma":0.000028758246,"teacher_disagreement_score":0.54606754,"about_ca_system_score_codex":0.000021608581,"about_ca_system_score_gemma":0.000013389451,"threshold_uncertainty_score":0.46383405},"labels":[],"label_agreement":null},{"id":"W1992851965","doi":"10.1016/j.comcom.2012.07.008","title":"Two-stage report generation in long-reach EPON for enhanced delay performance","year":2012,"lang":"en","type":"article","venue":"Computer Communications","topic":"Advanced Photonic Communication Systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Stage (stratigraphy); Real-time computing","score_opus":0.055411169270611016,"score_gpt":0.31506898749491624,"score_spread":0.2596578182243052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992851965","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23456676,0.0022866451,0.7569953,0.00010162937,0.00049219985,0.000813078,0.000010541508,0.00031817032,0.004415658],"genre_scores_gemma":[0.87740374,0.00030390237,0.120802306,0.000038449252,0.00015901243,0.0005892773,0.00048673348,0.000040084138,0.00017651085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874705,0.00009657397,0.00058423606,0.00015067926,0.00010867891,0.0003127949],"domain_scores_gemma":[0.9965009,0.0002066862,0.00011920843,0.0029861035,0.00010621389,0.000080889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005359203,0.00016714547,0.00021029981,0.00013232845,0.00018596613,0.000035891742,0.0008916866,0.00006902625,0.000010437942],"category_scores_gemma":[0.00002025929,0.00019389547,0.00005975509,0.00027269725,0.000048624555,0.0004838311,0.00027059834,0.00025455223,0.000029438868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025845178,0.000794156,0.01894234,0.00039663212,0.00020734812,0.000003884686,0.010297995,0.79065305,0.038004193,0.014115133,0.002655802,0.12390361],"study_design_scores_gemma":[0.00052932015,0.000015478741,0.003823975,0.000046945817,0.000009215804,0.000046438174,0.00004288078,0.93734497,0.0049480787,0.000018403682,0.052895647,0.00027865582],"about_ca_topic_score_codex":0.00001918617,"about_ca_topic_score_gemma":0.00017105095,"teacher_disagreement_score":0.642837,"about_ca_system_score_codex":0.00022659046,"about_ca_system_score_gemma":0.000023746723,"threshold_uncertainty_score":0.7906828},"labels":[],"label_agreement":null},{"id":"W1999405276","doi":"10.1016/j.comcom.2004.01.003","title":"Node density and connectivity properties of the random waypoint model","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Waypoint; Mobility model; Computer science; Mobile ad hoc network; Node (physics); Rectangle; Boundary (topology); Routing (electronic design automation); Topology (electrical circuits); Component (thermodynamics); Focus (optics); Connected component; Computer network; Statistical physics; Mathematics; Geometry; Physics; Real-time computing; Network packet; Artificial intelligence; Mathematical analysis","score_opus":0.0373448298187891,"score_gpt":0.23086757351019366,"score_spread":0.19352274369140454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999405276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11387871,0.0005095951,0.8803548,0.004549238,0.00008743618,0.00028347547,8.192861e-7,0.00007581131,0.00026006135],"genre_scores_gemma":[0.8490221,0.00006308632,0.15049598,0.00036622057,0.00001376163,0.000023766383,4.4426392e-7,0.0000050522945,0.000009632917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915624,0.00016606823,0.00021254405,0.00019768362,0.0001304998,0.0001369614],"domain_scores_gemma":[0.996575,0.00012036087,0.00010823117,0.0030240894,0.00012659788,0.000045751236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026155682,0.00010244038,0.00017382568,0.000028338487,0.00033908326,0.00006958034,0.00225055,0.000042226875,2.6634262e-7],"category_scores_gemma":[0.0000229617,0.00007318081,0.00006700633,0.00020328021,0.00031479346,0.00023361214,0.0031764614,0.00020752294,0.0000030106305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021134918,0.00058919576,0.0011259682,0.00005389299,0.00009137903,8.652257e-7,0.007991267,0.28999293,0.004546132,0.67550486,0.00041894274,0.019663444],"study_design_scores_gemma":[0.00068531,0.000013329635,0.0023957256,0.00007365768,0.000008342535,0.00001516588,0.0000066095035,0.9796081,0.0023758817,0.014627968,0.00009117752,0.00009873426],"about_ca_topic_score_codex":0.00007986068,"about_ca_topic_score_gemma":0.00010745962,"teacher_disagreement_score":0.73514336,"about_ca_system_score_codex":0.00003882232,"about_ca_system_score_gemma":0.00009797042,"threshold_uncertainty_score":0.41821194},"labels":[],"label_agreement":null},{"id":"W2002154183","doi":"10.1016/j.comcom.2007.03.008","title":"An agent based and biological inspired real-time intrusion detection and security model for computer network operations","year":2007,"lang":"en","type":"article","venue":"Computer Communications","topic":"Artificial Immune Systems Applications","field":"Engineering","cited_by":76,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Division of Computer and Network Systems","keywords":"Computer science; Intrusion detection system; Artificial immune system; Host-based intrusion detection system; Mobile agent; Anomaly-based intrusion detection system; Network security; Computer security; Computer network; Distributed computing; Artificial intelligence; Intrusion prevention system","score_opus":0.0370618672097082,"score_gpt":0.27266223278034474,"score_spread":0.23560036557063654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002154183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18937746,0.00013330062,0.80926293,0.00012123131,0.00007377181,0.0005971387,0.000015582704,0.00034752194,0.000071087925],"genre_scores_gemma":[0.7540721,0.000084831045,0.24540177,0.00006573348,0.00012948223,0.00011259041,0.00011156377,0.000019271129,0.0000026026362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910367,0.00007497765,0.0003570475,0.00020737182,0.000053032483,0.0002039292],"domain_scores_gemma":[0.9986361,0.00020701288,0.00003632944,0.00091407704,0.000097903314,0.000108529246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041292008,0.00014479802,0.0001718746,0.000076284996,0.0006340927,0.000089351124,0.00030379026,0.00011772844,0.0000018285226],"category_scores_gemma":[0.0000052538685,0.00015137636,0.00003393617,0.0001636034,0.00011519819,0.00014347406,0.00018674132,0.00013596432,0.0000049930945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020194544,0.00021358818,0.00041068305,0.000039342314,0.00005182406,2.962375e-7,0.001895364,0.87237537,0.030570578,0.007660403,0.0005320494,0.08623032],"study_design_scores_gemma":[0.00019780123,0.00006318421,0.0042735212,0.000016648562,0.000013003071,0.0000032752541,0.000012001229,0.9933927,0.00016371266,0.00055183517,0.0011481099,0.00016419367],"about_ca_topic_score_codex":0.00004519546,"about_ca_topic_score_gemma":0.0004092785,"teacher_disagreement_score":0.5646947,"about_ca_system_score_codex":0.000053199663,"about_ca_system_score_gemma":0.000012971366,"threshold_uncertainty_score":0.6172949},"labels":[],"label_agreement":null},{"id":"W2003331630","doi":"10.1016/j.comcom.2012.03.013","title":"A hybrid nature-inspired optimizer for wireless mesh networks design","year":2012,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Wireless mesh network; Software deployment; Particle swarm optimization; Throughput; Distributed computing; Genetic algorithm; Network performance; Network planning and design; Key (lock); Wireless network; Mathematical optimization; Wireless; Computer network; Machine learning","score_opus":0.03817291486835299,"score_gpt":0.28048897545014223,"score_spread":0.24231606058178923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003331630","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012354452,0.0020699163,0.9929257,0.0015179578,0.0012740282,0.0010385251,0.0000044335015,0.00052172516,0.00052415754],"genre_scores_gemma":[0.4355133,0.00016178214,0.5621902,0.001214625,0.0003917985,0.0004151193,0.000035058005,0.00002666577,0.000051490624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977988,0.00041177904,0.0004421558,0.00040271156,0.00020350721,0.00074103056],"domain_scores_gemma":[0.9929769,0.0014004724,0.00020801972,0.004911515,0.00022977567,0.00027330391],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00087836385,0.0002805153,0.00032937803,0.000107982676,0.0005981911,0.00028467,0.005777653,0.00018894827,0.0000066674593],"category_scores_gemma":[0.000021933383,0.0002865205,0.00018730886,0.00040058547,0.00013648388,0.000855365,0.0022556437,0.00062360225,0.000036429068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019268677,0.0006305811,0.00024128231,0.000016459919,0.00016456365,0.00000187877,0.00064531167,0.030343281,0.000022493601,0.6852755,0.09109913,0.19154027],"study_design_scores_gemma":[0.0004705436,0.000055663673,0.00032217256,0.000034715704,0.000022105494,0.000029197065,0.0000027014241,0.96939147,0.00008266751,0.0013739375,0.027885767,0.00032906502],"about_ca_topic_score_codex":0.0000048911143,"about_ca_topic_score_gemma":0.0000021361311,"teacher_disagreement_score":0.9390482,"about_ca_system_score_codex":0.000094483294,"about_ca_system_score_gemma":0.00007602044,"threshold_uncertainty_score":0.9999587},"labels":[],"label_agreement":null},{"id":"W2003347881","doi":"10.1016/j.comcom.2014.05.010","title":"Femtocaching in video content delivery: Assignment of video clips to serve dynamic mobile users","year":2014,"lang":"en","type":"article","venue":"Computer Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Femtocell; Popularity; Video tracking; Computer network; Cache; CLIPS; Wireless network; Multimedia; Wireless; Video processing; Artificial intelligence; Base station; Telecommunications","score_opus":0.04177133278151858,"score_gpt":0.26930755080577007,"score_spread":0.2275362180242515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003347881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34269702,0.00020510529,0.6546481,0.0015032905,0.00022506357,0.0003947424,0.000005134537,0.0001357035,0.00018584814],"genre_scores_gemma":[0.92272246,0.000047955782,0.07594178,0.0010754183,0.000021945985,0.00011732337,0.000018985225,0.000014825076,0.000039325376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777603,0.0006287588,0.0005742732,0.00044769433,0.00027059633,0.0003026438],"domain_scores_gemma":[0.99541134,0.00040621046,0.00017277381,0.0036705325,0.00016475204,0.00017437503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086773594,0.00019622695,0.00032961616,0.00029544625,0.0002075229,0.00015546389,0.0038762658,0.000065654356,0.000002486356],"category_scores_gemma":[0.00003302062,0.00020589143,0.00012020248,0.00043988126,0.00006874327,0.00052728143,0.0020426526,0.00030952756,0.000036177327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000751979,0.0028858418,0.022982895,0.00009904619,0.00020677707,0.000010009407,0.01547022,0.13012019,0.019885221,0.08798149,0.0016843565,0.7185987],"study_design_scores_gemma":[0.00053378084,0.00035107712,0.016041804,0.0001538417,0.00001031919,0.000006139786,0.00013472952,0.9789966,0.00009741639,0.0004914837,0.002914021,0.00026879756],"about_ca_topic_score_codex":0.0007765221,"about_ca_topic_score_gemma":0.00077337684,"teacher_disagreement_score":0.8488764,"about_ca_system_score_codex":0.00016604668,"about_ca_system_score_gemma":0.00005708802,"threshold_uncertainty_score":0.83960086},"labels":[],"label_agreement":null},{"id":"W2007990153","doi":"10.1016/j.comcom.2007.06.008","title":"WLAN VoIP capacity allocation using an adaptive voice packetization server","year":2007,"lang":"en","type":"article","venue":"Computer Communications","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Voice over IP; Computer network; Header; Network packet; Latency (audio); Session Initiation Protocol; Real-time computing; Server; The Internet; Telecommunications; Operating system","score_opus":0.1321645901741819,"score_gpt":0.3250485799098534,"score_spread":0.19288398973567153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007990153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0132099055,0.000063981985,0.9839791,0.00053055957,0.00018852447,0.0013272939,0.000002449639,0.00026569678,0.00043250382],"genre_scores_gemma":[0.5967583,0.000010848589,0.40256962,0.00036803467,0.00015926901,0.00008214403,0.000028945318,0.00001192189,0.000010891342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983878,0.0003503359,0.0003740107,0.00034688594,0.00023181834,0.00030911912],"domain_scores_gemma":[0.9961775,0.00023789715,0.00020486354,0.0028658784,0.00035677603,0.00015708634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000923963,0.00017133684,0.00016093085,0.0001289595,0.000577894,0.00025402085,0.0025689453,0.00011061138,0.0000040229775],"category_scores_gemma":[0.000010358383,0.00018246286,0.00005860693,0.00068844337,0.00010846195,0.0011329704,0.0008162268,0.00027027744,0.00003350518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038740596,0.0014439593,0.005465271,0.00004542626,0.00011873361,0.0000060953025,0.010134381,0.029359048,0.0017875088,0.69635963,0.0008693043,0.25437188],"study_design_scores_gemma":[0.00021662215,0.00009876097,0.012050012,0.00005286057,0.000007962011,0.000012807119,0.000029799645,0.9790206,0.00017492,0.0037394308,0.0043513337,0.00024491735],"about_ca_topic_score_codex":0.00017762529,"about_ca_topic_score_gemma":0.00052285683,"teacher_disagreement_score":0.94966155,"about_ca_system_score_codex":0.000117187716,"about_ca_system_score_gemma":0.000073789655,"threshold_uncertainty_score":0.74406195},"labels":[],"label_agreement":null},{"id":"W2008826916","doi":"10.1016/j.comcom.2010.01.027","title":"Hierarchical distributed data classification in wireless sensor networks","year":2010,"lang":"en","type":"article","venue":"Computer Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Wireless sensor network; Distributed computing; Classifier (UML); Overhead (engineering); Decision tree; Data classification; Tree (set theory); Data mining; Machine learning; Computer network; Artificial intelligence","score_opus":0.05487446410367642,"score_gpt":0.2922393677301744,"score_spread":0.23736490362649798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008826916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019596105,0.0000797031,0.9723419,0.0058520734,0.000810345,0.000237463,0.000023470036,0.00041599828,0.0006429503],"genre_scores_gemma":[0.71206194,0.00008321824,0.2864572,0.00023680272,0.0001678742,0.000025152625,0.00093635387,0.000017205384,0.000014203071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975377,0.00040366425,0.00056288025,0.0007495855,0.00026713478,0.00047907143],"domain_scores_gemma":[0.98727053,0.0008555363,0.00017963651,0.011375972,0.00014108028,0.00017722645],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00064116716,0.0002304149,0.00026434538,0.0001984985,0.00034457535,0.00032426103,0.011281918,0.00021998749,0.000005914337],"category_scores_gemma":[0.00004874014,0.00024302627,0.000055918274,0.0012339606,0.00032632457,0.0005665131,0.005421642,0.0014048825,0.00003456015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001079187,0.0012512516,0.009325227,0.0000108372915,0.000045913654,0.000020698371,0.00038242628,0.083001874,0.0012077877,0.6727773,0.0050412538,0.22692466],"study_design_scores_gemma":[0.0002940327,0.000013644104,0.030113703,0.000025614218,0.000004667776,0.000022972841,0.0000061759383,0.958053,0.000013636206,0.00023091705,0.01096816,0.0002534851],"about_ca_topic_score_codex":0.00004036866,"about_ca_topic_score_gemma":0.00052241056,"teacher_disagreement_score":0.87505114,"about_ca_system_score_codex":0.000049956267,"about_ca_system_score_gemma":0.00008777661,"threshold_uncertainty_score":0.9940675},"labels":[],"label_agreement":null},{"id":"W2009892311","doi":"10.1016/j.comcom.2007.12.024","title":"Mobile data collector strategy for delay-sensitive applications over wireless sensor networks","year":2008,"lang":"en","type":"article","venue":"Computer Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Wireless sensor network; Network packet; Bottleneck; Routing protocol; Beacon; Key distribution in wireless sensor networks; Real-time computing; Wireless network; Wireless; Embedded system; Telecommunications","score_opus":0.06773267522109774,"score_gpt":0.2988355182497789,"score_spread":0.23110284302868114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009892311","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020061946,0.00088490866,0.99374515,0.00026150412,0.00028199158,0.0013849951,0.0001036478,0.00054873613,0.0007828566],"genre_scores_gemma":[0.4431734,0.0006469106,0.5536346,0.00045466414,0.000344202,0.0006474581,0.00071466196,0.00004478133,0.0003393402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739194,0.0002797253,0.00056966307,0.0009094348,0.0002725085,0.00057673076],"domain_scores_gemma":[0.98875254,0.0012624953,0.0002729639,0.009041421,0.00045943997,0.00021115901],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.00029164588,0.0003279498,0.0003833168,0.0001665246,0.0014679071,0.0002089352,0.007260376,0.00018248205,0.0000041190187],"category_scores_gemma":[0.000010876933,0.00035660216,0.00013236319,0.0011043297,0.0003951032,0.0005048844,0.0035054772,0.0004064695,0.000029014875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001462789,0.0007649107,0.0002048955,0.000018289076,0.0001437799,0.000012895339,0.00065107766,0.89015543,0.00007569705,0.04313736,0.03156135,0.033259694],"study_design_scores_gemma":[0.00046526396,0.00009337202,0.00039328713,0.000018458435,0.000020935304,0.000087233355,0.000018567094,0.9338109,0.000029561916,0.00005609524,0.06463315,0.0003731571],"about_ca_topic_score_codex":0.000041971565,"about_ca_topic_score_gemma":0.000066690234,"teacher_disagreement_score":0.44116724,"about_ca_system_score_codex":0.000106120235,"about_ca_system_score_gemma":0.00020228628,"threshold_uncertainty_score":0.9998886},"labels":[],"label_agreement":null},{"id":"W2010673451","doi":"10.1016/j.comcom.2006.01.017","title":"Activity scheduling based on cross-layer information in Bluetooth sensor networks","year":2006,"lang":"en","type":"article","venue":"Computer Communications","topic":"Bluetooth and Wireless Communication Technologies","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Network packet; Wireless sensor network; Scatternet; Sink (geography); Bluetooth; Network congestion; Computer network; Scheduling (production processes); Real-time computing; Packet loss; Wireless; Telecommunications","score_opus":0.026673386825679983,"score_gpt":0.27567248563440444,"score_spread":0.24899909880872445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010673451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029424522,0.00013875417,0.96039116,0.005188055,0.00015552875,0.00028564635,0.0000036288434,0.00082458224,0.0035881107],"genre_scores_gemma":[0.73354733,0.000044033237,0.26562056,0.000644022,0.000027065054,0.00006452324,0.0000322728,0.00000801184,0.0000121859775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984593,0.00023721997,0.00046987162,0.0002585578,0.00022515519,0.00034993718],"domain_scores_gemma":[0.99407136,0.0005630064,0.00024217395,0.0048994147,0.00017118538,0.000052856536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004132717,0.00021149263,0.00021231352,0.00045782456,0.00043514467,0.00057260954,0.004346468,0.00018358153,0.0000030751316],"category_scores_gemma":[0.000043247837,0.00021966168,0.0000880691,0.0009696821,0.00020087998,0.0014150938,0.0013962673,0.00066193845,0.00006184589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012479819,0.0004504641,0.011434185,0.0000126541045,0.000007634664,0.0000012652669,0.000109268636,0.79608935,0.000043461074,0.07033009,0.0007087895,0.12080036],"study_design_scores_gemma":[0.00047913214,0.000037369246,0.060083527,0.000044588214,0.0000017603717,0.0000018330317,0.0000060134735,0.93335336,0.0002612973,0.0007293078,0.004780785,0.00022103316],"about_ca_topic_score_codex":0.00016440575,"about_ca_topic_score_gemma":0.000060392802,"teacher_disagreement_score":0.7041228,"about_ca_system_score_codex":0.0001253442,"about_ca_system_score_gemma":0.00008587903,"threshold_uncertainty_score":0.89575434},"labels":[],"label_agreement":null},{"id":"W2011854146","doi":"10.1016/j.comcom.2006.03.003","title":"An efficient parallel optimization algorithm for the Token Bucket control mechanism","year":2006,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Token bucket; Security token; Leaky bucket; Quality of service; Throughput; Algorithm; Distributed computing; Computer network","score_opus":0.013492306842777448,"score_gpt":0.24038065960815022,"score_spread":0.22688835276537278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011854146","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016105267,0.0006011277,0.9911406,0.0064601693,0.00041348778,0.00083205954,0.000015360067,0.00036903535,0.00015203426],"genre_scores_gemma":[0.2725925,0.000036495894,0.72566545,0.0009741561,0.00028091195,0.000335837,0.000051403335,0.000012692749,0.000050531267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868697,0.0002213589,0.0003256026,0.00030788148,0.00017861383,0.0002795454],"domain_scores_gemma":[0.9962176,0.000748793,0.00014098924,0.00255936,0.0002611026,0.000072173105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043759614,0.00016380247,0.00016844361,0.00006303002,0.00086656405,0.00035546834,0.0033458425,0.00006724749,0.0000052907258],"category_scores_gemma":[0.000005064645,0.0001313858,0.00010749872,0.00025577532,0.00009197514,0.00020849441,0.00027152372,0.00015090873,0.000013926706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016620243,0.00011323811,0.0000022983227,6.4869727e-7,0.00001546922,1.9206614e-7,0.00004998529,0.5618439,0.0000021188268,0.23317996,0.00089867105,0.2038919],"study_design_scores_gemma":[0.0010087781,0.00007027535,0.00011507592,0.0000066895595,0.00002893511,0.0000066730454,0.000008520269,0.98814774,0.0000026951284,0.003110569,0.007329859,0.00016419473],"about_ca_topic_score_codex":0.000029108078,"about_ca_topic_score_gemma":0.000015854746,"teacher_disagreement_score":0.42630386,"about_ca_system_score_codex":0.000037460144,"about_ca_system_score_gemma":0.0000631164,"threshold_uncertainty_score":0.66649973},"labels":[],"label_agreement":null},{"id":"W2012502281","doi":"10.1016/j.comcom.2008.01.049","title":"A joint selfish routing and channel assignment game in wireless mesh networks","year":2008,"lang":"en","type":"article","venue":"Computer Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Nash equilibrium; Routing (electronic design automation); Mathematical optimization; Wireless mesh network; Computer network; Channel (broadcasting); Best response; Game theory; Heuristic; Distributed computing; Wireless; Wireless network; Mathematical economics; Telecommunications; Mathematics","score_opus":0.07761816825018782,"score_gpt":0.2696275960658492,"score_spread":0.19200942781566138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012502281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011981725,0.0011193706,0.9801368,0.004879563,0.00015795919,0.00031452486,7.5094533e-7,0.00023136337,0.0011779347],"genre_scores_gemma":[0.9530384,0.0077513163,0.0380463,0.00095504866,0.00005755539,0.00007447379,0.000011447276,0.0000137367015,0.000051742798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816054,0.0004993102,0.00047116439,0.00036873925,0.00016672396,0.00033352105],"domain_scores_gemma":[0.9966237,0.0003152906,0.00014588531,0.002660361,0.00012417328,0.00013062147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051566283,0.00019684368,0.0002808541,0.00016939885,0.0006103365,0.0001636765,0.0023683358,0.00007591236,0.0000039725956],"category_scores_gemma":[0.000017134475,0.00020979725,0.000058565376,0.0006965653,0.0001932856,0.00040978618,0.0038345046,0.0004949017,0.000010116848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009018496,0.0011524103,0.010420531,0.00002255267,0.00012374221,0.000041911087,0.027549515,0.0058024838,0.00028628227,0.6213069,0.005946453,0.32733822],"study_design_scores_gemma":[0.00041636615,0.00003306233,0.024622567,0.00009283876,0.0000028669706,0.000057614325,0.000025276599,0.9726041,0.000017453474,0.00030351512,0.0015874567,0.000236863],"about_ca_topic_score_codex":0.000017093957,"about_ca_topic_score_gemma":0.00008083864,"teacher_disagreement_score":0.96680164,"about_ca_system_score_codex":0.00010464614,"about_ca_system_score_gemma":0.00006595732,"threshold_uncertainty_score":0.8555283},"labels":[],"label_agreement":null},{"id":"W2013344829","doi":"10.1016/j.comcom.2008.06.005","title":"A mailbox ownership based mechanism for curbing spam","year":2008,"lang":"en","type":"article","venue":"Computer Communications","topic":"Spam and Phishing Detection","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University; University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mechanism (biology); Computer security; Computer network; World Wide Web","score_opus":0.10198736336459623,"score_gpt":0.2751654283071683,"score_spread":0.17317806494257204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013344829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013054775,0.00008853399,0.99089366,0.005772564,0.00050780753,0.00027524857,0.0000033311278,0.00045304725,0.00070032116],"genre_scores_gemma":[0.5021044,0.000018644045,0.49652296,0.0010931477,0.000091328046,0.00008051107,0.0000122470865,0.000009872751,0.000066874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990006,0.00012283667,0.00021872,0.0002782005,0.00014729238,0.00023235678],"domain_scores_gemma":[0.99669254,0.00045181566,0.00010089766,0.002475271,0.00019092126,0.000088542925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024666762,0.00012879464,0.00013735567,0.0001438249,0.00083121663,0.00013103298,0.0026023001,0.000068437126,0.0000038660737],"category_scores_gemma":[0.000039609327,0.00013126036,0.000120098135,0.00037051472,0.00007073069,0.00035056134,0.0005028629,0.00017861338,0.000045494202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009488488,0.00031273247,0.00040550294,0.000029728524,0.000044289343,0.0000043721643,0.0021318453,0.0006080919,0.00077410997,0.94977987,0.010155233,0.035744734],"study_design_scores_gemma":[0.00043423835,0.00009472699,0.0005113201,0.00002664566,0.0000074527284,0.000031493502,0.000005505138,0.95698816,0.0010044245,0.018497614,0.022193287,0.00020513129],"about_ca_topic_score_codex":0.0000313097,"about_ca_topic_score_gemma":0.000015619453,"teacher_disagreement_score":0.95638007,"about_ca_system_score_codex":0.00005339639,"about_ca_system_score_gemma":0.000091222224,"threshold_uncertainty_score":0.63931304},"labels":[],"label_agreement":null},{"id":"W2015113058","doi":"10.1016/j.comcom.2007.10.030","title":"Algorithmic and theoretical aspects of wireless ad hoc and sensor networks","year":2007,"lang":"en","type":"article","venue":"Computer Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Wireless ad hoc network; Wireless sensor network; Mobile ad hoc network; Computer network; Ad hoc wireless distribution service; Wireless; Distributed computing; Optimized Link State Routing Protocol; Telecommunications","score_opus":0.011220536404758268,"score_gpt":0.2427857756097639,"score_spread":0.23156523920500563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015113058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047541495,0.0036682347,0.94604903,0.0009904354,0.00017253196,0.00015181309,0.0000012554989,0.00014393145,0.0012812886],"genre_scores_gemma":[0.7085748,0.0011468424,0.29004374,0.00015964913,0.000048119233,0.0000032426976,0.000004348987,0.000011444017,0.0000078432995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861145,0.00017447108,0.00036813895,0.00034314799,0.00017510582,0.00032767886],"domain_scores_gemma":[0.9965749,0.0010490069,0.00013725027,0.0019400354,0.00013593821,0.00016290681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005283579,0.00017303304,0.00025283793,0.000133949,0.00024034946,0.000100212696,0.001417669,0.0001157784,0.0000018223856],"category_scores_gemma":[0.000011475883,0.00017044373,0.000045545574,0.00041966836,0.0008612008,0.00014595923,0.0017901375,0.00031369214,0.0000018971513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042358774,0.00009338972,0.00019974113,0.000007661191,0.000022978884,0.0000058452792,0.00043879542,0.0023230643,0.000078001816,0.79830897,0.000045273307,0.19847207],"study_design_scores_gemma":[0.00030666444,0.00007926442,0.0048234942,0.000060871178,0.00001088256,0.00007289495,0.000025713902,0.99110687,0.0001245841,0.0021401339,0.001055915,0.00019271212],"about_ca_topic_score_codex":0.000004942562,"about_ca_topic_score_gemma":0.000019206553,"teacher_disagreement_score":0.9887838,"about_ca_system_score_codex":0.000021838807,"about_ca_system_score_gemma":0.000022226419,"threshold_uncertainty_score":0.69504935},"labels":[],"label_agreement":null},{"id":"W2015249265","doi":"10.1016/j.comcom.2009.05.015","title":"Cross-layer link adaptation design for UWB-based sensor networks","year":2009,"lang":"en","type":"article","venue":"Computer Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Defence Research and Development Canada","funders":"","keywords":"Computer science; Computer network; Wireless sensor network; Node (physics); Energy consumption; Cross-layer optimization; Routing protocol; Routing (electronic design automation); Wireless ad hoc network; Efficient energy use; Physical layer; Data link layer; Distributed computing; Network layer; Link layer; Wireless; Wireless network; Layer (electronics); Telecommunications","score_opus":0.08192631464434134,"score_gpt":0.3088783180690168,"score_spread":0.22695200342467542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015249265","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027829377,0.00048906216,0.9905976,0.0066340803,0.0004651206,0.0005838364,0.0000027034225,0.0006457227,0.00030359626],"genre_scores_gemma":[0.378773,0.0000349441,0.61910677,0.0016725842,0.00021633324,0.000054545657,0.000050504994,0.000016462087,0.000074880714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792796,0.00034735128,0.00049724407,0.0005114518,0.00022687342,0.0004891437],"domain_scores_gemma":[0.9940963,0.0014129892,0.00023295326,0.0036551987,0.0004533076,0.00014927222],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005305873,0.00026234426,0.00025832577,0.00016891978,0.0007367958,0.0005254365,0.003550498,0.0001772056,0.0000034172588],"category_scores_gemma":[0.000036978265,0.00027824647,0.00017513444,0.00065416173,0.00012729877,0.00037332624,0.00034532248,0.0003189446,0.000021201677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009645484,0.00012850937,0.00002336503,0.0000023621938,0.000011672802,0.0000010210018,0.00017069982,0.87602055,0.000035721987,0.023720326,0.0009298834,0.09894623],"study_design_scores_gemma":[0.0006487245,0.00019360884,0.0010824117,0.000040926603,0.00001171389,0.0000052292326,0.0000024016606,0.9871356,0.00015224138,0.0008806577,0.009536291,0.0003101789],"about_ca_topic_score_codex":0.000006674213,"about_ca_topic_score_gemma":0.000006005517,"teacher_disagreement_score":0.3784947,"about_ca_system_score_codex":0.00008498572,"about_ca_system_score_gemma":0.00010161676,"threshold_uncertainty_score":0.999967},"labels":[],"label_agreement":null},{"id":"W2016250485","doi":"10.1016/s0140-3664(99)00227-3","title":"Test generation based on control and data dependencies within system specifications in SDL","year":2000,"lang":"en","type":"article","venue":"Computer Communications","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Instituto de Telecomunicações","keywords":"Computer science; Control flow; Data flow diagram; Programming language; Specification language; Extended finite-state machine; System requirements specification; Control (management); Test data; Finite-state machine; Distributed computing; Software engineering; Database; Artificial intelligence","score_opus":0.13848095803885363,"score_gpt":0.2977731457244659,"score_spread":0.15929218768561226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016250485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001942061,0.00024139177,0.98906696,0.0036420117,0.000086767046,0.0003379184,0.000032065644,0.0032727947,0.0013780574],"genre_scores_gemma":[0.605007,0.000018057424,0.39448246,0.00034517597,0.000037493013,0.00003766634,0.00005191741,0.000006373786,0.000013888236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871826,0.00022660989,0.00032673305,0.00041996414,0.00016037113,0.00014804336],"domain_scores_gemma":[0.9933405,0.0011895092,0.000085306405,0.005253809,0.00007100228,0.0000598678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061411876,0.00012942668,0.00014989369,0.0001655684,0.00032545518,0.000276641,0.0031159802,0.000054055323,0.0000028453505],"category_scores_gemma":[0.00011242318,0.00012963667,0.000017902048,0.00038078704,0.00008984855,0.0003324698,0.0004383057,0.0002034285,0.000030017276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002273226,0.002628459,0.07180318,0.0001245706,0.00006018369,0.000039595387,0.0038649687,0.029539607,0.0004978102,0.18981823,0.07195115,0.6296495],"study_design_scores_gemma":[0.00027901953,0.00005015544,0.010143236,0.00009212362,0.000004812064,0.000017351966,0.0000034146321,0.9875729,0.00001444644,0.0005274506,0.0011594938,0.00013559981],"about_ca_topic_score_codex":0.0000806289,"about_ca_topic_score_gemma":0.000113722184,"teacher_disagreement_score":0.95803326,"about_ca_system_score_codex":0.000060046394,"about_ca_system_score_gemma":0.00008000883,"threshold_uncertainty_score":0.5790318},"labels":[],"label_agreement":null},{"id":"W2017737452","doi":"10.1016/j.comcom.2004.08.015","title":"Markov chain analysis of collaborative codes in random multi access communication systems","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Aloha; Computer science; Asynchronous communication; Markov chain; Random access; Transmission (telecommunications); Computer network; Synchronizing; Throughput; Real-time computing; Telecommunications; Wireless","score_opus":0.060390661011432985,"score_gpt":0.3395680111710763,"score_spread":0.27917735015964334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017737452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008064406,0.008298536,0.9778289,0.003292644,0.000123709,0.0007785128,0.000022349483,0.00016516855,0.001425781],"genre_scores_gemma":[0.8195759,0.006182693,0.17373505,0.00018442092,0.000009512918,0.00016287326,0.00011493082,0.000010913956,0.000023708644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968196,0.0014173867,0.00090022775,0.00035942037,0.0002464309,0.00025690466],"domain_scores_gemma":[0.9920295,0.00097612635,0.0004644183,0.005743298,0.0006929598,0.00009372014],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0011609062,0.00022719619,0.00065634964,0.001031023,0.0004170873,0.0003683024,0.00799884,0.00009544119,0.000005999627],"category_scores_gemma":[0.00007978042,0.00023538344,0.00015605628,0.006599704,0.00029467675,0.00085550407,0.0036661697,0.00037095087,0.0000073721203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033901833,0.0015160205,0.009644902,0.000030545536,0.0010845294,0.0000026040298,0.013626149,0.30587965,0.00028047347,0.64127725,0.00030968478,0.02631427],"study_design_scores_gemma":[0.0022175005,0.000034666857,0.034511834,0.00018649643,0.00009541153,0.0000020875823,0.00015215625,0.96013707,0.00007481706,0.00035762604,0.0019362278,0.00029409016],"about_ca_topic_score_codex":0.00026678975,"about_ca_topic_score_gemma":0.002663783,"teacher_disagreement_score":0.81151146,"about_ca_system_score_codex":0.00020774156,"about_ca_system_score_gemma":0.00024933976,"threshold_uncertainty_score":0.99736834},"labels":[],"label_agreement":null},{"id":"W2018800372","doi":"10.1016/j.comcom.2012.05.012","title":"Understanding the impact of neighboring strategy in peer-to-peer multimedia streaming applications","year":2012,"lang":"en","type":"article","venue":"Computer Communications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Overlay; Network packet; Computer network; Overlay network; Peer-to-peer; Scheme (mathematics); Tree (set theory); Distributed computing; Swarm behaviour; Multimedia; The Internet; World Wide Web; Artificial intelligence","score_opus":0.1404437713445838,"score_gpt":0.35099369633971966,"score_spread":0.21054992499513586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018800372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008261313,0.00026388458,0.98170453,0.0065787896,0.0001040465,0.00069331896,0.000012199081,0.0002991104,0.002082834],"genre_scores_gemma":[0.78532374,0.000015443144,0.21427292,0.00007578709,0.00006831561,0.00017484797,0.000011954196,0.000014123838,0.000042871896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981515,0.0001530471,0.00045295924,0.00028509126,0.0003968027,0.00056059536],"domain_scores_gemma":[0.99464405,0.0008400143,0.00015175359,0.003929683,0.00025745702,0.00017705359],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0009126549,0.00021455812,0.00025145075,0.00043180716,0.00031406456,0.00016906942,0.005600264,0.00009108473,0.000003579438],"category_scores_gemma":[0.00009711043,0.00017579983,0.00010846125,0.002078078,0.0001488018,0.00052057166,0.0030541597,0.00043305085,0.000046656354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008807928,0.0011079517,0.07673909,0.000022698603,0.0002047595,0.0000017794301,0.01849782,0.14943002,0.0011994566,0.4071626,0.014779546,0.33084548],"study_design_scores_gemma":[0.00046184924,0.00016666201,0.21965982,0.00012641092,0.000019779403,0.00001963075,0.0010223037,0.76090574,0.00022747001,0.0107658105,0.005996757,0.0006277461],"about_ca_topic_score_codex":0.0002234494,"about_ca_topic_score_gemma":0.00011165995,"teacher_disagreement_score":0.7770624,"about_ca_system_score_codex":0.00043090363,"about_ca_system_score_gemma":0.000096885175,"threshold_uncertainty_score":0.99977994},"labels":[],"label_agreement":null},{"id":"W2021123566","doi":"10.1016/j.comcom.2014.12.004","title":"Resource allocation in multi-relay multi-user OFDM systems for heterogeneous traffic","year":2014,"lang":"en","type":"article","venue":"Computer Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Subgradient method; Relay; Resource allocation; Subcarrier; Mathematical optimization; Quality of service; Transmitter power output; Transmission (telecommunications); Optimization problem; Computer network; Power (physics); Orthogonal frequency-division multiplexing; Algorithm; Telecommunications; Channel (broadcasting)","score_opus":0.09055135908521074,"score_gpt":0.3130213031296813,"score_spread":0.22246994404447057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021123566","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020239227,0.0028004893,0.99061704,0.002950141,0.00026960747,0.00086118147,0.0000034424245,0.0003239114,0.00015025803],"genre_scores_gemma":[0.6460417,0.00068292045,0.35175696,0.0006123844,0.000059448736,0.0003894992,0.00006617441,0.00002683966,0.00036406607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974946,0.0009058749,0.0006255976,0.0004647561,0.00015553265,0.0003536469],"domain_scores_gemma":[0.9942349,0.0008552894,0.0002041085,0.0043091713,0.0002752381,0.00012126492],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094777055,0.00023654828,0.00030686476,0.00025354043,0.00055563054,0.0003219992,0.0046209083,0.000114100156,0.0000018132249],"category_scores_gemma":[0.0000831301,0.00025084036,0.00011494981,0.000596217,0.00011315397,0.00031861386,0.0014101741,0.00031570578,0.00004173619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012830527,0.0014577869,0.00049243524,0.00006644575,0.00008260563,0.0000010950832,0.0051418995,0.519387,0.00031913124,0.21284592,0.0042438917,0.25594893],"study_design_scores_gemma":[0.00091038755,0.000050140334,0.0007797744,0.000079815145,0.0000053265176,0.000007798656,0.000017000932,0.7988768,0.00001884263,0.000015081747,0.19901267,0.0002263093],"about_ca_topic_score_codex":0.000012878397,"about_ca_topic_score_gemma":0.00030497,"teacher_disagreement_score":0.6440178,"about_ca_system_score_codex":0.0001286056,"about_ca_system_score_gemma":0.000057067395,"threshold_uncertainty_score":0.9999944},"labels":[],"label_agreement":null},{"id":"W2021295533","doi":"10.1016/s0140-3664(99)00241-8","title":"Design of universal personal computing using SDL","year":2000,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Interfacing; Correctness; Common Object Request Broker Architecture; Interface (matter); Programming language; The Internet; Object (grammar); Distributed computing; Operating system; Software engineering; Computer hardware","score_opus":0.06575624644075903,"score_gpt":0.27205999695593036,"score_spread":0.20630375051517133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021295533","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053303717,0.00027501554,0.992219,0.00042866688,0.00011118686,0.00028454783,0.0000012934012,0.00016530433,0.0011846204],"genre_scores_gemma":[0.40921375,0.00006161495,0.59038043,0.00023138247,0.00004030247,0.0000029635605,0.0000053545014,0.000008870711,0.000055370656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985036,0.00039607484,0.00032872075,0.0002892725,0.00022217764,0.0002601076],"domain_scores_gemma":[0.9972181,0.00032023797,0.00013811712,0.0021525586,0.000093390925,0.000077596334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003623205,0.00014732593,0.00018973151,0.00013405866,0.00032927073,0.00009187011,0.0032929343,0.000040162187,0.000072696595],"category_scores_gemma":[0.000002582819,0.00016600883,0.00007967163,0.00060433336,0.00014739287,0.0002931194,0.0012990959,0.00016732082,0.000046119203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008481163,0.00029089797,0.00018311945,0.000021267184,0.000110234025,0.000009439241,0.0027702108,0.5363769,0.00018011482,0.026096882,0.0025799847,0.43137243],"study_design_scores_gemma":[0.00027137768,0.000050914397,0.00030634826,0.000050327195,0.000014595208,0.000009871361,0.000017405971,0.99374133,0.000033022003,0.00022675653,0.005123492,0.00015456001],"about_ca_topic_score_codex":0.000052095114,"about_ca_topic_score_gemma":0.0000021942253,"teacher_disagreement_score":0.4573644,"about_ca_system_score_codex":0.00012159325,"about_ca_system_score_gemma":0.00010191982,"threshold_uncertainty_score":0.67696434},"labels":[],"label_agreement":null},{"id":"W2023482149","doi":"10.1016/s0140-3664(99)00214-5","title":"Hop reservation multiple access for multichannel packet radio networks","year":2000,"lang":"en","type":"article","venue":"Computer Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Federation for the Humanities and Social Sciences","keywords":"Computer science; Reservation; Computer network; Hop (telecommunications); Network packet; Packet radio; Telecommunications","score_opus":0.11287943373040574,"score_gpt":0.35341183078089217,"score_spread":0.24053239705048643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023482149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002008806,0.0010010152,0.9822586,0.011617211,0.00022305039,0.0011560193,0.000012388601,0.0005476651,0.0011752286],"genre_scores_gemma":[0.5974294,0.0018447018,0.39792842,0.0008656188,0.00026833644,0.00076398655,0.00027446134,0.000042589134,0.00058252044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972547,0.00063935004,0.0006078137,0.0005488769,0.00033718953,0.0006120529],"domain_scores_gemma":[0.9885401,0.002518009,0.00017250447,0.008020389,0.00053101283,0.00021798638],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00087930565,0.0002600586,0.00030558644,0.00021524793,0.0011531973,0.0009157634,0.014189313,0.00016252417,0.000047505495],"category_scores_gemma":[0.000096908254,0.0002780123,0.00016890542,0.0012333838,0.0002328715,0.0015836157,0.003349101,0.0005377556,0.000078111974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051714214,0.00072916376,0.0018115311,0.000034258475,0.00012280462,0.0000015347883,0.001295871,0.1665698,0.000036862548,0.041703507,0.073617004,0.714026],"study_design_scores_gemma":[0.000785427,0.000050548617,0.004892648,0.000046813417,0.0000063508264,0.0000055831374,0.0000067997707,0.8981862,0.00002465508,0.0015530775,0.094167575,0.0002743185],"about_ca_topic_score_codex":0.00008577095,"about_ca_topic_score_gemma":0.00016868037,"teacher_disagreement_score":0.7316164,"about_ca_system_score_codex":0.00012455565,"about_ca_system_score_gemma":0.000109561646,"threshold_uncertainty_score":0.9999672},"labels":[],"label_agreement":null},{"id":"W2023801090","doi":"10.1016/j.comcom.2010.09.012","title":"Strategies for improving performance of IEEE 802.15.4/ZigBee WSNs with path-constrained mobile sink(s)","year":2010,"lang":"en","type":"article","venue":"Computer Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Chaining; Computer science; Computer network; Wireless sensor network; Sink (geography); Mobility model; NeuRFon; Energy consumption; Wireless; Distributed computing; Key distribution in wireless sensor networks; Wireless network; Telecommunications","score_opus":0.014320143599021165,"score_gpt":0.23688722006623217,"score_spread":0.222567076467211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023801090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2312107,0.00008472952,0.76651037,0.0002120245,0.00038624444,0.00042291562,0.000008793313,0.00022819273,0.00093604747],"genre_scores_gemma":[0.5988493,0.000014160563,0.40085974,0.000057274327,0.00006253552,0.0001094136,0.000014371304,0.000014738209,0.00001846182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854344,0.00007267417,0.00042018556,0.00037886915,0.00021185668,0.0003729941],"domain_scores_gemma":[0.99532974,0.00050263957,0.00029552093,0.0033729924,0.00040024886,0.000098844896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028870325,0.00022593014,0.00027860276,0.00013653208,0.00042318236,0.00022128595,0.003603979,0.00011338752,0.0000034920406],"category_scores_gemma":[0.000006964431,0.00020520554,0.000094705465,0.0004525758,0.00044987607,0.00058989954,0.0006063917,0.00042362703,0.000004927705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003995153,0.0009732223,0.001103683,0.00022510836,0.000119037424,0.0000038608837,0.0032380363,0.3113795,0.028196858,0.43041486,0.0006542261,0.22365166],"study_design_scores_gemma":[0.0004843687,0.0003565219,0.0004077373,0.000055160577,0.000015162693,0.000029145816,0.00007477392,0.9938136,0.0020416598,0.00018341278,0.0022680191,0.00027046519],"about_ca_topic_score_codex":0.000028471852,"about_ca_topic_score_gemma":0.00013555284,"teacher_disagreement_score":0.6824341,"about_ca_system_score_codex":0.000021018039,"about_ca_system_score_gemma":0.0003069693,"threshold_uncertainty_score":0.8368039},"labels":[],"label_agreement":null},{"id":"W2024136335","doi":"10.1016/j.comcom.2004.09.008","title":"Quality of service and performance issues in multiservice networks subject to voice and video traffics","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Subject (documents); Quality of service; Telecommunications; Quality (philosophy); Speech recognition; Service (business); Service quality; Voice over IP; Computer network; Voice communication; Multimedia; World Wide Web; The Internet","score_opus":0.06165164267954921,"score_gpt":0.3456657547847367,"score_spread":0.2840141121051875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024136335","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5638204,0.003621762,0.4071639,0.024435248,0.00006157312,0.00055603875,0.0000031832756,0.00014027808,0.00019757145],"genre_scores_gemma":[0.756981,0.0022230898,0.23993385,0.0007769222,0.000019080982,0.000042489395,0.0000075899948,0.000010286315,0.0000056601025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980775,0.00048393357,0.0005512135,0.00035327472,0.00023698637,0.00029709595],"domain_scores_gemma":[0.9950972,0.0008108422,0.00013965816,0.003475452,0.0003204421,0.00015640144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010120479,0.00016813184,0.0003124112,0.00021729978,0.0002528491,0.00015059333,0.003711828,0.000090304595,7.4203655e-7],"category_scores_gemma":[0.00003418789,0.00018341711,0.00002717833,0.0014443301,0.00014759773,0.0005398666,0.004414827,0.00042164305,0.00000836748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007431599,0.0010731089,0.04192072,0.00040872232,0.000079408914,0.0000023462567,0.025742909,0.37773895,0.00040810634,0.081280984,0.000236883,0.47103354],"study_design_scores_gemma":[0.00054891274,0.000061162005,0.27098688,0.00014871563,0.000001932363,0.000006058456,0.000045538967,0.72682375,0.000037933412,0.0002935705,0.0008701952,0.00017534147],"about_ca_topic_score_codex":0.001070554,"about_ca_topic_score_gemma":0.004080558,"teacher_disagreement_score":0.47085822,"about_ca_system_score_codex":0.0000632495,"about_ca_system_score_gemma":0.00007593054,"threshold_uncertainty_score":0.7479533},"labels":[],"label_agreement":null},{"id":"W2025422183","doi":"10.1016/j.comcom.2004.02.021","title":"Performance of Bluetooth bridge scheduling algorithms","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Bluetooth and Wireless Communication Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Bluetooth; Scheduling (production processes); Piconet; Bridge (graph theory); Scatternet; Algorithm; Rendezvous; Discrete event simulation; Network packet; Queue; Distributed computing; Real-time computing; Computer network; Wireless; Mathematical optimization; Simulation; Telecommunications","score_opus":0.046282830975346294,"score_gpt":0.27487089721279057,"score_spread":0.22858806623744427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025422183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11227192,0.0010985011,0.87914085,0.0050326325,0.00015627456,0.00018927392,0.0000034227603,0.0007479888,0.0013591426],"genre_scores_gemma":[0.54515463,0.00067234284,0.4539947,0.00012612299,0.000013114085,0.00001966724,0.0000064638343,0.0000066198913,0.000006356838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987757,0.00007232625,0.0004441038,0.0002555202,0.00020009252,0.00025221758],"domain_scores_gemma":[0.9936221,0.00014829774,0.00022596514,0.005709569,0.00022466597,0.00006936479],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00025663598,0.0001584515,0.00023212632,0.00022438742,0.0003455236,0.00009151146,0.0077510495,0.00009423937,0.0000017527755],"category_scores_gemma":[0.00002522231,0.00016204077,0.00009121926,0.00081155077,0.00034427797,0.00061977044,0.003214261,0.0003387004,0.00004704687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032720725,0.00048357417,0.0024822983,0.000044179335,0.000054947395,0.0000010431153,0.0013698887,0.008719275,0.00057717285,0.5164537,0.00013542506,0.46967527],"study_design_scores_gemma":[0.0012877078,0.00032768643,0.04530155,0.00028901928,0.000017175884,0.000047944028,0.00004931611,0.92207307,0.010942465,0.01185883,0.007173564,0.00063167134],"about_ca_topic_score_codex":0.00004567697,"about_ca_topic_score_gemma":0.00000900007,"teacher_disagreement_score":0.9133538,"about_ca_system_score_codex":0.00005678696,"about_ca_system_score_gemma":0.00014584119,"threshold_uncertainty_score":0.9976175},"labels":[],"label_agreement":null},{"id":"W2027089890","doi":"10.1016/j.comcom.2006.02.001","title":"Wireless sensor networks: Performance, reliability, security, and beyond","year":2006,"lang":"en","type":"article","venue":"Computer Communications","topic":"Biomedical and Engineering Education","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Wireless; Telecommunications; Reliability (semiconductor); Electrical engineering; Battery (electricity); Energy harvesting; Population; Power (physics); Engineering; Medicine","score_opus":0.006045053625772833,"score_gpt":0.1936588768918272,"score_spread":0.18761382326605436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027089890","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83719784,0.0025168445,0.14374834,0.002408998,0.0009192573,0.00025933207,0.000010696959,0.0011817721,0.011756904],"genre_scores_gemma":[0.98331636,0.0006506274,0.015631288,0.000050099254,0.0002153159,0.000019867584,0.000070908616,0.000016005735,0.000029507852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995209,0.000017388837,0.0001628783,0.00009481197,0.000060416227,0.0001436313],"domain_scores_gemma":[0.99917513,0.00007686851,0.000012845214,0.00065048924,0.00003030525,0.000054367018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008535317,0.00009429617,0.00009535362,0.000050901013,0.000113957176,0.000039442955,0.00028737253,0.000066232424,0.0000052612577],"category_scores_gemma":[0.0000013768223,0.00009622493,0.000020501646,0.00017397742,0.00011017718,0.00008815854,0.00017159573,0.00019038981,0.000011583166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008916435,0.0009956871,0.036413144,0.001904181,0.00016814219,0.0000028075967,0.002417913,0.44396874,0.0006425359,0.034452867,0.15798865,0.3210364],"study_design_scores_gemma":[0.000087511835,0.000009653525,0.018616669,0.00002398883,0.0000068049235,0.0000075094254,0.000009542221,0.9611643,0.000016998274,0.0003572299,0.019580936,0.000118867494],"about_ca_topic_score_codex":0.000015963495,"about_ca_topic_score_gemma":0.000008089779,"teacher_disagreement_score":0.5171955,"about_ca_system_score_codex":0.000028054435,"about_ca_system_score_gemma":0.0000057683596,"threshold_uncertainty_score":0.3923939},"labels":[],"label_agreement":null},{"id":"W2028067429","doi":"10.1016/j.comcom.2008.10.012","title":"QoS routing with traffic distribution in mobile ad hoc networks","year":2008,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer network; Computer science; Ad hoc On-Demand Distance Vector Routing; Distributed computing; Mobile ad hoc network; Optimized Link State Routing Protocol; Adaptive quality of service multi-hop routing; Routing protocol; Wireless Routing Protocol; Destination-Sequenced Distance Vector routing; Dynamic Source Routing; Network packet","score_opus":0.021641454277954168,"score_gpt":0.24010513500811817,"score_spread":0.218463680730164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028067429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03250214,0.005280019,0.9603698,0.00050690945,0.00021765043,0.0005124169,0.0000031689704,0.00037463475,0.00023324603],"genre_scores_gemma":[0.8858461,0.0020030078,0.111471914,0.00018348724,0.000104925166,0.00023541843,0.00010843632,0.000016829421,0.000029887959],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828523,0.00026414669,0.00040380325,0.00041505913,0.00020071132,0.00043104764],"domain_scores_gemma":[0.9960128,0.00034663305,0.00015346319,0.003259212,0.00011366531,0.00011423723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027374152,0.00020421286,0.00024730674,0.00007795846,0.000506852,0.000116486124,0.003137714,0.00009838228,0.0000039882634],"category_scores_gemma":[0.000006316489,0.00019876895,0.00006591033,0.0011000892,0.00021050253,0.00048469208,0.0012395656,0.0005376139,0.000027310127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010515521,0.0005251794,0.0024181162,0.000006089134,0.00003145661,0.000036844172,0.0022142008,0.51903236,0.000002802573,0.009874913,0.0041061146,0.46174142],"study_design_scores_gemma":[0.00046020324,0.00012691996,0.009859287,0.00006934643,0.0000043604095,0.0001025841,0.00001617588,0.9583679,0.000002453101,0.00003535327,0.030711899,0.00024351056],"about_ca_topic_score_codex":0.0000054802995,"about_ca_topic_score_gemma":0.0001339506,"teacher_disagreement_score":0.85334396,"about_ca_system_score_codex":0.00014610529,"about_ca_system_score_gemma":0.000097478514,"threshold_uncertainty_score":0.81055623},"labels":[],"label_agreement":null},{"id":"W2028884287","doi":"10.1016/j.comcom.2010.03.017","title":"QoSNET: An integrated QoS network for routing protocols in large scale wireless sensor networks","year":2010,"lang":"en","type":"article","venue":"Computer Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Computer network; Multipath routing; Routing protocol; Quality of service; Dynamic Source Routing; Distributed computing; Geographic routing; Network packet; Static routing; Wireless sensor network; Wireless Routing Protocol; Link-state routing protocol","score_opus":0.026419652156718966,"score_gpt":0.29781907411249625,"score_spread":0.27139942195577726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028884287","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014162993,0.000040913692,0.97754437,0.0007487524,0.0009526348,0.005702221,0.000010381292,0.0005878313,0.00024993482],"genre_scores_gemma":[0.34079656,0.000010768828,0.65410215,0.00050014973,0.00072332926,0.0036146536,0.00015334674,0.0000500109,0.000049043494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673885,0.00050450495,0.00077238947,0.0007494859,0.00023089017,0.0010038986],"domain_scores_gemma":[0.9933098,0.00079070963,0.0003112097,0.004998929,0.000354551,0.00023483283],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012849019,0.00036333987,0.0004547446,0.00017962235,0.0007723322,0.0005118664,0.005575741,0.00031268818,0.0000067518095],"category_scores_gemma":[0.000029690002,0.0003751073,0.0001442257,0.001327914,0.00015179126,0.0005683576,0.001630954,0.0012277802,0.000012657923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027488839,0.0012273687,0.01069819,0.000019586056,0.00003637165,0.0000055659143,0.0015875913,0.79544324,0.000230155,0.11537565,0.0025387367,0.072810024],"study_design_scores_gemma":[0.0008489278,0.00009373128,0.0032722573,0.00014721688,0.000005833594,0.000013535557,0.000035019122,0.9704133,0.000035541958,0.00019777601,0.024518047,0.00041876652],"about_ca_topic_score_codex":0.000054718086,"about_ca_topic_score_gemma":0.002943873,"teacher_disagreement_score":0.32663357,"about_ca_system_score_codex":0.00007273249,"about_ca_system_score_gemma":0.00011561612,"threshold_uncertainty_score":0.99987006},"labels":[],"label_agreement":null},{"id":"W2030818667","doi":"10.1016/j.comcom.2014.06.008","title":"Real-time PON signaling for emerging low-latency applications","year":2014,"lang":"en","type":"article","venue":"Computer Communications","topic":"Optical Network Technologies","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Computer science; Optical line termination; Quality of service; Latency (audio); Cloud computing; Computer network; Passive optical network; Dynamic bandwidth allocation; Telecommunications; Wavelength-division multiplexing; Operating system","score_opus":0.013042665994896063,"score_gpt":0.23871342205080906,"score_spread":0.225670756055913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030818667","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069920872,0.00020464095,0.9829377,0.00087705307,0.00008883931,0.0005167413,0.000008205077,0.0024601968,0.0059145284],"genre_scores_gemma":[0.3585172,0.0002607475,0.6405057,0.00003419035,0.00013618595,0.00039563913,0.00007333609,0.00004115659,0.000035912613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926543,0.000027338925,0.00026156512,0.00014789756,0.000060604307,0.00023717227],"domain_scores_gemma":[0.99767274,0.0005147583,0.00003511545,0.0016527055,0.0000748859,0.000049800463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015406644,0.00012965556,0.00016032407,0.000092040216,0.00024760113,0.000050013736,0.0011075283,0.000088541135,0.000008648879],"category_scores_gemma":[0.000017270051,0.00014444989,0.000068594345,0.00025955413,0.00008381705,0.000087040964,0.00030140835,0.00017155318,0.00011825398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035364958,0.00018348671,0.00017707367,0.00019153584,0.00014713308,2.0117015e-7,0.00030534135,0.15377355,0.018703856,0.40638965,0.00918152,0.41094312],"study_design_scores_gemma":[0.00011977745,0.000018985978,0.00012358041,0.000037597703,0.000016466818,0.0000010639469,0.000008408707,0.95984244,0.00028956262,0.007872611,0.031493947,0.00017553636],"about_ca_topic_score_codex":0.0000025462305,"about_ca_topic_score_gemma":0.0000022796066,"teacher_disagreement_score":0.8060689,"about_ca_system_score_codex":0.000040946372,"about_ca_system_score_gemma":0.0000065353297,"threshold_uncertainty_score":0.5890496},"labels":[],"label_agreement":null},{"id":"W2030934401","doi":"10.1016/j.comcom.2004.06.005","title":"A fast string search algorithm for deep packet classification","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Algorithm; Time complexity; String (physics); Commentz-Walter algorithm; Set (abstract data type); String searching algorithm; Boyer–Moore string search algorithm; Network packet; Pattern matching; Artificial intelligence; Mathematics","score_opus":0.07407034828581271,"score_gpt":0.32024497699178534,"score_spread":0.24617462870597262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030934401","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019476737,0.0003161019,0.9952342,0.0029774175,0.00024756035,0.00043498282,0.000029481582,0.000296692,0.0002687844],"genre_scores_gemma":[0.051676873,0.00012281354,0.94745874,0.00024168976,0.0001473503,0.00012059256,0.00018888063,0.000015648327,0.000027432063],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863034,0.00009327734,0.00031616178,0.0004115059,0.00022916995,0.00031955767],"domain_scores_gemma":[0.9959348,0.00022821137,0.00010081415,0.0033412806,0.00025970783,0.0001351963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003092286,0.00016031417,0.00016705993,0.00014891071,0.00070191675,0.00035875596,0.0038381272,0.00007542814,0.0000026972527],"category_scores_gemma":[0.000010839038,0.00015883175,0.0000944278,0.00043709343,0.00010113267,0.00072756415,0.0019712762,0.00023419283,0.000056911165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.267475e-7,0.00016737728,0.000017006992,0.0000060876905,0.000015180405,6.43637e-7,0.0005710773,0.00068094267,0.00009846495,0.14274482,0.0003308007,0.85536665],"study_design_scores_gemma":[0.0006484894,0.000074453026,0.0015027964,0.000043544893,0.0000062288946,0.000014172429,0.000049822607,0.9759995,0.0001887032,0.008466316,0.012803552,0.00020246039],"about_ca_topic_score_codex":0.00003690194,"about_ca_topic_score_gemma":0.000014244494,"teacher_disagreement_score":0.9753185,"about_ca_system_score_codex":0.000117436335,"about_ca_system_score_gemma":0.00012313269,"threshold_uncertainty_score":0.7132259},"labels":[],"label_agreement":null},{"id":"W2033790292","doi":"10.1016/j.comcom.2008.01.055","title":"Adaptive handoff scheme for heterogeneous IP wireless networks","year":2008,"lang":"en","type":"article","venue":"Computer Communications","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Roaming; Handover; Computer network; Wireless network; Mobility management; Node (physics); Wireless; Heterogeneous network; Context (archaeology); Mobile IP; Protocol (science); Distributed computing; Telecommunications","score_opus":0.04050170061794534,"score_gpt":0.23602185330498748,"score_spread":0.19552015268704215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033790292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029994844,0.005438517,0.96148086,0.000121798235,0.0007962244,0.0008022088,0.000031657506,0.00073085935,0.0006030319],"genre_scores_gemma":[0.91824555,0.00086154876,0.07983908,0.0001546377,0.00039404162,0.00028501562,0.00011882922,0.00006233675,0.000038969105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876165,0.00009555566,0.00036748112,0.00024825783,0.00011672925,0.00041033665],"domain_scores_gemma":[0.9971626,0.0004071075,0.00006115484,0.0020926103,0.00015462104,0.00012190531],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015382435,0.00024743122,0.0003135077,0.00006472425,0.00048488186,0.00004583022,0.0011032727,0.00015588875,0.000009895175],"category_scores_gemma":[0.0000062865047,0.00028583538,0.00017167373,0.00022713457,0.00022029593,0.000145834,0.00047892355,0.0003881751,0.000022709632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011451996,0.0007760956,0.0013624551,0.0001338184,0.0007666158,0.000016248576,0.0031731676,0.8684471,0.00012986788,0.007693127,0.034369405,0.08301755],"study_design_scores_gemma":[0.00065886346,0.000054623728,0.0005576925,0.00003510916,0.000023362496,0.00003889579,0.0000079553465,0.9779357,0.000085471,0.0002931565,0.02001833,0.00029086092],"about_ca_topic_score_codex":0.00001436213,"about_ca_topic_score_gemma":0.000103164304,"teacher_disagreement_score":0.8882507,"about_ca_system_score_codex":0.00011740028,"about_ca_system_score_gemma":0.000026844416,"threshold_uncertainty_score":0.9999594},"labels":[],"label_agreement":null},{"id":"W2034011337","doi":"10.1016/j.comcom.2006.07.016","title":"A mobility management model based on users’ mobility profiles for IPv6 networks","year":2006,"lang":"en","type":"article","venue":"Computer Communications","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Mobility management; Mobility model; IPv6; Computer network; Mobile IP; Telecommunications; World Wide Web; Mobile computing; The Internet","score_opus":0.02072082051961459,"score_gpt":0.24123484866638445,"score_spread":0.22051402814676985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034011337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010967852,0.0005002338,0.9808017,0.00023513511,0.00037330354,0.0022179661,0.0000895726,0.00085234456,0.003961917],"genre_scores_gemma":[0.8407804,0.000046363613,0.15724996,0.00018468058,0.00015425652,0.0011430703,0.00034125452,0.00005386209,0.00004617262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981421,0.00014894638,0.0005625892,0.00045749423,0.00020146482,0.00048741096],"domain_scores_gemma":[0.9951144,0.00047692063,0.00007765204,0.0040977597,0.00013862275,0.00009464404],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060170615,0.0003363183,0.0003365352,0.00010425681,0.0003480808,0.00010407135,0.0013956942,0.00016601526,0.000010542219],"category_scores_gemma":[0.0000074223412,0.00037294044,0.00022357497,0.00031041823,0.00018592986,0.00015457583,0.00044919734,0.00040955207,0.000010700076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002579819,0.000753205,0.00040164823,0.00014796048,0.00003871326,3.4659178e-7,0.000055772405,0.9789694,0.000003503628,0.007352272,0.005286095,0.006965285],"study_design_scores_gemma":[0.0007616203,0.000044615335,0.0071506547,0.000053837557,0.000057004843,4.526073e-7,0.000007981095,0.9822413,0.000022825589,0.004672016,0.0046611764,0.0003265599],"about_ca_topic_score_codex":0.000039824772,"about_ca_topic_score_gemma":0.00020764432,"teacher_disagreement_score":0.8298125,"about_ca_system_score_codex":0.00030670434,"about_ca_system_score_gemma":0.000024331875,"threshold_uncertainty_score":0.99987227},"labels":[],"label_agreement":null},{"id":"W2034176698","doi":"10.1016/j.comcom.2008.11.020","title":"Semantic partitioning of peer-to-peer search space","year":2008,"lang":"en","type":"article","venue":"Computer Communications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Distributed hash table; Scalability; Overlay network; Partition (number theory); Peer-to-peer; Ontology; Hash table; Tree (set theory); Computer network; Node (physics); Distributed computing; Hash function; Database; World Wide Web; The Internet","score_opus":0.0768528716881432,"score_gpt":0.3084912734126142,"score_spread":0.23163840172447098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034176698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030856328,0.00017272892,0.88673204,0.07852653,0.00021424588,0.000351049,0.000006604912,0.0007228575,0.0024176259],"genre_scores_gemma":[0.53510594,0.000025918927,0.46380448,0.00041628192,0.00003473838,0.000037075653,0.0000091548445,0.000011309273,0.0005550798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778426,0.00017509241,0.0004197178,0.0004260898,0.0007358718,0.0004589567],"domain_scores_gemma":[0.99310017,0.00039261498,0.00009655674,0.0052156793,0.001004454,0.00019054204],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00061896053,0.0001936013,0.00030059772,0.0004315112,0.0005374915,0.000114697126,0.006637746,0.00009073463,0.000006683925],"category_scores_gemma":[0.00017037349,0.00020983959,0.00009678379,0.0018556674,0.00026445644,0.00032266206,0.005700149,0.00038579077,0.00035518876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012933549,0.00094971835,0.01575597,0.000057270317,0.00019363692,0.00004898767,0.02042123,0.041827627,0.0020488047,0.48230284,0.3418768,0.09450418],"study_design_scores_gemma":[0.0007897221,0.0005898488,0.0842247,0.00035248086,0.000028533264,0.00027376867,0.00020586468,0.61715806,0.0071185897,0.008674037,0.27934667,0.0012376908],"about_ca_topic_score_codex":0.00009906387,"about_ca_topic_score_gemma":0.000050662708,"teacher_disagreement_score":0.57533044,"about_ca_system_score_codex":0.00007754483,"about_ca_system_score_gemma":0.0001235119,"threshold_uncertainty_score":0.9987368},"labels":[],"label_agreement":null},{"id":"W2034810131","doi":"10.1016/j.comcom.2010.12.015","title":"p-Cycle protection at the glass fiber level","year":2011,"lang":"en","type":"article","venue":"Computer Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Fiber; Computer security; Composite material; Materials science","score_opus":0.08967147881557279,"score_gpt":0.2448496139703817,"score_spread":0.15517813515480894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034810131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013979859,0.001266696,0.94402933,0.0018915886,0.00029543033,0.0005834624,0.000010081232,0.0025679665,0.035375595],"genre_scores_gemma":[0.5399157,0.00020656512,0.45904216,0.00009269499,0.000047396716,0.00019408429,0.000009044247,0.000030694086,0.0004617134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958247,0.00002503932,0.000123377,0.00008103428,0.00004869183,0.00013936267],"domain_scores_gemma":[0.99829674,0.00007395681,0.000019143394,0.0015612624,0.000028197725,0.000020680363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000050580995,0.000083430445,0.00006789234,0.000025618932,0.0002285204,0.000013377282,0.00082129927,0.00005658783,0.000057222638],"category_scores_gemma":[0.000008742801,0.00006571759,0.000033193002,0.00016651285,0.00018035524,0.00008147119,0.0006753771,0.00023986811,0.00035800214],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008243833,0.00013582644,0.00017371212,0.00002785443,0.00013093761,0.0000016195086,0.001255878,0.051579684,0.00042864922,0.036054064,0.019265965,0.89093757],"study_design_scores_gemma":[0.00019696745,0.00004130699,0.007537584,0.000027427797,0.000018300621,0.000020388276,0.00003275261,0.66896164,0.00076121674,0.014317051,0.30778286,0.00030249706],"about_ca_topic_score_codex":0.000007713007,"about_ca_topic_score_gemma":0.000050842642,"teacher_disagreement_score":0.8906351,"about_ca_system_score_codex":0.000061524865,"about_ca_system_score_gemma":0.000002804436,"threshold_uncertainty_score":0.46015126},"labels":[],"label_agreement":null},{"id":"W2038044579","doi":"10.1016/j.comcom.2005.02.004","title":"Stochastic processes for computer network traffic modeling","year":2005,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Traffic generation model; Fractional Brownian motion; Fractal; Wireless network; Stochastic process; Network traffic simulation; Gaussian; Computer network; Noise (video); Wireless; Distributed computing; Network traffic control; Artificial intelligence; Telecommunications; Brownian motion; Mathematics","score_opus":0.038407457998326094,"score_gpt":0.26585589609081406,"score_spread":0.22744843809248796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038044579","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037928502,0.0022103502,0.9850994,0.01046783,0.00044297066,0.00057042553,0.000004143438,0.00071438856,0.00011120464],"genre_scores_gemma":[0.46753904,0.00004259267,0.5299668,0.0011318424,0.0010809547,0.00016305565,0.000020542364,0.000015807489,0.000039404327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983704,0.00010481259,0.00045203423,0.00044452614,0.00015266615,0.0004755332],"domain_scores_gemma":[0.996505,0.0007519203,0.00012604207,0.0020629026,0.00040589581,0.00014819173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003186817,0.000233342,0.0002756696,0.00008723125,0.0006927909,0.00032104194,0.0033951493,0.000085038766,0.0000030581318],"category_scores_gemma":[0.00001592614,0.00023884405,0.00012313601,0.000510122,0.000077280725,0.0005009182,0.00072142447,0.00022915319,0.000051067822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028009047,0.0000729826,0.0000016533231,0.0000073299498,0.000021246504,9.386529e-8,0.00018759859,0.59707016,2.2479561e-7,0.023391798,0.0032993597,0.37594473],"study_design_scores_gemma":[0.00056790636,0.00007066027,0.000010147568,0.000063918465,0.000020525087,0.00001326043,0.0000032293406,0.97974026,2.4396672e-7,0.0011345854,0.018105272,0.00026997316],"about_ca_topic_score_codex":0.0000012434863,"about_ca_topic_score_gemma":0.00004422118,"teacher_disagreement_score":0.46715975,"about_ca_system_score_codex":0.00005174336,"about_ca_system_score_gemma":0.0001864889,"threshold_uncertainty_score":0.9739778},"labels":[],"label_agreement":null},{"id":"W2039469367","doi":"10.1016/j.comcom.2007.10.024","title":"A game-theoretic intrusion detection model for mobile ad hoc networks","year":2007,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Intrusion detection system; Mobile ad hoc network; Overhead (engineering); Node (physics); Network packet; Computer network; Wireless ad hoc network; Resource allocation; Distributed computing; Resource (disambiguation); Service (business); Computer security; Wireless; Operating system","score_opus":0.021884445407752043,"score_gpt":0.2752206278828226,"score_spread":0.25333618247507056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039469367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013630171,0.0035784936,0.99248236,0.00032561977,0.0004924052,0.0009871869,0.0000022925788,0.0004934388,0.00027520707],"genre_scores_gemma":[0.58698636,0.0007747016,0.41123015,0.0004752795,0.0001295364,0.00029796406,0.000023157732,0.000023514865,0.00005931241],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998233,0.000124409,0.0004983645,0.00045883527,0.00018256568,0.0005028063],"domain_scores_gemma":[0.99475724,0.00074862037,0.00019806618,0.0038775115,0.0002503082,0.00016824005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092634175,0.00022139603,0.00022727656,0.00016048174,0.0004955904,0.00019794039,0.0035111192,0.0001674161,0.0000029977052],"category_scores_gemma":[0.000013845773,0.00023387208,0.00015519618,0.0005974956,0.00017282412,0.00038774998,0.0018848932,0.00039175295,0.000020731173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015046425,0.0001405272,0.00001054032,0.0000102986805,0.000017895547,7.129523e-7,0.00091686816,0.117610425,0.000056632132,0.043050893,0.0005644963,0.83760566],"study_design_scores_gemma":[0.0003754798,0.00015255729,0.00009736601,0.00003855672,0.000013419008,0.000015507185,0.000010509558,0.96191096,0.00006892489,0.012084334,0.024986899,0.00024546523],"about_ca_topic_score_codex":0.0000019673646,"about_ca_topic_score_gemma":0.000087198896,"teacher_disagreement_score":0.84430057,"about_ca_system_score_codex":0.00013550105,"about_ca_system_score_gemma":0.000050401664,"threshold_uncertainty_score":0.9537026},"labels":[],"label_agreement":null},{"id":"W2041747596","doi":"10.1016/j.comcom.2004.08.001","title":"TCP Prairie: a sender-only TCP modification based on adaptive bandwidth estimation in wired-wireless networks","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"TCP Westwood plus; Computer science; TCP global synchronization; Burstiness; TCP Friendly Rate Control; CUBIC TCP; TCP acceleration; Computer network; Zeta-TCP; Compound TCP; HSTCP; TCP Westwood; H-TCP; Real-time computing; Network congestion; Network packet","score_opus":0.03000912760053793,"score_gpt":0.2631458857583733,"score_spread":0.23313675815783536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041747596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016250183,0.00018361896,0.9809101,0.015264878,0.00028477618,0.0006095608,0.0000035777966,0.00044842146,0.0006700476],"genre_scores_gemma":[0.83693963,0.00003004203,0.16154167,0.0011574364,0.00007124074,0.00015862234,0.00006210152,0.000018398729,0.000020835372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977921,0.00039509597,0.0005400793,0.00055359694,0.00033591822,0.0003831937],"domain_scores_gemma":[0.9959654,0.0005985084,0.00024804115,0.002847673,0.00019066807,0.00014970297],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045690328,0.00027938987,0.00029363198,0.00028299764,0.0003910985,0.00023037661,0.00239549,0.00015357463,0.000003114707],"category_scores_gemma":[0.000019928937,0.0002974043,0.0001075075,0.0010150633,0.00015299108,0.0005096853,0.00036372634,0.00046108154,0.000051035364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001239436,0.00030294433,0.00013402083,0.0000026057155,0.000010948399,0.0000025954607,0.00029414517,0.60303843,0.00000193297,0.14138208,0.00033258492,0.2544853],"study_design_scores_gemma":[0.0015730807,0.00014013475,0.0046029743,0.00014801367,0.000010445186,0.000009533149,0.000014314665,0.98908514,0.000006167564,0.0031997594,0.00091477594,0.00029565603],"about_ca_topic_score_codex":0.00004405527,"about_ca_topic_score_gemma":0.00026157717,"teacher_disagreement_score":0.83531463,"about_ca_system_score_codex":0.00026033292,"about_ca_system_score_gemma":0.00035287117,"threshold_uncertainty_score":0.9999478},"labels":[],"label_agreement":null},{"id":"W2044138969","doi":"10.1016/s0140-3664(03)00116-6","title":"Context independent unique state identification sequences for testing communication protocols modelled as extended finite state machines","year":2003,"lang":"en","type":"article","venue":"Computer Communications","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Nortel (Canada)","funders":"","keywords":"Extended finite-state machine; Computer science; Finite-state machine; Executable; Observability; Sequence (biology); Identification (biology); Conformance testing; Context (archaeology); State (computer science); Theoretical computer science; Control flow; Algorithm; Mathematics; Programming language","score_opus":0.09491792874771247,"score_gpt":0.3503298570391113,"score_spread":0.2554119282913988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044138969","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012871503,0.00028633466,0.98543817,0.0010136055,0.00008570585,0.0068096183,0.000019460842,0.0044930405,0.00056692713],"genre_scores_gemma":[0.40066597,0.000044031876,0.591543,0.00036140298,0.000008809596,0.007145124,0.000045360583,0.000026770205,0.00015948147],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996898,0.00093723636,0.0008768738,0.0005759721,0.0003120683,0.00039986722],"domain_scores_gemma":[0.9899274,0.0033565487,0.00063889095,0.0049309256,0.0010079208,0.00013828729],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018603608,0.00031524315,0.00033347687,0.0002684733,0.0010645709,0.0007452376,0.00448017,0.0000930348,0.0000026668304],"category_scores_gemma":[0.0011478747,0.00032377508,0.000113393835,0.0007496486,0.00022064624,0.00079672155,0.0009930019,0.00039910828,0.00002728166],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004351852,0.0013885883,0.003788612,0.00021378203,0.00018306835,0.000009275113,0.009546468,0.014802217,0.00092673267,0.2501138,0.0050302153,0.71395373],"study_design_scores_gemma":[0.00041011165,0.00012855465,0.00045873108,0.00018889122,0.000008887507,0.000039886418,0.00000893341,0.63200206,0.0007784809,0.3627016,0.0029557282,0.00031813525],"about_ca_topic_score_codex":0.00032313407,"about_ca_topic_score_gemma":0.00008916064,"teacher_disagreement_score":0.71363556,"about_ca_system_score_codex":0.00013040048,"about_ca_system_score_gemma":0.0003447876,"threshold_uncertainty_score":0.99992144},"labels":[],"label_agreement":null},{"id":"W2044884901","doi":"10.1016/j.comcom.2004.07.003","title":"Proportional loss rate differentiation in a FIFO queue","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; FIFO (computing and electronics); Queue; Real-time computing; Computer network; Operating system","score_opus":0.018645383823527078,"score_gpt":0.2462081777786052,"score_spread":0.22756279395507814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044884901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021702297,0.0002408818,0.962068,0.014909401,0.00024524122,0.00024510385,0.0000017095044,0.00022053877,0.00036678105],"genre_scores_gemma":[0.9185224,0.000078288605,0.080551036,0.00061240885,0.000074286894,0.00008207117,0.000029466366,0.0000064388955,0.00004359981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890405,0.00016681511,0.00032589887,0.00025880724,0.00013851318,0.00020590742],"domain_scores_gemma":[0.99812627,0.00012899603,0.000106441454,0.001460408,0.00010877462,0.00006911002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002416349,0.00012017247,0.00013986907,0.00012905269,0.00019223006,0.00013836255,0.0017714523,0.000054349846,0.000007291552],"category_scores_gemma":[0.000011891009,0.00012107878,0.00005868792,0.00044631166,0.00008120309,0.0003812569,0.00052854785,0.00022926246,0.00008494262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008034507,0.0005561448,0.0025867254,0.00000729054,0.000027314865,0.000010187857,0.00072888157,0.02933658,0.000054874086,0.7948271,0.00038655676,0.17147031],"study_design_scores_gemma":[0.0015650849,0.000046534326,0.08366165,0.00008121456,0.0000070814517,0.00002398298,0.0000070414885,0.8768483,0.000032971206,0.03253331,0.004908413,0.00028445962],"about_ca_topic_score_codex":0.000023623965,"about_ca_topic_score_gemma":0.00018936516,"teacher_disagreement_score":0.8968201,"about_ca_system_score_codex":0.000099967576,"about_ca_system_score_gemma":0.00014854905,"threshold_uncertainty_score":0.49374494},"labels":[],"label_agreement":null},{"id":"W2045700287","doi":"10.1016/s0140-3664(01)00433-9","title":"Weighted fair discard scheme for buffer management in the presence of network congestion","year":2002,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Manitoba","funders":"","keywords":"Computer science; Scheme (mathematics); Buffer (optical fiber); Computer network; Network congestion; Congestion management; Telecommunications; Mathematics","score_opus":0.038657331286538844,"score_gpt":0.25708824016499876,"score_spread":0.21843090887845992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045700287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00083921757,0.0015425872,0.9817152,0.012385144,0.00024868659,0.0008319377,0.0000025724148,0.00009776939,0.0023369032],"genre_scores_gemma":[0.72526187,0.00031920205,0.27345204,0.00046069463,0.00008919385,0.00028834178,0.000009501427,0.000005802092,0.00011335163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878,0.00026535807,0.00032527038,0.00022717613,0.00017125672,0.0002309515],"domain_scores_gemma":[0.99681914,0.0007806701,0.000117490716,0.0021478015,0.000100093464,0.00003479822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041300952,0.00011627978,0.00016037715,0.000064496795,0.00020828309,0.000088367684,0.003252474,0.000043941687,0.000005225818],"category_scores_gemma":[0.000007678891,0.00009285748,0.00008140635,0.00052182935,0.00011252404,0.00020757252,0.0005511843,0.00015475911,0.000012555812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038987046,0.00019518792,0.0002888571,0.000012529392,0.000040948944,9.569836e-7,0.00067738467,0.0029249093,0.0000016573248,0.56084603,0.017211163,0.4177965],"study_design_scores_gemma":[0.00048211246,0.000043704957,0.0030807662,0.000051988027,0.000012848856,0.0000033014726,0.000020669226,0.9545192,9.524557e-7,0.0044456115,0.03723425,0.000104568324],"about_ca_topic_score_codex":0.0000040511045,"about_ca_topic_score_gemma":0.000018656328,"teacher_disagreement_score":0.9515943,"about_ca_system_score_codex":0.000018986515,"about_ca_system_score_gemma":0.00000844762,"threshold_uncertainty_score":0.604396},"labels":[],"label_agreement":null},{"id":"W2046601886","doi":"10.1016/j.comcom.2012.09.003","title":"Differentiated quality-of-protection in survivable WDM mesh networks using p-structures","year":2012,"lang":"en","type":"article","venue":"Computer Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Computer network; Wavelength-division multiplexing; Mesh networking; Telecommunications; Optoelectronics; Wireless","score_opus":0.08573826848500887,"score_gpt":0.305462829160637,"score_spread":0.21972456067562812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046601886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23665327,0.0013807974,0.7609977,0.000026166968,0.00021543096,0.00014310658,0.0000018437747,0.00038842918,0.00019324633],"genre_scores_gemma":[0.81971675,0.00020462328,0.17998706,0.0000066580697,0.00003893793,0.000013685683,0.000013598683,0.000016975928,0.0000016770019],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917036,0.00010162068,0.00033094577,0.00007926998,0.00006563846,0.00025213943],"domain_scores_gemma":[0.99868315,0.00017466085,0.000056815345,0.0010184306,0.000033017328,0.000033919747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013467419,0.00011546779,0.0002072074,0.00010698327,0.00007377841,0.000013735764,0.0005261799,0.000118959855,0.000006162736],"category_scores_gemma":[0.000022204582,0.00012117493,0.000039587696,0.00042715724,0.000105318526,0.00018096101,0.00036057102,0.00035343016,0.0000019280023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065623726,0.000121870566,0.015948065,0.00006033701,0.00006959481,1.531567e-7,0.00022277902,0.88286245,0.0026075162,0.061036117,0.00006508282,0.0369995],"study_design_scores_gemma":[0.00014177716,0.000006356412,0.041341722,0.000035647026,0.000006345436,0.000001378687,0.000024337376,0.9553747,0.00021098423,0.0024965424,0.00021450357,0.0001456697],"about_ca_topic_score_codex":0.000044310174,"about_ca_topic_score_gemma":0.000035159665,"teacher_disagreement_score":0.5830635,"about_ca_system_score_codex":0.00006594184,"about_ca_system_score_gemma":0.000002759426,"threshold_uncertainty_score":0.49413705},"labels":[],"label_agreement":null},{"id":"W2049020424","doi":"10.1016/s0140-3664(00)00245-0","title":"On object initialization in the Java bytecode","year":2000,"lang":"en","type":"article","venue":"Computer Communications","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Java bytecode; Serialization; Initialization; Java; Programming language; Correctness; Dataflow; Object (grammar); Java Modeling Language; Bytecode; Process (computing); Software portability; strictfp; Operating system; Java annotation; Real time Java; Artificial intelligence","score_opus":0.05286382080372038,"score_gpt":0.302949380646719,"score_spread":0.25008555984299863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049020424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010867439,0.00026258174,0.93360883,0.012783828,0.00028022722,0.00039250785,0.0000026019072,0.0003154418,0.041486543],"genre_scores_gemma":[0.9379151,0.00015318369,0.056889053,0.0048477068,0.00007896868,0.000046016477,0.000023407005,0.000007047342,0.000039523053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854434,0.00052105356,0.00030315088,0.00024945836,0.00019983298,0.00018219679],"domain_scores_gemma":[0.99612814,0.0007949454,0.00006639035,0.0029271403,0.000052112824,0.00003128427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005245245,0.00011089739,0.000101688085,0.00012394792,0.00043749623,0.00028586018,0.004377282,0.000051590014,0.000046011646],"category_scores_gemma":[0.000024533038,0.00009534272,0.000050758288,0.0008261391,0.0000774498,0.00028216493,0.00028310527,0.0002896876,0.00026512597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027295016,0.00031204286,0.00011885278,0.000004024299,0.0000067284104,0.000002127401,0.0067623476,0.0040369607,0.0000038891253,0.78241885,0.0042574187,0.20207404],"study_design_scores_gemma":[0.0003111158,0.00006767768,0.007349465,0.00004929481,0.0000028809573,0.000023402812,0.000037005575,0.894286,0.000020522742,0.025667055,0.07199227,0.00019335104],"about_ca_topic_score_codex":0.000034193075,"about_ca_topic_score_gemma":0.000028757207,"teacher_disagreement_score":0.92704767,"about_ca_system_score_codex":0.000039580213,"about_ca_system_score_gemma":0.000044453132,"threshold_uncertainty_score":0.8134153},"labels":[],"label_agreement":null},{"id":"W2050569676","doi":"10.1016/j.comcom.2007.04.012","title":"A DoS and fault-tolerant authentication protocol for group communications in ad hoc networks","year":2007,"lang":"en","type":"article","venue":"Computer Communications","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Denial-of-service attack; Session key; Robustness (evolution); Authentication protocol; Wireless ad hoc network; Encryption; Forward secrecy; Group key; Computer security; Authentication (law); Wireless; Public-key cryptography; Telecommunications","score_opus":0.05715461375082519,"score_gpt":0.3505459649019393,"score_spread":0.2933913511511141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050569676","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040296552,0.00076061767,0.95194095,0.0040400047,0.000125492,0.042181883,0.0000035077153,0.0002915705,0.0002529853],"genre_scores_gemma":[0.23568441,0.00025993423,0.69075525,0.0006807522,0.000082180035,0.07241779,0.00006879666,0.00003376389,0.000017099204],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773204,0.00030213333,0.00077518786,0.00048229456,0.00019290208,0.00051545264],"domain_scores_gemma":[0.99166185,0.0017203027,0.0002778759,0.005957737,0.00022178273,0.00016045518],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012205385,0.00025288682,0.00029762145,0.00028722078,0.0006068972,0.00031023487,0.005223981,0.00018616374,0.0000016751236],"category_scores_gemma":[0.00003481575,0.00027484918,0.00009396942,0.00080855226,0.00036802577,0.0005056202,0.002638208,0.0005414937,0.00000775126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005618783,0.0013373641,0.0013534235,0.00007656494,0.0000576388,0.0000028973689,0.0069203973,0.0013412881,0.00009152052,0.35002837,0.0010731498,0.6376612],"study_design_scores_gemma":[0.001302181,0.00009497215,0.0065129064,0.000144543,0.000008394267,0.000019214249,0.000051457388,0.92211515,0.00000782252,0.0034897195,0.065962225,0.0002914364],"about_ca_topic_score_codex":0.000017136395,"about_ca_topic_score_gemma":0.00066331244,"teacher_disagreement_score":0.92077386,"about_ca_system_score_codex":0.0001217172,"about_ca_system_score_gemma":0.00004411626,"threshold_uncertainty_score":0.9999704},"labels":[],"label_agreement":null},{"id":"W2053034494","doi":"10.1016/j.comcom.2010.01.023","title":"Trust management in ubiquitous computing: A Bayesian approach","year":2010,"lang":"en","type":"article","venue":"Computer Communications","topic":"Access Control and Trust","field":"Social Sciences","cited_by":89,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Guelph","funders":"","keywords":"Computer science; Trust management (information system); Ubiquitous computing; Scheme (mathematics); Task (project management); Trustworthiness; Probabilistic logic; Human–computer interaction; Computer security; End-user computing; Distributed computing; Artificial intelligence; Utility computing; Cloud computing","score_opus":0.0300447031888077,"score_gpt":0.32410119286754596,"score_spread":0.29405648967873826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053034494","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028915834,0.00015415052,0.25524428,0.00800118,0.000598001,0.0010028965,0.0000029859432,0.0003693306,0.7057113],"genre_scores_gemma":[0.86461484,0.00003721436,0.13463435,0.0002870782,0.00018474892,0.00003242496,0.000009257842,0.000008704133,0.00019138397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989322,0.00021984427,0.00023075537,0.00019568225,0.00014866638,0.00027287792],"domain_scores_gemma":[0.9984295,0.00015429877,0.000069375485,0.0011976501,0.00005299763,0.00009621025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005241144,0.00009592289,0.00013688106,0.00013626284,0.0008414292,0.00017371068,0.0016709161,0.000082200306,0.00003109606],"category_scores_gemma":[0.00001277847,0.00010113483,0.00005323996,0.00041990372,0.00034371304,0.00015367861,0.000671834,0.00040819205,0.000027077442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026963062,0.00044848834,0.005315866,0.000010018487,0.00003409771,0.000027256694,0.00949617,0.00010366597,0.0000035206895,0.7447187,0.0007847335,0.23905478],"study_design_scores_gemma":[0.0018110455,0.00003089141,0.035861384,0.000044830515,0.000051577907,0.000078153775,0.0059663253,0.48812163,0.0000027054941,0.013311413,0.4540134,0.0007066177],"about_ca_topic_score_codex":0.0011095556,"about_ca_topic_score_gemma":0.0033004673,"teacher_disagreement_score":0.835699,"about_ca_system_score_codex":0.000035316163,"about_ca_system_score_gemma":0.000040776187,"threshold_uncertainty_score":0.6471678},"labels":[],"label_agreement":null},{"id":"W2053468050","doi":"10.1016/j.comcom.2004.06.001","title":"An alternative strategy for location update and paging in mobile networks","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Paging; Computer science; Computer network","score_opus":0.056469630202554216,"score_gpt":0.35269320002701054,"score_spread":0.2962235698244563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053468050","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062016784,0.0029399646,0.9878737,0.0019774416,0.000072400224,0.0007083908,0.000002311223,0.00014508076,0.000079086894],"genre_scores_gemma":[0.757945,0.0016246125,0.23968972,0.0002222001,0.000051411986,0.00039236597,0.000058415433,0.0000136601375,0.0000026392515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846995,0.000315243,0.0003591732,0.00038212328,0.00014755038,0.0003259893],"domain_scores_gemma":[0.995707,0.00037878574,0.00011891319,0.0033870493,0.0002822886,0.00012596772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061470113,0.00015180836,0.00018036625,0.00022061479,0.00037932428,0.00040671122,0.004131901,0.000072233044,0.000001022649],"category_scores_gemma":[0.000011427253,0.00016759272,0.000032001375,0.0007386086,0.00017946668,0.0010008351,0.0013813584,0.00036145115,0.0000057154434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029575895,0.00017517243,0.00019918049,0.000006226273,0.000009598795,5.399828e-7,0.00058093324,0.6044182,0.00001065106,0.20008557,0.000027441814,0.1944835],"study_design_scores_gemma":[0.00065507606,0.000112745685,0.002954694,0.000056684312,0.0000023429488,0.000006344335,0.00005048216,0.9775161,0.000026039614,0.017138237,0.0013068098,0.00017440174],"about_ca_topic_score_codex":0.00009578791,"about_ca_topic_score_gemma":0.00031739593,"teacher_disagreement_score":0.7517433,"about_ca_system_score_codex":0.00013051015,"about_ca_system_score_gemma":0.00012224918,"threshold_uncertainty_score":0.7678169},"labels":[],"label_agreement":null},{"id":"W2053584450","doi":"10.1016/s0140-3664(00)00365-0","title":"An optimization-oriented view of random early detection","year":2001,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Random early detection; Router; Computer network; Active queue management; Queue; Network packet; Network congestion; Transmission Control Protocol; Real-time computing","score_opus":0.015511271740755023,"score_gpt":0.24860345235079284,"score_spread":0.2330921806100378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053584450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030615043,0.0005128197,0.9942921,0.0007746554,0.00025466716,0.00022191094,0.0000011092022,0.00027730342,0.0006039786],"genre_scores_gemma":[0.76310664,0.0002993124,0.2362884,0.00016668742,0.000060165945,0.000033278247,0.000010744071,0.0000069578423,0.000027799373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885774,0.0002887952,0.0003370741,0.00021707764,0.00014653498,0.00015275365],"domain_scores_gemma":[0.99699086,0.00020235899,0.0001447816,0.0022847098,0.00028741348,0.000089875764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023262827,0.0001097083,0.00018036032,0.00010938387,0.00025292733,0.000085534644,0.0018719647,0.00005219693,0.000012443143],"category_scores_gemma":[0.000009279369,0.000111904716,0.000070400885,0.000652624,0.00008665201,0.00052222336,0.00026584175,0.00013389347,0.00001640784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001586623,0.00024785977,0.00041293338,0.0000033293886,0.00003200808,9.421864e-7,0.00046058942,0.091296904,0.000061405895,0.02855544,0.00007053095,0.8788422],"study_design_scores_gemma":[0.0008045044,0.00010108658,0.0011679722,0.000020181473,0.000011090129,0.000011903497,0.0000056378367,0.9886448,0.000023411725,0.0002150081,0.008881973,0.00011245186],"about_ca_topic_score_codex":0.00002396977,"about_ca_topic_score_gemma":0.00002588488,"teacher_disagreement_score":0.89734787,"about_ca_system_score_codex":0.000019706433,"about_ca_system_score_gemma":0.000037391477,"threshold_uncertainty_score":0.4563342},"labels":[],"label_agreement":null},{"id":"W2055045269","doi":"10.1016/j.comcom.2007.12.022","title":"Routing and admission control with multiconstrained end-to-end quality of service in MPLS networks","year":2008,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Multiprotocol Label Switching; Computer science; Computer network; End-to-end principle; Quality of service; End-to-end delay; Packet loss; Admission control; Network packet","score_opus":0.040248525526872525,"score_gpt":0.2759314848276511,"score_spread":0.2356829593007786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055045269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059731513,0.00032472753,0.93244654,0.006709909,0.00005600028,0.00036117394,0.0000034668947,0.00010808995,0.00025858526],"genre_scores_gemma":[0.86578655,0.000043695887,0.13270792,0.001379507,0.000031536216,0.000029309727,0.000005494721,0.0000071152817,0.000008859779],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984123,0.0003982329,0.0004818122,0.00029324714,0.00016959923,0.0002448212],"domain_scores_gemma":[0.9969127,0.0010325254,0.00018347456,0.0014987456,0.00020673114,0.00016577561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048609407,0.00015317526,0.00032599992,0.000107111235,0.00025082775,0.000045744153,0.0013497231,0.00006289212,0.0000041005133],"category_scores_gemma":[0.000027805134,0.00013938788,0.000036134174,0.00058508146,0.00015006804,0.00021408065,0.000525179,0.0002523323,0.000003031152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012654506,0.0006364021,0.047884844,0.000035096917,0.00012038093,0.000014406499,0.0065729017,0.09721052,0.000271753,0.10417073,0.00020670403,0.7427497],"study_design_scores_gemma":[0.0015699633,0.00006371664,0.08494519,0.00009459237,0.0000066167772,0.000026003334,0.000029124589,0.91275483,0.0000047436024,0.00006262033,0.0002834873,0.00015911307],"about_ca_topic_score_codex":0.00017036307,"about_ca_topic_score_gemma":0.0003994269,"teacher_disagreement_score":0.8155443,"about_ca_system_score_codex":0.000024948062,"about_ca_system_score_gemma":0.000114707436,"threshold_uncertainty_score":0.56840724},"labels":[],"label_agreement":null},{"id":"W2057739959","doi":"10.1016/j.comcom.2003.08.019","title":"Hierarchical analysis of RealMedia streaming traffic on an IEEE 802.11b wireless LAN","year":2003,"lang":"en","type":"article","venue":"Computer Communications","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; University of Washington; Cisco Systems","keywords":"Computer science; Computer network; Wireless network; Network packet; Application layer; Burstiness; Retransmission; Network layer; Wireless; Layer (electronics); Telecommunications; Software deployment","score_opus":0.04371029394683832,"score_gpt":0.31070105471083254,"score_spread":0.2669907607639942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057739959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1882317,0.00010608771,0.80565804,0.000858643,0.00025711342,0.0015879227,0.000019647283,0.0003036278,0.0029771838],"genre_scores_gemma":[0.90348005,0.00004746184,0.09586208,0.00020738941,0.000051660267,0.0002747132,0.000045693563,0.000012461424,0.000018497001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978816,0.00074336404,0.00044554766,0.00038285326,0.000264203,0.0002824689],"domain_scores_gemma":[0.9947833,0.00068981666,0.00018859349,0.004044864,0.00011962619,0.00017379176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004736883,0.00018056849,0.0003947675,0.00037496988,0.00027641168,0.00013052825,0.0031208808,0.00009739208,0.000009431775],"category_scores_gemma":[0.000010835122,0.00017371452,0.00017813873,0.0016599474,0.0001585344,0.00023710934,0.00029384764,0.000351502,0.000008976481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012532794,0.0014444982,0.0019709324,0.000021403723,0.0005762688,0.000006265681,0.0034084478,0.093725316,0.0001065241,0.48406124,0.0008231133,0.41384345],"study_design_scores_gemma":[0.00032644757,0.00019477986,0.007832062,0.00004731784,0.00007134817,0.000003178791,0.000015250217,0.9868375,0.00009129136,0.0007054135,0.0036571415,0.0002182586],"about_ca_topic_score_codex":0.0000253561,"about_ca_topic_score_gemma":0.00016258981,"teacher_disagreement_score":0.8931122,"about_ca_system_score_codex":0.000035752553,"about_ca_system_score_gemma":0.00009620558,"threshold_uncertainty_score":0.70838726},"labels":[],"label_agreement":null},{"id":"W2060388058","doi":"10.1016/j.comcom.2007.12.027","title":"Vertical handoffs as a radio resource management tool","year":2008,"lang":"en","type":"article","venue":"Computer Communications","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Queen's University","funders":"","keywords":"Computer science; Handover; Quality of service; Exploit; Computer network; Radio resource management; Vertical handover; Session (web analytics); Wireless; Cellular network; Resource (disambiguation); Operator (biology); Wireless network; Telecommunications; Computer security; Heterogeneous network","score_opus":0.01961476339688648,"score_gpt":0.22311103768660695,"score_spread":0.20349627428972047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060388058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22281471,0.011567889,0.61618805,0.0025125544,0.0018042122,0.0023401377,0.000024549892,0.0040860814,0.1386618],"genre_scores_gemma":[0.9597574,0.0008862697,0.038349062,0.00035061216,0.00019246829,0.00010860426,0.00004944007,0.000043552078,0.00026262074],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99884874,0.0001234499,0.00032136563,0.00020681637,0.00018581063,0.00031382163],"domain_scores_gemma":[0.9969716,0.00023443482,0.00001785913,0.0026346734,0.00003970846,0.00010171242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016488286,0.00018182734,0.00021001606,0.00007963376,0.0003330103,0.000051304545,0.0012165407,0.00008408714,0.000043170032],"category_scores_gemma":[0.000010271684,0.00020434416,0.000102839476,0.00026645506,0.00019993864,0.000119054836,0.00078068447,0.00037097512,0.00027788925],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017363933,0.0027487152,0.0055320165,0.00058830064,0.001813124,0.00028793118,0.015382707,0.10198966,0.00020540522,0.17981875,0.48452234,0.20693742],"study_design_scores_gemma":[0.0009170637,0.000044926794,0.0093052825,0.000074789896,0.000057911126,0.00010339764,0.000029694489,0.4069496,0.00006644527,0.0008708913,0.5811699,0.0004100655],"about_ca_topic_score_codex":0.000010911444,"about_ca_topic_score_gemma":0.000014681314,"teacher_disagreement_score":0.73694265,"about_ca_system_score_codex":0.00013025817,"about_ca_system_score_gemma":0.000013879083,"threshold_uncertainty_score":0.8332913},"labels":[],"label_agreement":null},{"id":"W2060511775","doi":"10.1016/s0140-3664(02)00028-2","title":"QUIPS-II: a simulation tool for the design and performance evaluation of Diffserv-based networks","year":2002,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Distributed computing; Computer architecture; Computer network","score_opus":0.10329345415626871,"score_gpt":0.2877812360696271,"score_spread":0.18448778191335835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060511775","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051495787,0.0020276024,0.98887384,0.002812579,0.00013822221,0.0008938882,8.33203e-7,0.00007503291,0.000028451666],"genre_scores_gemma":[0.86602974,0.00013795534,0.13324428,0.00029329042,0.000058520207,0.00021144532,0.000004500814,0.000005766902,0.000014479856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890417,0.00030906766,0.00026621323,0.00017454821,0.00020843197,0.0001375931],"domain_scores_gemma":[0.9959176,0.0020795541,0.00014856219,0.0014237921,0.0004008878,0.000029593164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010504423,0.00010075808,0.00011886237,0.000049405644,0.0006449558,0.000078954436,0.0011552998,0.000047411733,0.000005948229],"category_scores_gemma":[0.000032859207,0.000080584476,0.000051317184,0.00024957114,0.00010181216,0.00022530426,0.0002693928,0.00010272149,0.0000017732139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031906904,0.000037320933,0.00006646759,0.0000019207596,0.000010043763,6.5545227e-9,0.000121134304,0.54385036,9.123428e-7,0.0023060078,0.00021714275,0.45338547],"study_design_scores_gemma":[0.00071615167,0.00012065993,0.0027510088,0.000027285283,0.00004936725,8.1451657e-7,0.000002206245,0.99438375,0.0000032702014,0.00014829707,0.0017047818,0.00009239658],"about_ca_topic_score_codex":0.0000011946347,"about_ca_topic_score_gemma":0.0000018376084,"teacher_disagreement_score":0.8608802,"about_ca_system_score_codex":0.000025214791,"about_ca_system_score_gemma":0.00003389403,"threshold_uncertainty_score":0.49605435},"labels":[],"label_agreement":null},{"id":"W2062229100","doi":"10.1016/j.comcom.2004.09.014","title":"Economical protection in MPLS networks","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Multiprotocol Label Switching; Computer network; Telecommunications; Computer security; Quality of service","score_opus":0.02458785191563852,"score_gpt":0.23091758570853868,"score_spread":0.20632973379290015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062229100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017384147,0.00050117547,0.97899437,0.0008693013,0.00012423978,0.00021232672,5.976549e-7,0.0008689891,0.0010448367],"genre_scores_gemma":[0.74563926,0.00025370708,0.25395122,0.000031687905,0.00003559509,0.00006929373,0.0000051024685,0.000012496846,0.0000016456116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995448,0.000012779942,0.00017293709,0.0000895809,0.000022190918,0.00015772917],"domain_scores_gemma":[0.9990534,0.000047457295,0.000013157796,0.00085028465,0.000010724439,0.000024986428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000043825483,0.00007924282,0.00009821633,0.000066761255,0.000051743264,0.000020138927,0.00052899565,0.00008296983,0.0000023522698],"category_scores_gemma":[0.0000063924444,0.000089802976,0.000024301116,0.00019959189,0.00008698294,0.00010659412,0.00024078236,0.00035696066,0.00003496819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.846081e-7,0.00002071994,0.000056314395,0.00000227764,0.0000044973676,4.1420574e-7,0.000022303033,0.9376041,0.000015938296,0.019165056,0.000037523565,0.04307023],"study_design_scores_gemma":[0.00021706232,0.000015538224,0.0022350065,0.000030367197,0.0000016293816,0.0000044861144,0.0000066944453,0.9783157,0.000026011421,0.015254011,0.0037755826,0.000117912554],"about_ca_topic_score_codex":0.000005462483,"about_ca_topic_score_gemma":0.000069446,"teacher_disagreement_score":0.7282551,"about_ca_system_score_codex":0.00015013103,"about_ca_system_score_gemma":0.000005257874,"threshold_uncertainty_score":0.3662059},"labels":[],"label_agreement":null},{"id":"W2062430203","doi":"10.1016/j.comcom.2009.09.001","title":"Implementation of MPC as an AQM controller","year":2009,"lang":"en","type":"article","venue":"Computer Communications","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Active queue management; Computer science; Model predictive control; Queue; Field-programmable gate array; Control theory (sociology); Controller (irrigation); Computational complexity theory; PID controller; Network congestion; Control (management); Control engineering; Computer network; Algorithm; Embedded system; Artificial intelligence","score_opus":0.19302133217383957,"score_gpt":0.5303509478373889,"score_spread":0.33732961566354935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062430203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1737761,0.0002031045,0.79388034,0.016388848,0.000084883024,0.0010450914,0.000040359202,0.0003071909,0.014274053],"genre_scores_gemma":[0.9305168,0.000026056372,0.068242036,0.0009975344,0.000038495138,0.000026455664,0.00003212803,0.000004773712,0.00011572081],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984151,0.0002018656,0.000666535,0.00022041811,0.00038428037,0.00011179698],"domain_scores_gemma":[0.99629766,0.000531171,0.00028747576,0.002307138,0.00049933244,0.00007721161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007473846,0.000085869746,0.00018621817,0.00019082378,0.00024031418,0.000115953495,0.0018934532,0.0000436476,0.00023173384],"category_scores_gemma":[0.000049636266,0.000074636766,0.00008945947,0.00057335227,0.00008678494,0.00030828043,0.00018757161,0.000089512854,0.00010692888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047735953,0.00020392759,0.0019508748,3.6581395e-7,0.00000786366,7.013786e-8,0.00064644334,0.00016092899,0.0007503938,0.33000517,0.004898318,0.6613709],"study_design_scores_gemma":[0.0010823391,0.00045154302,0.1974281,0.00001078099,0.000024177407,0.000006595153,0.0008462884,0.103503466,0.0019467568,0.5553224,0.13910763,0.00026989888],"about_ca_topic_score_codex":0.00007382106,"about_ca_topic_score_gemma":0.000034428867,"teacher_disagreement_score":0.7567407,"about_ca_system_score_codex":0.000018873976,"about_ca_system_score_gemma":0.00004724998,"threshold_uncertainty_score":0.35185385},"labels":[],"label_agreement":null},{"id":"W2064454128","doi":"10.1016/j.comcom.2008.07.002","title":"Joint routing and admission control problem under statistical delay and jitter constraints in MPLS networks","year":2008,"lang":"en","type":"article","venue":"Computer Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Jitter; Multiprotocol Label Switching; Joint (building); Computer network; Routing (electronic design automation); Control (management); Real-time computing; Telecommunications; Quality of service; Artificial intelligence","score_opus":0.02559945579732793,"score_gpt":0.24036959107383035,"score_spread":0.21477013527650243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064454128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019574692,0.0010816694,0.9776811,0.0006847446,0.000029267894,0.0002209407,0.000004689666,0.00029921604,0.00042367954],"genre_scores_gemma":[0.6851126,0.00060388417,0.31412062,0.00011113235,0.000012958555,0.000017524091,0.0000070496503,0.0000122281035,0.0000020171265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992631,0.00005063087,0.0002633872,0.0001446173,0.000051027386,0.00022722973],"domain_scores_gemma":[0.9989467,0.0004525546,0.00002529114,0.00047453464,0.000023612667,0.00007727004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000090355774,0.00012588307,0.00019183265,0.00005496596,0.00014134574,0.000024991987,0.0002060888,0.0000961613,0.00000508486],"category_scores_gemma":[0.000020996087,0.0001237161,0.000012907568,0.00010807207,0.00050309085,0.0000879613,0.00030728278,0.00040817936,0.0000022535262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014184357,0.00015210835,0.01805093,0.00006239177,0.00011332265,0.000051981704,0.0007911349,0.53693086,0.00023516799,0.15750965,0.0016999763,0.2843883],"study_design_scores_gemma":[0.00047249824,0.000021972097,0.028226903,0.00007559875,0.000006528814,0.00007830576,0.000024766594,0.9666192,0.0000022988181,0.004016409,0.00030723243,0.00014832013],"about_ca_topic_score_codex":0.0000031248228,"about_ca_topic_score_gemma":0.000011973623,"teacher_disagreement_score":0.6655379,"about_ca_system_score_codex":0.00003610596,"about_ca_system_score_gemma":0.000008656493,"threshold_uncertainty_score":0.5044996},"labels":[],"label_agreement":null},{"id":"W2068712729","doi":"10.1016/j.comcom.2007.02.019","title":"Modeling end-to-end QoS management and real time agreement protocols for resource reservation for multimedia mobile radio network","year":2007,"lang":"en","type":"article","venue":"Computer Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Reservation; Computer network; Quality of service; End-to-end principle; Multimedia","score_opus":0.07876538636604183,"score_gpt":0.3591141181155309,"score_spread":0.28034873174948904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068712729","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050226756,0.00024198639,0.9709454,0.002574414,0.00007694501,0.024468286,0.000012070576,0.00023797672,0.0009406336],"genre_scores_gemma":[0.013930262,0.00014183903,0.9542854,0.000329086,0.00036693635,0.030203622,0.0002037311,0.00003868231,0.00050047494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972651,0.0002867617,0.0007384159,0.0005893538,0.0004199532,0.00070041494],"domain_scores_gemma":[0.9923949,0.001839301,0.00016785426,0.0048833536,0.0004463726,0.00026821697],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031825765,0.00024191594,0.0003001962,0.0002777709,0.0010409949,0.00036974758,0.005020546,0.00010769533,0.00000477895],"category_scores_gemma":[0.0000383265,0.00026386182,0.00010479616,0.0007547821,0.000116855656,0.00037799275,0.004214543,0.0002507633,0.0000198095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015124943,0.00047650412,0.00018839508,0.00014659004,0.00017332188,0.0000013029415,0.0024844103,0.23342977,0.00019088472,0.060630295,0.037670936,0.6644563],"study_design_scores_gemma":[0.0008290051,0.00019071867,0.0005440849,0.00013466901,0.000010512685,0.0000020368968,0.000029394798,0.8549804,0.000025008821,0.0010488475,0.14196992,0.0002353976],"about_ca_topic_score_codex":0.000036864192,"about_ca_topic_score_gemma":0.000084497915,"teacher_disagreement_score":0.6642209,"about_ca_system_score_codex":0.00019909655,"about_ca_system_score_gemma":0.000062461375,"threshold_uncertainty_score":0.99998134},"labels":[],"label_agreement":null},{"id":"W2070152796","doi":"10.1016/j.comcom.2004.02.026","title":"A computer aided tool for the performance evaluation of next generation WDM wavelength-routed optical networks","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Reservation; Network packet; Computer network; Routing and wavelength assignment; Wavelength-division multiplexing; Network topology; Modular design; Network simulation; Process (computing); Blocking (statistics); Real-time computing; Wavelength; Distributed computing","score_opus":0.07890231964956369,"score_gpt":0.2848430827973319,"score_spread":0.2059407631477682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070152796","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0997734,0.00094906375,0.8972017,0.0006201075,0.00030582503,0.00075564225,0.000003196765,0.00033892322,0.00005210268],"genre_scores_gemma":[0.5873503,0.0005166853,0.4116734,0.00004954109,0.000164139,0.0001793709,0.000048338698,0.000017188502,0.000001036167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989889,0.000042824347,0.00039346327,0.00015290054,0.00019280946,0.00022909274],"domain_scores_gemma":[0.9976352,0.00047809212,0.00006285511,0.0014833439,0.00031281792,0.000027693797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004069616,0.00015588323,0.00018207145,0.00005608943,0.00024768032,0.000053679913,0.0008975564,0.000120026925,0.0000030941524],"category_scores_gemma":[0.00003801634,0.00013166842,0.00007622749,0.00027842014,0.00019992211,0.00023625189,0.00030096364,0.0002826305,0.0000056013237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020009247,0.000027374743,0.000011683753,0.000006802328,0.00003563248,2.805542e-8,0.00005853171,0.7195963,0.00014252884,0.008333428,0.00016930993,0.27161637],"study_design_scores_gemma":[0.0006043418,0.000063406005,0.0013969596,0.00004318346,0.00006591416,0.0000033179867,0.000010495168,0.9960413,0.00027397225,0.00062433304,0.00072262104,0.00015014668],"about_ca_topic_score_codex":0.0000013310074,"about_ca_topic_score_gemma":0.000010068165,"teacher_disagreement_score":0.4875769,"about_ca_system_score_codex":0.0001388703,"about_ca_system_score_gemma":0.000031064847,"threshold_uncertainty_score":0.53692824},"labels":[],"label_agreement":null},{"id":"W2072063356","doi":"10.1016/j.comcom.2006.02.006","title":"A lightweight secure protocol for wireless sensor networks","year":2006,"lang":"en","type":"article","venue":"Computer Communications","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Computer network; Protocol (science); Wireless sensor network; Wireless Transport Layer Security; Wireless network; Wireless; Computer security; Key distribution in wireless sensor networks; Telecommunications","score_opus":0.028390619704820864,"score_gpt":0.2924971031439529,"score_spread":0.264106483439132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072063356","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008409286,0.000070756316,0.9405439,0.0037030994,0.00029635863,0.05283141,0.000006944522,0.00075426954,0.0017091825],"genre_scores_gemma":[0.036879625,0.00001029228,0.7642166,0.0009109113,0.001197029,0.19641614,0.000082905935,0.00006077731,0.00022572487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775267,0.00025593897,0.0006004238,0.00056106027,0.00024572093,0.00058420806],"domain_scores_gemma":[0.9939206,0.00080442586,0.00027357825,0.004511916,0.00036582255,0.00012362623],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002814096,0.0003210186,0.00033752946,0.0001449782,0.0007158742,0.0004779542,0.0050053447,0.00021353526,0.0000068356744],"category_scores_gemma":[0.00000743068,0.00032087544,0.0002115156,0.00066334114,0.00018385942,0.00041210736,0.0015432605,0.00043293776,0.000034698107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002218704,0.00091604266,0.00046189807,0.00007461681,0.00007103983,0.000007940414,0.0005638973,0.02161903,0.00006683203,0.83146966,0.10767893,0.037047945],"study_design_scores_gemma":[0.0007786419,0.000059764676,0.00031211687,0.000066816654,0.0000074429768,0.000024756237,0.000003832952,0.7826585,0.000082527375,0.0043211314,0.21136305,0.00032138775],"about_ca_topic_score_codex":0.00003731927,"about_ca_topic_score_gemma":0.00007502211,"teacher_disagreement_score":0.8271485,"about_ca_system_score_codex":0.000086621476,"about_ca_system_score_gemma":0.00007146385,"threshold_uncertainty_score":0.9999243},"labels":[],"label_agreement":null},{"id":"W2073286884","doi":"10.1016/j.comcom.2015.01.002","title":"A data delivery framework for cognitive information-centric sensor networks in smart outdoor monitoring","year":2015,"lang":"en","type":"article","venue":"Computer Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Wireless sensor network; Cognitive network; Cognitive radio; Cognition; Analytic hierarchy process; Data mining; Computer network; Wireless","score_opus":0.11499256822544557,"score_gpt":0.3212099022091837,"score_spread":0.20621733398373815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073286884","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025203046,0.0009901677,0.9930373,0.0011606341,0.0011700873,0.00053224387,0.00003714207,0.0002680987,0.00028405816],"genre_scores_gemma":[0.38608864,0.00018464701,0.6127581,0.00037259303,0.00021006945,0.00007562101,0.00028744226,0.000014044538,0.000008843962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800926,0.00025963396,0.000582063,0.00039742058,0.00027306293,0.0004785608],"domain_scores_gemma":[0.992765,0.0020925968,0.00024356319,0.004172549,0.0005213085,0.00020495897],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0006749238,0.00022215093,0.00026796618,0.0002916277,0.0002723978,0.00041850138,0.00565266,0.00016783002,7.3628695e-7],"category_scores_gemma":[0.0002746419,0.00024460148,0.00006157314,0.0011118647,0.00010090416,0.0016165157,0.004218112,0.00050260586,0.00003999677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056339442,0.0007043788,0.01706043,0.000033386405,0.0001403207,0.000008922187,0.004568133,0.6443307,0.0000010110143,0.074414246,0.0056714015,0.25301072],"study_design_scores_gemma":[0.0007344884,0.000042814372,0.002015302,0.00020235342,0.000013582445,0.000008993495,0.00016208575,0.98546034,0.0000042594565,0.0004973207,0.010590653,0.0002678039],"about_ca_topic_score_codex":0.000049887083,"about_ca_topic_score_gemma":0.000030774874,"teacher_disagreement_score":0.38356832,"about_ca_system_score_codex":0.00013219379,"about_ca_system_score_gemma":0.00015091371,"threshold_uncertainty_score":0.99972725},"labels":[],"label_agreement":null},{"id":"W2076786893","doi":"10.1016/j.comcom.2007.12.028","title":"Game theoretic models for detecting network intrusions","year":2008,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Network packet; Intrusion detection system; Computer network; Router; Packet drop attack; Game theory; Path (computing); Node (physics); Routing (electronic design automation); Packet forwarding; Computer security; Distributed computing; Routing protocol; Mathematics","score_opus":0.05402245004381441,"score_gpt":0.26408798522228244,"score_spread":0.21006553517846804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076786893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027480402,0.00066140015,0.9917239,0.0014069182,0.00061582983,0.00039619644,0.0000022202858,0.000473093,0.0019724157],"genre_scores_gemma":[0.59582424,0.00041825185,0.40266457,0.00062604726,0.00029913493,0.00010134281,0.000009624425,0.000013155721,0.000043657135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985657,0.00021233896,0.0003630795,0.0003355921,0.0001529362,0.0003704007],"domain_scores_gemma":[0.9961612,0.000747215,0.00014344024,0.0026343365,0.00020123686,0.00011257544],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00037913324,0.00016236029,0.000196227,0.00010211581,0.0015511073,0.00011546325,0.002786593,0.00009411527,0.0000065952454],"category_scores_gemma":[0.000022993516,0.00016578553,0.00014689064,0.0006150591,0.00019986821,0.0005672449,0.0017116579,0.00031099585,0.000030509935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007807281,0.00012015726,0.000046532296,0.000011535002,0.000030889125,0.0000015760031,0.002329026,0.048317764,0.00001964085,0.8665665,0.004809571,0.07773904],"study_design_scores_gemma":[0.00020605784,0.00007718047,0.00010129646,0.000033778106,0.0000062113327,0.000063603664,0.000004716941,0.8235108,0.000036432044,0.15379241,0.022001531,0.00016595412],"about_ca_topic_score_codex":0.000009815785,"about_ca_topic_score_gemma":0.0000363628,"teacher_disagreement_score":0.77519304,"about_ca_system_score_codex":0.00004748219,"about_ca_system_score_gemma":0.000065379536,"threshold_uncertainty_score":0.99974877},"labels":[],"label_agreement":null},{"id":"W2078943717","doi":"10.1016/j.comcom.2012.08.002","title":"An efficient cooperative ARQ protocol for wireless relay networks","year":2012,"lang":"en","type":"article","venue":"Computer Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Retransmission; Computer science; Selective Repeat ARQ; Computer network; Automatic repeat request; Relay; Sliding window protocol; Go-Back-N ARQ; Hybrid automatic repeat request; Network packet; Node (physics); Transmission (telecommunications); Real-time computing; Telecommunications; Telecommunications link; Window (computing); Engineering","score_opus":0.08831808563240486,"score_gpt":0.36968799335247754,"score_spread":0.2813699077200727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078943717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021097281,0.00017684366,0.95873326,0.0014159019,0.00024469843,0.03784613,0.0000031113152,0.00039605395,0.00097302184],"genre_scores_gemma":[0.42888296,0.000040673694,0.39805338,0.0011586449,0.00036503642,0.17133097,0.00005540429,0.000034713965,0.0000782255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977296,0.0007289875,0.00047977373,0.0003580802,0.0001721043,0.00053144],"domain_scores_gemma":[0.99340266,0.00061271875,0.0001956259,0.0050010397,0.00050134194,0.00028659482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009001587,0.00025956862,0.0002627652,0.00012093029,0.001299576,0.00035599186,0.005018051,0.0001012116,0.000014775213],"category_scores_gemma":[0.000023262255,0.00024483138,0.000110677516,0.0006660755,0.00018068947,0.0007445862,0.0017951411,0.00038207366,0.00003596054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002261987,0.0020599163,0.00071732746,0.000020121523,0.00006817118,3.1126882e-7,0.004714401,0.05452276,0.00023924602,0.7459953,0.008856289,0.18278353],"study_design_scores_gemma":[0.0006649908,0.00012167393,0.0011036913,0.00005020683,0.000006097616,0.0000070906517,0.000020042971,0.9094042,0.000103759565,0.00005655222,0.088163525,0.00029813367],"about_ca_topic_score_codex":0.0000024290919,"about_ca_topic_score_gemma":0.000014336851,"teacher_disagreement_score":0.85488147,"about_ca_system_score_codex":0.00010366328,"about_ca_system_score_gemma":0.0000910339,"threshold_uncertainty_score":0.999542},"labels":[],"label_agreement":null},{"id":"W2079836094","doi":"10.1016/j.comcom.2006.07.005","title":"Multiple link failures survivability of optical networks with traffic grooming capability","year":2006,"lang":"en","type":"article","venue":"Computer Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Concordia University","funders":"","keywords":"Traffic grooming; Computer science; Survivability; Spare part; Computer network; Provisioning; Distributed computing; Robustness (evolution); Overhead (engineering); Bandwidth (computing); Wavelength-division multiplexing","score_opus":0.01267048672560023,"score_gpt":0.21506698138483268,"score_spread":0.20239649465923246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079836094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2331476,0.0006571108,0.7640267,0.00044481797,0.000063679654,0.0002485531,0.0000051436145,0.0009464416,0.00045995097],"genre_scores_gemma":[0.60505074,0.000029384542,0.39481398,0.000004022831,0.00004100306,0.000022927376,0.000020698732,0.000015962065,0.0000012636414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902046,0.000054660417,0.0003781383,0.00018565018,0.00010119022,0.00025992343],"domain_scores_gemma":[0.9968035,0.0010281231,0.000044540426,0.0019834458,0.00009785311,0.00004249669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014618777,0.00016769079,0.0002706848,0.00004947056,0.00010862968,0.00002231494,0.0008826299,0.00012709424,0.0000035433159],"category_scores_gemma":[0.00003582727,0.00015443187,0.00006273238,0.00033411503,0.0006150368,0.00011013888,0.00033102214,0.00042086738,0.0000022209713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050190756,0.00008721476,0.004554325,0.000025107009,0.000019969235,4.2760578e-7,0.000025328203,0.9585888,0.00004529137,0.005527421,0.000074063835,0.031047052],"study_design_scores_gemma":[0.00022237739,0.000038141017,0.020562394,0.000033206863,0.0000138054975,0.0000032288076,0.000020648413,0.97686285,0.00007835289,0.0008458544,0.0011420518,0.00017709621],"about_ca_topic_score_codex":0.000029420373,"about_ca_topic_score_gemma":0.00064072385,"teacher_disagreement_score":0.37190315,"about_ca_system_score_codex":0.00006292573,"about_ca_system_score_gemma":0.0000099933095,"threshold_uncertainty_score":0.62975484},"labels":[],"label_agreement":null},{"id":"W2083395410","doi":"10.1016/j.comcom.2005.12.004","title":"Adaptive model predictive TCP delay-based congestion control","year":2006,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Computer science; CUBIC TCP; TCP Vegas; TCP acceleration; TCP global synchronization; TCP Friendly Rate Control; TCP tuning; Zeta-TCP; TCP Westwood plus; Computer network; Compound TCP; Transmission Control Protocol; Network congestion; H-TCP; HSTCP; Model predictive control; Real-time computing; Algorithm; Network packet; Control (management); Artificial intelligence","score_opus":0.01935276739654083,"score_gpt":0.22704900986985574,"score_spread":0.20769624247331492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083395410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002623376,0.00056864886,0.98861355,0.0059284056,0.00022092415,0.00045005346,0.00002364034,0.00071966933,0.00321276],"genre_scores_gemma":[0.75119805,0.000012048317,0.24727446,0.0010934909,0.00013867559,0.00014759808,0.000034708723,0.000012934682,0.000088036846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827075,0.0003067603,0.00040676337,0.0004200734,0.00026400783,0.00033164473],"domain_scores_gemma":[0.9964062,0.00055828865,0.00019196859,0.0023305973,0.00039920592,0.0001137177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026827585,0.00023107415,0.00025483817,0.00014156556,0.00046367897,0.00018449464,0.0025068782,0.000111702466,0.0000043742352],"category_scores_gemma":[0.000009283025,0.0002390771,0.00013350106,0.000380042,0.00021099132,0.00042347884,0.00035735345,0.00032449048,0.00007116031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018593746,0.00021273972,0.0001325265,0.0000017862934,0.000031779124,0.000002417485,0.00005908034,0.6517886,0.000011541484,0.28609064,0.0048699724,0.056780342],"study_design_scores_gemma":[0.0013366711,0.000108358785,0.0010814067,0.000028742188,0.00003195464,0.0000073531196,0.0000037215339,0.987529,0.0000059398994,0.007181861,0.002443774,0.00024124226],"about_ca_topic_score_codex":0.00003294614,"about_ca_topic_score_gemma":0.000049555383,"teacher_disagreement_score":0.75093573,"about_ca_system_score_codex":0.000097036784,"about_ca_system_score_gemma":0.00022162416,"threshold_uncertainty_score":0.97492814},"labels":[],"label_agreement":null},{"id":"W2083655613","doi":"10.1016/s0140-3664(03)00119-1","title":"Supporting Quality of Service in IP multicast networks","year":2003,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Multicast; Computer network; IP multicast; Xcast; Source-specific multicast; Quality of service; Service (business); Internet Group Management Protocol; Pragmatic General Multicast","score_opus":0.05548209764131507,"score_gpt":0.3347569254377961,"score_spread":0.27927482779648105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083655613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064896075,0.0005100362,0.98822844,0.002579633,0.0001828558,0.00018529949,9.475784e-7,0.00010755172,0.0017156313],"genre_scores_gemma":[0.82862884,0.000030219406,0.17043665,0.00083295,0.000020562395,0.000021204067,0.000004719384,0.000005614312,0.000019244242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981702,0.0005818361,0.00062264677,0.00022944126,0.0001308252,0.00026503718],"domain_scores_gemma":[0.9965685,0.00073222665,0.00023500818,0.0022005157,0.00019020015,0.00007353794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094741443,0.00011312564,0.00023673633,0.000083194886,0.00011881292,0.0000548274,0.0020182487,0.00006183633,0.0000081100525],"category_scores_gemma":[0.000050086757,0.000120824654,0.00006258765,0.00072848465,0.00006372452,0.00021565131,0.00049630716,0.0002495927,0.000013277983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035677976,0.000358885,0.0075121527,0.000016993079,0.000025680112,0.0000015489242,0.0010485842,0.035581414,0.00002597139,0.6920634,0.0002940989,0.2630677],"study_design_scores_gemma":[0.00048667722,0.000014443609,0.013109791,0.000032387714,0.0000033849342,0.0000042006927,0.000029705807,0.98242575,0.00000771136,0.0010394716,0.0027138104,0.00013266607],"about_ca_topic_score_codex":0.000057200272,"about_ca_topic_score_gemma":0.00028570218,"teacher_disagreement_score":0.94684434,"about_ca_system_score_codex":0.00002623873,"about_ca_system_score_gemma":0.00007453959,"threshold_uncertainty_score":0.49270865},"labels":[],"label_agreement":null},{"id":"W2083990345","doi":"10.1016/j.comcom.2011.09.008","title":"Biconnecting a network of mobile robots using virtual angular forces","year":2011,"lang":"en","type":"article","venue":"Computer Communications","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Node (physics); Position (finance); Software deployment; Spring (device); Robot; Wireless network; Fault tolerance; Wireless; Distributed computing; Topology (electrical circuits); Simulation; Artificial intelligence; Telecommunications; Mathematics; Mechanical engineering; Physics","score_opus":0.0789533535320445,"score_gpt":0.2597017871770721,"score_spread":0.1807484336450276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083990345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11593429,0.0016611632,0.8805077,0.0000041580947,0.00022772877,0.00013501721,0.0000019506438,0.00014319197,0.0013847802],"genre_scores_gemma":[0.78040785,0.00011372306,0.21936896,0.000014414552,0.00005599972,0.000011319028,0.000004616593,0.000016972313,0.0000061676747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938273,0.000042931333,0.00026415527,0.00009063485,0.000058678972,0.00016086463],"domain_scores_gemma":[0.99874926,0.00007864934,0.000051779643,0.0010163273,0.00006395943,0.000040044146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012301496,0.00009658743,0.00015389595,0.000040305997,0.00012723323,0.000014963733,0.0006821641,0.00004490207,0.000036685764],"category_scores_gemma":[0.0000047689277,0.00010169881,0.000058193476,0.00019684323,0.0000676059,0.00009618947,0.0002703913,0.00012464648,0.000007777532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010706103,0.000040440158,0.0006936542,0.000016515081,0.000056097393,6.752735e-7,0.0024521388,0.95308125,0.00059458,0.008527332,0.000111311514,0.03442493],"study_design_scores_gemma":[0.000050652696,0.000042027048,0.0004555833,0.000069789465,0.000015480035,0.0000069388175,0.000092450544,0.9963615,0.0015312935,0.0005722701,0.0006687713,0.00013327562],"about_ca_topic_score_codex":0.00006407057,"about_ca_topic_score_gemma":0.000021098513,"teacher_disagreement_score":0.66447353,"about_ca_system_score_codex":0.000019579293,"about_ca_system_score_gemma":0.000010528616,"threshold_uncertainty_score":0.4147157},"labels":[],"label_agreement":null},{"id":"W2086629700","doi":"10.1016/s0140-3664(02)00094-4","title":"Evaluating location management schemes for third generation mobile networks","year":2002,"lang":"en","type":"article","venue":"Computer Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Mobility management; Interval (graph theory); Scheme (mathematics); Computer network; Set (abstract data type); Class (philosophy); Management strategy; Real-time computing; Artificial intelligence","score_opus":0.20838198455070356,"score_gpt":0.3902262192306008,"score_spread":0.18184423467989724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086629700","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035020604,0.004270785,0.98879313,0.002706109,0.0002638658,0.0013834684,0.0000015282701,0.00038360164,0.0018473081],"genre_scores_gemma":[0.3621005,0.0014515612,0.63376904,0.00037174847,0.00020639451,0.0016081863,0.00008868143,0.000019674428,0.00038418663],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774814,0.0004683875,0.0005308274,0.00047350014,0.000371923,0.00040724647],"domain_scores_gemma":[0.99263203,0.0005879893,0.00020584793,0.0058363765,0.00062391406,0.000113814276],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.000968368,0.0001995071,0.00019715886,0.0002101336,0.0010744303,0.00050904904,0.0055892235,0.00009828455,0.000013424235],"category_scores_gemma":[0.000030035499,0.0002188246,0.000101623125,0.0010330939,0.00012489692,0.0006589046,0.0027130365,0.00031571978,0.000084489235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001692021,0.00027336477,0.00003529082,0.000024308878,0.00006220402,2.930256e-7,0.00041112633,0.15760602,0.00005274987,0.14542562,0.019841751,0.6762656],"study_design_scores_gemma":[0.0004124215,0.00009495434,0.000112012734,0.000041405478,0.000011677219,0.0000040095238,0.000013347267,0.9452634,0.000030729287,0.0005077975,0.053294174,0.00021410066],"about_ca_topic_score_codex":0.000004762437,"about_ca_topic_score_gemma":0.000011917389,"teacher_disagreement_score":0.7876574,"about_ca_system_score_codex":0.00014199312,"about_ca_system_score_gemma":0.000027130076,"threshold_uncertainty_score":0.999791},"labels":[],"label_agreement":null},{"id":"W2087935504","doi":"10.1016/j.comcom.2006.09.006","title":"FH-RSVP scheme for intra-site handover in hierarchical mobile IPv6 networks","year":2006,"lang":"en","type":"article","venue":"Computer Communications","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Mobile IP; Handover; Computer network; Scheme (mathematics); IPv6; Distributed computing; World Wide Web; The Internet","score_opus":0.01024806448388099,"score_gpt":0.23053799354450735,"score_spread":0.22028992906062636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087935504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08262217,0.00692909,0.9042282,0.00034689708,0.0009572665,0.0016624229,0.00007386348,0.0007418044,0.002438252],"genre_scores_gemma":[0.9108446,0.00028015111,0.08694148,0.00017010343,0.0006135054,0.0006359532,0.00039155918,0.000064010215,0.000058635913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837494,0.00012861825,0.000556788,0.0002939203,0.00013117676,0.0005145333],"domain_scores_gemma":[0.9971939,0.0006098985,0.00005639977,0.0019644601,0.00008432372,0.000091017275],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035512485,0.00026037448,0.00034753466,0.00013348402,0.00019736923,0.00011311592,0.0010651127,0.0002093239,0.000018631095],"category_scores_gemma":[0.000010450196,0.00029977015,0.00014619042,0.00041723624,0.00018154,0.00020518844,0.000510884,0.0006936131,0.000026489495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006844706,0.0010391476,0.009475105,0.0001733626,0.00012197406,0.0000052466467,0.001058478,0.8783603,0.0002600193,0.032758124,0.03171648,0.044963345],"study_design_scores_gemma":[0.0010283842,0.00003562191,0.005627991,0.000051028816,0.000015313452,0.0000046264126,0.000005114968,0.88928074,0.000029323517,0.0022854642,0.10134445,0.0002919632],"about_ca_topic_score_codex":0.00007480638,"about_ca_topic_score_gemma":0.0013294916,"teacher_disagreement_score":0.82822245,"about_ca_system_score_codex":0.00017098094,"about_ca_system_score_gemma":0.000024891415,"threshold_uncertainty_score":0.99994546},"labels":[],"label_agreement":null},{"id":"W2089347901","doi":"10.1016/j.comcom.2014.05.007","title":"Optimal selection of aggregation locations for participatory sensing by mobile cyber-physical systems","year":2014,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université de Sherbrooke","funders":"","keywords":"Computer science; Participatory sensing; USable; Data aggregator; Cyber-physical system; Base station; Mobile device; Citizen journalism; Distributed computing; Computer network; Wireless sensor network; Data science; World Wide Web","score_opus":0.02992319080151227,"score_gpt":0.2837404401565214,"score_spread":0.2538172493550091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089347901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07493035,0.00016279014,0.9236546,0.00033687553,0.00021274378,0.00039104198,0.000005205661,0.00019963783,0.00010673185],"genre_scores_gemma":[0.83113027,0.000007307028,0.16852733,0.00006427553,0.000114278446,0.00008312792,0.00003169843,0.000014199032,0.000027521794],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986635,0.0002947706,0.0003662564,0.00028598052,0.00015815224,0.00023134085],"domain_scores_gemma":[0.99704975,0.0006886927,0.00023789449,0.0015744057,0.00036649732,0.00008274485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044498712,0.0001392478,0.00023359757,0.00010019629,0.0004776476,0.00016519114,0.0008529589,0.000062269115,3.3724837e-7],"category_scores_gemma":[0.000037982063,0.00015152786,0.00009635466,0.00033708557,0.00013804075,0.00026101538,0.000286265,0.00013938436,0.0000068864842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012093969,0.0010335519,0.00045598682,0.00020866278,0.00016989815,2.6762345e-7,0.0076619196,0.33352807,0.022148037,0.10451029,0.018383412,0.5118878],"study_design_scores_gemma":[0.0002055065,0.00012999581,0.00008428501,0.00006968922,0.000021984948,0.000009487775,0.00004420479,0.98182595,0.00393862,0.00021290423,0.013306546,0.00015081392],"about_ca_topic_score_codex":0.00005256707,"about_ca_topic_score_gemma":0.000006936774,"teacher_disagreement_score":0.7561999,"about_ca_system_score_codex":0.000059649148,"about_ca_system_score_gemma":0.000047260586,"threshold_uncertainty_score":0.61791265},"labels":[],"label_agreement":null},{"id":"W2091458970","doi":"10.1016/j.comcom.2006.04.018","title":"Management and admission control based on policies and measurements for the packet-switched domain of the UMTS core network","year":2006,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; UMTS frequency bands; Network packet; Domain (mathematical analysis); Computer network; Core (optical fiber); Control (management); Real-time computing; Telecommunications; Artificial intelligence","score_opus":0.036253919116719165,"score_gpt":0.25506885550245767,"score_spread":0.2188149363857385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091458970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002176578,0.0014097625,0.97622454,0.018549316,0.00017702059,0.00092676113,0.00000478597,0.000054617216,0.0004766337],"genre_scores_gemma":[0.9495328,0.000043255972,0.04888748,0.0013063382,0.00008018704,0.00009753447,0.0000030073627,0.0000064751794,0.00004294194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990935,0.00015906699,0.00022314553,0.00017455121,0.00017873911,0.00017102314],"domain_scores_gemma":[0.99744725,0.00079476606,0.00013929236,0.001489423,0.00008865076,0.000040594525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004332636,0.00011766632,0.00013876754,0.000031549604,0.0006151631,0.0000910062,0.0012866034,0.000033562435,6.81168e-7],"category_scores_gemma":[0.00000716655,0.000072113355,0.00005872137,0.00019624559,0.00016236308,0.00005123852,0.00040045116,0.00009615786,5.009072e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066140405,0.00028730728,0.00960952,0.00003790329,0.00015348113,4.2410488e-7,0.0003392957,0.05280508,0.000046142883,0.4804431,0.015298677,0.44091293],"study_design_scores_gemma":[0.0013504439,0.00004613024,0.05305626,0.00008703858,0.00003892957,0.0000013767387,0.0000104186465,0.9272129,0.000004442129,0.006551301,0.011549584,0.00009116007],"about_ca_topic_score_codex":0.0000117379395,"about_ca_topic_score_gemma":0.00003361754,"teacher_disagreement_score":0.9473562,"about_ca_system_score_codex":0.000016593474,"about_ca_system_score_gemma":0.000025602096,"threshold_uncertainty_score":0.47313997},"labels":[],"label_agreement":null},{"id":"W2091874493","doi":"10.1016/j.comcom.2009.11.020","title":"A global profile-based algorithm for energy minimization in object tracking sensor networks","year":2009,"lang":"en","type":"article","venue":"Computer Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Wireless sensor network; Exploit; Video tracking; Minification; Energy consumption; Tracking (education); Real-time computing; Energy minimization; Object (grammar); Host (biology); Key distribution in wireless sensor networks; Energy (signal processing); Scheme (mathematics); Algorithm; Artificial intelligence; Wireless; Wireless network; Computer network; Telecommunications; Computer security","score_opus":0.02179760013758616,"score_gpt":0.26668703099076924,"score_spread":0.24488943085318307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091874493","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012134368,0.0007057665,0.9956183,0.0020488785,0.0003235822,0.0003407214,0.000007539353,0.00036779337,0.00046606833],"genre_scores_gemma":[0.23028687,0.000062500825,0.7679814,0.0012989332,0.00013715212,0.000070824804,0.00012981518,0.000012751461,0.000019738512],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980151,0.00030308813,0.00050015416,0.00049985264,0.00019866989,0.00048315767],"domain_scores_gemma":[0.9967568,0.0004614405,0.00019697248,0.0022436727,0.00023644372,0.000104700724],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022119693,0.00024370702,0.00027909558,0.0001853785,0.00031215866,0.00026928194,0.0025458108,0.00015889578,0.0000013370668],"category_scores_gemma":[0.000015261,0.00027055424,0.00013427071,0.0013494705,0.000074004754,0.0002960372,0.00031701583,0.00016865395,0.000002008972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003031127,0.00021169335,0.00007924549,0.0000015975124,0.0000060541074,0.000002010163,0.000051753446,0.44784936,0.000001937748,0.020307615,0.00048005048,0.5310056],"study_design_scores_gemma":[0.0007540233,0.00011175513,0.0023558005,0.00007415329,0.0000072205057,0.000008863971,0.0000048031566,0.9921086,0.000028388691,0.00044118444,0.0038236647,0.00028155794],"about_ca_topic_score_codex":0.00003234905,"about_ca_topic_score_gemma":0.000099780365,"teacher_disagreement_score":0.5442592,"about_ca_system_score_codex":0.0001879282,"about_ca_system_score_gemma":0.000105209656,"threshold_uncertainty_score":0.99997467},"labels":[],"label_agreement":null},{"id":"W2093232845","doi":"10.1016/j.comcom.2006.03.004","title":"SSL/TLS session-aware user authentication – Or how to effectively thwart the man-in-the-middle","year":2006,"lang":"en","type":"article","venue":"Computer Communications","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universität Zürich; University of Toronto","keywords":"Computer science; Man-in-the-middle attack; Session (web analytics); Computer security; Authentication (law); Transport Layer Security; Countermeasure; The Internet; Computer network; World Wide Web; Encryption","score_opus":0.05916328874943429,"score_gpt":0.2865896988356036,"score_spread":0.22742641008616932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093232845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030465635,0.00025052985,0.8558627,0.10986176,0.0005234884,0.0018574995,0.000011281065,0.000327458,0.00083969615],"genre_scores_gemma":[0.9831864,0.00001442899,0.013069726,0.0021648272,0.00012735052,0.00038881466,0.000030324149,0.000015612804,0.0010024888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974739,0.001006501,0.0003918055,0.000402924,0.00040158347,0.0003233198],"domain_scores_gemma":[0.9939989,0.0009377037,0.00015981481,0.00462929,0.00020060319,0.0000736849],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00094058213,0.00020655099,0.00020266208,0.00018206847,0.0007361649,0.0008229068,0.0063160756,0.00007376406,0.000007528487],"category_scores_gemma":[0.00004411019,0.0001260404,0.00010471025,0.0011864771,0.000119098826,0.0004447898,0.0011263379,0.00029798067,0.000257796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022492759,0.0026267967,0.0063269455,0.0001341375,0.00011201627,0.000015883004,0.2310958,0.00026651277,0.00068544166,0.59547603,0.13537039,0.02786752],"study_design_scores_gemma":[0.00082412054,0.00014986568,0.1756122,0.00026859975,0.000035819943,0.00008723998,0.0009897774,0.4904863,0.00016745464,0.0067191683,0.32403392,0.0006255466],"about_ca_topic_score_codex":0.00013125804,"about_ca_topic_score_gemma":0.00056297204,"teacher_disagreement_score":0.9527208,"about_ca_system_score_codex":0.00007924445,"about_ca_system_score_gemma":0.00008091896,"threshold_uncertainty_score":0.9990602},"labels":[],"label_agreement":null},{"id":"W2094367780","doi":"10.1016/j.comcom.2004.09.011","title":"An approach for managing global mobility and roaming in the next-generation wireless systems","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Roaming; Computer science; Computer network; Interoperability; Wireless network; Default gateway; Wireless; Process (computing); Heterogeneous network; Cellular network; Telecommunications; Distributed computing; World Wide Web","score_opus":0.15251501052663713,"score_gpt":0.34349404721837656,"score_spread":0.19097903669173943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094367780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021089522,0.0014850586,0.972768,0.0031014998,0.00007627932,0.0009855323,0.0000040630034,0.00011653211,0.00037350293],"genre_scores_gemma":[0.72418296,0.00018962492,0.27492228,0.00016746139,0.000065866334,0.00039993928,0.00006369252,0.0000067583037,0.0000014296279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979055,0.0007838831,0.00036991545,0.0003995484,0.00024389493,0.00029728108],"domain_scores_gemma":[0.99458796,0.00033346316,0.00010256436,0.0047373404,0.00016016778,0.000078488985],"candidate_categories":["scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015130567,0.0001482689,0.00017825671,0.00009287433,0.00072225824,0.0010834514,0.005888684,0.00007214388,1.1302175e-7],"category_scores_gemma":[0.0000138192045,0.00012991457,0.000042397838,0.00072416075,0.0001832168,0.00096011773,0.0012326445,0.00028633166,0.0000013428761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003184629,0.0005879669,0.00079828984,0.000042171738,0.000015841435,5.75922e-7,0.002569058,0.12808573,0.00010765687,0.7750082,0.00007487933,0.092706464],"study_design_scores_gemma":[0.00038134382,0.000042584634,0.0038670276,0.000025768803,0.0000034860097,0.000018689198,0.0002523068,0.99185854,0.0000043834375,0.003168144,0.00024027126,0.00013746005],"about_ca_topic_score_codex":0.00027041405,"about_ca_topic_score_gemma":0.00016074283,"teacher_disagreement_score":0.8637728,"about_ca_system_score_codex":0.00018475502,"about_ca_system_score_gemma":0.00009023075,"threshold_uncertainty_score":0.9999535},"labels":[],"label_agreement":null},{"id":"W2114897178","doi":"10.1016/j.comcom.2004.02.007","title":"Performance evaluation of a broadband wireless access system subjected to heavy load","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Broadband; Wireless broadband; Broadband networks; Base station; Telecommunications; Wireless; Computer network; Point (geometry); Fixed wireless; Wireless network; Wi-Fi array","score_opus":0.09206807921481702,"score_gpt":0.35441744530049807,"score_spread":0.26234936608568105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114897178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41792074,0.00060679874,0.57269037,0.0027990136,0.0002159559,0.0011383556,0.0000048556717,0.0003684113,0.0042554857],"genre_scores_gemma":[0.91164255,0.00017441626,0.08767878,0.00012016189,0.00004604192,0.00028276604,0.000019948006,0.000019245585,0.00001610368],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99646884,0.0007814176,0.0006643774,0.0004254499,0.001274859,0.00038506096],"domain_scores_gemma":[0.9895109,0.00031142106,0.00025772417,0.007359811,0.002358647,0.00020148847],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0020071042,0.00020933554,0.00032638875,0.00034485135,0.00040923152,0.00033320376,0.011490565,0.00009529562,0.0000039851307],"category_scores_gemma":[0.000050582985,0.00022000224,0.000089328365,0.002245806,0.00017747417,0.00096128567,0.005544251,0.00036327014,0.00008221033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055366552,0.0012305501,0.0049800705,0.00024195046,0.00019401619,0.0000018915912,0.0071256575,0.22123076,0.0015525148,0.11776009,0.0014523912,0.64417475],"study_design_scores_gemma":[0.0010749751,0.000104280014,0.023742907,0.00045338864,0.000019439616,0.000025704312,0.00003352987,0.9716327,0.0016293011,0.00021743009,0.00080009777,0.00026625535],"about_ca_topic_score_codex":0.00019431897,"about_ca_topic_score_gemma":0.00015586223,"teacher_disagreement_score":0.7504019,"about_ca_system_score_codex":0.00085242157,"about_ca_system_score_gemma":0.0010140602,"threshold_uncertainty_score":0.99385774},"labels":[],"label_agreement":null},{"id":"W2122857222","doi":"10.1016/j.comcom.2008.07.016","title":"Priority queuing of long-range dependent traffic","year":2008,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Queue management system; Queue; Bulk queue; Multilevel queue; Queueing theory; Priority queue; Real-time computing; Computer network","score_opus":0.03468011940471879,"score_gpt":0.2530783233760022,"score_spread":0.21839820397128343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122857222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059206527,0.0017287553,0.93547046,0.0018709531,0.00030312897,0.00021919036,0.0000022160332,0.00031388915,0.0008848844],"genre_scores_gemma":[0.8969561,0.0003484735,0.102304496,0.00019384696,0.00007404754,0.000021165584,0.000005029961,0.0000073940823,0.00008944201],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987469,0.0002060103,0.00036237636,0.0002474322,0.00022624146,0.00021107148],"domain_scores_gemma":[0.99676585,0.00030345182,0.00014975526,0.0024976886,0.00018733836,0.00009591327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022899109,0.00013084695,0.00022100096,0.000097909484,0.00034335992,0.00004179033,0.0030104434,0.00006047042,0.0000069180314],"category_scores_gemma":[0.000010771519,0.00013522961,0.00010618655,0.0003634951,0.00018014258,0.00028207886,0.0007891061,0.00023283172,0.00004072774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005921416,0.0005261143,0.005419294,0.00001637134,0.00007253193,0.000021383226,0.002483014,0.0089732865,0.000017939334,0.046412345,0.0016413097,0.9344105],"study_design_scores_gemma":[0.00065955543,0.00007278419,0.024885604,0.00004365229,0.000014525298,0.000126641,0.000009469121,0.97005486,0.000022004982,0.00017541183,0.0036971706,0.00023832377],"about_ca_topic_score_codex":0.000013827977,"about_ca_topic_score_gemma":0.000051584146,"teacher_disagreement_score":0.96108156,"about_ca_system_score_codex":0.000034437577,"about_ca_system_score_gemma":0.00011973499,"threshold_uncertainty_score":0.5594203},"labels":[],"label_agreement":null},{"id":"W2126781925","doi":"10.1016/j.comcom.2013.03.001","title":"Comparison of PI controllers designed for the delay model of TCP/AQM networks","year":2013,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université de Montréal","funders":"","keywords":"Active queue management; Computer science; Network congestion; Robustness (evolution); Queue; Computer network; Flow control (data); PID controller; Control theory (sociology); Control (management); Control engineering; Engineering; Network packet","score_opus":0.06081634683340278,"score_gpt":0.2979869743649653,"score_spread":0.2371706275315625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126781925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000630355,0.0019675256,0.9918223,0.004145673,0.00016470396,0.0009368739,0.000003757585,0.0000837338,0.00024505836],"genre_scores_gemma":[0.7493468,0.00007892042,0.24995136,0.00029591157,0.000038322287,0.00022992743,0.0000056015924,0.0000082516535,0.000044885397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986347,0.000177676,0.00060194626,0.00019642626,0.0001553165,0.00023391834],"domain_scores_gemma":[0.99426425,0.0023642865,0.00036464515,0.0024418093,0.00049562484,0.00006938011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035914214,0.00014593391,0.00037438518,0.00006297169,0.00030983306,0.00007796717,0.0037253366,0.000074603966,0.0000051523034],"category_scores_gemma":[0.000020628782,0.000112207614,0.00017847915,0.0002678395,0.00024296038,0.00021766302,0.000551623,0.00017484413,0.000005411771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008891045,0.00015469635,0.00016799747,0.000005641587,0.00009549399,1.8292237e-8,0.00046355752,0.6373667,0.0000769968,0.09532076,0.007362972,0.25897625],"study_design_scores_gemma":[0.00075366447,0.00008510524,0.00027214826,0.00002259523,0.00003771489,7.888955e-7,0.000028194745,0.99640316,0.000029201668,0.0014582655,0.00079800835,0.000111182984],"about_ca_topic_score_codex":0.000023213244,"about_ca_topic_score_gemma":0.000017098359,"teacher_disagreement_score":0.7487165,"about_ca_system_score_codex":0.000018046328,"about_ca_system_score_gemma":0.000084909756,"threshold_uncertainty_score":0.69226646},"labels":[],"label_agreement":null},{"id":"W2128508520","doi":"10.1016/j.comcom.2011.09.001","title":"Research challenges towards the Future Internet","year":2011,"lang":"en","type":"article","venue":"Computer Communications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Computer science; The Internet; Flexibility (engineering); Protocol stack; Scalability; Architecture; Reserved IP addresses; Telecommunications; Internet Protocol; Internet research; World Wide Web; IP address management; Computer network; Wireless sensor network","score_opus":0.3571833005297325,"score_gpt":0.35182076279349317,"score_spread":0.005362537736239348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128508520","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016719234,0.008048057,0.8631687,0.022687573,0.0007966193,0.000219015,0.0000015452185,0.00022383756,0.10468744],"genre_scores_gemma":[0.81263614,0.0040008756,0.18173216,0.0007226103,0.0004325357,0.00005995255,0.000006605388,0.000012269779,0.00039684153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982212,0.00061135745,0.00024615478,0.0002930997,0.0002933404,0.00033480034],"domain_scores_gemma":[0.99459505,0.0003178294,0.000065999906,0.004626841,0.0002783689,0.000115926065],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001145597,0.0001266224,0.00013662945,0.000103908744,0.00046869874,0.0001663394,0.008009505,0.00008802847,0.00003362357],"category_scores_gemma":[0.0000023533116,0.00008926722,0.00007314698,0.00039882175,0.00035176022,0.00024376853,0.004235101,0.0006831076,0.00019295156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015090145,0.00008662956,0.000012970476,0.0000028356308,0.000017853674,0.0000036756232,0.007370351,4.8721404e-7,2.562708e-7,0.44960564,0.015837612,0.52706015],"study_design_scores_gemma":[0.00016414288,0.00012400492,0.003288129,0.000040956354,0.0000072595008,0.000054652697,0.00067014334,0.5402296,0.000007896127,0.031985383,0.42321894,0.00020888742],"about_ca_topic_score_codex":0.00004851929,"about_ca_topic_score_gemma":0.00006455207,"teacher_disagreement_score":0.81246895,"about_ca_system_score_codex":0.00002872942,"about_ca_system_score_gemma":0.0001054085,"threshold_uncertainty_score":0.99735767},"labels":[],"label_agreement":null},{"id":"W2128573323","doi":"10.1016/j.comcom.2012.12.003","title":"A proof of wavelength conversion not improving Lagrangian bounds of the sliding scheduled RWA problem","year":2013,"lang":"en","type":"article","venue":"Computer Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; University of Ottawa","funders":"State Key Laboratory of Advanced Optical Communication Systems and Networks","keywords":"Routing and wavelength assignment; Computer science; Wavelength; Schedule; Upper and lower bounds; Function (biology); Mathematical optimization; Wavelength-division multiplexing; Mathematics; Optics; Physics","score_opus":0.014439859324008498,"score_gpt":0.21222842859229007,"score_spread":0.1977885692682816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128573323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4052652,0.0011948257,0.58365875,0.0029482513,0.00034114404,0.00203452,0.000014125281,0.0010690594,0.0034741294],"genre_scores_gemma":[0.6876858,0.00003766065,0.31219372,0.000015026352,0.000008866172,0.000033173394,0.0000027200208,0.000013219971,0.00000982836],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929506,0.000036163587,0.0003055245,0.00009503493,0.0000998546,0.00016838827],"domain_scores_gemma":[0.99808395,0.00019954758,0.000097721655,0.001465169,0.00012756513,0.00002605903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008796243,0.00010802749,0.00017556886,0.00006248135,0.00011550856,0.000018368428,0.0012364181,0.000080297534,0.000006529113],"category_scores_gemma":[0.000029163279,0.000086455366,0.0000709428,0.00032344207,0.00020775304,0.00016022517,0.0008663907,0.00027798102,0.000004982395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010864245,0.0004319688,0.0027447166,0.0012993637,0.0003431092,4.337841e-7,0.0023859015,0.06384135,0.10333821,0.13301677,0.0016347595,0.69095254],"study_design_scores_gemma":[0.00023118651,0.00003374544,0.0016076837,0.00016691955,0.000018589913,0.0000017866228,0.00009112506,0.97646844,0.01855248,0.0019318975,0.0007606056,0.0001355487],"about_ca_topic_score_codex":0.000014614281,"about_ca_topic_score_gemma":0.000006759087,"teacher_disagreement_score":0.9126271,"about_ca_system_score_codex":0.000042452135,"about_ca_system_score_gemma":0.000015002061,"threshold_uncertainty_score":0.35255477},"labels":[],"label_agreement":null},{"id":"W2131288453","doi":"10.1016/s0140-3664(00)00229-2","title":"Rapid generation of functional tests using MSCs, SDL and TTCN","year":2001,"lang":"en","type":"article","venue":"Computer Communications","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science","score_opus":0.21870477160732624,"score_gpt":0.32048971299808116,"score_spread":0.10178494139075492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131288453","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019238777,0.0010286181,0.97726,0.00074710435,0.000112696536,0.00008727076,0.0000012133999,0.0012850238,0.00023927563],"genre_scores_gemma":[0.4485733,0.00011082827,0.55106086,0.00017021535,0.00005654301,0.0000058102664,0.000008370308,0.0000045556217,0.000009505567],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992672,0.00010043359,0.00022019951,0.00018490516,0.00011729158,0.00010995482],"domain_scores_gemma":[0.9979263,0.00030931554,0.000105765605,0.0014428628,0.00016950912,0.000046224126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022501765,0.00008878603,0.00011321588,0.00012540596,0.00025063806,0.00008367423,0.0008071628,0.00004205219,0.0000032193582],"category_scores_gemma":[0.00004924605,0.00009192053,0.000032101223,0.0003486389,0.00010815922,0.0002497711,0.0007587759,0.00010379205,0.0000029247772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004821301,0.00050386274,0.028637711,0.000030021953,0.00006841343,0.000004949072,0.0014849697,0.0019146878,0.004268557,0.07205058,0.032822248,0.8582092],"study_design_scores_gemma":[0.00011989396,0.0000445336,0.010897394,0.000035716843,0.0000066934986,0.0000975215,0.0000012327255,0.97862196,0.00010082478,0.0066546365,0.003305198,0.00011439502],"about_ca_topic_score_codex":0.000051634073,"about_ca_topic_score_gemma":0.0000070478472,"teacher_disagreement_score":0.9767073,"about_ca_system_score_codex":0.00002294171,"about_ca_system_score_gemma":0.00004798361,"threshold_uncertainty_score":0.374841},"labels":[],"label_agreement":null},{"id":"W2133451802","doi":"10.1016/j.comcom.2004.12.034","title":"Serialized optimal relay schedules in two-tiered wireless sensor networks","year":2005,"lang":"en","type":"article","venue":"Computer Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Computer science; Wireless sensor network; Computer network; Provisioning; Node (physics); Overhead (engineering); Base station; Wireless; Cluster (spacecraft); Topology (electrical circuits); Process (computing); Distributed computing; Telecommunications; Electrical engineering; Power (physics)","score_opus":0.02081356204800513,"score_gpt":0.279097683919875,"score_spread":0.2582841218718699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133451802","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07135134,0.0009203043,0.920914,0.00435504,0.0005924277,0.00030775045,0.0000022336828,0.0005730752,0.0009838511],"genre_scores_gemma":[0.48341587,0.00021762903,0.515525,0.0004293581,0.0002524276,0.00003959192,0.000026913644,0.000024645564,0.000068588735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969643,0.00069196074,0.00074106036,0.0006381021,0.00029090658,0.00067368685],"domain_scores_gemma":[0.9941815,0.0005581469,0.00023986124,0.0046576764,0.00017220865,0.00019061916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054552377,0.0003396603,0.00043432316,0.0002951299,0.0004088412,0.0003667777,0.0051136613,0.0001520617,0.000012008886],"category_scores_gemma":[0.000017534863,0.00036907176,0.00014554971,0.0011582816,0.00024021509,0.00060701923,0.0025614928,0.000704365,0.00008223798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008797132,0.0002640247,0.00034966634,0.0000027796916,0.000023412857,0.0000059996614,0.0003786154,0.90527153,0.0000774174,0.06290458,0.00034335745,0.030369796],"study_design_scores_gemma":[0.0012101596,0.000027707034,0.00085543905,0.000082507,0.000007702095,0.000024899948,0.000018197416,0.9854851,0.00010841204,0.000049603128,0.011730708,0.00039957016],"about_ca_topic_score_codex":0.000065306995,"about_ca_topic_score_gemma":0.00030640373,"teacher_disagreement_score":0.41206452,"about_ca_system_score_codex":0.00018016541,"about_ca_system_score_gemma":0.000082879866,"threshold_uncertainty_score":0.99987614},"labels":[],"label_agreement":null},{"id":"W2150124995","doi":"10.1016/j.comcom.2006.02.009","title":"Sleep scheduling for wireless sensor networks via network flow model","year":2006,"lang":"en","type":"article","venue":"Computer Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Wireless sensor network; Scheduling (production processes); Computer network; Wireless; Real-time computing; Telecommunications; Mathematical optimization","score_opus":0.020092382136525106,"score_gpt":0.23950357727002305,"score_spread":0.21941119513349794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150124995","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084888213,0.0010742784,0.99355024,0.0016971703,0.0007958983,0.00049670134,0.0000049575606,0.0008148114,0.0007170539],"genre_scores_gemma":[0.33138853,0.00004928889,0.6669942,0.0005213415,0.0007085358,0.0001073701,0.00010550419,0.000042587537,0.00008261887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972814,0.00022102031,0.000679894,0.0006802505,0.00026840562,0.0008690591],"domain_scores_gemma":[0.99396354,0.00084137486,0.0002776764,0.0044019716,0.000361451,0.00015401433],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047347296,0.00037068804,0.0004079828,0.00012971752,0.0011188069,0.00038475462,0.004571706,0.00022310551,0.0000015977547],"category_scores_gemma":[0.0000072651615,0.000406809,0.0002559177,0.0008246181,0.00018344513,0.00037477896,0.0018320397,0.0004649944,0.000017816175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004077877,0.00014280959,0.00008143903,0.0000063184484,0.000027249205,0.0000011685426,0.00005418561,0.8992695,0.000022801662,0.073788755,0.0020835998,0.024518076],"study_design_scores_gemma":[0.00045442636,0.000033454147,0.00009693866,0.000049031325,0.000021573265,0.000014356319,0.0000021308501,0.9931477,0.000020203364,0.0030010913,0.0027029167,0.0004561847],"about_ca_topic_score_codex":0.000030059346,"about_ca_topic_score_gemma":0.00008113492,"teacher_disagreement_score":0.33053967,"about_ca_system_score_codex":0.00010308468,"about_ca_system_score_gemma":0.000050189898,"threshold_uncertainty_score":0.99983835},"labels":[],"label_agreement":null},{"id":"W2152960680","doi":"10.1016/j.comcom.2004.07.019","title":"An efficient secure distributed anonymous routing protocol for mobile and wireless ad hoc networks","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer network; Computer science; Wireless ad hoc network; Optimized Link State Routing Protocol; Mobile ad hoc network; Node (physics); Wireless Routing Protocol; Computer security; Routing protocol; Network packet; Wireless; Telecommunications","score_opus":0.02131202181975967,"score_gpt":0.30161222326954323,"score_spread":0.28030020144978357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152960680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016976903,0.00018927295,0.94635105,0.00044574848,0.000111856,0.050715875,0.000016160378,0.0004368492,0.000035511166],"genre_scores_gemma":[0.5027208,0.000022321305,0.33540675,0.00025064813,0.00013257931,0.1613291,0.00010375383,0.000030166564,0.0000039005126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815446,0.00018016949,0.00044600692,0.0005664225,0.00017063644,0.0004823178],"domain_scores_gemma":[0.9955183,0.00030001704,0.0002211018,0.0035137553,0.00022817602,0.0002186039],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038950224,0.00026040443,0.0002727788,0.00006671396,0.0008155535,0.00046554365,0.003232217,0.00013846374,0.0000020132338],"category_scores_gemma":[0.0000070833344,0.00026198404,0.00008512477,0.00050383876,0.00022724488,0.0003231674,0.0016073564,0.00035639742,0.000003977035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018775194,0.0008832388,0.00010077984,0.00003882316,0.000036728827,0.000003515834,0.0016299821,0.66633016,0.00004307687,0.07739925,0.0005546923,0.252961],"study_design_scores_gemma":[0.0013960664,0.00034636314,0.0005601902,0.000108219996,0.000008687106,0.00002549395,0.000024436249,0.98388517,0.000023565854,0.0007895397,0.012529789,0.00030247035],"about_ca_topic_score_codex":0.0000061545493,"about_ca_topic_score_gemma":0.000035772988,"teacher_disagreement_score":0.6109443,"about_ca_system_score_codex":0.00012094808,"about_ca_system_score_gemma":0.00011077596,"threshold_uncertainty_score":0.99998325},"labels":[],"label_agreement":null},{"id":"W2153614597","doi":"10.1016/j.comcom.2009.02.001","title":"Multiple frequency reuse schemes in the two-hop IEEE 802.16j wireless relay networks with asymmetrical topology","year":2009,"lang":"en","type":"article","venue":"Computer Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Manitoba","funders":"Beijing Jiaotong University; Ministry of Education of the People's Republic of China; National Natural Science Foundation of China","keywords":"Computer science; Computer network; Relay; RSS; Base station; Reuse; Throughput; IEEE 802; Wireless; Telecommunications; Power (physics); Engineering; Quality of service; Operating system","score_opus":0.04718666208462432,"score_gpt":0.3014459932283545,"score_spread":0.2542593311437302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153614597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012051805,0.0024965524,0.95221925,0.02999332,0.00018648387,0.00047110283,0.0000010978655,0.0002498674,0.0023305146],"genre_scores_gemma":[0.7434389,0.0012960421,0.2516772,0.0033941912,0.00008859195,0.00005801342,0.000016270415,0.000010151392,0.0000206684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709696,0.0012479795,0.00051569234,0.00044277913,0.0002511495,0.00044544812],"domain_scores_gemma":[0.99009115,0.0016141325,0.00018099394,0.00777187,0.00023831178,0.00010354983],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0007905066,0.00026280625,0.00031249557,0.00026988992,0.00076076866,0.00030557733,0.010929718,0.00010863993,0.0000052868263],"category_scores_gemma":[0.00008751447,0.00019821964,0.00008731158,0.0023375133,0.0002800768,0.00046398226,0.0014122709,0.0010245813,0.000024068686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020170517,0.0012588323,0.008572794,0.000004779455,0.000062411695,0.000026535261,0.005525541,0.012943821,0.00017404463,0.6490493,0.0062728203,0.31608894],"study_design_scores_gemma":[0.001065179,0.00022835692,0.014384955,0.00007835089,0.0000109092025,0.00006454605,0.000049893675,0.9692038,0.000029172976,0.0016103098,0.012897693,0.00037682737],"about_ca_topic_score_codex":0.000033228356,"about_ca_topic_score_gemma":0.0004301159,"teacher_disagreement_score":0.95625997,"about_ca_system_score_codex":0.00009932179,"about_ca_system_score_gemma":0.00009858544,"threshold_uncertainty_score":0.9944216},"labels":[],"label_agreement":null},{"id":"W2165581682","doi":"10.1016/j.comcom.2004.09.016","title":"Weight allocation in distributed admission control for wireless networks","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Wireless network; Wireless; Control (management); Distributed computing; Telecommunications; Artificial intelligence","score_opus":0.03237697076132606,"score_gpt":0.30174540199618716,"score_spread":0.2693684312348611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165581682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008973765,0.0011302156,0.9755676,0.020782888,0.00019200664,0.0009957496,0.0000123249265,0.00028160558,0.00014026342],"genre_scores_gemma":[0.8203739,0.0006928576,0.17764448,0.00043473046,0.00009089111,0.0005031074,0.00022495826,0.000021200629,0.000013861641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775064,0.00041839175,0.0006087782,0.00044513572,0.00026645217,0.00051058235],"domain_scores_gemma":[0.99336535,0.0009923594,0.00019256544,0.0048583345,0.00039205726,0.0001993442],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0007648677,0.00022070849,0.0003024009,0.0002470455,0.0005188118,0.00026506349,0.0066786134,0.00016084564,0.0000033096019],"category_scores_gemma":[0.000052704458,0.00023052077,0.000117203264,0.0011866555,0.00016253097,0.000610383,0.0016156916,0.0005219627,0.000019223071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035426696,0.0009781613,0.0010864172,0.000024257704,0.00005725736,0.0000027174176,0.0006023236,0.28516543,0.0001715459,0.5366838,0.001925048,0.17326765],"study_design_scores_gemma":[0.0022298403,0.00006623458,0.0049740886,0.00013630213,0.000005521652,0.0000065748063,0.00000814081,0.97663295,0.00005636332,0.00668165,0.008953175,0.0002491467],"about_ca_topic_score_codex":0.000052201587,"about_ca_topic_score_gemma":0.00016765966,"teacher_disagreement_score":0.81947654,"about_ca_system_score_codex":0.0003311378,"about_ca_system_score_gemma":0.00025687038,"threshold_uncertainty_score":0.99869573},"labels":[],"label_agreement":null},{"id":"W2170801914","doi":"10.1016/j.comcom.2011.08.008","title":"ORACLE: Mobility control in wireless sensor and actor networks","year":2011,"lang":"en","type":"article","venue":"Computer Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Oracle; Event (particle physics); Wireless sensor network; Energy consumption; Markov decision process; Real-time computing; Energy (signal processing); Efficient energy use; Wireless; Provisioning; Process (computing); Computer network; Control (management); Markov chain; Markov process; Distributed computing; Telecommunications; Artificial intelligence; Machine learning","score_opus":0.032878367886304535,"score_gpt":0.23555836806356323,"score_spread":0.20268000017725868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170801914","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049262714,0.0005494161,0.9477596,0.0005839187,0.00026626355,0.0002902244,0.0000022485235,0.000276709,0.0010089066],"genre_scores_gemma":[0.8361499,0.00019909808,0.16307676,0.00045669588,0.000043324904,0.000038097012,0.0000053451604,0.000014613984,0.000016170596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981225,0.00046303845,0.0004191227,0.0004648674,0.00014051847,0.0003899568],"domain_scores_gemma":[0.9957682,0.000555152,0.00013809821,0.0032710226,0.00011926187,0.00014829982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041661522,0.00020837072,0.00029143522,0.00014052867,0.00022609666,0.00012081303,0.002618161,0.00013149163,0.0000060463913],"category_scores_gemma":[0.000012070912,0.00021258653,0.000058416164,0.0005755642,0.0002820974,0.00035311942,0.0014013255,0.00044282072,0.000011261399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067506786,0.0035774768,0.109246515,0.00004975818,0.00017942689,0.00006587729,0.008396547,0.05658591,0.000243957,0.45385274,0.0009997523,0.3667345],"study_design_scores_gemma":[0.0005094021,0.000040925657,0.053330068,0.00003535211,0.000005633783,0.000014802783,0.000014054558,0.9448382,0.000017473814,0.00025573032,0.0007193156,0.00021899206],"about_ca_topic_score_codex":0.00012760848,"about_ca_topic_score_gemma":0.00016805109,"teacher_disagreement_score":0.8882523,"about_ca_system_score_codex":0.000055209846,"about_ca_system_score_gemma":0.00003442729,"threshold_uncertainty_score":0.8669027},"labels":[],"label_agreement":null},{"id":"W2195107683","doi":"10.1016/j.comcom.2015.11.012","title":"Discrete time analysis of cognitive radio networks with imperfect sensing and saturated source of secondary users","year":2015,"lang":"en","type":"article","venue":"Computer Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Universitat Politècnica de València; Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad; University of Manitoba","keywords":"Cognitive radio; Computer science; Goodput; White spaces; Transmission (telecommunications); Channel (broadcasting); Interference (communication); Markov chain; Idle; Phase-type distribution; Sequence (biology); Real-time computing; Data transmission; Markov process; Range (aeronautics); Telecommunications; Computer network; Wireless; Throughput; Statistics; Machine learning","score_opus":0.01643365719770826,"score_gpt":0.2418856517510935,"score_spread":0.22545199455338524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2195107683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14153305,0.0010073929,0.85637647,0.00022757378,0.000032235643,0.00015193851,0.000006632479,0.00006505668,0.00059964665],"genre_scores_gemma":[0.941243,0.00007948612,0.058476985,0.00008429795,0.000025914922,9.759341e-7,0.000061706574,0.000012153715,0.000015484206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986427,0.00036200802,0.0003346,0.00028686883,0.00016694429,0.00020691768],"domain_scores_gemma":[0.9971033,0.000969842,0.0002785291,0.0010933194,0.0004208224,0.00013420652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003399651,0.00017008852,0.00048279736,0.00030575576,0.00015222662,0.000092077986,0.0005893627,0.000058122892,0.0000020149894],"category_scores_gemma":[0.000024986,0.00015134011,0.00010130212,0.0016939958,0.00038506882,0.00024455768,0.0006610334,0.00025227584,8.088779e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000253809,0.00035704178,0.016779015,0.000041790012,0.0092297755,0.000030899366,0.023878759,0.12818623,0.0005851949,0.0036504876,0.0009696257,0.81603736],"study_design_scores_gemma":[0.0005223003,0.0001573486,0.014595517,0.00013408948,0.0004133045,0.000034093202,0.00010951158,0.98366684,0.00006432707,0.000046874215,0.000077105615,0.00017870242],"about_ca_topic_score_codex":0.00014065678,"about_ca_topic_score_gemma":0.00013349678,"teacher_disagreement_score":0.8554806,"about_ca_system_score_codex":0.00003095262,"about_ca_system_score_gemma":0.00009486195,"threshold_uncertainty_score":0.617147},"labels":[],"label_agreement":null},{"id":"W2213047121","doi":"10.1016/j.comcom.2015.09.002","title":"Smartphone positioning in sparse Wi-Fi environments","year":2015,"lang":"en","type":"article","venue":"Computer Communications","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Accelerometer; Global Positioning System; Gyroscope; Real-time computing; Artificial intelligence; Mobile device; Computer vision; Position (finance); Telecommunications","score_opus":0.03911038953729748,"score_gpt":0.2319059165397991,"score_spread":0.19279552700250163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2213047121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066383176,0.0020158729,0.9128806,0.0010497561,0.00053964613,0.00030361654,0.000013789742,0.0012417082,0.015571806],"genre_scores_gemma":[0.96095496,0.00017568647,0.038595334,0.00008672401,0.000022342527,0.000042825093,0.00006388079,0.000015625084,0.00004261091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950707,0.00003362199,0.00017450562,0.00007885085,0.00007369951,0.00013225032],"domain_scores_gemma":[0.9990556,0.00003302355,0.000017808477,0.0008389885,0.000013171538,0.000041386254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000086514476,0.00008258516,0.00009292438,0.00011486499,0.000060249287,0.00002914597,0.0005305308,0.000059791775,0.000008460271],"category_scores_gemma":[0.00000875894,0.000094764866,0.000020050837,0.00020889938,0.00006842462,0.00011797656,0.00025293865,0.00016058428,0.00014105765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013769646,0.00065009785,0.040823933,0.00005465197,0.00014697423,0.000024269935,0.009426718,0.70795196,0.0015133762,0.04784121,0.05653324,0.1350198],"study_design_scores_gemma":[0.00092703296,0.00003764155,0.01341902,0.00006623462,0.000010465524,0.000013778547,0.00026878164,0.8817817,0.0019374844,0.003075316,0.098107524,0.00035500384],"about_ca_topic_score_codex":0.0000123893515,"about_ca_topic_score_gemma":0.000028931452,"teacher_disagreement_score":0.8945718,"about_ca_system_score_codex":0.00010607458,"about_ca_system_score_gemma":0.0000090083795,"threshold_uncertainty_score":0.38643992},"labels":[],"label_agreement":null},{"id":"W2284873372","doi":"10.1016/j.comcom.2015.11.006","title":"Wireless and Mobile Network Modeling, Analysis, Design, Optimization, and Simulation","year":2015,"lang":"en","type":"article","venue":"Computer Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Graph; Social network (sociolinguistics); Machine learning; Mobile social network; Artificial intelligence; Data mining; World Wide Web; Theoretical computer science; Mobile computing; Social media; Computer network","score_opus":0.044765546650496243,"score_gpt":0.27213420369710706,"score_spread":0.2273686570466108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2284873372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011489948,0.0029278076,0.9952063,0.00002261352,0.00006276979,0.00028027725,0.0000022929573,0.00026425387,0.00008467426],"genre_scores_gemma":[0.5762237,0.0003630451,0.42325214,0.0000129959,0.00003475469,0.00003462782,0.000058429105,0.000015023597,0.0000052963474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993535,0.0000925887,0.00024227475,0.0001343601,0.00005990136,0.00011732727],"domain_scores_gemma":[0.9989014,0.00012212663,0.00004314929,0.00067743275,0.00016264609,0.00009324473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001814415,0.00011225955,0.00017186363,0.000108666034,0.00013430671,0.00006886608,0.00019579755,0.000058650618,0.0000013913063],"category_scores_gemma":[0.000007294529,0.00012759477,0.000019024232,0.0004671164,0.000039651244,0.00024396376,0.00015957837,0.000084057196,0.0000016535828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010854707,0.000007868146,0.000255033,0.0000057578027,0.00007041847,7.740381e-8,0.0005122622,0.9973331,0.0000011808519,0.00013467591,0.00008706004,0.0015914622],"study_design_scores_gemma":[0.00017659346,0.0000138942805,0.000018714121,0.000013104229,0.00008042202,0.0000015258731,0.000030180134,0.9990854,0.0000010506963,0.0001836249,0.00026690387,0.00012855692],"about_ca_topic_score_codex":0.0000073470496,"about_ca_topic_score_gemma":0.00000945868,"teacher_disagreement_score":0.5750747,"about_ca_system_score_codex":0.000039674924,"about_ca_system_score_gemma":0.000011383461,"threshold_uncertainty_score":0.5203164},"labels":[],"label_agreement":null},{"id":"W2299515439","doi":"10.1016/j.comcom.2016.03.001","title":"Improved particle filter based on WLAN RSSI fingerprinting and smart sensors for indoor localization","year":2016,"lang":"en","type":"article","venue":"Computer Communications","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"CMC Microsystems","keywords":"Computer science; Initialization; Particle filter; Fingerprint (computing); Fingerprint recognition; Wireless sensor network; Weighting; Convergence (economics); Filter (signal processing); Algorithm; Process (computing); Real-time computing; Artificial intelligence; Kalman filter; Computer vision; Computer network; Acoustics","score_opus":0.020798011534609067,"score_gpt":0.23233789166138985,"score_spread":0.2115398801267808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2299515439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01669536,0.000051359402,0.98060924,0.0014627001,0.00010569401,0.00025560518,0.000015384558,0.0006300463,0.00017463905],"genre_scores_gemma":[0.97127926,0.000041304804,0.028189788,0.0002686374,0.000029831848,0.00011879539,0.00001750015,0.000025078427,0.000029826642],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941707,0.000031915242,0.00019664706,0.00013278068,0.000049963684,0.00017161621],"domain_scores_gemma":[0.9987462,0.00034702572,0.00003457373,0.00076773047,0.000067245775,0.000037195758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010744268,0.00011070195,0.00010796005,0.000074789634,0.00018765607,0.000048394824,0.00029426676,0.00007301819,0.000009240915],"category_scores_gemma":[0.00006477521,0.00008926484,0.00003539245,0.00012504998,0.000088544555,0.000085395244,0.000113537746,0.00006843493,0.000009286111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090580754,0.00040145012,0.0391278,0.0004124377,0.00021252947,0.0000019524625,0.0019857162,0.06647932,0.030179238,0.046843316,0.011598463,0.8026672],"study_design_scores_gemma":[0.00051286933,0.00004101121,0.0010572982,0.000062296596,0.000008121932,7.243942e-7,0.000015063067,0.97829986,0.009702729,0.00025835328,0.009905547,0.0001361251],"about_ca_topic_score_codex":0.0000027955878,"about_ca_topic_score_gemma":0.00000877324,"teacher_disagreement_score":0.9545839,"about_ca_system_score_codex":0.000036063466,"about_ca_system_score_gemma":0.000008608995,"threshold_uncertainty_score":0.36401144},"labels":[],"label_agreement":null},{"id":"W2426786974","doi":"10.1016/j.comcom.2013.01.001","title":"Target to sensor allocation: A hierarchical dynamic Distributed Constraint Optimization approach","year":2013,"lang":"en","type":"article","venue":"Computer Communications","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Asynchronous communication; Optimization problem; Wireless sensor network; Distributed computing; Set (abstract data type); Constraint (computer-aided design); Mathematical optimization; Algorithm; Computer network","score_opus":0.017447699110899124,"score_gpt":0.2480492258699638,"score_spread":0.23060152675906467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2426786974","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016208443,0.000040535597,0.97630477,0.020104513,0.0001914367,0.00085184333,0.000021212252,0.0005357021,0.0017879301],"genre_scores_gemma":[0.19687311,0.000026280522,0.80131304,0.0010814144,0.000029577526,0.0001995173,0.00040771466,0.00001341155,0.000055911863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982231,0.0002736732,0.00047415373,0.00046876952,0.00024696754,0.0003133011],"domain_scores_gemma":[0.9966432,0.00019933966,0.00012849187,0.0023092325,0.0004320267,0.0002877078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019353024,0.00021815191,0.00021717972,0.00024052295,0.00045572268,0.00050847355,0.0019124433,0.00010024567,0.00012306077],"category_scores_gemma":[0.000052146417,0.0002299452,0.000086498396,0.0009311134,0.00018889579,0.0006473273,0.00095912133,0.0002842406,0.00018333762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025091663,0.00032810748,0.00027129348,0.0000128384545,0.000053227533,8.902936e-7,0.0010700298,0.82701486,0.000101172074,0.08133673,0.0027356225,0.0870727],"study_design_scores_gemma":[0.0002613458,0.000036273093,0.0029317113,0.000014789966,0.0000058979326,0.00004084477,0.00005195855,0.9935857,0.000007934368,0.0006750228,0.0021252611,0.0002632622],"about_ca_topic_score_codex":0.000024055289,"about_ca_topic_score_gemma":0.0000055583378,"teacher_disagreement_score":0.19671102,"about_ca_system_score_codex":0.00013601726,"about_ca_system_score_gemma":0.00013033013,"threshold_uncertainty_score":0.9376893},"labels":[],"label_agreement":null},{"id":"W2486094321","doi":"10.1016/j.comcom.2016.07.009","title":"Organized topology based routing protocol in incompletely predictable ad-hoc networks","year":2016,"lang":"en","type":"article","venue":"Computer Communications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ontario Institute of Technology","funders":"Nanjing University of Information Science and Technology; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer science; Topology (electrical circuits); Routing protocol; Network topology; Computer network; Distributed computing; Routing (electronic design automation); Node (physics); Routing table; Wireless ad hoc network; Mathematics; Telecommunications","score_opus":0.04124923082441778,"score_gpt":0.286514547669909,"score_spread":0.24526531684549124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2486094321","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011140922,0.00009902252,0.9833693,0.0053622858,0.0002399731,0.008365721,0.0000033367387,0.00036794727,0.0020809933],"genre_scores_gemma":[0.6342186,0.000042903626,0.35396698,0.0015371898,0.00014177863,0.009891589,0.000017098266,0.000029635596,0.00015425803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997652,0.00049353874,0.0006599402,0.00046873692,0.00018565006,0.0005401648],"domain_scores_gemma":[0.99513614,0.0010489637,0.00023029644,0.0032543202,0.0001636843,0.0001665641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061439216,0.00023096299,0.0003437348,0.00016826023,0.00034389805,0.00014493,0.003753683,0.0001563331,0.0000670818],"category_scores_gemma":[0.000016075697,0.00018371397,0.00007658955,0.0006870997,0.0002279587,0.00038359224,0.0021214664,0.000349652,0.000060925126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005605851,0.0006210247,0.0076283044,0.000020369536,0.00004039969,0.000025966106,0.00047830743,0.0011812408,0.00006114972,0.055177946,0.008438108,0.92627114],"study_design_scores_gemma":[0.0017661154,0.00011022516,0.0021191796,0.0001481412,0.000004546958,0.000014923566,0.0000052958485,0.9535368,0.0000067188125,0.00181646,0.040222403,0.00024915676],"about_ca_topic_score_codex":0.000014688183,"about_ca_topic_score_gemma":0.000057399786,"teacher_disagreement_score":0.95235556,"about_ca_system_score_codex":0.000116324445,"about_ca_system_score_gemma":0.0002443106,"threshold_uncertainty_score":0.74916387},"labels":[],"label_agreement":null},{"id":"W2567882795","doi":"10.1016/j.comcom.2016.12.018","title":"Modelling and performance analysis of TCP variants for data collection in smart power grids","year":2017,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Computer science; Zeta-TCP; TCP tuning; TCP acceleration; TCP Vegas; TCP Friendly Rate Control; Computer network; TCP global synchronization; Compound TCP; Transmission Control Protocol; HSTCP; Network packet","score_opus":0.0882163159250546,"score_gpt":0.30133368782097564,"score_spread":0.21311737189592103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567882795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024719661,0.00021275469,0.97314817,0.0012589289,0.00014051374,0.00017589505,0.000007235209,0.00002931226,0.00030753083],"genre_scores_gemma":[0.7855959,0.00023291817,0.21403709,0.00004545002,0.000010741987,0.000019429044,0.000025585463,0.0000030685756,0.000029823845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992315,0.000059702805,0.0002536097,0.00025490276,0.00007866664,0.00012160182],"domain_scores_gemma":[0.9952543,0.0002411545,0.00017735428,0.004176234,0.00011415614,0.000036809273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044679554,0.00007607092,0.00020530222,0.00019560906,0.00048624762,0.00016768843,0.0032874001,0.000039611947,0.000001258735],"category_scores_gemma":[0.000015551588,0.000079610814,0.00003782058,0.00032371873,0.00008848126,0.0005885236,0.0013574286,0.00009349358,8.024335e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004610444,0.0004155248,0.048206232,0.0000308348,0.00079378847,7.637035e-7,0.0018223496,0.17831776,0.000011221195,0.072685644,0.0014220634,0.6962477],"study_design_scores_gemma":[0.0003357111,0.00003369576,0.034006596,0.000021213587,0.00006436972,9.1914757e-7,0.0000030952106,0.96428543,0.0000010271683,0.00018979007,0.0009803324,0.00007783363],"about_ca_topic_score_codex":0.00007403059,"about_ca_topic_score_gemma":0.00012579684,"teacher_disagreement_score":0.78596765,"about_ca_system_score_codex":0.000014123381,"about_ca_system_score_gemma":0.000047816025,"threshold_uncertainty_score":0.61088616},"labels":[],"label_agreement":null},{"id":"W2581327855","doi":"10.1016/j.comcom.2017.01.012","title":"End-to-end programmable, cloud-based virtualized HetNet: Advances made & challenges to address","year":2017,"lang":"en","type":"article","venue":"Computer Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; Cloud computing; Virtualization; Heterogeneous network; Computer network; Provisioning; Network virtualization; Virtual network; Wireless network; Distributed computing; Wireless; Telecommunications; Operating system","score_opus":0.08872327753139031,"score_gpt":0.3377010668258494,"score_spread":0.24897778929445907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2581327855","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00082214293,0.005756101,0.95494604,0.03290065,0.001047761,0.00087156205,0.000021058042,0.00074910274,0.0028855691],"genre_scores_gemma":[0.22263448,0.0011013944,0.772482,0.0025645827,0.0003774416,0.00048754658,0.000052043713,0.000041546464,0.00025901422],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99764156,0.00026779328,0.00043057333,0.00070114154,0.00037139416,0.00058751],"domain_scores_gemma":[0.9886139,0.00060861424,0.00026337354,0.009866644,0.0002460006,0.00040148833],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.00049989566,0.00032035637,0.00039708792,0.00019614503,0.0015117788,0.0009770634,0.0105334725,0.00010778648,0.00001788805],"category_scores_gemma":[0.00009191559,0.00031762908,0.00014795404,0.00034194865,0.00021631976,0.0006009289,0.0042782202,0.0003285989,0.00032579468],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025217623,0.000426747,0.0006128893,0.00003813672,0.000060450242,0.0000051994534,0.001633651,0.0041885343,0.000038059796,0.07839602,0.006839151,0.90773594],"study_design_scores_gemma":[0.00068885676,0.00018291532,0.005386918,0.00021829082,0.000015083752,0.0000081474045,0.000011922165,0.052074388,0.00006388587,0.0023143033,0.93851095,0.0005243408],"about_ca_topic_score_codex":0.00008716041,"about_ca_topic_score_gemma":0.0005877385,"teacher_disagreement_score":0.9316718,"about_ca_system_score_codex":0.00005943286,"about_ca_system_score_gemma":0.00010463127,"threshold_uncertainty_score":0.9999276},"labels":[],"label_agreement":null},{"id":"W2582221108","doi":"10.1016/j.comcom.2017.01.008","title":"Special Section on Mobile Content Delivery Networks","year":2017,"lang":"en","type":"article","venue":"Computer Communications","topic":"Innovation in Digital Healthcare Systems","field":"Health Professions","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Context (archaeology); Wireless sensor network; Software deployment; Wireless network; Quality of service; Computer network; Service (business); Wireless; Control (management); Telecommunications; Artificial intelligence; Software engineering","score_opus":0.2906388759526602,"score_gpt":0.4599203524669887,"score_spread":0.1692814765143285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582221108","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13183793,0.00032263855,0.046673935,0.011060183,0.07586359,0.005923638,0.000102550825,0.00087144395,0.7273441],"genre_scores_gemma":[0.9695592,0.00010481297,0.0018907664,0.0020017845,0.022549678,0.0006009881,0.00011785916,0.000033427397,0.003141505],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980223,0.0005172745,0.0006855327,0.00023703193,0.00018424919,0.00035359338],"domain_scores_gemma":[0.99396926,0.0005650543,0.0006163839,0.0040785903,0.0006711512,0.00009952996],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005750984,0.00014903606,0.00023064477,0.00011084271,0.0053718137,0.000102110724,0.0015885545,0.00021374511,0.000093901166],"category_scores_gemma":[0.00007187117,0.00014712453,0.00007328916,0.00011102606,0.00018257639,0.00030556243,0.0010185675,0.00095880526,0.0006635868],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097219025,0.0004222435,0.05689803,0.00013817531,0.00009156601,0.0000036941308,0.0031019656,0.00068589364,0.000016576872,0.15588075,0.6168979,0.16576599],"study_design_scores_gemma":[0.00074947585,0.00017971914,0.120259024,0.0004475387,0.0000069396438,0.0000033100257,0.00049475767,0.017282888,0.0000023748682,0.00025123512,0.8600947,0.00022800788],"about_ca_topic_score_codex":0.0004313538,"about_ca_topic_score_gemma":0.000508949,"teacher_disagreement_score":0.8377212,"about_ca_system_score_codex":0.00033408176,"about_ca_system_score_gemma":0.0001542402,"threshold_uncertainty_score":0.99592304},"labels":[],"label_agreement":null},{"id":"W2610221642","doi":"10.1016/j.comcom.2017.08.003","title":"Optimizing power allocation in wireless networks: Are the implicit constraints really redundant?","year":2017,"lang":"en","type":"article","venue":"Computer Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Wireless; Power (physics); Wireless network; Mathematical optimization; Computer network; Distributed computing; Telecommunications","score_opus":0.05477273371121708,"score_gpt":0.30991945216789674,"score_spread":0.25514671845667963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610221642","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004038093,0.0011037393,0.95068014,0.03468785,0.00041356636,0.00050896575,0.0000022630659,0.0001995142,0.008365869],"genre_scores_gemma":[0.945071,0.0024356751,0.051160216,0.0011055516,0.00006346926,0.00008766888,0.00001267315,0.00001590646,0.00004786396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980612,0.0005280271,0.00049021735,0.00038403223,0.00018132116,0.0003552376],"domain_scores_gemma":[0.98935497,0.00048567713,0.00048271398,0.0092938375,0.0002896264,0.00009315093],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00090874924,0.00021311664,0.0002550655,0.00011210348,0.0025387744,0.0012354252,0.011454146,0.00008844116,0.000008625478],"category_scores_gemma":[0.000069798196,0.00018538265,0.00009029043,0.00033499353,0.0006541311,0.0007861194,0.005091086,0.000611699,0.000026382875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067970427,0.00030065252,0.0048819026,0.0000068648083,0.000070148744,0.000007055647,0.0041816914,0.004531847,0.00026243497,0.62907314,0.0026265238,0.35405093],"study_design_scores_gemma":[0.00048004856,0.00002679704,0.0648759,0.00023277257,0.0000068079275,0.000022708371,0.00012003079,0.9274418,0.000026559945,0.0008341342,0.005614066,0.00031840915],"about_ca_topic_score_codex":0.000030641582,"about_ca_topic_score_gemma":0.0005197364,"teacher_disagreement_score":0.9410329,"about_ca_system_score_codex":0.00010563496,"about_ca_system_score_gemma":0.00010510991,"threshold_uncertainty_score":0.9998014},"labels":[],"label_agreement":null},{"id":"W2763356328","doi":"10.1016/j.comcom.2017.10.002","title":"When 5G meets ICN: An ICN-based caching approach for mobile video in 5G networks","year":2017,"lang":"en","type":"article","venue":"Computer Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Handover; Cellular network; Quality of experience; Router; Base station; Video quality; Bandwidth (computing); Transmission (telecommunications); Quality of service; Telecommunications","score_opus":0.06781963484572784,"score_gpt":0.304871999234196,"score_spread":0.23705236438846816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2763356328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042731287,0.0006291771,0.99033636,0.0022030661,0.00036573148,0.0006157394,0.0000072719313,0.00023450116,0.0013350537],"genre_scores_gemma":[0.76645523,0.000025493282,0.23235326,0.00060950074,0.00013303832,0.00029053583,0.00006916008,0.000017525685,0.000046278878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982659,0.0003037198,0.00037409135,0.0005138744,0.00016563924,0.0003767536],"domain_scores_gemma":[0.99212784,0.0004035164,0.00023784896,0.0069596516,0.00013466747,0.00013648528],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.00079600094,0.00021148541,0.0002896154,0.0001573197,0.0014263676,0.0009689634,0.007803777,0.000108147346,0.0000013383709],"category_scores_gemma":[0.000035021425,0.00022252447,0.00014861213,0.00011021969,0.00014244442,0.00088046305,0.0010454422,0.00041199394,0.000005078905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037123114,0.0018223671,0.005795101,0.000059874164,0.000096496464,0.000007771896,0.0034642965,0.4783277,0.00024029672,0.0521915,0.005490937,0.45246655],"study_design_scores_gemma":[0.0006825992,0.00009107236,0.0029351315,0.00005662165,0.00000994644,0.0000046335686,0.000019564079,0.9887278,0.000011788591,0.0006473188,0.00654942,0.0002641018],"about_ca_topic_score_codex":0.000729374,"about_ca_topic_score_gemma":0.00036502947,"teacher_disagreement_score":0.7621821,"about_ca_system_score_codex":0.00008074865,"about_ca_system_score_gemma":0.00008914149,"threshold_uncertainty_score":0.99987364},"labels":[],"label_agreement":null},{"id":"W2778663425","doi":"10.1016/j.comcom.2017.12.007","title":"Energy efficiency and accuracy of solar powered BLE beacons","year":2017,"lang":"en","type":"article","venue":"Computer Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Beacon; Computer science; Wireless; Bluetooth Low Energy; Energy harvesting; Efficient energy use; Energy (signal processing); Computer network; Bluetooth; Telecommunications; Real-time computing; Electrical engineering; Engineering","score_opus":0.02270923618553613,"score_gpt":0.24994770638425648,"score_spread":0.22723847019872034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2778663425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07463962,0.0075154253,0.8844991,0.00083751703,0.0007817803,0.00015850704,0.000020767295,0.00062896387,0.030918341],"genre_scores_gemma":[0.9619589,0.0010961907,0.036787786,0.000024840652,0.000047224185,0.0000105368945,0.000013480457,0.0000197807,0.000041268795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994632,0.00003512065,0.0001993995,0.00010086837,0.00005963215,0.00014175085],"domain_scores_gemma":[0.9970062,0.0003281421,0.000096607226,0.00245978,0.000054354663,0.000054929853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000905142,0.00009951117,0.00014735892,0.000046989742,0.00038861728,0.00009045606,0.0013502904,0.00005917237,0.000004014852],"category_scores_gemma":[0.000038071,0.00011019934,0.00003361582,0.000049659247,0.0002504086,0.00016039894,0.0006965459,0.00014242745,0.0000023698428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006985888,0.00048574264,0.011381894,0.00022087316,0.00042636794,0.0000072414796,0.0022735954,0.24552737,0.006506806,0.19207637,0.010163472,0.5309233],"study_design_scores_gemma":[0.00021016622,0.000017360602,0.007613747,0.0001113967,0.000014882649,0.000006893046,0.0000065217528,0.9713071,0.0005873911,0.00053009717,0.01943292,0.00016152303],"about_ca_topic_score_codex":0.00007094985,"about_ca_topic_score_gemma":0.00006823523,"teacher_disagreement_score":0.88731927,"about_ca_system_score_codex":0.000012676646,"about_ca_system_score_gemma":0.000014689744,"threshold_uncertainty_score":0.44937986},"labels":[],"label_agreement":null},{"id":"W2795697207","doi":"10.1016/j.comcom.2018.03.017","title":"Special Issue on Technical challenges and emerging opportunities for 5G enabled IoT systems","year":2018,"lang":"en","type":"article","venue":"Computer Communications","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Cloud computing; Big data; Vehicular ad hoc network; Computer security; Encryption; Computer network; Wireless; Privacy protection; Wireless ad hoc network; Data aggregator; Wireless sensor network; Telecommunications; Data mining","score_opus":0.0771491536409604,"score_gpt":0.2705348498954874,"score_spread":0.19338569625452698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795697207","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02545567,0.07430052,0.14604169,0.033582885,0.015618084,0.0069785053,0.00014336218,0.0070750695,0.6908042],"genre_scores_gemma":[0.92596096,0.009028412,0.037230413,0.0003288052,0.026254019,0.00041902933,0.00008388636,0.00014866656,0.0005457869],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992054,0.0000680041,0.0002356855,0.00015740373,0.000089700145,0.00024380737],"domain_scores_gemma":[0.9983629,0.000252931,0.000036058584,0.0011729738,0.00008633161,0.00008877724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022139915,0.00015436114,0.00020639607,0.00009746621,0.00024248543,0.000065446926,0.0005903274,0.00009460657,0.000011626734],"category_scores_gemma":[0.000010285882,0.00016499277,0.000043352247,0.00006359773,0.00015209994,0.000045456003,0.00016533314,0.00018598078,0.00002482835],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020560683,0.00016409563,0.000010152965,0.0003403216,0.00024969428,0.0000065921486,0.002449588,0.16024907,0.00014745467,0.086152956,0.24562882,0.5045807],"study_design_scores_gemma":[0.00014536618,0.00006559615,0.00009731897,0.000089888,0.0000115360135,0.000012233893,0.00009637652,0.46020576,0.000014174017,0.000115340205,0.5390208,0.00012565611],"about_ca_topic_score_codex":0.0000031134557,"about_ca_topic_score_gemma":0.00005390911,"teacher_disagreement_score":0.9005053,"about_ca_system_score_codex":0.000049960556,"about_ca_system_score_gemma":0.000012825468,"threshold_uncertainty_score":0.672821},"labels":[],"label_agreement":null},{"id":"W2950965276","doi":"10.1016/j.comcom.2019.06.004","title":"Optimizing the network diversity to improve the resilience of networks against unknown attacks","year":2019,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Army Research Office; National Institute of Standards and Technology; Natural Sciences and Engineering Research Council of Canada; Georgian National Science Foundation; Office of Naval Research; Concordia University; National Science Foundation","keywords":"Computer science; Resilience (materials science); Heuristic; Network security; Diversification (marketing strategy); Diversity (politics); Optimization problem; Computer security; Metric (unit); Distributed computing; Risk analysis (engineering); Artificial intelligence; Algorithm; Business","score_opus":0.017338658553282076,"score_gpt":0.23965217497823815,"score_spread":0.2223135164249561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950965276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019453239,0.0007378206,0.96879643,0.0068163713,0.0012911311,0.0006282098,0.0000011490737,0.00011243355,0.0021632337],"genre_scores_gemma":[0.940633,0.00031062192,0.05615201,0.0025794157,0.00020242925,0.000019184436,0.0000026937105,0.0000069149382,0.000093707094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985337,0.00037220752,0.00029411193,0.0002834573,0.00022742953,0.00028908244],"domain_scores_gemma":[0.994713,0.0007477679,0.00018550937,0.004110391,0.00017510001,0.000068223315],"candidate_categories":["sts","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00078084733,0.00013082847,0.00016465371,0.000033278004,0.001422839,0.00015354235,0.006630089,0.00006360062,0.000005146665],"category_scores_gemma":[0.000014883152,0.0000878147,0.00010751243,0.000940104,0.00017581263,0.00029547166,0.010537158,0.00044561957,0.000044501092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010020501,0.00006803267,0.00082180236,0.000005926319,0.00003973472,3.4236479e-7,0.0035041717,0.8203336,0.000051316987,0.069385596,0.009151609,0.09662786],"study_design_scores_gemma":[0.00011390263,0.000081812526,0.0025024815,0.000048031572,0.000007124578,0.0000021513667,0.000030021938,0.9546604,0.000035975,0.0006757471,0.041720327,0.00012202498],"about_ca_topic_score_codex":0.000043503813,"about_ca_topic_score_gemma":0.00007364693,"teacher_disagreement_score":0.9211798,"about_ca_system_score_codex":0.000039116774,"about_ca_system_score_gemma":0.000034489993,"threshold_uncertainty_score":0.99987715},"labels":[],"label_agreement":null},{"id":"W2968008834","doi":"10.1016/j.comcom.2019.08.006","title":"Performance analysis of video on demand in an IEEE 802.11p-based vehicular network","year":2019,"lang":"en","type":"article","venue":"Computer Communications","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Ottawa","funders":"","keywords":"Computer science; Computer network; IEEE 802.11p; Sizing; Download; Key (lock); Travel time; Real-time computing; Service (business); Video on demand; IEEE 802; Vehicular ad hoc network; Quality of service; Transport engineering; Telecommunications; Wireless ad hoc network; Engineering; Operating system; Wireless","score_opus":0.029712029065385188,"score_gpt":0.2843773682192572,"score_spread":0.254665339153872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968008834","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5101918,0.00016143803,0.4858519,0.00059787364,0.00019426808,0.002127328,0.0000032428156,0.00010916737,0.00076295075],"genre_scores_gemma":[0.93282324,0.00002754933,0.06625636,0.0004885463,0.00004306531,0.0003166393,0.000026347087,0.000008438113,0.000009786845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984577,0.00036293708,0.00040347033,0.0003182335,0.00020309031,0.00025458972],"domain_scores_gemma":[0.9952099,0.00039128182,0.00018303022,0.004036624,0.0001069368,0.00007224973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005478955,0.00014590137,0.00036258152,0.0002998059,0.00013103017,0.00009151089,0.0030726865,0.00007848488,0.000010785633],"category_scores_gemma":[0.0000023128557,0.00014151652,0.0001274849,0.0019657023,0.00006096797,0.0003099695,0.00039979324,0.00024903388,0.000025087085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008356773,0.0001786657,0.07785308,0.000012857227,0.00005802238,5.511785e-7,0.00016414543,0.902127,0.000023899303,0.0046391445,0.00013426533,0.014800007],"study_design_scores_gemma":[0.0002970892,0.00017541049,0.13026153,0.00010340349,0.000025103942,2.6745738e-7,0.0000012371029,0.8673543,0.000052768864,0.00011145526,0.0014787887,0.00013864556],"about_ca_topic_score_codex":0.000022420565,"about_ca_topic_score_gemma":0.00009666785,"teacher_disagreement_score":0.42263144,"about_ca_system_score_codex":0.00003634097,"about_ca_system_score_gemma":0.00006735784,"threshold_uncertainty_score":0.5770876},"labels":[],"label_agreement":null},{"id":"W2994178915","doi":"10.1016/j.comcom.2019.11.039","title":"A novel mapping technique for ray tracer to system-level simulation","year":2019,"lang":"en","type":"article","venue":"Computer Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Exfo Electro-Optical Engineering (Canada)","funders":"European Regional Development Fund; Fundação para a Ciência e a Tecnologia; Ministério da Educação e Ciência","keywords":"Computer science; TRACER; Computer graphics (images)","score_opus":0.10269704534703253,"score_gpt":0.2853570257676291,"score_spread":0.18265998042059658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994178915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021406668,0.00007872621,0.9948006,0.00017680106,0.00020350878,0.0013221028,0.000028933042,0.00037377243,0.000874884],"genre_scores_gemma":[0.56833655,0.0000031932875,0.43125102,0.00007524471,0.000033127788,0.00020144315,0.000032445903,0.000020725596,0.000046226567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993579,0.00002165291,0.00027195364,0.00013429276,0.000069496855,0.00014471277],"domain_scores_gemma":[0.99864376,0.00016882076,0.00003293497,0.00097249553,0.0001255767,0.000056412297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020246972,0.000110579356,0.00013974568,0.00015456702,0.00010856201,0.00004709703,0.00043782196,0.00006215061,0.0000063801417],"category_scores_gemma":[0.000008129743,0.00012289762,0.00006215938,0.00016493125,0.000008034428,0.00009639789,0.00013652194,0.00010909645,0.000076701035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018431108,0.000022084041,0.000010678689,0.00012415453,0.000025484369,2.9483475e-8,0.0005310304,0.8706782,0.1214742,0.00081776566,0.00017863329,0.0061359154],"study_design_scores_gemma":[0.0002300626,0.000015117415,0.00010012097,0.00013135982,0.0000069531498,0.0000025639258,0.000039194063,0.986824,0.0024552334,0.0000316376,0.010009961,0.00015382202],"about_ca_topic_score_codex":0.000003806931,"about_ca_topic_score_gemma":0.0000034368672,"teacher_disagreement_score":0.5661959,"about_ca_system_score_codex":0.00009424012,"about_ca_system_score_gemma":0.000012129617,"threshold_uncertainty_score":0.50116193},"labels":[],"label_agreement":null},{"id":"W3011052769","doi":"10.1016/j.comcom.2020.03.017","title":"Unmanned aerial vehicle for internet of everything: Opportunities and challenges","year":2020,"lang":"en","type":"article","venue":"Computer Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":231,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Fundo para o Desenvolvimento das Ciências e da Tecnologia","keywords":"Computer science; The Internet; Drone; World Wide Web; Computer security; Multimedia","score_opus":0.15109333257087043,"score_gpt":0.24998826812509836,"score_spread":0.09889493555422793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011052769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071390527,0.005356596,0.9723935,0.012885504,0.00008422507,0.00036166128,0.000028629602,0.00025916175,0.0014916452],"genre_scores_gemma":[0.82746184,0.0071333223,0.16506118,0.00012422485,0.00006445216,0.00006288394,0.0000660146,0.000016709613,0.000009398437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996958,0.000014438907,0.00014277468,0.00006429281,0.000027385473,0.000055345197],"domain_scores_gemma":[0.99949265,0.0000833733,0.000027384074,0.0003072064,0.00004982836,0.00003953344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000039091814,0.00005552337,0.000091086134,0.00002475411,0.00004021279,0.000017005477,0.0002683299,0.00002928552,0.0000035726491],"category_scores_gemma":[0.0000051043357,0.00006240909,0.000020859408,0.000042777378,0.00004753958,0.00007244562,0.00013210527,0.000041370622,0.0000013242086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029233222,0.00013971917,0.00008350762,0.0007134306,0.00021215172,2.460572e-7,0.01726454,0.021458535,0.001202239,0.5091574,0.011484184,0.43825477],"study_design_scores_gemma":[0.00020577101,0.00003944343,0.0001971707,0.000014479745,0.000011331258,5.542788e-7,0.00012010762,0.8687373,0.00019008628,0.00025287294,0.13016106,0.00006984257],"about_ca_topic_score_codex":0.0000026883313,"about_ca_topic_score_gemma":0.000003413572,"teacher_disagreement_score":0.8472787,"about_ca_system_score_codex":0.000005961799,"about_ca_system_score_gemma":0.0000064169435,"threshold_uncertainty_score":0.25449687},"labels":[],"label_agreement":null},{"id":"W3011098329","doi":"10.1016/j.comcom.2020.03.019","title":"Energy-efficient task scheduling and physiological assessment in disaster management using UAV-assisted networks","year":2020,"lang":"en","type":"article","venue":"Computer Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":89,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; IBM (Canada); Thompson Rivers University","funders":"","keywords":"Computer science; Scheduling (production processes); Data collection; Energy consumption; Warning system; Emergency management; Internet of Things; Disaster area; Real-time computing; Efficient energy use; Computer security; Telecommunications","score_opus":0.04870571364179909,"score_gpt":0.2654795059730694,"score_spread":0.2167737923312703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011098329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037396118,0.0004108125,0.9609908,0.00039646338,0.0000353737,0.00014799168,0.000002112567,0.00012736599,0.0004929461],"genre_scores_gemma":[0.73717284,0.0002642763,0.26227012,0.00016768009,0.000030645144,0.000037357935,0.000044793214,0.000011086854,0.0000012100569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993937,0.00004862911,0.00021696623,0.00015588492,0.00005522112,0.00012961842],"domain_scores_gemma":[0.9993777,0.000035471538,0.000029394396,0.0004775091,0.000019762545,0.000060143564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000050836607,0.00010391354,0.00011975171,0.000047434085,0.00011612084,0.000058572652,0.0003041015,0.000043697208,0.0000043816194],"category_scores_gemma":[7.151685e-7,0.00010671873,0.000024327303,0.00030636057,0.000043676824,0.00004713212,0.00040127174,0.0001542579,0.0000016002502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.31761e-7,0.00005342758,0.0001355376,0.000011155803,0.000016615535,4.3981598e-7,0.00015250662,0.98308873,0.00015879815,0.0044810534,0.00005157725,0.01184942],"study_design_scores_gemma":[0.00018671043,0.000008778904,0.009122246,0.000026561269,0.000012243868,0.0000010158693,0.000060821596,0.989623,0.0000018375094,0.000037906175,0.0008064815,0.00011241389],"about_ca_topic_score_codex":0.0000053005074,"about_ca_topic_score_gemma":0.000004165967,"teacher_disagreement_score":0.6997767,"about_ca_system_score_codex":0.00005352058,"about_ca_system_score_gemma":0.000004651511,"threshold_uncertainty_score":0.4351864},"labels":[],"label_agreement":null},{"id":"W3014730994","doi":"10.1016/j.comcom.2020.03.046","title":"Interference minimization algorithms for fifth generation and beyond systems","year":2020,"lang":"en","type":"article","venue":"Computer Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Interference (communication); Integer programming; Bandwidth (computing); Single antenna interference cancellation; Mathematical optimization; Integer (computer science); Linear programming; Algorithm; Distributed computing; Telecommunications; Mathematics; Channel (broadcasting)","score_opus":0.06356831120724414,"score_gpt":0.25186492635670016,"score_spread":0.188296615149456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014730994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008194974,0.00093223865,0.99600965,0.0011728089,0.000117064694,0.00040097855,0.00003243031,0.00021120712,0.00030411544],"genre_scores_gemma":[0.63426644,0.00061763724,0.36384043,0.0002251102,0.00021592189,0.00024922998,0.00054986053,0.000023629736,0.000011727982],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954593,0.000021410886,0.00019221705,0.00012304573,0.0000381771,0.000079195415],"domain_scores_gemma":[0.99935585,0.000059768092,0.000032897577,0.00040064365,0.00009194141,0.000058920992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000039643222,0.000084674924,0.000094082694,0.000035534995,0.00014662175,0.00010894226,0.00026060763,0.00004456408,0.000002689412],"category_scores_gemma":[0.000006857861,0.000094266616,0.00001824101,0.00014500183,0.00003014862,0.00013547667,0.000089280904,0.00006177897,0.0000060238035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043429663,0.00006460952,0.00016158036,0.00016156427,0.00008254831,1.1420056e-7,0.0046838094,0.82329965,0.001745601,0.038668294,0.023586888,0.10754099],"study_design_scores_gemma":[0.00015317951,0.000026761814,0.00008414651,0.0000067814844,0.000012835168,0.0000012362999,0.000031122392,0.9764248,0.000046667228,0.00004580891,0.0230693,0.00009736787],"about_ca_topic_score_codex":0.0000026564517,"about_ca_topic_score_gemma":0.0000036985957,"teacher_disagreement_score":0.63344693,"about_ca_system_score_codex":0.000018508945,"about_ca_system_score_gemma":0.000008344387,"threshold_uncertainty_score":0.38440812},"labels":[],"label_agreement":null},{"id":"W3018317585","doi":"10.1016/j.comcom.2020.04.047","title":"A-CAFDSP: An Adaptive-Congestion Aware Fibonacci Sequence based Data Scheduling Policy","year":2020,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Computer network; Network packet; Distributed computing; Scheduling (production processes); Quality of service; Wireless; Telecommunications","score_opus":0.22962359075371797,"score_gpt":0.35342769149904146,"score_spread":0.1238041007453235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3018317585","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037881464,0.00032869543,0.964727,0.033035964,0.00012981685,0.00033326523,0.000045043376,0.000712343,0.0003090918],"genre_scores_gemma":[0.4864704,0.00004856128,0.50896853,0.0038387852,0.00030764606,0.000029381692,0.00031453924,0.000017719087,0.000004437651],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975961,0.0005156936,0.00041183757,0.0008168177,0.00028721703,0.0003723767],"domain_scores_gemma":[0.98957735,0.00041497825,0.00019380917,0.009221524,0.00022422906,0.0003681083],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0003642046,0.00024391043,0.0002460753,0.00012774681,0.00049311377,0.00039436424,0.013844259,0.00010657359,0.000011628698],"category_scores_gemma":[0.00007828472,0.00027312888,0.000059256945,0.001242577,0.00016496914,0.0018062119,0.006093603,0.00052825495,0.00011765515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022422695,0.00042656573,0.00070196576,0.00003967318,0.00007602043,0.000021603593,0.0013178531,0.15739413,0.00030741456,0.32006174,0.005103218,0.5145274],"study_design_scores_gemma":[0.0002712901,0.00014115585,0.0007762976,0.000052762545,0.0000099891195,0.000009606422,0.000012041311,0.984006,0.00002086668,0.0008342476,0.013582903,0.00028283696],"about_ca_topic_score_codex":0.000119683216,"about_ca_topic_score_gemma":0.00007245838,"teacher_disagreement_score":0.8266119,"about_ca_system_score_codex":0.00010452907,"about_ca_system_score_gemma":0.0004911506,"threshold_uncertainty_score":0.9999721},"labels":[],"label_agreement":null},{"id":"W3023685007","doi":"10.1016/j.comcom.2020.04.060","title":"Rapid sensing-based emergency detection: A sequential approach","year":2020,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Change detection; Constraint (computer-aided design); False alarm; ALARM; Variable (mathematics); Real-time computing; Construct (python library); Emergency management; Internet of Things; Realization (probability); Computer security; Data mining; Artificial intelligence; Computer network","score_opus":0.0686290140463837,"score_gpt":0.25918859507746933,"score_spread":0.1905595810310856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023685007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005776704,0.0005278656,0.9875132,0.007703178,0.00046561923,0.00016676386,0.000001847603,0.00073323806,0.0023106476],"genre_scores_gemma":[0.62318796,0.000020788999,0.3756726,0.0008869655,0.00019206498,0.000007150472,0.000009399765,0.000013367873,0.000009676608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983604,0.00033928826,0.000360661,0.00045512084,0.00021177271,0.00027278037],"domain_scores_gemma":[0.99673057,0.00013167835,0.00013365062,0.0026182411,0.00018272201,0.00020316463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021852649,0.0001909734,0.00019791113,0.00008961829,0.00070397847,0.00023581955,0.002153713,0.00007453882,0.00001353557],"category_scores_gemma":[0.0000439251,0.00020694881,0.00015693477,0.0008061894,0.00012043537,0.00025974758,0.0010341521,0.0003456889,0.00008162419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014991026,0.00037791664,0.00011351651,0.00012339934,0.0001155201,0.000014796192,0.0067788465,0.016117256,0.0056704897,0.014931254,0.009610373,0.94613165],"study_design_scores_gemma":[0.00019516307,0.00006663975,0.000097655386,0.000012387866,0.0000122667,0.000022652095,0.000019983043,0.9658905,0.0008027792,0.00018665279,0.032467823,0.00022546644],"about_ca_topic_score_codex":0.00001871737,"about_ca_topic_score_gemma":0.000005736489,"teacher_disagreement_score":0.94977325,"about_ca_system_score_codex":0.000035368645,"about_ca_system_score_gemma":0.00008325972,"threshold_uncertainty_score":0.8439128},"labels":[],"label_agreement":null},{"id":"W3025580486","doi":"10.1016/j.comcom.2020.05.012","title":"Recruitment algorithms for vehicular sensor networks","year":2020,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Crowdsensing; Heuristic; Integer programming; Mathematical optimization; Operations research; Real-time computing; Algorithm; Artificial intelligence; Mathematics; Computer security","score_opus":0.15599245388176877,"score_gpt":0.31685155597702735,"score_spread":0.16085910209525858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3025580486","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024672484,0.0006520508,0.97867996,0.018855285,0.00026051115,0.00061749207,0.0000032478702,0.0004176337,0.00026709068],"genre_scores_gemma":[0.12658376,0.0000794455,0.86855406,0.004201191,0.0003327384,0.00016164474,0.000030743453,0.000019227624,0.000037213915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988077,0.00014434101,0.00028235352,0.00036722774,0.00012164006,0.00027668997],"domain_scores_gemma":[0.9970811,0.00033095194,0.0000994659,0.0021584663,0.00014915528,0.00018087291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022568155,0.00015263235,0.0001960134,0.000038992333,0.0004748033,0.0002672738,0.0021931366,0.00006559225,0.000001964646],"category_scores_gemma":[0.000024428671,0.000156168,0.00013485731,0.0003262874,0.00006969406,0.00016031014,0.0011174411,0.00020960058,0.000028436254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008901009,0.00023292466,0.00014371087,0.000044056003,0.00015462612,0.000009824581,0.0041787596,0.08912101,0.00040510696,0.061700936,0.029773211,0.8142269],"study_design_scores_gemma":[0.00024522576,0.00007497585,0.00008744999,0.000019947269,0.000009828206,0.000008695145,0.000016937212,0.8341181,0.00008499565,0.00020405381,0.16497509,0.0001546935],"about_ca_topic_score_codex":0.000005115569,"about_ca_topic_score_gemma":0.0000013378301,"teacher_disagreement_score":0.81407225,"about_ca_system_score_codex":0.000033613167,"about_ca_system_score_gemma":0.00004002489,"threshold_uncertainty_score":0.6368346},"labels":[],"label_agreement":null},{"id":"W3025641346","doi":"10.1016/j.comcom.2020.05.020","title":"Green communication in IoT networks using a hybrid optimization algorithm","year":2020,"lang":"en","type":"article","venue":"Computer Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":132,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Computer science; Energy consumption; Internet of Things; Optimization problem; Wireless sensor network; Residual; Energy (signal processing); Distributed computing; Mathematical optimization; Computer network; Algorithm; Embedded system","score_opus":0.03996381031355054,"score_gpt":0.253364150651817,"score_spread":0.21340034033826646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3025641346","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00064531,0.0011395382,0.98961663,0.007563104,0.00011280369,0.0002725254,0.0000025230847,0.00037782907,0.00026973154],"genre_scores_gemma":[0.20871197,0.00027710688,0.7888422,0.0019429818,0.00009947624,0.000019676836,0.00007580958,0.000024834078,0.0000059528193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781585,0.00059839303,0.00055587554,0.00044665523,0.00022348543,0.00035973088],"domain_scores_gemma":[0.99586105,0.00031976562,0.00023331624,0.003245042,0.00017042864,0.00017038954],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028920677,0.00022507035,0.00027836644,0.00016819357,0.00037427346,0.00023422518,0.0049682516,0.00009453711,0.000006043883],"category_scores_gemma":[0.000015822257,0.0002651095,0.00008535976,0.001355559,0.00014539849,0.00040654623,0.0027684697,0.0005356698,0.000012561803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015171598,0.00009385436,0.00012507205,0.0000034564116,0.000011883527,0.0000034267869,0.0005265331,0.9527928,0.00000609727,0.0041485406,0.00023647535,0.042050302],"study_design_scores_gemma":[0.00036931597,0.000031434673,0.00015611757,0.000062191175,0.000007393116,0.000015501837,0.000013922956,0.9971877,0.000011788478,0.00010604565,0.001774548,0.0002640433],"about_ca_topic_score_codex":0.00018514854,"about_ca_topic_score_gemma":0.000035327725,"teacher_disagreement_score":0.20806666,"about_ca_system_score_codex":0.000117271724,"about_ca_system_score_gemma":0.000063741616,"threshold_uncertainty_score":0.9999801},"labels":[],"label_agreement":null},{"id":"W3028052800","doi":"10.1016/j.comcom.2020.05.027","title":"An adaptive and Distributed Traffic Management System using Vehicular Ad-hoc Networks","year":2020,"lang":"en","type":"article","venue":"Computer Communications","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Computer science; Vehicle Information and Communication System; Traffic congestion reconstruction with Kerner's three-phase theory; Traffic congestion; Floating car data; Traffic flow (computer networking); Wireless ad hoc network; Vehicular ad hoc network; Traffic optimization; Network traffic control; Computer network; Traffic bottleneck; Road traffic; Transport engineering; Telecommunications","score_opus":0.025510114248670564,"score_gpt":0.22306132864808859,"score_spread":0.19755121439941803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028052800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04581774,0.00874714,0.94364476,0.0001919046,0.00012256602,0.00041352084,0.000021485588,0.0009435202,0.00009733033],"genre_scores_gemma":[0.90340364,0.00062873214,0.09550023,0.000098005985,0.00010642254,0.00002595447,0.00019012735,0.000046208756,6.6900407e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895877,0.00014688347,0.0002715839,0.00023567601,0.00011013595,0.00027696285],"domain_scores_gemma":[0.99844486,0.000050758375,0.000044303546,0.0011886376,0.00004402119,0.00022742871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000105226136,0.00020477496,0.00023229887,0.00004322087,0.00023676537,0.0001126489,0.0007793958,0.00008578265,0.0000021530948],"category_scores_gemma":[9.2510044e-7,0.00023418255,0.0000562828,0.00033102217,0.00007315372,0.00015890534,0.0003896306,0.0003128578,0.000009656714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044033063,0.000020867505,0.000013822087,0.000047326834,0.00012400116,0.00001263668,0.00022273012,0.97989446,0.0000117098125,0.00075942697,0.0003717078,0.018516893],"study_design_scores_gemma":[0.00027802325,0.000050568055,0.000429618,0.000104061895,0.00008030179,0.000019280465,0.0001801984,0.99009377,0.0000013931634,0.000004418429,0.0085241115,0.00023428246],"about_ca_topic_score_codex":0.0000012181118,"about_ca_topic_score_gemma":0.000007220108,"teacher_disagreement_score":0.8575859,"about_ca_system_score_codex":0.00011410453,"about_ca_system_score_gemma":0.000007210936,"threshold_uncertainty_score":0.95496875},"labels":[],"label_agreement":null},{"id":"W30357374","doi":"10.1016/j.comcom.2004.08.013","title":"On current areas of interests in end-to-end QoS","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Western University","funders":"","keywords":"Computer science; End-to-end principle; Current (fluid); Quality of service; End user; Computer network; Telecommunications; Electrical engineering; Operating system","score_opus":0.049034617099700806,"score_gpt":0.3166693736427132,"score_spread":0.2676347565430124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W30357374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026334964,0.00038820252,0.9678924,0.0023607742,0.0008816058,0.00029139244,0.000012541697,0.00013655928,0.0017015713],"genre_scores_gemma":[0.9537534,0.000018924851,0.04589888,0.0002000435,0.000061494815,0.00002324753,0.000027847409,0.000007726909,0.000008426536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985733,0.0001848344,0.0004701699,0.00030885718,0.00021798641,0.0002448631],"domain_scores_gemma":[0.99651575,0.00032200522,0.00014028104,0.002796256,0.00011074518,0.00011498281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002945194,0.00015711537,0.00024444045,0.00028769168,0.000100169775,0.00009591521,0.00397419,0.000042533346,0.0000038150533],"category_scores_gemma":[0.000032864322,0.00015811154,0.00008352544,0.00075297186,0.00006951008,0.0001383671,0.0015295376,0.0002782092,0.00012161084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008230833,0.001262119,0.0017715432,0.000042380427,0.000024578552,0.000006169486,0.004356496,0.05512615,0.00004641516,0.7997254,0.003225334,0.13440518],"study_design_scores_gemma":[0.006270736,0.0016851352,0.19754432,0.006517225,0.000030560896,0.00011978729,0.00010180657,0.48728544,0.000811516,0.09927051,0.19804975,0.0023132307],"about_ca_topic_score_codex":0.00009494485,"about_ca_topic_score_gemma":0.00010631497,"teacher_disagreement_score":0.9274185,"about_ca_system_score_codex":0.00011022075,"about_ca_system_score_gemma":0.000114732116,"threshold_uncertainty_score":0.73851},"labels":[],"label_agreement":null},{"id":"W3040391838","doi":"10.1016/j.comcom.2020.06.031","title":"Adaptive delay-constrained resource allocation in mobile edge computing for Internet of Things communications networks","year":2020,"lang":"en","type":"article","venue":"Computer Communications","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Mobile edge computing; Computation offloading; Node (physics); Energy consumption; Computer network; Wireless network; Transmission delay; Wireless; Resource allocation; Transmission (telecommunications); Efficient energy use; Enhanced Data Rates for GSM Evolution; Distributed computing; Edge computing; Network packet; Server; Telecommunications","score_opus":0.05568300887092133,"score_gpt":0.2806257457352613,"score_spread":0.22494273686433996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040391838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016591918,0.0013237575,0.98978996,0.0043255673,0.00049503846,0.0008892696,0.0000014969397,0.00027326753,0.0012424454],"genre_scores_gemma":[0.5688994,0.00004453523,0.42965347,0.0010312283,0.0002140039,0.00005866639,0.00007216095,0.00001875446,0.00000780056],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757457,0.00042305537,0.0009420409,0.0004800101,0.0001746425,0.0004056582],"domain_scores_gemma":[0.994517,0.0016672799,0.0004711193,0.0028593414,0.00033529178,0.00014996683],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007427453,0.00025689427,0.00043752496,0.00020061212,0.00034904986,0.000151307,0.006897537,0.00013467786,8.6534567e-7],"category_scores_gemma":[0.00007323444,0.00029476936,0.00017377986,0.0010187285,0.00033070782,0.0005066425,0.0045279036,0.0005666851,0.00000851109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006618249,0.0009723372,0.002244532,0.00014234292,0.00023371926,0.0000035008125,0.064941086,0.030553449,0.00024097043,0.1962806,0.016121196,0.6882001],"study_design_scores_gemma":[0.0006019925,0.00020549116,0.00044352474,0.00015760785,0.000014713116,0.0000076197884,0.00014104346,0.97914755,0.000051830346,0.0005869469,0.018375356,0.00026630424],"about_ca_topic_score_codex":0.000058589543,"about_ca_topic_score_gemma":0.000009621743,"teacher_disagreement_score":0.9485941,"about_ca_system_score_codex":0.00009214887,"about_ca_system_score_gemma":0.00012645453,"threshold_uncertainty_score":0.99995047},"labels":[],"label_agreement":null},{"id":"W3046426047","doi":"10.1016/j.comcom.2020.07.041","title":"Evolutionary game theoretical model for stable femtocells’ clusters formation in HetNets","year":2020,"lang":"en","type":"article","venue":"Computer Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Femtocell; Computer science; Heterogeneous network; Distributed computing; Resource allocation; Evolutionary game theory; Cluster analysis; Cellular network; Particle swarm optimization; Scalability; Throughput; Stability (learning theory); Mathematical optimization; Computer network; Game theory; Wireless network; Wireless; Artificial intelligence; Base station; Algorithm; Mathematics","score_opus":0.03710611881029376,"score_gpt":0.24796688270181869,"score_spread":0.21086076389152492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046426047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003720323,0.00037081714,0.996284,0.0012102226,0.000060178045,0.00058560946,0.000025734042,0.0002748645,0.0008165432],"genre_scores_gemma":[0.70859945,0.000087403285,0.2907869,0.00018154099,0.000032450054,0.00012783684,0.00015410203,0.000022807464,0.0000075085554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993024,0.00004110007,0.00030939712,0.00011610267,0.000060285387,0.00017074146],"domain_scores_gemma":[0.99915975,0.000123492,0.000036735437,0.0005484928,0.000064759195,0.000066772795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006580698,0.00010877391,0.00013787199,0.00006518826,0.00007137524,0.000025962385,0.00044859786,0.000060636667,0.0000043352843],"category_scores_gemma":[0.000016251059,0.00012774485,0.000040615116,0.00019299203,0.000058015725,0.0003586188,0.0001615021,0.00013959024,0.00001624547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054546463,0.000018188986,0.000010628847,0.000056301007,0.000005505931,1.1548454e-7,0.0013488769,0.9757417,0.000099787045,0.020140888,0.001673852,0.00089871854],"study_design_scores_gemma":[0.00038586187,0.000015991061,0.000016283497,0.000031138938,0.00000529282,0.0000023735452,0.000041495405,0.99570847,0.000041044277,0.0026134613,0.0010097168,0.0001288876],"about_ca_topic_score_codex":0.0000010059224,"about_ca_topic_score_gemma":0.0000064783926,"teacher_disagreement_score":0.7082274,"about_ca_system_score_codex":0.00012149569,"about_ca_system_score_gemma":0.000014282216,"threshold_uncertainty_score":0.5209283},"labels":[],"label_agreement":null},{"id":"W3083552023","doi":"10.1016/j.comcom.2020.08.021","title":"FogAuthChain: A secure location-based authentication scheme in fog computing environments using Blockchain","year":2020,"lang":"en","type":"article","venue":"Computer Communications","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Cloud computing; Authentication (law); Password; Edge computing; Blockchain; Computer security; Computer network; Distributed computing; Operating system","score_opus":0.0664170955472606,"score_gpt":0.28156251719554615,"score_spread":0.21514542164828554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083552023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023390308,0.00035947558,0.9614759,0.013795661,0.00015072299,0.00055848487,0.0000040660752,0.00019748972,0.00006791039],"genre_scores_gemma":[0.84275955,0.000005872056,0.1552096,0.0018658278,0.00007044073,0.000024953533,0.000034958564,0.000019852358,0.000008908546],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975778,0.00046101885,0.0006996595,0.00056379585,0.00035525166,0.00034248218],"domain_scores_gemma":[0.9967613,0.000257258,0.00029159692,0.0023682334,0.00010586917,0.00021571085],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004340097,0.00024008413,0.000282345,0.00022786071,0.0003530672,0.00022464694,0.003229649,0.000111881076,0.000007659295],"category_scores_gemma":[0.000058782,0.00028165476,0.00009384674,0.0012525996,0.0001229178,0.00023338603,0.0010676489,0.00035503472,0.00011094826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042153508,0.00447343,0.04398727,0.0007046667,0.00035949558,0.000030944437,0.47838557,0.083286606,0.015611344,0.34357116,0.0018603374,0.02768702],"study_design_scores_gemma":[0.00060109596,0.000030989966,0.002617597,0.00009322094,0.000008405034,0.00000402444,0.00010469216,0.9923856,0.00013565063,0.00043008276,0.0033189545,0.00026966765],"about_ca_topic_score_codex":0.00005378091,"about_ca_topic_score_gemma":0.000019916679,"teacher_disagreement_score":0.90909904,"about_ca_system_score_codex":0.00015453727,"about_ca_system_score_gemma":0.000158377,"threshold_uncertainty_score":0.9999636},"labels":[],"label_agreement":null},{"id":"W3129299461","doi":"10.1016/j.comcom.2021.06.029","title":"A survey on 360-degree video: Coding, quality of experience and streaming","year":2021,"lang":"en","type":"preprint","venue":"Computer Communications","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ontario Ministry of Food and Agriculture; Horizon 2020; Ministerio de Economía y Competitividad; Horizon 2020 Framework Programme; FP7 Coherent Development of Research Policies","keywords":"Computer science; Quality of experience; Video streaming; Coding (social sciences); Multimedia; Virtual reality; Human–computer interaction; Telecommunications; Quality of service; Real-time computing","score_opus":0.30238556788387494,"score_gpt":0.42969933301471475,"score_spread":0.1273137651308398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129299461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07298255,0.001287902,0.92286474,0.0011839377,0.00044238675,0.0003458885,0.00006541136,0.00013803513,0.0006891396],"genre_scores_gemma":[0.79848754,0.0005177945,0.20031361,0.00039496945,0.00003204255,0.000052388375,0.00015680617,0.000012363399,0.000032478743],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.995762,0.0019227295,0.000888295,0.0007424446,0.00042643506,0.00025811826],"domain_scores_gemma":[0.98992926,0.0017644897,0.00061528984,0.0070814556,0.00049042096,0.00011910058],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014373035,0.00030702093,0.0006278349,0.00015820458,0.00029178473,0.0005563235,0.004704704,0.0001722949,0.0000057407215],"category_scores_gemma":[0.00019389411,0.00033195032,0.00015318686,0.00032078885,0.00028042938,0.0003086739,0.01395027,0.00073914713,0.0000036231754],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040979976,0.0045265085,0.062228978,0.0015206835,0.0008338949,0.000030576924,0.10014766,0.0012427833,0.0011524745,0.2160502,0.0042070756,0.6080182],"study_design_scores_gemma":[0.00047643398,0.00011609818,0.8404889,0.000989951,0.0000202964,0.0000051894917,0.0003674511,0.1540941,0.0006886331,0.0014755352,0.0005077063,0.00076968985],"about_ca_topic_score_codex":0.0022467463,"about_ca_topic_score_gemma":0.0008314956,"teacher_disagreement_score":0.77825993,"about_ca_system_score_codex":0.0000850892,"about_ca_system_score_gemma":0.0002926634,"threshold_uncertainty_score":0.9999133},"labels":[],"label_agreement":null},{"id":"W3133982035","doi":"10.1016/j.comcom.2021.03.003","title":"Enhanced network sensitive access control scheme for LTE–LAA/WiFi coexistence: Modeling and performance analysis","year":2021,"lang":"en","type":"article","venue":"Computer Communications","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Computer network; Spectrum management; Throughput; Transmission (telecommunications); Channel (broadcasting); Cellular network; Handover; LTE Advanced; Telecommunications link; Wireless; Telecommunications; Cognitive radio","score_opus":0.05734151054189395,"score_gpt":0.32512393825160535,"score_spread":0.2677824277097114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133982035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005902685,0.0005436313,0.98976237,0.0015851964,0.00011542694,0.0015056562,0.000009488996,0.00012313774,0.00045241255],"genre_scores_gemma":[0.6781685,0.00021993933,0.3196955,0.00076871953,0.00014208321,0.00091131363,0.000039393275,0.0000090079675,0.000045601937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839336,0.00022643575,0.00038978978,0.00047379461,0.00015443248,0.00036217674],"domain_scores_gemma":[0.9962911,0.00059205433,0.0001579087,0.0022257662,0.000616851,0.00011631972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041955058,0.00018715934,0.0004009879,0.00011229168,0.00077688735,0.0006295258,0.0018789179,0.00008527482,0.000002314363],"category_scores_gemma":[0.000015952126,0.00019329322,0.00015713062,0.0014641922,0.00009131116,0.00063715054,0.0015331771,0.00023464367,0.0000032540154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045574172,0.0002035344,0.0019954585,0.00008748215,0.0010718291,0.0000040377695,0.001346949,0.8228624,0.00017543427,0.077221476,0.00086532295,0.09412051],"study_design_scores_gemma":[0.0005397201,0.000044201086,0.0013421724,0.000077813245,0.00008367344,0.00000586771,0.000010099214,0.9956146,0.0001086496,0.0008126577,0.0011272545,0.00023331764],"about_ca_topic_score_codex":0.000007810596,"about_ca_topic_score_gemma":0.000034551464,"teacher_disagreement_score":0.67226577,"about_ca_system_score_codex":0.00003219036,"about_ca_system_score_gemma":0.00010846057,"threshold_uncertainty_score":0.78822684},"labels":[],"label_agreement":null},{"id":"W3154267440","doi":"10.1016/j.comcom.2021.04.001","title":"Linking handover delay to load balancing in SDN-based heterogeneous networks","year":2021,"lang":"en","type":"article","venue":"Computer Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Handover; Computer network; Load balancing (electrical power); Software-defined networking; Distributed computing; Context (archaeology); Overhead (engineering)","score_opus":0.023380134380763005,"score_gpt":0.2566816248828488,"score_spread":0.2333014905020858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3154267440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038062653,0.002494608,0.9898423,0.0026730318,0.0004939276,0.00017068101,0.0000016571712,0.00025965946,0.0002578527],"genre_scores_gemma":[0.6646777,0.000076751196,0.33018237,0.004841405,0.00011663304,0.000041360145,0.00002449122,0.000016645366,0.00002265831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982312,0.0002576412,0.0004004734,0.0004567777,0.00023039017,0.00042351932],"domain_scores_gemma":[0.9955248,0.00070944394,0.00008300071,0.003293769,0.00023467792,0.0001542782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034159177,0.00018941844,0.00025804952,0.00011803601,0.0002906835,0.0003499201,0.002476087,0.0001024726,0.000008471531],"category_scores_gemma":[0.000036506135,0.00021005458,0.00011022537,0.0011364408,0.000038254664,0.00017223667,0.0020317263,0.00037618144,0.00004701063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050532362,0.00021169154,0.007401626,0.000009326385,0.00002393545,0.00008616994,0.0006256774,0.89249337,0.00002800204,0.0035604185,0.0014812431,0.09407349],"study_design_scores_gemma":[0.00043863733,0.000031632033,0.0028009368,0.00017631096,0.000005118074,0.000037222937,0.0000025165102,0.97616214,0.00007097598,0.00041254275,0.019613504,0.0002484616],"about_ca_topic_score_codex":0.00004518438,"about_ca_topic_score_gemma":0.00056929066,"teacher_disagreement_score":0.6608714,"about_ca_system_score_codex":0.00017074471,"about_ca_system_score_gemma":0.0002377813,"threshold_uncertainty_score":0.85657775},"labels":[],"label_agreement":null},{"id":"W3170235714","doi":"10.1016/j.comcom.2021.06.007","title":"Performance analysis of short-packet communications with incremental relaying","year":2021,"lang":"en","type":"article","venue":"Computer Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Network packet; Block Error Rate; Transmission delay; Transmission (telecommunications); Overhead (engineering); Decoding methods; Bit error rate; Computer network; Error detection and correction; Latency (audio); Low latency (capital markets); Communications system; Reliability (semiconductor); Channel (broadcasting); Real-time computing; Algorithm; Telecommunications; Telecommunications link","score_opus":0.08210720691182105,"score_gpt":0.3100196420611545,"score_spread":0.22791243514933346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3170235714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07970857,0.0041798213,0.891182,0.0065296297,0.000111955604,0.00033083567,0.000019076317,0.00033072257,0.017607378],"genre_scores_gemma":[0.69362485,0.004043929,0.30175793,0.0003024973,0.000009624941,0.00003441728,0.00016868723,0.000009434742,0.000048646074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998021,0.0005762975,0.0005541225,0.00033856777,0.00027570606,0.00023429208],"domain_scores_gemma":[0.98819333,0.00051275105,0.00018679498,0.010280485,0.0007249768,0.00010164356],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00042672644,0.00018753776,0.00039443158,0.00036778944,0.0007729885,0.00015764541,0.0061094016,0.000055505967,0.000025384506],"category_scores_gemma":[0.000018305565,0.00018641565,0.00015715133,0.004062468,0.00033779154,0.00055474625,0.00580424,0.00037242335,0.00001174182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018008668,0.0020378926,0.12927102,0.00005635278,0.004454793,0.000007887222,0.008705623,0.0059186458,0.005784155,0.33389932,0.001634995,0.5082113],"study_design_scores_gemma":[0.00023392914,0.00005935718,0.04362516,0.00008660715,0.00024758268,0.00001646666,0.000086454515,0.94613993,0.0007023699,0.000038383227,0.008499822,0.00026392523],"about_ca_topic_score_codex":0.000008362817,"about_ca_topic_score_gemma":0.00034199303,"teacher_disagreement_score":0.9402213,"about_ca_system_score_codex":0.000084088766,"about_ca_system_score_gemma":0.00018803972,"threshold_uncertainty_score":0.999268},"labels":[],"label_agreement":null},{"id":"W3181445415","doi":"10.1016/j.comcom.2021.06.009","title":"A novel visibility semantic feature-aided pedestrian detection scheme for autonomous vehicles","year":2021,"lang":"en","type":"article","venue":"Computer Communications","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Visibility; Pedestrian; Pedestrian detection; Detector; Scheme (mathematics); Artificial intelligence; Feature (linguistics); Object detection; Intelligent transportation system; Computer vision; Real-time computing; Machine learning; Pattern recognition (psychology); Telecommunications; Transport engineering","score_opus":0.05320120745418959,"score_gpt":0.3082202435480576,"score_spread":0.255019036093868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181445415","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031836235,0.00052521314,0.9836568,0.011115482,0.00023447808,0.00059921073,0.000014122471,0.00051472476,0.00015630209],"genre_scores_gemma":[0.33791512,0.000051606043,0.6610317,0.00048647856,0.000101648,0.00023664987,0.000047809506,0.000015863083,0.00011309059],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984328,0.00012080799,0.00035950253,0.00061567064,0.00014721531,0.00032399088],"domain_scores_gemma":[0.9940395,0.0007621816,0.00017829602,0.0044805463,0.00041210683,0.00012741741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021865629,0.00019769368,0.00023536079,0.0000827604,0.0008005107,0.0002568887,0.0023647393,0.000099588586,0.000001693625],"category_scores_gemma":[0.00008137087,0.00022281043,0.00016349467,0.0008757098,0.00011434571,0.00046461067,0.0015324228,0.00031663658,0.000025274587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021427979,0.0018860028,0.00058844464,0.0001370186,0.00018680302,0.0000052997852,0.0010152938,0.0040948903,0.12638278,0.22908962,0.0035274448,0.633065],"study_design_scores_gemma":[0.0006387562,0.000051813873,0.004708098,0.000028368386,0.000018448458,0.00007736292,0.000012674091,0.93287337,0.005734153,0.011703063,0.043846194,0.0003076755],"about_ca_topic_score_codex":0.000012837441,"about_ca_topic_score_gemma":0.00018196004,"teacher_disagreement_score":0.9287785,"about_ca_system_score_codex":0.000119957665,"about_ca_system_score_gemma":0.00016349593,"threshold_uncertainty_score":0.90859455},"labels":[],"label_agreement":null},{"id":"W3204789245","doi":"10.1016/j.comcom.2021.09.019","title":"Demystifying frame aggregation in 802.11 networks: Understanding and approximating optimality","year":2021,"lang":"en","type":"article","venue":"Computer Communications","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation; Ontario Research Foundation; Google","keywords":"Computer science; Frame (networking); Mathematical optimization; Computer network; Mathematics","score_opus":0.10142040555912418,"score_gpt":0.3063510481402194,"score_spread":0.20493064258109522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204789245","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013664521,0.0011071932,0.99322367,0.0027458456,0.00009958612,0.0007605516,7.399099e-7,0.00013057014,0.00056539464],"genre_scores_gemma":[0.49210805,0.00015177234,0.5071747,0.00026073147,0.000051216197,0.00022935931,0.000011883023,0.000007736028,0.00000458173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984375,0.00041647215,0.00040741346,0.00034557068,0.0001265841,0.00026644152],"domain_scores_gemma":[0.99748313,0.00067021523,0.00014986693,0.0015443197,0.00007431594,0.000078156416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006496554,0.00013587505,0.00020589719,0.00008069104,0.0004142744,0.00050197117,0.001088316,0.00009275727,0.000002786809],"category_scores_gemma":[0.000034749864,0.00015201826,0.000042447333,0.00066887983,0.0000867312,0.0005229836,0.0018147769,0.00033786,0.0000019609893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002699315,0.00017385272,0.024389248,0.00006390094,0.000028187622,0.000015054537,0.0023072474,0.050692122,0.000023535778,0.7448419,0.0002598781,0.17720242],"study_design_scores_gemma":[0.00025825086,0.000010627635,0.0049134777,0.00028607415,0.0000033189494,0.000023136929,0.000064963955,0.9774747,0.000012661993,0.016113337,0.0006725411,0.00016690539],"about_ca_topic_score_codex":0.000023798853,"about_ca_topic_score_gemma":0.00013625532,"teacher_disagreement_score":0.9267826,"about_ca_system_score_codex":0.00011091379,"about_ca_system_score_gemma":0.000066467706,"threshold_uncertainty_score":0.61991245},"labels":[],"label_agreement":null},{"id":"W4200039109","doi":"10.1016/j.comcom.2021.12.020","title":"Survival backup strategy for controller placement problem in Software Defined Networking","year":2021,"lang":"en","type":"article","venue":"Computer Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Backup; Software-defined networking; Software; Computer network; Controller (irrigation); Distributed computing; Embedded system; Operating system","score_opus":0.07059500984703322,"score_gpt":0.294296578421895,"score_spread":0.2237015685748618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200039109","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021668249,0.002632584,0.99245965,0.0025303387,0.00043601342,0.0005389934,0.000009185173,0.00027171333,0.0009048068],"genre_scores_gemma":[0.12517098,0.0003199889,0.87277526,0.0008647658,0.00023632968,0.0003222206,0.00013322556,0.000026439888,0.00015077322],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980386,0.0002874966,0.0005284767,0.00048020817,0.00018755111,0.00047766394],"domain_scores_gemma":[0.9958322,0.0015923801,0.00014617415,0.0020446412,0.0002809615,0.0001036579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049219315,0.0002174075,0.0003582712,0.00009612787,0.0003527353,0.00034847835,0.0021235137,0.00010079371,0.000007751548],"category_scores_gemma":[0.00003394914,0.00022961244,0.00013925905,0.0007016229,0.000057530717,0.00024832488,0.0014897112,0.00028272736,0.000017050745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044834498,0.0010219973,0.010537133,0.00007613865,0.00020671652,0.00001966599,0.00095012115,0.12346033,0.00003472094,0.41074452,0.018723262,0.43418056],"study_design_scores_gemma":[0.0031247903,0.00013266543,0.0052066534,0.00018373242,0.000019912684,0.000017756283,0.00005033376,0.89687943,0.000008678518,0.019112349,0.07475795,0.00050576776],"about_ca_topic_score_codex":0.00002576976,"about_ca_topic_score_gemma":0.00030220128,"teacher_disagreement_score":0.7734191,"about_ca_system_score_codex":0.00008846242,"about_ca_system_score_gemma":0.00021462761,"threshold_uncertainty_score":0.93633235},"labels":[],"label_agreement":null},{"id":"W4210754841","doi":"10.1016/j.comcom.2022.01.013","title":"Weighted triplet loss based on deep neural networks for loop closure detection in VSLAM","year":2022,"lang":"en","type":"article","venue":"Computer Communications","topic":"Robotics and Sensor-Based Localization","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Odometer; Artificial intelligence; Metric (unit); Simultaneous localization and mapping; Artificial neural network; Extrapolation; Deep learning; Global Positioning System; Closure (psychology); Boundary (topology); Computer vision; Robot; Mobile robot; Mathematics","score_opus":0.016473433839947982,"score_gpt":0.22481842500370217,"score_spread":0.20834499116375418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210754841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012127411,0.00018404124,0.98606724,0.0004817541,0.0003989214,0.00040610574,0.000013314833,0.00019760164,0.00012362497],"genre_scores_gemma":[0.9885747,0.000020671685,0.010404214,0.00032107966,0.00007004062,0.0001930053,0.00037411947,0.000034967816,0.000007194804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991874,0.00015212373,0.00025018872,0.00013498944,0.000098529235,0.00017674026],"domain_scores_gemma":[0.9987734,0.00026307517,0.000038610782,0.0008444068,0.000043941087,0.000036595284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001489398,0.00011702007,0.0001316229,0.00017238161,0.00031215895,0.000037455753,0.0004632104,0.00005140453,0.000012562516],"category_scores_gemma":[0.00000628911,0.0001398797,0.00006941827,0.00043994855,0.000025075376,0.000044255554,0.00009871245,0.0003193034,0.0000016691741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015568063,0.00007850327,0.00028124326,0.000009247246,0.000008338478,8.178651e-7,0.000049514063,0.9804166,0.000017331866,0.00056927366,0.00022653531,0.018327024],"study_design_scores_gemma":[0.0007156434,0.0001032676,0.00091036456,0.0000070781066,0.000009435695,0.0000020176562,0.000010076071,0.9940151,0.000031530297,0.0001226808,0.0039291014,0.00014373587],"about_ca_topic_score_codex":0.000008661963,"about_ca_topic_score_gemma":0.00008471084,"teacher_disagreement_score":0.9764473,"about_ca_system_score_codex":0.00013702999,"about_ca_system_score_gemma":0.0000085405045,"threshold_uncertainty_score":0.5704129},"labels":[],"label_agreement":null},{"id":"W4212772567","doi":"10.1016/j.comcom.2022.02.010","title":"A sustainable deep learning framework for fault detection in 6G Industry 4.0 heterogeneous data environments","year":2022,"lang":"en","type":"article","venue":"Computer Communications","topic":"Digital Transformation in Industry","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Computer science; Convolutional neural network; Deep learning; Machine learning; Artificial intelligence; Fault detection and isolation; Graph; Fault (geology); Key (lock); Theoretical computer science; Computer security","score_opus":0.04038966922434823,"score_gpt":0.26929149092944216,"score_spread":0.22890182170509393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212772567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024244795,0.00044833598,0.97221285,0.00022941807,0.0002536194,0.0006118283,0.00006222106,0.00030540855,0.0016315085],"genre_scores_gemma":[0.97825176,0.00004756559,0.02062317,0.00006229823,0.000039217106,0.00043137578,0.00038841812,0.000036810263,0.000119413504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990944,0.000082930404,0.00027998484,0.00016148339,0.00012489088,0.00025625952],"domain_scores_gemma":[0.99818903,0.00022381543,0.0000428582,0.0014836002,0.000013028753,0.000047688533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021029537,0.0001141765,0.000110472385,0.00013714175,0.00041829425,0.00008506164,0.0014777998,0.00013400512,0.000033376327],"category_scores_gemma":[0.000025358777,0.00015688481,0.000031025244,0.00029668424,0.000037487884,0.00039504116,0.0010709005,0.0012634309,0.000009870244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038277963,0.0000801408,0.00022937253,0.000031018924,0.000030956708,0.0000018151721,0.00073088636,0.94454896,0.000017466002,0.0016033798,0.00013845245,0.05258373],"study_design_scores_gemma":[0.00023355104,0.00003750288,0.00020801062,0.000013464089,0.000007664735,0.000015429981,0.0010391152,0.8050142,0.00007737784,0.0013296668,0.19185884,0.00016520233],"about_ca_topic_score_codex":0.00001075371,"about_ca_topic_score_gemma":0.000010876759,"teacher_disagreement_score":0.9540069,"about_ca_system_score_codex":0.00026898153,"about_ca_system_score_gemma":0.000013569079,"threshold_uncertainty_score":0.6397577},"labels":[],"label_agreement":null},{"id":"W4253699250","doi":"10.1016/s0140-3664(06)00460-9","title":"Call for Papers:Special Issue Labrador","year":2006,"lang":"en","type":"paratext","venue":"Computer Communications","topic":"Indigenous Studies and Ecology","field":"Health Professions","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Data science","score_opus":0.06393492969505456,"score_gpt":0.4032404382488492,"score_spread":0.33930550855379465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253699250","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001943659,0.0026384965,0.0038838943,0.012950038,0.015242875,0.003908783,0.0012952603,0.000115766765,0.95994544],"genre_scores_gemma":[0.00021854653,0.00351512,0.031629805,0.007563531,0.053536847,0.0038852536,0.0088730585,0.0001631724,0.8906147],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99684995,0.000545515,0.00088020327,0.00041842685,0.00011955926,0.0011863386],"domain_scores_gemma":[0.9944144,0.0017399215,0.0005068562,0.002621607,0.00061949645,0.000097733646],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00040112014,0.00036625657,0.00077149295,0.00014766482,0.009433334,0.000024423522,0.002033355,0.00081664446,0.0048581553],"category_scores_gemma":[0.000033146604,0.00036209557,0.00024440492,0.00016579205,0.00019897694,0.000038467722,0.002354398,0.0013537201,0.022080684],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010970125,0.00015122727,0.000030725067,0.00025514554,0.00012289992,4.3600286e-7,0.007814153,0.00002232502,7.578523e-7,0.0017613751,0.9835744,0.006255581],"study_design_scores_gemma":[0.00059827935,0.00011009315,0.0002598119,0.00012230274,0.00007277816,0.0000010419272,0.0006851367,0.0003059467,1.848825e-7,0.00008794894,0.9974099,0.00034658887],"about_ca_topic_score_codex":0.0030689703,"about_ca_topic_score_gemma":0.042907763,"teacher_disagreement_score":0.06933079,"about_ca_system_score_codex":0.00054795353,"about_ca_system_score_gemma":0.0007597559,"threshold_uncertainty_score":0.9998831},"labels":[],"label_agreement":null},{"id":"W4281691647","doi":"10.1016/j.comcom.2022.05.035","title":"A federated calibration scheme for convolutional neural networks: Models, applications and challenges","year":2022,"lang":"en","type":"article","venue":"Computer Communications","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"King Saud University","keywords":"Computer science; Convolutional neural network; Deep learning; Artificial intelligence; Network architecture; Artificial neural network; Path (computing); Cluster analysis; Pattern recognition (psychology); Machine learning; Computer network","score_opus":0.09128292449671148,"score_gpt":0.2811332553182015,"score_spread":0.18985033082149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281691647","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000039698436,0.008722919,0.9706806,0.018709285,0.000096191354,0.0011636106,0.000032607797,0.0004058143,0.00014925083],"genre_scores_gemma":[0.29272756,0.0015709195,0.6970081,0.0012248164,0.00015334321,0.0068933214,0.00034879352,0.000028156957,0.00004502422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998517,0.0001908535,0.0003370787,0.00050356134,0.0001729539,0.0002785501],"domain_scores_gemma":[0.9975777,0.0005500991,0.0001698128,0.0014313745,0.00015847634,0.00011251249],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00020800183,0.00017301111,0.00017299535,0.00010462565,0.0023383661,0.0001553118,0.0017529237,0.000042902037,0.0000031580616],"category_scores_gemma":[0.0000048731654,0.00020659219,0.00006534276,0.0005079608,0.00013551736,0.0006099723,0.0023916592,0.0002920532,0.0000013129896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045548218,0.00014525394,0.000010675113,0.000008812039,0.000020617881,1.6042921e-7,0.00013708045,0.12990426,0.0000227152,0.7738278,0.0010956497,0.094822444],"study_design_scores_gemma":[0.00029236687,0.000053341028,0.00007091388,0.0000025962083,0.000006668759,0.000029122773,0.000029350587,0.8927843,0.0000018180767,0.028377092,0.07816482,0.00018762061],"about_ca_topic_score_codex":0.0000043519053,"about_ca_topic_score_gemma":0.000012240786,"teacher_disagreement_score":0.76288,"about_ca_system_score_codex":0.000081391096,"about_ca_system_score_gemma":0.000056998175,"threshold_uncertainty_score":0.99896044},"labels":[],"label_agreement":null},{"id":"W4281759623","doi":"10.1016/j.comcom.2022.05.015","title":"Secure and intelligent slice resource allocation in vehicles-assisted cyber physical systems","year":2022,"lang":"en","type":"article","venue":"Computer Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Deanship of Scientific Research, King Saud University","keywords":"Computer science; Enabling; Cyber-physical system; Resource allocation; Distributed computing; Resource (disambiguation); Key (lock); Slicing; Resource management (computing); Agile software development; Embedded system; Computer network; Computer security; Software engineering; Operating system","score_opus":0.033913377896248306,"score_gpt":0.2621907547641763,"score_spread":0.22827737686792798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281759623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10416497,0.006425777,0.87227905,0.012799901,0.0006561609,0.0010471115,0.00001555773,0.00074620615,0.0018652757],"genre_scores_gemma":[0.98054427,0.00006947729,0.018444963,0.0005658698,0.00007556884,0.00018097405,0.000041785697,0.000013830733,0.00006325479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983922,0.0005502238,0.00028160732,0.00033402222,0.0002271333,0.00021476907],"domain_scores_gemma":[0.99722844,0.0005271349,0.00011104543,0.0020003188,0.000056186076,0.00007685467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003785488,0.00013454464,0.00018760747,0.00014274342,0.0005028736,0.00018577286,0.0021497335,0.000035759633,0.0000019190543],"category_scores_gemma":[0.000009600627,0.00014506497,0.00004718357,0.0007853904,0.000069126836,0.00017812243,0.0032240325,0.00045763853,0.0000099479175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019736388,0.001725412,0.0051761037,0.000056379064,0.000095569085,0.00001705731,0.020646475,0.06821683,0.00013589472,0.50086874,0.01937898,0.38366285],"study_design_scores_gemma":[0.00023352147,0.00006445662,0.011251456,0.00003088239,0.000006187978,0.000040659044,0.00015297318,0.8831159,0.0000040464756,0.00074608147,0.104176834,0.00017698143],"about_ca_topic_score_codex":0.00012971344,"about_ca_topic_score_gemma":0.000030415888,"teacher_disagreement_score":0.8763793,"about_ca_system_score_codex":0.00012212967,"about_ca_system_score_gemma":0.00004477815,"threshold_uncertainty_score":0.5915578},"labels":[],"label_agreement":null},{"id":"W4283826703","doi":"10.1016/j.comcom.2022.06.041","title":"A Binary Gray Wolf Optimization algorithm for deployment of Virtual Network Functions in 5G hybrid cloud","year":2022,"lang":"en","type":"article","venue":"Computer Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Software deployment; Cloud computing; Virtual network; Distributed computing; Quality of service; Server; Algorithm; Computer network; Operating system","score_opus":0.02318984985247981,"score_gpt":0.24572655227745457,"score_spread":0.22253670242497475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283826703","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042959224,0.00081080163,0.9955697,0.0012700612,0.0010572858,0.000537466,0.000049707185,0.0002020647,0.00007333927],"genre_scores_gemma":[0.18782733,0.000099804594,0.81023765,0.00066372514,0.00019659902,0.0006604817,0.00022500759,0.00002589642,0.0000635007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983447,0.00033282422,0.00048243767,0.00032919223,0.00021092559,0.0002998913],"domain_scores_gemma":[0.99693936,0.00069632946,0.0002039039,0.0019751517,0.000118207434,0.00006706748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005258651,0.00015247104,0.00023693706,0.00019346894,0.000702482,0.000060523293,0.0023298864,0.000032418826,0.000015401118],"category_scores_gemma":[0.000010621617,0.00017545014,0.00012461338,0.0010559203,0.00007410911,0.00020895836,0.001629616,0.00027926915,0.0000032025607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006160128,0.00033709547,0.00038084644,0.0000029371965,0.000027911427,0.0000011849012,0.00019938117,0.8849008,0.0000011912078,0.009031964,0.0137166735,0.09139384],"study_design_scores_gemma":[0.00067640276,0.00032075943,0.0006396957,0.000021061924,0.000013520629,0.000013489203,0.000024471587,0.9760515,0.0000022926076,0.0012811801,0.020783653,0.00017196033],"about_ca_topic_score_codex":0.00004570144,"about_ca_topic_score_gemma":0.000014766787,"teacher_disagreement_score":0.18739775,"about_ca_system_score_codex":0.00012016783,"about_ca_system_score_gemma":0.00011137221,"threshold_uncertainty_score":0.71546495},"labels":[],"label_agreement":null},{"id":"W4285600422","doi":"10.1016/j.comcom.2022.07.012","title":"BioMixD: A Bio-Inspired and Traffic-Aware Mix Zone Placement Strategy for Location Privacy on the Internet of Drones","year":2022,"lang":"en","type":"article","venue":"Computer Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Drone; Computer science; The Internet; Privacy protection; Traffic analysis; Computer security; Internet of Things; World Wide Web","score_opus":0.03716846378486634,"score_gpt":0.25095439799267516,"score_spread":0.21378593420780884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285600422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123468585,0.0005110424,0.87290204,0.0017717435,0.00007421816,0.00094686967,0.000058912632,0.00014170737,0.00012491128],"genre_scores_gemma":[0.9856024,0.00010286389,0.013283096,0.000056597997,0.000015341879,0.0006315735,0.0002588747,0.00001693394,0.000032339412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947935,0.00004928101,0.00021529576,0.000104465325,0.00006934886,0.00008224601],"domain_scores_gemma":[0.9989026,0.00017547091,0.00004679453,0.0007930093,0.000060981594,0.000021117827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012814283,0.00008461982,0.00009107983,0.000076878525,0.00022812672,0.00003036839,0.00051753223,0.000021166188,0.000016892684],"category_scores_gemma":[0.0000032634791,0.00007798038,0.0000272121,0.00023279582,0.000055207332,0.000041662097,0.0002230341,0.000089469606,0.0000019177598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013645414,0.00024266538,0.000049328148,0.000052424497,0.00007309368,3.5895557e-8,0.0018051736,0.9310592,0.00024185384,0.02596816,0.005006124,0.035488337],"study_design_scores_gemma":[0.00026039258,0.00010529888,0.0005589357,0.000014710388,0.000015529893,0.0000012865285,0.00019195816,0.986798,0.00018952432,0.000082378814,0.011699331,0.00008269158],"about_ca_topic_score_codex":0.000010812038,"about_ca_topic_score_gemma":0.000013592444,"teacher_disagreement_score":0.8621338,"about_ca_system_score_codex":0.000051873554,"about_ca_system_score_gemma":0.000016512588,"threshold_uncertainty_score":0.31799477},"labels":[],"label_agreement":null},{"id":"W4367311454","doi":"10.1016/j.comcom.2023.04.021","title":"Improved differential evolution for RSSD-based localization in Gaussian mixture noise","year":2023,"lang":"en","type":"article","venue":"Computer Communications","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"China Scholarship Council; Science and Technology Commission of Shanghai Municipality; National Natural Science Foundation of China","keywords":"Computer science; Gaussian; Gaussian noise; Algorithm; Upper and lower bounds; Chaotic; Mathematical optimization; Noise (video); Cramér–Rao bound; Artificial intelligence; Mathematics; Estimation theory; Physics","score_opus":0.016266000578998935,"score_gpt":0.24264690238940725,"score_spread":0.22638090181040832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367311454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036187095,0.00012540376,0.9932232,0.0006640308,0.0002990407,0.00039779532,0.000025884909,0.0015170549,0.00012886034],"genre_scores_gemma":[0.98806155,0.00005363392,0.010817694,0.00006442732,0.000049056398,0.00031913928,0.0005814538,0.000030492969,0.000022530188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993242,0.00003337179,0.00024265089,0.00012980879,0.00006305717,0.0002068791],"domain_scores_gemma":[0.99895537,0.000100519384,0.0000308194,0.00082135125,0.00006391122,0.00002805413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000075526186,0.00012149477,0.00012946465,0.00032573057,0.00015580327,0.000042640113,0.0005464959,0.0001364157,0.0000075270013],"category_scores_gemma":[0.000025006766,0.00013044132,0.00005736573,0.00071425934,0.000061121864,0.00008464814,0.000119536504,0.0001407827,0.00001965606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002692385,0.00022652463,0.0038505278,0.00036117205,0.00006594054,0.0000018535605,0.0010112668,0.88753784,0.005621933,0.04313253,0.026373345,0.03179015],"study_design_scores_gemma":[0.00050638267,0.00001938137,0.0028885244,0.000034679422,0.000007967968,3.41806e-7,0.000032596956,0.9896671,0.0010522855,0.001055116,0.0045917984,0.00014378212],"about_ca_topic_score_codex":0.000010690041,"about_ca_topic_score_gemma":0.00012653031,"teacher_disagreement_score":0.9844429,"about_ca_system_score_codex":0.00011096051,"about_ca_system_score_gemma":0.000021776834,"threshold_uncertainty_score":0.53192425},"labels":[],"label_agreement":null},{"id":"W4376127739","doi":"10.1016/j.comcom.2023.04.032","title":"AI-based energy-efficient path planning of multiple logistics UAVs in intelligent transportation systems","year":2023,"lang":"en","type":"article","venue":"Computer Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":68,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Department of Engineering Physics, University of Wisconsin-Madison; Natural Science Foundation of Sichuan Province; King Saud University","keywords":"Computer science; Crossover; Energy consumption; Mathematical optimization; Context (archaeology); Genetic algorithm; Operator (biology); Motion planning; Path (computing); Operations research; Artificial intelligence","score_opus":0.040531407499765915,"score_gpt":0.2584941633609369,"score_spread":0.21796275586117098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376127739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011206518,0.00031823412,0.9877339,0.00007629303,0.000115539544,0.0001646375,0.000042241536,0.00024821368,0.00009443122],"genre_scores_gemma":[0.9818167,0.00013206725,0.017081331,0.000021371003,0.00001537527,0.00011437099,0.000796687,0.000018309822,0.0000037963216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932474,0.000034485045,0.0003554303,0.00008373884,0.0000853291,0.00011629272],"domain_scores_gemma":[0.99899024,0.0001857335,0.000050761173,0.000667751,0.000075678996,0.000029856026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001087337,0.00008616678,0.00012369828,0.00021297144,0.00006022475,0.000019508818,0.00034481185,0.000052286417,0.0000018101928],"category_scores_gemma":[0.0000035489356,0.00009753399,0.000032088377,0.0006338111,0.000038407266,0.000028345314,0.000025543937,0.00009535384,0.0000071403524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011686117,0.000056935834,0.0023102614,0.00003651371,0.000007075908,3.734858e-7,0.00052266155,0.99059045,0.00006275823,0.0045831576,0.0003227103,0.0015059533],"study_design_scores_gemma":[0.00014473166,0.000009617128,0.006067348,0.00008769445,0.0000066280177,1.7898209e-7,0.000101355196,0.99060047,0.0001016797,0.000037317426,0.0027531267,0.00008986646],"about_ca_topic_score_codex":0.00011908175,"about_ca_topic_score_gemma":0.000078298224,"teacher_disagreement_score":0.9706526,"about_ca_system_score_codex":0.00004949128,"about_ca_system_score_gemma":0.000017929,"threshold_uncertainty_score":0.39773208},"labels":[],"label_agreement":null},{"id":"W4380149302","doi":"10.1016/j.comcom.2023.06.008","title":"An O-MAPPO scheme for joint computation offloading and resources allocation in UAV assisted MEC systems","year":2023,"lang":"en","type":"article","venue":"Computer Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Computation offloading; Server; Mobile edge computing; Distributed computing; Robustness (evolution); Resource allocation; Benchmark (surveying); Markov decision process; Computation; Flexibility (engineering); Energy consumption; Partially observable Markov decision process; Edge computing; Computer network; Markov process; Enhanced Data Rates for GSM Evolution; Markov chain; Markov model; Artificial intelligence; Algorithm","score_opus":0.05419377472690572,"score_gpt":0.27858476248105024,"score_spread":0.2243909877541445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380149302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11735243,0.00043619613,0.87972116,0.0005173185,0.00012503464,0.0007685078,0.000018807994,0.0007584058,0.00030214668],"genre_scores_gemma":[0.85832137,0.00019067044,0.1403425,0.000019993842,0.00005621559,0.0003885472,0.00063720613,0.000029288634,0.00001423019],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999215,0.00006375162,0.00032976342,0.00016858535,0.00007349009,0.00014942096],"domain_scores_gemma":[0.9990076,0.00015387477,0.00005692605,0.0006293156,0.00009982279,0.000052467807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029407578,0.000109224806,0.0001450698,0.00028180535,0.00020895152,0.00014415347,0.00028608457,0.00007047237,7.799856e-7],"category_scores_gemma":[0.000008936766,0.00012845003,0.000023349423,0.00057040877,0.000039017956,0.00021063065,0.00008641054,0.000099474426,0.000010729483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034422824,0.000089365,0.0007563856,0.00015849737,0.000039008275,2.6459333e-7,0.0024617647,0.9438554,0.0042582587,0.008467396,0.0018521791,0.03805802],"study_design_scores_gemma":[0.00026416953,0.000018668678,0.015071921,0.000056246805,0.000008154092,0.0000026586793,0.00020430904,0.9801722,0.000027233975,0.00022374371,0.003817766,0.00013292527],"about_ca_topic_score_codex":0.00003789899,"about_ca_topic_score_gemma":0.000054780558,"teacher_disagreement_score":0.7409689,"about_ca_system_score_codex":0.000067457615,"about_ca_system_score_gemma":0.000011063952,"threshold_uncertainty_score":0.523804},"labels":[],"label_agreement":null},{"id":"W4380300805","doi":"10.1016/j.comcom.2023.06.007","title":"Online and reliable SFC protection scheme of distributed cloud network for future IoT application","year":2023,"lang":"en","type":"article","venue":"Computer Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"King Saud University","keywords":"Computer science; Backup; Cloud computing; Distributed computing; Virtual network; Reliability (semiconductor); Computer network; Service (business); Scheme (mathematics); Operating system","score_opus":0.03492531728465325,"score_gpt":0.2717257130008861,"score_spread":0.23680039571623285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380300805","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004732596,0.0009405356,0.98677707,0.00597987,0.0003534798,0.000680722,0.000050177972,0.00047258282,0.0000129770915],"genre_scores_gemma":[0.09242752,0.0007385769,0.90435755,0.00024053891,0.0009578027,0.00040265123,0.00081516523,0.000022476732,0.0000377434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902284,0.000058262398,0.00030748002,0.00027766134,0.00010721652,0.00022651603],"domain_scores_gemma":[0.9975164,0.00024760043,0.00017735983,0.0017932403,0.00020400423,0.00006141185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030258019,0.00012118223,0.00018492031,0.00007243217,0.00037993598,0.000063816595,0.001213256,0.00009653439,5.6439984e-7],"category_scores_gemma":[0.000016886266,0.00012211499,0.000060890157,0.0011594513,0.00007115627,0.0001126925,0.0008855946,0.00017395006,0.0000065011805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004104599,0.00061424123,0.0034161676,0.0002023209,0.0001413912,5.9210424e-7,0.0008943884,0.026424283,0.00024245882,0.38887772,0.08595881,0.4931866],"study_design_scores_gemma":[0.00028920895,0.00007904682,0.008496484,0.00004139256,0.000008298035,0.0000033762517,0.000013233511,0.8466028,0.000013483138,0.009006029,0.1353244,0.00012221516],"about_ca_topic_score_codex":0.000019364168,"about_ca_topic_score_gemma":0.000027117068,"teacher_disagreement_score":0.82017857,"about_ca_system_score_codex":0.000023930945,"about_ca_system_score_gemma":0.000036311485,"threshold_uncertainty_score":0.49797043},"labels":[],"label_agreement":null},{"id":"W4384008567","doi":"10.1016/j.comcom.2023.07.010","title":"Average age upon decisions with truncated HARQ and optimization in the finite blocklength regime","year":2023,"lang":"en","type":"article","venue":"Computer Communications","topic":"Age of Information Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Hybrid automatic repeat request; Computer science; Network packet; Decoding methods; Transmitter; Convexity; Throughput; Wireless; Algorithm; Mathematical optimization; Computer network; Telecommunications; Mathematics; Telecommunications link; Channel (broadcasting)","score_opus":0.03634150201452821,"score_gpt":0.2552905385347692,"score_spread":0.21894903652024097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384008567","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012818733,0.0000506855,0.98906976,0.0072335415,0.000056987526,0.0003827849,0.0000034792388,0.00033647328,0.0015844384],"genre_scores_gemma":[0.36690682,0.0006203536,0.6311479,0.0008724116,0.00002062543,0.000086086904,0.00023320458,0.000014098913,0.000098475975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986907,0.0002660495,0.00034953217,0.00022563526,0.00025985957,0.00020819141],"domain_scores_gemma":[0.9963684,0.001089148,0.00014787399,0.0021995073,0.00013984882,0.00005521527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056905585,0.00014526244,0.00013697603,0.00037959803,0.0004914499,0.00045403608,0.002300433,0.00006095504,0.0000044225753],"category_scores_gemma":[0.00009334453,0.00011043254,0.000028069677,0.0020344744,0.00009350088,0.000940598,0.0008874676,0.00024065984,0.000052767744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003379814,0.00005049746,0.00007848808,0.0000034088048,0.0000094069355,0.000008763463,0.0055077695,0.960058,0.0000012681367,0.021050075,0.0013152998,0.011913671],"study_design_scores_gemma":[0.00041536512,0.0000454237,0.00305401,0.00005299523,0.0000040965624,0.0000218085,0.00008439277,0.9918294,0.0000024439894,0.000521854,0.003827812,0.0001403948],"about_ca_topic_score_codex":0.000012752867,"about_ca_topic_score_gemma":0.000046192014,"teacher_disagreement_score":0.36562493,"about_ca_system_score_codex":0.00003469201,"about_ca_system_score_gemma":0.0000559555,"threshold_uncertainty_score":0.45033085},"labels":[],"label_agreement":null},{"id":"W4384297406","doi":"10.1016/j.comcom.2023.07.019","title":"A novel hybrid method for achieving accurate and timeliness vehicular traffic flow prediction in road networks","year":2023,"lang":"en","type":"article","venue":"Computer Communications","topic":"Traffic Prediction and Management Techniques","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"National Natural Science Foundation of China","keywords":"Computer science; Scalability; Context (archaeology); Traffic flow (computer networking); Floating car data; Traffic generation model; Network traffic control; Traffic congestion; Advanced Traffic Management System; Traffic congestion reconstruction with Kerner's three-phase theory; Scale (ratio); Traffic simulation; Process (computing); Intelligent transportation system; Network traffic simulation; Distributed computing; Real-time computing; Transport engineering; Microsimulation; Computer network","score_opus":0.029650198194754885,"score_gpt":0.27854985436020036,"score_spread":0.24889965616544546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384297406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003805286,0.0002953081,0.9905113,0.00046470243,0.0002225946,0.0004564134,0.000027865812,0.0041243425,0.00009220617],"genre_scores_gemma":[0.65474916,0.00085723086,0.34349632,0.00008703093,0.000093798066,0.00034423996,0.0003212132,0.00003206267,0.000018959021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935246,0.000043080767,0.00024282633,0.00014580529,0.000051983407,0.00016383754],"domain_scores_gemma":[0.9992043,0.00013958578,0.00002561559,0.0005623746,0.000029863126,0.000038278915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036475484,0.00011084953,0.0001359107,0.00020809876,0.00013201157,0.000056973473,0.00035174607,0.00005013363,8.422075e-7],"category_scores_gemma":[0.00000989669,0.0001257995,0.00004107792,0.000330286,0.000024324656,0.00014291004,0.00021782436,0.0001744354,0.0000035499593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015432045,0.000020574696,0.000010785616,0.000023350467,0.000022217047,3.0085272e-7,0.00009533712,0.69121385,0.00006440079,0.0001488824,0.009129737,0.29926905],"study_design_scores_gemma":[0.00033994004,0.000014111569,0.00344938,0.00005941835,0.000016929436,0.0000047476847,0.000015309644,0.9820891,0.0000070556634,0.000017712153,0.013883835,0.00010246789],"about_ca_topic_score_codex":0.0000047451476,"about_ca_topic_score_gemma":0.000026143132,"teacher_disagreement_score":0.6509439,"about_ca_system_score_codex":0.000031240637,"about_ca_system_score_gemma":0.00000535809,"threshold_uncertainty_score":0.5129955},"labels":[],"label_agreement":null},{"id":"W4385237531","doi":"10.1016/j.comcom.2023.07.029","title":"RUMP: Resource Usage Multi-Step Prediction in Extreme Edge Computing","year":2023,"lang":"en","type":"article","venue":"Computer Communications","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Rump; Testbed; Computational complexity theory; Computational resource; Artificial intelligence; Algorithm","score_opus":0.17478461648339058,"score_gpt":0.30580314177242307,"score_spread":0.1310185252890325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385237531","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018041225,0.00030400403,0.9701688,0.002562464,0.003481637,0.00040826193,0.0000018813482,0.0018258416,0.0032058626],"genre_scores_gemma":[0.3484394,0.0000783936,0.64774185,0.00084581453,0.0017292732,0.000046531524,0.00017202541,0.00006462977,0.0008820774],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730045,0.00047576847,0.0006818985,0.00059832365,0.00029051772,0.00065306656],"domain_scores_gemma":[0.9955765,0.0007138405,0.00018361956,0.0032696386,0.00011187392,0.00014453047],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011648698,0.0002612649,0.00029763495,0.00063488825,0.00076190825,0.00033718118,0.004405821,0.00012808394,0.0000020747505],"category_scores_gemma":[0.00005607086,0.00029419136,0.00012475834,0.0024066695,0.00013108546,0.0004846373,0.0050582145,0.0005965506,0.00048569177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007152844,0.0007477293,0.041292835,0.00008331773,0.00007441806,0.000057358233,0.014943794,0.007285123,0.00042103964,0.007886539,0.13562705,0.79157364],"study_design_scores_gemma":[0.00050886447,0.000029272838,0.07641679,0.00012259834,0.0000040096015,0.000016688931,0.000039714883,0.84282255,0.000012769216,0.00022131589,0.07956969,0.00023572026],"about_ca_topic_score_codex":0.000070712544,"about_ca_topic_score_gemma":0.000030707768,"teacher_disagreement_score":0.83553743,"about_ca_system_score_codex":0.00013933134,"about_ca_system_score_gemma":0.00007985108,"threshold_uncertainty_score":0.999951},"labels":[],"label_agreement":null},{"id":"W4386366844","doi":"10.1016/j.comcom.2023.08.021","title":"Generation of irregular grid maps for fingerprinting-based mobile radio localization using farthest-first traversal and low-discrepancy sequences","year":2023,"lang":"en","type":"article","venue":"Computer Communications","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Tree traversal; Grid; Context (archaeology); Radio frequency; Real-time computing; Generator (circuit theory); Global Positioning System; Algorithm; Telecommunications","score_opus":0.05268837494697695,"score_gpt":0.2659716363812879,"score_spread":0.21328326143431095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386366844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08472678,0.00046512065,0.9133765,0.00011484402,0.00022182392,0.00040396105,0.00004805535,0.0006175544,0.000025339208],"genre_scores_gemma":[0.9465337,0.00025287695,0.052633945,0.000020572035,0.00006794192,0.00010772327,0.00035266497,0.000026252956,0.0000043244695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932706,0.00003138901,0.00028012876,0.00013748484,0.000079359896,0.00014454834],"domain_scores_gemma":[0.9990609,0.00012783334,0.0000652488,0.00062233675,0.00009908441,0.000024541774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014622678,0.00011436092,0.00015330205,0.00019622828,0.0002487239,0.000044437656,0.00033292646,0.00008532292,0.0000029330952],"category_scores_gemma":[0.000023975086,0.00012559017,0.000050731578,0.0003966043,0.00014417167,0.00010914426,0.00009930345,0.00006764218,0.0000025230443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018419493,0.000021864236,0.00084738416,0.00016819876,0.00002637765,2.7432682e-7,0.000563731,0.9866625,0.0019474837,0.0032408054,0.00068977964,0.005829736],"study_design_scores_gemma":[0.00023196063,0.000025192669,0.00029118726,0.00006942597,0.000018552932,0.0000015303971,0.000080736325,0.9861864,0.009271188,0.00034893324,0.0033460662,0.00012882845],"about_ca_topic_score_codex":0.000017169645,"about_ca_topic_score_gemma":0.000038696322,"teacher_disagreement_score":0.8618069,"about_ca_system_score_codex":0.00003766352,"about_ca_system_score_gemma":0.00002500391,"threshold_uncertainty_score":0.5121419},"labels":[],"label_agreement":null},{"id":"W4388366321","doi":"10.1016/j.comcom.2023.11.002","title":"A review of Machine Learning (ML)-based IoT security in healthcare: A dataset perspective","year":2023,"lang":"en","type":"review","venue":"Computer Communications","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; Research and Productivity Council; University of New Brunswick","funders":"","keywords":"Computer science; Testbed; Internet of Things; Health care; Process (computing); Computer security; Healthcare industry; Compromise; Perspective (graphical); Analytics; Data science; Risk analysis (engineering); Artificial intelligence; World Wide Web; Business","score_opus":0.16293946387470584,"score_gpt":0.42768060485497,"score_spread":0.26474114098026413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388366321","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.464249e-8,0.9788752,0.015379087,0.0032602854,0.000981351,0.0010374171,0.00010813967,0.00027562125,0.00008281034],"genre_scores_gemma":[0.0000016032226,0.9649682,0.03174006,0.0007911754,0.00025863884,0.00012684206,0.0020570525,0.000048984915,0.0000074483237],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9947868,0.002222123,0.0014350631,0.00076322455,0.00031596352,0.000476834],"domain_scores_gemma":[0.99160606,0.0017940664,0.0009689631,0.005184775,0.00030561246,0.00014051492],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018276782,0.0004875829,0.0019819974,0.0006766789,0.00030825732,0.00009906057,0.0071661733,0.00020450969,0.0000016935952],"category_scores_gemma":[0.00019494086,0.00047681306,0.00045985228,0.003002536,0.0001500448,0.00009889174,0.005036149,0.0018530808,0.00010712934],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012123202,0.00036084958,0.000013330221,0.11687488,0.00017780767,0.000019738249,0.00063938205,0.000024226363,1.5473422e-8,0.008845045,0.027625563,0.8454179],"study_design_scores_gemma":[0.00012809361,0.000053069427,0.0000026342482,0.10467931,0.000086880595,0.000018591852,0.0000019936517,0.07976345,3.2640987e-8,0.0005226326,0.81440085,0.00034245793],"about_ca_topic_score_codex":0.0010266971,"about_ca_topic_score_gemma":0.00010181959,"teacher_disagreement_score":0.8450755,"about_ca_system_score_codex":0.00039733053,"about_ca_system_score_gemma":0.00096491975,"threshold_uncertainty_score":0.9997684},"labels":[],"label_agreement":null},{"id":"W4389219633","doi":"10.1016/j.comcom.2023.11.030","title":"Prediction-Based Cooperative Cache Discovery in VANETs for Social Networking","year":2023,"lang":"en","type":"article","venue":"Computer Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Telus (Canada); Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cache; Computer network; Network packet; Data mining; Cluster analysis; Exploit; Vehicular ad hoc network; Wireless; Computer security; Machine learning; Wireless ad hoc network","score_opus":0.11623881224486594,"score_gpt":0.3029798801223548,"score_spread":0.1867410678774889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389219633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009762542,0.0001805772,0.98188055,0.0063232253,0.0006899404,0.00037003937,0.000031618045,0.00045784476,0.00030368863],"genre_scores_gemma":[0.9867397,0.000034584544,0.011813932,0.0006655696,0.00023534917,0.00018404088,0.00017911958,0.000011426258,0.00013625644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895394,0.00018273808,0.00024605799,0.00025703802,0.00011705454,0.00024316083],"domain_scores_gemma":[0.9981091,0.0007154738,0.000063303094,0.0009876722,0.00008981241,0.000034615237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000346496,0.00011105892,0.0001478197,0.00017696999,0.0005478382,0.00026710468,0.0015851451,0.00005365422,4.9410244e-7],"category_scores_gemma":[0.000015338454,0.00011785704,0.00009031308,0.000726903,0.000065009546,0.0003684371,0.00062298804,0.0001990625,0.000016456348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006445786,0.0011222551,0.01860242,0.000092700044,0.0002444915,0.00002255265,0.01289812,0.3184357,0.0011290641,0.25478104,0.12031611,0.2722911],"study_design_scores_gemma":[0.00045064176,0.00003561874,0.007904956,0.000038501275,0.000004743354,0.0000010130902,0.00002857669,0.9825773,0.0000048679067,0.0006696497,0.008164503,0.000119581106],"about_ca_topic_score_codex":0.000049180628,"about_ca_topic_score_gemma":0.00011840271,"teacher_disagreement_score":0.97697717,"about_ca_system_score_codex":0.00007066172,"about_ca_system_score_gemma":0.00010501498,"threshold_uncertainty_score":0.48060706},"labels":[],"label_agreement":null},{"id":"W4389505417","doi":"10.1016/j.comcom.2023.12.003","title":"Robust multimodal federated learning for incomplete modalities","year":2023,"lang":"en","type":"article","venue":"Computer Communications","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Modalities; Computer science; Multimodal learning; Modality (human–computer interaction); Artificial intelligence; Machine learning; Representation (politics); Feature (linguistics); Dependency (UML); Feature learning","score_opus":0.13377088027244857,"score_gpt":0.3101905550907414,"score_spread":0.17641967481829282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389505417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018655316,0.00009443804,0.97784185,0.015077367,0.00020815965,0.00033756212,0.000005061567,0.0037466043,0.0008234167],"genre_scores_gemma":[0.6236566,0.00010309864,0.37461388,0.00017954786,0.000041879928,0.00029736134,0.00014050382,0.000015385247,0.0009517813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988312,0.00011640467,0.0002985407,0.00031562315,0.00013947315,0.00029876255],"domain_scores_gemma":[0.9972739,0.00066279666,0.00012211136,0.0017005266,0.00018852195,0.00005213616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029454925,0.00014401802,0.00016647161,0.0002753211,0.0010453083,0.0004670747,0.0029485708,0.00007792405,0.0000041601124],"category_scores_gemma":[0.000079693724,0.00014853461,0.00008771992,0.0008338864,0.0001437027,0.00045970213,0.0018992611,0.0002213216,0.00016701958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004044562,0.00010653028,0.0009206005,0.000028121825,0.000058127105,0.00000102354,0.0013036986,0.012903693,0.00044728772,0.73815346,0.020211842,0.22586158],"study_design_scores_gemma":[0.00028527968,0.000046181234,0.0030629993,0.000013544706,0.0000033547497,0.0000020201053,0.0001279208,0.9158622,0.00013498936,0.0108555695,0.06943187,0.00017404513],"about_ca_topic_score_codex":0.000017271681,"about_ca_topic_score_gemma":0.0000114429895,"teacher_disagreement_score":0.9029585,"about_ca_system_score_codex":0.000046933506,"about_ca_system_score_gemma":0.000051998974,"threshold_uncertainty_score":0.8039772},"labels":[],"label_agreement":null},{"id":"W4389627500","doi":"10.1016/j.comcom.2023.12.010","title":"A UAV-based coverage gap detection and resolution in cellular networks: A machine-learning approach","year":2023,"lang":"en","type":"article","venue":"Computer Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"American University in Cairo","keywords":"Computer science; Benchmark (surveying); Base station; Cellular network; Software deployment; Real-time computing; Resolution (logic); Distributed computing; Artificial intelligence; Computer network","score_opus":0.020199496974780018,"score_gpt":0.20922298017162222,"score_spread":0.1890234831968422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389627500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010473772,0.000770066,0.9868056,0.000096503296,0.000044203727,0.00024284239,0.000002976217,0.00057642534,0.0009876133],"genre_scores_gemma":[0.96662307,0.0008484043,0.03196611,0.00002448742,0.000032540738,0.00014986016,0.000311454,0.000025293797,0.00001880282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937624,0.000093196395,0.00018708564,0.00013653778,0.00005815628,0.00014876822],"domain_scores_gemma":[0.9992416,0.00009941282,0.000030361514,0.00056525227,0.000026520262,0.000036888137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019687311,0.00009729805,0.00009788984,0.0002117634,0.00020983977,0.00005925515,0.00022716058,0.000070675706,0.0000021374733],"category_scores_gemma":[0.000006469079,0.00011560692,0.000024768415,0.0008041899,0.000035486373,0.00009138276,0.00012479986,0.00026237435,0.000011703347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001596822,0.000022927405,0.00047584195,0.000017066774,0.0000055440178,2.286375e-7,0.00013213673,0.98784053,0.00016716782,0.00043513646,0.000058389225,0.010843437],"study_design_scores_gemma":[0.00024754065,0.000011351942,0.003133405,0.00001737406,0.00000628452,0.0000012766751,0.000011037845,0.992315,0.000020333078,0.00009541926,0.004029558,0.00011141521],"about_ca_topic_score_codex":0.000040154857,"about_ca_topic_score_gemma":0.000073209805,"teacher_disagreement_score":0.9561493,"about_ca_system_score_codex":0.000058292142,"about_ca_system_score_gemma":0.0000068509544,"threshold_uncertainty_score":0.47143134},"labels":[],"label_agreement":null},{"id":"W4390640588","doi":"10.1016/j.comcom.2024.01.004","title":"Memory-enhanced appearance-motion consistency framework for video anomaly detection","year":2024,"lang":"en","type":"article","venue":"Computer Communications","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of British Columbia Hospital","funders":"","keywords":"Computer science; Anomaly detection; Benchmark (surveying); Consistency (knowledge bases); Motion (physics); Artificial intelligence; Computer vision; Representation (politics); Anomaly (physics); Focus (optics); Data consistency; Pattern recognition (psychology); Database","score_opus":0.029579345908221547,"score_gpt":0.30316696884916416,"score_spread":0.27358762294094263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390640588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027732222,0.0016253038,0.9893187,0.004104562,0.0006223555,0.00075748935,0.0000092215305,0.0020101187,0.001274925],"genre_scores_gemma":[0.57374114,0.00009389577,0.4250465,0.00029937082,0.00013584927,0.00059636537,0.0000074809595,0.000016210066,0.000063190004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985658,0.00009783281,0.0004070034,0.0005308026,0.00014259889,0.0002559891],"domain_scores_gemma":[0.9965784,0.00038793872,0.00011191765,0.002621047,0.0002116723,0.00008902939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030281153,0.0001885101,0.00018625878,0.00022382136,0.0007627058,0.00048500454,0.0018447324,0.00012202936,0.0000068333666],"category_scores_gemma":[0.000033098055,0.0001993766,0.00020880021,0.00092880224,0.000136511,0.00055701507,0.0005242312,0.00034523965,0.00012006012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023992623,0.00007478337,0.000003098059,0.000046375375,0.000032151824,4.4228372e-7,0.0003039822,0.00007003464,0.00144687,0.40807062,0.000718436,0.5892308],"study_design_scores_gemma":[0.00017924048,0.00016558716,0.0003911878,0.00023341819,0.000033618722,0.000042486172,0.000030925374,0.71688026,0.0174612,0.16794989,0.09621017,0.00042204524],"about_ca_topic_score_codex":0.000018484712,"about_ca_topic_score_gemma":0.00002022906,"teacher_disagreement_score":0.7168102,"about_ca_system_score_codex":0.000102133534,"about_ca_system_score_gemma":0.000071992494,"threshold_uncertainty_score":0.8130342},"labels":[],"label_agreement":null},{"id":"W4390780727","doi":"10.1016/j.comcom.2024.01.002","title":"Enhancing modular application placement in a hierarchical fog computing: A latency and communication cost-sensitive approach","year":2024,"lang":"en","type":"article","venue":"Computer Communications","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Fundação de Amparo à Pesquisa do Estado da Bahia; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Computer science; Cloud computing; Latency (audio); Edge computing; Edge device; Distributed computing; Modular design; Enabling; Computer network; Enhanced Data Rates for GSM Evolution; Network architecture; Telecommunications","score_opus":0.024592772499138996,"score_gpt":0.280134381292511,"score_spread":0.255541608793372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390780727","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010173241,0.0023340639,0.98049974,0.0030081575,0.0005727661,0.00083749247,9.489515e-7,0.0005246492,0.0020489355],"genre_scores_gemma":[0.62432903,0.00020382492,0.3748417,0.0002344494,0.000200975,0.000081996746,0.00006515874,0.00002066856,0.000022173483],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746203,0.0005266364,0.00063261186,0.0006944416,0.00025181373,0.00043246307],"domain_scores_gemma":[0.9961989,0.00082596584,0.00011555369,0.0025947834,0.00012745733,0.00013733988],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001110014,0.00027387807,0.00031608614,0.0004282315,0.00053395686,0.00057027274,0.002154595,0.00012676737,4.1746475e-7],"category_scores_gemma":[0.000024664885,0.00029210604,0.00008375547,0.0010577616,0.00021100616,0.0005164107,0.003363023,0.0007771142,0.000032237935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015557733,0.00088055874,0.0010283344,0.0003155441,0.00015756136,0.000019277602,0.03688784,0.004883447,0.0017374421,0.33059457,0.0020190624,0.6214608],"study_design_scores_gemma":[0.00029806772,0.00003801037,0.003414443,0.00025237192,0.000011701982,0.00006133222,0.00006096259,0.9822833,0.00009563405,0.0041068206,0.009074284,0.00030308726],"about_ca_topic_score_codex":0.00009078,"about_ca_topic_score_gemma":0.000020988093,"teacher_disagreement_score":0.9773998,"about_ca_system_score_codex":0.00019013003,"about_ca_system_score_gemma":0.000121121935,"threshold_uncertainty_score":0.9999531},"labels":[],"label_agreement":null},{"id":"W4391067329","doi":"10.1016/j.comcom.2024.01.018","title":"Securing IIoT applications in 6G and beyond using adaptive ensemble learning and zero-touch multi-resource provisioning","year":2024,"lang":"en","type":"article","venue":"Computer Communications","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Provisioning; Resource (disambiguation); Zero (linguistics); Distributed computing; Multimedia; Human–computer interaction; Computer network","score_opus":0.030038241524896564,"score_gpt":0.28770724958308513,"score_spread":0.2576690080581886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391067329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023197362,0.004086529,0.9715861,0.00030794035,0.000040479863,0.0002286103,0.0000010325698,0.00019807182,0.00035387804],"genre_scores_gemma":[0.752826,0.00007035139,0.24693297,0.000050154635,0.000029298406,0.000022075295,0.0000075817393,0.000013648117,0.000047919682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985999,0.00019277209,0.00034649452,0.00048143565,0.00013115289,0.00024824793],"domain_scores_gemma":[0.9987632,0.00049269333,0.00008179227,0.00051472476,0.00006403852,0.000083549174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035188763,0.00017708741,0.00021361474,0.00029921826,0.00053654256,0.0005871741,0.00082779455,0.00006941395,0.0000012200296],"category_scores_gemma":[0.000014054701,0.00017645104,0.000055933575,0.0005696702,0.00011398185,0.00037814322,0.001686003,0.00054267613,0.0000047216627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026890996,0.00018604622,0.0012250444,0.00009201796,0.00013385409,0.000017283208,0.027446788,0.04662454,0.0003254073,0.7238234,0.000077792385,0.20004511],"study_design_scores_gemma":[0.00013165957,0.000026544729,0.00021979,0.00018277689,0.000018037095,0.000033552322,0.00036657622,0.9943054,0.000017852533,0.00015406258,0.0043591345,0.00018461599],"about_ca_topic_score_codex":0.00003529135,"about_ca_topic_score_gemma":0.00007513943,"teacher_disagreement_score":0.94768083,"about_ca_system_score_codex":0.00006123924,"about_ca_system_score_gemma":0.0000465372,"threshold_uncertainty_score":0.71954644},"labels":[],"label_agreement":null},{"id":"W4391188486","doi":"10.1016/j.comcom.2024.01.020","title":"Optimizing Secrecy Energy Efficiency in RIS-assisted MISO systems using Deep Reinforcement Learning","year":2024,"lang":"en","type":"article","venue":"Computer Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Research Foundation of Korea; Kyungpook National University","keywords":"Reinforcement learning; Secrecy; Maximization; Computer science; Base station; Efficient energy use; Suite; Energy (signal processing); Distributed computing; Mathematical optimization; Artificial intelligence; Computer network; Computer security; Engineering; Mathematics; Electrical engineering","score_opus":0.034800398673257196,"score_gpt":0.26951454209049674,"score_spread":0.23471414341723956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391188486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00242668,0.028613273,0.96426004,0.00011298884,0.0002911111,0.0001597105,8.726896e-7,0.002136737,0.0019985978],"genre_scores_gemma":[0.90507936,0.0031569358,0.091495566,0.000013433866,0.000025196217,0.00009077729,0.00004910734,0.000050593844,0.000039045295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986573,0.00013699927,0.0005242099,0.00020485348,0.00013322149,0.00034341527],"domain_scores_gemma":[0.9975087,0.00036369683,0.00005862571,0.0019576326,0.000057796624,0.000053568772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021039732,0.00020826107,0.0002364229,0.00047853077,0.0002629469,0.000187993,0.0015402987,0.00012221176,0.0000064814444],"category_scores_gemma":[0.000022622406,0.00023660451,0.00006565793,0.0009301756,0.00011810328,0.00027431856,0.0008747199,0.00063378294,0.0000155009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.8927924e-7,0.000019629382,0.000033895143,0.000060721977,0.000028966599,0.0000025058503,0.0005839288,0.9502574,0.0007586716,0.014353404,0.000020409921,0.033879876],"study_design_scores_gemma":[0.00012049064,0.00001477567,0.0000515972,0.00040984715,0.000008492691,0.000016108246,0.0003096904,0.98374915,0.00017880312,0.00012628744,0.014776628,0.00023814416],"about_ca_topic_score_codex":0.00009543833,"about_ca_topic_score_gemma":0.000043416,"teacher_disagreement_score":0.9026527,"about_ca_system_score_codex":0.00049573975,"about_ca_system_score_gemma":0.00003778486,"threshold_uncertainty_score":0.9648452},"labels":[],"label_agreement":null},{"id":"W4391288629","doi":"10.1016/j.comcom.2024.01.028","title":"Mobility aware and energy-efficient federated deep reinforcement learning assisted resource allocation for 5G-RAN slicing","year":2024,"lang":"en","type":"article","venue":"Computer Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Reinforcement learning; Ran; Slicing; Resource allocation; C-RAN; Efficient energy use; Resource (disambiguation); Computer network; Artificial intelligence; Radio access network; Base station; World Wide Web; Electrical engineering","score_opus":0.032056670630374096,"score_gpt":0.27015181646776304,"score_spread":0.23809514583738894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391288629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009654025,0.0021068782,0.99269,0.002608852,0.00020891563,0.00023820643,7.923426e-7,0.000717869,0.0004630305],"genre_scores_gemma":[0.9490457,0.000116235664,0.049836565,0.00041900453,0.00008395759,0.00016606969,0.00011492053,0.000020528576,0.00019703075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998507,0.00020353544,0.00038686077,0.0004587367,0.00017001237,0.0002738365],"domain_scores_gemma":[0.9974209,0.0010873292,0.00009034517,0.0011258048,0.00017196494,0.000103652616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004951057,0.00018115371,0.00018294352,0.00013783034,0.0009818589,0.00071851857,0.0010072063,0.000082633036,0.0000025888298],"category_scores_gemma":[0.000040066887,0.00017927354,0.00008406332,0.00055765145,0.000081767954,0.00018935604,0.0006639238,0.00025365446,0.0000050198983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008644589,0.00014135822,0.0001238016,0.00009661251,0.00009202351,0.0000017445748,0.0023443634,0.4842858,0.00008259529,0.079509616,0.0024133117,0.43090013],"study_design_scores_gemma":[0.00019965596,0.000079917765,0.0008017658,0.00013593571,0.000015665088,0.000011672915,0.00004109585,0.94549215,0.000027992515,0.0002893098,0.05271906,0.00018578385],"about_ca_topic_score_codex":0.00006919332,"about_ca_topic_score_gemma":0.000039842816,"teacher_disagreement_score":0.9480803,"about_ca_system_score_codex":0.00011012335,"about_ca_system_score_gemma":0.0000685348,"threshold_uncertainty_score":0.7551765},"labels":[],"label_agreement":null},{"id":"W4394743819","doi":"10.1016/j.comcom.2024.04.002","title":"Enabling lightweight immersive user interaction in smart buildings through learning-based mobile panorama streaming","year":2024,"lang":"en","type":"article","venue":"Computer Communications","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Douglas College; University of Toronto; Simon Fraser University","funders":"","keywords":"Panorama; Computer science; Multimedia; Wearable computer; Human–computer interaction; Virtual reality; Mobile device; Presentation (obstetrics); Embedded system; Artificial intelligence; World Wide Web","score_opus":0.038700001859429706,"score_gpt":0.34149336966427246,"score_spread":0.3027933678048428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394743819","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007421651,0.0013781678,0.9843965,0.0049352203,0.000541425,0.00028998856,0.0000017401508,0.00032103574,0.0007142409],"genre_scores_gemma":[0.83256984,0.00019706604,0.16612162,0.00070308225,0.00008110566,0.00011804643,0.000043529013,0.00001945901,0.00014625992],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981856,0.00039784817,0.00043456274,0.0004664499,0.00020952478,0.00030606668],"domain_scores_gemma":[0.99727815,0.0008698416,0.000104767845,0.0015672288,0.00012370611,0.00005632143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039423272,0.0001957594,0.00020821758,0.00029873507,0.00032986244,0.0008536835,0.0018171691,0.000077995915,0.000018708683],"category_scores_gemma":[0.000020191257,0.00020032092,0.00012313481,0.00091486337,0.00006798918,0.0015955585,0.0011047773,0.0006945047,0.00011902457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002789296,0.0023332508,0.004409233,0.0005601114,0.00041544254,0.00019694757,0.07873988,0.067957744,0.0062640146,0.30235326,0.011146592,0.52559566],"study_design_scores_gemma":[0.00022450752,0.000100933445,0.0003055787,0.00039665445,0.000012489965,0.000008915863,0.00047030658,0.6841327,0.0021864502,0.00074880465,0.3111544,0.00025825464],"about_ca_topic_score_codex":0.00025882796,"about_ca_topic_score_gemma":0.00006139346,"teacher_disagreement_score":0.82514817,"about_ca_system_score_codex":0.00023169853,"about_ca_system_score_gemma":0.0001517176,"threshold_uncertainty_score":0.823209},"labels":[],"label_agreement":null},{"id":"W4394876553","doi":"10.1016/j.comcom.2024.04.009","title":"Reinforcement learning-based dynamic load balancing in edge computing networks","year":2024,"lang":"en","type":"article","venue":"Computer Communications","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Reinforcement learning; Load balancing (electrical power); Enhanced Data Rates for GSM Evolution; Distributed computing; Artificial intelligence","score_opus":0.0169767421123599,"score_gpt":0.27428563428826,"score_spread":0.25730889217590014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394876553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014916467,0.002855863,0.9856879,0.0020055454,0.004815588,0.00024739606,8.415761e-8,0.0009785253,0.0019174666],"genre_scores_gemma":[0.9082297,0.00006351861,0.09053146,0.0004817393,0.0005120331,0.000015086422,0.000032705244,0.000028264809,0.00010550974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976629,0.0002957753,0.000620079,0.00054068404,0.000291563,0.00058898097],"domain_scores_gemma":[0.99678814,0.0008551438,0.000112852606,0.0019999233,0.00013037659,0.000113536094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010180348,0.00026983023,0.00028093316,0.00035091312,0.00051950134,0.0007171784,0.0030421582,0.000108705026,0.0000025336642],"category_scores_gemma":[0.000030945754,0.00029058606,0.00014190817,0.0013413044,0.00009478422,0.00038925355,0.0023758488,0.0009952011,0.00010442893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020924967,0.00007934096,0.000886119,0.000064368214,0.000031162497,0.000027372294,0.0020365773,0.7995374,0.000020003994,0.005053188,0.0030166714,0.1892457],"study_design_scores_gemma":[0.00025156286,0.000052026262,0.0016917295,0.00048931094,0.000006535753,0.000014536592,0.000008371795,0.9646617,0.0000062092395,0.00023688382,0.03227652,0.000304583],"about_ca_topic_score_codex":0.00006549991,"about_ca_topic_score_gemma":0.000026764146,"teacher_disagreement_score":0.90673804,"about_ca_system_score_codex":0.00048431163,"about_ca_system_score_gemma":0.0003145015,"threshold_uncertainty_score":0.99995464},"labels":[],"label_agreement":null},{"id":"W4395085451","doi":"10.1016/j.comcom.2024.04.031","title":"ER-OCN: Toward efficient network routing in ocean city based on deep reinforcement learning","year":2024,"lang":"en","type":"article","venue":"Computer Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Shenzhen Science and Technology Innovation Program; Basic and Applied Basic Research Foundation of Guangdong Province; National Key Research and Development Program of China; Science, Technology and Innovation Commission of Shenzhen Municipality; National Natural Science Foundation of China","keywords":"Computer science; Reinforcement learning; Distributed computing; Computer network; Network topology; Routing (electronic design automation); Artificial intelligence","score_opus":0.036314249750020476,"score_gpt":0.27000370192373235,"score_spread":0.23368945217371187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395085451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001096079,0.000806031,0.990768,0.003362064,0.0006486137,0.0002500563,3.567855e-7,0.000725471,0.0023433324],"genre_scores_gemma":[0.9043752,0.000053910764,0.094235666,0.001047923,0.00017838535,0.00002234119,0.000027641956,0.000018905524,0.000040043393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980693,0.0002798991,0.00044760414,0.00045583362,0.00028191402,0.00046545893],"domain_scores_gemma":[0.9966078,0.0011178008,0.00008694184,0.002018939,0.000063466956,0.00010508259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007872593,0.00021336217,0.00021618055,0.00020341754,0.00042325328,0.000471336,0.002293954,0.00008027849,0.000012124481],"category_scores_gemma":[0.000036787056,0.00021127154,0.000123227,0.0012482505,0.000066288296,0.00014405932,0.0015263519,0.0007449131,0.00006368546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024570766,0.00006106195,0.0016573439,0.000011404739,0.0000110156825,0.000007222432,0.0007677259,0.9173379,3.5060611e-7,0.04492111,0.001100197,0.03412222],"study_design_scores_gemma":[0.00021180138,0.000089928355,0.0027604434,0.00035264663,0.000006112554,0.0000035891792,0.000009579971,0.9848844,0.0000024597553,0.00046696898,0.010989734,0.00022232874],"about_ca_topic_score_codex":0.00003552367,"about_ca_topic_score_gemma":0.000014788731,"teacher_disagreement_score":0.9032791,"about_ca_system_score_codex":0.00019635087,"about_ca_system_score_gemma":0.00010439485,"threshold_uncertainty_score":0.8615404},"labels":[],"label_agreement":null},{"id":"W4396567689","doi":"10.1016/j.comcom.2024.04.037","title":"Evaluating TCP BBRv3 performance in wired broadband networks","year":2024,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"Office of Advanced Cyberinfrastructure; Oklahoma Arts Council; National Science Foundation","keywords":"Computer science; Broadband; Computer network; Telecommunications","score_opus":0.05569152008295426,"score_gpt":0.31944932197490633,"score_spread":0.2637578018919521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396567689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008227334,0.007133715,0.976523,0.0040807067,0.00086551806,0.0002605774,7.147315e-7,0.00060981506,0.0022986513],"genre_scores_gemma":[0.90683,0.0005619638,0.09171567,0.00040703558,0.00018316806,0.00007986429,0.00001038505,0.000012564353,0.00019931264],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985485,0.00024133168,0.00036782326,0.0003621967,0.00018342114,0.00029672976],"domain_scores_gemma":[0.997342,0.00053874677,0.000050368984,0.0019152001,0.000077175995,0.000076506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063944375,0.00015169101,0.00017103713,0.00016740256,0.00024059236,0.00042844898,0.002431396,0.00006871322,0.000009771123],"category_scores_gemma":[0.000009590946,0.00015174337,0.00006866828,0.00089073903,0.000081656886,0.0005300865,0.00087457546,0.0003678522,0.000073395306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017621754,0.000040283034,0.00039794092,0.000009448574,0.000016182685,0.0000033224815,0.00037313683,0.054790277,0.0000044075377,0.03644192,0.0011813019,0.90674],"study_design_scores_gemma":[0.00025229415,0.000050422805,0.0030464781,0.00018228155,0.0000069101457,0.00001635668,0.0000040198793,0.9736766,0.0000015253501,0.00037503007,0.022223411,0.0001646734],"about_ca_topic_score_codex":0.0000069822486,"about_ca_topic_score_gemma":0.00003152471,"teacher_disagreement_score":0.9188863,"about_ca_system_score_codex":0.00006617535,"about_ca_system_score_gemma":0.00011547009,"threshold_uncertainty_score":0.6187915},"labels":[],"label_agreement":null},{"id":"W4399245776","doi":"10.1016/j.comcom.2024.05.021","title":"IoT video analytics for surveillance-based systems in smart cities","year":2024,"lang":"en","type":"article","venue":"Computer Communications","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Concordia University","funders":"","keywords":"Computer science; Internet of Things; Analytics; Data science; Smart city; Computer security; Telecommunications","score_opus":0.08279356799581435,"score_gpt":0.33828400735934133,"score_spread":0.255490439363527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399245776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010824222,0.005298215,0.987087,0.0039515696,0.0012387884,0.00035330467,0.000022722345,0.00046380085,0.0005021451],"genre_scores_gemma":[0.6429974,0.00009748332,0.3562802,0.0002617033,0.00011060066,0.00013736976,0.00003297584,0.0000181513,0.000064119035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983002,0.00040554238,0.0004411086,0.00038184645,0.00016589928,0.0003054005],"domain_scores_gemma":[0.9948012,0.0024397715,0.000066139255,0.0024733618,0.00015518238,0.00006430833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001473278,0.00017049654,0.00028960168,0.00035723468,0.00018785651,0.0006665214,0.0023504,0.00007650951,0.0000014347487],"category_scores_gemma":[0.000057993475,0.00016933522,0.00013533434,0.00093033165,0.00009550942,0.0001931807,0.00045251535,0.00023732852,0.000022769242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016882443,0.0004085182,0.031680323,0.000908125,0.00025242302,0.00003166735,0.0021547622,0.05431549,0.00015533893,0.58628565,0.014698141,0.30909264],"study_design_scores_gemma":[0.00021753386,0.0000409674,0.008845316,0.00016003622,0.0000040704927,0.0000061925434,0.000009363156,0.89430404,0.000024805993,0.0027897346,0.0934082,0.00018976736],"about_ca_topic_score_codex":0.00010558708,"about_ca_topic_score_gemma":0.00021762612,"teacher_disagreement_score":0.8399885,"about_ca_system_score_codex":0.00009725486,"about_ca_system_score_gemma":0.00020394335,"threshold_uncertainty_score":0.690529},"labels":[],"label_agreement":null},{"id":"W4400337417","doi":"10.1016/j.comcom.2024.06.015","title":"The evolution of detection systems and their application for intelligent transportation systems: From solo to symphony","year":2024,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"National Natural Science Foundation of China","keywords":"Computer science; Human–computer interaction; Leverage (statistics); Perception; Sensor fusion; Adaptability; Data science; Artificial intelligence","score_opus":0.017363675660523988,"score_gpt":0.24474505857895215,"score_spread":0.22738138291842816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400337417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01115856,0.011026811,0.97546095,0.0005944572,0.00074005726,0.0007754719,0.000027355769,0.00019554775,0.000020799474],"genre_scores_gemma":[0.98952824,0.00014222448,0.009834191,0.000014709744,0.00009680997,0.00033233347,0.000024388475,0.000011535245,0.000015592614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901575,0.00011981404,0.0003688971,0.0002725796,0.00009266404,0.00013030866],"domain_scores_gemma":[0.997472,0.00085927185,0.00009682232,0.0013394826,0.00018046737,0.00005195497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004234013,0.00011071614,0.00013695005,0.0001018979,0.00042972085,0.00036658332,0.000795672,0.000055387878,4.864787e-8],"category_scores_gemma":[0.000011222522,0.00008509149,0.00005771594,0.00033584732,0.00006461956,0.00016059986,0.00011213981,0.00009380373,0.0000045978127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012222937,0.000060156533,0.000090554895,0.00020101454,0.00013415294,1.8432699e-7,0.009369671,0.022797033,0.013973557,0.30003852,0.0004138753,0.65290904],"study_design_scores_gemma":[0.000055740235,0.000050837003,0.00044429928,0.00017630892,0.00001526344,0.0000040024283,0.00056269154,0.9728058,0.0007307446,0.0015855007,0.023475446,0.00009334424],"about_ca_topic_score_codex":0.0008079347,"about_ca_topic_score_gemma":0.0002313095,"teacher_disagreement_score":0.97836965,"about_ca_system_score_codex":0.00013676337,"about_ca_system_score_gemma":0.000056422556,"threshold_uncertainty_score":0.35349715},"labels":[],"label_agreement":null},{"id":"W4401842380","doi":"10.1016/j.comcom.2024.107927","title":"DTL-5G: Deep transfer learning-based DDoS attack detection in 5G and beyond networks","year":2024,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saskatchewan Polytechnic; University of Regina","funders":"Canadian Armed Forces; Ministère de la Défense Nationale; Innovation for Defence Excellence and Security","keywords":"Computer science; Denial-of-service attack; Transfer of learning; Deep learning; Computer network; Application layer DDoS attack; Artificial intelligence; Computer security; World Wide Web; The Internet","score_opus":0.020620027159599735,"score_gpt":0.2580202905755517,"score_spread":0.23740026341595197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401842380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009769516,0.0036854723,0.9825305,0.002120474,0.00053924765,0.00023214564,6.3175594e-7,0.00046639377,0.0006556217],"genre_scores_gemma":[0.98745036,0.0006444041,0.01120669,0.00045469805,0.00012845917,0.0000547914,0.000011927088,0.000017194758,0.00003150185],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984953,0.00037790905,0.00032417753,0.00040182835,0.0001442533,0.00025654133],"domain_scores_gemma":[0.99829495,0.00043420648,0.00002931221,0.0010907375,0.0000617439,0.00008902133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040779708,0.00016991059,0.00016824777,0.0002861364,0.00041037597,0.00045831667,0.0010171108,0.00014011009,0.00001252657],"category_scores_gemma":[0.00000923113,0.00018048112,0.00008107655,0.0010013611,0.000119727025,0.00052294607,0.00028094163,0.00081346114,0.000031196563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000088525385,0.00011608658,0.000115955016,0.000035532255,0.000025126335,0.0000076066235,0.0015296224,0.14032297,0.000096227835,0.011748965,0.00027022662,0.84572285],"study_design_scores_gemma":[0.0002287155,0.00012405166,0.0012053835,0.00007617286,0.000008603803,0.000020758873,0.000010605291,0.9571198,0.00011266677,0.00074032444,0.04016577,0.0001871128],"about_ca_topic_score_codex":0.000040629584,"about_ca_topic_score_gemma":0.0006794049,"teacher_disagreement_score":0.9776808,"about_ca_system_score_codex":0.00007103959,"about_ca_system_score_gemma":0.00003815996,"threshold_uncertainty_score":0.73598063},"labels":[],"label_agreement":null},{"id":"W4402315069","doi":"10.1016/j.comcom.2024.107949","title":"Predicting and mitigating cyber threats through data mining and machine learning","year":2024,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia; Western University","funders":"","keywords":"Computer science; Data science; Machine learning; Artificial intelligence; Data mining; Computer security","score_opus":0.08790265176258188,"score_gpt":0.308995535402368,"score_spread":0.22109288363978613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402315069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03687888,0.036372475,0.9176425,0.0053595537,0.00048848183,0.00018220049,0.000009779771,0.0008726614,0.0021934984],"genre_scores_gemma":[0.59533376,0.0027256566,0.40144747,0.0002290643,0.00014714617,0.000007538989,0.000042336815,0.000011842989,0.000055174933],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989314,0.00016967667,0.00021644251,0.00041281243,0.00010917483,0.00016047747],"domain_scores_gemma":[0.99770796,0.0006191482,0.000052353702,0.0015327883,0.000033138553,0.00005461841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039931195,0.00011502452,0.000116937976,0.00006437579,0.0007414322,0.00066728663,0.0012691406,0.000050800783,0.0000033763265],"category_scores_gemma":[0.000030065225,0.00011354181,0.0000182258,0.00031939242,0.0001226176,0.0012447439,0.0051239342,0.00036097298,0.000004660993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.1799285e-7,0.000022056609,0.0037330932,0.000047771962,0.000047998325,0.0000050786343,0.007016294,0.000088414854,0.00007026322,0.028255885,0.0006028923,0.96010935],"study_design_scores_gemma":[0.00007823884,0.000034195124,0.00068817,0.00021748242,0.00001167336,0.00009861979,0.000035940953,0.9694021,0.000017480259,0.0022900554,0.02701009,0.00011600026],"about_ca_topic_score_codex":0.00007821287,"about_ca_topic_score_gemma":0.00009207063,"teacher_disagreement_score":0.9693136,"about_ca_system_score_codex":0.000014679259,"about_ca_system_score_gemma":0.000023734006,"threshold_uncertainty_score":0.643466},"labels":[],"label_agreement":null},{"id":"W4403016868","doi":"10.1016/j.comcom.2024.107966","title":"RIPPLE-WiN: An efficient protocol for loop-free multipath routing in wireless networks","year":2024,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Ripple; Multipath propagation; Wireless; Multipath routing; Routing (electronic design automation); Protocol (science); Routing protocol; Dynamic Source Routing; Telecommunications; Electrical engineering; Channel (broadcasting)","score_opus":0.04827933413342932,"score_gpt":0.33312237452679905,"score_spread":0.2848430403933697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403016868","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030788427,0.00008451603,0.948328,0.0010839504,0.00038591333,0.048895195,0.000005737518,0.00064666144,0.00026210202],"genre_scores_gemma":[0.2961881,0.000007257409,0.46668878,0.0003618938,0.00042325666,0.23617575,0.000045058074,0.000058589194,0.000051326908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975918,0.00033721235,0.00061571965,0.0006879645,0.00021384977,0.0005534515],"domain_scores_gemma":[0.9930701,0.0009117836,0.000115674935,0.005615982,0.00013496014,0.0001514638],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009269499,0.00026535362,0.00027585265,0.00019326288,0.0003691823,0.0007246015,0.0068009836,0.00013701656,0.000004276727],"category_scores_gemma":[0.000021748272,0.00026607604,0.00012919304,0.0009770007,0.00011700029,0.00045971488,0.003398735,0.0005679869,0.000015903332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012596624,0.000719508,0.00034766344,0.00009875453,0.000034296605,0.000012602049,0.001997384,0.2344799,0.000017122018,0.35739556,0.0043157446,0.40056887],"study_design_scores_gemma":[0.0008075735,0.000090277266,0.00059856166,0.00035252786,0.0000052799983,0.000012611199,0.000012351141,0.9856492,0.00001019416,0.0011368536,0.011030351,0.00029421493],"about_ca_topic_score_codex":0.00004483766,"about_ca_topic_score_gemma":0.0001855511,"teacher_disagreement_score":0.7511693,"about_ca_system_score_codex":0.00015653523,"about_ca_system_score_gemma":0.0001395166,"threshold_uncertainty_score":0.99997914},"labels":[],"label_agreement":null},{"id":"W4404565615","doi":"10.1016/j.comcom.2024.108008","title":"A survey on authentication protocols of dynamic wireless EV charging","year":2024,"lang":"en","type":"article","venue":"Computer Communications","topic":"RFID technology advancements","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Wireless; Authentication (law); Computer network; Computer security; Telecommunications","score_opus":0.03850746091323601,"score_gpt":0.32710614945939315,"score_spread":0.2885986885461571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404565615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.122956075,0.0015069378,0.8599738,0.0010099089,0.000593976,0.009158592,0.0001401892,0.0032590257,0.0014014845],"genre_scores_gemma":[0.987428,0.00007282804,0.010575963,0.0000111183845,0.0000074324003,0.0017441467,0.000099181256,0.0000263569,0.000034966244],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941325,0.000058638972,0.00022263176,0.00011790554,0.00007588873,0.00011169202],"domain_scores_gemma":[0.99830174,0.00018853667,0.000026799195,0.0014208698,0.000043046042,0.000018981476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017430978,0.000091838556,0.000114301765,0.00017124829,0.000056301113,0.000025833075,0.0007596574,0.0000533265,0.0000070186647],"category_scores_gemma":[0.000009293533,0.00009994087,0.00003019094,0.00033827664,0.00007667874,0.00008592748,0.00012606321,0.00021524276,0.00007538382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001401723,0.000670841,0.0046107275,0.0009823618,0.0006011965,0.0000044252047,0.002525717,0.010191172,0.041966442,0.09489379,0.004070171,0.83946913],"study_design_scores_gemma":[0.00009985835,0.000026583619,0.024014872,0.0003758141,0.0000066070793,0.000001146131,0.0000036908734,0.97091556,0.0013911428,0.0006950579,0.0023631335,0.000106553416],"about_ca_topic_score_codex":0.0000049698338,"about_ca_topic_score_gemma":0.000023379125,"teacher_disagreement_score":0.96072435,"about_ca_system_score_codex":0.00007517657,"about_ca_system_score_gemma":0.000014817485,"threshold_uncertainty_score":0.40754703},"labels":[],"label_agreement":null},{"id":"W4405170942","doi":"10.1016/j.comcom.2024.108024","title":"Enhancing fog load balancing through lifelong transfer learning of reinforcement learning agents","year":2024,"lang":"en","type":"article","venue":"Computer Communications","topic":"Smart Parking Systems Research","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science; Reinforcement learning; Transfer of learning; Lifelong learning; Transfer (computing); Artificial intelligence; Human–computer interaction; Operating system","score_opus":0.03827774775568,"score_gpt":0.2996407721707222,"score_spread":0.2613630244150422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405170942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049640328,0.005133081,0.93221885,0.00017412059,0.0006266395,0.0003226659,0.0000013913454,0.000970706,0.010912241],"genre_scores_gemma":[0.9909508,0.0006831974,0.007660233,0.000016887368,0.00015941478,0.000053817643,0.00003056164,0.000061105784,0.000383989],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839383,0.00019263163,0.0005251982,0.00019654029,0.00036361214,0.0003281957],"domain_scores_gemma":[0.99843854,0.0004769747,0.000023925257,0.00088451005,0.00011390069,0.00006212453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000577718,0.0001759784,0.0002519043,0.00015456897,0.0002468636,0.00013205406,0.0007473819,0.00008094673,0.000047348894],"category_scores_gemma":[0.000040081923,0.00019363196,0.0001194196,0.0004754181,0.000065213426,0.0002583567,0.00031106023,0.0008022315,0.00012182736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003372429,0.000027553555,0.0016385274,0.001021836,0.00036560465,0.000008870921,0.01909649,0.9446818,0.013062455,0.0028894544,0.0017253058,0.015478681],"study_design_scores_gemma":[0.00015073013,0.00004063227,0.0005528125,0.00097227347,0.00001968526,0.000010572104,0.000157329,0.89211464,0.0031163835,0.000022676091,0.1026554,0.00018683921],"about_ca_topic_score_codex":0.00009686473,"about_ca_topic_score_gemma":0.000031743522,"teacher_disagreement_score":0.94131047,"about_ca_system_score_codex":0.00025024175,"about_ca_system_score_gemma":0.000079457284,"threshold_uncertainty_score":0.7896082},"labels":[],"label_agreement":null},{"id":"W4406091448","doi":"10.1016/j.comcom.2024.108041","title":"UAVs deployment optimization in cell-free aerial communication networks","year":2025,"lang":"en","type":"article","venue":"Computer Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Université du Québec à Montréal","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science; Software deployment; Computer network; Distributed computing; Telecommunications; Software engineering","score_opus":0.00888538302555557,"score_gpt":0.21798428968501027,"score_spread":0.2090989066594547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406091448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00079584995,0.0019635817,0.98071814,0.0009725947,0.0002032822,0.00046679037,0.0000066754233,0.00040705912,0.014466046],"genre_scores_gemma":[0.5999225,0.0042817197,0.39466253,0.0002089464,0.00004589869,0.0003571995,0.00040306026,0.000034065313,0.00008412562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990496,0.00010772945,0.0004223704,0.00015896512,0.00007489517,0.00018645742],"domain_scores_gemma":[0.99676555,0.00015157158,0.000052973424,0.0029039788,0.00008637147,0.000039576178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017315289,0.00015071052,0.00016022149,0.00023351489,0.00021977376,0.000098651864,0.0015362321,0.00011489397,0.000018902738],"category_scores_gemma":[0.0000083141595,0.00018373526,0.000044147895,0.00079354265,0.0000694055,0.00018091532,0.00060032133,0.0002601343,0.0000098219325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024413214,0.00010243942,0.00030721058,0.000012051688,0.000012270687,7.321916e-8,0.000110850335,0.98022974,0.0000129965765,0.007957423,0.0057760803,0.005476422],"study_design_scores_gemma":[0.0005886952,0.0000067025344,0.0013990827,0.000051649196,0.000015525526,4.999652e-7,0.000020447054,0.9879836,0.000032599877,0.0005271696,0.009223956,0.00015009279],"about_ca_topic_score_codex":0.000041669096,"about_ca_topic_score_gemma":0.00016187258,"teacher_disagreement_score":0.59912664,"about_ca_system_score_codex":0.00016679132,"about_ca_system_score_gemma":0.00002863691,"threshold_uncertainty_score":0.74925065},"labels":[],"label_agreement":null},{"id":"W4409123220","doi":"10.1016/j.comcom.2025.108152","title":"A hybrid swarm intelligence approach for optimizing Multimodal Large Language Models deployment in edge-cloud-based Federated Learning environments","year":2025,"lang":"en","type":"article","venue":"Computer Communications","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Khalifa University of Science, Technology and Research","keywords":"Computer science; Software deployment; Cloud computing; Enhanced Data Rates for GSM Evolution; Artificial intelligence; Distributed computing; Human–computer interaction; Machine learning; Software engineering; Operating system","score_opus":0.04005470865340984,"score_gpt":0.29565298411547924,"score_spread":0.2555982754620694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409123220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000554622,0.00061804836,0.9955369,0.00085430173,0.00013311514,0.00088933896,0.000005682257,0.00032061434,0.0010873284],"genre_scores_gemma":[0.50396097,0.000036832465,0.495176,0.0003216206,0.000013230217,0.00036434378,0.00005294208,0.0000108662025,0.00006319952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825156,0.00031768743,0.00048018654,0.00046120406,0.00013177602,0.00035757854],"domain_scores_gemma":[0.99789816,0.0002991936,0.00013537804,0.0015601539,0.000045148056,0.00006195936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060236006,0.00020960544,0.0002756034,0.0002628703,0.0004530551,0.00027135466,0.0022683332,0.000069818016,9.0708045e-7],"category_scores_gemma":[0.000014061051,0.00022138946,0.000105287836,0.00031038362,0.000043760978,0.00030131693,0.0013672747,0.00035327362,0.000003065547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000306223,0.0035917847,0.0008913381,0.00023689993,0.0002023848,0.000009469976,0.0066143856,0.5507227,0.00052280596,0.1453158,0.002665352,0.28919643],"study_design_scores_gemma":[0.00044152536,0.000043078617,0.000045954013,0.000097762255,0.0000058548735,0.0000020943958,0.00009715054,0.9922903,0.0021790206,0.0010551749,0.0035410065,0.00020104984],"about_ca_topic_score_codex":0.00010538814,"about_ca_topic_score_gemma":0.00001893963,"teacher_disagreement_score":0.50340635,"about_ca_system_score_codex":0.00017825945,"about_ca_system_score_gemma":0.00007494474,"threshold_uncertainty_score":0.9028},"labels":[],"label_agreement":null},{"id":"W4409800697","doi":"10.1016/j.comcom.2025.108179","title":"Community-Oriented Edge Computing Platform","year":2025,"lang":"en","type":"article","venue":"Computer Communications","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Edge computing; Distributed computing; Computer architecture; World Wide Web; Telecommunications","score_opus":0.04820319692849477,"score_gpt":0.3088892081858832,"score_spread":0.26068601125738844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409800697","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076192957,0.00051139435,0.9487883,0.0040342156,0.0066790045,0.00028126466,5.9316085e-7,0.0010238977,0.031062074],"genre_scores_gemma":[0.44557837,0.000045998604,0.5495895,0.0033627225,0.00070575136,0.000021662318,0.000069166716,0.000026289908,0.0006005091],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977258,0.00052120513,0.000633288,0.00036727244,0.00021198358,0.00054044975],"domain_scores_gemma":[0.9926917,0.0010712239,0.0001865091,0.0056081098,0.00031621297,0.00012623137],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0009583061,0.00029020387,0.0003486879,0.0004359363,0.0026397211,0.00042707077,0.007621083,0.00012477238,0.0000014633478],"category_scores_gemma":[0.000064584216,0.00031319197,0.00016632634,0.001679162,0.0002336914,0.0005506885,0.009280473,0.0011640664,0.00011557313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052420187,0.00071023864,0.00233785,0.00007629279,0.00015631357,0.000004361067,0.0064282264,0.00022031201,0.00011274092,0.4125944,0.089591265,0.48776275],"study_design_scores_gemma":[0.00062629906,0.000059700546,0.008149189,0.00024100274,0.000018200322,0.000019620922,0.000077526005,0.6694727,0.00014949331,0.008834634,0.31195027,0.00040137398],"about_ca_topic_score_codex":0.00010709228,"about_ca_topic_score_gemma":0.00001359317,"teacher_disagreement_score":0.6692524,"about_ca_system_score_codex":0.00015174916,"about_ca_system_score_gemma":0.00018384587,"threshold_uncertainty_score":0.999932},"labels":[],"label_agreement":null},{"id":"W4409839611","doi":"10.1016/j.comcom.2025.108173","title":"A novel energy-efficient cross-layer design for scheduling and routing in 6TiSCH networks","year":2025,"lang":"en","type":"article","venue":"Computer Communications","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Ministère de l'Enseignement Supérieur et de la Recherche Scientifique","keywords":"Computer science; Scheduling (production processes); Computer network; Routing (electronic design automation); Distributed computing; Mathematical optimization","score_opus":0.06266617415485004,"score_gpt":0.3171091297572265,"score_spread":0.25444295560237645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409839611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009553361,0.0008650206,0.9957238,0.0009868715,0.0006310736,0.0002911687,8.855995e-7,0.00010333621,0.00044250433],"genre_scores_gemma":[0.6494267,0.000025725163,0.34990767,0.0004064512,0.000055431075,0.0001005625,0.000002832663,0.000005658244,0.00006899392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987603,0.00015061567,0.0004222104,0.0003303424,0.00006893531,0.00026760466],"domain_scores_gemma":[0.99754506,0.0008905197,0.00010135852,0.0012558879,0.00016196312,0.00004523551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077254226,0.0001312383,0.00019241171,0.00017839964,0.0004934112,0.00047834634,0.001402035,0.000089721194,4.7773216e-7],"category_scores_gemma":[0.000028286811,0.00013481434,0.00006057905,0.000528342,0.00006593635,0.00016314271,0.0011053303,0.00018833489,8.136505e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003529441,0.0000785111,0.00034697124,0.0000063794273,0.000017057204,2.2829559e-7,0.0002873781,0.5209474,0.000042300682,0.4632412,0.00020409013,0.01482493],"study_design_scores_gemma":[0.00048668456,0.000022353934,0.0009318202,0.00016076707,0.0000037008513,0.0000079791935,0.000016567856,0.99528235,0.000020960713,0.0008599834,0.0020779567,0.000128873],"about_ca_topic_score_codex":0.00007145611,"about_ca_topic_score_gemma":0.000060132723,"teacher_disagreement_score":0.64847136,"about_ca_system_score_codex":0.000064400796,"about_ca_system_score_gemma":0.000060192233,"threshold_uncertainty_score":0.54975694},"labels":[],"label_agreement":null},{"id":"W4411540665","doi":"10.1016/j.comcom.2025.108248","title":"A Self-adaptive Hybrid Network Anomaly Detection Engine","year":2025,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Toronto Metropolitan University","funders":"","keywords":"Computer science; Anomaly detection; Anomaly (physics); Real-time computing; Computer network; Artificial intelligence; Data mining","score_opus":0.013019158686071682,"score_gpt":0.23240795493453933,"score_spread":0.21938879624846766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411540665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009472793,0.00095415534,0.9891133,0.001722493,0.0010944825,0.00026543692,0.0000010187266,0.00083703105,0.005064817],"genre_scores_gemma":[0.60485005,0.00027928167,0.39376095,0.0007720918,0.00018868473,0.000055564164,0.0000047906797,0.000006830374,0.00008173253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986893,0.00026921873,0.00030905314,0.00033096815,0.00012625041,0.00027520827],"domain_scores_gemma":[0.9969557,0.00027665848,0.00010399604,0.00242448,0.00017277681,0.00006641584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003079733,0.00015837274,0.00017444677,0.00018408673,0.0007723476,0.00020878938,0.0023011437,0.000067601504,0.0000050723525],"category_scores_gemma":[0.0000098140545,0.00017360455,0.000101754275,0.0011585598,0.000062030944,0.0004611127,0.0017620802,0.00037339365,0.00006433645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011470206,0.00032260857,0.00011045376,0.000019318435,0.0001573119,0.0000026830592,0.0004329142,0.0045040855,0.00005039016,0.28287145,0.009360222,0.7021571],"study_design_scores_gemma":[0.00019612708,0.000075916105,0.0010581156,0.000037095,0.0000134461725,0.000015634856,0.0000028278853,0.83931214,0.00033521728,0.011035298,0.14777361,0.00014456648],"about_ca_topic_score_codex":0.000027795999,"about_ca_topic_score_gemma":0.00008165123,"teacher_disagreement_score":0.83480805,"about_ca_system_score_codex":0.000109174696,"about_ca_system_score_gemma":0.00007198328,"threshold_uncertainty_score":0.70793885},"labels":[],"label_agreement":null},{"id":"W4412422855","doi":"10.1016/j.comcom.2025.108219","title":"Digital twin-assisted multi-layer networks for low-latency and energy-efficient communication","year":2025,"lang":"en","type":"article","venue":"Computer Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Latency (audio); Computer network; Layer (electronics); Low latency (capital markets); Application layer; Efficient energy use; Telecommunications; Operating system; Electrical engineering","score_opus":0.031221563998773204,"score_gpt":0.2733942946569427,"score_spread":0.2421727306581695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412422855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005264525,0.004948931,0.98934346,0.0030051544,0.000328552,0.00026577833,0.000009203287,0.00039028603,0.0011821833],"genre_scores_gemma":[0.6422889,0.0005399719,0.35517138,0.001124588,0.00004218166,0.00018833614,0.000117634605,0.000017515726,0.00050943816],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985471,0.00014010828,0.00045781513,0.00041680335,0.000110715955,0.00032750785],"domain_scores_gemma":[0.9947076,0.0011181416,0.00015442962,0.0036465016,0.00026928715,0.0001040376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024810707,0.00022371224,0.00026064427,0.00017677445,0.0008189421,0.00062895386,0.0030946094,0.00012992954,0.0000012024985],"category_scores_gemma":[0.000036489386,0.0002246786,0.00011995508,0.00069756294,0.00019387777,0.00032177646,0.0028659666,0.0002359102,0.0000042317843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000088210045,0.0006286376,0.0009369199,0.000021280784,0.00009482201,5.994337e-7,0.00029215458,0.013924503,0.000010340601,0.27134928,0.006955613,0.705777],"study_design_scores_gemma":[0.00068642787,0.000030883424,0.007902683,0.0001257953,0.000017713981,0.0000056411786,0.000009904601,0.95607185,0.0000051198203,0.0014869564,0.03343625,0.00022076191],"about_ca_topic_score_codex":0.000020521064,"about_ca_topic_score_gemma":0.00003011898,"teacher_disagreement_score":0.9421474,"about_ca_system_score_codex":0.000060549566,"about_ca_system_score_gemma":0.000071859795,"threshold_uncertainty_score":0.91621274},"labels":[],"label_agreement":null},{"id":"W4412724700","doi":"10.1016/j.comcom.2025.108280","title":"Overcoming data limitations in internet traffic forecasting: LSTM models with transfer learning and wavelet augmentation","year":2025,"lang":"en","type":"article","venue":"Computer Communications","topic":"Traffic Prediction and Management Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Northern British Columbia","funders":"","keywords":"Computer science; Transfer of learning; Wavelet; Artificial intelligence; The Internet; Transfer (computing); Internet traffic; Machine learning; Data mining; World Wide Web","score_opus":0.11100078773136625,"score_gpt":0.26791211608208815,"score_spread":0.1569113283507219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412724700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023335295,0.0002811121,0.96741784,0.00040327298,0.000048421272,0.0002510714,0.000005056505,0.0011968063,0.007061132],"genre_scores_gemma":[0.9105819,0.0006517518,0.08839924,0.000056287765,0.000006073744,0.000046290697,0.000184735,0.00001200782,0.00006175229],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994594,0.00004805705,0.0001909254,0.00014747752,0.000051470837,0.000102683916],"domain_scores_gemma":[0.9992525,0.00014162337,0.000011930114,0.0005519951,0.00001958421,0.000022360822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012518196,0.0000940582,0.00009796936,0.00021947267,0.00008068205,0.00006981687,0.00045411324,0.000033986635,0.0000010902362],"category_scores_gemma":[0.000004760382,0.000101691374,0.000011454356,0.00023841832,0.000046744066,0.0003504218,0.00023587559,0.00022093063,7.0520406e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011006184,0.00010927177,0.00031900997,0.00009350546,0.00012272403,0.0000016081977,0.0031095678,0.29058912,0.000040575535,0.030995406,0.006041755,0.66856647],"study_design_scores_gemma":[0.00035426236,0.00001795013,0.0007482047,0.00013558737,0.000019233456,0.0000020392533,0.00014378676,0.98755807,0.000008876217,0.000112191396,0.0108103985,0.0000894214],"about_ca_topic_score_codex":0.000009763075,"about_ca_topic_score_gemma":0.00039738388,"teacher_disagreement_score":0.88724655,"about_ca_system_score_codex":0.000039973565,"about_ca_system_score_gemma":0.000010455859,"threshold_uncertainty_score":0.4146854},"labels":[],"label_agreement":null},{"id":"W4417436617","doi":"10.1016/j.comcom.2025.108340","title":"Power prediction and energy aware placement of containers over virtual machines","year":2025,"lang":"en","type":"article","venue":"Computer Communications","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Mitacs","keywords":"Cloud computing; Testbed; Energy consumption; Virtual machine; Live migration; Efficient energy use; Scalability; Energy (signal processing)","score_opus":0.008934456302681188,"score_gpt":0.2439694468743871,"score_spread":0.2350349905717059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417436617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021534668,0.0005937166,0.96859497,0.0030561122,0.0003671315,0.0000921263,0.000004874282,0.00017193153,0.0055844425],"genre_scores_gemma":[0.9830742,0.000053037646,0.015424679,0.0006531585,0.00002119878,0.000015139009,0.000008491726,0.0000049624678,0.00074517186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990915,0.00012713963,0.00028367827,0.00023393787,0.00013249644,0.00013122082],"domain_scores_gemma":[0.9980471,0.00020300783,0.00009575071,0.0015335926,0.000078912795,0.000041650117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017674884,0.00011596992,0.00015334165,0.00018652911,0.00022173609,0.00007598989,0.0013215868,0.000039414965,0.0000032568712],"category_scores_gemma":[0.000005792595,0.00010942994,0.000052407326,0.00033195099,0.00011362019,0.00003362447,0.0026947472,0.0001002917,0.0000010074638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010248022,0.00034277883,0.005195747,0.000030932144,0.00021660038,0.0000013758975,0.0013407032,0.009983158,0.000106516556,0.7643341,0.0124840215,0.20595384],"study_design_scores_gemma":[0.00043359675,0.000095170486,0.00950292,0.000082056635,0.000012100166,0.0000021613841,0.00004895242,0.9433013,0.000023869845,0.00082257343,0.04557773,0.000097554745],"about_ca_topic_score_codex":0.000082553575,"about_ca_topic_score_gemma":0.000015474545,"teacher_disagreement_score":0.9615395,"about_ca_system_score_codex":0.000036155638,"about_ca_system_score_gemma":0.000032835553,"threshold_uncertainty_score":0.44624233},"labels":[],"label_agreement":null},{"id":"W6903036975","doi":"10.1016/j.comcom.2025.108275","title":"Dynamic Split Federated Learning for resource-constrained IoT systems","year":2025,"lang":"en","type":"article","venue":"Computer Communications","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Architecture; Metadata; Server; Process (computing); Federated learning; Internet of Things; Aggregate (composite); Resource (disambiguation); Task (project management)","score_opus":0.03732138526178992,"score_gpt":0.3051612359449662,"score_spread":0.2678398506831763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6903036975","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00086425984,0.0010556474,0.94776785,0.045045264,0.0003343115,0.0005860007,0.000013664468,0.0018551259,0.00247785],"genre_scores_gemma":[0.24777341,0.000039532675,0.75120556,0.00030529278,0.000014070108,0.00019043403,0.00010101543,0.000013649962,0.00035703636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998313,0.0002689702,0.0004380853,0.00048645868,0.0001331865,0.0003602672],"domain_scores_gemma":[0.984338,0.0012270532,0.00016181491,0.014020181,0.00020244703,0.000050529346],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00057199434,0.00019194267,0.00026167536,0.0003040613,0.0009811029,0.00063856144,0.0385177,0.00014943659,0.0000013610737],"category_scores_gemma":[0.002610883,0.00020735002,0.00008547183,0.0008822654,0.00023040225,0.00015165059,0.07524438,0.0004911736,0.00002059057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012367671,0.0002906459,0.0004487805,0.00018751317,0.00029166343,0.0000039818715,0.00024536424,0.004805802,0.00047052896,0.35087642,0.2725802,0.36978674],"study_design_scores_gemma":[0.00030464717,0.00003410374,0.0002627142,0.00012869382,0.000009695958,0.000007595028,0.000038338738,0.8743546,0.000024638672,0.02069576,0.10397193,0.00016730934],"about_ca_topic_score_codex":0.000025425865,"about_ca_topic_score_gemma":0.000014485431,"teacher_disagreement_score":0.8695488,"about_ca_system_score_codex":0.0001525286,"about_ca_system_score_gemma":0.00014054743,"threshold_uncertainty_score":0.9666844},"labels":[],"label_agreement":null},{"id":"W93607114","doi":"10.1016/s0140-3664(99)00230-3","title":"Mobile Software Agents for Telecommunication Applications","year":2000,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Telecommunications; Software; Computer network; Operating system","score_opus":0.03112621849169535,"score_gpt":0.2868613329005219,"score_spread":0.25573511440882657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W93607114","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014812796,0.0010904715,0.99155384,0.0013110829,0.000098648394,0.0024732286,0.000016685164,0.0007283375,0.0025795712],"genre_scores_gemma":[0.054773364,0.001470926,0.931478,0.0017801995,0.00013057416,0.0085318545,0.00032827092,0.000034386685,0.0014724039],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99824405,0.0002046132,0.0004822153,0.0004911234,0.0002015044,0.00037647414],"domain_scores_gemma":[0.9912391,0.00042437288,0.00015057213,0.0078770695,0.00017305258,0.00013588266],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00035623825,0.00021849,0.00020923973,0.0001388896,0.00086360634,0.0002709633,0.0074842796,0.00007400567,0.00007299579],"category_scores_gemma":[0.0000069315115,0.000246248,0.00015993504,0.0006960133,0.00011734542,0.000449959,0.0014540172,0.0002005683,0.0004514919],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000259918,0.00029910286,0.00006461031,0.000018801527,0.000044116547,2.3905093e-7,0.0002429959,0.008125519,0.0000043673776,0.05171501,0.0203251,0.91915756],"study_design_scores_gemma":[0.00030909074,0.00007919808,0.00021344608,0.000016368287,0.000015615604,0.0000030800657,0.000006223959,0.2597141,0.000013884872,0.004408103,0.73501056,0.00021034355],"about_ca_topic_score_codex":0.000013329045,"about_ca_topic_score_gemma":0.000012989695,"teacher_disagreement_score":0.9189472,"about_ca_system_score_codex":0.00015291556,"about_ca_system_score_gemma":0.00007342588,"threshold_uncertainty_score":0.999999},"labels":[],"label_agreement":null}]}