{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":189,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":189,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"d3b7d40aee05","filters":{"venue":"Computer Communications"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01176020195934045,"gpt":0.2130870158711024,"spread":0.2013268139117619,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005409953,0.000122667,0.0001445164,0.00004841406,0.0001264623,0.00005512782,0.001041826,0.00006549446,0.00002616001],"category_scores_gemma":[0.000009816738,0.0001384212,0.00005243266,0.0001732094,0.0000642402,0.00008887935,0.0003434759,0.000288631,0.0002553517],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003551544,"about_ca_system_score_gemma":0.000007129959,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001530191,"about_ca_topic_score_gemma":0.0001552264,"domain_scores_codex":[0.9990173,0.0003745713,0.0001856759,0.0001139355,0.00008728878,0.0002212552],"domain_scores_gemma":[0.9975071,0.0002520203,0.00002193546,0.002084118,0.00004391102,0.00009093086],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[4.52855e-7,0.00008024441,0.001266195,0.00003221886,0.00008291817,0.000001034091,0.0004827084,0.8615304,0.00005540416,0.01273872,0.04523843,0.07849127],"study_design_scores_gemma":[0.0001039297,0.000009043968,0.004547992,0.00001210154,0.000006368486,0.000005955593,0.000001763402,0.8255679,0.00001277323,0.001074207,0.1685273,0.000130695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02018175,0.001078052,0.9512376,0.000513014,0.0005734438,0.0002084187,0.000011531,0.001279057,0.0249172],"genre_scores_gemma":[0.9720543,0.0001480289,0.02729608,0.0001278344,0.0001728886,0.00001761237,0.0001260821,0.00003068786,0.00002650586],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9518725,"threshold_uncertainty_score":0.5644653,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1510933325708704,"gpt":0.2499882681250984,"spread":0.09889493555422793,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003909181,0.00005552337,0.00009108613,0.00002475411,0.00004021279,0.00001700548,0.0002683299,0.00002928552,0.000003572649],"category_scores_gemma":[0.000005104336,0.00006240909,0.00002085941,0.00004277738,0.00004753958,0.00007244562,0.0001321053,0.00004137062,0.000001324209],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005961799,"about_ca_system_score_gemma":0.000006416944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002688331,"about_ca_topic_score_gemma":0.000003413572,"domain_scores_codex":[0.9996958,0.00001443891,0.0001427747,0.00006429281,0.00002738547,0.0000553452],"domain_scores_gemma":[0.9994926,0.0000833733,0.00002738407,0.0003072064,0.00004982836,0.00003953344],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002923322,0.0001397192,0.00008350762,0.0007134306,0.0002121517,2.460572e-7,0.01726454,0.02145853,0.001202239,0.5091574,0.01148418,0.4382548],"study_design_scores_gemma":[0.000205771,0.00003944343,0.0001971707,0.00001447975,0.00001133126,5.542788e-7,0.0001201076,0.8687373,0.0001900863,0.0002528729,0.1301611,0.00006984257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007139053,0.005356596,0.9723935,0.0128855,0.00008422507,0.0003616613,0.0000286296,0.0002591618,0.001491645],"genre_scores_gemma":[0.8274618,0.007133322,0.1650612,0.0001242249,0.00006445216,0.00006288394,0.0000660146,0.00001670961,0.000009398437],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8472787,"threshold_uncertainty_score":0.2544969,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01501645903899079,"gpt":0.2324938176182894,"spread":0.2174773585792986,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004051794,0.000248124,0.0002829915,0.00007675695,0.0002155969,0.0001404509,0.001597784,0.0001898162,0.00004146821],"category_scores_gemma":[0.00001472531,0.0002703046,0.0001125718,0.0003430215,0.0001348152,0.0001150534,0.0005441382,0.0008577004,0.00008182821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004185762,"about_ca_system_score_gemma":0.00002131536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003524783,"about_ca_topic_score_gemma":0.001324982,"domain_scores_codex":[0.9986571,0.0001822963,0.0003917319,0.0001956452,0.0001644123,0.0004088184],"domain_scores_gemma":[0.9960998,0.0004060513,0.00006034197,0.003158796,0.0001072181,0.0001678173],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001174908,0.00006414849,0.002329767,0.0000165289,0.0001050509,0.000005386821,0.00009254844,0.9843444,0.0001705286,0.0005359494,0.004322735,0.008011825],"study_design_scores_gemma":[0.0001869582,0.00001164777,0.01209673,0.00002769797,0.00002008889,0.00004450541,0.000001399765,0.9734818,0.00003344886,0.00008388555,0.01372334,0.0002884679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6473266,0.00123453,0.3481812,0.0001081294,0.00120852,0.0004359759,0.00002451605,0.0009407274,0.0005398228],"genre_scores_gemma":[0.9711932,0.0002979888,0.02771959,0.0001531342,0.0002516326,0.00004835862,0.0002380219,0.00008196874,0.00001612189],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3238666,"threshold_uncertainty_score":0.9999749,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03996381031355054,"gpt":0.253364150651817,"spread":0.2134003403382665,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002892068,0.0002250704,0.0002783664,0.0001681936,0.0003742735,0.0002342252,0.004968252,0.00009453711,0.000006043883],"category_scores_gemma":[0.00001582226,0.0002651095,0.00008535976,0.001355559,0.0001453985,0.0004065462,0.00276847,0.0005356698,0.0000125618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001172717,"about_ca_system_score_gemma":0.00006374162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001851485,"about_ca_topic_score_gemma":0.00003532772,"domain_scores_codex":[0.9978158,0.000598393,0.0005558755,0.0004466552,0.0002234854,0.0003597309],"domain_scores_gemma":[0.9958611,0.0003197656,0.0002333162,0.003245042,0.0001704286,0.0001703895],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000151716,0.00009385436,0.0001250721,0.000003456412,0.00001188353,0.000003426787,0.0005265331,0.9527928,0.00000609727,0.004148541,0.0002364753,0.0420503],"study_design_scores_gemma":[0.000369316,0.00003143467,0.0001561176,0.00006219117,0.000007393116,0.00001550184,0.00001392296,0.9971877,0.00001178848,0.0001060456,0.001774548,0.0002640433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00064531,0.001139538,0.9896166,0.007563104,0.0001128037,0.0002725254,0.000002523085,0.0003778291,0.0002697315],"genre_scores_gemma":[0.208712,0.0002771069,0.7888422,0.001942982,0.00009947624,0.00001967684,0.00007580958,0.00002483408,0.000005952819],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2080667,"threshold_uncertainty_score":0.9999801,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0300447031888077,"gpt":0.324101192867546,"spread":0.2940564896787383,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005241144,0.00009592289,0.0001368811,0.0001362628,0.0008414292,0.0001737107,0.001670916,0.00008220031,0.00003109606],"category_scores_gemma":[0.00001277847,0.0001011348,0.00005323996,0.0004199037,0.000343713,0.0001536786,0.000671834,0.000408192,0.00002707744],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003531616,"about_ca_system_score_gemma":0.00004077619,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001109556,"about_ca_topic_score_gemma":0.003300467,"domain_scores_codex":[0.9989322,0.0002198443,0.0002307554,0.0001956823,0.0001486664,0.0002728779],"domain_scores_gemma":[0.9984295,0.0001542988,0.00006937548,0.00119765,0.00005299763,0.00009621025],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002696306,0.0004484883,0.005315866,0.00001001849,0.00003409771,0.00002725669,0.00949617,0.000103666,0.000003520689,0.7447187,0.0007847335,0.2390548],"study_design_scores_gemma":[0.001811045,0.00003089141,0.03586138,0.00004483051,0.00005157791,0.00007815377,0.005966325,0.4881216,0.000002705494,0.01331141,0.4540134,0.0007066177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.02891583,0.0001541505,0.2552443,0.00800118,0.000598001,0.001002896,0.000002985943,0.0003693306,0.7057113],"genre_scores_gemma":[0.8646148,0.00003721436,0.1346343,0.0002870782,0.0001847489,0.00003242496,0.000009257842,0.000008704133,0.000191384],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.835699,"threshold_uncertainty_score":0.6471678,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04870571364179909,"gpt":0.2654795059730694,"spread":0.2167737923312703,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005083661,0.0001039135,0.0001197517,0.00004743408,0.0001161208,0.00005857265,0.0003041015,0.00004369721,0.000004381619],"category_scores_gemma":[7.151685e-7,0.0001067187,0.0000243273,0.0003063606,0.00004367682,0.00004713212,0.0004012717,0.0001542579,0.00000160025],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005352058,"about_ca_system_score_gemma":0.000004651511,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005300507,"about_ca_topic_score_gemma":0.000004165967,"domain_scores_codex":[0.9993937,0.00004862911,0.0002169662,0.0001558849,0.00005522112,0.0001296184],"domain_scores_gemma":[0.9993777,0.00003547154,0.0000293944,0.0004775091,0.00001976254,0.00006014356],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[7.31761e-7,0.00005342758,0.0001355376,0.0000111558,0.00001661554,4.39816e-7,0.0001525066,0.9830887,0.0001587982,0.004481053,0.00005157725,0.01184942],"study_design_scores_gemma":[0.0001867104,0.000008778904,0.009122246,0.00002656127,0.00001224387,0.000001015869,0.0000608216,0.989623,0.000001837509,0.00003790617,0.0008064815,0.0001124139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03739612,0.0004108125,0.9609908,0.0003964634,0.0000353737,0.0001479917,0.000002112567,0.000127366,0.0004929461],"genre_scores_gemma":[0.7371728,0.0002642763,0.2622701,0.0001676801,0.00003064514,0.00003735794,0.00004479321,0.00001108685,0.000001210057],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6997767,"threshold_uncertainty_score":0.4351864,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02131202181975967,"gpt":0.3016122232695432,"spread":0.2803002014497836,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003895022,0.0002604044,0.0002727788,0.00006671396,0.0008155535,0.0004655436,0.003232217,0.0001384637,0.000002013234],"category_scores_gemma":[0.000007083334,0.000261984,0.00008512477,0.0005038388,0.0002272449,0.0003231674,0.001607356,0.0003563974,0.000003977035],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001209481,"about_ca_system_score_gemma":0.000110776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006154549,"about_ca_topic_score_gemma":0.00003577299,"domain_scores_codex":[0.9981545,0.0001801695,0.0004460069,0.0005664225,0.0001706364,0.0004823178],"domain_scores_gemma":[0.9955183,0.000300017,0.0002211018,0.003513755,0.000228176,0.0002186039],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001877519,0.0008832388,0.0001007798,0.00003882316,0.00003672883,0.000003515834,0.001629982,0.6663302,0.00004307687,0.07739925,0.0005546923,0.252961],"study_design_scores_gemma":[0.001396066,0.0003463631,0.0005601902,0.00010822,0.000008687106,0.00002549395,0.00002443625,0.9838852,0.00002356585,0.0007895397,0.01252979,0.0003024703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00169769,0.0001892729,0.9463511,0.0004457485,0.000111856,0.05071587,0.00001616038,0.0004368492,0.00003551117],"genre_scores_gemma":[0.5027208,0.0000223213,0.3354068,0.0002506481,0.0001325793,0.1613291,0.0001037538,0.00003016656,0.000003900513],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6109443,"threshold_uncertainty_score":0.9999833,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02188444540775204,"gpt":0.2752206278828226,"spread":0.2533361824750706,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009263417,0.000221396,0.0002272766,0.0001604817,0.0004955904,0.0001979404,0.003511119,0.0001674161,0.000002997705],"category_scores_gemma":[0.00001384577,0.0002338721,0.0001551962,0.0005974956,0.0001728241,0.00038775,0.001884893,0.000391753,0.00002073117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000135501,"about_ca_system_score_gemma":0.00005040166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001967365,"about_ca_topic_score_gemma":0.0000871989,"domain_scores_codex":[0.998233,0.000124409,0.0004983645,0.0004588353,0.0001825657,0.0005028063],"domain_scores_gemma":[0.9947572,0.0007486204,0.0001980662,0.003877511,0.0002503082,0.00016824],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001504642,0.0001405272,0.00001054032,0.00001029868,0.00001789555,7.129523e-7,0.0009168682,0.1176104,0.00005663213,0.04305089,0.0005644963,0.8376057],"study_design_scores_gemma":[0.0003754798,0.0001525573,0.00009736601,0.00003855672,0.00001341901,0.00001550718,0.00001050956,0.961911,0.00006892489,0.01208433,0.0249869,0.0002454652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001363017,0.003578494,0.9924824,0.0003256198,0.0004924052,0.0009871869,0.000002292579,0.0004934388,0.0002752071],"genre_scores_gemma":[0.5869864,0.0007747016,0.4112301,0.0004752795,0.0001295364,0.0002979641,0.00002315773,0.00002351487,0.00005931241],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8443006,"threshold_uncertainty_score":0.9537026,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0370618672097082,"gpt":0.2726622327803447,"spread":0.2356003655706365,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004129201,0.000144798,0.0001718746,0.000076285,0.0006340927,0.00008935112,0.0003037903,0.0001177284,0.000001828523],"category_scores_gemma":[0.000005253868,0.0001513764,0.00003393617,0.0001636034,0.0001151982,0.0001434741,0.0001867413,0.0001359643,0.000004993095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005319966,"about_ca_system_score_gemma":0.00001297137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004519546,"about_ca_topic_score_gemma":0.0004092785,"domain_scores_codex":[0.9991037,0.00007497765,0.0003570475,0.0002073718,0.00005303248,0.0002039292],"domain_scores_gemma":[0.9986361,0.0002070129,0.00003632944,0.000914077,0.00009790331,0.0001085292],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002019454,0.0002135882,0.000410683,0.00003934231,0.00005182406,2.962375e-7,0.001895364,0.8723754,0.03057058,0.007660403,0.0005320494,0.08623032],"study_design_scores_gemma":[0.0001978012,0.00006318421,0.004273521,0.00001664856,0.00001300307,0.000003275254,0.00001200123,0.9933927,0.0001637127,0.0005518352,0.00114811,0.0001641937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1893775,0.0001333006,0.8092629,0.0001212313,0.00007377181,0.0005971387,0.0000155827,0.0003475219,0.00007108792],"genre_scores_gemma":[0.7540721,0.00008483104,0.2454018,0.00006573348,0.0001294822,0.0001125904,0.0001115638,0.00001927113,0.000002602636],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5646947,"threshold_uncertainty_score":0.6172949,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05916328874943429,"gpt":0.2865896988356036,"spread":0.2274264100861693,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0009405821,0.000206551,0.0002026621,0.0001820685,0.0007361649,0.0008229068,0.006316076,0.00007376406,0.000007528487],"category_scores_gemma":[0.00004411019,0.0001260404,0.0001047102,0.001186477,0.0001190988,0.0004447898,0.001126338,0.0002979807,0.000257796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007924445,"about_ca_system_score_gemma":0.00008091896,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000131258,"about_ca_topic_score_gemma":0.000562972,"domain_scores_codex":[0.9974739,0.001006501,0.0003918055,0.000402924,0.0004015835,0.0003233198],"domain_scores_gemma":[0.9939989,0.0009377037,0.0001598148,0.00462929,0.0002006032,0.0000736849],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002249276,0.002626797,0.006326945,0.0001341375,0.0001120163,0.000015883,0.2310958,0.0002665128,0.0006854417,0.595476,0.1353704,0.02786752],"study_design_scores_gemma":[0.0008241205,0.0001498657,0.1756122,0.0002685997,0.00003581994,0.00008723998,0.0009897774,0.4904863,0.0001674546,0.006719168,0.3240339,0.0006255466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03046563,0.0002505298,0.8558627,0.1098618,0.0005234884,0.001857499,0.00001128106,0.000327458,0.0008396961],"genre_scores_gemma":[0.9831864,0.00001442899,0.01306973,0.002164827,0.0001273505,0.0003888147,0.00003032415,0.0000156128,0.001002489],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9527208,"threshold_uncertainty_score":0.9990602,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; 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)","retraction":null,"screen_n_in":null,"score":{"opus":0.02113860294717502,"gpt":0.2240648600401915,"spread":0.2029262570930165,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003111904,0.0001082358,0.0001517612,0.00008659888,0.000246248,0.00004738939,0.000663109,0.0001096385,0.000002645507],"category_scores_gemma":[0.000009315881,0.0001222455,0.00001971619,0.0001863709,0.0001334124,0.00014819,0.000363627,0.0001982052,0.00005397664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001102509,"about_ca_system_score_gemma":0.00001912355,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003438473,"about_ca_topic_score_gemma":0.00001874307,"domain_scores_codex":[0.9993373,0.0001147024,0.0002457103,0.0001044485,0.00006514286,0.0001326552],"domain_scores_gemma":[0.9982082,0.0001190411,0.00004755847,0.001468023,0.0000891025,0.00006804435],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003092127,0.0003178605,0.02396665,0.0004900713,0.0005650437,0.00001454565,0.01599419,0.09477331,0.001215758,0.5002179,0.02778046,0.3346333],"study_design_scores_gemma":[0.0002445529,0.00001304445,0.002326206,0.00008423349,0.00001760177,0.0000410465,0.000151347,0.986188,0.00003747656,0.00080282,0.009941156,0.000152529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0500091,0.005603231,0.8826586,0.001686,0.0002270424,0.000627999,0.00001767736,0.00702912,0.05214122],"genre_scores_gemma":[0.938227,0.0005552734,0.06102182,0.00002689093,0.0000224864,0.00002341832,0.00007434493,0.00002432226,0.00002446876],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8914147,"threshold_uncertainty_score":0.4985027,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0664170955472606,"gpt":0.2815625171955461,"spread":0.2151454216482855,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004340097,0.0002400841,0.000282345,0.0002278607,0.0003530672,0.0002246469,0.003229649,0.0001118811,0.000007659295],"category_scores_gemma":[0.000058782,0.0002816548,0.00009384674,0.0012526,0.0001229178,0.000233386,0.001067649,0.0003550347,0.0001109483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001545373,"about_ca_system_score_gemma":0.000158377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005378091,"about_ca_topic_score_gemma":0.00001991668,"domain_scores_codex":[0.9975778,0.0004610188,0.0006996595,0.0005637959,0.0003552517,0.0003424822],"domain_scores_gemma":[0.9967613,0.000257258,0.0002915969,0.002368233,0.0001058692,0.0002157109],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004215351,0.00447343,0.04398727,0.0007046667,0.0003594956,0.00003094444,0.4783856,0.08328661,0.01561134,0.3435712,0.001860337,0.02768702],"study_design_scores_gemma":[0.000601096,0.00003098997,0.002617597,0.00009322094,0.000008405034,0.00000402444,0.0001046922,0.9923856,0.0001356506,0.0004300828,0.003318954,0.0002696677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02339031,0.0003594756,0.9614759,0.01379566,0.000150723,0.0005584849,0.000004066075,0.0001974897,0.00006791039],"genre_scores_gemma":[0.8427595,0.000005872056,0.1552096,0.001865828,0.00007044073,0.00002495353,0.00003495856,0.00001985236,0.000008908546],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.909099,"threshold_uncertainty_score":0.9999636,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.3571833005297325,"gpt":0.3518207627934932,"spread":0.005362537736239348,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001145597,0.0001266224,0.0001366294,0.0001039087,0.0004686987,0.0001663394,0.008009505,0.00008802847,0.00003362357],"category_scores_gemma":[0.000002353312,0.00008926722,0.00007314698,0.0003988218,0.0003517602,0.0002437685,0.004235101,0.0006831076,0.0001929516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002872942,"about_ca_system_score_gemma":0.0001054085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004851929,"about_ca_topic_score_gemma":0.00006455207,"domain_scores_codex":[0.9982212,0.0006113574,0.0002461548,0.0002930997,0.0002933404,0.0003348003],"domain_scores_gemma":[0.9945951,0.0003178294,0.00006599991,0.004626841,0.0002783689,0.0001159261],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001509015,0.00008662956,0.00001297048,0.000002835631,0.00001785367,0.000003675623,0.007370351,4.87214e-7,2.562708e-7,0.4496056,0.01583761,0.5270602],"study_design_scores_gemma":[0.0001641429,0.0001240049,0.003288129,0.00004095635,0.000007259501,0.0000546527,0.0006701433,0.5402296,0.000007896127,0.03198538,0.4232189,0.0002088874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001671923,0.008048057,0.8631687,0.02268757,0.0007966193,0.000219015,0.000001545219,0.0002238376,0.1046874],"genre_scores_gemma":[0.8126361,0.004000876,0.1817322,0.0007226103,0.0004325357,0.00005995255,0.000006605388,0.00001226978,0.0003968415],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8124689,"threshold_uncertainty_score":0.9973577,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04053140749976591,"gpt":0.2584941633609369,"spread":0.217962755861171,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001087337,0.00008616678,0.0001236983,0.0002129714,0.00006022475,0.00001950882,0.0003448119,0.00005228642,0.000001810193],"category_scores_gemma":[0.000003548936,0.00009753399,0.00003208838,0.0006338111,0.00003840727,0.00002834531,0.00002554394,0.00009535384,0.000007140352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004949128,"about_ca_system_score_gemma":0.000017929,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001190817,"about_ca_topic_score_gemma":0.00007829822,"domain_scores_codex":[0.9993247,0.00003448505,0.0003554303,0.00008373884,0.0000853291,0.0001162927],"domain_scores_gemma":[0.9989902,0.0001857335,0.00005076117,0.000667751,0.000075679,0.00002985603],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001168612,0.00005693583,0.002310261,0.00003651371,0.000007075908,3.734858e-7,0.0005226615,0.9905905,0.00006275823,0.004583158,0.0003227103,0.001505953],"study_design_scores_gemma":[0.0001447317,0.000009617128,0.006067348,0.00008769445,0.000006628018,1.789821e-7,0.0001013552,0.9906005,0.0001016797,0.00003731743,0.002753127,0.00008986646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01120652,0.0003182341,0.9877339,0.00007629303,0.0001155395,0.0001646375,0.00004224154,0.0002482137,0.00009443122],"genre_scores_gemma":[0.9818167,0.0001320672,0.01708133,0.000021371,0.00001537527,0.000114371,0.000796687,0.00001830982,0.000003796322],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9706526,"threshold_uncertainty_score":0.3977321,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1149925682254456,"gpt":0.3212099022091837,"spread":0.2062173339837381,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0006749238,0.0002221509,0.0002679662,0.0002916277,0.0002723978,0.0004185014,0.00565266,0.00016783,7.362869e-7],"category_scores_gemma":[0.0002746419,0.0002446015,0.00006157314,0.001111865,0.0001009042,0.001616516,0.004218112,0.0005026059,0.00003999677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001321938,"about_ca_system_score_gemma":0.0001509137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004988708,"about_ca_topic_score_gemma":0.00003077487,"domain_scores_codex":[0.9980093,0.000259634,0.000582063,0.0003974206,0.0002730629,0.0004785608],"domain_scores_gemma":[0.992765,0.002092597,0.0002435632,0.004172549,0.0005213085,0.000204959],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005633944,0.0007043788,0.01706043,0.0000333864,0.0001403207,0.000008922187,0.004568133,0.6443307,0.000001011014,0.07441425,0.005671402,0.2530107],"study_design_scores_gemma":[0.0007344884,0.00004281437,0.002015302,0.0002023534,0.00001358244,0.000008993495,0.0001620858,0.9854603,0.000004259457,0.0004973207,0.01059065,0.0002678039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002520305,0.0009901677,0.9930373,0.001160634,0.001170087,0.0005322439,0.00003714207,0.0002680987,0.0002840582],"genre_scores_gemma":[0.3860886,0.000184647,0.6127581,0.000372593,0.0002100695,0.00007562101,0.0002874423,0.00001404454,0.000008843962],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3835683,"threshold_uncertainty_score":0.9997272,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03840745799832609,"gpt":0.2658558960908141,"spread":0.227448438092488,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003186817,0.000233342,0.0002756696,0.00008723125,0.0006927909,0.0003210419,0.003395149,0.00008503877,0.000003058132],"category_scores_gemma":[0.00001592614,0.000238844,0.000123136,0.000510122,0.00007728073,0.0005009182,0.0007214245,0.0002291532,0.00005106782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005174336,"about_ca_system_score_gemma":0.0001864889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001243486,"about_ca_topic_score_gemma":0.00004422118,"domain_scores_codex":[0.9983704,0.0001048126,0.0004520342,0.0004445261,0.0001526662,0.0004755332],"domain_scores_gemma":[0.996505,0.0007519203,0.0001260421,0.002062903,0.0004058958,0.0001481917],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002800905,0.0000729826,0.000001653323,0.00000732995,0.0000212465,9.386529e-8,0.0001875986,0.5970702,2.247956e-7,0.0233918,0.00329936,0.3759447],"study_design_scores_gemma":[0.0005679064,0.00007066027,0.00001014757,0.00006391847,0.00002052509,0.00001326043,0.000003229341,0.9797403,2.439667e-7,0.001134585,0.01810527,0.0002699732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000379285,0.00221035,0.9850994,0.01046783,0.0004429707,0.0005704255,0.000004143438,0.0007143886,0.0001112046],"genre_scores_gemma":[0.467539,0.00004259267,0.5299668,0.001131842,0.001080955,0.0001630557,0.00002054236,0.00001580749,0.00003940433],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4671597,"threshold_uncertainty_score":0.9739778,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06773267522109774,"gpt":0.2988355182497789,"spread":0.2311028430286811,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0002916459,0.0003279498,0.0003833168,0.0001665246,0.001467907,0.0002089352,0.007260376,0.0001824821,0.000004119019],"category_scores_gemma":[0.00001087693,0.0003566022,0.0001323632,0.00110433,0.0003951032,0.0005048844,0.003505477,0.0004064695,0.00002901487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001061202,"about_ca_system_score_gemma":0.0002022863,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004197157,"about_ca_topic_score_gemma":0.00006669023,"domain_scores_codex":[0.9973919,0.0002797253,0.0005696631,0.0009094348,0.0002725085,0.0005767308],"domain_scores_gemma":[0.9887525,0.001262495,0.0002729639,0.009041421,0.00045944,0.000211159],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001462789,0.0007649107,0.0002048955,0.00001828908,0.0001437799,0.00001289534,0.0006510777,0.8901554,0.00007569705,0.04313736,0.03156135,0.03325969],"study_design_scores_gemma":[0.000465264,0.00009337202,0.0003932871,0.00001845844,0.0000209353,0.00008723335,0.00001856709,0.9338109,0.00002956192,0.00005609524,0.06463315,0.0003731571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002006195,0.0008849087,0.9937451,0.0002615041,0.0002819916,0.001384995,0.0001036478,0.0005487361,0.0007828566],"genre_scores_gemma":[0.4431734,0.0006469106,0.5536346,0.0004546641,0.000344202,0.0006474581,0.000714662,0.00004478133,0.0003393402],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4411672,"threshold_uncertainty_score":0.9998886,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02079801153460907,"gpt":0.2323378916613899,"spread":0.2115398801267808,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001074427,0.0001107019,0.00010796,0.00007478963,0.0001876561,0.00004839482,0.0002942668,0.00007301819,0.000009240915],"category_scores_gemma":[0.00006477521,0.00008926484,0.00003539245,0.00012505,0.00008854456,0.00008539524,0.0001135377,0.00006843493,0.000009286111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003606347,"about_ca_system_score_gemma":0.000008608995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002795588,"about_ca_topic_score_gemma":0.00000877324,"domain_scores_codex":[0.9994171,0.00003191524,0.0001966471,0.0001327807,0.00004996368,0.0001716162],"domain_scores_gemma":[0.9987462,0.0003470257,0.00003457373,0.0007677305,0.00006724578,0.00003719576],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009058075,0.0004014501,0.0391278,0.0004124377,0.0002125295,0.000001952463,0.001985716,0.06647932,0.03017924,0.04684332,0.01159846,0.8026672],"study_design_scores_gemma":[0.0005128693,0.00004101121,0.001057298,0.0000622966,0.000008121932,7.243942e-7,0.00001506307,0.9782999,0.009702729,0.0002583533,0.009905547,0.0001361251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01669536,0.0000513594,0.9806092,0.0014627,0.000105694,0.0002556052,0.00001538456,0.0006300463,0.000174639],"genre_scores_gemma":[0.9712793,0.0000413048,0.02818979,0.0002686374,0.00002983185,0.0001187954,0.00001750015,0.00002507843,0.00002982664],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9545839,"threshold_uncertainty_score":0.3640114,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05487446410367642,"gpt":0.2922393677301744,"spread":0.237364903626498,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0006411672,0.0002304149,0.0002643454,0.0001984985,0.0003445754,0.000324261,0.01128192,0.0002199875,0.000005914337],"category_scores_gemma":[0.00004874014,0.0002430263,0.00005591827,0.001233961,0.0003263246,0.0005665131,0.005421642,0.001404883,0.00003456015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004995627,"about_ca_system_score_gemma":0.00008777661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004036866,"about_ca_topic_score_gemma":0.0005224106,"domain_scores_codex":[0.9975377,0.0004036642,0.0005628802,0.0007495855,0.0002671348,0.0004790714],"domain_scores_gemma":[0.9872705,0.0008555363,0.0001796365,0.01137597,0.0001410803,0.0001772265],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001079187,0.001251252,0.009325227,0.00001083729,0.00004591365,0.00002069837,0.0003824263,0.08300187,0.001207788,0.6727773,0.005041254,0.2269247],"study_design_scores_gemma":[0.0002940327,0.0000136441,0.0301137,0.00002561422,0.000004667776,0.00002297284,0.000006175938,0.958053,0.00001363621,0.0002309171,0.01096816,0.0002534851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01959611,0.0000797031,0.9723419,0.005852073,0.000810345,0.000237463,0.00002347004,0.0004159983,0.0006429503],"genre_scores_gemma":[0.7120619,0.00008321824,0.2864572,0.0002368027,0.0001678742,0.00002515263,0.0009363539,0.00001720538,0.00001420307],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8750511,"threshold_uncertainty_score":0.9940675,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1629394638747058,"gpt":0.42768060485497,"spread":0.2647411409802641,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001827678,0.0004875829,0.001981997,0.0006766789,0.0003082573,0.00009906057,0.007166173,0.0002045097,0.000001693595],"category_scores_gemma":[0.0001949409,0.0004768131,0.0004598523,0.003002536,0.0001500448,0.00009889174,0.005036149,0.001853081,0.0001071293],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003973305,"about_ca_system_score_gemma":0.0009649197,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001026697,"about_ca_topic_score_gemma":0.0001018196,"domain_scores_codex":[0.9947868,0.002222123,0.001435063,0.0007632246,0.0003159635,0.000476834],"domain_scores_gemma":[0.9916061,0.001794066,0.0009689631,0.005184775,0.0003056125,0.0001405149],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00000121232,0.0003608496,0.00001333022,0.1168749,0.0001778077,0.00001973825,0.0006393821,0.00002422636,1.547342e-8,0.008845045,0.02762556,0.8454179],"study_design_scores_gemma":[0.0001280936,0.00005306943,0.000002634248,0.1046793,0.00008688059,0.00001859185,0.000001993652,0.07976345,3.264099e-8,0.0005226326,0.8144009,0.0003424579],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[5.464249e-8,0.9788752,0.01537909,0.003260285,0.000981351,0.001037417,0.0001081397,0.0002756212,0.00008281034],"genre_scores_gemma":[0.000001603223,0.9649682,0.03174006,0.0007911754,0.0002586388,0.0001268421,0.002057052,0.00004898492,0.000007448324],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.8450755,"threshold_uncertainty_score":0.9997684,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03287836788630454,"gpt":0.2355583680635632,"spread":0.2026800001772587,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004166152,0.0002083707,0.0002914352,0.0001405287,0.0002260967,0.000120813,0.002618161,0.0001314916,0.000006046391],"category_scores_gemma":[0.00001207091,0.0002125865,0.00005841616,0.0005755642,0.0002820974,0.0003531194,0.001401325,0.0004428207,0.0000112614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005520985,"about_ca_system_score_gemma":0.00003442729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001276085,"about_ca_topic_score_gemma":0.0001680511,"domain_scores_codex":[0.9981225,0.0004630385,0.0004191227,0.0004648674,0.0001405185,0.0003899568],"domain_scores_gemma":[0.9957682,0.000555152,0.0001380982,0.003271023,0.0001192619,0.0001482998],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006750679,0.003577477,0.1092465,0.00004975818,0.0001794269,0.00006587729,0.008396547,0.05658591,0.000243957,0.4538527,0.0009997523,0.3667345],"study_design_scores_gemma":[0.0005094021,0.00004092566,0.05333007,0.00003535211,0.000005633783,0.00001480278,0.00001405456,0.9448382,0.00001747381,0.0002557303,0.0007193156,0.0002189921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04926271,0.0005494161,0.9477596,0.0005839187,0.0002662636,0.0002902244,0.000002248524,0.000276709,0.001008907],"genre_scores_gemma":[0.8361499,0.0001990981,0.1630768,0.0004566959,0.0000433249,0.00003809701,0.00000534516,0.00001461398,0.0000161706],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8882523,"threshold_uncertainty_score":0.8669027,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; 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","retraction":null,"screen_n_in":null,"score":{"opus":0.1384809580388536,"gpt":0.2977731457244659,"spread":0.1592921876856123,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006141188,0.0001294267,0.0001498937,0.0001655684,0.0003254552,0.000276641,0.00311598,0.00005405532,0.000002845351],"category_scores_gemma":[0.0001124232,0.0001296367,0.00001790205,0.000380787,0.00008984855,0.0003324698,0.0004383057,0.0002034285,0.00003001728],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006004639,"about_ca_system_score_gemma":0.00008000883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000806289,"about_ca_topic_score_gemma":0.0001137222,"domain_scores_codex":[0.9987183,0.0002266099,0.000326733,0.0004199641,0.0001603711,0.0001480434],"domain_scores_gemma":[0.9933405,0.001189509,0.0000853064,0.005253809,0.00007100228,0.0000598678],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002273226,0.002628459,0.07180318,0.0001245706,0.00006018369,0.00003959539,0.003864969,0.02953961,0.0004978102,0.1898182,0.07195115,0.6296495],"study_design_scores_gemma":[0.0002790195,0.00005015544,0.01014324,0.00009212362,0.000004812064,0.00001735197,0.000003414632,0.9875729,0.00001444644,0.0005274506,0.001159494,0.0001355998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001942061,0.0002413918,0.989067,0.003642012,0.00008676705,0.0003379184,0.00003206564,0.003272795,0.001378057],"genre_scores_gemma":[0.605007,0.00001805742,0.3944825,0.000345176,0.00003749301,0.00003766634,0.00005191741,0.000006373786,0.00001388824],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9580333,"threshold_uncertainty_score":0.5790318,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02164145427795417,"gpt":0.2401051350081182,"spread":0.218463680730164,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002737415,0.0002042129,0.0002473067,0.00007795846,0.000506852,0.0001164861,0.003137714,0.00009838228,0.000003988263],"category_scores_gemma":[0.000006316489,0.0001987689,0.00006591033,0.001100089,0.0002105025,0.0004846921,0.001239566,0.0005376139,0.00002731013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001461053,"about_ca_system_score_gemma":0.00009747851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005480299,"about_ca_topic_score_gemma":0.0001339506,"domain_scores_codex":[0.9982852,0.0002641467,0.0004038032,0.0004150591,0.0002007113,0.0004310476],"domain_scores_gemma":[0.9960128,0.0003466331,0.0001534632,0.003259212,0.0001136653,0.0001142372],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001051552,0.0005251794,0.002418116,0.000006089134,0.00003145661,0.00003684417,0.002214201,0.5190324,0.000002802573,0.009874913,0.004106115,0.4617414],"study_design_scores_gemma":[0.0004602032,0.00012692,0.009859287,0.00006934643,0.00000436041,0.0001025841,0.00001617588,0.9583679,0.000002453101,0.00003535327,0.0307119,0.0002435106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03250214,0.005280019,0.9603698,0.0005069094,0.0002176504,0.0005124169,0.00000316897,0.0003746348,0.000233246],"genre_scores_gemma":[0.8858461,0.002003008,0.1114719,0.0001834872,0.0001049252,0.0002354184,0.0001084363,0.00001682942,0.00002988796],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.853344,"threshold_uncertainty_score":0.8105562,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.09128292449671148,"gpt":0.2811332553182015,"spread":0.18985033082149,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0002080018,0.0001730111,0.0001729954,0.0001046257,0.002338366,0.0001553118,0.001752924,0.00004290204,0.000003158062],"category_scores_gemma":[0.000004873165,0.0002065922,0.00006534276,0.0005079608,0.0001355174,0.0006099723,0.002391659,0.0002920532,0.00000131299],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000813911,"about_ca_system_score_gemma":0.00005699817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004351905,"about_ca_topic_score_gemma":0.00001224079,"domain_scores_codex":[0.998517,0.0001908535,0.0003370787,0.0005035613,0.0001729539,0.0002785501],"domain_scores_gemma":[0.9975777,0.0005500991,0.0001698128,0.001431374,0.0001584763,0.0001125125],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004554822,0.0001452539,0.00001067511,0.000008812039,0.00002061788,1.604292e-7,0.0001370805,0.1299043,0.0000227152,0.7738278,0.00109565,0.09482244],"study_design_scores_gemma":[0.0002923669,0.00005334103,0.00007091388,0.000002596208,0.000006668759,0.00002912277,0.00002935059,0.8927843,0.000001818077,0.02837709,0.07816482,0.0001876206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003969844,0.008722919,0.9706806,0.01870929,0.00009619135,0.001163611,0.0000326078,0.0004058143,0.0001492508],"genre_scores_gemma":[0.2927276,0.00157092,0.6970081,0.001224816,0.0001533432,0.006893321,0.0003487935,0.00002815696,0.00004502422],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.76288,"threshold_uncertainty_score":0.9989604,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.08116099532961196,"gpt":0.3224923211271976,"spread":0.2413313257975856,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004770186,0.0002340112,0.0002571802,0.0002029832,0.0004421617,0.000268358,0.003034858,0.0001262898,0.000002196096],"category_scores_gemma":[0.000009242797,0.0002297832,0.00004957667,0.0006138633,0.00007188611,0.0004811721,0.001649035,0.0002532574,9.108627e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001017949,"about_ca_system_score_gemma":0.0001263157,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001730462,"about_ca_topic_score_gemma":0.0001395517,"domain_scores_codex":[0.9979541,0.0002562444,0.0005584066,0.0006237254,0.000210069,0.0003974748],"domain_scores_gemma":[0.9961414,0.0003555861,0.0001901666,0.003052712,0.0001019694,0.0001581383],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001479948,0.0001649043,0.0000514553,0.00001397624,0.000007351645,7.353199e-7,0.0003193648,0.7031736,0.00005023114,0.004697307,0.000292877,0.2912134],"study_design_scores_gemma":[0.001523244,0.000037232,0.0001438775,0.0002815863,0.000008448373,0.0000172367,0.000002794495,0.9597443,0.00004377332,0.00004617898,0.03790092,0.0002503583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002089054,0.0002519702,0.9824562,0.001771778,0.00008158571,0.01497038,0.000001976849,0.0001633525,0.00009385071],"genre_scores_gemma":[0.06979658,0.00002622965,0.9211885,0.0002999359,0.0002147266,0.00835471,0.0000623857,0.00003055925,0.00002636887],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.290963,"threshold_uncertainty_score":0.9370286,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02551011424867056,"gpt":0.2230613286480886,"spread":0.197551214399418,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001052261,0.000204775,0.0002322989,0.00004322087,0.0002367654,0.0001126489,0.0007793958,0.00008578265,0.000002153095],"category_scores_gemma":[9.251004e-7,0.0002341825,0.0000562828,0.0003310222,0.00007315372,0.0001589053,0.0003896306,0.0003128578,0.000009656714],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001141045,"about_ca_system_score_gemma":0.000007210936,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001218112,"about_ca_topic_score_gemma":0.000007220108,"domain_scores_codex":[0.9989588,0.0001468835,0.0002715839,0.000235676,0.000110136,0.0002769628],"domain_scores_gemma":[0.9984449,0.00005075838,0.00004430355,0.001188638,0.00004402119,0.0002274287],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004403306,0.0000208675,0.00001382209,0.00004732683,0.0001240012,0.00001263668,0.0002227301,0.9798945,0.00001170981,0.000759427,0.0003717078,0.01851689],"study_design_scores_gemma":[0.0002780232,0.00005056805,0.000429618,0.0001040619,0.00008030179,0.00001928047,0.0001801984,0.9900938,0.000001393163,0.000004418429,0.008524111,0.0002342825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04581774,0.00874714,0.9436448,0.0001919046,0.000122566,0.0004135208,0.00002148559,0.0009435202,0.00009733033],"genre_scores_gemma":[0.9034036,0.0006287321,0.09550023,0.00009800598,0.0001064225,0.00002595447,0.0001901273,0.00004620876,6.690041e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8575859,"threshold_uncertainty_score":0.9549688,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04038966922434823,"gpt":0.2692914909294422,"spread":0.2289018217050939,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002102954,0.0001141765,0.0001104724,0.0001371417,0.0004182943,0.00008506164,0.0014778,0.0001340051,0.00003337633],"category_scores_gemma":[0.00002535878,0.0001568848,0.00003102524,0.0002966842,0.00003748788,0.0003950412,0.0010709,0.001263431,0.000009870244],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002689815,"about_ca_system_score_gemma":0.00001356908,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001075371,"about_ca_topic_score_gemma":0.00001087676,"domain_scores_codex":[0.9990944,0.0000829304,0.0002799848,0.0001614834,0.0001248909,0.0002562595],"domain_scores_gemma":[0.998189,0.0002238154,0.0000428582,0.0014836,0.00001302875,0.00004768853],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003827796,0.0000801408,0.0002293725,0.00003101892,0.00003095671,0.000001815172,0.0007308864,0.944549,0.000017466,0.00160338,0.0001384525,0.05258373],"study_design_scores_gemma":[0.000233551,0.00003750288,0.0002080106,0.00001346409,0.000007664735,0.00001542998,0.001039115,0.8050142,0.00007737784,0.001329667,0.1918588,0.0001652023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02424479,0.000448336,0.9722129,0.0002294181,0.0002536194,0.0006118283,0.00006222106,0.0003054086,0.001631508],"genre_scores_gemma":[0.9782518,0.00004756559,0.02062317,0.00006229823,0.00003921711,0.0004313758,0.0003884181,0.00003681026,0.0001194135],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9540069,"threshold_uncertainty_score":0.6397577,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02270923618553613,"gpt":0.2499477063842565,"spread":0.2272384701987203,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000905142,0.00009951117,0.0001473589,0.00004698974,0.0003886173,0.00009045606,0.00135029,0.00005917237,0.000004014852],"category_scores_gemma":[0.000038071,0.0001101993,0.00003361582,0.00004965925,0.0002504086,0.0001603989,0.0006965459,0.0001424275,0.000002369843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001267665,"about_ca_system_score_gemma":0.00001468974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007094985,"about_ca_topic_score_gemma":0.00006823523,"domain_scores_codex":[0.9994632,0.00003512065,0.0001993995,0.0001008684,0.00005963215,0.0001417508],"domain_scores_gemma":[0.9970062,0.0003281421,0.00009660723,0.00245978,0.00005435466,0.00005492985],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006985888,0.0004857426,0.01138189,0.0002208732,0.0004263679,0.00000724148,0.002273595,0.2455274,0.006506806,0.1920764,0.01016347,0.5309233],"study_design_scores_gemma":[0.0002101662,0.0000173606,0.007613747,0.0001113967,0.00001488265,0.000006893046,0.000006521753,0.9713071,0.0005873911,0.0005300972,0.01943292,0.000161523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07463962,0.007515425,0.8844991,0.000837517,0.0007817803,0.000158507,0.00002076729,0.0006289639,0.03091834],"genre_scores_gemma":[0.9619589,0.001096191,0.03678779,0.00002484065,0.00004722418,0.00001053689,0.00001348046,0.0000197807,0.0000412688],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8873193,"threshold_uncertainty_score":0.4493799,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02009238213652511,"gpt":0.2395035772700231,"spread":0.2194111951334979,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000473473,0.000370688,0.0004079828,0.0001297175,0.001118807,0.0003847546,0.004571706,0.0002231055,0.000001597755],"category_scores_gemma":[0.000007265161,0.000406809,0.0002559177,0.0008246181,0.0001834451,0.000374779,0.00183204,0.0004649944,0.00001781618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001030847,"about_ca_system_score_gemma":0.0000501899,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003005935,"about_ca_topic_score_gemma":0.00008113492,"domain_scores_codex":[0.9972814,0.0002210203,0.000679894,0.0006802505,0.0002684056,0.0008690591],"domain_scores_gemma":[0.9939635,0.0008413749,0.0002776764,0.004401972,0.000361451,0.0001540143],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004077877,0.0001428096,0.00008143903,0.000006318448,0.00002724921,0.000001168543,0.00005418561,0.8992695,0.00002280166,0.07378875,0.0020836,0.02451808],"study_design_scores_gemma":[0.0004544264,0.00003345415,0.00009693866,0.00004903133,0.00002157327,0.00001435632,0.00000213085,0.9931477,0.00002020336,0.003001091,0.002702917,0.0004561847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008488821,0.001074278,0.9935502,0.00169717,0.0007958983,0.0004967013,0.000004957561,0.0008148114,0.0007170539],"genre_scores_gemma":[0.3313885,0.00004928889,0.6669942,0.0005213415,0.0007085358,0.0001073701,0.0001055042,0.00004258754,0.00008261887],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3305397,"threshold_uncertainty_score":0.9998384,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02641965215671897,"gpt":0.2978190741124963,"spread":0.2713994219557773,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001284902,0.0003633399,0.0004547446,0.0001796224,0.0007723322,0.0005118664,0.005575741,0.0003126882,0.000006751809],"category_scores_gemma":[0.00002969,0.0003751073,0.0001442257,0.001327914,0.0001517913,0.0005683576,0.001630954,0.00122778,0.00001265792],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007273249,"about_ca_system_score_gemma":0.0001156161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005471809,"about_ca_topic_score_gemma":0.002943873,"domain_scores_codex":[0.9967389,0.0005045049,0.0007723895,0.0007494859,0.0002308902,0.001003899],"domain_scores_gemma":[0.9933098,0.0007907096,0.0003112097,0.004998929,0.000354551,0.0002348328],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002748884,0.001227369,0.01069819,0.00001958606,0.00003637165,0.000005565914,0.001587591,0.7954432,0.000230155,0.1153757,0.002538737,0.07281002],"study_design_scores_gemma":[0.0008489278,0.00009373128,0.003272257,0.0001472169,0.000005833594,0.00001353556,0.00003501912,0.9704133,0.00003554196,0.000197776,0.02451805,0.0004187665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01416299,0.00004091369,0.9775444,0.0007487524,0.0009526348,0.005702221,0.00001038129,0.0005878313,0.0002499348],"genre_scores_gemma":[0.3407966,0.00001076883,0.6541021,0.0005001497,0.0007233293,0.003614654,0.0001533467,0.0000500109,0.00004904349],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3266336,"threshold_uncertainty_score":0.9998701,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01551127174075502,"gpt":0.2486034523507928,"spread":0.2330921806100378,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002326283,0.0001097083,0.0001803603,0.0001093839,0.0002529273,0.00008553464,0.001871965,0.00005219693,0.00001244314],"category_scores_gemma":[0.000009279369,0.0001119047,0.00007040089,0.000652624,0.00008665201,0.0005222234,0.0002658418,0.0001338935,0.00001640784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001970643,"about_ca_system_score_gemma":0.00003739148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002396977,"about_ca_topic_score_gemma":0.00002588488,"domain_scores_codex":[0.9988577,0.0002887952,0.0003370741,0.0002170776,0.000146535,0.0001527537],"domain_scores_gemma":[0.9969909,0.000202359,0.0001447816,0.00228471,0.0002874135,0.00008987576],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001586623,0.0002478598,0.0004129334,0.000003329389,0.00003200808,9.421864e-7,0.0004605894,0.0912969,0.0000614059,0.02855544,0.00007053095,0.8788422],"study_design_scores_gemma":[0.0008045044,0.0001010866,0.001167972,0.00002018147,0.00001109013,0.0000119035,0.000005637837,0.9886448,0.00002341173,0.0002150081,0.008881973,0.0001124519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003061504,0.0005128197,0.9942921,0.0007746554,0.0002546672,0.0002219109,0.000001109202,0.0002773034,0.0006039786],"genre_scores_gemma":[0.7631066,0.0002993124,0.2362884,0.0001666874,0.00006016594,0.00003327825,0.00001074407,0.000006957842,0.00002779937],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8973479,"threshold_uncertainty_score":0.4563342,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01432014359902116,"gpt":0.2368872200662322,"spread":0.222567076467211,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002887032,0.0002259301,0.0002786028,0.0001365321,0.0004231824,0.000221286,0.003603979,0.0001133875,0.000003492041],"category_scores_gemma":[0.000006964431,0.0002052055,0.00009470547,0.0004525758,0.0004498761,0.0005898995,0.0006063917,0.000423627,0.000004927705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002101804,"about_ca_system_score_gemma":0.0003069693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002847185,"about_ca_topic_score_gemma":0.0001355528,"domain_scores_codex":[0.9985434,0.00007267417,0.0004201856,0.0003788692,0.0002118567,0.0003729941],"domain_scores_gemma":[0.9953297,0.0005026396,0.0002955209,0.003372992,0.0004002489,0.0000988449],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003995153,0.0009732223,0.001103683,0.0002251084,0.0001190374,0.000003860884,0.003238036,0.3113795,0.02819686,0.4304149,0.0006542261,0.2236517],"study_design_scores_gemma":[0.0004843687,0.0003565219,0.0004077373,0.00005516058,0.00001516269,0.00002914582,0.00007477392,0.9938136,0.00204166,0.0001834128,0.002268019,0.0002704652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2312107,0.00008472952,0.7665104,0.0002120245,0.0003862444,0.0004229156,0.000008793313,0.0002281927,0.0009360475],"genre_scores_gemma":[0.5988493,0.00001416056,0.4008597,0.00005727433,0.00006253552,0.0001094136,0.0000143713,0.00001473821,0.00001846182],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6824341,"threshold_uncertainty_score":0.8368039,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0186540089955976,"gpt":0.2036066731379924,"spread":0.1849526641423948,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004905433,0.0001126563,0.0001559456,0.00009858849,0.0001509157,0.00002351505,0.001091386,0.00005165251,0.0000058231],"category_scores_gemma":[0.000007355426,0.0001006484,0.00005661132,0.000456423,0.00006564542,0.00005586866,0.0002258036,0.0002201499,0.00001370826],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007205777,"about_ca_system_score_gemma":0.0000137128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001613775,"about_ca_topic_score_gemma":0.000009892572,"domain_scores_codex":[0.9989966,0.000335804,0.0002998604,0.000107205,0.0001006069,0.0001599299],"domain_scores_gemma":[0.9980446,0.0002553773,0.00003577247,0.001556381,0.00004404968,0.00006378625],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003748471,0.0001550205,0.0003187774,0.0000141648,0.00003381653,4.79657e-8,0.004083834,0.9625204,0.0002820009,0.02794098,0.003619142,0.001028103],"study_design_scores_gemma":[0.0002548571,0.0000311422,0.004599296,0.0001060515,0.00001411768,0.000006260261,0.001045631,0.9760205,0.0001977558,0.0006741246,0.01681652,0.0002338064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01878363,0.003164372,0.9578573,0.0006066427,0.0002279056,0.0009522127,0.000009675538,0.0001185304,0.01827972],"genre_scores_gemma":[0.9144642,0.00009146256,0.08507251,0.0001141878,0.00001389737,0.0001877497,0.00001447248,0.00001455574,0.00002692693],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8956806,"threshold_uncertainty_score":0.4104322,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02062002715959974,"gpt":0.2580202905755517,"spread":0.237400263415952,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004077971,0.0001699106,0.0001682478,0.0002861364,0.000410376,0.0004583167,0.001017111,0.0001401101,0.00001252657],"category_scores_gemma":[0.00000923113,0.0001804811,0.00008107655,0.001001361,0.000119727,0.0005229461,0.0002809416,0.0008134611,0.00003119656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007103959,"about_ca_system_score_gemma":0.00003815996,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004062958,"about_ca_topic_score_gemma":0.0006794049,"domain_scores_codex":[0.9984953,0.000377909,0.0003241775,0.0004018284,0.0001442533,0.0002565413],"domain_scores_gemma":[0.9982949,0.0004342065,0.00002931221,0.001090738,0.0000617439,0.00008902133],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008852538,0.0001160866,0.000115955,0.00003553226,0.00002512634,0.000007606624,0.001529622,0.140323,0.00009622784,0.01174896,0.0002702266,0.8457229],"study_design_scores_gemma":[0.0002287155,0.0001240517,0.001205383,0.00007617286,0.000008603803,0.00002075887,0.00001060529,0.9571198,0.0001126668,0.0007403244,0.04016577,0.0001871128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009769516,0.003685472,0.9825305,0.002120474,0.0005392476,0.0002321456,6.317559e-7,0.0004663938,0.0006556217],"genre_scores_gemma":[0.9874504,0.0006444041,0.01120669,0.000454698,0.0001284592,0.0000547914,0.00001192709,0.00001719476,0.00003150185],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9776808,"threshold_uncertainty_score":0.7359806,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0373448298187891,"gpt":0.2308675735101937,"spread":0.1935227436914045,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002615568,0.0001024404,0.0001738257,0.00002833849,0.0003390833,0.00006958034,0.00225055,0.00004222687,2.663426e-7],"category_scores_gemma":[0.0000229617,0.00007318081,0.00006700633,0.0002032802,0.0003147935,0.0002336121,0.003176461,0.0002075229,0.000003010631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003882232,"about_ca_system_score_gemma":0.00009797042,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007986068,"about_ca_topic_score_gemma":0.0001074596,"domain_scores_codex":[0.9991562,0.0001660682,0.0002125441,0.0001976836,0.0001304998,0.0001369614],"domain_scores_gemma":[0.996575,0.0001203609,0.0001082312,0.003024089,0.0001265979,0.00004575124],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002113492,0.0005891958,0.001125968,0.00005389299,0.00009137903,8.652257e-7,0.007991267,0.2899929,0.004546132,0.6755049,0.0004189427,0.01966344],"study_design_scores_gemma":[0.00068531,0.00001332964,0.002395726,0.00007365768,0.000008342535,0.00001516588,0.000006609504,0.9796081,0.002375882,0.01462797,0.00009117752,0.00009873426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1138787,0.0005095951,0.8803548,0.004549238,0.00008743618,0.0002834755,8.192861e-7,0.00007581131,0.0002600614],"genre_scores_gemma":[0.8490221,0.00006308632,0.150496,0.0003662206,0.00001376163,0.00002376638,4.442639e-7,0.000005052294,0.000009632917],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7351434,"threshold_uncertainty_score":0.4182119,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02957934590822155,"gpt":0.3031669688491642,"spread":0.2735876229409426,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003028115,0.0001885101,0.0001862588,0.0002238214,0.0007627058,0.0004850045,0.001844732,0.0001220294,0.000006833367],"category_scores_gemma":[0.00003309805,0.0001993766,0.0002088002,0.0009288022,0.000136511,0.0005570151,0.0005242312,0.0003452396,0.0001200601],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001021335,"about_ca_system_score_gemma":0.00007199249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001848471,"about_ca_topic_score_gemma":0.00002022906,"domain_scores_codex":[0.9985658,0.00009783281,0.0004070034,0.0005308026,0.0001425989,0.0002559891],"domain_scores_gemma":[0.9965784,0.0003879387,0.0001119177,0.002621047,0.0002116723,0.00008902939],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002399262,0.00007478337,0.000003098059,0.00004637537,0.00003215182,4.422837e-7,0.0003039822,0.00007003464,0.00144687,0.4080706,0.000718436,0.5892308],"study_design_scores_gemma":[0.0001792405,0.0001655872,0.0003911878,0.0002334182,0.00003361872,0.00004248617,0.00003092537,0.7168803,0.0174612,0.1679499,0.09621017,0.0004220452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002773222,0.001625304,0.9893187,0.004104562,0.0006223555,0.0007574894,0.00000922153,0.002010119,0.001274925],"genre_scores_gemma":[0.5737411,0.00009389577,0.4250465,0.0002993708,0.0001358493,0.0005963654,0.00000748096,0.00001621007,0.00006319],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7168102,"threshold_uncertainty_score":0.8130342,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06081634683340278,"gpt":0.2979869743649653,"spread":0.2371706275315625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003591421,0.0001459339,0.0003743852,0.00006297169,0.0003098331,0.00007796717,0.003725337,0.00007460397,0.000005152303],"category_scores_gemma":[0.00002062878,0.0001122076,0.0001784792,0.0002678395,0.0002429604,0.000217663,0.000551623,0.0001748441,0.000005411771],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001804633,"about_ca_system_score_gemma":0.00008490976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002321324,"about_ca_topic_score_gemma":0.00001709836,"domain_scores_codex":[0.9986347,0.000177676,0.0006019463,0.0001964263,0.0001553165,0.0002339183],"domain_scores_gemma":[0.9942642,0.002364286,0.0003646452,0.002441809,0.0004956248,0.00006938011],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008891045,0.0001546963,0.0001679975,0.000005641587,0.00009549399,1.829224e-8,0.0004635575,0.6373667,0.0000769968,0.09532076,0.007362972,0.2589763],"study_design_scores_gemma":[0.0007536645,0.00008510524,0.0002721483,0.00002259523,0.00003771489,7.888955e-7,0.00002819475,0.9964032,0.00002920167,0.001458265,0.0007980083,0.000111183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000630355,0.001967526,0.9918223,0.004145673,0.000164704,0.0009368739,0.000003757585,0.0000837338,0.0002450584],"genre_scores_gemma":[0.7493468,0.00007892042,0.2499514,0.0002959116,0.00003832229,0.0002299274,0.000005601592,0.000008251654,0.0000448854],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7487165,"threshold_uncertainty_score":0.6922665,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1436103430542828,"gpt":0.3375627116951288,"spread":0.193952368640846,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005274992,0.0001518795,0.0001304472,0.00008035454,0.001209468,0.0002037141,0.002364021,0.0000835399,0.00000713848],"category_scores_gemma":[0.00003290773,0.0001252307,0.0001324466,0.0003377548,0.00008826421,0.000753557,0.001403178,0.0002888838,0.00008548918],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006036384,"about_ca_system_score_gemma":0.00001262835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006100765,"about_ca_topic_score_gemma":0.0003172601,"domain_scores_codex":[0.9988318,0.0001856462,0.0002867827,0.0002214292,0.0001199398,0.0003543677],"domain_scores_gemma":[0.9965672,0.0006298227,0.0001308449,0.002445269,0.0001295601,0.00009734371],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001052787,0.0006256569,0.0004589566,0.00002688963,0.0001005867,1.933403e-7,0.003132688,0.002437226,0.00288198,0.007343249,0.004296381,0.9786857],"study_design_scores_gemma":[0.000300912,0.00003041235,0.004113106,0.00001364233,0.00001089797,0.00001375968,0.00001386577,0.8097619,0.0006575724,0.0000318416,0.1849163,0.0001358054],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001129983,0.001260582,0.9937312,0.001555961,0.001505395,0.0004898136,0.000003253939,0.0002732842,0.0000505274],"genre_scores_gemma":[0.4635728,0.0001297937,0.535332,0.0004272297,0.0002683742,0.0001770585,0.000004552914,0.00001161577,0.0000766235],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9785498,"threshold_uncertainty_score":0.9302372,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04124923082441778,"gpt":0.286514547669909,"spread":0.2452653168454912,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006143922,0.000230963,0.0003437348,0.0001682602,0.000343898,0.00014493,0.003753683,0.0001563331,0.0000670818],"category_scores_gemma":[0.0000160757,0.000183714,0.00007658955,0.0006870997,0.0002279587,0.0003835922,0.002121466,0.000349652,0.00006092513],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001163244,"about_ca_system_score_gemma":0.0002443106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001468818,"about_ca_topic_score_gemma":0.00005739979,"domain_scores_codex":[0.997652,0.0004935387,0.0006599402,0.0004687369,0.0001856501,0.0005401648],"domain_scores_gemma":[0.9951361,0.001048964,0.0002302964,0.00325432,0.0001636843,0.0001665641],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005605851,0.0006210247,0.007628304,0.00002036954,0.00004039969,0.00002596611,0.0004783074,0.001181241,0.00006114972,0.05517795,0.008438108,0.9262711],"study_design_scores_gemma":[0.001766115,0.0001102252,0.00211918,0.0001481412,0.000004546958,0.00001492357,0.000005295848,0.9535368,0.000006718813,0.00181646,0.0402224,0.0002491568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001114092,0.00009902252,0.9833693,0.005362286,0.0002399731,0.008365721,0.000003336739,0.0003679473,0.002080993],"genre_scores_gemma":[0.6342186,0.00004290363,0.353967,0.00153719,0.0001417786,0.009891589,0.00001709827,0.0000296356,0.000154258],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9523556,"threshold_uncertainty_score":0.7491639,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06781963484572784,"gpt":0.304871999234196,"spread":0.2370523643884682,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007960009,0.0002114854,0.0002896154,0.0001573197,0.001426368,0.0009689634,0.007803777,0.0001081473,0.000001338371],"category_scores_gemma":[0.00003502142,0.0002225245,0.0001486121,0.0001102197,0.0001424444,0.000880463,0.001045442,0.0004119939,0.000005078905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008074865,"about_ca_system_score_gemma":0.00008914149,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000729374,"about_ca_topic_score_gemma":0.0003650295,"domain_scores_codex":[0.9982659,0.0003037198,0.0003740914,0.0005138744,0.0001656392,0.0003767536],"domain_scores_gemma":[0.9921278,0.0004035164,0.000237849,0.006959652,0.0001346675,0.0001364853],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003712311,0.001822367,0.005795101,0.00005987416,0.00009649646,0.000007771896,0.003464296,0.4783277,0.0002402967,0.0521915,0.005490937,0.4524665],"study_design_scores_gemma":[0.0006825992,0.00009107236,0.002935132,0.00005662165,0.00000994644,0.000004633569,0.00001956408,0.9887278,0.00001178859,0.0006473188,0.00654942,0.0002641018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004273129,0.0006291771,0.9903364,0.002203066,0.0003657315,0.0006157394,0.000007271931,0.0002345012,0.001335054],"genre_scores_gemma":[0.7664552,0.00002549328,0.2323533,0.0006095007,0.0001330383,0.0002905358,0.00006916008,0.00001752568,0.00004627888],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7621821,"threshold_uncertainty_score":0.9998736,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04141503808203103,"gpt":0.29967456980763,"spread":0.258259531725599,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000348005,0.0001517663,0.0001890638,0.0001998579,0.0001817716,0.0001058667,0.0006574664,0.00008993626,0.000006235828],"category_scores_gemma":[0.00001809565,0.0001901956,0.00002997798,0.0006971029,0.00003596588,0.000208634,0.0002478759,0.0002569199,0.00000656357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000263754,"about_ca_system_score_gemma":0.00003778802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003689327,"about_ca_topic_score_gemma":0.00003473529,"domain_scores_codex":[0.9989638,0.0001529403,0.0003632467,0.0001852696,0.0000888204,0.0002459747],"domain_scores_gemma":[0.9985299,0.0001562076,0.0000513271,0.001071324,0.00007899258,0.0001122358],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001125626,0.0000757329,0.0001911786,0.000007079731,0.00000750354,8.927619e-7,0.0006974954,0.9957139,0.0006856113,0.0000700581,0.00001799278,0.002531414],"study_design_scores_gemma":[0.0002530589,0.00003600076,0.0003328826,0.00008522469,0.000009807359,0.000004298661,0.00004408381,0.9985409,0.0002926953,0.00003591691,0.000161971,0.0002032003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03093136,0.0002569944,0.9677058,0.00005623091,0.0002204346,0.0003568086,0.000002754989,0.0003543147,0.0001152882],"genre_scores_gemma":[0.4395495,0.00006072699,0.5601937,0.00006586768,0.00004332351,0.00003169166,0.0000226084,0.00003096724,0.000001578237],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4086182,"threshold_uncertainty_score":0.7755952,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.08279356799581435,"gpt":0.3382840073593413,"spread":0.255490439363527,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001473278,0.0001704965,0.0002896017,0.0003572347,0.0001878565,0.0006665214,0.0023504,0.00007650951,0.000001434749],"category_scores_gemma":[0.00005799347,0.0001693352,0.0001353343,0.0009303316,0.00009550942,0.0001931807,0.0004525153,0.0002373285,0.00002276924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009725486,"about_ca_system_score_gemma":0.0002039433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001055871,"about_ca_topic_score_gemma":0.0002176261,"domain_scores_codex":[0.9983002,0.0004055424,0.0004411086,0.0003818464,0.0001658993,0.0003054005],"domain_scores_gemma":[0.9948012,0.002439772,0.00006613926,0.002473362,0.0001551824,0.00006430833],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001688244,0.0004085182,0.03168032,0.000908125,0.000252423,0.00003166735,0.002154762,0.05431549,0.0001553389,0.5862857,0.01469814,0.3090926],"study_design_scores_gemma":[0.0002175339,0.0000409674,0.008845316,0.0001600362,0.000004070493,0.000006192543,0.000009363156,0.894304,0.00002480599,0.002789735,0.0934082,0.0001897674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001082422,0.005298215,0.987087,0.00395157,0.001238788,0.0003533047,0.00002272234,0.0004638009,0.0005021451],"genre_scores_gemma":[0.6429974,0.00009748332,0.3562802,0.0002617033,0.0001106007,0.0001373698,0.00003297584,0.0000181513,0.00006411903],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8399885,"threshold_uncertainty_score":0.690529,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05779073383115754,"gpt":0.312310220426785,"spread":0.2545194865956275,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001725712,0.0002255478,0.0003522433,0.0002343166,0.0002636701,0.0002408581,0.01059752,0.0001308886,0.00001646054],"category_scores_gemma":[0.0003373727,0.0002401329,0.0001030746,0.00209731,0.000160594,0.0003131844,0.009449704,0.0002656931,0.0001208254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002831187,"about_ca_system_score_gemma":0.00008039468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002730335,"about_ca_topic_score_gemma":0.0002919918,"domain_scores_codex":[0.9974029,0.00009659367,0.0006890093,0.0005669655,0.0007047318,0.0005398224],"domain_scores_gemma":[0.9903646,0.0005614285,0.000180258,0.007534148,0.001123948,0.0002356071],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001973776,0.0008579461,0.03543973,0.00008925692,0.000160123,0.00001324941,0.003696323,0.009445835,0.0002930864,0.4409696,0.3267556,0.1822594],"study_design_scores_gemma":[0.0005248731,0.0003723027,0.1547676,0.0003211036,0.00002547258,0.00006308272,0.000335624,0.4056737,0.0006217588,0.007247536,0.4289618,0.001085026],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01358484,0.000225005,0.9696263,0.008838929,0.0005735644,0.000556735,0.0001457269,0.0009562717,0.005492603],"genre_scores_gemma":[0.5618584,0.000002950694,0.4376461,0.0002298008,0.00004884685,0.00004500607,0.00003566599,0.000009029437,0.0001242274],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5482735,"threshold_uncertainty_score":0.9985617,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05402245004381441,"gpt":0.2640879852222824,"spread":0.210065535178468,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003791332,0.0001623603,0.000196227,0.0001021158,0.001551107,0.0001154632,0.002786593,0.00009411527,0.000006595245],"category_scores_gemma":[0.00002299352,0.0001657855,0.0001468906,0.0006150591,0.0001998682,0.0005672449,0.001711658,0.0003109958,0.00003050993],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004748219,"about_ca_system_score_gemma":0.00006537954,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009815785,"about_ca_topic_score_gemma":0.0000363628,"domain_scores_codex":[0.9985657,0.000212339,0.0003630795,0.0003355921,0.0001529362,0.0003704007],"domain_scores_gemma":[0.9961612,0.000747215,0.0001434402,0.002634336,0.0002012369,0.0001125754],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007807281,0.0001201573,0.0000465323,0.000011535,0.00003088912,0.000001576003,0.002329026,0.04831776,0.00001964085,0.8665665,0.004809571,0.07773904],"study_design_scores_gemma":[0.0002060578,0.00007718047,0.0001012965,0.00003377811,0.000006211333,0.00006360366,0.000004716941,0.8235108,0.00003643204,0.1537924,0.02200153,0.0001659541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00274804,0.0006614001,0.9917239,0.001406918,0.0006158298,0.0003961964,0.000002220286,0.000473093,0.001972416],"genre_scores_gemma":[0.5958242,0.0004182518,0.4026646,0.0006260473,0.0002991349,0.0001013428,0.000009624425,0.00001315572,0.00004365714],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.775193,"threshold_uncertainty_score":0.9997488,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.09491792874771247,"gpt":0.3503298570391113,"spread":0.2554119282913988,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001860361,0.0003152431,0.0003334769,0.0002684733,0.001064571,0.0007452376,0.00448017,0.0000930348,0.00000266683],"category_scores_gemma":[0.001147875,0.0003237751,0.0001133938,0.0007496486,0.0002206462,0.0007967215,0.0009930019,0.0003991083,0.00002728166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001304005,"about_ca_system_score_gemma":0.0003447876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003231341,"about_ca_topic_score_gemma":0.00008916064,"domain_scores_codex":[0.996898,0.0009372364,0.0008768738,0.0005759721,0.0003120683,0.0003998672],"domain_scores_gemma":[0.9899274,0.003356549,0.000638891,0.004930926,0.001007921,0.0001382873],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004351852,0.001388588,0.003788612,0.000213782,0.0001830683,0.000009275113,0.009546468,0.01480222,0.0009267327,0.2501138,0.005030215,0.7139537],"study_design_scores_gemma":[0.0004101117,0.0001285546,0.0004587311,0.0001888912,0.000008887507,0.00003988642,0.00000893341,0.6320021,0.0007784809,0.3627016,0.002955728,0.0003181353],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00128715,0.0002863347,0.9854382,0.001013606,0.00008570585,0.006809618,0.00001946084,0.00449304,0.0005669271],"genre_scores_gemma":[0.400666,0.00004403188,0.591543,0.000361403,0.000008809596,0.007145124,0.00004536058,0.00002677021,0.0001594815],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7136356,"threshold_uncertainty_score":0.9999214,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02965019819475488,"gpt":0.2785498543602004,"spread":0.2488996561654455,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003647548,0.0001108495,0.0001359107,0.0002080988,0.0001320116,0.00005697347,0.0003517461,0.00005013363,8.422075e-7],"category_scores_gemma":[0.00000989669,0.0001257995,0.00004107792,0.000330286,0.00002432466,0.00014291,0.0002178244,0.0001744354,0.000003549959],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003124064,"about_ca_system_score_gemma":0.00000535809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004745148,"about_ca_topic_score_gemma":0.00002614313,"domain_scores_codex":[0.9993525,0.00004308077,0.0002428263,0.0001458053,0.00005198341,0.0001638375],"domain_scores_gemma":[0.9992043,0.0001395858,0.00002561559,0.0005623746,0.00002986313,0.00003827891],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001543204,0.0000205747,0.00001078562,0.00002335047,0.00002221705,3.008527e-7,0.00009533712,0.6912138,0.00006440079,0.0001488824,0.009129737,0.2992691],"study_design_scores_gemma":[0.00033994,0.00001411157,0.00344938,0.00005941835,0.00001692944,0.000004747685,0.00001530964,0.9820891,0.000007055663,0.00001771215,0.01388383,0.0001024679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003805286,0.0002953081,0.9905113,0.0004647024,0.0002225946,0.0004564134,0.00002786581,0.004124342,0.00009220617],"genre_scores_gemma":[0.6547492,0.0008572309,0.3434963,0.00008703093,0.00009379807,0.00034424,0.0003212132,0.00003206267,0.00001895902],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6509439,"threshold_uncertainty_score":0.5129955,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04040951515697943,"gpt":0.2644876302538345,"spread":0.224078115096855,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002902617,0.0001569569,0.0001720136,0.0001361027,0.000321525,0.0002327651,0.002392291,0.00007252993,0.000003279599],"category_scores_gemma":[0.000008257261,0.0001303739,0.00004043855,0.0005149973,0.00009227198,0.0008725695,0.002506929,0.0001277776,0.00000313688],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006922783,"about_ca_system_score_gemma":0.00001918908,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006400131,"about_ca_topic_score_gemma":0.00006827608,"domain_scores_codex":[0.9986454,0.0002731494,0.0003828737,0.0003080701,0.0001384912,0.0002519975],"domain_scores_gemma":[0.9966891,0.0004150335,0.0001158407,0.002624168,0.00009393293,0.00006187864],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003666817,0.0001161202,0.0003653638,0.000004729866,0.00003345721,0.00000166164,0.0004069555,0.5287912,9.662346e-7,0.2648628,0.001039001,0.204374],"study_design_scores_gemma":[0.0004792961,0.00001832738,0.0002397457,0.0001737447,0.000007344433,0.000009449139,0.00001548497,0.98116,9.779495e-7,0.01469103,0.00303215,0.0001724569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001413999,0.00366097,0.9892399,0.005647842,0.0001050713,0.0001348659,7.535539e-7,0.0002044436,0.0008647696],"genre_scores_gemma":[0.36143,0.01868422,0.6191671,0.0005745763,0.00003163229,0.0000564205,0.00001093083,0.00001226967,0.00003279973],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4523688,"threshold_uncertainty_score":0.5316495,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01733865855328208,"gpt":0.2396521749782382,"spread":0.2223135164249561,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0007808473,0.0001308285,0.0001646537,0.000033278,0.001422839,0.0001535424,0.006630089,0.00006360062,0.000005146665],"category_scores_gemma":[0.00001488315,0.0000878147,0.0001075124,0.000940104,0.0001758126,0.0002954717,0.01053716,0.0004456196,0.00004450109],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003911677,"about_ca_system_score_gemma":0.00003448999,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004350381,"about_ca_topic_score_gemma":0.00007364693,"domain_scores_codex":[0.9985337,0.0003722075,0.0002941119,0.0002834573,0.0002274295,0.0002890824],"domain_scores_gemma":[0.994713,0.0007477679,0.0001855094,0.004110391,0.0001751,0.00006822331],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000100205,0.00006803267,0.0008218024,0.000005926319,0.00003973472,3.423648e-7,0.003504172,0.8203336,0.00005131699,0.0693856,0.009151609,0.09662786],"study_design_scores_gemma":[0.0001139026,0.00008181253,0.002502481,0.00004803157,0.000007124578,0.000002151367,0.00003002194,0.9546604,0.000035975,0.0006757471,0.04172033,0.000122025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01945324,0.0007378206,0.9687964,0.006816371,0.001291131,0.0006282098,0.000001149074,0.0001124335,0.002163234],"genre_scores_gemma":[0.940633,0.0003106219,0.05615201,0.002579416,0.0002024292,0.00001918444,0.00000269371,0.000006914938,0.00009370709],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9211798,"threshold_uncertainty_score":0.9998772,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02318984985247981,"gpt":0.2457265522774546,"spread":0.2225367024249748,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005258651,0.000152471,0.0002369371,0.0001934689,0.000702482,0.00006052329,0.002329886,0.00003241883,0.00001540112],"category_scores_gemma":[0.00001062162,0.0001754501,0.0001246134,0.00105592,0.00007410911,0.0002089584,0.001629616,0.0002792692,0.000003202561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001201678,"about_ca_system_score_gemma":0.0001113722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004570144,"about_ca_topic_score_gemma":0.00001476679,"domain_scores_codex":[0.9983447,0.0003328242,0.0004824377,0.0003291922,0.0002109256,0.0002998913],"domain_scores_gemma":[0.9969394,0.0006963295,0.0002039039,0.001975152,0.0001182074,0.00006706748],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006160128,0.0003370955,0.0003808464,0.000002937197,0.00002791143,0.000001184901,0.0001993812,0.8849008,0.000001191208,0.009031964,0.01371667,0.09139384],"study_design_scores_gemma":[0.0006764028,0.0003207594,0.0006396957,0.00002106192,0.00001352063,0.0000134892,0.00002447159,0.9760515,0.000002292608,0.00128118,0.02078365,0.0001719603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004295922,0.0008108016,0.9955697,0.001270061,0.001057286,0.000537466,0.00004970719,0.0002020647,0.00007333927],"genre_scores_gemma":[0.1878273,0.00009980459,0.8102376,0.0006637251,0.000196599,0.0006604817,0.0002250076,0.00002589642,0.0000635007],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1873977,"threshold_uncertainty_score":0.7154649,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0789533535320445,"gpt":0.2597017871770721,"spread":0.1807484336450276,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000123015,0.00009658743,0.0001538959,0.000040306,0.0001272332,0.00001496373,0.0006821641,0.00004490207,0.00003668576],"category_scores_gemma":[0.000004768928,0.0001016988,0.00005819348,0.0001968432,0.0000676059,0.00009618947,0.0002703913,0.0001246465,0.000007777532],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001957929,"about_ca_system_score_gemma":0.00001052862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006407057,"about_ca_topic_score_gemma":0.00002109851,"domain_scores_codex":[0.9993827,0.00004293133,0.0002641553,0.00009063485,0.00005867897,0.0001608646],"domain_scores_gemma":[0.9987493,0.00007864934,0.00005177964,0.001016327,0.00006395943,0.00004004415],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000107061,0.00004044016,0.0006936542,0.00001651508,0.00005609739,6.752735e-7,0.002452139,0.9530813,0.00059458,0.008527332,0.0001113115,0.03442493],"study_design_scores_gemma":[0.0000506527,0.00004202705,0.0004555833,0.00006978946,0.00001548003,0.000006938817,0.00009245054,0.9963615,0.001531293,0.0005722701,0.0006687713,0.0001332756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1159343,0.001661163,0.8805077,0.000004158095,0.0002277288,0.0001350172,0.000001950644,0.000143192,0.00138478],"genre_scores_gemma":[0.7804078,0.0001137231,0.219369,0.00001441455,0.00005599972,0.00001131903,0.000004616593,0.00001697231,0.000006167675],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6644735,"threshold_uncertainty_score":0.4147157,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}