{"meta":{"query_hash":"d3b7d40aee05","filters":{"venue":"Computer Communications"},"cohort_total":189,"direct_labels_cover":0,"predictions_cover":189,"exported":189,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/d3b7d40aee05","api":"https://metacan.xera.ac/api/v1/cohort?venue=Computer+Communications"},"results":[{"id":"W1163710461","doi":"10.1016/j.comcom.2015.08.006","title":"Performance of the MAC protocol in wireless recharging under E-limited scheduling","year":2015,"lang":"en","type":"article","venue":"Computer Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Science Council","keywords":"Computer science; Polling; Computer network; Scheduling (production processes); Network packet; Queueing theory; Wireless; Probabilistic logic; Wireless sensor network; Real-time computing; Telecommunications","score_opus":0.054944744507932096,"score_gpt":0.2694635796143856,"score_spread":0.2145188351064535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1163710461","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9488458,0.0008200208,0.04041268,0.00070029875,0.00018426773,0.00006524406,0.0001473609,0.0005685955,0.008255728],"genre_scores_gemma":[0.9980563,0.000060695922,0.0013288809,0.00003176324,0.0000127868425,0.000009385508,0.000027130895,0.000012996222,0.000460203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984962,0.00045730872,0.00007913864,0.0001798944,0.00030448474,0.00048296293],"domain_scores_gemma":[0.9839302,0.012373066,0.00086944085,0.0008175512,0.0015917815,0.0004178848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004178863,0.00065154606,0.00086281495,0.0008042805,0.0008773479,0.0013950253,0.00083590753,0.0007631494,0.0017853854],"category_scores_gemma":[0.012662433,0.00026631483,0.0002182325,0.0007096866,0.0012449262,0.001308976,0.0008968133,0.0006648435,0.00016309448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0053665712,0.00053291954,0.005857125,0.00020517348,0.000107625136,0.00025643458,0.00019289767,0.91688687,0.023644056,0.008171479,0.001831325,0.03694746],"study_design_scores_gemma":[0.00005660437,0.00036342285,0.0014641103,0.000007911803,0.000030483074,0.000046841138,0.000084943,0.9924199,0.004049487,0.0013425262,0.000119759476,0.000013968418],"about_ca_topic_score_codex":0.0065783947,"about_ca_topic_score_gemma":0.0041966527,"teacher_disagreement_score":0.0065783947,"about_ca_system_score_codex":0.001539981,"about_ca_system_score_gemma":0.002441982,"threshold_uncertainty_score":0.02210021},"labels":[],"label_agreement":null},{"id":"W1182960591","doi":"10.1016/j.comcom.2015.08.003","title":"A compression approach to reducing power consumption of TCAMs in regular expression matching","year":2015,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Natural Science Foundation of China","keywords":"Computer science; Regular expression; Throughput; Parallel computing; Content-addressable memory; Matching (statistics); Set (abstract data type); Artificial intelligence; Operating system","score_opus":0.06838275011301369,"score_gpt":0.2977764274054741,"score_spread":0.2293936772924604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1182960591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062631376,0.0011255855,0.9193288,0.00049385004,0.0002103369,0.00022948206,0.0001976375,0.0035141509,0.012268809],"genre_scores_gemma":[0.57654685,0.00075851905,0.40820575,0.00057582394,0.00018782078,0.00022300887,0.00049012405,0.0004506489,0.012561471],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936813,0.00010323093,0.00004050887,0.00007095411,0.00033624546,0.00008095706],"domain_scores_gemma":[0.9990163,0.0003027567,0.000058786725,0.00035945667,0.00023871173,0.000023966144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003619037,0.0006413315,0.0005045848,0.0009372664,0.00053830515,0.0006852389,0.0014083245,0.00047932233,0.00529049],"category_scores_gemma":[0.0022258128,0.0002863087,0.0004247546,0.0016401767,0.00042830457,0.0012894198,0.000595673,0.0006858017,0.0008487619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052735634,0.00023165085,0.0009565961,0.0002790264,0.00007713036,0.00031299287,0.00024579838,0.09884406,0.091782115,0.053568937,0.010762779,0.7424116],"study_design_scores_gemma":[0.00008176501,0.00046242037,0.00072774926,0.00006491937,0.00009390913,0.0006302378,0.00010358159,0.8059693,0.13862227,0.03228544,0.020920802,0.000037549024],"about_ca_topic_score_codex":0.001878302,"about_ca_topic_score_gemma":0.003851679,"teacher_disagreement_score":0.00529049,"about_ca_system_score_codex":0.0006034154,"about_ca_system_score_gemma":0.0010512583,"threshold_uncertainty_score":0.017698407},"labels":[],"label_agreement":null},{"id":"W1183861445","doi":"10.1016/j.comcom.2015.08.010","title":"A real-time lane marking localization, tracking and communication system","year":2015,"lang":"en","type":"article","venue":"Computer Communications","topic":"Autonomous Vehicle Technology and Safety","field":"Engineering","cited_by":72,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Hough transform; Computer vision; Artificial intelligence; Line (geometry); Kalman filter; Tracking (education); Filter (signal processing); Probabilistic logic; Tracking system; Pattern recognition (psychology); Image (mathematics)","score_opus":0.021138602947175022,"score_gpt":0.22406486004019147,"score_spread":0.20292625709301645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1183861445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12965073,0.000469359,0.80189437,0.00041528966,0.0007267453,0.00074329344,0.0012745002,0.04764515,0.0171806],"genre_scores_gemma":[0.73055834,0.00024526787,0.23319179,0.0007138357,0.0002565299,0.000797703,0.0023631933,0.00032534142,0.03154802],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995121,0.000041797903,0.000027834645,0.00014779126,0.00021080469,0.000059679594],"domain_scores_gemma":[0.9994673,0.000046718804,0.000046345685,0.00008361124,0.00025222512,0.000103761355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044553683,0.00057883054,0.0010080746,0.0009910582,0.00080626033,0.00082522095,0.0016551197,0.0009834962,0.010313711],"category_scores_gemma":[0.0005019892,0.0003849829,0.00025449903,0.0006188364,0.00023636174,0.0008914286,0.0010886042,0.00053649954,0.005487718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021176846,0.0009930534,0.0068719136,0.00028667768,0.00012526446,0.0005762714,0.00026548925,0.013615005,0.35136643,0.0029304062,0.031049138,0.5898027],"study_design_scores_gemma":[0.0009039073,0.0035479662,0.01881052,0.000057013884,0.0003420944,0.0018918057,0.00017320107,0.7337511,0.16016275,0.0016846427,0.0783982,0.0002767753],"about_ca_topic_score_codex":0.0029192066,"about_ca_topic_score_gemma":0.0030299544,"teacher_disagreement_score":0.010313711,"about_ca_system_score_codex":0.0004722846,"about_ca_system_score_gemma":0.0012670773,"threshold_uncertainty_score":0.034502804},"labels":[],"label_agreement":null},{"id":"W1230326749","doi":"10.1016/j.comcom.2015.08.013","title":"Handover-related self-optimization in femtocells: A survey and an interaction study","year":2015,"lang":"en","type":"article","venue":"Computer Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Waterloo","funders":"Ministère de l'Education Nationale, de l'Enseignement Superieur et de la Recherche; Ministry of Higher Education and Scientific Research; Ministry of Education, Libya","keywords":"Femtocell; Handover; Computer science; Self-organizing network; Computer network; Optimization problem; MATLAB; Base station; Algorithm","score_opus":0.053987245070856095,"score_gpt":0.30087304709437435,"score_spread":0.24688580202351826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1230326749","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15879287,0.16675472,0.6233382,0.0014894182,0.00046487828,0.00011186334,0.00022748383,0.00019323606,0.048627313],"genre_scores_gemma":[0.9023254,0.055028867,0.034817863,0.00024900437,0.00078283384,0.0000519467,0.00022621089,0.000058982678,0.006458743],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999424,0.000204513,0.000028748564,0.000103322396,0.0001553691,0.00008412437],"domain_scores_gemma":[0.9984585,0.0011000007,0.00012767626,0.000085203355,0.0001828681,0.00004574821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007697087,0.0006547781,0.0011252487,0.00077526167,0.0004369783,0.0014713346,0.000804358,0.0008331168,0.0012745241],"category_scores_gemma":[0.0024206268,0.00022794136,0.00055524387,0.0022701835,0.0004148716,0.0011122258,0.00061586295,0.00044305183,0.0001924839],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019271506,0.0004922602,0.008206536,0.001617759,0.00029560167,0.00024637845,0.00020430516,0.44284445,0.0029743253,0.07313445,0.006143115,0.4636481],"study_design_scores_gemma":[0.000013289537,0.00023040538,0.004987682,0.00014375741,0.00011028666,0.00034881302,0.0002450761,0.94886744,0.001740272,0.029893078,0.013380727,0.000039123308],"about_ca_topic_score_codex":0.0011263641,"about_ca_topic_score_gemma":0.0009628669,"teacher_disagreement_score":0.0014713346,"about_ca_system_score_codex":0.00047410553,"about_ca_system_score_gemma":0.00051234214,"threshold_uncertainty_score":0.004263699},"labels":[],"label_agreement":null},{"id":"W1697178956","doi":"10.1016/j.comcom.2016.05.009","title":"Energy management in communication networks: a journey through modeling and optimization glasses","year":2016,"lang":"en","type":"article","venue":"Computer Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Energy consumption; Context (archaeology); The Internet; Energy management; Routing (electronic design automation); Distributed computing; Telecommunications; Computer network; Energy (signal processing); World Wide Web","score_opus":0.04040951515697943,"score_gpt":0.2644876302538345,"score_spread":0.22407811509685505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1697178956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013987995,0.07420609,0.8601379,0.028120352,0.000799637,0.000051253228,0.0003410018,0.0002545128,0.02210127],"genre_scores_gemma":[0.63053894,0.14426604,0.20331632,0.0025594863,0.0034199548,0.00027544005,0.0004868095,0.00033384972,0.014803138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900705,0.00046669377,0.00005127657,0.00012628124,0.0002829986,0.00006575859],"domain_scores_gemma":[0.9976503,0.001692073,0.00016438808,0.00015274086,0.00027369015,0.000066820576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002207772,0.0011971929,0.0019463847,0.0007972228,0.0004501291,0.0039767153,0.0015069642,0.0016958807,0.001738996],"category_scores_gemma":[0.0040717577,0.0008078164,0.0009119731,0.0015673364,0.0021562981,0.005809468,0.0012771897,0.00358001,0.00036274202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033068114,0.00008048778,0.00059218553,0.00034937466,0.00007574624,0.000031547497,0.00008454996,0.6243946,0.0003286356,0.32516465,0.005400616,0.043464586],"study_design_scores_gemma":[0.000008303155,0.000024854706,0.0002320842,0.00013563062,0.000017517348,0.000021089369,0.00009245297,0.69069976,0.00019684104,0.2953735,0.01317578,0.000022147953],"about_ca_topic_score_codex":0.006884531,"about_ca_topic_score_gemma":0.0051769763,"teacher_disagreement_score":0.006884531,"about_ca_system_score_codex":0.0026684527,"about_ca_system_score_gemma":0.0019593905,"threshold_uncertainty_score":0.019361079},"labels":[],"label_agreement":null},{"id":"W1964826331","doi":"10.1016/j.comcom.2008.08.026","title":"ODMCA: An adaptive data mining control algorithm in multicarrier networks","year":2008,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Data stream mining; Data stream; Controller (irrigation); PID controller; Stability (learning theory); Computation; Adaptability; Data transmission; Transmission (telecommunications); Real-time computing; Distributed computing; Data mining; Algorithm; Computer network; Telecommunications; Machine learning","score_opus":0.08629176346109502,"score_gpt":0.2839526139897091,"score_spread":0.1976608505286141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964826331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009424005,0.0003489004,0.98724455,0.00016766306,0.00010443112,0.00006809605,0.000093054165,0.002105381,0.0004439366],"genre_scores_gemma":[0.23623969,0.00021581016,0.76023716,0.00029744577,0.00011528407,0.00026005102,0.00031465784,0.0002049995,0.0021149267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992824,0.00013148051,0.00006166058,0.00018162037,0.0002697774,0.00007293412],"domain_scores_gemma":[0.99834836,0.00078389945,0.00012193233,0.00021446985,0.0004483867,0.000082804574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015676909,0.00062847155,0.0010739199,0.0012587472,0.0007854455,0.0010799807,0.0020703697,0.0007897617,0.0017831365],"category_scores_gemma":[0.0050300816,0.0004103004,0.00048138923,0.0012054445,0.00051486725,0.0011018226,0.0014066203,0.0013281646,0.00041075356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006161353,0.00018136641,0.002727729,0.00009939349,0.00012244114,0.00006201388,0.00007699528,0.13115756,0.0044195238,0.0062584155,0.0051003494,0.8491781],"study_design_scores_gemma":[0.000029180826,0.00002986044,0.00018017822,0.000004609563,0.000011057217,0.000023424833,0.000007241079,0.99379456,0.002067972,0.0024155548,0.0014305664,0.0000058313863],"about_ca_topic_score_codex":0.008216087,"about_ca_topic_score_gemma":0.008646328,"teacher_disagreement_score":0.008216087,"about_ca_system_score_codex":0.0007200375,"about_ca_system_score_gemma":0.0015945975,"threshold_uncertainty_score":0.0163365},"labels":[],"label_agreement":null},{"id":"W1968139495","doi":"10.1016/s0140-3664(01)00296-1","title":"An efficient location management scheme for PCS networks","year":2001,"lang":"en","type":"article","venue":"Computer Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"National Research Council Canada","keywords":"Computer science; Scheme (mathematics); Computer network; Telecommunications; Distributed computing","score_opus":0.05241319166920264,"score_gpt":0.33651487744287206,"score_spread":0.2841016857736694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968139495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06777447,0.00086122024,0.9139609,0.00062148314,0.0003853469,0.00038424434,0.0004192026,0.005117979,0.0104750935],"genre_scores_gemma":[0.75391847,0.00045959765,0.22473757,0.00015669163,0.0002211268,0.000273469,0.0006997932,0.00013042527,0.019402947],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884486,0.0002273092,0.00008793773,0.00016917063,0.00043098864,0.00023963938],"domain_scores_gemma":[0.99800676,0.00027960227,0.00017516663,0.0010117947,0.00040169622,0.00012507617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089085504,0.0007692541,0.0011967045,0.0012329321,0.0022468464,0.0016518822,0.002423731,0.0011476185,0.0043774005],"category_scores_gemma":[0.0026006238,0.00042853248,0.0003149666,0.0016360048,0.0007232367,0.0029239198,0.0035725706,0.0010294293,0.001677371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024840042,0.0004097557,0.001355363,0.00026683183,0.000084258674,0.00036963492,0.0005319439,0.106469214,0.074532494,0.11862696,0.031890776,0.6629788],"study_design_scores_gemma":[0.00031273585,0.0005630029,0.0008809623,0.000037997495,0.00014428902,0.00055014977,0.00030615175,0.87631905,0.03898359,0.043396655,0.038393993,0.00011150078],"about_ca_topic_score_codex":0.0031050132,"about_ca_topic_score_gemma":0.0047913864,"teacher_disagreement_score":0.0043774005,"about_ca_system_score_codex":0.0016230149,"about_ca_system_score_gemma":0.0014197438,"threshold_uncertainty_score":0.014643848},"labels":[],"label_agreement":null},{"id":"W1968845049","doi":"10.1016/j.comcom.2004.12.010","title":"Analysis of virtual-time complexity in weighted fair queuing","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Queueing theory; Real-time computing; Computer network","score_opus":0.03432446640692584,"score_gpt":0.2669674836539469,"score_spread":0.23264301724702108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968845049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21110594,0.0012325865,0.7755955,0.0014888312,0.00020039975,0.00010845887,0.00016749775,0.00026153013,0.009839209],"genre_scores_gemma":[0.96303445,0.0004367433,0.03229829,0.00014447127,0.0002371746,0.00008193378,0.00009170654,0.0001512819,0.0035239316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996479,0.0010901921,0.00010028739,0.000299402,0.0012544612,0.00077675557],"domain_scores_gemma":[0.95854294,0.035065826,0.001675344,0.0014790288,0.0022421519,0.0009947174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007032673,0.0010684722,0.0015816047,0.0016312855,0.0012034974,0.003544305,0.0032681124,0.0012030362,0.0035352325],"category_scores_gemma":[0.03804141,0.00085987383,0.00081643614,0.001692608,0.0024277915,0.006223964,0.0020342497,0.0025579385,0.00019602408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023944241,0.00012727587,0.0012268054,0.000090190755,0.000053102136,0.00007429339,0.00017646862,0.78267914,0.0019550205,0.20166583,0.0013279638,0.010384433],"study_design_scores_gemma":[0.000005473414,0.000008936676,0.00013388705,0.0000028300049,0.000007751829,0.000008839781,0.000008853871,0.971473,0.00014179049,0.028121183,0.00008193488,0.0000055410815],"about_ca_topic_score_codex":0.0065679695,"about_ca_topic_score_gemma":0.00479676,"teacher_disagreement_score":0.007032673,"about_ca_system_score_codex":0.005380414,"about_ca_system_score_gemma":0.0038355319,"threshold_uncertainty_score":0.039037764},"labels":[],"label_agreement":null},{"id":"W1969873693","doi":"10.1016/j.comcom.2013.02.002","title":"Reliability analysis of a channel restoration mechanism for opportunistic spectrum access","year":2013,"lang":"en","type":"article","venue":"Computer Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Reliability (semiconductor); Mechanism (biology); Channel (broadcasting); Reliability engineering; Computer network; Spectrum (functional analysis); Telecommunications","score_opus":0.06569505529225894,"score_gpt":0.3071792950027381,"score_spread":0.24148423971047916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969873693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15545556,0.0004942183,0.83757085,0.0005307311,0.00007193327,0.00012491221,0.00008631112,0.0003313307,0.0053341943],"genre_scores_gemma":[0.98333365,0.000119127435,0.015310948,0.000035305096,0.00004157078,0.000044417775,0.000024063494,0.00003650774,0.0010542904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799323,0.0007276605,0.00007149577,0.000213799,0.0006443033,0.00034948543],"domain_scores_gemma":[0.9835581,0.011146049,0.0011899037,0.0010998625,0.0027114826,0.00029465219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043731234,0.000737786,0.0010208271,0.0012402837,0.000625561,0.0012086608,0.0017590064,0.0008764271,0.0020067473],"category_scores_gemma":[0.017537156,0.00050024287,0.0005687794,0.0005826051,0.0012480804,0.0013287885,0.0009416985,0.0009871225,0.00023964231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006852683,0.0001189888,0.0017094415,0.00017036314,0.00008487153,0.000245206,0.00030949753,0.85234696,0.01296515,0.10355946,0.001576656,0.026228154],"study_design_scores_gemma":[0.000007601888,0.000053990014,0.00018590948,0.0000054639904,0.000018357025,0.000052190422,0.00001733109,0.9932607,0.0005480265,0.0057430384,0.00009994749,0.000007432323],"about_ca_topic_score_codex":0.003273569,"about_ca_topic_score_gemma":0.0016538147,"teacher_disagreement_score":0.0043731234,"about_ca_system_score_codex":0.0016300319,"about_ca_system_score_gemma":0.0015695647,"threshold_uncertainty_score":0.023127556},"labels":[],"label_agreement":null},{"id":"W1970417156","doi":"10.1016/s0140-3664(02)00238-4","title":"Evolutionary approach to optimize the assignment of cells to switches in personal communication networks","year":2003,"lang":"en","type":"article","venue":"Computer Communications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Heuristic; Mathematical optimization; Convergence (economics); Evolutionary algorithm; Optimization problem; Combinatorial optimization; Distributed computing; Artificial intelligence; Algorithm; Mathematics","score_opus":0.0186540089955976,"score_gpt":0.2036066731379924,"score_spread":0.1849526641423948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970417156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11122339,0.00054519216,0.8790629,0.00071409624,0.0001032493,0.00007900222,0.000052798692,0.00013715695,0.008082157],"genre_scores_gemma":[0.74585855,0.00037590932,0.24523446,0.00026178747,0.00007906383,0.00017504145,0.0000911866,0.00008362966,0.007840349],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997491,0.00012139804,0.000007510813,0.000025706964,0.00005371518,0.000042537453],"domain_scores_gemma":[0.9993538,0.00045301352,0.000038365204,0.000019839514,0.00010270176,0.00003221598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084638706,0.0005847954,0.00072949816,0.0008349415,0.00049456506,0.00063743023,0.00096540543,0.0012786174,0.0021678053],"category_scores_gemma":[0.0023334625,0.0004836962,0.00044803534,0.0007348582,0.0007041331,0.0006307034,0.0005429959,0.00069680315,0.00014350447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014674504,0.00001836818,0.00023714933,0.0000126024925,0.000016477305,0.000020348327,0.000026362968,0.98191077,0.00031932848,0.005068629,0.00031127862,0.012044006],"study_design_scores_gemma":[0.000007303542,0.000010062427,0.00005719475,0.0000022600345,0.0000047742237,0.000005384052,0.000008311479,0.99640095,0.0000962454,0.003242042,0.00016387313,0.0000016851898],"about_ca_topic_score_codex":0.00710256,"about_ca_topic_score_gemma":0.0062455162,"teacher_disagreement_score":0.00710256,"about_ca_system_score_codex":0.0010646381,"about_ca_system_score_gemma":0.0007947229,"threshold_uncertainty_score":0.0141224265},"labels":[],"label_agreement":null},{"id":"W1970968921","doi":"10.1016/j.comcom.2009.12.010","title":"Vehicular telematics over heterogeneous wireless networks: A survey","year":2010,"lang":"en","type":"article","venue":"Computer Communications","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":204,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Toronto Metropolitan University; University of British Columbia; University of Manitoba","funders":"","keywords":"Telematics; Computer science; Computer network; Vehicular ad hoc network; Wireless; Open research; Heterogeneous network; Wireless network; Telecommunications; Access control; Wireless ad hoc network; World Wide Web","score_opus":0.015016459038990793,"score_gpt":0.23249381761828936,"score_spread":0.21747735857929856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970968921","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015953718,0.78898877,0.1741372,0.0011122475,0.00090336474,0.00008959156,0.0001961089,0.00022502188,0.018393973],"genre_scores_gemma":[0.09554442,0.8723121,0.024098495,0.0003684196,0.002036634,0.00006714834,0.0003974155,0.000046553883,0.005128715],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99937975,0.00012352206,0.00007503397,0.00013238656,0.00022334108,0.00006586103],"domain_scores_gemma":[0.99862814,0.00084389636,0.00012161074,0.00008638433,0.0002680446,0.000051799536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000865381,0.000756828,0.0013259345,0.0019335265,0.00041210026,0.002604908,0.0012126537,0.001298765,0.0019784651],"category_scores_gemma":[0.0018023486,0.00053630344,0.00046434312,0.005818153,0.00042675002,0.003121437,0.0008636823,0.00071004283,0.0009830925],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008946233,0.00014388173,0.004483416,0.00308535,0.000120918376,0.00027200332,0.00014831968,0.023625132,0.0023809585,0.02027367,0.008613118,0.93676376],"study_design_scores_gemma":[0.000060263243,0.0006377509,0.00858224,0.002092976,0.0006324155,0.0051130517,0.0014845053,0.14388992,0.0076367483,0.059067648,0.77062446,0.00017784763],"about_ca_topic_score_codex":0.0017017039,"about_ca_topic_score_gemma":0.0014801958,"teacher_disagreement_score":0.002604908,"about_ca_system_score_codex":0.0005141532,"about_ca_system_score_gemma":0.0006800674,"threshold_uncertainty_score":0.006618619},"labels":[],"label_agreement":null},{"id":"W1971785410","doi":"10.1016/j.comcom.2005.01.013","title":"A new energy efficient and fault-tolerant protocol for data propagation in smart dust networks using varying transmission range","year":2005,"lang":"en","type":"article","venue":"Computer Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Protocol (science); Wireless sensor network; Fault tolerance; Transmission (telecommunications); Efficient energy use; Energy consumption; Data transmission; Range (aeronautics); Computer network; Propagation delay; Communications protocol; Real-time computing; Distributed computing; Telecommunications; Electrical engineering; Engineering","score_opus":0.08116099532961196,"score_gpt":0.32249232112719756,"score_spread":0.2413313257975856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971785410","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08337684,0.0008768239,0.9119102,0.0002956285,0.00029448833,0.00013168725,0.000056613033,0.0010654341,0.0019921975],"genre_scores_gemma":[0.7799105,0.0003769144,0.214984,0.00018388234,0.00011309124,0.00014738644,0.000117378026,0.00007933807,0.0040876037],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995036,0.00008409859,0.000044965043,0.00009165908,0.00021896529,0.00005664557],"domain_scores_gemma":[0.99894494,0.00033879568,0.00013509998,0.00022330842,0.00029112524,0.00006678565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007839309,0.0004476524,0.00076964055,0.00061954866,0.00084465364,0.0007421506,0.0019451486,0.0005708408,0.000767258],"category_scores_gemma":[0.0014209036,0.00021002664,0.00030641802,0.00044343335,0.00062308507,0.0016371952,0.001156431,0.0008002349,0.00020540919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015174159,0.00043950364,0.001880562,0.0004872216,0.00021585841,0.0007490881,0.0006587024,0.2166502,0.3259825,0.03919233,0.0072331033,0.40499347],"study_design_scores_gemma":[0.00011799024,0.0005114189,0.00050738483,0.000015156482,0.00011183841,0.00058509177,0.00008866168,0.9309263,0.05345946,0.005365787,0.008245422,0.000065388616],"about_ca_topic_score_codex":0.00082022906,"about_ca_topic_score_gemma":0.0019225092,"teacher_disagreement_score":0.0019451486,"about_ca_system_score_codex":0.0006261241,"about_ca_system_score_gemma":0.0004913138,"threshold_uncertainty_score":0.0045428276},"labels":[],"label_agreement":null},{"id":"W1971829800","doi":"10.1016/s0140-3664(02)00143-3","title":"Call admission control for wireless personal communications","year":2002,"lang":"en","type":"article","venue":"Computer Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Wireless; Computer network; Wireless network; Call Admission Control; Quality of service; Wireline; Wireless site survey; Telecommunications; Wi-Fi array","score_opus":0.0918478749385074,"score_gpt":0.3245223122840761,"score_spread":0.23267443734556867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971829800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043192502,0.0021843715,0.93286204,0.0017899455,0.0012330705,0.00024008525,0.00009948272,0.0021734152,0.016225124],"genre_scores_gemma":[0.9531011,0.00069925835,0.030082576,0.00032129016,0.00066542084,0.00017210402,0.000091785136,0.00010561442,0.014760804],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983854,0.0004091779,0.000057619443,0.00018806168,0.00054191856,0.00041780705],"domain_scores_gemma":[0.99722075,0.001610577,0.00016168914,0.00020968656,0.00059475703,0.00020252376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015421999,0.00095404335,0.0015253694,0.0007544538,0.0025330095,0.0027165574,0.001899012,0.0013741519,0.0080954265],"category_scores_gemma":[0.008265064,0.0003613337,0.000406219,0.0009411819,0.0013891232,0.001696441,0.0015307954,0.0027758926,0.00084204314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014488215,0.00060546875,0.001296902,0.00030199144,0.00012969719,0.00042069063,0.0006880855,0.33044004,0.019695038,0.19868067,0.03333337,0.41295928],"study_design_scores_gemma":[0.000046009045,0.00005256588,0.0002357599,0.000012894999,0.00003687497,0.00004878497,0.000040842417,0.96656734,0.0014448871,0.028898006,0.0025910023,0.000025033178],"about_ca_topic_score_codex":0.010985089,"about_ca_topic_score_gemma":0.010388677,"teacher_disagreement_score":0.010985089,"about_ca_system_score_codex":0.0018656381,"about_ca_system_score_gemma":0.0022039183,"threshold_uncertainty_score":0.027081847},"labels":[],"label_agreement":null},{"id":"W1972806349","doi":"10.1016/s0140-3664(00)00160-2","title":"A real-time residential gateway operating system","year":2000,"lang":"en","type":"article","venue":"Computer Communications","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Computer science; Gateway (web page); Real-time computing; Telecommunications; Computer network; Operating system; Embedded system; World Wide Web","score_opus":0.019829572885594407,"score_gpt":0.26044668360783085,"score_spread":0.24061711072223646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972806349","genre_codex":"empirical","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41787142,0.00078527385,0.2754335,0.00085755496,0.00087244785,0.0007749277,0.0014966354,0.24548087,0.056427352],"genre_scores_gemma":[0.86487836,0.00027685156,0.10230222,0.00038447115,0.00019952244,0.00017082081,0.0026223091,0.0034935693,0.025671823],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994337,0.00014002847,0.00003834332,0.00009890293,0.00019613058,0.00009293064],"domain_scores_gemma":[0.9984034,0.00022470843,0.0000737285,0.0005863572,0.00035853928,0.00035343645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010246724,0.0004876365,0.0005828536,0.0006473005,0.0005607546,0.0010255025,0.0021261626,0.0003780462,0.014626017],"category_scores_gemma":[0.0020643922,0.00028758662,0.00022861958,0.00063685887,0.00041549554,0.0008879141,0.0008225913,0.0008989893,0.0040472145],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0083076805,0.0027328448,0.012878771,0.00040576805,0.00020035435,0.0010629349,0.0012077631,0.044966355,0.13663372,0.02759353,0.2027923,0.56121796],"study_design_scores_gemma":[0.001548271,0.0019655686,0.0099972235,0.00004831359,0.00023358638,0.0009088662,0.000366539,0.73791724,0.08912273,0.009567839,0.14815024,0.00017364693],"about_ca_topic_score_codex":0.0023423522,"about_ca_topic_score_gemma":0.001935742,"teacher_disagreement_score":0.014626017,"about_ca_system_score_codex":0.00064018974,"about_ca_system_score_gemma":0.001113655,"threshold_uncertainty_score":0.048928916},"labels":[],"label_agreement":null},{"id":"W1973540464","doi":"10.1016/j.comcom.2009.08.015","title":"Towards cross layer mobility support in metropolitan networks","year":2009,"lang":"en","type":"article","venue":"Computer Communications","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Roaming; Computer science; Computer network; Mobility management; Metropolitan area; Homogeneous; Quality of service; Mobility model; Heterogeneous network; Wireless network; Wireless; Distributed computing; Telecommunications","score_opus":0.026366328586720538,"score_gpt":0.2955830949233269,"score_spread":0.26921676633660635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973540464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111706674,0.0076531726,0.83894706,0.0049395636,0.0006515574,0.00011176718,0.000104040664,0.001871003,0.034015246],"genre_scores_gemma":[0.7933138,0.0069161886,0.18264256,0.00052344723,0.00057976204,0.00009393354,0.00030591717,0.000120117154,0.0155043565],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964035,0.000103116465,0.000024097806,0.000029819004,0.0001361415,0.00006660424],"domain_scores_gemma":[0.99924433,0.00021969948,0.000055262706,0.000195478,0.00022403328,0.000061222534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017383379,0.00037028088,0.00026861727,0.00041048738,0.00039055044,0.0018641895,0.0009212159,0.00083632936,0.002679828],"category_scores_gemma":[0.0024409494,0.0003607274,0.00015025432,0.00034613346,0.00048651107,0.003163789,0.0019415221,0.0013813187,0.0008907821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005344426,0.00023987533,0.0032175812,0.00042734682,0.000074893236,0.00054172653,0.001343228,0.04746219,0.10327456,0.4055402,0.014305633,0.42303833],"study_design_scores_gemma":[0.000054651086,0.00033271153,0.0017339828,0.00023084022,0.000089460606,0.0005814003,0.000739713,0.65758675,0.0435688,0.12949848,0.16553864,0.00004463483],"about_ca_topic_score_codex":0.0006869157,"about_ca_topic_score_gemma":0.0006918309,"teacher_disagreement_score":0.002679828,"about_ca_system_score_codex":0.0003310043,"about_ca_system_score_gemma":0.00035919074,"threshold_uncertainty_score":0.009193301},"labels":[],"label_agreement":null},{"id":"W1976181481","doi":"10.1016/s0140-3664(00)00185-7","title":"Design and analysis of per-flow queueing switches and VC-merge switches based on per-VC queueing architecture","year":2000,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Queueing theory; Merge (version control); Layered queueing network; Weighted fair queueing; Mean value analysis; Queueing system; Architecture; Computer network; Parallel computing","score_opus":0.018952602545834106,"score_gpt":0.2349403952438114,"score_spread":0.2159877926979773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976181481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053949796,0.0006811761,0.93813574,0.00020042418,0.00011915147,0.00024428763,0.00010297627,0.0010357988,0.005530655],"genre_scores_gemma":[0.84770465,0.0004242696,0.14884746,0.0001323917,0.000096359545,0.00018951506,0.00010181198,0.000069155365,0.002434349],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912816,0.00019649592,0.000030675197,0.0001225567,0.00034731504,0.00017481309],"domain_scores_gemma":[0.998901,0.00036097682,0.00011712966,0.00010145179,0.00044491465,0.000074450225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014724103,0.0007750634,0.00089890364,0.0008032202,0.0007535061,0.0016077858,0.0025942558,0.00057594053,0.0029478592],"category_scores_gemma":[0.001514547,0.0005637562,0.0005392513,0.00074314425,0.0005608115,0.0010551648,0.0005148052,0.0008430106,0.00030953565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048439854,0.00032328023,0.0019552703,0.00023499319,0.00018727769,0.00011526647,0.00013693965,0.78353375,0.038677394,0.08133144,0.0032098063,0.089810215],"study_design_scores_gemma":[0.000019266135,0.000091051625,0.0002287353,0.000004629366,0.000038117458,0.000030168809,0.0000086321315,0.99110764,0.0043788655,0.0033451938,0.0007383729,0.000009420553],"about_ca_topic_score_codex":0.004790925,"about_ca_topic_score_gemma":0.0062375134,"teacher_disagreement_score":0.004790925,"about_ca_system_score_codex":0.0026041858,"about_ca_system_score_gemma":0.0028425853,"threshold_uncertainty_score":0.018894792},"labels":[],"label_agreement":null},{"id":"W1978172438","doi":"10.1016/j.comcom.2004.07.014","title":"Editorial for the special issue of computer communications ‘performance issues of wireless LANs, PANs, and Ad Hoc networks’","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Wireless ad hoc network; Computer network; Telecommunications; Wireless; Wireless lan; Computer security","score_opus":0.019965872658338917,"score_gpt":0.26309069918131034,"score_spread":0.24312482652297143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978172438","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003941816,0.0036067783,0.00016209943,0.018437335,0.9769544,0.000015418864,0.000032818625,0.000043003143,0.00070878776],"genre_scores_gemma":[0.00031497897,0.0023656362,0.000087466586,0.011245433,0.9824723,0.000012660236,0.000026014826,0.00002390314,0.0034515522],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9951325,0.0008029128,0.00080628745,0.0007573979,0.0021269869,0.00037386245],"domain_scores_gemma":[0.9630893,0.014132213,0.0027005118,0.00092272146,0.015050478,0.004104727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064121764,0.00456279,0.0069347,0.004538925,0.0023540547,0.0072979084,0.0044519627,0.015123098,0.014281208],"category_scores_gemma":[0.022335082,0.001703392,0.004059933,0.0020898478,0.002546184,0.0045315344,0.0011418322,0.020526953,0.010725895],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062305015,0.000021694046,0.00003589256,0.00025407368,0.000031027073,0.000102134865,0.0000085311285,0.000035326633,0.00008895169,0.0002557911,0.99419594,0.0049083284],"study_design_scores_gemma":[0.00013374681,0.000133515,0.0007959843,0.00043161857,0.00014071394,0.00055596273,0.00004675808,0.0004154669,0.0002614361,0.0012953868,0.99575233,0.00003699504],"about_ca_topic_score_codex":0.0010532481,"about_ca_topic_score_gemma":0.0028297822,"teacher_disagreement_score":0.015123098,"about_ca_system_score_codex":0.0018132015,"about_ca_system_score_gemma":0.0017803184,"threshold_uncertainty_score":0.047775447},"labels":[],"label_agreement":null},{"id":"W1978433263","doi":"10.1016/j.comcom.2004.07.006","title":"Assigning cells to switches in mobile networks using an ant colony optimization heuristic","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Ant colony optimization algorithms; Heuristic; Mathematical optimization; Optimization problem; Metaheuristic; Algorithm; Artificial intelligence; Mathematics","score_opus":0.04141503808203103,"score_gpt":0.29967456980762996,"score_spread":0.25825953172559896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978433263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25527343,0.0005395638,0.7293118,0.00047394776,0.00023885813,0.00034971192,0.000094556526,0.00065031176,0.013067743],"genre_scores_gemma":[0.79641694,0.00018696573,0.19909671,0.00012758639,0.000039458064,0.00016447777,0.000072528266,0.000082383594,0.003812921],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995894,0.00014877807,0.000014693617,0.00006482652,0.00007634688,0.000106022715],"domain_scores_gemma":[0.99918014,0.00049996463,0.00007762631,0.00005050335,0.00010268008,0.00008908257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006772329,0.00089273124,0.0011971223,0.0010375412,0.0011196326,0.0014163029,0.0015545439,0.0013413037,0.0029244716],"category_scores_gemma":[0.0016429253,0.0007576134,0.0006117486,0.0013185291,0.00087751384,0.001049526,0.0008110451,0.0006880984,0.00029629166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012228894,0.00009038363,0.0003426899,0.000029334735,0.000024610667,0.00005363343,0.000054651788,0.9687849,0.0015346904,0.0041496693,0.0008108646,0.024002207],"study_design_scores_gemma":[0.000018706876,0.00003372264,0.000045831745,0.0000026993412,0.00000956214,0.0000079684805,0.000025464555,0.9976884,0.00034120216,0.0016250965,0.00019833642,0.0000030079802],"about_ca_topic_score_codex":0.008579115,"about_ca_topic_score_gemma":0.012066534,"teacher_disagreement_score":0.008579115,"about_ca_system_score_codex":0.0010085674,"about_ca_system_score_gemma":0.0011430554,"threshold_uncertainty_score":0.017058313},"labels":[],"label_agreement":null},{"id":"W1978642186","doi":"10.1016/j.comcom.2007.08.037","title":"Quality of service based resource allocation for scheduled lightpath demands","year":2007,"lang":"en","type":"article","venue":"Computer Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Backup; Integer programming; Computer network; Heuristic; Quality of service; Routing (electronic design automation); Resource allocation; Path (computing); Linear programming; Service (business); Idle; Path protection; Metric (unit); Mathematical optimization; Distributed computing; Wavelength-division multiplexing; Algorithm; Wavelength; Mathematics","score_opus":0.04868393157740157,"score_gpt":0.3092076100395707,"score_spread":0.2605236784621691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978642186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43991497,0.0006480391,0.54559547,0.0007730296,0.00032261995,0.00023401258,0.00031643876,0.0007986962,0.011396751],"genre_scores_gemma":[0.9824331,0.00005810462,0.0164668,0.00003873146,0.000050122377,0.000022060798,0.00005518617,0.000031601357,0.0008443383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898213,0.00025090968,0.000039954797,0.00012776759,0.0002759067,0.00032316954],"domain_scores_gemma":[0.9977818,0.0010024094,0.00023409941,0.00017079402,0.00059982686,0.00021107148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015755557,0.00063120946,0.0008445012,0.0008023966,0.0007476396,0.0017328416,0.0013028794,0.0005695381,0.0031751012],"category_scores_gemma":[0.004540688,0.0003570486,0.00031177944,0.0010296097,0.0004343524,0.0010381038,0.0005859358,0.0006750144,0.00031015184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019644925,0.00042309493,0.003103297,0.00012415927,0.0000706679,0.00015061103,0.00014500624,0.79815876,0.032566346,0.019178743,0.0042961696,0.13981868],"study_design_scores_gemma":[0.000019866415,0.00009282595,0.0006740758,0.0000027989788,0.000010393936,0.000024707677,0.000024300576,0.9939407,0.0017333431,0.0032249452,0.0002443584,0.000007587089],"about_ca_topic_score_codex":0.0034835765,"about_ca_topic_score_gemma":0.006296602,"teacher_disagreement_score":0.0034835765,"about_ca_system_score_codex":0.0015842393,"about_ca_system_score_gemma":0.0013792601,"threshold_uncertainty_score":0.011494577},"labels":[],"label_agreement":null},{"id":"W1979635763","doi":"10.1016/j.comcom.2007.08.012","title":"Global stability of Peer-to-Peer file sharing systems","year":2007,"lang":"en","type":"article","venue":"Computer Communications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"BitTorrent; Computer science; File sharing; Stability (learning theory); Peer-to-peer; BitTorrent tracker; Distributed computing; File system; Simple (philosophy); Computer network; World Wide Web; The Internet; Operating system","score_opus":0.057790733831157536,"score_gpt":0.31231022042678497,"score_spread":0.25451948659562745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979635763","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6610599,0.0019319016,0.31610516,0.0016620958,0.00019598007,0.00010855599,0.000579044,0.0009220996,0.017435178],"genre_scores_gemma":[0.9941766,0.00024187822,0.003966258,0.00002707837,0.000056622535,0.00003973235,0.00014229896,0.00005361466,0.001295816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985973,0.00037983726,0.000057953708,0.00028787323,0.00042250112,0.00025448494],"domain_scores_gemma":[0.99019086,0.005357818,0.001043526,0.0010027196,0.0017952254,0.0006098925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018589594,0.0004436213,0.0013784728,0.0014158909,0.0016178248,0.0028327277,0.001231085,0.0010147024,0.003019598],"category_scores_gemma":[0.01585975,0.0003300042,0.00033263917,0.0014338891,0.0016407813,0.003557316,0.002016074,0.000929408,0.00053798687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013858469,0.0001700636,0.012841509,0.00032754056,0.0002003818,0.0005914325,0.001285683,0.56204075,0.01788568,0.29393166,0.0094593745,0.09988014],"study_design_scores_gemma":[0.000058609345,0.00013729416,0.0035824664,0.00002287876,0.000050485785,0.00022498757,0.0003948459,0.82922935,0.0034273493,0.16010843,0.0027268007,0.000036474168],"about_ca_topic_score_codex":0.0012913063,"about_ca_topic_score_gemma":0.0006546664,"teacher_disagreement_score":0.003019598,"about_ca_system_score_codex":0.0010086106,"about_ca_system_score_gemma":0.00087211735,"threshold_uncertainty_score":0.010101557},"labels":[],"label_agreement":null},{"id":"W1980714833","doi":"10.1016/s0140-3664(00)00189-4","title":"Towards a generic real-time transport and adaptation protocol for IP networks","year":2000,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Interoperability; Software portability; Protocol (science); Flexibility (engineering); Adaptation (eye); Quality of service; Distributed computing; Leverage (statistics); Concurrency; Embedded system; Computer architecture; Computer network; Operating system","score_opus":0.05368359127031896,"score_gpt":0.2882589755263415,"score_spread":0.23457538425602253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980714833","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026518076,0.00039601393,0.9915421,0.00030410066,0.0002684183,0.00027190655,0.00004904221,0.0020104034,0.002506186],"genre_scores_gemma":[0.07596674,0.0014571876,0.91183615,0.0005923601,0.00040735226,0.0010087509,0.0005483976,0.0009478904,0.007235136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972486,0.0005601896,0.00039409866,0.00037384353,0.0010947117,0.00032856374],"domain_scores_gemma":[0.9966708,0.00047338282,0.00023467137,0.0011130807,0.0011861356,0.0003220414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006940587,0.00121441,0.0014260644,0.0014028897,0.0013977255,0.004505468,0.004826592,0.0029155102,0.002327251],"category_scores_gemma":[0.006826899,0.0010983909,0.0014199892,0.0012032103,0.0022463247,0.0061547854,0.00404255,0.0066304985,0.0024427534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000401943,0.00031260675,0.0008978145,0.00077933207,0.0001538906,0.0007374284,0.0009662874,0.056423012,0.04437161,0.67570645,0.022972805,0.19627684],"study_design_scores_gemma":[0.00013475656,0.00043309492,0.0006042786,0.00030263662,0.00033056078,0.0009785366,0.00024687574,0.65660584,0.032966964,0.14604829,0.16115522,0.00019288428],"about_ca_topic_score_codex":0.0018897742,"about_ca_topic_score_gemma":0.0016172788,"teacher_disagreement_score":0.006940587,"about_ca_system_score_codex":0.001493143,"about_ca_system_score_gemma":0.0028983941,"threshold_uncertainty_score":0.036705792},"labels":[],"label_agreement":null},{"id":"W1980840695","doi":"10.1016/j.comcom.2004.08.004","title":"An adaptive handoff priority scheme for wireless MC-CDMA cellular networks supporting realtime multimedia applications","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Handover; Computer network; Scheme (mathematics); Wireless; Multimedia; Code division multiple access; Wireless network; Telecommunications","score_opus":0.04352984253714887,"score_gpt":0.3326530069047234,"score_spread":0.2891231643675745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980840695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2501681,0.003008917,0.73667073,0.00045874048,0.0010940718,0.00037383902,0.00013038765,0.0020578036,0.0060374383],"genre_scores_gemma":[0.93573844,0.00027561875,0.06160922,0.00015420419,0.00025199866,0.00005072744,0.000056749224,0.000029090395,0.0018339651],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995759,0.00007692806,0.000035033034,0.00005639137,0.00016984879,0.00008591985],"domain_scores_gemma":[0.99836904,0.0005195884,0.00012244537,0.0002052333,0.00060883706,0.00017476958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081612036,0.00046012472,0.00049887504,0.00073708815,0.0012273986,0.00081974966,0.0012051464,0.0005573244,0.0014207013],"category_scores_gemma":[0.0024552564,0.00024072455,0.00018398375,0.00047800306,0.00039638867,0.0006764328,0.0006328974,0.0010418548,0.0002981264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029513305,0.0005563539,0.0033185706,0.00024681416,0.0001149715,0.00058921095,0.00041066098,0.045343786,0.27872026,0.01731479,0.0059767202,0.64445657],"study_design_scores_gemma":[0.0003237185,0.0011106143,0.0038851942,0.000033396318,0.00027463664,0.0011394363,0.0001512441,0.92505634,0.05407329,0.006019498,0.0078240065,0.00010867535],"about_ca_topic_score_codex":0.002317159,"about_ca_topic_score_gemma":0.005075039,"teacher_disagreement_score":0.002317159,"about_ca_system_score_codex":0.0006348811,"about_ca_system_score_gemma":0.0007138906,"threshold_uncertainty_score":0.004752755},"labels":[],"label_agreement":null},{"id":"W1982350619","doi":"10.1016/j.comcom.2006.04.003","title":"A smooth broadcasting scheme for VBR-encoded hot videos","year":2006,"lang":"en","type":"article","venue":"Computer Communications","topic":"Video Coding and Compression Technologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Council","keywords":"Computer science; Variable bitrate; Bandwidth (computing); Broadcasting (networking); Asynchronous communication; Real-time computing; Upload; Computer network; Variance (accounting); Video server; Bit rate","score_opus":0.055433345927814605,"score_gpt":0.2887298526092142,"score_spread":0.2332965066813996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982350619","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09374704,0.0010295036,0.896602,0.00028872857,0.00021820913,0.00023195523,0.00020183278,0.0015340131,0.0061467416],"genre_scores_gemma":[0.6203501,0.0008471457,0.36389464,0.00018507146,0.00023793716,0.00016833634,0.00049761863,0.00014131567,0.013677952],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995609,0.00007115511,0.000019399407,0.000052491614,0.00021112141,0.00008490511],"domain_scores_gemma":[0.9991824,0.00019289942,0.000068298024,0.00023069387,0.0002603448,0.00006540759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005876267,0.0005239455,0.00067820144,0.0008960842,0.00073166157,0.0006745215,0.0007588996,0.0005630117,0.002381196],"category_scores_gemma":[0.0014418276,0.00029354604,0.0003742663,0.00076597044,0.0005407703,0.0006406408,0.0013630925,0.0008550484,0.00066112255],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014648134,0.00017124349,0.0005890623,0.00028381406,0.00008615929,0.0003443651,0.00042534163,0.025246268,0.42019054,0.045134515,0.005359179,0.5007047],"study_design_scores_gemma":[0.00028602942,0.0012089451,0.0025648477,0.00008253327,0.0002936844,0.0009561786,0.00019839262,0.777326,0.16956002,0.024943316,0.022359744,0.00022041553],"about_ca_topic_score_codex":0.0021645618,"about_ca_topic_score_gemma":0.003716223,"teacher_disagreement_score":0.002381196,"about_ca_system_score_codex":0.00050605414,"about_ca_system_score_gemma":0.0008575297,"threshold_uncertainty_score":0.007965922},"labels":[],"label_agreement":null},{"id":"W1985719683","doi":"10.1016/j.comcom.2014.02.020","title":"VANET security surveys","year":2014,"lang":"en","type":"article","venue":"Computer Communications","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":497,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Computer security; Vehicular ad hoc network; Wireless ad hoc network; Mobile ad hoc network; Computer network; Architecture; Wireless; Intelligent transportation system; Telecommunications; Transport engineering; Network packet","score_opus":0.011760201959340452,"score_gpt":0.2130870158711024,"score_spread":0.20132681391176194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985719683","genre_codex":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009245369,0.39056525,0.13454156,0.033710163,0.02268428,0.0005236896,0.0039843475,0.00226027,0.4024851],"genre_scores_gemma":[0.10248731,0.5416638,0.041424356,0.0068299463,0.010120033,0.00053717307,0.010979686,0.00074859563,0.2852091],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981735,0.00040027313,0.00017155745,0.00027957643,0.00076776143,0.0002073212],"domain_scores_gemma":[0.99544215,0.0013544952,0.00025524586,0.00086535036,0.0017747355,0.00030793023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024830515,0.0016253631,0.00080995227,0.0057871044,0.0014781872,0.0047985087,0.0015159956,0.0017452544,0.03075687],"category_scores_gemma":[0.006802282,0.0007879006,0.0005665257,0.007422237,0.0010306131,0.0083021205,0.0029565347,0.0029211699,0.013003618],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008367935,0.00009791293,0.0011241763,0.0008359772,0.000044061366,0.00008707826,0.00012417648,0.00843456,0.00076178607,0.097379394,0.29378018,0.59724694],"study_design_scores_gemma":[0.0000050628614,0.00005297847,0.00034968127,0.0004177076,0.000019383551,0.00028948567,0.00013264456,0.0037372666,0.0005533711,0.016282158,0.9781439,0.000016370477],"about_ca_topic_score_codex":0.0043005273,"about_ca_topic_score_gemma":0.0047084307,"teacher_disagreement_score":0.03075687,"about_ca_system_score_codex":0.0021164939,"about_ca_system_score_gemma":0.002461385,"threshold_uncertainty_score":0.10289192},"labels":[],"label_agreement":null},{"id":"W1985795021","doi":"10.1016/j.comcom.2012.04.001","title":"Multi-layer episode filtering for the multi-step attack detection","year":2012,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Data mining; Correlation; Decision tree; Attack model; Layer (electronics); Reduction (mathematics); Machine learning; Artificial intelligence; Correlation attack; Computer security; Cryptography","score_opus":0.14361034305428277,"score_gpt":0.3375627116951288,"score_spread":0.19395236864084603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985795021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073887156,0.00025057062,0.9914663,0.000067061126,0.000045295412,0.00002875228,0.00009555536,0.0004385328,0.00021928815],"genre_scores_gemma":[0.49583313,0.00050319114,0.49870926,0.0001621588,0.00024790145,0.0002065876,0.0011471821,0.00013690582,0.0030537813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991242,0.00020094706,0.000086528846,0.00021681709,0.00022142766,0.00015008444],"domain_scores_gemma":[0.998448,0.0008324748,0.00012597634,0.00024363061,0.00027113152,0.00007883622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014086035,0.0008023664,0.0014445075,0.0009822147,0.0005149431,0.0009812803,0.0015013968,0.0010774615,0.002173306],"category_scores_gemma":[0.0048347893,0.0004500332,0.00090706645,0.0008187076,0.00033385374,0.0013820028,0.00094993954,0.0017529407,0.0006254009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089265447,0.00031727247,0.005702401,0.00023140042,0.0003238079,0.00018148283,0.00014949685,0.3778618,0.021471104,0.017005406,0.0059533147,0.56990993],"study_design_scores_gemma":[0.0000053303334,0.00001850858,0.00041471407,0.000002786237,0.000014317634,0.000014003462,0.0000029869223,0.9970601,0.0010611855,0.0011088374,0.00029133706,0.000005789731],"about_ca_topic_score_codex":0.008553748,"about_ca_topic_score_gemma":0.009046202,"teacher_disagreement_score":0.008553748,"about_ca_system_score_codex":0.0006507948,"about_ca_system_score_gemma":0.0011655248,"threshold_uncertainty_score":0.017007887},"labels":[],"label_agreement":null},{"id":"W1988213757","doi":"10.1016/j.comcom.2007.05.056","title":"Load sharing in Call Server clusters","year":2007,"lang":"en","type":"article","venue":"Computer Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada); Carleton University","funders":"","keywords":"Computer science; Computer network; Operating system","score_opus":0.06365834836055209,"score_gpt":0.3346072138923558,"score_spread":0.27094886553180375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988213757","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8530986,0.00056700176,0.13222423,0.00086520537,0.00019151306,0.00013286473,0.00013458868,0.0016990766,0.011086933],"genre_scores_gemma":[0.9923454,0.00005771668,0.0050697546,0.00003134708,0.00005892395,0.00003226482,0.00006406964,0.000103681385,0.0022368743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975969,0.00062011136,0.00008911275,0.00030725534,0.00075748865,0.0006290531],"domain_scores_gemma":[0.99288046,0.0031525574,0.0003985499,0.0012757007,0.0012046683,0.0010880744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026681356,0.00053999614,0.0015785813,0.001234535,0.0031970171,0.0035063832,0.0030978646,0.001088444,0.0050593265],"category_scores_gemma":[0.011458294,0.0007046245,0.00033967252,0.001734943,0.0014149703,0.0029095213,0.002306616,0.0009576506,0.000776861],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004757013,0.0011436441,0.011113041,0.00019575625,0.0001539994,0.000532026,0.0020708886,0.7322374,0.029401677,0.097584344,0.015006594,0.10580362],"study_design_scores_gemma":[0.000062782085,0.00011858142,0.0016447612,0.00000563662,0.000029324545,0.00006723782,0.00045263252,0.9688336,0.0029257033,0.024351936,0.0014847288,0.000023150838],"about_ca_topic_score_codex":0.0044097616,"about_ca_topic_score_gemma":0.0036971834,"teacher_disagreement_score":0.0050593265,"about_ca_system_score_codex":0.0021232287,"about_ca_system_score_gemma":0.0017629805,"threshold_uncertainty_score":0.016925156},"labels":[],"label_agreement":null},{"id":"W1988598963","doi":"10.1016/j.comcom.2007.02.014","title":"DREAM: A system for detection and reaction against MAC layer misbehavior in ad hoc networks","year":2007,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Timeout; Computer science; Computer network; Network packet; Node (physics); Transmission (telecommunications); Protocol (science); Intrusion detection system; Wireless ad hoc network; Process (computing); Channel (broadcasting); Computer security; Wireless; Telecommunications","score_opus":0.029708930919617512,"score_gpt":0.2769009724109808,"score_spread":0.24719204149136326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988598963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11458865,0.0010714832,0.53631526,0.00070332,0.00085168064,0.001321074,0.0018202867,0.33669576,0.006632554],"genre_scores_gemma":[0.77502567,0.0003659783,0.20688301,0.00079606235,0.00022812483,0.0006827142,0.002352208,0.0016777656,0.011988431],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973271,0.0008192306,0.0003463948,0.00043706258,0.0009013853,0.00016877026],"domain_scores_gemma":[0.99228996,0.0027956099,0.00091635325,0.0019915397,0.0013101455,0.000696273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039276616,0.0013364512,0.0015300289,0.0022836397,0.00065266254,0.0014189442,0.002944089,0.0014098824,0.0037986431],"category_scores_gemma":[0.010560529,0.0007910357,0.0003524934,0.00045842672,0.00064111874,0.0025725903,0.002330915,0.0012794018,0.0019424546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009042959,0.0017531887,0.038819212,0.0011675124,0.000858026,0.0011935784,0.0012751096,0.036380846,0.06588661,0.00858211,0.07968614,0.7553547],"study_design_scores_gemma":[0.0007366735,0.0015360874,0.006081685,0.00008171004,0.00036585375,0.00084529654,0.00023895677,0.9125714,0.051711187,0.0070706154,0.018542333,0.00021823094],"about_ca_topic_score_codex":0.0014080857,"about_ca_topic_score_gemma":0.0014451541,"teacher_disagreement_score":0.0039276616,"about_ca_system_score_codex":0.0005730396,"about_ca_system_score_gemma":0.0011963351,"threshold_uncertainty_score":0.020771742},"labels":[],"label_agreement":null},{"id":"W1989020533","doi":"10.1016/j.comcom.2012.03.010","title":"Research on secure data collection in wireless multimedia sensor networks","year":2012,"lang":"en","type":"article","venue":"Computer Communications","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Computer network; Wireless sensor network; Adversary; Node (physics); Data collection; Routing (electronic design automation); Scheme (mathematics); Wireless; Efficient energy use; Computer security; Telecommunications","score_opus":0.18755455498471038,"score_gpt":0.3940740306678586,"score_spread":0.20651947568314824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989020533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064352766,0.14576857,0.7075782,0.01251337,0.0015101642,0.00020373127,0.00014639589,0.00029722127,0.06762956],"genre_scores_gemma":[0.6546891,0.19148785,0.12571725,0.001575838,0.0030931954,0.00022953202,0.00030651048,0.00013903478,0.022761727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818146,0.00035018896,0.00011849627,0.00040669614,0.0008012221,0.0001419308],"domain_scores_gemma":[0.9931223,0.0041414574,0.0004131853,0.00071135425,0.0014780093,0.00013371273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023118737,0.0007097648,0.00087677414,0.0017820752,0.0008034348,0.0027518088,0.0014374822,0.0012682388,0.0036477055],"category_scores_gemma":[0.00846845,0.00046183914,0.0006413308,0.0035878513,0.0022471831,0.008609205,0.0010364619,0.00197083,0.00072748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017888243,0.00022477836,0.0025634714,0.0016448584,0.00010027393,0.00022754337,0.000615947,0.038082413,0.02021085,0.5492233,0.005271412,0.38165632],"study_design_scores_gemma":[0.00005687035,0.0004967911,0.0021062952,0.0007193951,0.00016044451,0.0009741982,0.0009514807,0.40199542,0.06307478,0.42876118,0.100602105,0.000100976795],"about_ca_topic_score_codex":0.0012283021,"about_ca_topic_score_gemma":0.00080257026,"teacher_disagreement_score":0.0036477055,"about_ca_system_score_codex":0.0020167246,"about_ca_system_score_gemma":0.001444934,"threshold_uncertainty_score":0.014632404},"labels":[],"label_agreement":null},{"id":"W1992238700","doi":"10.1016/j.comcom.2008.05.002","title":"Performance implications of fluctuating server capacity","year":2008,"lang":"en","type":"article","venue":"Computer Communications","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Blocking (statistics); Context (archaeology); Set (abstract data type); Capacity planning; Service (business); Distributed computing; Computer network; Operating system","score_opus":0.06359400232272992,"score_gpt":0.25381670557372843,"score_spread":0.1902227032509985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992238700","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90827775,0.0016705089,0.062084902,0.0069914623,0.00041519644,0.000024394047,0.0002735084,0.00043892418,0.019823322],"genre_scores_gemma":[0.99875283,0.000090851296,0.00066631817,0.000081924816,0.00004070428,0.0000036443419,0.000023192777,0.000016289765,0.0003241543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973454,0.0012105057,0.000065144915,0.00021732415,0.0005151539,0.00064654625],"domain_scores_gemma":[0.9682842,0.02333145,0.0017131373,0.0018442145,0.0034891616,0.0013378022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050925533,0.0003724521,0.00057840865,0.00066695584,0.0009069372,0.002854997,0.0014462975,0.0015208978,0.004839334],"category_scores_gemma":[0.042501107,0.00033487444,0.00022219212,0.0015332461,0.0015237659,0.0030665784,0.000849531,0.0019936573,0.00045535367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018625859,0.00024906677,0.020301508,0.000127713,0.000058631817,0.0008623621,0.0005986094,0.66921854,0.010291392,0.25016743,0.007558008,0.03870418],"study_design_scores_gemma":[0.000043669075,0.00020551066,0.0072147017,0.0000302017,0.00004132274,0.00023224445,0.00062611315,0.86426955,0.0032200236,0.12288716,0.00117479,0.00005465391],"about_ca_topic_score_codex":0.0025519438,"about_ca_topic_score_gemma":0.001472965,"teacher_disagreement_score":0.0050925533,"about_ca_system_score_codex":0.002422977,"about_ca_system_score_gemma":0.0013129021,"threshold_uncertainty_score":0.0269323},"labels":[],"label_agreement":null},{"id":"W1992851965","doi":"10.1016/j.comcom.2012.07.008","title":"Two-stage report generation in long-reach EPON for enhanced delay performance","year":2012,"lang":"en","type":"article","venue":"Computer Communications","topic":"Advanced Photonic Communication Systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Stage (stratigraphy); Real-time computing","score_opus":0.055411169270611016,"score_gpt":0.31506898749491624,"score_spread":0.2596578182243052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992851965","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9151837,0.00061883416,0.063522086,0.000699438,0.00029463143,0.000114196184,0.00023108181,0.0011598412,0.018176127],"genre_scores_gemma":[0.97079676,0.00014358571,0.022276048,0.000060765262,0.00005777728,0.00004765374,0.00008883935,0.00004495779,0.006483616],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974483,0.00003910578,0.000009427694,0.000069656315,0.00008667008,0.000050365426],"domain_scores_gemma":[0.99965465,0.00008860021,0.00007373303,0.0000526594,0.00008488958,0.00004545884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045947448,0.0004424065,0.00034313183,0.0002511815,0.0005208478,0.00076147274,0.0010518839,0.0005053665,0.0024001834],"category_scores_gemma":[0.00037775314,0.00024831766,0.00023171911,0.00023736287,0.00040068687,0.000962384,0.00061238033,0.00055909646,0.0007662764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034097722,0.00019591938,0.0006667516,0.00013202218,0.000020098048,0.00038481568,0.0002707896,0.004942041,0.96603686,0.014022627,0.0021698321,0.010817267],"study_design_scores_gemma":[0.00006424854,0.00055238564,0.00074324553,0.000014292622,0.000034156492,0.0002784611,0.000060496066,0.11015143,0.8791456,0.0015624639,0.0073261247,0.00006712935],"about_ca_topic_score_codex":0.0005388403,"about_ca_topic_score_gemma":0.0016160642,"teacher_disagreement_score":0.0024001834,"about_ca_system_score_codex":0.0008775361,"about_ca_system_score_gemma":0.0004489646,"threshold_uncertainty_score":0.008029461},"labels":[],"label_agreement":null},{"id":"W1999405276","doi":"10.1016/j.comcom.2004.01.003","title":"Node density and connectivity properties of the random waypoint model","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Waypoint; Mobility model; Computer science; Mobile ad hoc network; Node (physics); Rectangle; Boundary (topology); Routing (electronic design automation); Topology (electrical circuits); Component (thermodynamics); Focus (optics); Connected component; Computer network; Statistical physics; Mathematics; Geometry; Physics; Real-time computing; Network packet; Artificial intelligence; Mathematical analysis","score_opus":0.0373448298187891,"score_gpt":0.23086757351019366,"score_spread":0.19352274369140454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999405276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33723322,0.0037483443,0.617173,0.0031928588,0.00015167655,0.000104325125,0.00056573027,0.000391763,0.03743902],"genre_scores_gemma":[0.98398006,0.0019437473,0.008297448,0.000110899506,0.00019378569,0.00009290422,0.00023283417,0.00006868599,0.0050796717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927837,0.0002566421,0.000019792284,0.00011075462,0.00024438102,0.00009020772],"domain_scores_gemma":[0.9931462,0.0049044783,0.00068822183,0.00036992392,0.00062358147,0.00026766447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013246464,0.0005242437,0.0009049515,0.001586601,0.0007291527,0.0014238497,0.0018367602,0.0013255279,0.003067211],"category_scores_gemma":[0.014609162,0.000748418,0.0005401392,0.0014447661,0.0014193126,0.0041788495,0.0011785267,0.0012388929,0.0005557516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073683375,0.000050514165,0.0021974875,0.00009618155,0.000032605563,0.00021788129,0.00033724192,0.30264267,0.0016325008,0.6830397,0.0024580117,0.0072215567],"study_design_scores_gemma":[0.000024658231,0.000030713956,0.00087511155,0.000019756144,0.000030245164,0.00029003326,0.00009177324,0.7889695,0.00035460223,0.20769039,0.0015966394,0.00002664861],"about_ca_topic_score_codex":0.0036013834,"about_ca_topic_score_gemma":0.0015165551,"teacher_disagreement_score":0.0036013834,"about_ca_system_score_codex":0.0009150391,"about_ca_system_score_gemma":0.00049282337,"threshold_uncertainty_score":0.01026088},"labels":[],"label_agreement":null},{"id":"W2002154183","doi":"10.1016/j.comcom.2007.03.008","title":"An agent based and biological inspired real-time intrusion detection and security model for computer network operations","year":2007,"lang":"en","type":"article","venue":"Computer Communications","topic":"Artificial Immune Systems Applications","field":"Engineering","cited_by":76,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Division of Computer and Network Systems","keywords":"Computer science; Intrusion detection system; Artificial immune system; Host-based intrusion detection system; Mobile agent; Anomaly-based intrusion detection system; Network security; Computer security; Computer network; Distributed computing; Artificial intelligence; Intrusion prevention system","score_opus":0.0370618672097082,"score_gpt":0.27266223278034474,"score_spread":0.23560036557063654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002154183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06577608,0.0003910859,0.9233269,0.0007481497,0.00018563624,0.00008496501,0.00008688025,0.00050319923,0.008897089],"genre_scores_gemma":[0.9084886,0.00032593225,0.08139845,0.00017547382,0.0000606205,0.00016434384,0.000067969864,0.000033246575,0.009285482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997329,0.000080083024,0.000012415009,0.00006125773,0.00008193056,0.00003144629],"domain_scores_gemma":[0.999645,0.00014669534,0.00005884931,0.000027868151,0.00009375626,0.000027761436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005106515,0.0004452144,0.0006726457,0.00043192372,0.00034016964,0.0010203962,0.0015005512,0.0011380104,0.0019881877],"category_scores_gemma":[0.0010483954,0.0001835674,0.0005056127,0.000369478,0.0005882577,0.0012102771,0.000481479,0.00070302584,0.00029260662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007084351,0.000108864566,0.00053868926,0.000041400202,0.000045883135,0.00011401088,0.000057781155,0.9524115,0.0036037227,0.027599005,0.000731395,0.014677003],"study_design_scores_gemma":[0.0000047269864,0.000019332316,0.00005368802,9.899027e-7,0.0000056873123,0.0000131559,0.0000024475853,0.99729115,0.00018425073,0.0022037148,0.00021832979,0.0000024484398],"about_ca_topic_score_codex":0.00289134,"about_ca_topic_score_gemma":0.002205964,"teacher_disagreement_score":0.00289134,"about_ca_system_score_codex":0.0008656972,"about_ca_system_score_gemma":0.0007270378,"threshold_uncertainty_score":0.0066512227},"labels":[],"label_agreement":null},{"id":"W2003331630","doi":"10.1016/j.comcom.2012.03.013","title":"A hybrid nature-inspired optimizer for wireless mesh networks design","year":2012,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Wireless mesh network; Software deployment; Particle swarm optimization; Throughput; Distributed computing; Genetic algorithm; Network performance; Network planning and design; Key (lock); Wireless network; Mathematical optimization; Wireless; Computer network; Machine learning","score_opus":0.03817291486835299,"score_gpt":0.28048897545014223,"score_spread":0.24231606058178923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003331630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018606015,0.00018529102,0.9759749,0.00013085669,0.0000544818,0.0000410658,0.000025931091,0.00022860343,0.0047528124],"genre_scores_gemma":[0.5338277,0.0002390554,0.4592243,0.00019352522,0.00009890166,0.00024666477,0.00007445254,0.00016645729,0.005928936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982244,0.00006209363,0.0000070120923,0.000021807791,0.00006906834,0.000017628365],"domain_scores_gemma":[0.9997838,0.00010449402,0.000026902473,0.000022248061,0.00004943754,0.00001301297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059369573,0.00044108852,0.00056084787,0.00036563392,0.00026427137,0.00049148547,0.00085569435,0.0007491661,0.0017965903],"category_scores_gemma":[0.00091018796,0.0002762717,0.00049627596,0.0003474993,0.0002945224,0.00040877642,0.0005438479,0.00049973483,0.00026787046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005044889,0.000038402926,0.00033799585,0.00004306571,0.000043323,0.000036789992,0.00002560881,0.93519807,0.0052761235,0.011239158,0.0009050584,0.04680602],"study_design_scores_gemma":[0.000005145868,0.00001813589,0.000029096413,0.0000015020912,0.000003642371,0.0000067121614,0.0000014188,0.9985488,0.00020798088,0.00088808185,0.00028807073,0.000001503073],"about_ca_topic_score_codex":0.0008324494,"about_ca_topic_score_gemma":0.0012125232,"teacher_disagreement_score":0.0017965903,"about_ca_system_score_codex":0.00035154904,"about_ca_system_score_gemma":0.000399443,"threshold_uncertainty_score":0.0060102344},"labels":[],"label_agreement":null},{"id":"W2003347881","doi":"10.1016/j.comcom.2014.05.010","title":"Femtocaching in video content delivery: Assignment of video clips to serve dynamic mobile users","year":2014,"lang":"en","type":"article","venue":"Computer Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Femtocell; Popularity; Video tracking; Computer network; Cache; CLIPS; Wireless network; Multimedia; Wireless; Video processing; Artificial intelligence; Base station; Telecommunications","score_opus":0.04177133278151858,"score_gpt":0.26930755080577007,"score_spread":0.2275362180242515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003347881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16770178,0.0017800282,0.8208014,0.00057543704,0.0002506753,0.0002343862,0.00015631129,0.0003414747,0.008158554],"genre_scores_gemma":[0.93002236,0.00088592013,0.064183496,0.00012144962,0.00018614507,0.00006557629,0.00010120802,0.000041871517,0.0043920167],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992519,0.0002629097,0.00002187629,0.00017990802,0.00011636812,0.00016701742],"domain_scores_gemma":[0.9985055,0.0007992031,0.00010943242,0.00017467915,0.00028033566,0.00013097719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008680517,0.00079134636,0.0012923871,0.00064561446,0.0012390298,0.00096504256,0.0013488503,0.00095862424,0.0018620135],"category_scores_gemma":[0.003154432,0.00044375475,0.00025633274,0.0022220132,0.00091876724,0.0011617795,0.0008812341,0.0006493024,0.00030717795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017986834,0.00091338006,0.0097201755,0.0004431289,0.0001715881,0.00096747925,0.0006007685,0.37583065,0.057716493,0.062248077,0.012614154,0.47697544],"study_design_scores_gemma":[0.00002526162,0.00022737951,0.0014252637,0.000015138776,0.0000531939,0.0004553894,0.00018050059,0.97898495,0.006151578,0.010229376,0.0022272572,0.000024709096],"about_ca_topic_score_codex":0.007766957,"about_ca_topic_score_gemma":0.009526286,"teacher_disagreement_score":0.007766957,"about_ca_system_score_codex":0.0011216919,"about_ca_system_score_gemma":0.00088295416,"threshold_uncertainty_score":0.015443504},"labels":[],"label_agreement":null},{"id":"W2007990153","doi":"10.1016/j.comcom.2007.06.008","title":"WLAN VoIP capacity allocation using an adaptive voice packetization server","year":2007,"lang":"en","type":"article","venue":"Computer Communications","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Voice over IP; Computer network; Header; Network packet; Latency (audio); Session Initiation Protocol; Real-time computing; Server; The Internet; Telecommunications; Operating system","score_opus":0.1321645901741819,"score_gpt":0.3250485799098534,"score_spread":0.19288398973567153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007990153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24095468,0.00046159112,0.7430688,0.00032338282,0.00027003302,0.00019497506,0.00007758427,0.0063668564,0.008282055],"genre_scores_gemma":[0.9453149,0.00006547997,0.05225845,0.00009315638,0.0001155155,0.00004369413,0.00005401611,0.00007560865,0.0019793059],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960905,0.000088147724,0.000024862733,0.000094460906,0.00009984703,0.00008364846],"domain_scores_gemma":[0.998976,0.00032493402,0.000040214654,0.00014037297,0.00039165994,0.00012680105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009236341,0.0005504702,0.0007721272,0.0008659637,0.0007094868,0.001270208,0.001304508,0.00070644123,0.0017700781],"category_scores_gemma":[0.0018259204,0.00041551952,0.00026191474,0.0005812864,0.00036142033,0.00079177896,0.0006922405,0.0007711473,0.00062731723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023511564,0.001360309,0.0069419146,0.000084626496,0.00020410941,0.00030081603,0.00018720177,0.12635468,0.3216087,0.009003768,0.0050964598,0.52650636],"study_design_scores_gemma":[0.000083590756,0.0001710447,0.0013179404,0.000004325324,0.00007810106,0.00013839078,0.000031886786,0.9559913,0.039759237,0.0009979866,0.0013923744,0.000033859662],"about_ca_topic_score_codex":0.0020209537,"about_ca_topic_score_gemma":0.002710173,"teacher_disagreement_score":0.0020209537,"about_ca_system_score_codex":0.00080761284,"about_ca_system_score_gemma":0.00064811256,"threshold_uncertainty_score":0.005921483},"labels":[],"label_agreement":null},{"id":"W2008826916","doi":"10.1016/j.comcom.2010.01.027","title":"Hierarchical distributed data classification in wireless sensor networks","year":2010,"lang":"en","type":"article","venue":"Computer Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Wireless sensor network; Distributed computing; Classifier (UML); Overhead (engineering); Decision tree; Data classification; Tree (set theory); Data mining; Machine learning; Computer network; Artificial intelligence","score_opus":0.05487446410367642,"score_gpt":0.2922393677301744,"score_spread":0.23736490362649798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008826916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027867293,0.0011299909,0.96845967,0.00048109918,0.000121279416,0.00009068443,0.000121977,0.0007103063,0.0010175792],"genre_scores_gemma":[0.63834536,0.0008941495,0.3541441,0.00024979858,0.00028036503,0.00031135793,0.0008533381,0.00013186554,0.0047897515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978948,0.0005818692,0.00020428518,0.0003941495,0.0007298403,0.00019509024],"domain_scores_gemma":[0.99535686,0.001974296,0.0004198156,0.0011914705,0.00089061033,0.00016695434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026477643,0.00052981416,0.001551782,0.0016431567,0.0011558535,0.0014805737,0.002208514,0.0012014437,0.0012507668],"category_scores_gemma":[0.0076360214,0.00056952995,0.00057792757,0.0024765744,0.0010479814,0.0030342024,0.001830434,0.0011166076,0.0005000376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039868584,0.00033225722,0.005659267,0.00028464413,0.00011037213,0.00010375485,0.00028679782,0.4262432,0.008785279,0.025242856,0.007762226,0.5247907],"study_design_scores_gemma":[0.000011015002,0.00003549676,0.00063519884,0.000009102517,0.000012929799,0.000032127085,0.00004417542,0.9755241,0.0018235008,0.020652361,0.0012114701,0.00000845715],"about_ca_topic_score_codex":0.0038448644,"about_ca_topic_score_gemma":0.004303276,"teacher_disagreement_score":0.0038448644,"about_ca_system_score_codex":0.0011069402,"about_ca_system_score_gemma":0.001189468,"threshold_uncertainty_score":0.01400286},"labels":[],"label_agreement":null},{"id":"W2009892311","doi":"10.1016/j.comcom.2007.12.024","title":"Mobile data collector strategy for delay-sensitive applications over wireless sensor networks","year":2008,"lang":"en","type":"article","venue":"Computer Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Wireless sensor network; Network packet; Bottleneck; Routing protocol; Beacon; Key distribution in wireless sensor networks; Real-time computing; Wireless network; Wireless; Embedded system; Telecommunications","score_opus":0.06773267522109774,"score_gpt":0.2988355182497789,"score_spread":0.23110284302868114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009892311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110328294,0.00088887755,0.8857675,0.00019235742,0.00015980545,0.000093576826,0.000035386875,0.0005028058,0.0020313275],"genre_scores_gemma":[0.92548406,0.00026615438,0.07162572,0.000115810544,0.00009593783,0.00005321423,0.000041009,0.00003824749,0.0022797787],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974686,0.000054683514,0.00001738655,0.00006798279,0.00007389674,0.000039123395],"domain_scores_gemma":[0.999483,0.00015682109,0.000050766223,0.00008175968,0.00018242607,0.000045252902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052936695,0.0005783334,0.00093410903,0.00069945847,0.0007838984,0.0007535252,0.0013148899,0.000503607,0.00093534484],"category_scores_gemma":[0.0009277791,0.00025680583,0.00034732957,0.0005449412,0.00030985952,0.00072206184,0.0006369116,0.00042122963,0.00030694023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017855667,0.0004207779,0.0043448512,0.0003375417,0.00025853506,0.00096669747,0.00060837524,0.10458953,0.5548946,0.020359598,0.003103677,0.30833027],"study_design_scores_gemma":[0.00009648329,0.00065076683,0.0013467892,0.000021182545,0.00018435148,0.0007893041,0.00019899585,0.8564863,0.1307512,0.004875655,0.0045543397,0.000044552555],"about_ca_topic_score_codex":0.00047695625,"about_ca_topic_score_gemma":0.0011831219,"teacher_disagreement_score":0.0013148899,"about_ca_system_score_codex":0.000470559,"about_ca_system_score_gemma":0.00043910393,"threshold_uncertainty_score":0.0034142137},"labels":[],"label_agreement":null},{"id":"W2010673451","doi":"10.1016/j.comcom.2006.01.017","title":"Activity scheduling based on cross-layer information in Bluetooth sensor networks","year":2006,"lang":"en","type":"article","venue":"Computer Communications","topic":"Bluetooth and Wireless Communication Technologies","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Network packet; Wireless sensor network; Scatternet; Sink (geography); Bluetooth; Network congestion; Computer network; Scheduling (production processes); Real-time computing; Packet loss; Wireless; Telecommunications","score_opus":0.026673386825679983,"score_gpt":0.27567248563440444,"score_spread":0.24899909880872445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010673451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16009042,0.0010510396,0.83441925,0.00019157142,0.00024045171,0.00009294726,0.0000900874,0.0010595305,0.0027646716],"genre_scores_gemma":[0.9712244,0.00012054422,0.027881607,0.00003728251,0.000070541915,0.00003452823,0.000051793188,0.000037349804,0.0005419364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916625,0.00022817544,0.00009215518,0.00016798404,0.00021494627,0.00013042746],"domain_scores_gemma":[0.9971935,0.0015850281,0.00026914055,0.00027083035,0.0004514892,0.00022999897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017576421,0.0005528327,0.001031793,0.0010773322,0.00067521806,0.0011566823,0.0011349224,0.00036280428,0.0008747106],"category_scores_gemma":[0.0036784182,0.00044891814,0.00022187857,0.00065801165,0.00039433836,0.0009699932,0.00071377534,0.00058332464,0.00019284654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023952895,0.00079149555,0.01034471,0.00019531992,0.0002132867,0.00022246137,0.00044035888,0.5102014,0.055676375,0.017953642,0.0031823772,0.39838335],"study_design_scores_gemma":[0.000029704946,0.00012372354,0.0013383401,0.000005983401,0.000036787103,0.00006628155,0.000026955737,0.98956096,0.0054850206,0.0028361585,0.00047567821,0.000014377462],"about_ca_topic_score_codex":0.0017936289,"about_ca_topic_score_gemma":0.0035570962,"teacher_disagreement_score":0.0017936289,"about_ca_system_score_codex":0.0006086775,"about_ca_system_score_gemma":0.0008149531,"threshold_uncertainty_score":0.009295404},"labels":[],"label_agreement":null},{"id":"W2011854146","doi":"10.1016/j.comcom.2006.03.003","title":"An efficient parallel optimization algorithm for the Token Bucket control mechanism","year":2006,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Token bucket; Security token; Leaky bucket; Quality of service; Throughput; Algorithm; Distributed computing; Computer network","score_opus":0.013492306842777448,"score_gpt":0.24038065960815022,"score_spread":0.22688835276537278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011854146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009024255,0.00017701421,0.9863599,0.00021098623,0.00008558305,0.000081283964,0.00006490016,0.0008806051,0.0031155793],"genre_scores_gemma":[0.2756332,0.00022970683,0.716691,0.00011413631,0.000084430074,0.00033196007,0.00021875656,0.0002538049,0.0064430684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955636,0.00009698698,0.00001961613,0.00007630112,0.00015411251,0.000096610616],"domain_scores_gemma":[0.999559,0.00018741513,0.000036256384,0.000085121086,0.00009551473,0.000036650858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009058003,0.00073434855,0.0010500551,0.00054881367,0.0007757801,0.0012551711,0.0020118016,0.0008792279,0.00796548],"category_scores_gemma":[0.002319836,0.00048294524,0.00043444472,0.0010929852,0.0005211766,0.0015146262,0.0013022107,0.0011779773,0.0010058067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005555473,0.00019696198,0.0003377152,0.00012952485,0.000058507056,0.00007015211,0.000058811096,0.64046496,0.0054760575,0.057690762,0.008752531,0.28620842],"study_design_scores_gemma":[0.00009287617,0.000028558628,0.00003715902,0.0000035438068,0.000010554589,0.000017191525,0.000006253935,0.9829843,0.00088747265,0.014587039,0.0013374054,0.000007589102],"about_ca_topic_score_codex":0.0042780605,"about_ca_topic_score_gemma":0.004290255,"teacher_disagreement_score":0.00796548,"about_ca_system_score_codex":0.0010523018,"about_ca_system_score_gemma":0.0023833527,"threshold_uncertainty_score":0.02664715},"labels":[],"label_agreement":null},{"id":"W2012502281","doi":"10.1016/j.comcom.2008.01.049","title":"A joint selfish routing and channel assignment game in wireless mesh networks","year":2008,"lang":"en","type":"article","venue":"Computer Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Nash equilibrium; Routing (electronic design automation); Mathematical optimization; Wireless mesh network; Computer network; Channel (broadcasting); Best response; Game theory; Heuristic; Distributed computing; Wireless; Wireless network; Mathematical economics; Telecommunications; Mathematics","score_opus":0.07761816825018782,"score_gpt":0.2696275960658492,"score_spread":0.19200942781566138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012502281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28315935,0.00021913077,0.6966384,0.0017317858,0.00010917795,0.00023762805,0.00015546866,0.000105021936,0.017644092],"genre_scores_gemma":[0.97600037,0.000102129925,0.019350221,0.00009128521,0.000034440312,0.00010039842,0.000028955417,0.000013937829,0.004278212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858946,0.0008129611,0.000043415042,0.00013797297,0.00024280314,0.00017330593],"domain_scores_gemma":[0.9959848,0.0029959003,0.00028849742,0.00018118613,0.00020750225,0.00034203733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023155613,0.00056943035,0.00095660693,0.0004650508,0.000675962,0.0014553118,0.0016800074,0.0016181845,0.0019231051],"category_scores_gemma":[0.005937787,0.0004180191,0.00043934237,0.0005198947,0.0017042228,0.0021753244,0.0014869219,0.001015913,0.00013128018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062052347,0.00017550807,0.0010007691,0.00011321207,0.000086943546,0.00030732495,0.00029299394,0.6424073,0.0053475793,0.33382234,0.002355319,0.013470155],"study_design_scores_gemma":[0.00006193074,0.00007537196,0.00012703544,0.000004594217,0.000013276552,0.000039778202,0.000040304247,0.9390228,0.00025360816,0.059921462,0.00042794296,0.000012017632],"about_ca_topic_score_codex":0.0019719284,"about_ca_topic_score_gemma":0.0018738857,"teacher_disagreement_score":0.0023155613,"about_ca_system_score_codex":0.0012992925,"about_ca_system_score_gemma":0.0014224707,"threshold_uncertainty_score":0.012246013},"labels":[],"label_agreement":null},{"id":"W2013344829","doi":"10.1016/j.comcom.2008.06.005","title":"A mailbox ownership based mechanism for curbing spam","year":2008,"lang":"en","type":"article","venue":"Computer Communications","topic":"Spam and Phishing Detection","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University; University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mechanism (biology); Computer security; Computer network; World Wide Web","score_opus":0.10198736336459623,"score_gpt":0.2751654283071683,"score_spread":0.17317806494257204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013344829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2378034,0.0012083463,0.6855053,0.0024813162,0.0009584996,0.0009695475,0.0005872936,0.042348836,0.028137477],"genre_scores_gemma":[0.8997179,0.00018535137,0.08243146,0.0005327813,0.0005443199,0.0002547602,0.0002764621,0.00041358333,0.015643446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99597824,0.0010936264,0.00026946806,0.00051696686,0.0015388851,0.00060273916],"domain_scores_gemma":[0.9680384,0.0071491203,0.0028521104,0.015210277,0.0050501404,0.0017000418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004300566,0.00079364894,0.0016717719,0.0036738075,0.002219039,0.0031165665,0.0027695904,0.0033334517,0.008182912],"category_scores_gemma":[0.015279849,0.0006462437,0.0006791736,0.0013956592,0.0018950792,0.005919857,0.004669389,0.0017863528,0.004598006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029277487,0.0030352613,0.01833854,0.00045834636,0.00026774552,0.0008229293,0.0011601197,0.0071941507,0.10483872,0.06305819,0.047918692,0.7499796],"study_design_scores_gemma":[0.0008562276,0.0027342131,0.019135745,0.00025196557,0.0009071077,0.005094135,0.00066718634,0.56821877,0.24555428,0.087125346,0.06896974,0.0004853013],"about_ca_topic_score_codex":0.00061822153,"about_ca_topic_score_gemma":0.0007065752,"teacher_disagreement_score":0.008182912,"about_ca_system_score_codex":0.0009774761,"about_ca_system_score_gemma":0.0012689118,"threshold_uncertainty_score":0.027374566},"labels":[],"label_agreement":null},{"id":"W2015113058","doi":"10.1016/j.comcom.2007.10.030","title":"Algorithmic and theoretical aspects of wireless ad hoc and sensor networks","year":2007,"lang":"en","type":"article","venue":"Computer Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Wireless ad hoc network; Wireless sensor network; Mobile ad hoc network; Computer network; Ad hoc wireless distribution service; Wireless; Distributed computing; Optimized Link State Routing Protocol; Telecommunications","score_opus":0.011220536404758268,"score_gpt":0.2427857756097639,"score_spread":0.23156523920500563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015113058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017855179,0.021999542,0.8785483,0.014119413,0.0016477328,0.00008670301,0.00038604176,0.00016435009,0.065192774],"genre_scores_gemma":[0.56923205,0.036874864,0.3522159,0.003297303,0.006759326,0.00058561587,0.0008985658,0.00021304008,0.029923346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998207,0.0006676366,0.00009522866,0.00023847286,0.00064994115,0.00014177573],"domain_scores_gemma":[0.995349,0.0034081498,0.00031408292,0.00036746828,0.00041525209,0.00014603064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019752844,0.0010822673,0.0010199507,0.0017318644,0.0014727393,0.0045418777,0.0022661972,0.0024113767,0.006083401],"category_scores_gemma":[0.009610854,0.00082410435,0.0008617407,0.0031910113,0.0056362376,0.0076138387,0.0019519578,0.0047024167,0.00089309545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047646586,0.000016225884,0.00013328547,0.000065911794,0.000007140836,0.000020573856,0.000054143722,0.0046789036,0.0001007259,0.9869719,0.001418868,0.0065274243],"study_design_scores_gemma":[0.0000042819374,0.000006020696,0.000073873314,0.000015482088,0.0000044378676,0.000048824255,0.00003292028,0.015495939,0.000040658793,0.9781774,0.0060960054,0.0000040893806],"about_ca_topic_score_codex":0.0016338652,"about_ca_topic_score_gemma":0.0015881252,"teacher_disagreement_score":0.006083401,"about_ca_system_score_codex":0.0018313995,"about_ca_system_score_gemma":0.0013331884,"threshold_uncertainty_score":0.020350993},"labels":[],"label_agreement":null},{"id":"W2015249265","doi":"10.1016/j.comcom.2009.05.015","title":"Cross-layer link adaptation design for UWB-based sensor networks","year":2009,"lang":"en","type":"article","venue":"Computer Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Defence Research and Development Canada","funders":"","keywords":"Computer science; Computer network; Wireless sensor network; Node (physics); Energy consumption; Cross-layer optimization; Routing protocol; Routing (electronic design automation); Wireless ad hoc network; Efficient energy use; Physical layer; Data link layer; Distributed computing; Network layer; Link layer; Wireless; Wireless network; Layer (electronics); Telecommunications","score_opus":0.08192631464434134,"score_gpt":0.3088783180690168,"score_spread":0.22695200342467542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015249265","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019077763,0.000527385,0.97801614,0.00009378706,0.000070026144,0.000033017182,0.00001316292,0.00022262523,0.0019460317],"genre_scores_gemma":[0.88291657,0.0006663036,0.11275967,0.00020640316,0.00009639047,0.00013624421,0.000059917074,0.0000662827,0.0030922247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995055,0.00013723304,0.000030380394,0.00008720833,0.00017574718,0.0000639059],"domain_scores_gemma":[0.9991473,0.0003123033,0.00006750594,0.00006982325,0.00038028267,0.00002267199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011214697,0.00044474317,0.00034551034,0.0003410412,0.0003675377,0.0007695998,0.0010025769,0.00049015164,0.0016056203],"category_scores_gemma":[0.0020070272,0.00027242798,0.00024319574,0.00033148113,0.00030676555,0.0005874058,0.0005882552,0.000707786,0.00037592888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044303163,0.00026173412,0.002013826,0.00028567127,0.00020038222,0.0002706139,0.00036299514,0.5377327,0.11339822,0.015713023,0.0028794915,0.32643834],"study_design_scores_gemma":[0.000010786279,0.000101129175,0.00038538824,0.000009893336,0.000043048938,0.00011200002,0.00002427568,0.9863442,0.010682782,0.0013234726,0.00095244247,0.000010578066],"about_ca_topic_score_codex":0.0009757966,"about_ca_topic_score_gemma":0.0016582144,"teacher_disagreement_score":0.0016056203,"about_ca_system_score_codex":0.00043830415,"about_ca_system_score_gemma":0.00041925546,"threshold_uncertainty_score":0.00593102},"labels":[],"label_agreement":null},{"id":"W2016250485","doi":"10.1016/s0140-3664(99)00227-3","title":"Test generation based on control and data dependencies within system specifications in SDL","year":2000,"lang":"en","type":"article","venue":"Computer Communications","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Instituto de Telecomunicações","keywords":"Computer science; Control flow; Data flow diagram; Programming language; Specification language; Extended finite-state machine; System requirements specification; Control (management); Test data; Finite-state machine; Distributed computing; Software engineering; Database; Artificial intelligence","score_opus":0.13848095803885363,"score_gpt":0.2977731457244659,"score_spread":0.15929218768561226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016250485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1677621,0.000111963425,0.8226524,0.00028937522,0.00003433215,0.00017876898,0.00021781209,0.006470288,0.0022829692],"genre_scores_gemma":[0.8571351,0.000048121736,0.14105774,0.00015297259,0.000010816312,0.00013426867,0.0003003967,0.00045511217,0.0007054339],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99545395,0.0021850595,0.0003182813,0.00041892586,0.0012050534,0.00041871774],"domain_scores_gemma":[0.9724325,0.022616453,0.0012855586,0.0017397065,0.0016569403,0.0002689174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031886706,0.00081381935,0.00056338875,0.0014311281,0.00037087436,0.0009482034,0.0010464506,0.0008738433,0.0021966405],"category_scores_gemma":[0.01633674,0.00061798265,0.000658533,0.00058487395,0.0011890857,0.0016336979,0.0011421639,0.0010183913,0.0002886934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002947996,0.00067308656,0.017740443,0.0009228328,0.0002003602,0.002117965,0.001321008,0.42517167,0.08394592,0.06974691,0.0049726847,0.39023918],"study_design_scores_gemma":[0.00016371335,0.00024383704,0.0007531051,0.000053489566,0.000066613036,0.00021965132,0.000046990892,0.9164503,0.06574154,0.015185737,0.001049583,0.000025436479],"about_ca_topic_score_codex":0.0027027645,"about_ca_topic_score_gemma":0.0039662523,"teacher_disagreement_score":0.0031886706,"about_ca_system_score_codex":0.0008907299,"about_ca_system_score_gemma":0.0013345114,"threshold_uncertainty_score":0.016863525},"labels":[],"label_agreement":null},{"id":"W2017737452","doi":"10.1016/j.comcom.2004.08.015","title":"Markov chain analysis of collaborative codes in random multi access communication systems","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Aloha; Computer science; Asynchronous communication; Markov chain; Random access; Transmission (telecommunications); Computer network; Synchronizing; Throughput; Real-time computing; Telecommunications; Wireless","score_opus":0.060390661011432985,"score_gpt":0.3395680111710763,"score_spread":0.27917735015964334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017737452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123234004,0.0012244213,0.85962725,0.0016834029,0.00013443462,0.00016410972,0.00044325605,0.0003341755,0.0131550105],"genre_scores_gemma":[0.9626133,0.0011833191,0.024447681,0.00027544014,0.00020378383,0.0002460037,0.00040705473,0.00017570263,0.010447756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997331,0.0010081998,0.00009292812,0.00029631352,0.0007169238,0.0005545947],"domain_scores_gemma":[0.9669493,0.025808934,0.0019361201,0.0013624722,0.0031608688,0.0007822815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004081577,0.00095920713,0.001755495,0.0022178423,0.0011289164,0.0021899785,0.0021761525,0.0022271601,0.005905675],"category_scores_gemma":[0.021648519,0.0012389979,0.0010857519,0.0017202155,0.003278223,0.004109508,0.0020344462,0.0027339514,0.0007393062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010980515,0.0000589333,0.0009682008,0.0000753152,0.00005162341,0.00015453556,0.00023855483,0.5338998,0.0010747743,0.45646533,0.001946315,0.0049567693],"study_design_scores_gemma":[0.000013263414,0.000012893415,0.00020110709,0.000014463839,0.0000102018075,0.000027712327,0.00002582787,0.91967285,0.00017003062,0.07957063,0.00026256288,0.000018460212],"about_ca_topic_score_codex":0.009176007,"about_ca_topic_score_gemma":0.007155014,"teacher_disagreement_score":0.009176007,"about_ca_system_score_codex":0.003055287,"about_ca_system_score_gemma":0.0025146967,"threshold_uncertainty_score":0.022167802},"labels":[],"label_agreement":null},{"id":"W2018800372","doi":"10.1016/j.comcom.2012.05.012","title":"Understanding the impact of neighboring strategy in peer-to-peer multimedia streaming applications","year":2012,"lang":"en","type":"article","venue":"Computer Communications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Overlay; Network packet; Computer network; Overlay network; Peer-to-peer; Scheme (mathematics); Tree (set theory); Distributed computing; Swarm behaviour; Multimedia; The Internet; World Wide Web; Artificial intelligence","score_opus":0.1404437713445838,"score_gpt":0.35099369633971966,"score_spread":0.21054992499513586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018800372","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93024117,0.0012195209,0.059721462,0.0005883093,0.00006357489,0.000047600406,0.00005120931,0.00013216422,0.007935047],"genre_scores_gemma":[0.99725753,0.00019001769,0.0021227903,0.000017019345,0.000015851208,0.0000049187797,0.000015218595,0.000013714466,0.00036310707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993642,0.00023757528,0.000023569779,0.000094900104,0.0001810008,0.000098815166],"domain_scores_gemma":[0.99297535,0.0052431514,0.0004241543,0.00026165604,0.00074802566,0.00034769438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010753712,0.00038757347,0.000560266,0.00038295158,0.00054219813,0.0012977899,0.00091890426,0.00095006125,0.0016505341],"category_scores_gemma":[0.0122834705,0.00029451426,0.00014628308,0.00035490567,0.00053525553,0.0031034846,0.00060165126,0.0007197469,0.00020591785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009821821,0.0012097475,0.027760377,0.00030869117,0.00014795606,0.0011212005,0.00090719556,0.6700997,0.116815805,0.06255212,0.0021250143,0.115970016],"study_design_scores_gemma":[0.000016810973,0.00016602661,0.0037975542,0.00000821272,0.000037420014,0.0001096826,0.00036142452,0.979166,0.004583865,0.011319868,0.00041737378,0.000015867703],"about_ca_topic_score_codex":0.0039187437,"about_ca_topic_score_gemma":0.0038537323,"teacher_disagreement_score":0.0039187437,"about_ca_system_score_codex":0.0006979161,"about_ca_system_score_gemma":0.00066960027,"threshold_uncertainty_score":0.007791877},"labels":[],"label_agreement":null},{"id":"W2021123566","doi":"10.1016/j.comcom.2014.12.004","title":"Resource allocation in multi-relay multi-user OFDM systems for heterogeneous traffic","year":2014,"lang":"en","type":"article","venue":"Computer Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Subgradient method; Relay; Resource allocation; Subcarrier; Mathematical optimization; Quality of service; Transmitter power output; Transmission (telecommunications); Optimization problem; Computer network; Power (physics); Orthogonal frequency-division multiplexing; Algorithm; Telecommunications; Channel (broadcasting)","score_opus":0.09055135908521074,"score_gpt":0.3130213031296813,"score_spread":0.22246994404447057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021123566","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16164944,0.0014606,0.82844174,0.0004277673,0.00009243123,0.00005914961,0.000100207595,0.00016070621,0.007607966],"genre_scores_gemma":[0.969971,0.00029498304,0.028307948,0.00004771157,0.000044829336,0.00004177645,0.000026905438,0.000019983025,0.0012447281],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953616,0.00018700752,0.000020330834,0.00007016736,0.00007176403,0.00011461616],"domain_scores_gemma":[0.9987686,0.00087587547,0.0000828294,0.00008298421,0.0001419635,0.00004770921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008914031,0.00043967043,0.0007978118,0.00033724846,0.0005568924,0.0010524729,0.00089417887,0.00056373555,0.0017000668],"category_scores_gemma":[0.0028555861,0.0003337484,0.00023717443,0.00063831935,0.000541416,0.00096973946,0.00083195936,0.00046668568,0.00023851125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051700877,0.0001286771,0.0008497412,0.0001470468,0.0000793019,0.00039184422,0.00018001729,0.8729469,0.016150292,0.03400952,0.001917489,0.07268215],"study_design_scores_gemma":[0.000013798721,0.00003872258,0.00016840354,0.0000045097904,0.000013404811,0.000041249466,0.00002435237,0.9944172,0.0010181513,0.0039862846,0.00026621143,0.000007726721],"about_ca_topic_score_codex":0.0015008821,"about_ca_topic_score_gemma":0.0027372532,"teacher_disagreement_score":0.0017000668,"about_ca_system_score_codex":0.00081050314,"about_ca_system_score_gemma":0.00048542596,"threshold_uncertainty_score":0.005880654},"labels":[],"label_agreement":null},{"id":"W2021295533","doi":"10.1016/s0140-3664(99)00241-8","title":"Design of universal personal computing using SDL","year":2000,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Interfacing; Correctness; Common Object Request Broker Architecture; Interface (matter); Programming language; The Internet; Object (grammar); Distributed computing; Operating system; Software engineering; Computer hardware","score_opus":0.06575624644075903,"score_gpt":0.27205999695593036,"score_spread":0.20630375051517133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021295533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013974522,0.000109756125,0.9762491,0.000110935995,0.000054871543,0.0001872803,0.00005231612,0.003786543,0.005474566],"genre_scores_gemma":[0.47731656,0.00019892042,0.5112963,0.00028140875,0.000035582812,0.00046098133,0.00031575988,0.00071223546,0.009382334],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988933,0.00028791878,0.000113428985,0.0001821735,0.00032017054,0.00020292864],"domain_scores_gemma":[0.9990382,0.00019265925,0.000065505585,0.00028823694,0.00032865777,0.000086713044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013879674,0.0004030099,0.00054172415,0.0005615419,0.0007913449,0.001976501,0.0015505361,0.0005219086,0.004827476],"category_scores_gemma":[0.0023844005,0.00048528,0.0005247276,0.00044358664,0.0008787823,0.0015038935,0.0017666438,0.00088846247,0.0011838496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082698005,0.0004916634,0.005346388,0.00094345555,0.00019404198,0.0005070417,0.0014934898,0.12542008,0.06087191,0.30147925,0.01483381,0.487592],"study_design_scores_gemma":[0.00015564583,0.0003509969,0.00061065797,0.00012804297,0.00014612706,0.0003043169,0.00022419433,0.75415015,0.085438326,0.054936986,0.10349313,0.00006139188],"about_ca_topic_score_codex":0.0021728736,"about_ca_topic_score_gemma":0.003033308,"teacher_disagreement_score":0.004827476,"about_ca_system_score_codex":0.0010006921,"about_ca_system_score_gemma":0.0015920807,"threshold_uncertainty_score":0.01614952},"labels":[],"label_agreement":null},{"id":"W2023482149","doi":"10.1016/s0140-3664(99)00214-5","title":"Hop reservation multiple access for multichannel packet radio networks","year":2000,"lang":"en","type":"article","venue":"Computer Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Federation for the Humanities and Social Sciences","keywords":"Computer science; Reservation; Computer network; Hop (telecommunications); Network packet; Packet radio; Telecommunications","score_opus":0.11287943373040574,"score_gpt":0.35341183078089217,"score_spread":0.24053239705048643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023482149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02055267,0.0052984916,0.96078587,0.00067267235,0.0006819124,0.00013462156,0.00010275473,0.000935502,0.010835576],"genre_scores_gemma":[0.72376555,0.003690556,0.24790259,0.00027088774,0.0007792396,0.00036785455,0.00029519404,0.00016638947,0.022761663],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994436,0.00018158903,0.000023238763,0.000080306534,0.00017699659,0.00009422324],"domain_scores_gemma":[0.99902284,0.0004983672,0.000073453564,0.00019080132,0.00017691498,0.00003751841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009097006,0.0004697093,0.00074662035,0.0004251508,0.0008146061,0.0011758937,0.0012804064,0.0007069652,0.004220487],"category_scores_gemma":[0.002737783,0.00030778884,0.00021757472,0.0006765021,0.0005940073,0.0012093219,0.000728781,0.0013802744,0.00078310585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006333886,0.0002510479,0.0006535849,0.0005580367,0.00013332954,0.00055103144,0.00028559996,0.20815042,0.026041554,0.26553065,0.02333873,0.47387257],"study_design_scores_gemma":[0.000049263657,0.00012222139,0.00023260088,0.000026716327,0.000041497773,0.00020133807,0.00005454805,0.91347766,0.0030749456,0.06793898,0.014751478,0.000028701439],"about_ca_topic_score_codex":0.0017051892,"about_ca_topic_score_gemma":0.0028522168,"teacher_disagreement_score":0.004220487,"about_ca_system_score_codex":0.0006122062,"about_ca_system_score_gemma":0.00068986235,"threshold_uncertainty_score":0.01411891},"labels":[],"label_agreement":null},{"id":"W2023801090","doi":"10.1016/j.comcom.2010.09.012","title":"Strategies for improving performance of IEEE 802.15.4/ZigBee WSNs with path-constrained mobile sink(s)","year":2010,"lang":"en","type":"article","venue":"Computer Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Chaining; Computer science; Computer network; Wireless sensor network; Sink (geography); Mobility model; NeuRFon; Energy consumption; Wireless; Distributed computing; Key distribution in wireless sensor networks; Wireless network; Telecommunications","score_opus":0.014320143599021165,"score_gpt":0.23688722006623217,"score_spread":0.222567076467211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023801090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13051413,0.0021075457,0.85750675,0.0009900559,0.00012050404,0.000119685144,0.000041969186,0.0011860417,0.007413264],"genre_scores_gemma":[0.8547939,0.0008507433,0.14196388,0.0001627894,0.00006706513,0.00007613591,0.000046633315,0.00006609398,0.0019727664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971825,0.00009896081,0.000021563419,0.000042850297,0.000076549135,0.000041816176],"domain_scores_gemma":[0.9992361,0.00030696671,0.00007708327,0.00009673443,0.0002512469,0.00003195916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010161878,0.000844329,0.00041786095,0.00042934227,0.00035310115,0.0007243103,0.0010656598,0.00042161572,0.0018150598],"category_scores_gemma":[0.002198308,0.00020472698,0.00018032882,0.00037863952,0.00031488854,0.0013713182,0.0005887263,0.0004968849,0.00042897163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061058707,0.00040287216,0.0032578062,0.00050344743,0.00012680708,0.00019271302,0.00042877466,0.23447327,0.25092453,0.022412928,0.004202703,0.4824636],"study_design_scores_gemma":[0.00011125509,0.0009932925,0.0018660886,0.00009561655,0.00016388255,0.00031493502,0.0002929573,0.86990666,0.10472849,0.013025907,0.008441159,0.0000597467],"about_ca_topic_score_codex":0.00079351396,"about_ca_topic_score_gemma":0.0019528144,"teacher_disagreement_score":0.0018150598,"about_ca_system_score_codex":0.0003186557,"about_ca_system_score_gemma":0.00061774475,"threshold_uncertainty_score":0.006071925},"labels":[],"label_agreement":null},{"id":"W2024136335","doi":"10.1016/j.comcom.2004.09.008","title":"Quality of service and performance issues in multiservice networks subject to voice and video traffics","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Subject (documents); Quality of service; Telecommunications; Quality (philosophy); Speech recognition; Service (business); Service quality; Voice over IP; Computer network; Voice communication; Multimedia; World Wide Web; The Internet","score_opus":0.06165164267954921,"score_gpt":0.3456657547847367,"score_spread":0.2840141121051875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024136335","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62592036,0.026835822,0.28971624,0.010910311,0.001195855,0.00013616237,0.00030579744,0.00034536314,0.044634175],"genre_scores_gemma":[0.9877879,0.0029443162,0.004949366,0.00018306886,0.0013344561,0.000032623335,0.00006973762,0.000091700036,0.00260675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961385,0.0017153922,0.00016971827,0.00024079929,0.0010952324,0.0006403714],"domain_scores_gemma":[0.9714646,0.021066664,0.0017630911,0.0007340604,0.0043302584,0.0006413906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065091033,0.0012820972,0.001532099,0.0024620302,0.0019231234,0.0048083263,0.0019311374,0.0028027748,0.0034401615],"category_scores_gemma":[0.02962683,0.0008338033,0.00062758574,0.00433713,0.002977134,0.005707563,0.0017459207,0.0021438308,0.00043275833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021553896,0.00061636925,0.009617302,0.0006197496,0.00017019564,0.001982707,0.001423489,0.38693327,0.018683095,0.486145,0.008956293,0.08269706],"study_design_scores_gemma":[0.000041358933,0.00021444653,0.0034902596,0.000046159646,0.00008507208,0.00068851537,0.000551018,0.918865,0.0012900532,0.07302833,0.0016526174,0.00004716213],"about_ca_topic_score_codex":0.0039714454,"about_ca_topic_score_gemma":0.002514552,"teacher_disagreement_score":0.0065091033,"about_ca_system_score_codex":0.0044896696,"about_ca_system_score_gemma":0.001013699,"threshold_uncertainty_score":0.034423888},"labels":[],"label_agreement":null},{"id":"W2025422183","doi":"10.1016/j.comcom.2004.02.021","title":"Performance of Bluetooth bridge scheduling algorithms","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Bluetooth and Wireless Communication Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Bluetooth; Scheduling (production processes); Piconet; Bridge (graph theory); Scatternet; Algorithm; Rendezvous; Discrete event simulation; Network packet; Queue; Distributed computing; Real-time computing; Computer network; Wireless; Mathematical optimization; Simulation; Telecommunications","score_opus":0.046282830975346294,"score_gpt":0.27487089721279057,"score_spread":0.22858806623744427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025422183","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8908955,0.0012647114,0.07961134,0.000998448,0.00045344498,0.0001345331,0.00037216558,0.0029391306,0.023330692],"genre_scores_gemma":[0.97685075,0.00012954627,0.020713108,0.000091489695,0.00005511957,0.000040646613,0.00026186838,0.00016246278,0.0016951361],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976261,0.000840282,0.000116978495,0.0003036073,0.00050268346,0.00061032374],"domain_scores_gemma":[0.9882685,0.008349157,0.0006053037,0.00097215216,0.0012467679,0.00055803277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036561692,0.00087396667,0.00098221,0.001198762,0.0014273708,0.0014784758,0.0014024329,0.0008125156,0.0049728537],"category_scores_gemma":[0.011736268,0.00036556384,0.0003378615,0.0014876286,0.00063837925,0.0011427331,0.00076583616,0.0006516147,0.00073536014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0074599474,0.0009353998,0.007099258,0.00022332979,0.00015285541,0.000080111175,0.00025345586,0.7885933,0.0128723625,0.011261602,0.010088348,0.16098005],"study_design_scores_gemma":[0.0002478136,0.00028226615,0.0012436049,0.000008995937,0.00003868199,0.000035729572,0.000116302945,0.9900107,0.004962401,0.0023944972,0.00064547744,0.000013531238],"about_ca_topic_score_codex":0.00625647,"about_ca_topic_score_gemma":0.007124423,"teacher_disagreement_score":0.00625647,"about_ca_system_score_codex":0.0020383166,"about_ca_system_score_gemma":0.0034787445,"threshold_uncertainty_score":0.019335866},"labels":[],"label_agreement":null},{"id":"W2027089890","doi":"10.1016/j.comcom.2006.02.001","title":"Wireless sensor networks: Performance, reliability, security, and beyond","year":2006,"lang":"en","type":"article","venue":"Computer Communications","topic":"Biomedical and Engineering Education","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Wireless; Telecommunications; Reliability (semiconductor); Electrical engineering; Battery (electricity); Energy harvesting; Population; Power (physics); Engineering; Medicine","score_opus":0.006045053625772833,"score_gpt":0.1936588768918272,"score_spread":0.18761382326605436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027089890","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05292379,0.45711935,0.3805234,0.049142785,0.0032805745,0.00007172968,0.00026549248,0.00073126453,0.055941593],"genre_scores_gemma":[0.76999086,0.15694152,0.046603974,0.0024008171,0.0073142075,0.00008567777,0.00013590604,0.00013024865,0.01639678],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99834704,0.00044463333,0.000065188324,0.00016966458,0.00085162616,0.00012174603],"domain_scores_gemma":[0.9959928,0.0024591049,0.0003433824,0.00026326085,0.0007124636,0.00022891613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002180662,0.0009852073,0.0009492944,0.00085810304,0.0005295231,0.0033047036,0.0010146421,0.002247148,0.0017768008],"category_scores_gemma":[0.006060735,0.00047687077,0.00022280627,0.0016376551,0.0031336558,0.008639076,0.0013658103,0.0022828965,0.00057381263],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003090299,0.00013812793,0.00429569,0.0010681393,0.000106804604,0.00020532236,0.0005364883,0.045244034,0.008810994,0.42909658,0.020950599,0.48923817],"study_design_scores_gemma":[0.00003207567,0.00045985793,0.004583699,0.00046557243,0.00009105704,0.0014766835,0.0007978469,0.19458975,0.005551084,0.6684048,0.12342412,0.00012349166],"about_ca_topic_score_codex":0.0012051384,"about_ca_topic_score_gemma":0.0010820471,"teacher_disagreement_score":0.0033047036,"about_ca_system_score_codex":0.0012100228,"about_ca_system_score_gemma":0.00089217775,"threshold_uncertainty_score":0.011532605},"labels":[],"label_agreement":null},{"id":"W2028067429","doi":"10.1016/j.comcom.2008.10.012","title":"QoS routing with traffic distribution in mobile ad hoc networks","year":2008,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer network; Computer science; Ad hoc On-Demand Distance Vector Routing; Distributed computing; Mobile ad hoc network; Optimized Link State Routing Protocol; Adaptive quality of service multi-hop routing; Routing protocol; Wireless Routing Protocol; Destination-Sequenced Distance Vector routing; Dynamic Source Routing; Network packet","score_opus":0.021641454277954168,"score_gpt":0.24010513500811817,"score_spread":0.218463680730164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028067429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01287042,0.0020276369,0.9801942,0.0006656413,0.00028737035,0.00004012983,0.000030884028,0.000419677,0.0034641568],"genre_scores_gemma":[0.74879,0.0034548573,0.23707446,0.0002802661,0.0012263247,0.0001293001,0.00012179714,0.00021992002,0.008703092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983652,0.0007275923,0.00006264947,0.00017410416,0.00054073933,0.0001297845],"domain_scores_gemma":[0.99664694,0.0023743578,0.0001697908,0.00031394142,0.00040514872,0.00008977527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032712405,0.00094516104,0.00093958393,0.0011624238,0.0007553239,0.0016607605,0.0017711299,0.0012058285,0.0020715138],"category_scores_gemma":[0.0087886825,0.0007867912,0.00031150403,0.0021834217,0.0015654855,0.0035443858,0.0014207095,0.0014821542,0.0005086838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047340317,0.00015176977,0.0012159398,0.00022826469,0.000054544445,0.0001731978,0.00017397104,0.56107026,0.005279172,0.18529513,0.004564214,0.24132007],"study_design_scores_gemma":[0.0000236498,0.00004721296,0.000107299165,0.000013215396,0.000018478726,0.00009213573,0.000022069238,0.9220211,0.0011553406,0.07365783,0.0028310816,0.000010475156],"about_ca_topic_score_codex":0.0013648636,"about_ca_topic_score_gemma":0.0010522793,"teacher_disagreement_score":0.0032712405,"about_ca_system_score_codex":0.001285475,"about_ca_system_score_gemma":0.0006652111,"threshold_uncertainty_score":0.017300189},"labels":[],"label_agreement":null},{"id":"W2028884287","doi":"10.1016/j.comcom.2010.03.017","title":"QoSNET: An integrated QoS network for routing protocols in large scale wireless sensor networks","year":2010,"lang":"en","type":"article","venue":"Computer Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Computer network; Multipath routing; Routing protocol; Quality of service; Dynamic Source Routing; Distributed computing; Geographic routing; Network packet; Static routing; Wireless sensor network; Wireless Routing Protocol; Link-state routing protocol","score_opus":0.026419652156718966,"score_gpt":0.29781907411249625,"score_spread":0.27139942195577726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028884287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019204268,0.0012176872,0.9562648,0.00057621975,0.00055046706,0.00027112087,0.00063080824,0.015975187,0.0053094183],"genre_scores_gemma":[0.33487517,0.0021402729,0.64110816,0.00082715455,0.0005351131,0.0006996951,0.004005239,0.001979071,0.013829998],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926215,0.00014052492,0.000053268916,0.000105508276,0.00036487312,0.00007366261],"domain_scores_gemma":[0.998801,0.00034104186,0.00011948723,0.00024371302,0.0003281986,0.00016651736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002019164,0.00067730685,0.0006851478,0.00079744734,0.00063827494,0.0012614417,0.0017916731,0.0006920353,0.0035180703],"category_scores_gemma":[0.0032982123,0.00044374503,0.00031189868,0.0007502185,0.00065094524,0.0023177112,0.0015547215,0.0014582784,0.0009674134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027406765,0.0004909448,0.0031963666,0.00083691714,0.00019582901,0.00029481604,0.00049906166,0.16263933,0.07161008,0.09082357,0.073322035,0.59335035],"study_design_scores_gemma":[0.00022865251,0.00039949644,0.00078898616,0.000084295156,0.00011189168,0.00023977528,0.00006669275,0.85753375,0.030977743,0.021277795,0.08821258,0.00007829549],"about_ca_topic_score_codex":0.0017804716,"about_ca_topic_score_gemma":0.0025591615,"teacher_disagreement_score":0.0035180703,"about_ca_system_score_codex":0.00085068564,"about_ca_system_score_gemma":0.0010262791,"threshold_uncertainty_score":0.011769116},"labels":[],"label_agreement":null},{"id":"W2030818667","doi":"10.1016/j.comcom.2014.06.008","title":"Real-time PON signaling for emerging low-latency applications","year":2014,"lang":"en","type":"article","venue":"Computer Communications","topic":"Optical Network Technologies","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Computer science; Optical line termination; Quality of service; Latency (audio); Cloud computing; Computer network; Passive optical network; Dynamic bandwidth allocation; Telecommunications; Wavelength-division multiplexing; Operating system","score_opus":0.013042665994896063,"score_gpt":0.23871342205080906,"score_spread":0.225670756055913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030818667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3334926,0.0046343333,0.5939765,0.0019211654,0.0007614754,0.00019471742,0.0003630287,0.0032446468,0.0614116],"genre_scores_gemma":[0.9498658,0.00087853573,0.035693295,0.0001653705,0.000111744805,0.000025174311,0.00017877197,0.000062369436,0.01301895],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986684,0.00002096606,0.000004958342,0.000019878495,0.000052566003,0.00003472963],"domain_scores_gemma":[0.9996594,0.000095670934,0.000045607132,0.00004320991,0.00012785105,0.000028152508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043439335,0.0003031011,0.0001421274,0.00023358128,0.00039511386,0.00088526186,0.0005825165,0.00028005955,0.006265533],"category_scores_gemma":[0.0007209847,0.000086308166,0.000069507456,0.00021055335,0.00020506555,0.00095005584,0.00031855027,0.00056224613,0.0007585193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078465685,0.0002434138,0.0027870496,0.00041779378,0.000031666455,0.00050820457,0.00030682713,0.01966456,0.52671164,0.081159055,0.009458348,0.35792673],"study_design_scores_gemma":[0.00006727111,0.00094130245,0.0034715,0.00015520571,0.0000743164,0.0011747769,0.00032557544,0.595571,0.29375976,0.03798124,0.06641228,0.00006588246],"about_ca_topic_score_codex":0.0009129186,"about_ca_topic_score_gemma":0.0029013641,"teacher_disagreement_score":0.006265533,"about_ca_system_score_codex":0.00047516558,"about_ca_system_score_gemma":0.00063498056,"threshold_uncertainty_score":0.020960271},"labels":[],"label_agreement":null},{"id":"W2030934401","doi":"10.1016/j.comcom.2004.06.005","title":"A fast string search algorithm for deep packet classification","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Algorithm; Time complexity; String (physics); Commentz-Walter algorithm; Set (abstract data type); String searching algorithm; Boyer–Moore string search algorithm; Network packet; Pattern matching; Artificial intelligence; Mathematics","score_opus":0.07407034828581271,"score_gpt":0.32024497699178534,"score_spread":0.24617462870597262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030934401","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058639334,0.00046614604,0.98872954,0.00019147818,0.00018149927,0.0000957248,0.00033860057,0.003079056,0.0010539402],"genre_scores_gemma":[0.060336024,0.00040173047,0.9299536,0.00026155813,0.00016612776,0.00033273132,0.0015591324,0.00033876038,0.0066504115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890494,0.00023063376,0.000109635424,0.00019887714,0.00045072645,0.00010509875],"domain_scores_gemma":[0.9979504,0.00093146396,0.00009304171,0.00043940914,0.00051313743,0.000072659845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001422086,0.0011616101,0.0015782372,0.0026250079,0.0011491221,0.0016305519,0.0021710105,0.0019878054,0.010390883],"category_scores_gemma":[0.0053125126,0.00058669184,0.0008291826,0.0043161362,0.0006587527,0.0024491188,0.0020700376,0.0022685812,0.0059296107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038356095,0.00013469058,0.0004617728,0.00009801127,0.00005718964,0.000069149326,0.00004769359,0.020894703,0.008498925,0.012561425,0.012804333,0.94398844],"study_design_scores_gemma":[0.0001293033,0.00015913515,0.00052423705,0.00003633423,0.000053427775,0.00022218836,0.000043820968,0.9382352,0.011625656,0.039844237,0.009089416,0.000037005975],"about_ca_topic_score_codex":0.0035258755,"about_ca_topic_score_gemma":0.004254504,"teacher_disagreement_score":0.010390883,"about_ca_system_score_codex":0.00079001614,"about_ca_system_score_gemma":0.002120734,"threshold_uncertainty_score":0.034760952},"labels":[],"label_agreement":null},{"id":"W2033790292","doi":"10.1016/j.comcom.2008.01.055","title":"Adaptive handoff scheme for heterogeneous IP wireless networks","year":2008,"lang":"en","type":"article","venue":"Computer Communications","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Roaming; Handover; Computer network; Wireless network; Mobility management; Node (physics); Wireless; Heterogeneous network; Context (archaeology); Mobile IP; Protocol (science); Distributed computing; Telecommunications","score_opus":0.04050170061794534,"score_gpt":0.23602185330498748,"score_spread":0.19552015268704215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033790292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24669726,0.0008047333,0.74481314,0.00027973752,0.0004333013,0.00020614626,0.00014201921,0.0012401108,0.0053834496],"genre_scores_gemma":[0.94907403,0.00014125659,0.048387468,0.00007681906,0.0000857559,0.000045405144,0.00012585829,0.000019629562,0.0020437979],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995172,0.00010077618,0.00004120217,0.0000643973,0.0001554853,0.000120870536],"domain_scores_gemma":[0.9991774,0.0002128539,0.00006626263,0.00020887594,0.00024005066,0.000094566996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007142556,0.00039937047,0.0005898448,0.0007381728,0.00094860996,0.0004604643,0.0013193482,0.0005854261,0.0014325584],"category_scores_gemma":[0.0011472037,0.00018098511,0.00026160627,0.0004780475,0.00035145134,0.0007355343,0.0010553292,0.0009288317,0.00027736244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034967465,0.00079838844,0.004593505,0.0001729182,0.00022403884,0.0013856655,0.00047482812,0.12011775,0.29663295,0.025770558,0.007953839,0.53837883],"study_design_scores_gemma":[0.00015113347,0.00054793665,0.0032693867,0.000013323096,0.00011823015,0.0006830796,0.00009638241,0.9662208,0.019451963,0.0063557397,0.0030272317,0.00006483719],"about_ca_topic_score_codex":0.0011885773,"about_ca_topic_score_gemma":0.0017421343,"teacher_disagreement_score":0.0014325584,"about_ca_system_score_codex":0.0004972104,"about_ca_system_score_gemma":0.00036209213,"threshold_uncertainty_score":0.0047923923},"labels":[],"label_agreement":null},{"id":"W2034011337","doi":"10.1016/j.comcom.2006.07.016","title":"A mobility management model based on users’ mobility profiles for IPv6 networks","year":2006,"lang":"en","type":"article","venue":"Computer Communications","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Mobility management; Mobility model; IPv6; Computer network; Mobile IP; Telecommunications; World Wide Web; Mobile computing; The Internet","score_opus":0.02072082051961459,"score_gpt":0.24123484866638445,"score_spread":0.22051402814676985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034011337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014090349,0.0002851027,0.9787089,0.0005175831,0.00024064812,0.00020250135,0.00028481733,0.0012559716,0.0044140983],"genre_scores_gemma":[0.6616969,0.0011515048,0.32586893,0.0002587729,0.00033286627,0.0007698794,0.0016507182,0.00024082465,0.008029663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987122,0.00041756016,0.00018136254,0.00014156786,0.00039622633,0.00015110605],"domain_scores_gemma":[0.9984843,0.00042923857,0.00013759895,0.0002954748,0.0005292878,0.00012411672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024649925,0.00078388903,0.0007592276,0.0013139879,0.0011086114,0.0019699147,0.0020764847,0.0011363687,0.0012640241],"category_scores_gemma":[0.0036633674,0.00044076613,0.0008042234,0.0010356397,0.0005987889,0.004321047,0.0014115396,0.0015434803,0.0008301649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004997078,0.00035465014,0.0031761844,0.0001693965,0.00012734573,0.00047560307,0.0008087657,0.37322167,0.009617544,0.45283797,0.015371645,0.14333953],"study_design_scores_gemma":[0.000024666375,0.000098645934,0.00032697356,0.00003385742,0.00006725329,0.00014570182,0.00006268911,0.95512784,0.0017109249,0.030563634,0.011792408,0.00004541568],"about_ca_topic_score_codex":0.0047953674,"about_ca_topic_score_gemma":0.0044293706,"teacher_disagreement_score":0.0047953674,"about_ca_system_score_codex":0.0011088327,"about_ca_system_score_gemma":0.0016289513,"threshold_uncertainty_score":0.013036311},"labels":[],"label_agreement":null},{"id":"W2034176698","doi":"10.1016/j.comcom.2008.11.020","title":"Semantic partitioning of peer-to-peer search space","year":2008,"lang":"en","type":"article","venue":"Computer Communications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Distributed hash table; Scalability; Overlay network; Partition (number theory); Peer-to-peer; Ontology; Hash table; Tree (set theory); Computer network; Node (physics); Distributed computing; Hash function; Database; World Wide Web; The Internet","score_opus":0.0768528716881432,"score_gpt":0.3084912734126142,"score_spread":0.23163840172447098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034176698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11911776,0.001627152,0.8640113,0.00060379255,0.0001182568,0.00037808414,0.00069451233,0.001276102,0.0121730985],"genre_scores_gemma":[0.6987844,0.00089471426,0.29437524,0.00009018782,0.000057283145,0.00025368255,0.0016441082,0.00023183464,0.0036684717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985221,0.0004641404,0.000118772296,0.0002114008,0.0004980231,0.00018553714],"domain_scores_gemma":[0.9983279,0.0005360346,0.00008972657,0.00043154933,0.0004969916,0.00011783531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010198777,0.0003851973,0.0011391954,0.0016719532,0.0014261629,0.0021359243,0.001480014,0.0008835437,0.0020514054],"category_scores_gemma":[0.00454103,0.00032130297,0.00057776726,0.0023290773,0.00078544207,0.003830658,0.0016969563,0.000617366,0.0005384604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010296985,0.00046358004,0.003751305,0.0010524638,0.0001589977,0.00042237833,0.0016760489,0.24437058,0.041407414,0.31537384,0.014009523,0.3762841],"study_design_scores_gemma":[0.00005949581,0.00016333138,0.0013834318,0.00008209364,0.00010472166,0.00037593042,0.0009581834,0.75920314,0.015543413,0.20143567,0.020642446,0.00004810312],"about_ca_topic_score_codex":0.002235766,"about_ca_topic_score_gemma":0.0030673933,"teacher_disagreement_score":0.002235766,"about_ca_system_score_codex":0.0008816541,"about_ca_system_score_gemma":0.0016853284,"threshold_uncertainty_score":0.0068626404},"labels":[],"label_agreement":null},{"id":"W2034810131","doi":"10.1016/j.comcom.2010.12.015","title":"p-Cycle protection at the glass fiber level","year":2011,"lang":"en","type":"article","venue":"Computer Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Fiber; Computer security; Composite material; Materials science","score_opus":0.08967147881557279,"score_gpt":0.2448496139703817,"score_spread":0.15517813515480894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034810131","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6735183,0.002003782,0.20537513,0.0013828734,0.00045472945,0.00030951094,0.0005479308,0.0035049513,0.11290277],"genre_scores_gemma":[0.97730696,0.000274829,0.009536238,0.0001240753,0.00004548732,0.000028164692,0.00009775808,0.000075025375,0.0125115365],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997123,0.00002162293,0.000008764258,0.000058456175,0.000104626146,0.00009418486],"domain_scores_gemma":[0.9995894,0.00006682479,0.000059781225,0.00012164181,0.00013044963,0.000031848766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021535109,0.0002950986,0.00022243756,0.0006273038,0.0012704942,0.0008349864,0.0007222318,0.0007846521,0.0074439356],"category_scores_gemma":[0.0005022395,0.00019324082,0.00029595033,0.0003978378,0.0006246709,0.001114564,0.00086471613,0.0006243879,0.0014738357],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013789661,0.0001480219,0.0060169823,0.00045086458,0.00008841904,0.00095026876,0.00071892905,0.008272649,0.71869576,0.09928158,0.009760842,0.1542368],"study_design_scores_gemma":[0.000044523356,0.0006738925,0.0038576538,0.00010009285,0.00005730892,0.0005929417,0.00019424371,0.03135937,0.8874903,0.031758353,0.043822944,0.00004829527],"about_ca_topic_score_codex":0.0033977828,"about_ca_topic_score_gemma":0.0035753401,"teacher_disagreement_score":0.0074439356,"about_ca_system_score_codex":0.0008764046,"about_ca_system_score_gemma":0.0011796149,"threshold_uncertainty_score":0.024902463},"labels":[],"label_agreement":null},{"id":"W2038044579","doi":"10.1016/j.comcom.2005.02.004","title":"Stochastic processes for computer network traffic modeling","year":2005,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Traffic generation model; Fractional Brownian motion; Fractal; Wireless network; Stochastic process; Network traffic simulation; Gaussian; Computer network; Noise (video); Wireless; Distributed computing; Network traffic control; Artificial intelligence; Telecommunications; Brownian motion; Mathematics","score_opus":0.038407457998326094,"score_gpt":0.26585589609081406,"score_spread":0.22744843809248796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038044579","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003985728,0.004887731,0.98626524,0.0008697813,0.0004567708,0.00004567814,0.00025749262,0.00020545571,0.003026143],"genre_scores_gemma":[0.58946735,0.034036502,0.33280304,0.0011818877,0.00434167,0.0010002606,0.001958699,0.00068870204,0.034521975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867564,0.0005388424,0.00010231884,0.00016878117,0.00040768014,0.000106849795],"domain_scores_gemma":[0.99568546,0.0028954754,0.00037761274,0.00032839118,0.000548437,0.000164584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024933442,0.0017518846,0.0026470996,0.0016018776,0.0007705516,0.0021703534,0.002221843,0.0025630167,0.0040132008],"category_scores_gemma":[0.010016596,0.0009923304,0.0014577362,0.0028567894,0.0014666392,0.0028014332,0.0016846082,0.004395524,0.0012354625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020843278,0.000056788216,0.00031842804,0.00015594593,0.000069803886,0.00007383638,0.000048237882,0.37704223,0.0005759925,0.5960801,0.004146784,0.021411046],"study_design_scores_gemma":[0.000008556381,0.000008026838,0.00007393312,0.00001990107,0.000014476099,0.000018348015,0.000007975279,0.7854598,0.00008648663,0.21093208,0.0033608994,0.000009463638],"about_ca_topic_score_codex":0.008699196,"about_ca_topic_score_gemma":0.005599265,"teacher_disagreement_score":0.008699196,"about_ca_system_score_codex":0.0019641155,"about_ca_system_score_gemma":0.0018711123,"threshold_uncertainty_score":0.017297149},"labels":[],"label_agreement":null},{"id":"W2039469367","doi":"10.1016/j.comcom.2007.10.024","title":"A game-theoretic intrusion detection model for mobile ad hoc networks","year":2007,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Intrusion detection system; Mobile ad hoc network; Overhead (engineering); Node (physics); Network packet; Computer network; Wireless ad hoc network; Resource allocation; Distributed computing; Resource (disambiguation); Service (business); Computer security; Wireless; Operating system","score_opus":0.021884445407752043,"score_gpt":0.2752206278828226,"score_spread":0.25333618247507056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039469367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023374205,0.00042957198,0.9648201,0.0013438157,0.0001264336,0.00023438406,0.0002285124,0.00019565543,0.009247236],"genre_scores_gemma":[0.880258,0.0008376221,0.1050292,0.00043373348,0.00018471462,0.00045258048,0.00020881504,0.000049634164,0.01254572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99662447,0.0016674398,0.00012919224,0.0005104164,0.00068162853,0.00038697824],"domain_scores_gemma":[0.99532396,0.0032477856,0.0003660448,0.00022914758,0.00051179377,0.00032134837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031899225,0.0015335104,0.0021033569,0.0011914695,0.0009354713,0.0035636043,0.0046049994,0.0030497655,0.002932112],"category_scores_gemma":[0.008090634,0.0009182679,0.001219011,0.0014979757,0.0026448686,0.004386266,0.0022831496,0.0025716713,0.0006305228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016376389,0.00015376699,0.0006824797,0.00013086152,0.00010330498,0.00025332966,0.00021717609,0.5961924,0.0015278505,0.3835328,0.0025021466,0.014540086],"study_design_scores_gemma":[0.000036889054,0.000054675842,0.00006017974,0.000008330159,0.000021269008,0.00005824105,0.000019687806,0.92325664,0.00011371181,0.07539206,0.0009625528,0.000015814816],"about_ca_topic_score_codex":0.005340953,"about_ca_topic_score_gemma":0.0037406979,"teacher_disagreement_score":0.005340953,"about_ca_system_score_codex":0.002745442,"about_ca_system_score_gemma":0.0020245267,"threshold_uncertainty_score":0.019919634},"labels":[],"label_agreement":null},{"id":"W2041747596","doi":"10.1016/j.comcom.2004.08.001","title":"TCP Prairie: a sender-only TCP modification based on adaptive bandwidth estimation in wired-wireless networks","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"TCP Westwood plus; Computer science; TCP global synchronization; Burstiness; TCP Friendly Rate Control; CUBIC TCP; TCP acceleration; Computer network; Zeta-TCP; Compound TCP; HSTCP; TCP Westwood; H-TCP; Real-time computing; Network congestion; Network packet","score_opus":0.03000912760053793,"score_gpt":0.2631458857583733,"score_spread":0.23313675815783536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041747596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08838943,0.0014830263,0.86998135,0.0005305738,0.0013809531,0.0006703919,0.00017516843,0.03383053,0.0035586134],"genre_scores_gemma":[0.7230499,0.0003898372,0.26739722,0.0004356545,0.00041195322,0.00024364004,0.00025672125,0.0012108071,0.006604302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839157,0.0003929428,0.00010917206,0.00032907363,0.0006034355,0.00017382936],"domain_scores_gemma":[0.9964768,0.0009541857,0.00027329836,0.0013906517,0.00062186434,0.00028309497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026707635,0.0009410788,0.001301452,0.0011005858,0.0009586758,0.0009930889,0.0036192723,0.0009187852,0.0021988438],"category_scores_gemma":[0.005767849,0.00067469,0.00052936596,0.00042346772,0.0009075142,0.0018818034,0.0018560783,0.0028227726,0.00081896264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005108265,0.0016045597,0.006924869,0.00040248068,0.0005207998,0.0009905066,0.00043269162,0.038347896,0.18213326,0.012354016,0.021158215,0.7300225],"study_design_scores_gemma":[0.0006410864,0.0013371196,0.0043286835,0.0000392389,0.0005104513,0.0017073926,0.00006170644,0.8117986,0.15119848,0.006264973,0.021853449,0.00025877677],"about_ca_topic_score_codex":0.001075216,"about_ca_topic_score_gemma":0.0018293383,"teacher_disagreement_score":0.0036192723,"about_ca_system_score_codex":0.00042135033,"about_ca_system_score_gemma":0.0008269858,"threshold_uncertainty_score":0.014124513},"labels":[],"label_agreement":null},{"id":"W2044138969","doi":"10.1016/s0140-3664(03)00116-6","title":"Context independent unique state identification sequences for testing communication protocols modelled as extended finite state machines","year":2003,"lang":"en","type":"article","venue":"Computer Communications","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Nortel (Canada)","funders":"","keywords":"Extended finite-state machine; Computer science; Finite-state machine; Executable; Observability; Sequence (biology); Identification (biology); Conformance testing; Context (archaeology); State (computer science); Theoretical computer science; Control flow; Algorithm; Mathematics; Programming language","score_opus":0.09491792874771247,"score_gpt":0.3503298570391113,"score_spread":0.2554119282913988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044138969","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14649078,0.0002882292,0.84826374,0.00017399745,0.000054169966,0.00020619402,0.00016938055,0.0031177944,0.0012357532],"genre_scores_gemma":[0.8030507,0.0001030736,0.1950382,0.00013692697,0.000030837655,0.0003736655,0.00032949916,0.00025044894,0.0006866625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9874669,0.0055910065,0.00096815266,0.0017904687,0.0031427883,0.0010407089],"domain_scores_gemma":[0.9284917,0.05482225,0.004777742,0.007881508,0.0029366654,0.0010900687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077997902,0.0017016417,0.0017124059,0.002290123,0.0008506042,0.0016293057,0.0028286993,0.0022285944,0.0017722212],"category_scores_gemma":[0.03747699,0.0010781181,0.0014318874,0.0010897804,0.0033765868,0.0057746535,0.0032791158,0.0034342324,0.00026662377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004893072,0.0011053708,0.010764751,0.0011692446,0.0003328228,0.0016004161,0.0015972081,0.45197842,0.037815977,0.32085985,0.0019149414,0.16596797],"study_design_scores_gemma":[0.00016869236,0.00054568565,0.0006998522,0.0001587939,0.00013824346,0.00027661677,0.000110869536,0.8143495,0.027250715,0.15544395,0.00078618276,0.0000710112],"about_ca_topic_score_codex":0.001176895,"about_ca_topic_score_gemma":0.0016827504,"teacher_disagreement_score":0.0077997902,"about_ca_system_score_codex":0.0014744259,"about_ca_system_score_gemma":0.0025831994,"threshold_uncertainty_score":0.041249692},"labels":[],"label_agreement":null},{"id":"W2044884901","doi":"10.1016/j.comcom.2004.07.003","title":"Proportional loss rate differentiation in a FIFO queue","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; FIFO (computing and electronics); Queue; Real-time computing; Computer network; Operating system","score_opus":0.018645383823527078,"score_gpt":0.2462081777786052,"score_spread":0.22756279395507814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044884901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20649168,0.0011393636,0.7845563,0.00077776914,0.00051007635,0.00014191406,0.000091017224,0.00083159393,0.0054602944],"genre_scores_gemma":[0.9159385,0.00038201566,0.07582514,0.000206662,0.00015415218,0.000055608532,0.00005071304,0.000060940325,0.007326228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989066,0.00024766073,0.0000811557,0.0001497067,0.0004032867,0.00021142977],"domain_scores_gemma":[0.996064,0.0021239158,0.00030459877,0.00042816665,0.0007897,0.0002896134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038553432,0.00056817394,0.0008604845,0.000863194,0.0012347767,0.0019953097,0.0019132547,0.00083835877,0.0023095368],"category_scores_gemma":[0.0074653695,0.00054124004,0.00030730327,0.0009566999,0.0009947555,0.002041517,0.0010105016,0.0012819335,0.00036624426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0044300426,0.00094684254,0.0063325153,0.00031311458,0.000090915986,0.000606041,0.0011047416,0.38976833,0.047660954,0.3599305,0.006182812,0.18263325],"study_design_scores_gemma":[0.00013728986,0.00017905155,0.00025618688,0.000014919673,0.000047376703,0.000079174686,0.000036418496,0.9696876,0.0049633365,0.023480758,0.0010869066,0.00003110942],"about_ca_topic_score_codex":0.005976697,"about_ca_topic_score_gemma":0.005335269,"teacher_disagreement_score":0.005976697,"about_ca_system_score_codex":0.002095866,"about_ca_system_score_gemma":0.0021961231,"threshold_uncertainty_score":0.020389259},"labels":[],"label_agreement":null},{"id":"W2045700287","doi":"10.1016/s0140-3664(01)00433-9","title":"Weighted fair discard scheme for buffer management in the presence of network congestion","year":2002,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Manitoba","funders":"","keywords":"Computer science; Scheme (mathematics); Buffer (optical fiber); Computer network; Network congestion; Congestion management; Telecommunications; Mathematics","score_opus":0.038657331286538844,"score_gpt":0.25708824016499876,"score_spread":0.21843090887845992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045700287","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16517036,0.0011707965,0.8295631,0.00040625216,0.00048479592,0.00015967111,0.00013171844,0.00073460763,0.0021787751],"genre_scores_gemma":[0.95093095,0.00022980428,0.046243176,0.00011962008,0.00013209268,0.000048985727,0.00007852893,0.000035750243,0.0021812096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987465,0.0002783839,0.000085874264,0.00018527167,0.00038544467,0.00031850982],"domain_scores_gemma":[0.9964455,0.0014044809,0.00025086946,0.0007734018,0.0008646363,0.0002611445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004692155,0.000782057,0.0013824834,0.0010722659,0.0023345605,0.0021507915,0.0037422494,0.0010724595,0.0015437934],"category_scores_gemma":[0.0066929525,0.000383631,0.00039678262,0.0009670463,0.0012618852,0.0030609623,0.0017799626,0.0013436736,0.00020238014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0057612793,0.0009567265,0.0051506055,0.00038507095,0.00038073573,0.00097229145,0.0011330025,0.37139204,0.06805489,0.1732231,0.008988825,0.36360148],"study_design_scores_gemma":[0.00013011333,0.00028028488,0.00044627336,0.000020549001,0.00015843271,0.00014532088,0.00007767784,0.9526698,0.008590424,0.035174206,0.0022460285,0.000061034374],"about_ca_topic_score_codex":0.0037398464,"about_ca_topic_score_gemma":0.0065673944,"teacher_disagreement_score":0.004692155,"about_ca_system_score_codex":0.0017272317,"about_ca_system_score_gemma":0.0025312547,"threshold_uncertainty_score":0.024814785},"labels":[],"label_agreement":null},{"id":"W2046601886","doi":"10.1016/j.comcom.2012.09.003","title":"Differentiated quality-of-protection in survivable WDM mesh networks using p-structures","year":2012,"lang":"en","type":"article","venue":"Computer Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Computer network; Wavelength-division multiplexing; Mesh networking; Telecommunications; Optoelectronics; Wireless","score_opus":0.08573826848500887,"score_gpt":0.305462829160637,"score_spread":0.21972456067562812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046601886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38724458,0.000824808,0.6028969,0.00049879216,0.000093047,0.00007584575,0.00007001901,0.00025231455,0.008043681],"genre_scores_gemma":[0.96927947,0.00020829425,0.028916674,0.00005807697,0.00002937438,0.00002403616,0.00003606188,0.000015549267,0.0014324507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976546,0.00007509887,0.0000144127935,0.00003224708,0.00007719062,0.000035600977],"domain_scores_gemma":[0.99927706,0.00031055283,0.00009588667,0.00012406883,0.00015564566,0.000036800557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076141686,0.00025474423,0.00024138672,0.00029799115,0.0004913025,0.0008473926,0.000924471,0.00045296157,0.00086443604],"category_scores_gemma":[0.0016327415,0.00023435023,0.00019501998,0.0003114856,0.0005633724,0.00097150577,0.0006763323,0.00052241626,0.00016097641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015102455,0.00025707897,0.0030580573,0.00026975552,0.00006796807,0.0006071856,0.0005440695,0.34459466,0.1349367,0.29711756,0.0028584518,0.21417823],"study_design_scores_gemma":[0.00006602086,0.00021347801,0.00053791446,0.00002545865,0.00002683651,0.00020446176,0.00006399645,0.93223774,0.014789052,0.0503359,0.0014805739,0.000018554147],"about_ca_topic_score_codex":0.0008717273,"about_ca_topic_score_gemma":0.001334945,"teacher_disagreement_score":0.00092945795,"about_ca_system_score_codex":0.00092945795,"about_ca_system_score_gemma":0.00048347702,"threshold_uncertainty_score":0.006743729},"labels":[],"label_agreement":null},{"id":"W2049020424","doi":"10.1016/s0140-3664(00)00245-0","title":"On object initialization in the Java bytecode","year":2000,"lang":"en","type":"article","venue":"Computer Communications","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Java bytecode; Serialization; Initialization; Java; Programming language; Correctness; Dataflow; Object (grammar); Java Modeling Language; Bytecode; Process (computing); Software portability; strictfp; Operating system; Java annotation; Real time Java; Artificial intelligence","score_opus":0.05286382080372038,"score_gpt":0.302949380646719,"score_spread":0.25008555984299863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049020424","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029721197,0.001808477,0.9213883,0.0013064318,0.00072415586,0.00009015562,0.00011457153,0.0036230488,0.041223597],"genre_scores_gemma":[0.6427633,0.004605799,0.29689893,0.0013834952,0.0010707653,0.0002308612,0.0008582624,0.0053781653,0.046810396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973924,0.0006159649,0.00016233057,0.00035196138,0.00096715434,0.00051016366],"domain_scores_gemma":[0.99512947,0.002706083,0.00023573123,0.0011004205,0.0007062256,0.000122065634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024323703,0.0010181866,0.0010006821,0.0018425041,0.0017128959,0.0037308696,0.0019886673,0.0016175298,0.0059938943],"category_scores_gemma":[0.010320162,0.0010560061,0.0013316764,0.001944037,0.004540425,0.009555914,0.003467733,0.003753851,0.0019743652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003236174,0.000060880582,0.0015242967,0.00013944611,0.000021362332,0.00029854843,0.0006482661,0.020521145,0.003416688,0.8448066,0.00927423,0.11896495],"study_design_scores_gemma":[0.000047864243,0.000067988396,0.0008492916,0.00023387303,0.000063166524,0.00022201987,0.0001247983,0.12770633,0.013795365,0.8261349,0.030666264,0.00008809192],"about_ca_topic_score_codex":0.009996549,"about_ca_topic_score_gemma":0.0074751875,"teacher_disagreement_score":0.009996549,"about_ca_system_score_codex":0.00216938,"about_ca_system_score_gemma":0.0017316204,"threshold_uncertainty_score":0.020051599},"labels":[],"label_agreement":null},{"id":"W2050569676","doi":"10.1016/j.comcom.2007.04.012","title":"A DoS and fault-tolerant authentication protocol for group communications in ad hoc networks","year":2007,"lang":"en","type":"article","venue":"Computer Communications","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Denial-of-service attack; Session key; Robustness (evolution); Authentication protocol; Wireless ad hoc network; Encryption; Forward secrecy; Group key; Computer security; Authentication (law); Wireless; Public-key cryptography; Telecommunications","score_opus":0.05715461375082519,"score_gpt":0.3505459649019393,"score_spread":0.2933913511511141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050569676","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03651258,0.0017398116,0.95117193,0.00088475837,0.00102259,0.0005084026,0.0001352584,0.0035557712,0.0044688648],"genre_scores_gemma":[0.7119382,0.0013674726,0.26791248,0.00047015658,0.0006971145,0.00058149954,0.00036982246,0.00024464205,0.016418574],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983931,0.00033397405,0.00015956828,0.00014714315,0.00082077837,0.00014535982],"domain_scores_gemma":[0.9965167,0.0008405928,0.0003757064,0.0012073437,0.0008198024,0.00023979395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019543616,0.00082568586,0.0011589233,0.001070545,0.0020520985,0.0013249813,0.0020510303,0.0012247174,0.0024610185],"category_scores_gemma":[0.0048369328,0.0004440581,0.00052132807,0.0006982547,0.0018440798,0.0039164973,0.0029788043,0.0018481638,0.0010999584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030931956,0.00051308656,0.0027811017,0.0008409885,0.00022699697,0.001260237,0.0016109558,0.074654154,0.09954934,0.25321612,0.026704045,0.53554976],"study_design_scores_gemma":[0.0006420569,0.0016950659,0.0014884699,0.0001310905,0.000393901,0.002243673,0.0005307746,0.70077693,0.0818605,0.11899331,0.090961486,0.00028278012],"about_ca_topic_score_codex":0.00068333565,"about_ca_topic_score_gemma":0.000770397,"teacher_disagreement_score":0.0024610185,"about_ca_system_score_codex":0.00080026774,"about_ca_system_score_gemma":0.0010146763,"threshold_uncertainty_score":0.010335803},"labels":[],"label_agreement":null},{"id":"W2053034494","doi":"10.1016/j.comcom.2010.01.023","title":"Trust management in ubiquitous computing: A Bayesian approach","year":2010,"lang":"en","type":"article","venue":"Computer Communications","topic":"Access Control and Trust","field":"Social Sciences","cited_by":89,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Guelph","funders":"","keywords":"Computer science; Trust management (information system); Ubiquitous computing; Scheme (mathematics); Task (project management); Trustworthiness; Probabilistic logic; Human–computer interaction; Computer security; End-user computing; Distributed computing; Artificial intelligence; Utility computing; Cloud computing","score_opus":0.0300447031888077,"score_gpt":0.32410119286754596,"score_spread":0.29405648967873826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053034494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017837264,0.0012813932,0.9733455,0.0030421393,0.00006611887,0.000052756754,0.000084871266,0.000054468455,0.0042355317],"genre_scores_gemma":[0.8598741,0.0030941502,0.1315255,0.0004933447,0.0005406382,0.00023969842,0.00013221204,0.000043848006,0.0040565697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930247,0.004016516,0.00036170296,0.00096819166,0.0012349772,0.00039390824],"domain_scores_gemma":[0.95526856,0.037566483,0.002961661,0.0012716327,0.0021939995,0.0007376281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0111203035,0.0010094527,0.003033859,0.00280442,0.001639297,0.005589753,0.0031175758,0.0033908484,0.002892044],"category_scores_gemma":[0.049325112,0.0016537124,0.0016205991,0.0029961716,0.0052068876,0.011687181,0.002812697,0.0044459184,0.00033000356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000911469,0.00014487267,0.0028447832,0.00023248667,0.00030466472,0.00018618772,0.0006519205,0.26717728,0.00032226086,0.6924219,0.0015666016,0.034055814],"study_design_scores_gemma":[0.000028645958,0.00003696087,0.0006477661,0.00005576148,0.000059845075,0.000066208166,0.00011352215,0.4335333,0.000085340165,0.5644279,0.00090107654,0.00004356538],"about_ca_topic_score_codex":0.011621852,"about_ca_topic_score_gemma":0.012173003,"teacher_disagreement_score":0.011621852,"about_ca_system_score_codex":0.0040331446,"about_ca_system_score_gemma":0.0025832325,"threshold_uncertainty_score":0.058810472},"labels":[],"label_agreement":null},{"id":"W2053468050","doi":"10.1016/j.comcom.2004.06.001","title":"An alternative strategy for location update and paging in mobile networks","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Paging; Computer science; Computer network","score_opus":0.056469630202554216,"score_gpt":0.35269320002701054,"score_spread":0.2962235698244563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053468050","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03836556,0.0011552419,0.9364222,0.0015970335,0.0009883116,0.0002875904,0.00027347205,0.0029004687,0.01801007],"genre_scores_gemma":[0.61690956,0.0006874883,0.35502487,0.00090012286,0.00080624735,0.00029046403,0.00036061718,0.00028740696,0.024733199],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976781,0.0006224798,0.0001438776,0.00039984088,0.0007913751,0.00036433485],"domain_scores_gemma":[0.99489504,0.0011460341,0.00020315373,0.0026196705,0.0009007626,0.00023533928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00109387,0.0009792648,0.0017692888,0.0016906173,0.0017259053,0.0033880037,0.003920618,0.002980449,0.0074964548],"category_scores_gemma":[0.005787137,0.0005688497,0.00093601836,0.002368986,0.0014818606,0.0043171467,0.0025119688,0.0015497863,0.0026591772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015706558,0.0006320981,0.0024374516,0.00041167316,0.00023483894,0.00094251166,0.000814049,0.04169707,0.04779602,0.21138585,0.02464099,0.66743684],"study_design_scores_gemma":[0.00051810464,0.001006005,0.0016880013,0.00008735619,0.00042964326,0.0031373203,0.00056680955,0.7384527,0.034344807,0.15977892,0.05976907,0.00022132532],"about_ca_topic_score_codex":0.002658785,"about_ca_topic_score_gemma":0.0033841676,"teacher_disagreement_score":0.0074964548,"about_ca_system_score_codex":0.0008122219,"about_ca_system_score_gemma":0.0013498263,"threshold_uncertainty_score":0.025078118},"labels":[],"label_agreement":null},{"id":"W2053584450","doi":"10.1016/s0140-3664(00)00365-0","title":"An optimization-oriented view of random early detection","year":2001,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Random early detection; Router; Computer network; Active queue management; Queue; Network packet; Network congestion; Transmission Control Protocol; Real-time computing","score_opus":0.015511271740755023,"score_gpt":0.24860345235079284,"score_spread":0.2330921806100378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053584450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037560037,0.0019214988,0.9753945,0.0037761002,0.00024116157,0.000029388826,0.000077529585,0.000081215134,0.014722608],"genre_scores_gemma":[0.6406193,0.010195948,0.3059889,0.003040768,0.0040731863,0.00039743108,0.00030006823,0.00032010558,0.035064306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971861,0.0012873453,0.0001055406,0.0003860327,0.00083664886,0.00019826021],"domain_scores_gemma":[0.99299955,0.004944593,0.0005041922,0.0004573629,0.0008809543,0.00021340443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041108485,0.0015479444,0.0016411555,0.0015226818,0.0007651012,0.0035752777,0.0034120732,0.0025915857,0.0041932683],"category_scores_gemma":[0.013566354,0.0009200716,0.0012092999,0.0012959908,0.003277425,0.0054674647,0.0016828602,0.0032868455,0.0005599964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024832354,0.000021755237,0.00013966061,0.000077124605,0.000031989995,0.00004134802,0.00003629985,0.07546525,0.00038387172,0.91401726,0.0016755047,0.00808511],"study_design_scores_gemma":[0.000014194559,0.000024334859,0.00007416013,0.000019176869,0.000017329468,0.000030998774,0.000009260611,0.25600955,0.00023512455,0.7412607,0.0022895394,0.000015587444],"about_ca_topic_score_codex":0.0022889278,"about_ca_topic_score_gemma":0.0013637053,"teacher_disagreement_score":0.0041932683,"about_ca_system_score_codex":0.0021798892,"about_ca_system_score_gemma":0.0012819775,"threshold_uncertainty_score":0.021740496},"labels":[],"label_agreement":null},{"id":"W2055045269","doi":"10.1016/j.comcom.2007.12.022","title":"Routing and admission control with multiconstrained end-to-end quality of service in MPLS networks","year":2008,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Multiprotocol Label Switching; Computer science; Computer network; End-to-end principle; Quality of service; End-to-end delay; Packet loss; Admission control; Network packet","score_opus":0.040248525526872525,"score_gpt":0.2759314848276511,"score_spread":0.2356829593007786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055045269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1927924,0.00071409455,0.8018449,0.00047024043,0.0001725688,0.00009139312,0.000047890015,0.00078460196,0.0030819657],"genre_scores_gemma":[0.96088725,0.00008327165,0.037461113,0.000059029408,0.000049044742,0.000022170083,0.000019508818,0.000024329158,0.0013943687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986657,0.00044714333,0.00006744085,0.00017965832,0.0004252247,0.00021484803],"domain_scores_gemma":[0.9980769,0.0009571253,0.00015189967,0.00031457152,0.00039017745,0.00010930462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026593439,0.00045716902,0.0006988528,0.00056258065,0.00093150017,0.0015647955,0.0018457745,0.0006639355,0.0009434561],"category_scores_gemma":[0.004863058,0.00047174396,0.0003034047,0.00058177026,0.0011279876,0.0014467975,0.0015536264,0.0011128909,0.00012540123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007984778,0.00032054167,0.0019751673,0.0000477261,0.000059909056,0.00014878344,0.00026642033,0.8085677,0.015072066,0.032393403,0.0010291834,0.13932061],"study_design_scores_gemma":[0.0000073635993,0.000025778789,0.0001974135,0.0000014271708,0.0000075639814,0.000011701378,0.000008298524,0.9951552,0.0014990215,0.0029736813,0.00010605904,0.000006522836],"about_ca_topic_score_codex":0.0066552586,"about_ca_topic_score_gemma":0.00942811,"teacher_disagreement_score":0.0066552586,"about_ca_system_score_codex":0.0014610168,"about_ca_system_score_gemma":0.0010954802,"threshold_uncertainty_score":0.014064133},"labels":[],"label_agreement":null},{"id":"W2057739959","doi":"10.1016/j.comcom.2003.08.019","title":"Hierarchical analysis of RealMedia streaming traffic on an IEEE 802.11b wireless LAN","year":2003,"lang":"en","type":"article","venue":"Computer Communications","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; University of Washington; Cisco Systems","keywords":"Computer science; Computer network; Wireless network; Network packet; Application layer; Burstiness; Retransmission; Network layer; Wireless; Layer (electronics); Telecommunications; Software deployment","score_opus":0.04371029394683832,"score_gpt":0.31070105471083254,"score_spread":0.2669907607639942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057739959","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9351049,0.0001494953,0.059876144,0.00014207985,0.000014679007,0.000032289674,0.00029562382,0.0006903363,0.0036944188],"genre_scores_gemma":[0.99251294,0.000053023137,0.0064077196,0.000016497388,0.000010396241,0.000009089322,0.00024839063,0.00003499906,0.0007068919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9996443,0.00007255531,0.000011965889,0.00004594183,0.00014728104,0.00007798358],"domain_scores_gemma":[0.99861944,0.00060692773,0.00008527213,0.00013063087,0.00047171907,0.000085993306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004054037,0.00031894443,0.00033356485,0.0011680695,0.00047258407,0.00044336062,0.00041572988,0.0002814799,0.0012728778],"category_scores_gemma":[0.0020088474,0.000168404,0.00020594455,0.00078905275,0.00032040087,0.00044700745,0.00034101063,0.00048627952,0.00022167177],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012847199,0.0005507198,0.038100183,0.0001549837,0.00010248018,0.0008576013,0.0005872233,0.63025653,0.16183545,0.019878194,0.0038864575,0.14250545],"study_design_scores_gemma":[0.0000042910965,0.000037339138,0.008845599,0.0000026684759,0.0000069405232,0.000046032463,0.00005990656,0.98500407,0.0042199045,0.0015484341,0.00021665344,0.000008153825],"about_ca_topic_score_codex":0.007813027,"about_ca_topic_score_gemma":0.0067652445,"teacher_disagreement_score":0.007813027,"about_ca_system_score_codex":0.0007070791,"about_ca_system_score_gemma":0.00042397465,"threshold_uncertainty_score":0.015535116},"labels":[],"label_agreement":null},{"id":"W2060388058","doi":"10.1016/j.comcom.2007.12.027","title":"Vertical handoffs as a radio resource management tool","year":2008,"lang":"en","type":"article","venue":"Computer Communications","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Queen's University","funders":"","keywords":"Computer science; Handover; Quality of service; Exploit; Computer network; Radio resource management; Vertical handover; Session (web analytics); Wireless; Cellular network; Resource (disambiguation); Operator (biology); Wireless network; Telecommunications; Computer security; Heterogeneous network","score_opus":0.01961476339688648,"score_gpt":0.22311103768660695,"score_spread":0.20349627428972047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060388058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079305775,0.0009865278,0.84897643,0.0012623395,0.00089989055,0.00016692378,0.0002686318,0.013415531,0.054717995],"genre_scores_gemma":[0.8368733,0.00058901234,0.13808452,0.00026544588,0.00031758123,0.00007906191,0.0003163427,0.00040199226,0.023072723],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902046,0.00025765845,0.000067128254,0.00009975788,0.0004057907,0.00014923792],"domain_scores_gemma":[0.99746716,0.0010879025,0.00016762453,0.0007716259,0.00024662036,0.00025905902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016366778,0.00057026383,0.0003801881,0.0014622541,0.0008366402,0.002304146,0.0012557864,0.00087210245,0.007306723],"category_scores_gemma":[0.0026725894,0.00041617063,0.00033889702,0.0010824528,0.0005985681,0.0022703812,0.0022953257,0.0014066818,0.0014710216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095206604,0.00059874967,0.004418753,0.00023126372,0.00012796467,0.0008615884,0.00092888094,0.026029473,0.08175712,0.15284932,0.022676624,0.7085683],"study_design_scores_gemma":[0.00022528946,0.0010779022,0.0051669227,0.0002180253,0.00037751396,0.0018657189,0.00078377704,0.6255724,0.09301267,0.11086682,0.16061096,0.00022202767],"about_ca_topic_score_codex":0.00065992493,"about_ca_topic_score_gemma":0.00093707663,"teacher_disagreement_score":0.007306723,"about_ca_system_score_codex":0.0003006843,"about_ca_system_score_gemma":0.00043831623,"threshold_uncertainty_score":0.024443448},"labels":[],"label_agreement":null},{"id":"W2060511775","doi":"10.1016/s0140-3664(02)00028-2","title":"QUIPS-II: a simulation tool for the design and performance evaluation of Diffserv-based networks","year":2002,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Distributed computing; Computer architecture; Computer network","score_opus":0.10329345415626871,"score_gpt":0.2877812360696271,"score_spread":0.18448778191335835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060511775","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09002693,0.0006112292,0.8416122,0.0004767788,0.0004584617,0.00072679715,0.0060983156,0.040922865,0.019066405],"genre_scores_gemma":[0.61564904,0.00084400875,0.35928968,0.00047438496,0.000076329925,0.0018653154,0.0065196957,0.0048473882,0.010434131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993237,0.00029091944,0.00004861488,0.000048258084,0.0001979812,0.00009047572],"domain_scores_gemma":[0.99814975,0.00112957,0.00008720607,0.0001633873,0.0003504274,0.000119682714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015440278,0.0014535858,0.0012130031,0.0006984656,0.0005485603,0.00086878403,0.002657444,0.0010172417,0.007439241],"category_scores_gemma":[0.0034133939,0.0009238145,0.0006395485,0.0006146682,0.00041524097,0.0009656772,0.00069608534,0.0017512669,0.0010989347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044069806,0.00027299367,0.0013718805,0.0003116681,0.0001087968,0.00013882079,0.00011765142,0.93960434,0.0060741683,0.010983405,0.0152747305,0.025300913],"study_design_scores_gemma":[0.00008196346,0.000044024902,0.00010818516,0.0000114788545,0.000015298243,0.000017440398,0.000005856365,0.991516,0.0032604258,0.001279077,0.0036492131,0.000010927637],"about_ca_topic_score_codex":0.0076273503,"about_ca_topic_score_gemma":0.0060158754,"teacher_disagreement_score":0.0076273503,"about_ca_system_score_codex":0.0009900437,"about_ca_system_score_gemma":0.001462979,"threshold_uncertainty_score":0.024886668},"labels":[],"label_agreement":null},{"id":"W2062229100","doi":"10.1016/j.comcom.2004.09.014","title":"Economical protection in MPLS networks","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Multiprotocol Label Switching; Computer network; Telecommunications; Computer security; Quality of service","score_opus":0.02458785191563852,"score_gpt":0.23091758570853868,"score_spread":0.20632973379290015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062229100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31418768,0.0023918278,0.6213309,0.0029165559,0.0002171584,0.0001087881,0.00028653702,0.00036473697,0.058195755],"genre_scores_gemma":[0.98684806,0.0003947681,0.009394414,0.000031354226,0.000072617935,0.00002277432,0.000042047843,0.000024914232,0.003169062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99930584,0.00018648026,0.000021885358,0.000049316503,0.00029184457,0.00014461554],"domain_scores_gemma":[0.9986583,0.0007093822,0.0001699058,0.00023587601,0.00016583421,0.00006070966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001024487,0.00036629557,0.0004832084,0.0008295015,0.0009940909,0.0013786723,0.0011902784,0.0006760371,0.0054681827],"category_scores_gemma":[0.003296094,0.0003293806,0.0003215797,0.0009828017,0.0011872782,0.0023815506,0.0011682014,0.0007336425,0.00042889742],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005241007,0.000077497876,0.0012273423,0.00019928715,0.00004921651,0.0002942481,0.00019637212,0.2525427,0.009079316,0.63468987,0.004190045,0.09692998],"study_design_scores_gemma":[0.000050967003,0.00013121523,0.001528685,0.000037121565,0.000050468618,0.00041907426,0.00020383885,0.42898354,0.007158652,0.5514381,0.009973822,0.000024544703],"about_ca_topic_score_codex":0.000824089,"about_ca_topic_score_gemma":0.0011523667,"teacher_disagreement_score":0.0054681827,"about_ca_system_score_codex":0.0014317721,"about_ca_system_score_gemma":0.0006494778,"threshold_uncertainty_score":0.018292904},"labels":[],"label_agreement":null},{"id":"W2062430203","doi":"10.1016/j.comcom.2009.09.001","title":"Implementation of MPC as an AQM controller","year":2009,"lang":"en","type":"article","venue":"Computer Communications","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Active queue management; Computer science; Model predictive control; Queue; Field-programmable gate array; Control theory (sociology); Controller (irrigation); Computational complexity theory; PID controller; Network congestion; Control (management); Control engineering; Computer network; Algorithm; Embedded system; Artificial intelligence","score_opus":0.19302133217383957,"score_gpt":0.5303509478373889,"score_spread":0.33732961566354935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062430203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0866018,0.000091371985,0.8840805,0.00060870213,0.0004224833,0.0001853353,0.0000725542,0.0032752634,0.02466189],"genre_scores_gemma":[0.86539584,0.000035446403,0.129582,0.000095364805,0.000031256794,0.000097588614,0.000040426734,0.00003853737,0.004683519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971527,0.00006489581,0.000014542654,0.00004323508,0.0001171048,0.00004488441],"domain_scores_gemma":[0.9996506,0.00009075778,0.000022959988,0.0000818472,0.00013289129,0.000020887928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045120504,0.00026616149,0.0003651743,0.0002255146,0.00043129156,0.0007702506,0.0007076501,0.00063423277,0.004178881],"category_scores_gemma":[0.0014677417,0.00017246514,0.00021112346,0.00017408976,0.00033281362,0.00032773893,0.0004276883,0.0008874946,0.0005569766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007121455,0.00064672134,0.0040358105,0.00023419522,0.000109759436,0.00040178938,0.00030651147,0.58687735,0.05288076,0.07433677,0.004871247,0.27458695],"study_design_scores_gemma":[0.00006969896,0.00011894584,0.00035902954,0.0000071460877,0.000015299662,0.000034315588,0.000015124315,0.97878975,0.013618091,0.0038247497,0.0031392274,0.000008555725],"about_ca_topic_score_codex":0.0033399817,"about_ca_topic_score_gemma":0.0021868215,"teacher_disagreement_score":0.004178881,"about_ca_system_score_codex":0.00030191976,"about_ca_system_score_gemma":0.00094452995,"threshold_uncertainty_score":0.013979733},"labels":[],"label_agreement":null},{"id":"W2064454128","doi":"10.1016/j.comcom.2008.07.002","title":"Joint routing and admission control problem under statistical delay and jitter constraints in MPLS networks","year":2008,"lang":"en","type":"article","venue":"Computer Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Jitter; Multiprotocol Label Switching; Joint (building); Computer network; Routing (electronic design automation); Control (management); Real-time computing; Telecommunications; Quality of service; Artificial intelligence","score_opus":0.02559945579732793,"score_gpt":0.24036959107383035,"score_spread":0.21477013527650243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064454128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22497974,0.0016933703,0.7604882,0.0037949288,0.00032370328,0.0003210507,0.0005465888,0.00044216984,0.0074101794],"genre_scores_gemma":[0.96342057,0.0005516433,0.030381212,0.00016104708,0.0002688062,0.00017540496,0.00022410366,0.00008833611,0.0047287536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697125,0.001162812,0.00015405998,0.0005140562,0.0006080414,0.0005897669],"domain_scores_gemma":[0.9841808,0.012537813,0.0010315891,0.00041103846,0.000956406,0.0008823329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067650364,0.001642449,0.004473858,0.0014000942,0.0013876013,0.0051582158,0.0033552756,0.0038650671,0.0029629446],"category_scores_gemma":[0.016489312,0.0021153481,0.0010871321,0.0025745989,0.0023244505,0.0049334583,0.0026489873,0.002386778,0.00023216894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034928255,0.00011929192,0.0004420089,0.000097888806,0.000068932844,0.00011481409,0.00006373209,0.9724476,0.0008306091,0.017346945,0.00094093283,0.007177986],"study_design_scores_gemma":[0.00003256218,0.000024067938,0.00010914629,0.000003936668,0.000015747739,0.0000098951305,0.000020081938,0.9924918,0.00018932814,0.0070270956,0.00006836671,0.000007838689],"about_ca_topic_score_codex":0.01418851,"about_ca_topic_score_gemma":0.0060916524,"teacher_disagreement_score":0.01418851,"about_ca_system_score_codex":0.004047222,"about_ca_system_score_gemma":0.0045182803,"threshold_uncertainty_score":0.03577739},"labels":[],"label_agreement":null},{"id":"W2068712729","doi":"10.1016/j.comcom.2007.02.019","title":"Modeling end-to-end QoS management and real time agreement protocols for resource reservation for multimedia mobile radio network","year":2007,"lang":"en","type":"article","venue":"Computer Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Reservation; Computer network; Quality of service; End-to-end principle; Multimedia","score_opus":0.07876538636604183,"score_gpt":0.3591141181155309,"score_spread":0.28034873174948904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068712729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07019245,0.0006393109,0.920087,0.00050032104,0.0001240903,0.00012975255,0.00014201863,0.0003688562,0.007816155],"genre_scores_gemma":[0.8531686,0.00094660354,0.13450733,0.00013868115,0.00009074191,0.00028929848,0.00023298195,0.00015104172,0.010474739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999258,0.00022271878,0.000039946015,0.00012798363,0.00022424734,0.00012705923],"domain_scores_gemma":[0.9988218,0.0006528763,0.00014473406,0.000098192126,0.00022795434,0.000054384804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015065983,0.0007797962,0.00075182493,0.00048453652,0.0007203512,0.001976819,0.0026066182,0.0013950891,0.0021375378],"category_scores_gemma":[0.0029831424,0.0006407977,0.00069573516,0.00047942335,0.0008179741,0.0024183183,0.0008602016,0.0014087907,0.00045898228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004193936,0.00006253411,0.00036866884,0.00003671674,0.000019300116,0.00006185852,0.0000925031,0.94510376,0.0022320533,0.046403274,0.00035615254,0.0052212724],"study_design_scores_gemma":[0.000003510885,0.000005103,0.000026888858,0.0000018225613,0.0000053121744,0.0000049394125,0.0000063036664,0.9963242,0.00022338412,0.003162872,0.00023303424,0.0000025125862],"about_ca_topic_score_codex":0.013139925,"about_ca_topic_score_gemma":0.011637084,"teacher_disagreement_score":0.013139925,"about_ca_system_score_codex":0.0022576668,"about_ca_system_score_gemma":0.0021238977,"threshold_uncertainty_score":0.026126921},"labels":[],"label_agreement":null},{"id":"W2070152796","doi":"10.1016/j.comcom.2004.02.026","title":"A computer aided tool for the performance evaluation of next generation WDM wavelength-routed optical networks","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Reservation; Network packet; Computer network; Routing and wavelength assignment; Wavelength-division multiplexing; Network topology; Modular design; Network simulation; Process (computing); Blocking (statistics); Real-time computing; Wavelength; Distributed computing","score_opus":0.07890231964956369,"score_gpt":0.2848430827973319,"score_spread":0.2059407631477682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070152796","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082150124,0.00029663704,0.88368016,0.000163301,0.000089068126,0.00020241395,0.0011530863,0.0132446755,0.019020492],"genre_scores_gemma":[0.5622176,0.00030821745,0.42718062,0.00007554821,0.00003692387,0.00063939707,0.0010791313,0.0006098342,0.007852775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934155,0.00017752958,0.000031343694,0.000034747023,0.00038270984,0.000032059157],"domain_scores_gemma":[0.9976439,0.0014784707,0.0001240319,0.000212673,0.0005178736,0.000023076422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000855815,0.00066325313,0.00058696006,0.00093044597,0.00043669203,0.00086215953,0.0008297972,0.0006644346,0.00817743],"category_scores_gemma":[0.0041744625,0.0003177271,0.0002679144,0.00082879077,0.000276502,0.0007246441,0.0004890169,0.0005132344,0.0010811316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003166858,0.00020417795,0.0016544877,0.00021365611,0.000071613766,0.00016243548,0.00010751463,0.744897,0.024826508,0.018486464,0.008361459,0.20069791],"study_design_scores_gemma":[0.00002571872,0.000072513074,0.0004744296,0.000009528405,0.000011750647,0.000052229356,0.000011818054,0.98458695,0.0094205495,0.0012664457,0.004052918,0.000015118319],"about_ca_topic_score_codex":0.003921501,"about_ca_topic_score_gemma":0.0044466043,"teacher_disagreement_score":0.00817743,"about_ca_system_score_codex":0.0006084159,"about_ca_system_score_gemma":0.00085536053,"threshold_uncertainty_score":0.027356207},"labels":[],"label_agreement":null},{"id":"W2072063356","doi":"10.1016/j.comcom.2006.02.006","title":"A lightweight secure protocol for wireless sensor networks","year":2006,"lang":"en","type":"article","venue":"Computer Communications","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Computer network; Protocol (science); Wireless sensor network; Wireless Transport Layer Security; Wireless network; Wireless; Computer security; Key distribution in wireless sensor networks; Telecommunications","score_opus":0.028390619704820864,"score_gpt":0.2924971031439529,"score_spread":0.264106483439132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072063356","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011431979,0.00069634104,0.97901136,0.00060652074,0.000441764,0.00042401048,0.00012310271,0.004342797,0.0029220881],"genre_scores_gemma":[0.40714177,0.0018233631,0.5560539,0.000865302,0.00091360067,0.0026249995,0.0008728587,0.0015574768,0.028146693],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969502,0.0005427927,0.00035380054,0.00022381074,0.0016775853,0.00025177162],"domain_scores_gemma":[0.99490225,0.0015142504,0.0005417364,0.0020992062,0.00067293824,0.0002695533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031410796,0.0011982579,0.0012247534,0.0016679235,0.0016734647,0.002297467,0.0021747157,0.001821907,0.004578578],"category_scores_gemma":[0.007082888,0.0010062204,0.0010238722,0.0012949685,0.0020274278,0.005926646,0.006101242,0.003994609,0.0025593683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015987942,0.0004867821,0.0010859525,0.001158288,0.00022317168,0.0011110057,0.00075785106,0.049136717,0.1326459,0.34826848,0.030698279,0.43282875],"study_design_scores_gemma":[0.0005282274,0.0010150161,0.000716176,0.00022487066,0.0004431525,0.0014588562,0.00020280662,0.50534016,0.09574359,0.29296824,0.10105616,0.0003028125],"about_ca_topic_score_codex":0.00048280947,"about_ca_topic_score_gemma":0.00083473185,"teacher_disagreement_score":0.004578578,"about_ca_system_score_codex":0.0009765909,"about_ca_system_score_gemma":0.0021246204,"threshold_uncertainty_score":0.016611814},"labels":[],"label_agreement":null},{"id":"W2073286884","doi":"10.1016/j.comcom.2015.01.002","title":"A data delivery framework for cognitive information-centric sensor networks in smart outdoor monitoring","year":2015,"lang":"en","type":"article","venue":"Computer Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Wireless sensor network; Cognitive network; Cognitive radio; Cognition; Analytic hierarchy process; Data mining; Computer network; Wireless","score_opus":0.11499256822544557,"score_gpt":0.3212099022091837,"score_spread":0.20621733398373815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073286884","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027089731,0.0002679925,0.99491817,0.0001802851,0.00008253085,0.00007414072,0.000048064587,0.0005492575,0.0011705611],"genre_scores_gemma":[0.3972924,0.0013219583,0.59214777,0.0002536755,0.00023104709,0.00041205276,0.00026883016,0.0002935681,0.007778755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923444,0.00017346138,0.000059305512,0.0001361527,0.00029581948,0.00010082475],"domain_scores_gemma":[0.99933976,0.00021577747,0.00004960469,0.00009559703,0.00021513292,0.0000840892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018758195,0.0006346835,0.0010512553,0.00082059146,0.0009884612,0.0020691839,0.0028359662,0.0011186395,0.0023992565],"category_scores_gemma":[0.0022427049,0.00041443086,0.0008054774,0.00092850206,0.00069106783,0.001777146,0.0023892522,0.0013792358,0.00067305996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027758622,0.00023009258,0.0007140407,0.00030461536,0.00012504407,0.00062303763,0.000515541,0.56060624,0.015436138,0.23760287,0.0136381695,0.1699266],"study_design_scores_gemma":[0.000013966748,0.00004475659,0.000057321744,0.000012635317,0.00002285605,0.00008838729,0.00004376298,0.97957957,0.0018398189,0.012678634,0.0056013702,0.000016996939],"about_ca_topic_score_codex":0.006751644,"about_ca_topic_score_gemma":0.00782706,"teacher_disagreement_score":0.006751644,"about_ca_system_score_codex":0.0013640254,"about_ca_system_score_gemma":0.0018129487,"threshold_uncertainty_score":0.013424695},"labels":[],"label_agreement":null},{"id":"W2076786893","doi":"10.1016/j.comcom.2007.12.028","title":"Game theoretic models for detecting network intrusions","year":2008,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Network packet; Intrusion detection system; Computer network; Router; Packet drop attack; Game theory; Path (computing); Node (physics); Routing (electronic design automation); Packet forwarding; Computer security; Distributed computing; Routing protocol; Mathematics","score_opus":0.05402245004381441,"score_gpt":0.26408798522228244,"score_spread":0.21006553517846804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076786893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06299824,0.00066640106,0.9144506,0.0029995043,0.00011571792,0.0002902179,0.00037880367,0.00029518144,0.017805342],"genre_scores_gemma":[0.9151441,0.000734038,0.07366106,0.00040933368,0.00012542051,0.00033497612,0.0002784535,0.000050512877,0.00926206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947141,0.0030233387,0.00018659461,0.00057067245,0.00095531065,0.0005499239],"domain_scores_gemma":[0.9772743,0.019028159,0.0012875418,0.00076304056,0.00092973234,0.00071718736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005354934,0.0018282841,0.0020732966,0.0017408055,0.00092023157,0.004837954,0.004188256,0.0034147338,0.004213471],"category_scores_gemma":[0.021364834,0.00096048473,0.0012879935,0.0015566234,0.003401746,0.005553908,0.0019012558,0.0033151,0.0004688804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016012712,0.00012831125,0.0010377192,0.00013032864,0.000117480646,0.00018456108,0.0002824295,0.3965744,0.00049270317,0.58955425,0.0023372956,0.009000371],"study_design_scores_gemma":[0.000048569065,0.00003480406,0.00011343311,0.000013419541,0.00002512591,0.000038420414,0.00005120912,0.7146133,0.00008891232,0.28427535,0.0006814628,0.00001595065],"about_ca_topic_score_codex":0.0094340965,"about_ca_topic_score_gemma":0.00743583,"teacher_disagreement_score":0.0094340965,"about_ca_system_score_codex":0.0042172116,"about_ca_system_score_gemma":0.002185619,"threshold_uncertainty_score":0.030598104},"labels":[],"label_agreement":null},{"id":"W2078943717","doi":"10.1016/j.comcom.2012.08.002","title":"An efficient cooperative ARQ protocol for wireless relay networks","year":2012,"lang":"en","type":"article","venue":"Computer Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Retransmission; Computer science; Selective Repeat ARQ; Computer network; Automatic repeat request; Relay; Sliding window protocol; Go-Back-N ARQ; Hybrid automatic repeat request; Network packet; Node (physics); Transmission (telecommunications); Real-time computing; Telecommunications; Telecommunications link; Window (computing); Engineering","score_opus":0.08831808563240486,"score_gpt":0.36968799335247754,"score_spread":0.2813699077200727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078943717","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016445937,0.00071951066,0.97822714,0.00020946503,0.00015530072,0.00011745711,0.000064029366,0.0003718684,0.0036893368],"genre_scores_gemma":[0.5829901,0.0009946398,0.40450013,0.00028675323,0.00022006764,0.00036608626,0.00018282255,0.00008144918,0.01037795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896216,0.00033946734,0.000048251117,0.00009248188,0.0004653633,0.00009224141],"domain_scores_gemma":[0.99878544,0.0005872695,0.00007326528,0.00023857395,0.00028443628,0.000031073872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013887904,0.0006285267,0.00068193465,0.0005113527,0.00052042474,0.00076866715,0.0013054382,0.0007056123,0.0015289896],"category_scores_gemma":[0.002336885,0.00030244183,0.00035002342,0.0006015913,0.00058007595,0.0009868945,0.0012724216,0.00087321043,0.000521596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073901814,0.0002463845,0.00050658965,0.00034558243,0.00015300434,0.0006432183,0.0005419526,0.2824008,0.1348561,0.21080521,0.012332992,0.35642922],"study_design_scores_gemma":[0.000104618,0.00033668583,0.0002550813,0.000019541012,0.00009412195,0.00042145417,0.000041475338,0.9481767,0.011793936,0.02837354,0.010328145,0.000054766246],"about_ca_topic_score_codex":0.000992278,"about_ca_topic_score_gemma":0.002424718,"teacher_disagreement_score":0.0015289896,"about_ca_system_score_codex":0.00046927165,"about_ca_system_score_gemma":0.0009060191,"threshold_uncertainty_score":0.0073447227},"labels":[],"label_agreement":null},{"id":"W2079836094","doi":"10.1016/j.comcom.2006.07.005","title":"Multiple link failures survivability of optical networks with traffic grooming capability","year":2006,"lang":"en","type":"article","venue":"Computer Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Concordia University","funders":"","keywords":"Traffic grooming; Computer science; Survivability; Spare part; Computer network; Provisioning; Distributed computing; Robustness (evolution); Overhead (engineering); Bandwidth (computing); Wavelength-division multiplexing","score_opus":0.01267048672560023,"score_gpt":0.21506698138483268,"score_spread":0.20239649465923246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079836094","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8140876,0.000777209,0.17678836,0.0005017677,0.000061456994,0.000032278225,0.00013169157,0.00020147781,0.007418132],"genre_scores_gemma":[0.99432737,0.00016479097,0.00453526,0.000020413916,0.000043020733,0.00001282201,0.00004604701,0.000010155871,0.0008402027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996295,0.00011080758,0.000016498296,0.00006254262,0.00009504731,0.00008556963],"domain_scores_gemma":[0.9981787,0.0010480197,0.0003347654,0.00017036391,0.00016669762,0.000101504695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006126194,0.00054890494,0.00041217997,0.0007127886,0.0004951934,0.0007812239,0.0006086184,0.00050367654,0.0012950241],"category_scores_gemma":[0.0027423447,0.00025171615,0.0002563462,0.00057147525,0.0005385528,0.001581539,0.000731761,0.00060622796,0.000106556115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015472507,0.00020611584,0.004532086,0.00021332529,0.00011824806,0.0007227229,0.00030116457,0.748751,0.050908722,0.07049042,0.0017813215,0.120427586],"study_design_scores_gemma":[0.000036295918,0.0001382913,0.001118983,0.000010554398,0.000032419306,0.00015181507,0.000055481545,0.9594731,0.0046903254,0.033829223,0.00045168225,0.000011868439],"about_ca_topic_score_codex":0.0013553946,"about_ca_topic_score_gemma":0.0014250048,"teacher_disagreement_score":0.0013553946,"about_ca_system_score_codex":0.00045413277,"about_ca_system_score_gemma":0.00041873445,"threshold_uncertainty_score":0.004332304},"labels":[],"label_agreement":null},{"id":"W2083395410","doi":"10.1016/j.comcom.2005.12.004","title":"Adaptive model predictive TCP delay-based congestion control","year":2006,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Computer science; CUBIC TCP; TCP Vegas; TCP acceleration; TCP global synchronization; TCP Friendly Rate Control; TCP tuning; Zeta-TCP; TCP Westwood plus; Computer network; Compound TCP; Transmission Control Protocol; Network congestion; H-TCP; HSTCP; Model predictive control; Real-time computing; Algorithm; Network packet; Control (management); Artificial intelligence","score_opus":0.01935276739654083,"score_gpt":0.22704900986985574,"score_spread":0.20769624247331492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083395410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08208864,0.0011543864,0.9064285,0.0006534922,0.0005384416,0.00007854364,0.00010729646,0.0020444705,0.0069062044],"genre_scores_gemma":[0.99148047,0.0001128986,0.007301785,0.00004995118,0.00003708985,0.00002805098,0.000024244564,0.000019090436,0.0009464124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995604,0.00008351447,0.000019805973,0.000096389675,0.00016710373,0.000072772345],"domain_scores_gemma":[0.998629,0.0006767898,0.00013248203,0.00009516467,0.0004186088,0.00004802242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088716444,0.0006147534,0.00095462025,0.00057980674,0.00054637075,0.0011142859,0.0013255406,0.000679339,0.0011416434],"category_scores_gemma":[0.0031486512,0.00039521276,0.0002546279,0.0005436127,0.00058544363,0.00080057245,0.0007545872,0.0013487192,0.00020188346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034789598,0.00016210892,0.000725414,0.00007732297,0.00004376684,0.000047510675,0.00006190158,0.9288719,0.005095737,0.004608816,0.0021134713,0.057844162],"study_design_scores_gemma":[0.000010388213,0.000020288706,0.00009170481,0.0000015932496,0.000006965595,0.000004064457,0.0000020547789,0.99862623,0.0005306635,0.0005975174,0.000105419014,0.0000030319395],"about_ca_topic_score_codex":0.010487988,"about_ca_topic_score_gemma":0.010933388,"teacher_disagreement_score":0.010487988,"about_ca_system_score_codex":0.0009999917,"about_ca_system_score_gemma":0.0010502962,"threshold_uncertainty_score":0.020853877},"labels":[],"label_agreement":null},{"id":"W2083655613","doi":"10.1016/s0140-3664(03)00119-1","title":"Supporting Quality of Service in IP multicast networks","year":2003,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Multicast; Computer network; IP multicast; Xcast; Source-specific multicast; Quality of service; Service (business); Internet Group Management Protocol; Pragmatic General Multicast","score_opus":0.05548209764131507,"score_gpt":0.3347569254377961,"score_spread":0.27927482779648105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083655613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21959874,0.0022713807,0.7595049,0.002298474,0.00033319765,0.00011365713,0.00009891952,0.0013040644,0.014476604],"genre_scores_gemma":[0.96605533,0.0006939364,0.031532865,0.00010702581,0.00031710547,0.00004136606,0.00005887281,0.000052913954,0.0011405698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985139,0.0004381201,0.000069332236,0.00008211356,0.0005775513,0.00031901558],"domain_scores_gemma":[0.9925922,0.0040911012,0.00068079145,0.0009885493,0.0012476238,0.0003997194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031504896,0.0005191928,0.000713843,0.0009219878,0.0010671898,0.0022708846,0.0016984621,0.0010939618,0.0017511034],"category_scores_gemma":[0.01576262,0.00045262295,0.00020902613,0.0008985063,0.0011725381,0.0036186394,0.0016407375,0.0014648743,0.0003366789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014457318,0.000513395,0.0046488116,0.00045898973,0.000074300406,0.00039865248,0.0011480091,0.24437276,0.06588796,0.35545036,0.008048331,0.31755272],"study_design_scores_gemma":[0.00008449001,0.00014787224,0.00049974467,0.000036421,0.000047166715,0.00013247802,0.000098040604,0.863025,0.008849438,0.12096189,0.006089228,0.000028274337],"about_ca_topic_score_codex":0.0014260189,"about_ca_topic_score_gemma":0.0012542886,"teacher_disagreement_score":0.0031504896,"about_ca_system_score_codex":0.0010930898,"about_ca_system_score_gemma":0.0010015349,"threshold_uncertainty_score":0.016661584},"labels":[],"label_agreement":null},{"id":"W2083990345","doi":"10.1016/j.comcom.2011.09.008","title":"Biconnecting a network of mobile robots using virtual angular forces","year":2011,"lang":"en","type":"article","venue":"Computer Communications","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Node (physics); Position (finance); Software deployment; Spring (device); Robot; Wireless network; Fault tolerance; Wireless; Distributed computing; Topology (electrical circuits); Simulation; Artificial intelligence; Telecommunications; Mathematics; Mechanical engineering; Physics","score_opus":0.0789533535320445,"score_gpt":0.2597017871770721,"score_spread":0.1807484336450276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083990345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2768737,0.00018171294,0.71074027,0.000260518,0.00018561825,0.00008464672,0.000031532676,0.00038291365,0.011259047],"genre_scores_gemma":[0.8914782,0.00011808183,0.10144325,0.000068778456,0.000023498822,0.00009324949,0.00004761991,0.00004054714,0.0066869147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977964,0.00005806057,0.000009757392,0.000042849413,0.00006786415,0.00004187869],"domain_scores_gemma":[0.9994894,0.00013599041,0.00007653475,0.00009254984,0.000091822956,0.00011367476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000382741,0.0006617066,0.0005387453,0.00077558606,0.0009647838,0.0007453955,0.00080122915,0.00068617245,0.0024078945],"category_scores_gemma":[0.0011714034,0.00037092177,0.00039715442,0.0006137043,0.00080639287,0.0009106034,0.0022124178,0.0005160088,0.0004462175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004760317,0.0001322818,0.0021250003,0.000099456745,0.00007520065,0.00034219495,0.00042962178,0.8283987,0.042577673,0.025110235,0.0012839135,0.098949715],"study_design_scores_gemma":[0.000022757475,0.00016106064,0.0002809097,0.000008664263,0.000013932635,0.000052368778,0.0001080204,0.9899248,0.002448711,0.005699092,0.0012678487,0.000011809845],"about_ca_topic_score_codex":0.0030637213,"about_ca_topic_score_gemma":0.0044862437,"teacher_disagreement_score":0.0030637213,"about_ca_system_score_codex":0.00046380964,"about_ca_system_score_gemma":0.00047241178,"threshold_uncertainty_score":0.00805527},"labels":[],"label_agreement":null},{"id":"W2086629700","doi":"10.1016/s0140-3664(02)00094-4","title":"Evaluating location management schemes for third generation mobile networks","year":2002,"lang":"en","type":"article","venue":"Computer Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Mobility management; Interval (graph theory); Scheme (mathematics); Computer network; Set (abstract data type); Class (philosophy); Management strategy; Real-time computing; Artificial intelligence","score_opus":0.20838198455070356,"score_gpt":0.3902262192306008,"score_spread":0.18184423467989724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086629700","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92234087,0.0015899092,0.068110876,0.00061208167,0.00015879997,0.00048723322,0.0002465444,0.00029418734,0.006159461],"genre_scores_gemma":[0.9847081,0.00019312436,0.014269178,0.000022994782,0.000027111768,0.000052185143,0.00009620696,0.000013170182,0.0006179063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99206346,0.0045795743,0.0003781692,0.00034476814,0.001961604,0.00067239284],"domain_scores_gemma":[0.94800025,0.040010113,0.002990586,0.0037953702,0.0044099386,0.0007937484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011827591,0.0010149934,0.0012379611,0.0021766701,0.0010727686,0.0018945138,0.002068976,0.0019275848,0.002265293],"category_scores_gemma":[0.0395529,0.00035177564,0.0005186798,0.0019289668,0.0013172891,0.003064087,0.001997569,0.00071442046,0.00020383703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004599801,0.00067577756,0.0077360775,0.0002462804,0.00016599815,0.000068197136,0.00012775275,0.87805206,0.003927086,0.008251064,0.0011166824,0.095033154],"study_design_scores_gemma":[0.00020106715,0.0016186783,0.0014374234,0.000014495373,0.000083982486,0.000041412495,0.0001633262,0.9906605,0.0023911623,0.0029844993,0.0003859637,0.000017508486],"about_ca_topic_score_codex":0.007834363,"about_ca_topic_score_gemma":0.0086259805,"teacher_disagreement_score":0.011827591,"about_ca_system_score_codex":0.0071344213,"about_ca_system_score_gemma":0.0022937362,"threshold_uncertainty_score":0.06255102},"labels":[],"label_agreement":null},{"id":"W2087935504","doi":"10.1016/j.comcom.2006.09.006","title":"FH-RSVP scheme for intra-site handover in hierarchical mobile IPv6 networks","year":2006,"lang":"en","type":"article","venue":"Computer Communications","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Mobile IP; Handover; Computer network; Scheme (mathematics); IPv6; Distributed computing; World Wide Web; The Internet","score_opus":0.01024806448388099,"score_gpt":0.23053799354450735,"score_spread":0.22028992906062636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087935504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19713524,0.0022137729,0.76982933,0.000670894,0.0006662329,0.0007190788,0.0011358728,0.003227755,0.0244018],"genre_scores_gemma":[0.9038821,0.00033830514,0.08855635,0.00012266454,0.00015520427,0.0001668599,0.0007231524,0.000047906204,0.0060075526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939203,0.00017115909,0.000041433814,0.000039942955,0.00018591371,0.00016941849],"domain_scores_gemma":[0.9990959,0.0002479802,0.000044540266,0.00029873208,0.00023447972,0.000078289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010504609,0.0003330364,0.00064134854,0.0008090213,0.0017213991,0.00075407536,0.0012647253,0.00069278723,0.0030760353],"category_scores_gemma":[0.0015691336,0.00019086285,0.00022810049,0.00051906065,0.00053576444,0.0008484263,0.0012478187,0.00073538115,0.00073614053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022459049,0.0005112914,0.0024032244,0.0005315068,0.00010629132,0.0009551233,0.0008808861,0.07454821,0.120151736,0.123912506,0.028394427,0.64535886],"study_design_scores_gemma":[0.00028302244,0.0009159041,0.0047146166,0.000081770195,0.00015091593,0.0010958556,0.00045160184,0.84792167,0.06400719,0.048528984,0.031661626,0.0001867746],"about_ca_topic_score_codex":0.003835636,"about_ca_topic_score_gemma":0.004225626,"teacher_disagreement_score":0.003835636,"about_ca_system_score_codex":0.0008853986,"about_ca_system_score_gemma":0.0012125699,"threshold_uncertainty_score":0.010290384},"labels":[],"label_agreement":null},{"id":"W2089347901","doi":"10.1016/j.comcom.2014.05.007","title":"Optimal selection of aggregation locations for participatory sensing by mobile cyber-physical systems","year":2014,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université de Sherbrooke","funders":"","keywords":"Computer science; Participatory sensing; USable; Data aggregator; Cyber-physical system; Base station; Mobile device; Citizen journalism; Distributed computing; Computer network; Wireless sensor network; Data science; World Wide Web","score_opus":0.02992319080151227,"score_gpt":0.2837404401565214,"score_spread":0.2538172493550091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089347901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09571073,0.00026283602,0.90138876,0.00038523137,0.00006490762,0.00009404744,0.00007755086,0.00017765643,0.0018381751],"genre_scores_gemma":[0.93211126,0.00010700096,0.06650681,0.000041971325,0.000042563053,0.00012231331,0.000066406166,0.00001978913,0.0009817847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987534,0.0004895558,0.00005423182,0.00031733987,0.00018819846,0.00019722033],"domain_scores_gemma":[0.9971118,0.0020422929,0.00023852014,0.00016771653,0.0002972499,0.00014234852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012915196,0.0012168231,0.0018970527,0.00090022275,0.0011121485,0.0013885326,0.0014038286,0.00156998,0.0012337186],"category_scores_gemma":[0.007088017,0.0008095996,0.00073810987,0.0009148486,0.0012370427,0.0017007305,0.0019750325,0.0008066829,0.00032569747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005465691,0.00018009538,0.002864929,0.00019345383,0.00009331604,0.0003147945,0.0004819827,0.89644265,0.013741113,0.01369772,0.0013005718,0.070142776],"study_design_scores_gemma":[0.000026918035,0.00006591049,0.00047097076,0.000009160078,0.000012166394,0.000028519638,0.000087995846,0.99148834,0.0014522452,0.0061278692,0.0002174475,0.000012373212],"about_ca_topic_score_codex":0.0044442657,"about_ca_topic_score_gemma":0.004901397,"teacher_disagreement_score":0.0044442657,"about_ca_system_score_codex":0.0007681293,"about_ca_system_score_gemma":0.0013064494,"threshold_uncertainty_score":0.008836806},"labels":[],"label_agreement":null},{"id":"W2091458970","doi":"10.1016/j.comcom.2006.04.018","title":"Management and admission control based on policies and measurements for the packet-switched domain of the UMTS core network","year":2006,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; UMTS frequency bands; Network packet; Domain (mathematical analysis); Computer network; Core (optical fiber); Control (management); Real-time computing; Telecommunications; Artificial intelligence","score_opus":0.036253919116719165,"score_gpt":0.25506885550245767,"score_spread":0.2188149363857385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091458970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32796803,0.00067834964,0.66344297,0.000820654,0.0002308762,0.00013885996,0.00010077317,0.0019519214,0.004667699],"genre_scores_gemma":[0.9798114,0.00007566904,0.019324942,0.00003651471,0.00004688304,0.000028225397,0.000034203415,0.000019676523,0.0006225841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904865,0.00035808518,0.00004938673,0.00011769063,0.00030054242,0.00012551244],"domain_scores_gemma":[0.99817014,0.00079634495,0.00014192093,0.0002668909,0.00048944255,0.00013530209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017643613,0.0004229935,0.00047866258,0.0005962873,0.00066564843,0.0013215271,0.00069464435,0.00037118176,0.00074254425],"category_scores_gemma":[0.005471404,0.00021386064,0.00016955895,0.00037064462,0.0006254736,0.00095174275,0.0006369468,0.0011287186,0.00015264675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002404508,0.0006552228,0.016228894,0.00009561704,0.00013916085,0.00024421205,0.0007778226,0.43746087,0.05854265,0.0870294,0.0057348316,0.3906868],"study_design_scores_gemma":[0.000011961182,0.000039922546,0.0009160293,0.000003914572,0.000013409424,0.000019149,0.000020096364,0.9891515,0.0047288816,0.0047225966,0.0003608926,0.000011773552],"about_ca_topic_score_codex":0.0054553123,"about_ca_topic_score_gemma":0.006417397,"teacher_disagreement_score":0.0054553123,"about_ca_system_score_codex":0.0015318852,"about_ca_system_score_gemma":0.0015063451,"threshold_uncertainty_score":0.011114657},"labels":[],"label_agreement":null},{"id":"W2091874493","doi":"10.1016/j.comcom.2009.11.020","title":"A global profile-based algorithm for energy minimization in object tracking sensor networks","year":2009,"lang":"en","type":"article","venue":"Computer Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Wireless sensor network; Exploit; Video tracking; Minification; Energy consumption; Tracking (education); Real-time computing; Energy minimization; Object (grammar); Host (biology); Key distribution in wireless sensor networks; Energy (signal processing); Scheme (mathematics); Algorithm; Artificial intelligence; Wireless; Wireless network; Computer network; Telecommunications; Computer security","score_opus":0.02179760013758616,"score_gpt":0.26668703099076924,"score_spread":0.24488943085318307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091874493","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015671003,0.00007008103,0.9979121,0.000029723851,0.00001374251,0.0000124093585,0.000012092821,0.00014387359,0.00023880311],"genre_scores_gemma":[0.13708363,0.00029145932,0.85942775,0.00009341266,0.000051734485,0.00024867745,0.0001970056,0.00022666407,0.002379674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994357,0.0001364634,0.000029918798,0.00009382938,0.00024860614,0.00005545873],"domain_scores_gemma":[0.99918205,0.00033236985,0.000068532754,0.00012250805,0.00024898528,0.000045635763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013870081,0.0010898344,0.0014965401,0.0010199099,0.00068593014,0.001121052,0.0022645732,0.0011940389,0.0017566686],"category_scores_gemma":[0.003178482,0.00078359037,0.0008977058,0.001652852,0.00064019614,0.0019716853,0.0022947688,0.0014727567,0.0007695701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018631837,0.00007677238,0.00055350916,0.000080666665,0.00006150882,0.00004212994,0.00008267591,0.6609856,0.0060921093,0.011831637,0.0027278499,0.31727916],"study_design_scores_gemma":[0.000009765653,0.000023901346,0.000076071046,0.0000044006456,0.000005690624,0.000019889963,0.00000617966,0.99502486,0.0010413415,0.0032276409,0.0005543653,0.000005862027],"about_ca_topic_score_codex":0.0029758755,"about_ca_topic_score_gemma":0.0038290478,"teacher_disagreement_score":0.0029758755,"about_ca_system_score_codex":0.0008611956,"about_ca_system_score_gemma":0.0013097186,"threshold_uncertainty_score":0.007335305},"labels":[],"label_agreement":null},{"id":"W2093232845","doi":"10.1016/j.comcom.2006.03.004","title":"SSL/TLS session-aware user authentication – Or how to effectively thwart the man-in-the-middle","year":2006,"lang":"en","type":"article","venue":"Computer Communications","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universität Zürich; University of Toronto","keywords":"Computer science; Man-in-the-middle attack; Session (web analytics); Computer security; Authentication (law); Transport Layer Security; Countermeasure; The Internet; Computer network; World Wide Web; Encryption","score_opus":0.05916328874943429,"score_gpt":0.2865896988356036,"score_spread":0.22742641008616932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093232845","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013926426,0.0029745062,0.9216363,0.008829815,0.002741569,0.00027793203,0.00019687519,0.009024905,0.040391777],"genre_scores_gemma":[0.6374352,0.0054022474,0.28030655,0.0054922416,0.0027263907,0.00031539303,0.00047270439,0.0012274298,0.06662188],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961194,0.0015244402,0.0002353035,0.0004151156,0.0011236273,0.0005821607],"domain_scores_gemma":[0.9935958,0.0011942179,0.0003663594,0.0036318905,0.0009723054,0.00023942559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041435175,0.0012766934,0.0012488764,0.0013407149,0.0017697966,0.005320337,0.0019080407,0.00312925,0.011292003],"category_scores_gemma":[0.007985274,0.00066399755,0.00080956187,0.00094989786,0.0035396216,0.018179212,0.0034064276,0.003450735,0.0108642755],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091296714,0.00025615064,0.0014778526,0.0010286235,0.00025959578,0.00037746408,0.0014199961,0.008307699,0.05162427,0.41395208,0.04391894,0.47646433],"study_design_scores_gemma":[0.00010953977,0.0003938914,0.0006096716,0.00038573443,0.000290069,0.0008000512,0.0009101979,0.11923654,0.090621755,0.5388378,0.24759272,0.00021204825],"about_ca_topic_score_codex":0.00073894695,"about_ca_topic_score_gemma":0.00088598265,"teacher_disagreement_score":0.011292003,"about_ca_system_score_codex":0.0008354142,"about_ca_system_score_gemma":0.0014176307,"threshold_uncertainty_score":0.037775517},"labels":[],"label_agreement":null},{"id":"W2094367780","doi":"10.1016/j.comcom.2004.09.011","title":"An approach for managing global mobility and roaming in the next-generation wireless systems","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Roaming; Computer science; Computer network; Interoperability; Wireless network; Default gateway; Wireless; Process (computing); Heterogeneous network; Cellular network; Telecommunications; Distributed computing; World Wide Web","score_opus":0.15251501052663713,"score_gpt":0.34349404721837656,"score_spread":0.19097903669173943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094367780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00683001,0.00044896116,0.97700197,0.0015518398,0.00026303585,0.00018248933,0.000032077867,0.00054370693,0.013146037],"genre_scores_gemma":[0.33685142,0.0011046787,0.64015025,0.00072201947,0.00035133245,0.000396197,0.00011405577,0.00017822541,0.020131797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834955,0.000512579,0.00009778041,0.00022718111,0.00062105164,0.00019186038],"domain_scores_gemma":[0.9989404,0.00019872929,0.00008875671,0.00030337705,0.0003201099,0.00014869736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025135607,0.000680542,0.00085010426,0.0009738127,0.002268808,0.0041333656,0.0028041517,0.0020243784,0.0021369846],"category_scores_gemma":[0.0028547447,0.0004760276,0.00083603576,0.0009260799,0.0018190545,0.0060796104,0.004107777,0.0023865462,0.00069945276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001521629,0.00023620488,0.0017580371,0.00019723097,0.00017887824,0.0005467617,0.002430555,0.09633167,0.014065387,0.5634729,0.01253488,0.30809537],"study_design_scores_gemma":[0.000082374165,0.00022906835,0.000718169,0.00009728392,0.00023241297,0.00065279397,0.0016108167,0.66714376,0.00691531,0.20943052,0.112745374,0.00014207051],"about_ca_topic_score_codex":0.0063656056,"about_ca_topic_score_gemma":0.012682545,"teacher_disagreement_score":0.0063656056,"about_ca_system_score_codex":0.0013525718,"about_ca_system_score_gemma":0.002201908,"threshold_uncertainty_score":0.013293147},"labels":[],"label_agreement":null},{"id":"W2114897178","doi":"10.1016/j.comcom.2004.02.007","title":"Performance evaluation of a broadband wireless access system subjected to heavy load","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Broadband; Wireless broadband; Broadband networks; Base station; Telecommunications; Wireless; Computer network; Point (geometry); Fixed wireless; Wireless network; Wi-Fi array","score_opus":0.09206807921481702,"score_gpt":0.35441744530049807,"score_spread":0.26234936608568105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114897178","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.989773,0.00011979769,0.008173951,0.00013863113,0.000038415168,0.000026375557,0.000053506992,0.00031701586,0.0013592696],"genre_scores_gemma":[0.99919814,0.000024533216,0.0003558879,0.000013823645,0.000010462494,0.0000028259367,0.000021612881,0.000008808994,0.00036394014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989334,0.0003379995,0.000046427685,0.00011260844,0.0002341875,0.00033530075],"domain_scores_gemma":[0.99545646,0.002580032,0.00027164334,0.00022419286,0.0011043119,0.00036340396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008862887,0.0006265601,0.00091297115,0.00077901484,0.0010877729,0.00088810787,0.00071308046,0.0009207776,0.002961611],"category_scores_gemma":[0.0033695034,0.00019173216,0.00029174978,0.00057752396,0.00093360466,0.0008423229,0.00065435946,0.0004754546,0.00040346308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.020723762,0.0011088876,0.014983345,0.00042774875,0.00030251444,0.0016943512,0.00065866916,0.6796221,0.21675093,0.0021986042,0.0020529844,0.05947598],"study_design_scores_gemma":[0.00016457059,0.0034381314,0.0078016073,0.000011026488,0.0001648134,0.00034348623,0.00031293335,0.95066124,0.036235403,0.0004998319,0.00033083788,0.00003618478],"about_ca_topic_score_codex":0.0064423406,"about_ca_topic_score_gemma":0.0026392832,"teacher_disagreement_score":0.0064423406,"about_ca_system_score_codex":0.00085356325,"about_ca_system_score_gemma":0.0005462963,"threshold_uncertainty_score":0.012809694},"labels":[],"label_agreement":null},{"id":"W2122857222","doi":"10.1016/j.comcom.2008.07.016","title":"Priority queuing of long-range dependent traffic","year":2008,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Queue management system; Queue; Bulk queue; Multilevel queue; Queueing theory; Priority queue; Real-time computing; Computer network","score_opus":0.03468011940471879,"score_gpt":0.2530783233760022,"score_spread":0.21839820397128343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122857222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47389096,0.001347436,0.5159781,0.0008125657,0.0006194681,0.00008540962,0.00009991673,0.0005022,0.006663937],"genre_scores_gemma":[0.9906561,0.00023158877,0.006601388,0.00005805815,0.00012177793,0.0000150066735,0.000048216752,0.000029982433,0.0022379665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987557,0.00024696367,0.00005172509,0.00015810665,0.00044241868,0.00034518354],"domain_scores_gemma":[0.99144906,0.0050259377,0.0005414382,0.0004936978,0.0016983234,0.0007915665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024619706,0.00048963,0.0007652708,0.00076016947,0.0012555914,0.0021196827,0.0019608708,0.00074390986,0.0026909565],"category_scores_gemma":[0.011526618,0.0005277125,0.0002654924,0.00095783535,0.0008037523,0.0019341359,0.0007834115,0.0013999376,0.0002843021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002294774,0.00059541827,0.00940385,0.00035103658,0.00013965507,0.0011169598,0.0014477326,0.51567096,0.052090243,0.30008894,0.007010241,0.10979021],"study_design_scores_gemma":[0.000039336548,0.00010881086,0.00091277284,0.000007129076,0.000029330935,0.00007850938,0.00008523485,0.9700646,0.0021031848,0.025834946,0.000713677,0.00002247243],"about_ca_topic_score_codex":0.0049597668,"about_ca_topic_score_gemma":0.00790581,"teacher_disagreement_score":0.0049597668,"about_ca_system_score_codex":0.0018406826,"about_ca_system_score_gemma":0.0014098188,"threshold_uncertainty_score":0.013355136},"labels":[],"label_agreement":null},{"id":"W2126781925","doi":"10.1016/j.comcom.2013.03.001","title":"Comparison of PI controllers designed for the delay model of TCP/AQM networks","year":2013,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université de Montréal","funders":"","keywords":"Active queue management; Computer science; Network congestion; Robustness (evolution); Queue; Computer network; Flow control (data); PID controller; Control theory (sociology); Control (management); Control engineering; Engineering; Network packet","score_opus":0.06081634683340278,"score_gpt":0.2979869743649653,"score_spread":0.2371706275315625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126781925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44241762,0.004249029,0.5305005,0.00042809843,0.0007635902,0.00025929304,0.00015211046,0.0016096556,0.019620113],"genre_scores_gemma":[0.9909287,0.00023977624,0.008057072,0.00003146905,0.00002143908,0.0000458817,0.00003596316,0.000018267616,0.0006214685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950886,0.00014880895,0.000032671378,0.000070091206,0.00016415508,0.00007542291],"domain_scores_gemma":[0.99800533,0.0010597986,0.00011723609,0.00012387229,0.0006364968,0.000057333356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017956867,0.0007008404,0.00072165765,0.00069624296,0.0005289082,0.00096928875,0.0009375102,0.0008208651,0.0016718562],"category_scores_gemma":[0.00395031,0.00021257519,0.00033267814,0.00034516206,0.00034029258,0.0005098257,0.00034896372,0.0007544003,0.00020662036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023890636,0.00047203214,0.003296411,0.0007737747,0.0002709053,0.00015389842,0.0002312189,0.7897574,0.0163944,0.00868357,0.0018861778,0.17569113],"study_design_scores_gemma":[0.00009873872,0.00040797426,0.0010565922,0.000020530231,0.000089338784,0.000031330674,0.000044565506,0.99144286,0.0052865874,0.0007920633,0.000716151,0.000013303882],"about_ca_topic_score_codex":0.004600213,"about_ca_topic_score_gemma":0.0027147194,"teacher_disagreement_score":0.004600213,"about_ca_system_score_codex":0.0008605497,"about_ca_system_score_gemma":0.00089551107,"threshold_uncertainty_score":0.00949657},"labels":[],"label_agreement":null},{"id":"W2128508520","doi":"10.1016/j.comcom.2011.09.001","title":"Research challenges towards the Future Internet","year":2011,"lang":"en","type":"article","venue":"Computer Communications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Computer science; The Internet; Flexibility (engineering); Protocol stack; Scalability; Architecture; Reserved IP addresses; Telecommunications; Internet Protocol; Internet research; World Wide Web; IP address management; Computer network; Wireless sensor network","score_opus":0.3571833005297325,"score_gpt":0.35182076279349317,"score_spread":0.005362537736239348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128508520","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012875914,0.21603785,0.043397512,0.6010722,0.008507075,0.00006037245,0.00041360394,0.0003493358,0.11728613],"genre_scores_gemma":[0.42980337,0.41082293,0.044304233,0.050596695,0.026072394,0.00030762667,0.0006817079,0.00021360438,0.037197497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819714,0.0006279938,0.00006820211,0.00027059176,0.00058392994,0.0002522159],"domain_scores_gemma":[0.98829204,0.006166163,0.0005188895,0.00071420457,0.002511733,0.0017969516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076527623,0.0005635343,0.0010812073,0.002092858,0.0027678327,0.009638458,0.002906413,0.00867492,0.020483613],"category_scores_gemma":[0.010027922,0.0005014923,0.00056211994,0.0028093236,0.0074664047,0.029126454,0.0029491293,0.00700908,0.0037431403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072152776,0.00010351921,0.0005440063,0.00051634334,0.00002021583,0.00014498085,0.00041547755,0.002948714,0.000481469,0.83940274,0.07134232,0.08400803],"study_design_scores_gemma":[0.000017662771,0.000037332546,0.00024194755,0.0004444625,0.000014822596,0.00019708858,0.0020474046,0.0067800144,0.00025160002,0.72259736,0.2673405,0.000029875493],"about_ca_topic_score_codex":0.002201714,"about_ca_topic_score_gemma":0.0027131308,"teacher_disagreement_score":0.020483613,"about_ca_system_score_codex":0.0037064673,"about_ca_system_score_gemma":0.004803204,"threshold_uncertainty_score":0.06852454},"labels":[],"label_agreement":null},{"id":"W2128573323","doi":"10.1016/j.comcom.2012.12.003","title":"A proof of wavelength conversion not improving Lagrangian bounds of the sliding scheduled RWA problem","year":2013,"lang":"en","type":"article","venue":"Computer Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; University of Ottawa","funders":"State Key Laboratory of Advanced Optical Communication Systems and Networks","keywords":"Routing and wavelength assignment; Computer science; Wavelength; Schedule; Upper and lower bounds; Function (biology); Mathematical optimization; Wavelength-division multiplexing; Mathematics; Optics; Physics","score_opus":0.014439859324008498,"score_gpt":0.21222842859229007,"score_spread":0.1977885692682816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128573323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02485124,0.0016802786,0.88814807,0.003246107,0.001068857,0.00019220856,0.0005015486,0.0004977293,0.07981407],"genre_scores_gemma":[0.61692864,0.0024808228,0.34436488,0.0021980593,0.00093117147,0.00084013294,0.00069383153,0.00065850845,0.030903993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830496,0.0005597726,0.000048386497,0.0002995667,0.0004483347,0.0003390024],"domain_scores_gemma":[0.99185634,0.006042136,0.00042047244,0.000668793,0.0006391284,0.00037326955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031685806,0.002278306,0.0017475904,0.0009963932,0.0012317572,0.0026536263,0.0027032257,0.001767782,0.0150556],"category_scores_gemma":[0.012918539,0.0009107271,0.0019700392,0.0014496311,0.0027845998,0.003930276,0.003718826,0.007194775,0.0012180372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031742483,0.00027075192,0.00044512868,0.0008033499,0.00013504148,0.0002743593,0.00031895845,0.27057403,0.005607735,0.64777434,0.024273988,0.049204964],"study_design_scores_gemma":[0.00009037207,0.00014809624,0.00035225102,0.00017761771,0.00005334582,0.00009494424,0.000092872404,0.5605105,0.001830511,0.42938447,0.007228039,0.000036947833],"about_ca_topic_score_codex":0.0030273655,"about_ca_topic_score_gemma":0.0032267268,"teacher_disagreement_score":0.0150556,"about_ca_system_score_codex":0.0017238312,"about_ca_system_score_gemma":0.0033177778,"threshold_uncertainty_score":0.050365984},"labels":[],"label_agreement":null},{"id":"W2131288453","doi":"10.1016/s0140-3664(00)00229-2","title":"Rapid generation of functional tests using MSCs, SDL and TTCN","year":2001,"lang":"en","type":"article","venue":"Computer Communications","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science","score_opus":0.21870477160732624,"score_gpt":0.32048971299808116,"score_spread":0.10178494139075492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131288453","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04134282,0.00009779946,0.93108094,0.000111629146,0.0000940295,0.0002131584,0.00036207738,0.023439893,0.0032576714],"genre_scores_gemma":[0.51065314,0.0000983586,0.48195863,0.00013579676,0.000040444127,0.00034582545,0.0013083718,0.0027648734,0.0026945504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99649054,0.0010378787,0.00026648142,0.00035757094,0.0015780396,0.00026953727],"domain_scores_gemma":[0.98608726,0.008347346,0.0008913479,0.0018166042,0.00254081,0.0003165413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023415799,0.001250886,0.0007893126,0.0022007506,0.00031390152,0.0011012339,0.0015548252,0.0007687935,0.005127454],"category_scores_gemma":[0.0142726395,0.00047383853,0.0007368062,0.0007150239,0.0008382222,0.0012827324,0.0013143208,0.00088243524,0.0012966946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00177952,0.0005225426,0.00697836,0.0007658639,0.00011674377,0.001355238,0.00055197976,0.08207212,0.15741023,0.030809678,0.010587293,0.7070505],"study_design_scores_gemma":[0.00033906524,0.0007376584,0.0011392176,0.00011792206,0.00009799072,0.000553636,0.000117250696,0.6877318,0.27627572,0.019476691,0.013345956,0.000067153385],"about_ca_topic_score_codex":0.0017022161,"about_ca_topic_score_gemma":0.0021453593,"teacher_disagreement_score":0.005127454,"about_ca_system_score_codex":0.00063016,"about_ca_system_score_gemma":0.0012851573,"threshold_uncertainty_score":0.017153084},"labels":[],"label_agreement":null},{"id":"W2133451802","doi":"10.1016/j.comcom.2004.12.034","title":"Serialized optimal relay schedules in two-tiered wireless sensor networks","year":2005,"lang":"en","type":"article","venue":"Computer Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Computer science; Wireless sensor network; Computer network; Provisioning; Node (physics); Overhead (engineering); Base station; Wireless; Cluster (spacecraft); Topology (electrical circuits); Process (computing); Distributed computing; Telecommunications; Electrical engineering; Power (physics)","score_opus":0.02081356204800513,"score_gpt":0.279097683919875,"score_spread":0.2582841218718699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133451802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120317504,0.0007015295,0.8729874,0.00046687812,0.00015446033,0.00025332323,0.00040647903,0.00071021804,0.0040022605],"genre_scores_gemma":[0.87018996,0.00039185138,0.12436709,0.00013763605,0.000081986924,0.0002165038,0.00030731157,0.00012777172,0.004179922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982102,0.0007610638,0.00012742121,0.00027488277,0.00033166807,0.00029474503],"domain_scores_gemma":[0.99457705,0.0031458593,0.0006137999,0.0006614514,0.0007365546,0.00026529992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030561252,0.0011382977,0.0022573383,0.00078255724,0.00072513387,0.0014955613,0.0025246139,0.0010355514,0.0027581218],"category_scores_gemma":[0.007792274,0.001111916,0.00050754537,0.001472083,0.0010358533,0.0021762229,0.0013897994,0.00096617,0.00043007944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000479182,0.000076096716,0.00028670166,0.000087922126,0.000031939755,0.000072699644,0.00007845353,0.9658154,0.0024797292,0.011130234,0.0014109674,0.01805071],"study_design_scores_gemma":[0.000042598465,0.00009687746,0.00012491558,0.0000041885173,0.0000123600885,0.000029057694,0.000018574181,0.99175805,0.000580343,0.0070992336,0.0002246211,0.000009163758],"about_ca_topic_score_codex":0.0039330306,"about_ca_topic_score_gemma":0.0074281543,"teacher_disagreement_score":0.0039330306,"about_ca_system_score_codex":0.00166953,"about_ca_system_score_gemma":0.002373753,"threshold_uncertainty_score":0.016162515},"labels":[],"label_agreement":null},{"id":"W2150124995","doi":"10.1016/j.comcom.2006.02.009","title":"Sleep scheduling for wireless sensor networks via network flow model","year":2006,"lang":"en","type":"article","venue":"Computer Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Wireless sensor network; Scheduling (production processes); Computer network; Wireless; Real-time computing; Telecommunications; Mathematical optimization","score_opus":0.020092382136525106,"score_gpt":0.23950357727002305,"score_spread":0.21941119513349794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150124995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014176287,0.00041837158,0.9830169,0.0003527409,0.00010112858,0.00006966924,0.00011207362,0.00018269058,0.0015701329],"genre_scores_gemma":[0.8481749,0.0016657872,0.14147943,0.00022482766,0.00034464648,0.00041329188,0.00031669665,0.00022461978,0.007155687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929404,0.00028620433,0.000030279505,0.00012412999,0.00015499418,0.00011038139],"domain_scores_gemma":[0.99751854,0.0017919997,0.00019826728,0.00010869965,0.00028547793,0.000097040465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027391387,0.0011055503,0.0015378447,0.0011414456,0.00076397706,0.0015204751,0.0022453035,0.0010007003,0.0029845496],"category_scores_gemma":[0.006824149,0.00083670195,0.0007951887,0.0012088404,0.0010457728,0.00312255,0.0010358074,0.001291634,0.00028226865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007702345,0.000044356046,0.0001712865,0.000047000223,0.000024528254,0.000020463207,0.000042336946,0.94465125,0.00048004964,0.04277985,0.0011479524,0.01051387],"study_design_scores_gemma":[0.0000038530056,0.0000045026954,0.000014383228,0.000001764699,0.0000033331946,0.0000018144902,0.000002554131,0.99306583,0.00003095373,0.0067836773,0.000085523636,0.0000017431121],"about_ca_topic_score_codex":0.0070504,"about_ca_topic_score_gemma":0.0061552436,"teacher_disagreement_score":0.0070504,"about_ca_system_score_codex":0.0022371407,"about_ca_system_score_gemma":0.001671417,"threshold_uncertainty_score":0.016231656},"labels":[],"label_agreement":null},{"id":"W2152960680","doi":"10.1016/j.comcom.2004.07.019","title":"An efficient secure distributed anonymous routing protocol for mobile and wireless ad hoc networks","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer network; Computer science; Wireless ad hoc network; Optimized Link State Routing Protocol; Mobile ad hoc network; Node (physics); Wireless Routing Protocol; Computer security; Routing protocol; Network packet; Wireless; Telecommunications","score_opus":0.02131202181975967,"score_gpt":0.30161222326954323,"score_spread":0.28030020144978357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152960680","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024820516,0.00064392213,0.9650073,0.0004960167,0.00050339167,0.00042312287,0.00015978231,0.0023569905,0.0055889892],"genre_scores_gemma":[0.48767877,0.0008593598,0.49218044,0.00031544376,0.00030125814,0.0005960613,0.00059118925,0.00030831262,0.017169075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820006,0.0003872119,0.00013963039,0.00012698078,0.0009989974,0.000147161],"domain_scores_gemma":[0.997672,0.0007115282,0.00019860647,0.00081948505,0.0004959805,0.000102368096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019007716,0.0006100089,0.00092149904,0.0008838523,0.0015461589,0.0013570104,0.0017659914,0.0009806458,0.0018866945],"category_scores_gemma":[0.0034408679,0.0004537299,0.0005280408,0.00075786107,0.00097647775,0.0028380922,0.0031401718,0.0013268271,0.00092582277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001620269,0.00048393774,0.0009474752,0.0004701449,0.00018447572,0.0009912783,0.0004945459,0.16530044,0.055652317,0.2716492,0.025430663,0.47677532],"study_design_scores_gemma":[0.00029604093,0.00040363017,0.00043023858,0.000045851953,0.00020664858,0.0007560924,0.00013443854,0.8143558,0.025168447,0.111719385,0.046367534,0.00011592974],"about_ca_topic_score_codex":0.00069278036,"about_ca_topic_score_gemma":0.0017047874,"teacher_disagreement_score":0.0019007716,"about_ca_system_score_codex":0.0007476852,"about_ca_system_score_gemma":0.0016480521,"threshold_uncertainty_score":0.010052383},"labels":[],"label_agreement":null},{"id":"W2153614597","doi":"10.1016/j.comcom.2009.02.001","title":"Multiple frequency reuse schemes in the two-hop IEEE 802.16j wireless relay networks with asymmetrical topology","year":2009,"lang":"en","type":"article","venue":"Computer Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Manitoba","funders":"Beijing Jiaotong University; Ministry of Education of the People's Republic of China; National Natural Science Foundation of China","keywords":"Computer science; Computer network; Relay; RSS; Base station; Reuse; Throughput; IEEE 802; Wireless; Telecommunications; Power (physics); Engineering; Quality of service; Operating system","score_opus":0.04718666208462432,"score_gpt":0.3014459932283545,"score_spread":0.2542593311437302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153614597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2007609,0.0034576193,0.78202146,0.0008912883,0.00014354342,0.00008385976,0.000104517145,0.00028304494,0.012253766],"genre_scores_gemma":[0.9427376,0.0007529197,0.053209405,0.00007038296,0.00008603563,0.000065642555,0.000041065487,0.000019976818,0.00301697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990119,0.00039879186,0.000051771527,0.00009319923,0.00028661074,0.00015764772],"domain_scores_gemma":[0.9977246,0.001104352,0.00024058818,0.00049648766,0.00036957266,0.00006436769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018294872,0.00041951932,0.0007213036,0.0006229612,0.0006430804,0.0011661862,0.0012427535,0.00073519716,0.0011286954],"category_scores_gemma":[0.0042202785,0.00042509608,0.00037947914,0.0007907335,0.0008560756,0.002079184,0.0010902622,0.0007206674,0.00030777827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008504557,0.00017937213,0.0021281769,0.00024222756,0.000081492784,0.00069810386,0.0008194086,0.37768757,0.028903693,0.40090996,0.0038586007,0.18364099],"study_design_scores_gemma":[0.00010395474,0.00025186565,0.00081860524,0.000050317092,0.00006664642,0.00080974324,0.00014443827,0.8653591,0.007041591,0.12195982,0.0033137186,0.00008017823],"about_ca_topic_score_codex":0.001215271,"about_ca_topic_score_gemma":0.0020425743,"teacher_disagreement_score":0.0018294872,"about_ca_system_score_codex":0.00079650566,"about_ca_system_score_gemma":0.0007422694,"threshold_uncertainty_score":0.009675384},"labels":[],"label_agreement":null},{"id":"W2165581682","doi":"10.1016/j.comcom.2004.09.016","title":"Weight allocation in distributed admission control for wireless networks","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Wireless network; Wireless; Control (management); Distributed computing; Telecommunications; Artificial intelligence","score_opus":0.03237697076132606,"score_gpt":0.30174540199618716,"score_spread":0.2693684312348611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165581682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023038037,0.00057499565,0.9741329,0.0003895193,0.00016424128,0.000044933964,0.000017622004,0.00015652401,0.0014811124],"genre_scores_gemma":[0.8859973,0.0008042242,0.10541853,0.00019684019,0.0004131854,0.00020751482,0.000054775865,0.00012748678,0.006780105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724007,0.0010295596,0.00013872451,0.00035811402,0.0007515024,0.000481936],"domain_scores_gemma":[0.9937827,0.0044361283,0.00036366034,0.00041807856,0.0007347836,0.00026473156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004369604,0.001225435,0.0020097701,0.00096668844,0.0012715292,0.0025546837,0.0027482247,0.0015819465,0.0021443008],"category_scores_gemma":[0.01637413,0.0007456079,0.0004797813,0.0018946724,0.0022658275,0.004026073,0.0023548366,0.0026459277,0.00029073737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004596612,0.00016998954,0.0006161809,0.00013174716,0.0000835252,0.00006616196,0.0002375231,0.76034045,0.003324676,0.1217705,0.0019264609,0.11087311],"study_design_scores_gemma":[0.00003093447,0.00002402271,0.00006271837,0.00000670355,0.000013023966,0.0000122026995,0.000014974463,0.9517265,0.00031968893,0.047467362,0.00031304386,0.00000885734],"about_ca_topic_score_codex":0.0049358816,"about_ca_topic_score_gemma":0.00434866,"teacher_disagreement_score":0.0049358816,"about_ca_system_score_codex":0.001934423,"about_ca_system_score_gemma":0.0017590977,"threshold_uncertainty_score":0.02310896},"labels":[],"label_agreement":null},{"id":"W2170801914","doi":"10.1016/j.comcom.2011.08.008","title":"ORACLE: Mobility control in wireless sensor and actor networks","year":2011,"lang":"en","type":"article","venue":"Computer Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Oracle; Event (particle physics); Wireless sensor network; Energy consumption; Markov decision process; Real-time computing; Energy (signal processing); Efficient energy use; Wireless; Provisioning; Process (computing); Computer network; Control (management); Markov chain; Markov process; Distributed computing; Telecommunications; Artificial intelligence; Machine learning","score_opus":0.032878367886304535,"score_gpt":0.23555836806356323,"score_spread":0.20268000017725868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170801914","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008348406,0.0015223527,0.97111523,0.0005025592,0.0003004668,0.000073809584,0.00037298928,0.013799669,0.0039644716],"genre_scores_gemma":[0.5560626,0.0027377612,0.41888207,0.00025323918,0.0003539917,0.00023232706,0.0015420166,0.0022299848,0.017705997],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994266,0.00016790768,0.00004702344,0.00007438505,0.00021317537,0.000070876435],"domain_scores_gemma":[0.99915063,0.0003654653,0.00007283498,0.00017478153,0.00012300558,0.00011323002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012315525,0.00080065866,0.00094037614,0.00056612707,0.00045094875,0.0014919953,0.0016252851,0.000692129,0.0044368394],"category_scores_gemma":[0.003514097,0.00035636895,0.00027861795,0.00075282465,0.00085023796,0.0018738556,0.0014428372,0.0012522032,0.001140393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013249748,0.00011447656,0.0016828997,0.0004560771,0.00006870668,0.00033042702,0.00028411826,0.24660572,0.015073435,0.1444354,0.041259788,0.5483639],"study_design_scores_gemma":[0.00014525895,0.00010849645,0.00047932006,0.000041522322,0.000042409898,0.00018608339,0.00005699951,0.9120589,0.011230086,0.03783454,0.03777644,0.000039968658],"about_ca_topic_score_codex":0.0042707664,"about_ca_topic_score_gemma":0.003907729,"teacher_disagreement_score":0.0044368394,"about_ca_system_score_codex":0.00041009605,"about_ca_system_score_gemma":0.0006694277,"threshold_uncertainty_score":0.014842749},"labels":[],"label_agreement":null},{"id":"W2195107683","doi":"10.1016/j.comcom.2015.11.012","title":"Discrete time analysis of cognitive radio networks with imperfect sensing and saturated source of secondary users","year":2015,"lang":"en","type":"article","venue":"Computer Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Universitat Politècnica de València; Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad; University of Manitoba","keywords":"Cognitive radio; Computer science; Goodput; White spaces; Transmission (telecommunications); Channel (broadcasting); Interference (communication); Markov chain; Idle; Phase-type distribution; Sequence (biology); Real-time computing; Data transmission; Markov process; Range (aeronautics); Telecommunications; Computer network; Wireless; Throughput; Statistics; Machine learning","score_opus":0.01643365719770826,"score_gpt":0.2418856517510935,"score_spread":0.22545199455338524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2195107683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19142188,0.0030775554,0.7552438,0.0038663829,0.00048184927,0.00013214725,0.0007641844,0.0003115224,0.044700805],"genre_scores_gemma":[0.98124605,0.0010734284,0.006853059,0.0002291703,0.00018462708,0.00007582826,0.00014906496,0.00007434588,0.010114357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986374,0.00040104258,0.000038454105,0.0001859857,0.00033963003,0.00039752206],"domain_scores_gemma":[0.9894075,0.007746216,0.0009880904,0.00028391054,0.0011488545,0.00042556738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002627132,0.0015501294,0.0017836519,0.0015428262,0.0007947239,0.0026174982,0.0026192016,0.0017532927,0.0053442596],"category_scores_gemma":[0.010483762,0.0010477838,0.001034451,0.0013936104,0.002847171,0.002299376,0.0017815018,0.002119128,0.0004262426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109538836,0.00005360801,0.0007674473,0.000106623454,0.00007496769,0.00019618536,0.00014503664,0.8910093,0.0012999446,0.10192862,0.0012130956,0.003095712],"study_design_scores_gemma":[0.0000065860677,0.000010746104,0.00017138368,0.0000067332494,0.000011238667,0.000024868506,0.000025785448,0.9899046,0.00007236027,0.009626515,0.00013105162,0.000008133972],"about_ca_topic_score_codex":0.013852127,"about_ca_topic_score_gemma":0.008883324,"teacher_disagreement_score":0.013852127,"about_ca_system_score_codex":0.0034790803,"about_ca_system_score_gemma":0.0019757224,"threshold_uncertainty_score":0.027543008},"labels":[],"label_agreement":null},{"id":"W2213047121","doi":"10.1016/j.comcom.2015.09.002","title":"Smartphone positioning in sparse Wi-Fi environments","year":2015,"lang":"en","type":"article","venue":"Computer Communications","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Accelerometer; Global Positioning System; Gyroscope; Real-time computing; Artificial intelligence; Mobile device; Computer vision; Position (finance); Telecommunications","score_opus":0.03911038953729748,"score_gpt":0.2319059165397991,"score_spread":0.19279552700250163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2213047121","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5970887,0.0008539146,0.39183936,0.000323945,0.00014251657,0.0000356304,0.0005898557,0.000528134,0.008597932],"genre_scores_gemma":[0.98350406,0.0003201979,0.0143057965,0.000027055177,0.000048541206,0.000012279743,0.00025732792,0.000010013109,0.0015147453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968326,0.00007125108,0.000016236574,0.00006724227,0.000091220136,0.0000709486],"domain_scores_gemma":[0.99954695,0.0001858897,0.00006709219,0.000051569812,0.00011689943,0.00003155723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018743874,0.0004259418,0.00043771206,0.0005452387,0.00035695054,0.00063132256,0.000388021,0.0005035957,0.0008319427],"category_scores_gemma":[0.0019256127,0.00026253753,0.00018127839,0.0009990637,0.0003474263,0.0007855158,0.00080833235,0.00025812746,0.00046741913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014283645,0.00013813053,0.08170774,0.0006230522,0.00017730596,0.0019961356,0.0010154992,0.45027244,0.08941619,0.011523595,0.005326895,0.3563747],"study_design_scores_gemma":[0.000033834334,0.0003326583,0.045835517,0.000047999947,0.00007718455,0.0012776722,0.00072291924,0.9311177,0.01246805,0.004851627,0.0031917566,0.00004300968],"about_ca_topic_score_codex":0.006025906,"about_ca_topic_score_gemma":0.011973496,"teacher_disagreement_score":0.006025906,"about_ca_system_score_codex":0.00020341591,"about_ca_system_score_gemma":0.0003602904,"threshold_uncertainty_score":0.011981666},"labels":[],"label_agreement":null},{"id":"W2284873372","doi":"10.1016/j.comcom.2015.11.006","title":"Wireless and Mobile Network Modeling, Analysis, Design, Optimization, and Simulation","year":2015,"lang":"en","type":"article","venue":"Computer Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Graph; Social network (sociolinguistics); Machine learning; Mobile social network; Artificial intelligence; Data mining; World Wide Web; Theoretical computer science; Mobile computing; Social media; Computer network","score_opus":0.044765546650496243,"score_gpt":0.27213420369710706,"score_spread":0.2273686570466108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2284873372","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030091623,0.0016521682,0.9504133,0.0008650041,0.00012109143,0.00007979891,0.00033850828,0.00021082035,0.016227733],"genre_scores_gemma":[0.80406094,0.0070275036,0.15967648,0.00023806046,0.0003031575,0.00035223912,0.00047461284,0.00016103829,0.02770586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997209,0.000089765264,0.000010090611,0.00003523414,0.00010574058,0.00003830346],"domain_scores_gemma":[0.99963677,0.00017744034,0.000042957767,0.00004082751,0.00008625734,0.000015734824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046477158,0.0005548852,0.0005105508,0.00055093266,0.0002910208,0.0009360121,0.00063699693,0.00068960927,0.0020833048],"category_scores_gemma":[0.0013316966,0.0003524178,0.00045866362,0.0009792551,0.00043539415,0.0009971671,0.00045230635,0.00065132097,0.00052785035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006692086,0.000017051934,0.0003240377,0.000023028666,0.000010267282,0.000016720272,0.000009479217,0.9760801,0.00077884656,0.014136929,0.0006180321,0.007978748],"study_design_scores_gemma":[0.0000014402277,0.0000056530307,0.000092747105,0.0000023641646,0.000003340668,0.000010721993,0.0000039159377,0.9959162,0.00023021028,0.0027981638,0.00093308114,0.00000219682],"about_ca_topic_score_codex":0.0085140485,"about_ca_topic_score_gemma":0.0087072635,"teacher_disagreement_score":0.0085140485,"about_ca_system_score_codex":0.0008711743,"about_ca_system_score_gemma":0.0010294229,"threshold_uncertainty_score":0.01692897},"labels":[],"label_agreement":null},{"id":"W2299515439","doi":"10.1016/j.comcom.2016.03.001","title":"Improved particle filter based on WLAN RSSI fingerprinting and smart sensors for indoor localization","year":2016,"lang":"en","type":"article","venue":"Computer Communications","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"CMC Microsystems","keywords":"Computer science; Initialization; Particle filter; Fingerprint (computing); Fingerprint recognition; Wireless sensor network; Weighting; Convergence (economics); Filter (signal processing); Algorithm; Process (computing); Real-time computing; Artificial intelligence; Kalman filter; Computer vision; Computer network; Acoustics","score_opus":0.020798011534609067,"score_gpt":0.23233789166138985,"score_spread":0.2115398801267808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2299515439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068602026,0.00040786288,0.99093026,0.0000662286,0.00015883475,0.000014237768,0.00003099298,0.0004679664,0.0010635067],"genre_scores_gemma":[0.4541835,0.0015792424,0.5356465,0.00020781926,0.000254047,0.000117127995,0.0003635791,0.00009031179,0.0075579328],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995437,0.00007705628,0.00002136248,0.00010522204,0.00021521705,0.000037436548],"domain_scores_gemma":[0.9996722,0.000081569066,0.00003156847,0.00006282596,0.00013991688,0.000011971554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036004646,0.0006705626,0.00090443814,0.0005231313,0.00028598652,0.0005539276,0.0007135542,0.0007871284,0.0012568209],"category_scores_gemma":[0.00087348704,0.0003304103,0.0006345862,0.0009301149,0.00021620387,0.0010021377,0.00042819433,0.000690733,0.0008589579],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004763286,0.00018899236,0.004879326,0.0003509592,0.00024533516,0.00023486256,0.00017314128,0.16581433,0.09073051,0.010399901,0.0066124015,0.719894],"study_design_scores_gemma":[0.000031244566,0.00011240565,0.00261263,0.000014148752,0.00008060481,0.000240642,0.00002242663,0.9753102,0.015231628,0.0012182816,0.0050923317,0.000033346885],"about_ca_topic_score_codex":0.0036531342,"about_ca_topic_score_gemma":0.003824689,"teacher_disagreement_score":0.0036531342,"about_ca_system_score_codex":0.00032782674,"about_ca_system_score_gemma":0.0005436598,"threshold_uncertainty_score":0.0072637796},"labels":[],"label_agreement":null},{"id":"W2426786974","doi":"10.1016/j.comcom.2013.01.001","title":"Target to sensor allocation: A hierarchical dynamic Distributed Constraint Optimization approach","year":2013,"lang":"en","type":"article","venue":"Computer Communications","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Asynchronous communication; Optimization problem; Wireless sensor network; Distributed computing; Set (abstract data type); Constraint (computer-aided design); Mathematical optimization; Algorithm; Computer network","score_opus":0.017447699110899124,"score_gpt":0.2480492258699638,"score_spread":0.23060152675906467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2426786974","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018258975,0.00008491167,0.99498534,0.0001428557,0.000024078043,0.000048636848,0.000065994136,0.00012540852,0.0026968564],"genre_scores_gemma":[0.30680507,0.00045079758,0.68154544,0.00034232836,0.00018289994,0.00052956823,0.0004304903,0.00040773675,0.009305529],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817884,0.00064766075,0.00006844768,0.00035842383,0.0005239762,0.00022277613],"domain_scores_gemma":[0.99801433,0.0011808429,0.0001557076,0.00021711037,0.00033193614,0.0000999766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021342705,0.0014623633,0.0022507943,0.0012316257,0.0010703166,0.0023953882,0.004286034,0.0018423522,0.0072331126],"category_scores_gemma":[0.005280467,0.001427625,0.0015397839,0.003562548,0.0011813376,0.002663441,0.0027396858,0.0017903262,0.00072261185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024672758,0.00003345066,0.00008545526,0.000045976725,0.000033956312,0.000033005945,0.000035247274,0.96663386,0.00052374165,0.015850509,0.0013047886,0.015395363],"study_design_scores_gemma":[0.000006902486,0.000008311161,0.000021798314,0.0000025569614,0.0000065435615,0.00000653662,0.000007936451,0.9946443,0.00015013207,0.0047674803,0.0003737213,0.0000038829376],"about_ca_topic_score_codex":0.011436045,"about_ca_topic_score_gemma":0.014681378,"teacher_disagreement_score":0.011436045,"about_ca_system_score_codex":0.0017332687,"about_ca_system_score_gemma":0.0027384106,"threshold_uncertainty_score":0.024197161},"labels":[],"label_agreement":null},{"id":"W2486094321","doi":"10.1016/j.comcom.2016.07.009","title":"Organized topology based routing protocol in incompletely predictable ad-hoc networks","year":2016,"lang":"en","type":"article","venue":"Computer Communications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ontario Institute of Technology","funders":"Nanjing University of Information Science and Technology; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer science; Topology (electrical circuits); Routing protocol; Network topology; Computer network; Distributed computing; Routing (electronic design automation); Node (physics); Routing table; Wireless ad hoc network; Mathematics; Telecommunications","score_opus":0.04124923082441778,"score_gpt":0.286514547669909,"score_spread":0.24526531684549124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2486094321","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14175567,0.0006754231,0.85185117,0.0004185259,0.00017539244,0.00014190025,0.00019703415,0.0005847279,0.0042002075],"genre_scores_gemma":[0.93111324,0.0003602091,0.065915205,0.0000624072,0.000049533734,0.00010440709,0.00022551997,0.00003141022,0.0021380398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995875,0.00012771011,0.000035718145,0.00005851709,0.00015166776,0.000038910217],"domain_scores_gemma":[0.9986313,0.00053353026,0.00025511323,0.00027553926,0.00021838231,0.00008621604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007308832,0.00027502677,0.00045537777,0.0006434047,0.0007170396,0.0009429456,0.0011306895,0.0004562946,0.00047284632],"category_scores_gemma":[0.0018731037,0.00024160363,0.00019823464,0.00065638626,0.00051363936,0.0012232803,0.0010111964,0.000528876,0.0001164699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049134745,0.00018806815,0.0027866957,0.00024156188,0.00012326613,0.00063785084,0.0005192297,0.7404124,0.028992709,0.12330367,0.0033366282,0.09896658],"study_design_scores_gemma":[0.000029553526,0.00020601634,0.0005573632,0.000012975487,0.00004154374,0.00018520451,0.00009701398,0.95903873,0.0053854324,0.03132097,0.0031059103,0.000019434518],"about_ca_topic_score_codex":0.0006265228,"about_ca_topic_score_gemma":0.0011596219,"teacher_disagreement_score":0.0011306895,"about_ca_system_score_codex":0.00043264363,"about_ca_system_score_gemma":0.00073676865,"threshold_uncertainty_score":0.0038653612},"labels":[],"label_agreement":null},{"id":"W2567882795","doi":"10.1016/j.comcom.2016.12.018","title":"Modelling and performance analysis of TCP variants for data collection in smart power grids","year":2017,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Computer science; Zeta-TCP; TCP tuning; TCP acceleration; TCP Vegas; TCP Friendly Rate Control; Computer network; TCP global synchronization; Compound TCP; Transmission Control Protocol; HSTCP; Network packet","score_opus":0.0882163159250546,"score_gpt":0.30133368782097564,"score_spread":0.21311737189592103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567882795","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5820629,0.0017875656,0.40730533,0.0009374382,0.00015559467,0.000168851,0.00031172312,0.00067484577,0.0065957773],"genre_scores_gemma":[0.99346256,0.00025437848,0.005405881,0.000012974781,0.000020527235,0.000029587027,0.000052869673,0.00003791514,0.00072338193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992416,0.00031942836,0.0000409618,0.00011641743,0.00015553272,0.00012601215],"domain_scores_gemma":[0.99473286,0.0036967967,0.0003588288,0.00022619539,0.00085855194,0.00012677272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019911446,0.0010390185,0.0009480913,0.0008549039,0.0006868551,0.0015678178,0.0016936985,0.0013662077,0.0009167665],"category_scores_gemma":[0.008643099,0.00056575943,0.00066770986,0.0009556304,0.0011698673,0.0012707042,0.0005484327,0.0012970102,0.00013624053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033519897,0.000017562375,0.00047881017,0.000014586516,0.0000075933376,0.00002385683,0.000019693045,0.9955337,0.00044596763,0.0018893474,0.000096551164,0.0014387942],"study_design_scores_gemma":[0.0000011333415,0.0000037634281,0.000050852963,9.615334e-7,0.0000022514757,0.0000028766867,0.0000018815283,0.99963367,0.000091498594,0.00019181389,0.000017777185,0.0000015128226],"about_ca_topic_score_codex":0.0392224,"about_ca_topic_score_gemma":0.011086705,"teacher_disagreement_score":0.0392224,"about_ca_system_score_codex":0.0023678085,"about_ca_system_score_gemma":0.001494846,"threshold_uncertainty_score":0.07798821},"labels":[],"label_agreement":null},{"id":"W2581327855","doi":"10.1016/j.comcom.2017.01.012","title":"End-to-end programmable, cloud-based virtualized HetNet: Advances made & challenges to address","year":2017,"lang":"en","type":"article","venue":"Computer Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; Cloud computing; Virtualization; Heterogeneous network; Computer network; Provisioning; Network virtualization; Virtual network; Wireless network; Distributed computing; Wireless; Telecommunications; Operating system","score_opus":0.08872327753139031,"score_gpt":0.3377010668258494,"score_spread":0.24897778929445907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2581327855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05989564,0.01946816,0.8788598,0.008067378,0.0018987515,0.000098140605,0.0003076313,0.0007148984,0.030689608],"genre_scores_gemma":[0.905522,0.008589497,0.075212464,0.0013643865,0.0006073061,0.000044554152,0.00031475603,0.00005149342,0.008293548],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99951434,0.00012903946,0.000012608675,0.000088749875,0.00011823317,0.00013707756],"domain_scores_gemma":[0.99912316,0.00026641294,0.00007036429,0.00010052129,0.00032119974,0.000118306205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013417796,0.000465339,0.0006787666,0.00022040367,0.0003904771,0.002501981,0.0019515974,0.00079871016,0.0034238119],"category_scores_gemma":[0.001318646,0.0001738696,0.0001968146,0.0003552479,0.0006832878,0.0035761085,0.001419199,0.0012818835,0.00066063885],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048248438,0.00024761588,0.0034466349,0.00056141434,0.000106894484,0.00043634584,0.00024971587,0.20587057,0.026492005,0.32104552,0.038020633,0.40304014],"study_design_scores_gemma":[0.00002718775,0.00030668091,0.00084007496,0.0001292267,0.000056422236,0.00044474556,0.0005441179,0.82527584,0.0058664447,0.10590817,0.060562413,0.000038716833],"about_ca_topic_score_codex":0.0014899075,"about_ca_topic_score_gemma":0.0032998794,"teacher_disagreement_score":0.0034238119,"about_ca_system_score_codex":0.00068422774,"about_ca_system_score_gemma":0.0012905145,"threshold_uncertainty_score":0.011453807},"labels":[],"label_agreement":null},{"id":"W2582221108","doi":"10.1016/j.comcom.2017.01.008","title":"Special Section on Mobile Content Delivery Networks","year":2017,"lang":"en","type":"article","venue":"Computer Communications","topic":"Innovation in Digital Healthcare Systems","field":"Health Professions","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Context (archaeology); Wireless sensor network; Software deployment; Wireless network; Quality of service; Computer network; Service (business); Wireless; Control (management); Telecommunications; Artificial intelligence; Software engineering","score_opus":0.2906388759526602,"score_gpt":0.4599203524669887,"score_spread":0.1692814765143285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582221108","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053165277,0.018138157,0.001162706,0.030886423,0.9162231,0.00008576097,0.00021531907,0.00018411616,0.032572716],"genre_scores_gemma":[0.0024325792,0.018785316,0.00033808933,0.01853851,0.88146025,0.000094112336,0.000238695,0.0001360034,0.07797646],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984439,0.00020547274,0.00017485871,0.0002887101,0.0006639367,0.00022317642],"domain_scores_gemma":[0.9923666,0.0023689508,0.0007919886,0.00047033426,0.0025977322,0.0014043094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017302032,0.0020811686,0.0021585422,0.0038377137,0.0021566222,0.0043028044,0.0020469704,0.008101076,0.04368188],"category_scores_gemma":[0.005793368,0.0006899682,0.0011925237,0.002601553,0.0014176389,0.00338763,0.0023192193,0.0053279963,0.018328017],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003354996,0.000047674515,0.00019995222,0.00028842752,0.000011801473,0.00025879414,0.000015920044,0.00013261917,0.00045635886,0.0013812922,0.9681525,0.029021155],"study_design_scores_gemma":[0.000007093964,0.00006434035,0.00072657777,0.00026070842,0.000012763218,0.0004433952,0.000025413427,0.00018309362,0.00012792142,0.0008784711,0.9972589,0.00001126349],"about_ca_topic_score_codex":0.0013821655,"about_ca_topic_score_gemma":0.005077437,"teacher_disagreement_score":0.04368188,"about_ca_system_score_codex":0.0018487409,"about_ca_system_score_gemma":0.0021492878,"threshold_uncertainty_score":0.1461305},"labels":[],"label_agreement":null},{"id":"W2610221642","doi":"10.1016/j.comcom.2017.08.003","title":"Optimizing power allocation in wireless networks: Are the implicit constraints really redundant?","year":2017,"lang":"en","type":"article","venue":"Computer Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Wireless; Power (physics); Wireless network; Mathematical optimization; Computer network; Distributed computing; Telecommunications","score_opus":0.05477273371121708,"score_gpt":0.30991945216789674,"score_spread":0.25514671845667963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610221642","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08188467,0.003306019,0.890675,0.007785322,0.000392211,0.000045179666,0.0002351172,0.000100454134,0.015576079],"genre_scores_gemma":[0.8979529,0.0028671678,0.092548996,0.0008649547,0.00065142434,0.00009386219,0.00016605284,0.00011657045,0.004737977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979505,0.0012993271,0.000086007196,0.0001903798,0.00029708684,0.00017680752],"domain_scores_gemma":[0.98993355,0.008055315,0.00057201093,0.0008169529,0.00048644046,0.00013572516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036324072,0.0008326751,0.001420236,0.00027817572,0.00032009286,0.0015814163,0.0016482758,0.0016703607,0.0032416405],"category_scores_gemma":[0.021732235,0.00072248245,0.00029970636,0.0008599558,0.0020080234,0.005974714,0.001239106,0.0023082208,0.00037813743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039345332,0.0001248397,0.0009955723,0.00045779665,0.00011678217,0.00013698358,0.00016411934,0.61399144,0.0014767797,0.2751582,0.006259833,0.100724235],"study_design_scores_gemma":[0.000104891624,0.000089679044,0.00039841863,0.00009179915,0.000032314827,0.000058921807,0.00006829413,0.6696025,0.0007814165,0.32652104,0.0022245024,0.0000261435],"about_ca_topic_score_codex":0.0009212971,"about_ca_topic_score_gemma":0.0011901072,"teacher_disagreement_score":0.0036324072,"about_ca_system_score_codex":0.00046307564,"about_ca_system_score_gemma":0.00090820016,"threshold_uncertainty_score":0.019210279},"labels":[],"label_agreement":null},{"id":"W2763356328","doi":"10.1016/j.comcom.2017.10.002","title":"When 5G meets ICN: An ICN-based caching approach for mobile video in 5G networks","year":2017,"lang":"en","type":"article","venue":"Computer Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Handover; Cellular network; Quality of experience; Router; Base station; Video quality; Bandwidth (computing); Transmission (telecommunications); Quality of service; Telecommunications","score_opus":0.06781963484572784,"score_gpt":0.304871999234196,"score_spread":0.23705236438846816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2763356328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3502191,0.0070146737,0.47050014,0.023852449,0.004649048,0.0006398834,0.0015214059,0.0027471678,0.13885616],"genre_scores_gemma":[0.97477007,0.0006046504,0.018008808,0.0010039373,0.00033115022,0.000037830352,0.00020647669,0.00010070215,0.004936366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709475,0.00052385783,0.00014513619,0.00043229922,0.0009488242,0.0008551272],"domain_scores_gemma":[0.9958079,0.0012154217,0.0004062347,0.0004948727,0.0016425085,0.00043307056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020588269,0.00059000787,0.0011298427,0.00052904285,0.0016968773,0.0036411243,0.0011299703,0.0022638494,0.0038632185],"category_scores_gemma":[0.011572464,0.00048229104,0.0003621156,0.0006099694,0.00095343497,0.006372746,0.0014221449,0.0017272242,0.0006622823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002515636,0.0003978371,0.051627565,0.000780666,0.00033122342,0.006639051,0.0018146372,0.12075442,0.050997633,0.3918832,0.09487179,0.27738634],"study_design_scores_gemma":[0.00007843555,0.00034935045,0.0121946735,0.00025558757,0.00024599853,0.0031406283,0.0030396774,0.73977923,0.018408747,0.1703111,0.052025076,0.00017161759],"about_ca_topic_score_codex":0.011126602,"about_ca_topic_score_gemma":0.01915239,"teacher_disagreement_score":0.011126602,"about_ca_system_score_codex":0.0023436875,"about_ca_system_score_gemma":0.0025670682,"threshold_uncertainty_score":0.022123694},"labels":[],"label_agreement":null},{"id":"W2778663425","doi":"10.1016/j.comcom.2017.12.007","title":"Energy efficiency and accuracy of solar powered BLE beacons","year":2017,"lang":"en","type":"article","venue":"Computer Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Beacon; Computer science; Wireless; Bluetooth Low Energy; Energy harvesting; Efficient energy use; Energy (signal processing); Computer network; Bluetooth; Telecommunications; Real-time computing; Electrical engineering; Engineering","score_opus":0.02270923618553613,"score_gpt":0.24994770638425648,"score_spread":0.22723847019872034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2778663425","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79951864,0.0019133788,0.18201613,0.0004888433,0.00015931438,0.000024952902,0.00030618208,0.00046388147,0.015108624],"genre_scores_gemma":[0.995282,0.00014609075,0.0028163688,0.000032734508,0.000012481945,0.0000041502917,0.00009447524,0.000037263104,0.0015743937],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989956,0.00019751796,0.00003705389,0.00018916895,0.00046028328,0.000120387216],"domain_scores_gemma":[0.9963576,0.002229108,0.00024925722,0.00047917102,0.00064418593,0.000040522173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012369826,0.00021784207,0.00037607158,0.0005212975,0.00029321737,0.0009479541,0.0005965585,0.00071415055,0.0015621247],"category_scores_gemma":[0.0076271016,0.00018956137,0.00019987467,0.00063227396,0.00032181677,0.00092498824,0.00053686404,0.00040882474,0.00058903586],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003746978,0.00022961866,0.04249677,0.00037324018,0.00016160813,0.00018404264,0.0006677194,0.29387826,0.35973856,0.016910885,0.0019586557,0.27965367],"study_design_scores_gemma":[0.000058815604,0.0005277567,0.031480648,0.00008334618,0.00010816504,0.00045463897,0.00025521693,0.5723157,0.38539642,0.0048193755,0.004426504,0.00007352463],"about_ca_topic_score_codex":0.0006554795,"about_ca_topic_score_gemma":0.00074924756,"teacher_disagreement_score":0.0015621247,"about_ca_system_score_codex":0.00061286177,"about_ca_system_score_gemma":0.00021870993,"threshold_uncertainty_score":0.006541908},"labels":[],"label_agreement":null},{"id":"W2795697207","doi":"10.1016/j.comcom.2018.03.017","title":"Special Issue on Technical challenges and emerging opportunities for 5G enabled IoT systems","year":2018,"lang":"en","type":"article","venue":"Computer Communications","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Cloud computing; Big data; Vehicular ad hoc network; Computer security; Encryption; Computer network; Wireless; Privacy protection; Wireless ad hoc network; Data aggregator; Wireless sensor network; Telecommunications; Data mining","score_opus":0.0771491536409604,"score_gpt":0.2705348498954874,"score_spread":0.19338569625452698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795697207","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010822924,0.03380977,0.0019775021,0.022997472,0.90481806,0.00011626715,0.000344511,0.00019581734,0.03465839],"genre_scores_gemma":[0.0037891248,0.033802863,0.00085686054,0.006510438,0.863067,0.00008299122,0.00073382334,0.00017270335,0.090984106],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986645,0.00016131272,0.00013572912,0.00020730788,0.0006232736,0.00020791731],"domain_scores_gemma":[0.99528015,0.0010276019,0.00039495016,0.00026892454,0.0019345281,0.0010937994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019984304,0.0017491699,0.0017984495,0.002899057,0.0013201312,0.0045876577,0.0017976733,0.003921648,0.056620833],"category_scores_gemma":[0.003296385,0.0004347318,0.00097481534,0.0018537617,0.0007476022,0.0032498352,0.001955052,0.003147116,0.018097578],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065438304,0.00006748927,0.000297738,0.00060237263,0.00002521719,0.00024114066,0.000021989876,0.00017475111,0.00088254723,0.0018294463,0.94488,0.050911903],"study_design_scores_gemma":[0.000012158934,0.00009154918,0.00085022993,0.00032672344,0.000028681841,0.0003255841,0.00004312011,0.00036737515,0.00026727037,0.0021016467,0.99557084,0.000014951778],"about_ca_topic_score_codex":0.00056542765,"about_ca_topic_score_gemma":0.001582889,"teacher_disagreement_score":0.056620833,"about_ca_system_score_codex":0.0010633204,"about_ca_system_score_gemma":0.0018311823,"threshold_uncertainty_score":0.18941557},"labels":[],"label_agreement":null},{"id":"W2950965276","doi":"10.1016/j.comcom.2019.06.004","title":"Optimizing the network diversity to improve the resilience of networks against unknown attacks","year":2019,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Army Research Office; National Institute of Standards and Technology; Natural Sciences and Engineering Research Council of Canada; Georgian National Science Foundation; Office of Naval Research; Concordia University; National Science Foundation","keywords":"Computer science; Resilience (materials science); Heuristic; Network security; Diversification (marketing strategy); Diversity (politics); Optimization problem; Computer security; Metric (unit); Distributed computing; Risk analysis (engineering); Artificial intelligence; Algorithm; Business","score_opus":0.017338658553282076,"score_gpt":0.23965217497823815,"score_spread":0.2223135164249561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950965276","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51822275,0.0014116628,0.46980557,0.0008395015,0.00014156404,0.000041138162,0.00010196145,0.0006217151,0.00881413],"genre_scores_gemma":[0.986629,0.00013252204,0.012598457,0.000040667943,0.000033347296,0.0000074159784,0.000020583191,0.000019793264,0.00051814725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994916,0.00014442585,0.00001569702,0.00010805553,0.000105533305,0.00013468957],"domain_scores_gemma":[0.99847394,0.0007472569,0.0001794509,0.00022864927,0.00026503604,0.00010559631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064975175,0.00044624944,0.00047738332,0.00048849394,0.0004412136,0.00063459284,0.0005347013,0.00046935462,0.0012068644],"category_scores_gemma":[0.003801772,0.00016086362,0.00017797935,0.00036059297,0.00043426896,0.0012933816,0.00094932335,0.0006049466,0.00022494764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003715883,0.00017919004,0.003514263,0.00007519599,0.00008807498,0.000095653915,0.00009001361,0.7975024,0.09269034,0.013576485,0.0014194512,0.09039731],"study_design_scores_gemma":[0.000026820402,0.00017904557,0.00080762565,0.000008751482,0.00002990169,0.00009160971,0.000044149627,0.9754921,0.013635809,0.008765619,0.0009061858,0.000012439229],"about_ca_topic_score_codex":0.0006026949,"about_ca_topic_score_gemma":0.00107591,"teacher_disagreement_score":0.0012068644,"about_ca_system_score_codex":0.0005761931,"about_ca_system_score_gemma":0.0005490763,"threshold_uncertainty_score":0.00418061},"labels":[],"label_agreement":null},{"id":"W2968008834","doi":"10.1016/j.comcom.2019.08.006","title":"Performance analysis of video on demand in an IEEE 802.11p-based vehicular network","year":2019,"lang":"en","type":"article","venue":"Computer Communications","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Ottawa","funders":"","keywords":"Computer science; Computer network; IEEE 802.11p; Sizing; Download; Key (lock); Travel time; Real-time computing; Service (business); Video on demand; IEEE 802; Vehicular ad hoc network; Quality of service; Transport engineering; Telecommunications; Wireless ad hoc network; Engineering; Operating system; Wireless","score_opus":0.029712029065385188,"score_gpt":0.2843773682192572,"score_spread":0.254665339153872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968008834","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9472692,0.0012481667,0.042356133,0.0006168752,0.00011364258,0.0001022536,0.00026905982,0.00033505226,0.007689615],"genre_scores_gemma":[0.9985916,0.00011784328,0.0008506819,0.000015749538,0.000009112933,0.000008705862,0.00006470038,0.000009011748,0.00033245838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981828,0.00048179965,0.00006408444,0.00017338297,0.00057090446,0.0005269781],"domain_scores_gemma":[0.99464697,0.0028896048,0.00028006098,0.00017461256,0.0018034325,0.00020528722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00181347,0.0008697361,0.00077715673,0.0011021266,0.00068268925,0.0010055437,0.0009145902,0.0006922745,0.001315642],"category_scores_gemma":[0.0050879843,0.00020795406,0.00027735796,0.0009659049,0.0007138188,0.00085686764,0.0008205461,0.0005328915,0.0001578665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017770785,0.00021888748,0.00714477,0.00025772932,0.00010801092,0.0003521924,0.00015262328,0.9295492,0.022531083,0.0057464098,0.0019074664,0.030254576],"study_design_scores_gemma":[0.00000956723,0.00028893803,0.0014694909,0.0000056904632,0.00002193732,0.00007382088,0.00008171631,0.99393255,0.0034899078,0.0004532255,0.00016125638,0.000011881929],"about_ca_topic_score_codex":0.017141512,"about_ca_topic_score_gemma":0.01142199,"teacher_disagreement_score":0.017141512,"about_ca_system_score_codex":0.0028066677,"about_ca_system_score_gemma":0.0009720983,"threshold_uncertainty_score":0.034083486},"labels":[],"label_agreement":null},{"id":"W2994178915","doi":"10.1016/j.comcom.2019.11.039","title":"A novel mapping technique for ray tracer to system-level simulation","year":2019,"lang":"en","type":"article","venue":"Computer Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Exfo Electro-Optical Engineering (Canada)","funders":"European Regional Development Fund; Fundação para a Ciência e a Tecnologia; Ministério da Educação e Ciência","keywords":"Computer science; TRACER; Computer graphics (images)","score_opus":0.10269704534703253,"score_gpt":0.2853570257676291,"score_spread":0.18265998042059658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994178915","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016869341,0.00002084246,0.9953536,0.00003081106,0.00003375872,0.000019754974,0.00001578065,0.0011125816,0.0017259846],"genre_scores_gemma":[0.11922306,0.00016271514,0.87239045,0.00011051715,0.00003970468,0.00015360562,0.00013083422,0.0010951669,0.0066939667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970526,0.00007177439,0.000010812744,0.000030012035,0.00015285534,0.000029138919],"domain_scores_gemma":[0.9995085,0.00015007058,0.0000354363,0.00013044041,0.00014217682,0.00003345763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004251674,0.0007134608,0.0004895577,0.0006862934,0.00052899594,0.00095331593,0.0010437563,0.000621732,0.00692359],"category_scores_gemma":[0.0019783804,0.00042559014,0.00045382054,0.0005732985,0.0004909156,0.0009773877,0.0015011587,0.0012855588,0.0015405201],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031187313,0.0003026107,0.0014411052,0.00026885362,0.00009108508,0.00028614368,0.0005548034,0.2733349,0.15009,0.18840908,0.009467085,0.37544236],"study_design_scores_gemma":[0.000020738678,0.000052890788,0.00012766456,0.0000145960175,0.000010986784,0.00012355772,0.00003333268,0.94575506,0.027591335,0.007649373,0.018603874,0.000016610256],"about_ca_topic_score_codex":0.001971628,"about_ca_topic_score_gemma":0.0022583564,"teacher_disagreement_score":0.00692359,"about_ca_system_score_codex":0.0004179488,"about_ca_system_score_gemma":0.0009984851,"threshold_uncertainty_score":0.02316171},"labels":[],"label_agreement":null},{"id":"W3011052769","doi":"10.1016/j.comcom.2020.03.017","title":"Unmanned aerial vehicle for internet of everything: Opportunities and challenges","year":2020,"lang":"en","type":"article","venue":"Computer Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":231,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Fundo para o Desenvolvimento das Ciências e da Tecnologia","keywords":"Computer science; The Internet; Drone; World Wide Web; Computer security; Multimedia","score_opus":0.15109333257087043,"score_gpt":0.24998826812509836,"score_spread":0.09889493555422793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011052769","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11143422,0.35467258,0.25441918,0.10967486,0.006434729,0.00010600801,0.0005731531,0.0006553397,0.16202995],"genre_scores_gemma":[0.7495974,0.14236039,0.07136959,0.0029673295,0.003625035,0.0001032472,0.00050233636,0.00010421786,0.029370414],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996859,0.00007494979,0.000008900987,0.00004587837,0.000108144486,0.00007626728],"domain_scores_gemma":[0.99906796,0.00042585345,0.00006926368,0.000056588815,0.00023638541,0.00014393411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080994767,0.00039762075,0.0005492234,0.00035857674,0.0004941845,0.0017608486,0.0007686078,0.0014251039,0.0057594464],"category_scores_gemma":[0.0009983968,0.00015874955,0.00023474582,0.0005175612,0.0008005793,0.0040776054,0.0011871029,0.001560855,0.0009771577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001765807,0.0002170135,0.0030175447,0.0010022771,0.000070954484,0.00034679717,0.00023205936,0.043363363,0.0058457423,0.3274949,0.083469495,0.5347633],"study_design_scores_gemma":[0.000029698575,0.0004238224,0.002118408,0.00056353933,0.000042782507,0.0006117771,0.002875017,0.3037498,0.0036465516,0.3917081,0.2941606,0.000069898466],"about_ca_topic_score_codex":0.0012595346,"about_ca_topic_score_gemma":0.0022318284,"teacher_disagreement_score":0.0057594464,"about_ca_system_score_codex":0.00044015414,"about_ca_system_score_gemma":0.0011074229,"threshold_uncertainty_score":0.019267261},"labels":[],"label_agreement":null},{"id":"W3011098329","doi":"10.1016/j.comcom.2020.03.019","title":"Energy-efficient task scheduling and physiological assessment in disaster management using UAV-assisted networks","year":2020,"lang":"en","type":"article","venue":"Computer Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":89,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; IBM (Canada); Thompson Rivers University","funders":"","keywords":"Computer science; Scheduling (production processes); Data collection; Energy consumption; Warning system; Emergency management; Internet of Things; Disaster area; Real-time computing; Efficient energy use; Computer security; Telecommunications","score_opus":0.04870571364179909,"score_gpt":0.2654795059730694,"score_spread":0.2167737923312703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011098329","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5545014,0.00078823266,0.44086555,0.00024693977,0.00010637955,0.00005041603,0.000083359504,0.00015000835,0.0032077634],"genre_scores_gemma":[0.99058026,0.00006212859,0.008934419,0.0000071445793,0.000008544584,0.000009662375,0.00001885758,0.0000044821704,0.00037453385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998611,0.000048929007,0.0000066642165,0.000026703836,0.00002729305,0.000029311177],"domain_scores_gemma":[0.99973077,0.00014639179,0.000039193234,0.000014805124,0.000048166585,0.00002062388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026561975,0.00032277973,0.00023672168,0.00027092127,0.00027754708,0.00031654918,0.00027132608,0.00022175677,0.00037918225],"category_scores_gemma":[0.0009879105,0.00011258451,0.00011099218,0.00025487226,0.00016267963,0.00037393355,0.00028870138,0.0001700069,0.000053167274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002720504,0.00007570585,0.0035006218,0.000039870105,0.000024006795,0.0000861974,0.000051330087,0.93274194,0.014444398,0.0015431414,0.00045563586,0.04676519],"study_design_scores_gemma":[0.0000030395274,0.000037870064,0.001028897,0.0000017532682,0.000004012115,0.000018165994,0.000028238353,0.9967146,0.0014610527,0.0005622609,0.00013757755,0.0000025713216],"about_ca_topic_score_codex":0.004222832,"about_ca_topic_score_gemma":0.0050758165,"teacher_disagreement_score":0.004222832,"about_ca_system_score_codex":0.0002738864,"about_ca_system_score_gemma":0.00039100475,"threshold_uncertainty_score":0.008396506},"labels":[],"label_agreement":null},{"id":"W3014730994","doi":"10.1016/j.comcom.2020.03.046","title":"Interference minimization algorithms for fifth generation and beyond systems","year":2020,"lang":"en","type":"article","venue":"Computer Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Interference (communication); Integer programming; Bandwidth (computing); Single antenna interference cancellation; Mathematical optimization; Integer (computer science); Linear programming; Algorithm; Distributed computing; Telecommunications; Mathematics; Channel (broadcasting)","score_opus":0.06356831120724414,"score_gpt":0.25186492635670016,"score_spread":0.188296615149456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014730994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008073783,0.00072732294,0.98162544,0.0002858694,0.000092366194,0.000022044513,0.000057582143,0.00015493936,0.008960618],"genre_scores_gemma":[0.37251654,0.001298592,0.60455173,0.00025421838,0.00021138426,0.00016070045,0.00037660418,0.0002470119,0.020383203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997335,0.000096770775,0.000010060413,0.00003574729,0.000078794816,0.000045179415],"domain_scores_gemma":[0.99955875,0.00023573142,0.00003548039,0.000047323723,0.000103232116,0.000019480978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006256645,0.0008639852,0.0007378384,0.0004590247,0.00040594162,0.00095749693,0.0008858817,0.00072887336,0.0041410825],"category_scores_gemma":[0.0016713764,0.00033133168,0.0006213641,0.00078715157,0.00044884434,0.0008829172,0.00087402953,0.001185193,0.0009159789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006804662,0.000041153035,0.00030757498,0.00009900592,0.000052096933,0.00003333164,0.00006678027,0.8320853,0.0016927954,0.04083956,0.005640147,0.11907422],"study_design_scores_gemma":[0.0000066918683,0.000018853847,0.00008508284,0.000009897489,0.0000055602645,0.000015828047,0.000014068952,0.98609215,0.0003995082,0.011702384,0.0016455262,0.00000440403],"about_ca_topic_score_codex":0.0044712108,"about_ca_topic_score_gemma":0.0054657664,"teacher_disagreement_score":0.0044712108,"about_ca_system_score_codex":0.0006793209,"about_ca_system_score_gemma":0.0010834412,"threshold_uncertainty_score":0.013853312},"labels":[],"label_agreement":null},{"id":"W3018317585","doi":"10.1016/j.comcom.2020.04.047","title":"A-CAFDSP: An Adaptive-Congestion Aware Fibonacci Sequence based Data Scheduling Policy","year":2020,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Computer network; Network packet; Distributed computing; Scheduling (production processes); Quality of service; Wireless; Telecommunications","score_opus":0.22962359075371797,"score_gpt":0.35342769149904146,"score_spread":0.1238041007453235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3018317585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038964186,0.00087781396,0.9414024,0.00063561863,0.0009879355,0.0004460352,0.0006632011,0.007373809,0.008648952],"genre_scores_gemma":[0.60619015,0.000377189,0.3860478,0.0006396714,0.00031373967,0.0003641871,0.0007491489,0.00034376228,0.0049744067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921787,0.00018799982,0.000062081424,0.00012289299,0.00026820519,0.0001408674],"domain_scores_gemma":[0.9975655,0.0008016469,0.00013820478,0.00051396585,0.0007010647,0.00027966392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015127792,0.0008198247,0.0008049752,0.0019561828,0.0015883937,0.0013050056,0.0024681403,0.000985958,0.0039109876],"category_scores_gemma":[0.004492923,0.0003489168,0.00038500348,0.0014139324,0.00066994847,0.0011177708,0.0011696679,0.0014106266,0.0010054695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029510637,0.00073252636,0.002764693,0.00044498473,0.0001377141,0.0003902653,0.00025857965,0.17399326,0.06936043,0.084976636,0.05915009,0.60483974],"study_design_scores_gemma":[0.0001684033,0.00031080365,0.0004928184,0.000023947412,0.000033424614,0.00025520872,0.00004432351,0.94705385,0.015405307,0.020563077,0.015592364,0.00005647597],"about_ca_topic_score_codex":0.005324121,"about_ca_topic_score_gemma":0.0076891975,"teacher_disagreement_score":0.005324121,"about_ca_system_score_codex":0.0017573026,"about_ca_system_score_gemma":0.0033424273,"threshold_uncertainty_score":0.013083577},"labels":[],"label_agreement":null},{"id":"W3023685007","doi":"10.1016/j.comcom.2020.04.060","title":"Rapid sensing-based emergency detection: A sequential approach","year":2020,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Change detection; Constraint (computer-aided design); False alarm; ALARM; Variable (mathematics); Real-time computing; Construct (python library); Emergency management; Internet of Things; Realization (probability); Computer security; Data mining; Artificial intelligence; Computer network","score_opus":0.0686290140463837,"score_gpt":0.25918859507746933,"score_spread":0.1905595810310856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023685007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022527931,0.0005101197,0.97168994,0.00041459888,0.0002171014,0.00025209962,0.00017597376,0.0005609608,0.0036513836],"genre_scores_gemma":[0.6387797,0.0009086654,0.3491678,0.00029853208,0.0005718826,0.00038878518,0.0005358545,0.00019499271,0.0091537265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983656,0.00025257934,0.00009941089,0.00053158274,0.00053250184,0.00021838686],"domain_scores_gemma":[0.9970688,0.0014163279,0.0002455856,0.0002870141,0.0007587219,0.00022359673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015353594,0.0018885613,0.002599606,0.00222201,0.0010688346,0.001669421,0.0024240504,0.0014486884,0.0033490227],"category_scores_gemma":[0.004259252,0.0013450832,0.001143278,0.0017832172,0.001054498,0.0021015,0.0029265773,0.0013936701,0.00092236995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014319184,0.0009777317,0.008796174,0.000908486,0.0004204542,0.0009921518,0.00054316246,0.38318434,0.060150012,0.028479801,0.008168122,0.50594753],"study_design_scores_gemma":[0.000035632696,0.00022537811,0.001296321,0.000020272408,0.00007532443,0.0002439702,0.00009010461,0.9786326,0.003943364,0.0131805865,0.0022168122,0.000039545677],"about_ca_topic_score_codex":0.0062326705,"about_ca_topic_score_gemma":0.008316612,"teacher_disagreement_score":0.0062326705,"about_ca_system_score_codex":0.0005666318,"about_ca_system_score_gemma":0.002313335,"threshold_uncertainty_score":0.012392819},"labels":[],"label_agreement":null},{"id":"W3025580486","doi":"10.1016/j.comcom.2020.05.012","title":"Recruitment algorithms for vehicular sensor networks","year":2020,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Crowdsensing; Heuristic; Integer programming; Mathematical optimization; Operations research; Real-time computing; Algorithm; Artificial intelligence; Mathematics; Computer security","score_opus":0.15599245388176877,"score_gpt":0.31685155597702735,"score_spread":0.16085910209525858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3025580486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059990697,0.00093542086,0.98822623,0.0009315629,0.0001950011,0.00015553072,0.000076477074,0.0002717714,0.0032089811],"genre_scores_gemma":[0.586596,0.0028276846,0.3666279,0.0012815554,0.0008856066,0.0015410172,0.0006468478,0.00037293116,0.039220404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997603,0.0012366546,0.00009829328,0.00039245127,0.0004162462,0.00025332227],"domain_scores_gemma":[0.99224937,0.0055256016,0.0004740121,0.00042437724,0.0009248074,0.0004019008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048048887,0.0012270947,0.0023954555,0.0015044865,0.0017574121,0.0016690316,0.0047103725,0.002637321,0.004601421],"category_scores_gemma":[0.017884316,0.000943466,0.0010445033,0.0022396573,0.0018341455,0.0028609107,0.003655577,0.0024291973,0.0012891263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020713835,0.00013961707,0.0010867681,0.00026839026,0.00007515202,0.00008228967,0.00029591934,0.68539757,0.001525934,0.15953067,0.013815972,0.13757458],"study_design_scores_gemma":[0.00002294661,0.00003574442,0.00011657485,0.00002312411,0.000009130316,0.000026962756,0.00003783087,0.924805,0.00026125886,0.07203298,0.002617706,0.0000107626975],"about_ca_topic_score_codex":0.00428243,"about_ca_topic_score_gemma":0.0041361065,"teacher_disagreement_score":0.0048048887,"about_ca_system_score_codex":0.0021176573,"about_ca_system_score_gemma":0.0025656412,"threshold_uncertainty_score":0.02541101},"labels":[],"label_agreement":null},{"id":"W3025641346","doi":"10.1016/j.comcom.2020.05.020","title":"Green communication in IoT networks using a hybrid optimization algorithm","year":2020,"lang":"en","type":"article","venue":"Computer Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":132,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Computer science; Energy consumption; Internet of Things; Optimization problem; Wireless sensor network; Residual; Energy (signal processing); Distributed computing; Mathematical optimization; Computer network; Algorithm; Embedded system","score_opus":0.03996381031355054,"score_gpt":0.253364150651817,"score_spread":0.21340034033826646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3025641346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024271728,0.0003427339,0.9675243,0.00025991173,0.00008960671,0.000041371753,0.000030004872,0.00013508768,0.007305307],"genre_scores_gemma":[0.76670665,0.00038909694,0.22433357,0.00021732559,0.000096239295,0.00020781581,0.00009564182,0.00010281215,0.007850804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976975,0.0000900509,0.0000067948804,0.00003253102,0.00006468758,0.00003621053],"domain_scores_gemma":[0.9996245,0.000247273,0.000029081792,0.000018790195,0.00005718858,0.00002309777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068078854,0.00058931496,0.0008540412,0.0005192373,0.00048296596,0.00092534866,0.0008219406,0.0009653686,0.0020815579],"category_scores_gemma":[0.000839394,0.0002929399,0.00062544324,0.0008095102,0.000576783,0.0008163848,0.0008819381,0.0006365563,0.00018716569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027743796,0.000021240425,0.00011425968,0.0000127643425,0.000018460461,0.000014078992,0.000008529939,0.9844825,0.00035490305,0.005660525,0.00042601142,0.008858977],"study_design_scores_gemma":[0.000002358524,0.000006228727,0.000016633763,0.0000010756114,0.0000018704205,0.000002353659,0.000001997654,0.99871826,0.00004003852,0.0011326055,0.00007565736,9.746053e-7],"about_ca_topic_score_codex":0.002594759,"about_ca_topic_score_gemma":0.0026051311,"teacher_disagreement_score":0.002594759,"about_ca_system_score_codex":0.00066911,"about_ca_system_score_gemma":0.0006953663,"threshold_uncertainty_score":0.006963432},"labels":[],"label_agreement":null},{"id":"W3028052800","doi":"10.1016/j.comcom.2020.05.027","title":"An adaptive and Distributed Traffic Management System using Vehicular Ad-hoc Networks","year":2020,"lang":"en","type":"article","venue":"Computer Communications","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Computer science; Vehicle Information and Communication System; Traffic congestion reconstruction with Kerner's three-phase theory; Traffic congestion; Floating car data; Traffic flow (computer networking); Wireless ad hoc network; Vehicular ad hoc network; Traffic optimization; Network traffic control; Computer network; Traffic bottleneck; Road traffic; Transport engineering; Telecommunications","score_opus":0.025510114248670564,"score_gpt":0.22306132864808859,"score_spread":0.19755121439941803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028052800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16102445,0.00037519608,0.81565046,0.0003004471,0.0007315034,0.00047165784,0.00016751769,0.011006593,0.01027217],"genre_scores_gemma":[0.9257961,0.00013515919,0.066603586,0.0001293461,0.00012242203,0.00016680593,0.0002652203,0.00007564215,0.006705759],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996081,0.00005768505,0.000032032618,0.00011931233,0.00012955208,0.00005339357],"domain_scores_gemma":[0.99940133,0.00008821366,0.000041911935,0.00009599018,0.0002670275,0.00010558397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005319744,0.0005877365,0.00078455644,0.0008805857,0.00083081494,0.0010422609,0.0014198432,0.0005086072,0.0015309156],"category_scores_gemma":[0.00072506897,0.00022220671,0.00023966425,0.0005384199,0.00026831368,0.0007259024,0.0009460485,0.0004090493,0.0005899714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013298208,0.0012580433,0.007800548,0.00017794434,0.00025596484,0.00092142995,0.00038836198,0.20694575,0.18247567,0.010682365,0.012500493,0.5752637],"study_design_scores_gemma":[0.00012242966,0.0006610322,0.0018642409,0.000010090107,0.00010698105,0.00032193627,0.0000910148,0.96768236,0.016702073,0.0024477176,0.009937195,0.000052854215],"about_ca_topic_score_codex":0.0027003349,"about_ca_topic_score_gemma":0.0026608862,"teacher_disagreement_score":0.0027003349,"about_ca_system_score_codex":0.00047358542,"about_ca_system_score_gemma":0.0008296557,"threshold_uncertainty_score":0.005369246},"labels":[],"label_agreement":null},{"id":"W30357374","doi":"10.1016/j.comcom.2004.08.013","title":"On current areas of interests in end-to-end QoS","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Western University","funders":"","keywords":"Computer science; End-to-end principle; Current (fluid); Quality of service; End user; Computer network; Telecommunications; Electrical engineering; Operating system","score_opus":0.049034617099700806,"score_gpt":0.3166693736427132,"score_spread":0.2676347565430124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W30357374","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04733091,0.40230927,0.067249164,0.17928304,0.016328713,0.00031546454,0.0022581052,0.0006819538,0.28424338],"genre_scores_gemma":[0.42389804,0.4102296,0.035864636,0.023717593,0.027206238,0.00028591524,0.0053170514,0.00021593328,0.07326495],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844295,0.00035968714,0.00018825034,0.00015276791,0.000641922,0.00021440878],"domain_scores_gemma":[0.98215884,0.008173887,0.0008472629,0.00038728127,0.0069765905,0.0014561277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005178433,0.0005114704,0.00064933795,0.0023107335,0.00092866394,0.0036284558,0.000930966,0.0024096945,0.019712659],"category_scores_gemma":[0.00846612,0.00022618688,0.00032327586,0.004265287,0.0007834152,0.0044558384,0.0006321754,0.0014817091,0.004476809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096129894,0.0004634212,0.010647151,0.001961448,0.00008209876,0.00036032588,0.0002930369,0.003153451,0.005980282,0.039686855,0.11463797,0.8217727],"study_design_scores_gemma":[0.00021488623,0.0007225028,0.018620977,0.0043812925,0.00043431358,0.0017130076,0.0031871952,0.027511388,0.010684323,0.089880064,0.8425137,0.0001364006],"about_ca_topic_score_codex":0.0014509036,"about_ca_topic_score_gemma":0.0028417907,"teacher_disagreement_score":0.019712659,"about_ca_system_score_codex":0.000979291,"about_ca_system_score_gemma":0.001909926,"threshold_uncertainty_score":0.06594539},"labels":[],"label_agreement":null},{"id":"W3040391838","doi":"10.1016/j.comcom.2020.06.031","title":"Adaptive delay-constrained resource allocation in mobile edge computing for Internet of Things communications networks","year":2020,"lang":"en","type":"article","venue":"Computer Communications","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Mobile edge computing; Computation offloading; Node (physics); Energy consumption; Computer network; Wireless network; Transmission delay; Wireless; Resource allocation; Transmission (telecommunications); Efficient energy use; Enhanced Data Rates for GSM Evolution; Distributed computing; Edge computing; Network packet; Server; Telecommunications","score_opus":0.05568300887092133,"score_gpt":0.2806257457352613,"score_spread":0.22494273686433996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040391838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061393816,0.0015625947,0.9317258,0.00038766055,0.0003170676,0.000054524204,0.000044806948,0.00015275978,0.0043609818],"genre_scores_gemma":[0.96013826,0.00040187486,0.037218183,0.00011506877,0.00008152239,0.00002554908,0.000025325027,0.00002413781,0.0019700632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968064,0.00007776911,0.000014763297,0.00007705007,0.0000694306,0.00008028048],"domain_scores_gemma":[0.9995377,0.0002675146,0.000034104985,0.000028247912,0.000100028796,0.00003252034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058232807,0.00037510032,0.00059184514,0.0002366585,0.0004945891,0.00077924615,0.00087758614,0.00045838804,0.0010957536],"category_scores_gemma":[0.0015411658,0.00017785076,0.00020213697,0.00050298905,0.0003837883,0.0008345688,0.00055759755,0.00066603295,0.00012670815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003847395,0.00017786704,0.00087869674,0.00013275677,0.00006247592,0.000195345,0.00013130237,0.8372587,0.015828887,0.038655102,0.0042575942,0.10203658],"study_design_scores_gemma":[0.0000035240444,0.00002404901,0.00008147617,0.0000029625267,0.000005403012,0.000024253513,0.000015352927,0.99476224,0.00063711876,0.0040513123,0.00038841186,0.000003965887],"about_ca_topic_score_codex":0.002887621,"about_ca_topic_score_gemma":0.003811462,"teacher_disagreement_score":0.002887621,"about_ca_system_score_codex":0.0006758683,"about_ca_system_score_gemma":0.00074418675,"threshold_uncertainty_score":0.005741596},"labels":[],"label_agreement":null},{"id":"W3046426047","doi":"10.1016/j.comcom.2020.07.041","title":"Evolutionary game theoretical model for stable femtocells’ clusters formation in HetNets","year":2020,"lang":"en","type":"article","venue":"Computer Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Femtocell; Computer science; Heterogeneous network; Distributed computing; Resource allocation; Evolutionary game theory; Cluster analysis; Cellular network; Particle swarm optimization; Scalability; Throughput; Stability (learning theory); Mathematical optimization; Computer network; Game theory; Wireless network; Wireless; Artificial intelligence; Base station; Algorithm; Mathematics","score_opus":0.03710611881029376,"score_gpt":0.24796688270181869,"score_spread":0.21086076389152492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046426047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0689754,0.00045637868,0.8832839,0.0013115613,0.00016117493,0.000109027824,0.00029295913,0.00008437254,0.045325324],"genre_scores_gemma":[0.9471698,0.00040077296,0.02686031,0.00021243563,0.000057435373,0.00017760615,0.00012132567,0.000031549098,0.024968779],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996039,0.00015191635,0.000007672283,0.00006774948,0.000073377574,0.000095430616],"domain_scores_gemma":[0.9995958,0.00021299197,0.000043934186,0.00001765443,0.00008042508,0.00004918298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006047696,0.00063017616,0.0010605529,0.00049883866,0.0007988392,0.001477637,0.001998556,0.0019919134,0.0063368795],"category_scores_gemma":[0.0015724562,0.00041828697,0.000603956,0.0007876351,0.0011576473,0.0011166895,0.0012287883,0.0010782506,0.0004996417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029828981,0.000018950224,0.00024560007,0.00002780579,0.00001832081,0.00014282455,0.00006987496,0.8904697,0.0007882651,0.10446119,0.0010950456,0.002632696],"study_design_scores_gemma":[0.0000074989057,0.000011320039,0.000066191715,0.0000031044758,0.0000042297115,0.000021182044,0.000022735572,0.98728716,0.000053937463,0.012158311,0.00035980128,0.000004477002],"about_ca_topic_score_codex":0.0104714865,"about_ca_topic_score_gemma":0.0064545423,"teacher_disagreement_score":0.0104714865,"about_ca_system_score_codex":0.0015553996,"about_ca_system_score_gemma":0.0010279509,"threshold_uncertainty_score":0.021198928},"labels":[],"label_agreement":null},{"id":"W3083552023","doi":"10.1016/j.comcom.2020.08.021","title":"FogAuthChain: A secure location-based authentication scheme in fog computing environments using Blockchain","year":2020,"lang":"en","type":"article","venue":"Computer Communications","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Cloud computing; Authentication (law); Password; Edge computing; Blockchain; Computer security; Computer network; Distributed computing; Operating system","score_opus":0.0664170955472606,"score_gpt":0.28156251719554615,"score_spread":0.21514542164828554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083552023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055959783,0.00037438376,0.92760795,0.00046204726,0.00025880613,0.0005065446,0.00045800145,0.0035654276,0.010807072],"genre_scores_gemma":[0.89200723,0.00035703293,0.0933444,0.00013620486,0.000058733924,0.0002376604,0.0005385828,0.00015147727,0.013168661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896014,0.00023996162,0.00006543871,0.0001360682,0.00037222775,0.00022602713],"domain_scores_gemma":[0.9987012,0.00026269845,0.0000950531,0.00048116714,0.00029407366,0.0001658614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010885062,0.00038079152,0.0006972619,0.00052055746,0.001588613,0.0015367204,0.0013502538,0.0010223492,0.005363599],"category_scores_gemma":[0.002113698,0.00028467886,0.00031180796,0.001043705,0.0010996206,0.0028608742,0.0027661645,0.0011837977,0.0017109058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029035253,0.00051416666,0.0032816925,0.0004945096,0.00015283098,0.0014456575,0.00095042674,0.22130473,0.045090858,0.3457067,0.03356451,0.34459043],"study_design_scores_gemma":[0.00021704433,0.00023940224,0.0005525301,0.00005724552,0.000048537517,0.00031402605,0.00011561178,0.8334484,0.022522906,0.10659042,0.03580008,0.000093866314],"about_ca_topic_score_codex":0.0067700464,"about_ca_topic_score_gemma":0.006993049,"teacher_disagreement_score":0.0067700464,"about_ca_system_score_codex":0.00090337836,"about_ca_system_score_gemma":0.0029003199,"threshold_uncertainty_score":0.017943084},"labels":[],"label_agreement":null},{"id":"W3129299461","doi":"10.1016/j.comcom.2021.06.029","title":"A survey on 360-degree video: Coding, quality of experience and streaming","year":2021,"lang":"en","type":"preprint","venue":"Computer Communications","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ontario Ministry of Food and Agriculture; Horizon 2020; Ministerio de Economía y Competitividad; Horizon 2020 Framework Programme; FP7 Coherent Development of Research Policies","keywords":"Computer science; Quality of experience; Video streaming; Coding (social sciences); Multimedia; Virtual reality; Human–computer interaction; Telecommunications; Quality of service; Real-time computing","score_opus":0.30238556788387494,"score_gpt":0.42969933301471475,"score_spread":0.1273137651308398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129299461","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04144845,0.8756171,0.04691124,0.0034408136,0.0008728306,0.00007828907,0.0013612361,0.00024340859,0.030026594],"genre_scores_gemma":[0.109763026,0.86277026,0.013600834,0.0010590829,0.001561769,0.00007570368,0.0023451683,0.00014177206,0.008682364],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981035,0.000368328,0.00023619753,0.00031457536,0.00084858807,0.0001288379],"domain_scores_gemma":[0.9834373,0.011623449,0.0010100967,0.00043258897,0.0031391094,0.0003574689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023380427,0.0005997336,0.00092153065,0.005628381,0.00031166148,0.0018218281,0.0008466033,0.0009010694,0.006344718],"category_scores_gemma":[0.011684103,0.0003115376,0.0004841568,0.011007258,0.0005537434,0.003752291,0.0007000603,0.0007169064,0.0012237809],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009990598,0.00010537192,0.009057218,0.0022456467,0.00003698168,0.00004343981,0.00014273525,0.0012987662,0.00092965696,0.0051909145,0.012368332,0.96848106],"study_design_scores_gemma":[0.000025258463,0.0012570012,0.085318975,0.0066543925,0.00031838196,0.0032455316,0.0024032549,0.014054069,0.00893639,0.018888498,0.8587228,0.00017535558],"about_ca_topic_score_codex":0.002480859,"about_ca_topic_score_gemma":0.0018964587,"teacher_disagreement_score":0.006344718,"about_ca_system_score_codex":0.000737112,"about_ca_system_score_gemma":0.001086203,"threshold_uncertainty_score":0.021225154},"labels":[],"label_agreement":null},{"id":"W3133982035","doi":"10.1016/j.comcom.2021.03.003","title":"Enhanced network sensitive access control scheme for LTE–LAA/WiFi coexistence: Modeling and performance analysis","year":2021,"lang":"en","type":"article","venue":"Computer Communications","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Computer network; Spectrum management; Throughput; Transmission (telecommunications); Channel (broadcasting); Cellular network; Handover; LTE Advanced; Telecommunications link; Wireless; Telecommunications; Cognitive radio","score_opus":0.05734151054189395,"score_gpt":0.32512393825160535,"score_spread":0.2677824277097114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133982035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2566648,0.0018983145,0.7235795,0.00059303973,0.00019067668,0.00014775328,0.00018704271,0.0006118348,0.01612702],"genre_scores_gemma":[0.9913796,0.00021964131,0.0061730547,0.000035136105,0.00002788825,0.000024629257,0.000022805401,0.0000109880675,0.0021062363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991775,0.00020718465,0.000021440155,0.00010858262,0.000298388,0.00018693402],"domain_scores_gemma":[0.9988739,0.000487394,0.00014042544,0.000079276906,0.0003832673,0.00003568523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010009034,0.0007276201,0.00082281197,0.000589862,0.0006784216,0.0009009216,0.0011623328,0.00093975,0.0019119185],"category_scores_gemma":[0.00182591,0.00029647505,0.0005955668,0.0006144884,0.000625344,0.0011959267,0.0006773498,0.00086542586,0.00028983597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002351736,0.00015441532,0.0013137838,0.000089695495,0.0000765962,0.00023579481,0.00015751753,0.9350477,0.01835621,0.02316795,0.0009836254,0.020181613],"study_design_scores_gemma":[0.000003154765,0.000030242494,0.00012729081,0.0000021831527,0.000012696643,0.000030037438,0.000005767111,0.99876285,0.00042776472,0.00048510134,0.00010888425,0.0000040454975],"about_ca_topic_score_codex":0.008872634,"about_ca_topic_score_gemma":0.007371856,"teacher_disagreement_score":0.008872634,"about_ca_system_score_codex":0.0014607037,"about_ca_system_score_gemma":0.0008753722,"threshold_uncertainty_score":0.017641962},"labels":[],"label_agreement":null},{"id":"W3154267440","doi":"10.1016/j.comcom.2021.04.001","title":"Linking handover delay to load balancing in SDN-based heterogeneous networks","year":2021,"lang":"en","type":"article","venue":"Computer Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Handover; Computer network; Load balancing (electrical power); Software-defined networking; Distributed computing; Context (archaeology); Overhead (engineering)","score_opus":0.023380134380763005,"score_gpt":0.2566816248828488,"score_spread":0.2333014905020858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3154267440","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7467449,0.0020471425,0.246343,0.0006115209,0.00017426582,0.00012698269,0.00008239589,0.0004826368,0.0033871848],"genre_scores_gemma":[0.99336046,0.00011183038,0.006267683,0.000021824744,0.000020956311,0.00000986137,0.000021451926,0.0000145285885,0.00017136999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984964,0.0004454087,0.00009777353,0.00026441563,0.00042472224,0.00027135573],"domain_scores_gemma":[0.99157035,0.005563369,0.0012029593,0.0005145597,0.0007618541,0.0003869428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00324326,0.0008383971,0.000533331,0.00137188,0.00074196357,0.0013572172,0.0010599429,0.00065852195,0.0005549499],"category_scores_gemma":[0.0100903055,0.00023701481,0.00017757388,0.0008936249,0.00064849993,0.0020445075,0.0010604408,0.0006908729,0.0000767364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014070957,0.0005952598,0.021812169,0.00019765482,0.00014809283,0.00032919497,0.00031197187,0.76900816,0.04029346,0.012238616,0.0010802533,0.15257812],"study_design_scores_gemma":[0.000023041961,0.00019605194,0.0030611318,0.00000824968,0.00004398581,0.000057525984,0.000120549346,0.9821347,0.010298087,0.0035705604,0.00046552764,0.000020600877],"about_ca_topic_score_codex":0.0034019288,"about_ca_topic_score_gemma":0.0025801603,"teacher_disagreement_score":0.0034019288,"about_ca_system_score_codex":0.0023501676,"about_ca_system_score_gemma":0.0009346317,"threshold_uncertainty_score":0.01715219},"labels":[],"label_agreement":null},{"id":"W3170235714","doi":"10.1016/j.comcom.2021.06.007","title":"Performance analysis of short-packet communications with incremental relaying","year":2021,"lang":"en","type":"article","venue":"Computer Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Network packet; Block Error Rate; Transmission delay; Transmission (telecommunications); Overhead (engineering); Decoding methods; Bit error rate; Computer network; Error detection and correction; Latency (audio); Low latency (capital markets); Communications system; Reliability (semiconductor); Channel (broadcasting); Real-time computing; Algorithm; Telecommunications; Telecommunications link","score_opus":0.08210720691182105,"score_gpt":0.3100196420611545,"score_spread":0.22791243514933346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3170235714","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5048335,0.005011489,0.44964388,0.0017236264,0.00018708226,0.0002237963,0.0006298072,0.000822317,0.036924493],"genre_scores_gemma":[0.9884461,0.0006156056,0.0084003685,0.00006514713,0.00008631481,0.00004151846,0.00011344028,0.000050658306,0.0021806762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778724,0.0008462232,0.000052097614,0.00018532298,0.0005670018,0.0005620758],"domain_scores_gemma":[0.9806997,0.015734768,0.00070023705,0.000602513,0.0020205828,0.00024218207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002970404,0.0014171622,0.0010267089,0.001350259,0.0008939318,0.0018731803,0.0013802798,0.0009857715,0.0041658445],"category_scores_gemma":[0.011797617,0.0003988371,0.0004630578,0.0016089313,0.0013875656,0.0014616109,0.0013484418,0.000839936,0.0004892486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086422986,0.00009054249,0.0012686726,0.00019152349,0.00007606488,0.00023154527,0.00020433332,0.9182689,0.0105151255,0.04541635,0.0015019046,0.021370735],"study_design_scores_gemma":[0.000013463923,0.0001602024,0.00037267766,0.000011468584,0.000035071615,0.00008976459,0.000044285276,0.99276817,0.0017313181,0.0045065978,0.0002513657,0.000015574382],"about_ca_topic_score_codex":0.006958657,"about_ca_topic_score_gemma":0.005557467,"teacher_disagreement_score":0.006958657,"about_ca_system_score_codex":0.0030476262,"about_ca_system_score_gemma":0.0022683297,"threshold_uncertainty_score":0.02211219},"labels":[],"label_agreement":null},{"id":"W3181445415","doi":"10.1016/j.comcom.2021.06.009","title":"A novel visibility semantic feature-aided pedestrian detection scheme for autonomous vehicles","year":2021,"lang":"en","type":"article","venue":"Computer Communications","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Visibility; Pedestrian; Pedestrian detection; Detector; Scheme (mathematics); Artificial intelligence; Feature (linguistics); Object detection; Intelligent transportation system; Computer vision; Real-time computing; Machine learning; Pattern recognition (psychology); Telecommunications; Transport engineering","score_opus":0.05320120745418959,"score_gpt":0.3082202435480576,"score_spread":0.255019036093868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181445415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06406642,0.00055548653,0.9302814,0.00011844407,0.00019602555,0.00010179287,0.00029660435,0.0018148939,0.0025689013],"genre_scores_gemma":[0.633576,0.00046766232,0.3580341,0.00016855894,0.00013329036,0.00010209372,0.0010761543,0.000108881424,0.0063332333],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996113,0.000033303673,0.000016723316,0.00011541455,0.00014474709,0.00007849674],"domain_scores_gemma":[0.9997235,0.000033682132,0.000025402964,0.000057591504,0.00013112085,0.00002877954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002957712,0.00083426904,0.0011150568,0.001331152,0.0005308904,0.0006668526,0.0012486094,0.0006677242,0.0018976154],"category_scores_gemma":[0.0007218218,0.00040733928,0.00065330515,0.0010734152,0.00027823463,0.0010927604,0.0014421537,0.00067486643,0.0009864127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008421829,0.00024243511,0.0025129656,0.00015788768,0.00012085435,0.00021334513,0.00009124045,0.024942938,0.119924754,0.004433512,0.006530603,0.8399872],"study_design_scores_gemma":[0.00004353633,0.00030436576,0.0032528783,0.000014654224,0.00011049722,0.0004613932,0.000053543452,0.93808204,0.04793855,0.0039437963,0.0057421834,0.000052636675],"about_ca_topic_score_codex":0.0036502124,"about_ca_topic_score_gemma":0.006283503,"teacher_disagreement_score":0.0036502124,"about_ca_system_score_codex":0.00035129656,"about_ca_system_score_gemma":0.001043047,"threshold_uncertainty_score":0.0072579384},"labels":[],"label_agreement":null},{"id":"W3204789245","doi":"10.1016/j.comcom.2021.09.019","title":"Demystifying frame aggregation in 802.11 networks: Understanding and approximating optimality","year":2021,"lang":"en","type":"article","venue":"Computer Communications","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation; Ontario Research Foundation; Google","keywords":"Computer science; Frame (networking); Mathematical optimization; Computer network; Mathematics","score_opus":0.10142040555912418,"score_gpt":0.3063510481402194,"score_spread":0.20493064258109522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204789245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028608048,0.00061441044,0.9663182,0.00048001844,0.000058068803,0.000023917795,0.000053365457,0.000114116854,0.0037299069],"genre_scores_gemma":[0.7272997,0.0013991038,0.26729155,0.00018844125,0.0002489411,0.0000771848,0.00017036316,0.00015112381,0.0031736223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984674,0.00067944935,0.00006632976,0.0001631677,0.00042145824,0.00020221091],"domain_scores_gemma":[0.99379164,0.004360346,0.0003876325,0.000661707,0.0006743309,0.00012434946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037715826,0.00082251884,0.0010539874,0.0010369794,0.00072088477,0.0016620884,0.0012072709,0.0010756867,0.0012349555],"category_scores_gemma":[0.015420337,0.00049996184,0.00044288396,0.0011970282,0.001714711,0.0034108153,0.001844978,0.0020995731,0.00018819213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012720333,0.00004301819,0.0010389545,0.00007356461,0.000021802636,0.00008044762,0.00027022226,0.6311849,0.0022295357,0.3133853,0.0021630493,0.04938206],"study_design_scores_gemma":[0.0000045325096,0.000019525742,0.00012082644,0.000009402055,0.0000050476883,0.000016191683,0.000021656291,0.9149853,0.0004003481,0.08378479,0.0006276405,0.000004733894],"about_ca_topic_score_codex":0.008695139,"about_ca_topic_score_gemma":0.007424844,"teacher_disagreement_score":0.008695139,"about_ca_system_score_codex":0.0023898329,"about_ca_system_score_gemma":0.0016892642,"threshold_uncertainty_score":0.019946277},"labels":[],"label_agreement":null},{"id":"W4200039109","doi":"10.1016/j.comcom.2021.12.020","title":"Survival backup strategy for controller placement problem in Software Defined Networking","year":2021,"lang":"en","type":"article","venue":"Computer Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Backup; Software-defined networking; Software; Computer network; Controller (irrigation); Distributed computing; Embedded system; Operating system","score_opus":0.07059500984703322,"score_gpt":0.294296578421895,"score_spread":0.2237015685748618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200039109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07183644,0.00082746573,0.91843027,0.0008899676,0.00030206348,0.00013494372,0.00011323243,0.0002995451,0.0071660345],"genre_scores_gemma":[0.9327736,0.00038419175,0.06225973,0.0001292332,0.000095943564,0.000079463585,0.00013501171,0.00003568115,0.0041070534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997354,0.0000775855,0.000011403727,0.000057360434,0.000048228176,0.000069882146],"domain_scores_gemma":[0.99963284,0.00017597165,0.00003127984,0.000026999644,0.00008406246,0.00004892605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005025568,0.00084181054,0.0010482426,0.0004647096,0.0007289141,0.00074465567,0.0011211791,0.0011052765,0.0036497046],"category_scores_gemma":[0.0012054696,0.00026002797,0.00036772486,0.0005489196,0.00042925408,0.00087567087,0.0007829861,0.0007683618,0.00022372333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000559466,0.00018655957,0.00088057155,0.0004553448,0.00008358336,0.00044899556,0.00017666843,0.7990214,0.010345873,0.03956297,0.0137239685,0.1345546],"study_design_scores_gemma":[0.000027881544,0.00011039644,0.00012193066,0.000014949256,0.000015232885,0.00008221339,0.00006256737,0.98833406,0.00095348875,0.009622954,0.00064871187,0.0000055731507],"about_ca_topic_score_codex":0.0018893194,"about_ca_topic_score_gemma":0.0013181544,"teacher_disagreement_score":0.0036497046,"about_ca_system_score_codex":0.0005266701,"about_ca_system_score_gemma":0.00069574313,"threshold_uncertainty_score":0.012209475},"labels":[],"label_agreement":null},{"id":"W4210754841","doi":"10.1016/j.comcom.2022.01.013","title":"Weighted triplet loss based on deep neural networks for loop closure detection in VSLAM","year":2022,"lang":"en","type":"article","venue":"Computer Communications","topic":"Robotics and Sensor-Based Localization","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Odometer; Artificial intelligence; Metric (unit); Simultaneous localization and mapping; Artificial neural network; Extrapolation; Deep learning; Global Positioning System; Closure (psychology); Boundary (topology); Computer vision; Robot; Mobile robot; Mathematics","score_opus":0.016473433839947982,"score_gpt":0.22481842500370217,"score_spread":0.20834499116375418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210754841","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030594628,0.00058540836,0.96306056,0.00021296955,0.00013573727,0.000048347913,0.00030750525,0.0033534286,0.0017014346],"genre_scores_gemma":[0.7046576,0.00055112666,0.28225878,0.00040657964,0.00014380386,0.00015320927,0.002199423,0.0004768117,0.009152624],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961686,0.000060027098,0.000020220801,0.000110447276,0.00011669106,0.00007573243],"domain_scores_gemma":[0.999496,0.000154292,0.00004895697,0.00007780147,0.00018374916,0.000039181225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070645777,0.0009296971,0.001064384,0.000606273,0.00040136487,0.0007419106,0.0012854774,0.001076671,0.004060404],"category_scores_gemma":[0.0017160159,0.0003546341,0.00050231855,0.00075583084,0.00039149594,0.001534294,0.0013054829,0.0017747638,0.0011481915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042610918,0.0002019086,0.0011431103,0.000119686556,0.000068685855,0.00011582445,0.00006490425,0.21507554,0.024491841,0.0048221387,0.012122983,0.7413473],"study_design_scores_gemma":[0.0000034688517,0.00003115682,0.00014427926,0.000005617469,0.000005923167,0.000016714652,0.0000070713027,0.99536914,0.002716524,0.0012514435,0.00044495237,0.000003807449],"about_ca_topic_score_codex":0.006483074,"about_ca_topic_score_gemma":0.009365277,"teacher_disagreement_score":0.006483074,"about_ca_system_score_codex":0.00056461577,"about_ca_system_score_gemma":0.0011490762,"threshold_uncertainty_score":0.013583422},"labels":[],"label_agreement":null},{"id":"W4212772567","doi":"10.1016/j.comcom.2022.02.010","title":"A sustainable deep learning framework for fault detection in 6G Industry 4.0 heterogeneous data environments","year":2022,"lang":"en","type":"article","venue":"Computer Communications","topic":"Digital Transformation in Industry","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Computer science; Convolutional neural network; Deep learning; Machine learning; Artificial intelligence; Fault detection and isolation; Graph; Fault (geology); Key (lock); Theoretical computer science; Computer security","score_opus":0.04038966922434823,"score_gpt":0.26929149092944216,"score_spread":0.22890182170509393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212772567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016502364,0.00044694095,0.97912496,0.0003560418,0.000037254296,0.000034226952,0.00021449779,0.0018296611,0.001454026],"genre_scores_gemma":[0.73570156,0.0004435409,0.25729147,0.0004071857,0.000056255936,0.00012861611,0.001109807,0.00013021698,0.0047314544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965394,0.00006361643,0.000016839613,0.00007931318,0.000108869,0.000077471384],"domain_scores_gemma":[0.999673,0.00009454662,0.000036977985,0.00003698116,0.00012838181,0.000030136547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007651643,0.00081446284,0.00057142216,0.0007831656,0.0003057935,0.00076656445,0.0014196889,0.0009772964,0.0015505591],"category_scores_gemma":[0.0013802962,0.00029570327,0.0004799979,0.0005211175,0.00048124054,0.0013567674,0.0013494304,0.0011251314,0.00035495945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000953139,0.00008779623,0.0019964767,0.00007003305,0.000052459527,0.000120614306,0.00004402424,0.802884,0.0028971115,0.013942911,0.004603415,0.17320594],"study_design_scores_gemma":[0.000002078936,0.000009026533,0.000076792225,0.0000028018553,0.0000031674783,0.0000071551153,0.000004651742,0.99563414,0.00052030676,0.0033388417,0.00039882027,0.0000022548113],"about_ca_topic_score_codex":0.01649273,"about_ca_topic_score_gemma":0.019003,"teacher_disagreement_score":0.01649273,"about_ca_system_score_codex":0.0015893808,"about_ca_system_score_gemma":0.0017427705,"threshold_uncertainty_score":0.032793462},"labels":[],"label_agreement":null},{"id":"W4253699250","doi":"10.1016/s0140-3664(06)00460-9","title":"Call for Papers:Special Issue Labrador","year":2006,"lang":"en","type":"paratext","venue":"Computer Communications","topic":"Indigenous Studies and Ecology","field":"Health Professions","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Data science","score_opus":0.06393492969505456,"score_gpt":0.4032404382488492,"score_spread":0.33930550855379465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253699250","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00073217007,0.004097171,0.0010321256,0.046565138,0.17138441,0.0010389293,0.0040753093,0.0030755035,0.76799923],"genre_scores_gemma":[0.0005018011,0.00043330315,0.000085726104,0.0023989906,0.00827546,0.00011579908,0.00047562772,0.0003433429,0.98736995],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983285,0.00031487414,0.0001073801,0.00022178113,0.0006786114,0.0003488518],"domain_scores_gemma":[0.9913796,0.0017466159,0.00037551927,0.0007320874,0.0030301425,0.002736048],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0027074225,0.0025226981,0.003191609,0.0034739082,0.0035587263,0.010357862,0.003066035,0.011976582,0.85357857],"category_scores_gemma":[0.01045442,0.0010357191,0.0019759922,0.0026837655,0.0010398082,0.0045033405,0.003739543,0.0052759554,0.8089947],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037281952,0.000020868652,0.000028240322,0.000063525025,0.000001990096,0.000025295758,0.0000049174437,0.000013369993,0.000029483988,0.00019113524,0.9912186,0.008365209],"study_design_scores_gemma":[0.00005781257,0.00006619729,0.00056644063,0.00014045557,0.0000068634654,0.00003372094,0.000065367756,0.00008685841,0.00006255264,0.00056515477,0.9983367,0.000011903671],"about_ca_topic_score_codex":0.002301968,"about_ca_topic_score_gemma":0.006622604,"teacher_disagreement_score":0.14642143,"about_ca_system_score_codex":0.0021887762,"about_ca_system_score_gemma":0.0025143907,"threshold_uncertainty_score":0.20885235},"labels":[],"label_agreement":null},{"id":"W4281691647","doi":"10.1016/j.comcom.2022.05.035","title":"A federated calibration scheme for convolutional neural networks: Models, applications and challenges","year":2022,"lang":"en","type":"article","venue":"Computer Communications","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"King Saud University","keywords":"Computer science; Convolutional neural network; Deep learning; Artificial intelligence; Network architecture; Artificial neural network; Path (computing); Cluster analysis; Pattern recognition (psychology); Machine learning; Computer network","score_opus":0.09128292449671148,"score_gpt":0.2811332553182015,"score_spread":0.18985033082149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281691647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067390692,0.00024993432,0.99119383,0.00027596985,0.00004658035,0.00002132132,0.00004811565,0.0005972842,0.00082800706],"genre_scores_gemma":[0.44296283,0.00054802455,0.5504146,0.00034926453,0.00010475388,0.00010564416,0.00033053072,0.0002675979,0.004916723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856806,0.00050836627,0.00006194657,0.00030710336,0.0004570214,0.000097608005],"domain_scores_gemma":[0.99694014,0.0004801698,0.00021633465,0.0010671895,0.0011929107,0.00010331586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046329517,0.0008349574,0.00089121884,0.00064028066,0.00073843595,0.0019358257,0.0027239758,0.002192639,0.002698384],"category_scores_gemma":[0.0097036455,0.0006190579,0.0005909306,0.0010423607,0.000957887,0.0039827335,0.0028513274,0.0037028596,0.0010828984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032739466,0.00013516704,0.0017639053,0.00011256929,0.00014272361,0.00008154332,0.00012607379,0.52665114,0.012722654,0.07838039,0.0050936374,0.37446278],"study_design_scores_gemma":[0.000009229552,0.000022325135,0.00016023194,0.000021175692,0.000010808299,0.000040529285,0.000007164618,0.9783805,0.004296347,0.015432725,0.001604741,0.000014183198],"about_ca_topic_score_codex":0.0048287795,"about_ca_topic_score_gemma":0.004657888,"teacher_disagreement_score":0.0048287795,"about_ca_system_score_codex":0.0015030947,"about_ca_system_score_gemma":0.0025778175,"threshold_uncertainty_score":0.024501681},"labels":[],"label_agreement":null},{"id":"W4281759623","doi":"10.1016/j.comcom.2022.05.015","title":"Secure and intelligent slice resource allocation in vehicles-assisted cyber physical systems","year":2022,"lang":"en","type":"article","venue":"Computer Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Deanship of Scientific Research, King Saud University","keywords":"Computer science; Enabling; Cyber-physical system; Resource allocation; Distributed computing; Resource (disambiguation); Key (lock); Slicing; Resource management (computing); Agile software development; Embedded system; Computer network; Computer security; Software engineering; Operating system","score_opus":0.033913377896248306,"score_gpt":0.2621907547641763,"score_spread":0.22827737686792798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281759623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1862002,0.00060332596,0.8082644,0.00023509866,0.00012920065,0.00005592983,0.000061510145,0.00027279335,0.0041776327],"genre_scores_gemma":[0.99023765,0.000060396203,0.009017797,0.000014230624,0.0000095158075,0.000010338328,0.00001650295,0.000007871371,0.0006257257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995882,0.00011040483,0.000017190623,0.00007591899,0.000076833545,0.00013146029],"domain_scores_gemma":[0.9995758,0.00016496253,0.000050896648,0.00007938854,0.00008518294,0.000043751217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055637804,0.00038038607,0.00054581166,0.00023530425,0.00055762386,0.0009618051,0.00059561135,0.00030735868,0.0009763509],"category_scores_gemma":[0.0011787539,0.00018319847,0.00019830423,0.00033805097,0.0006673021,0.0008127236,0.0010473706,0.00047370503,0.000130089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005431967,0.000058483078,0.001304083,0.000059450525,0.000047438974,0.000174678,0.00015772402,0.85437334,0.012541441,0.06606805,0.0016193583,0.063052736],"study_design_scores_gemma":[0.0000040838836,0.0000369732,0.00019012611,0.0000029669068,0.0000059369404,0.000025240168,0.000037224618,0.98839915,0.001544355,0.009307073,0.00044238265,0.0000044657463],"about_ca_topic_score_codex":0.002670292,"about_ca_topic_score_gemma":0.0030503818,"teacher_disagreement_score":0.002670292,"about_ca_system_score_codex":0.0006008049,"about_ca_system_score_gemma":0.001089609,"threshold_uncertainty_score":0.0053094625},"labels":[],"label_agreement":null},{"id":"W4283826703","doi":"10.1016/j.comcom.2022.06.041","title":"A Binary Gray Wolf Optimization algorithm for deployment of Virtual Network Functions in 5G hybrid cloud","year":2022,"lang":"en","type":"article","venue":"Computer Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Software deployment; Cloud computing; Virtual network; Distributed computing; Quality of service; Server; Algorithm; Computer network; Operating system","score_opus":0.02318984985247981,"score_gpt":0.24572655227745457,"score_spread":0.22253670242497475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283826703","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0128629375,0.00030182506,0.98156345,0.00019755002,0.00006932423,0.000050799532,0.00003535006,0.00026252665,0.0046563265],"genre_scores_gemma":[0.54381764,0.00035229512,0.44770676,0.00021936256,0.000057455563,0.00018859212,0.0001356598,0.00012543741,0.0073968424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997651,0.000069182905,0.0000090601125,0.000034878172,0.00006855672,0.000053270374],"domain_scores_gemma":[0.9997454,0.0001282553,0.000020679248,0.000015207491,0.00006748351,0.000022867565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053766085,0.00060859486,0.00088764593,0.00044243413,0.0004233606,0.00078244053,0.0009011449,0.00086843927,0.0040025795],"category_scores_gemma":[0.0010165141,0.00038772274,0.0004210247,0.0006120478,0.00040257213,0.0006893677,0.0008688593,0.00070761336,0.00040115183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010705991,0.000041132003,0.000293224,0.00004922274,0.000021824802,0.000047175796,0.000036596055,0.9215001,0.0015643545,0.010050794,0.0027231863,0.06356541],"study_design_scores_gemma":[0.0000054270345,0.000009831101,0.000027967208,0.0000022135014,0.0000018234944,0.000005247611,0.0000037282177,0.9987955,0.00010406162,0.0008395069,0.00020338944,0.0000013251599],"about_ca_topic_score_codex":0.0073483926,"about_ca_topic_score_gemma":0.0054382617,"teacher_disagreement_score":0.0073483926,"about_ca_system_score_codex":0.00081408,"about_ca_system_score_gemma":0.0011426705,"threshold_uncertainty_score":0.014611244},"labels":[],"label_agreement":null},{"id":"W4285600422","doi":"10.1016/j.comcom.2022.07.012","title":"BioMixD: A Bio-Inspired and Traffic-Aware Mix Zone Placement Strategy for Location Privacy on the Internet of Drones","year":2022,"lang":"en","type":"article","venue":"Computer Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Drone; Computer science; The Internet; Privacy protection; Traffic analysis; Computer security; Internet of Things; World Wide Web","score_opus":0.03716846378486634,"score_gpt":0.25095439799267516,"score_spread":0.21378593420780884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285600422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05973295,0.00068396796,0.9315188,0.0003255317,0.00018137369,0.000080824066,0.00016209186,0.00077243464,0.006542022],"genre_scores_gemma":[0.8560723,0.00032075195,0.13852786,0.0001491596,0.000037566166,0.00007973901,0.00017030191,0.00007665355,0.0045657223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974304,0.00006202585,0.00000787524,0.000048620343,0.00007720052,0.00006115958],"domain_scores_gemma":[0.9996797,0.00011059377,0.000040018553,0.00004993321,0.000059923794,0.00005986707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039627287,0.0007956753,0.0009330635,0.00058660796,0.0006348163,0.00093072304,0.0013840694,0.00085055555,0.0022430003],"category_scores_gemma":[0.0009987425,0.00025629267,0.00043850765,0.00056881737,0.0004660015,0.001001992,0.0018987762,0.0007770797,0.0003982275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027772324,0.00013149143,0.0010983298,0.00011365697,0.000075630465,0.00015643744,0.00013723016,0.866377,0.013231392,0.020259073,0.0041711223,0.09397083],"study_design_scores_gemma":[0.00001431347,0.000083398256,0.00011559538,0.000006071859,0.000009336034,0.000055952514,0.000051689367,0.99346864,0.0015150008,0.0032791279,0.0013929349,0.000007893109],"about_ca_topic_score_codex":0.0027342702,"about_ca_topic_score_gemma":0.0037333588,"teacher_disagreement_score":0.0027342702,"about_ca_system_score_codex":0.00079095806,"about_ca_system_score_gemma":0.0009003982,"threshold_uncertainty_score":0.0075036287},"labels":[],"label_agreement":null},{"id":"W4367311454","doi":"10.1016/j.comcom.2023.04.021","title":"Improved differential evolution for RSSD-based localization in Gaussian mixture noise","year":2023,"lang":"en","type":"article","venue":"Computer Communications","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"China Scholarship Council; Science and Technology Commission of Shanghai Municipality; National Natural Science Foundation of China","keywords":"Computer science; Gaussian; Gaussian noise; Algorithm; Upper and lower bounds; Chaotic; Mathematical optimization; Noise (video); Cramér–Rao bound; Artificial intelligence; Mathematics; Estimation theory; Physics","score_opus":0.016266000578998935,"score_gpt":0.24264690238940725,"score_spread":0.22638090181040832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367311454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012172818,0.0001264978,0.9867148,0.000044661938,0.00003098641,0.000006542526,0.00002101081,0.00013671636,0.0007458917],"genre_scores_gemma":[0.6320653,0.00038920413,0.36006796,0.00009820643,0.000060943807,0.000055489654,0.00026754508,0.00014185137,0.0068534724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994585,0.00012519408,0.000022987428,0.00009574991,0.00025082089,0.000046753335],"domain_scores_gemma":[0.9995141,0.00018965795,0.00003396782,0.00006782374,0.00017365578,0.000020805599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006090713,0.0004595481,0.0005913749,0.0004333098,0.0002632092,0.00054103683,0.00098619,0.0006167005,0.0011964132],"category_scores_gemma":[0.002251119,0.00029713096,0.0005076714,0.00081402296,0.000422721,0.0009346227,0.0012602072,0.00060394796,0.00049988297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002695825,0.00007290771,0.0025159998,0.00013463163,0.000083078325,0.00016213706,0.0002983554,0.6920522,0.033845406,0.025219714,0.0015837589,0.24376222],"study_design_scores_gemma":[0.0000021255821,0.000011157591,0.00015114436,0.00000229475,0.0000041271987,0.000027008002,0.0000039357938,0.9972681,0.0013941098,0.0007829713,0.00034919084,0.0000038705903],"about_ca_topic_score_codex":0.004048147,"about_ca_topic_score_gemma":0.0034733682,"teacher_disagreement_score":0.004048147,"about_ca_system_score_codex":0.00063262234,"about_ca_system_score_gemma":0.0006073479,"threshold_uncertainty_score":0.00804913},"labels":[],"label_agreement":null},{"id":"W4376127739","doi":"10.1016/j.comcom.2023.04.032","title":"AI-based energy-efficient path planning of multiple logistics UAVs in intelligent transportation systems","year":2023,"lang":"en","type":"article","venue":"Computer Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":68,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Department of Engineering Physics, University of Wisconsin-Madison; Natural Science Foundation of Sichuan Province; King Saud University","keywords":"Computer science; Crossover; Energy consumption; Mathematical optimization; Context (archaeology); Genetic algorithm; Operator (biology); Motion planning; Path (computing); Operations research; Artificial intelligence","score_opus":0.040531407499765915,"score_gpt":0.2584941633609369,"score_spread":0.21796275586117098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376127739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07140905,0.00061643036,0.9192774,0.00034881913,0.00011468271,0.000058592632,0.000063227955,0.00020585346,0.007905983],"genre_scores_gemma":[0.93285966,0.00019538112,0.06388502,0.000049684317,0.000027885852,0.000056718985,0.0000641518,0.000024643114,0.0028369017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997923,0.000057849622,0.0000122032125,0.00004121744,0.00005831213,0.000038267455],"domain_scores_gemma":[0.99960726,0.00020526475,0.00004795536,0.000018994253,0.00009163178,0.000028933431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004076821,0.0005087783,0.00067079114,0.0005728195,0.0005525982,0.0007450901,0.0007484779,0.0006057835,0.0013242761],"category_scores_gemma":[0.0009072786,0.00041049306,0.0004933738,0.0007103819,0.00046031378,0.0007334114,0.00056033436,0.00054108223,0.00017460575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004356472,0.000018650133,0.00025640865,0.000023285025,0.000020229048,0.000027238559,0.000025308627,0.98161894,0.0011882732,0.0024883496,0.0003046008,0.013985146],"study_design_scores_gemma":[0.000001512102,0.000008979835,0.000048445283,0.0000011828589,0.000002199269,0.0000030549495,0.0000054836178,0.9991042,0.00015262554,0.00058710185,0.00008405055,0.0000011509501],"about_ca_topic_score_codex":0.014331546,"about_ca_topic_score_gemma":0.010889988,"teacher_disagreement_score":0.014331546,"about_ca_system_score_codex":0.00083456765,"about_ca_system_score_gemma":0.0011572036,"threshold_uncertainty_score":0.028496265},"labels":[],"label_agreement":null},{"id":"W4380149302","doi":"10.1016/j.comcom.2023.06.008","title":"An O-MAPPO scheme for joint computation offloading and resources allocation in UAV assisted MEC systems","year":2023,"lang":"en","type":"article","venue":"Computer Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Computation offloading; Server; Mobile edge computing; Distributed computing; Robustness (evolution); Resource allocation; Benchmark (surveying); Markov decision process; Computation; Flexibility (engineering); Energy consumption; Partially observable Markov decision process; Edge computing; Computer network; Markov process; Enhanced Data Rates for GSM Evolution; Markov chain; Markov model; Artificial intelligence; Algorithm","score_opus":0.05419377472690572,"score_gpt":0.27858476248105024,"score_spread":0.2243909877541445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380149302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18026362,0.0012661467,0.803186,0.00039790833,0.0003556498,0.00016153224,0.00016375913,0.0005357584,0.013669644],"genre_scores_gemma":[0.9607756,0.00015714734,0.036738396,0.000050262763,0.000044409262,0.000046837224,0.000039711667,0.000012408263,0.002135139],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997638,0.000056978613,0.000011491849,0.000035300836,0.000046255165,0.000086202686],"domain_scores_gemma":[0.99978095,0.00007817036,0.000018314426,0.000057790297,0.00003765338,0.000027051949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026351179,0.00050072564,0.0006200162,0.00020199247,0.00052370055,0.0005775963,0.0005360927,0.00032050995,0.0021682356],"category_scores_gemma":[0.0008192776,0.00014603528,0.00018032882,0.00036953887,0.0002939294,0.00063795963,0.0011434485,0.00035302507,0.00023979956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021011315,0.00033170453,0.00174172,0.00032468067,0.00008092457,0.0005047585,0.00031140953,0.3810211,0.09057144,0.022485223,0.007408556,0.49311736],"study_design_scores_gemma":[0.00003549945,0.00014838233,0.00047670523,0.0000114769755,0.00001231038,0.000098277334,0.00007320764,0.98715836,0.0054609925,0.004916614,0.0015970275,0.000011272618],"about_ca_topic_score_codex":0.0014143586,"about_ca_topic_score_gemma":0.0032880907,"teacher_disagreement_score":0.0021682356,"about_ca_system_score_codex":0.00017458462,"about_ca_system_score_gemma":0.0006493027,"threshold_uncertainty_score":0.007253468},"labels":[],"label_agreement":null},{"id":"W4380300805","doi":"10.1016/j.comcom.2023.06.007","title":"Online and reliable SFC protection scheme of distributed cloud network for future IoT application","year":2023,"lang":"en","type":"article","venue":"Computer Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"King Saud University","keywords":"Computer science; Backup; Cloud computing; Distributed computing; Virtual network; Reliability (semiconductor); Computer network; Service (business); Scheme (mathematics); Operating system","score_opus":0.03492531728465325,"score_gpt":0.2717257130008861,"score_spread":0.23680039571623285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380300805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17194933,0.0017505356,0.8007222,0.0010612032,0.0008256171,0.00032303768,0.00031225974,0.002752393,0.020303499],"genre_scores_gemma":[0.9784873,0.00015499162,0.018509187,0.0001200373,0.00010234429,0.00003650928,0.00008934138,0.000025725069,0.0024745623],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940765,0.00006853548,0.000029642104,0.00013248598,0.0001963933,0.000165296],"domain_scores_gemma":[0.9990889,0.00008048462,0.0000655514,0.00031889745,0.00038352128,0.00006268424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000544721,0.00054756226,0.00047608183,0.0006202996,0.0016456061,0.00090699043,0.0010578946,0.000515602,0.003891548],"category_scores_gemma":[0.00090035575,0.000119953096,0.0003495104,0.00044814896,0.00050188607,0.0014398332,0.0007242185,0.00076019595,0.0004338736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031491395,0.00047065224,0.0046692817,0.0003930827,0.000121623416,0.0009993417,0.0006221319,0.09154445,0.1848214,0.084580965,0.04239257,0.58623534],"study_design_scores_gemma":[0.0002108106,0.0005421117,0.0035853821,0.00007756879,0.00015057366,0.0012377668,0.00021049078,0.8590663,0.075420424,0.034238037,0.025164878,0.00009565204],"about_ca_topic_score_codex":0.0035147688,"about_ca_topic_score_gemma":0.0047424934,"teacher_disagreement_score":0.003891548,"about_ca_system_score_codex":0.0012481124,"about_ca_system_score_gemma":0.0014553214,"threshold_uncertainty_score":0.0130185485},"labels":[],"label_agreement":null},{"id":"W4384008567","doi":"10.1016/j.comcom.2023.07.010","title":"Average age upon decisions with truncated HARQ and optimization in the finite blocklength regime","year":2023,"lang":"en","type":"article","venue":"Computer Communications","topic":"Age of Information Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Hybrid automatic repeat request; Computer science; Network packet; Decoding methods; Transmitter; Convexity; Throughput; Wireless; Algorithm; Mathematical optimization; Computer network; Telecommunications; Mathematics; Telecommunications link; Channel (broadcasting)","score_opus":0.03634150201452821,"score_gpt":0.2552905385347692,"score_spread":0.21894903652024097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384008567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13866788,0.0034518677,0.83002174,0.0048001125,0.000516986,0.00016245563,0.0010934151,0.0005881178,0.020697435],"genre_scores_gemma":[0.9379494,0.0019225536,0.037959,0.00075066497,0.00078386755,0.00013207251,0.00040085037,0.00023406894,0.019867372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942009,0.002473834,0.00020756818,0.000862921,0.0010478235,0.0012069733],"domain_scores_gemma":[0.9483887,0.04199501,0.0028224522,0.0024862986,0.0029185899,0.0013890358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011516143,0.001658857,0.0033131076,0.0016451323,0.0012623424,0.004077931,0.002543907,0.0028357827,0.0071799303],"category_scores_gemma":[0.049023163,0.0017819258,0.0008695932,0.0024660653,0.0046513425,0.0076046353,0.0031500207,0.0038165275,0.0011776648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007346124,0.00009049569,0.0014480939,0.00016212462,0.00011649569,0.0003144187,0.00030025726,0.6699797,0.0016732854,0.3026502,0.005479644,0.017050676],"study_design_scores_gemma":[0.000030100451,0.000057733505,0.0005436956,0.000038987182,0.000024170182,0.00009993433,0.000066409935,0.84753513,0.0007406325,0.15012334,0.0006843436,0.000055478635],"about_ca_topic_score_codex":0.004689557,"about_ca_topic_score_gemma":0.0042348336,"teacher_disagreement_score":0.011516143,"about_ca_system_score_codex":0.0037351134,"about_ca_system_score_gemma":0.0036205826,"threshold_uncertainty_score":0.060903907},"labels":[],"label_agreement":null},{"id":"W4384297406","doi":"10.1016/j.comcom.2023.07.019","title":"A novel hybrid method for achieving accurate and timeliness vehicular traffic flow prediction in road networks","year":2023,"lang":"en","type":"article","venue":"Computer Communications","topic":"Traffic Prediction and Management Techniques","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"National Natural Science Foundation of China","keywords":"Computer science; Scalability; Context (archaeology); Traffic flow (computer networking); Floating car data; Traffic generation model; Network traffic control; Traffic congestion; Advanced Traffic Management System; Traffic congestion reconstruction with Kerner's three-phase theory; Scale (ratio); Traffic simulation; Process (computing); Intelligent transportation system; Network traffic simulation; Distributed computing; Real-time computing; Transport engineering; Microsimulation; Computer network","score_opus":0.029650198194754885,"score_gpt":0.27854985436020036,"score_spread":0.24889965616544546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384297406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011980018,0.00013556708,0.98639685,0.000037679813,0.000072997704,0.000026390784,0.000061161714,0.00062415714,0.0006651669],"genre_scores_gemma":[0.38427076,0.00022980085,0.61004376,0.0000941931,0.000118844,0.0001568032,0.0003351655,0.000111340574,0.004639419],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958473,0.000061935534,0.000021232148,0.000103906445,0.00018803889,0.00004023762],"domain_scores_gemma":[0.99943084,0.00019119133,0.000041256408,0.00006959267,0.00023661407,0.000030566378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048545905,0.0006305336,0.000826749,0.0009508817,0.00042841217,0.0007305232,0.0013497415,0.0007348932,0.0012979971],"category_scores_gemma":[0.0011697453,0.00033795767,0.0004835247,0.00081963016,0.00026711964,0.00094150077,0.00070455874,0.00061445846,0.0004250588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000263731,0.00023076535,0.003257797,0.00011087812,0.00014165793,0.00011848839,0.000094789895,0.4129246,0.032039538,0.0059313765,0.0038473622,0.54103905],"study_design_scores_gemma":[0.0000028681511,0.000012153617,0.00015149161,0.0000015372955,0.0000050192325,0.0000140331695,0.0000038729213,0.99789065,0.0012638835,0.00036423389,0.00028577924,0.000004583467],"about_ca_topic_score_codex":0.009408598,"about_ca_topic_score_gemma":0.01031596,"teacher_disagreement_score":0.009408598,"about_ca_system_score_codex":0.00040395724,"about_ca_system_score_gemma":0.0008313836,"threshold_uncertainty_score":0.018707633},"labels":[],"label_agreement":null},{"id":"W4385237531","doi":"10.1016/j.comcom.2023.07.029","title":"RUMP: Resource Usage Multi-Step Prediction in Extreme Edge Computing","year":2023,"lang":"en","type":"article","venue":"Computer Communications","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Rump; Testbed; Computational complexity theory; Computational resource; Artificial intelligence; Algorithm","score_opus":0.17478461648339058,"score_gpt":0.30580314177242307,"score_spread":0.1310185252890325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385237531","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06696035,0.0012522229,0.91806364,0.00054290565,0.000459724,0.00016262429,0.000952994,0.009628442,0.0019771764],"genre_scores_gemma":[0.7990299,0.00034481037,0.19652309,0.00030894956,0.00017860596,0.00018114732,0.0010035483,0.00020790323,0.0022220188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927443,0.00023508434,0.00004084238,0.00019803867,0.00014324565,0.000108284046],"domain_scores_gemma":[0.99824095,0.0011736245,0.00008550644,0.00018829017,0.00020115712,0.00011046609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002019107,0.0008593824,0.0015018592,0.0005194722,0.00052426994,0.00093260006,0.0018397841,0.0009123173,0.0015662586],"category_scores_gemma":[0.00452984,0.00037641966,0.0004894685,0.00068810524,0.0003063555,0.0012575638,0.001142041,0.0015769318,0.00047891226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016792357,0.0005767319,0.008385952,0.00018576058,0.00023220874,0.00043784265,0.00011076965,0.72357446,0.0029390585,0.0063811685,0.015241766,0.24025512],"study_design_scores_gemma":[0.000008266609,0.000019827765,0.00016607791,0.0000024172607,0.0000042144143,0.000013223402,0.000005024334,0.99826115,0.00029483857,0.0010632641,0.00015790135,0.000003783719],"about_ca_topic_score_codex":0.006646667,"about_ca_topic_score_gemma":0.0055122767,"teacher_disagreement_score":0.006646667,"about_ca_system_score_codex":0.0003753146,"about_ca_system_score_gemma":0.0008107342,"threshold_uncertainty_score":0.013215959},"labels":[],"label_agreement":null},{"id":"W4386366844","doi":"10.1016/j.comcom.2023.08.021","title":"Generation of irregular grid maps for fingerprinting-based mobile radio localization using farthest-first traversal and low-discrepancy sequences","year":2023,"lang":"en","type":"article","venue":"Computer Communications","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Tree traversal; Grid; Context (archaeology); Radio frequency; Real-time computing; Generator (circuit theory); Global Positioning System; Algorithm; Telecommunications","score_opus":0.05268837494697695,"score_gpt":0.2659716363812879,"score_spread":0.21328326143431095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386366844","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026853548,0.00007111245,0.9704112,0.000039242786,0.00003379132,0.00004945939,0.00022370435,0.0012106209,0.0011072364],"genre_scores_gemma":[0.4626999,0.00011541652,0.53341585,0.000025411306,0.000015227218,0.00011597781,0.0014989283,0.00028238233,0.0018309555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997106,0.00005318828,0.000014975641,0.00005195816,0.00012140112,0.00004770213],"domain_scores_gemma":[0.9991242,0.00026666772,0.000069718575,0.00017961454,0.00030856358,0.000051230767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002738548,0.00067283196,0.0006740286,0.0014914207,0.00043307588,0.0006172474,0.0008222026,0.00045528205,0.0025118135],"category_scores_gemma":[0.002282258,0.0003794855,0.00048184878,0.0014560409,0.00029543613,0.00058506685,0.0009960007,0.00051231554,0.00086636236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043211202,0.00013205859,0.004094568,0.00016393678,0.000049324768,0.00033033392,0.000269568,0.5216188,0.020803582,0.013909271,0.006357532,0.43183887],"study_design_scores_gemma":[0.000012893609,0.000030607443,0.0002942615,0.000005435351,0.0000051616676,0.00007391037,0.000033146243,0.99165875,0.004055477,0.002510842,0.0013107151,0.000008783424],"about_ca_topic_score_codex":0.005763311,"about_ca_topic_score_gemma":0.006950427,"teacher_disagreement_score":0.005763311,"about_ca_system_score_codex":0.00040167684,"about_ca_system_score_gemma":0.0010211807,"threshold_uncertainty_score":0.011459529},"labels":[],"label_agreement":null},{"id":"W4388366321","doi":"10.1016/j.comcom.2023.11.002","title":"A review of Machine Learning (ML)-based IoT security in healthcare: A dataset perspective","year":2023,"lang":"en","type":"review","venue":"Computer Communications","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; Research and Productivity Council; University of New Brunswick","funders":"","keywords":"Computer science; Testbed; Internet of Things; Health care; Process (computing); Computer security; Healthcare industry; Compromise; Perspective (graphical); Analytics; Data science; Risk analysis (engineering); Artificial intelligence; World Wide Web; Business","score_opus":0.16293946387470584,"score_gpt":0.42768060485497,"score_spread":0.26474114098026413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388366321","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022138434,0.9955023,0.0010192506,0.0015410082,0.00039120714,0.00001644192,0.00023211591,0.000022442746,0.0010538263],"genre_scores_gemma":[0.0017035045,0.99494225,0.0012479894,0.00079642556,0.0006399093,0.000017389611,0.00032182122,0.0000067998426,0.0003238903],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99913055,0.00021841086,0.00018740949,0.00015569008,0.00026297857,0.000045064236],"domain_scores_gemma":[0.99466693,0.0035710658,0.00039740064,0.00015616341,0.0010600716,0.00014832991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028325499,0.0008191804,0.001608115,0.0046885554,0.00033749596,0.001954064,0.0015087388,0.0011482943,0.004033014],"category_scores_gemma":[0.008574347,0.0003816716,0.0010936357,0.00579946,0.0006021231,0.00287759,0.0010403071,0.0013502924,0.001815178],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009826429,0.00007527706,0.0008610863,0.03164706,0.00022270318,0.000069594804,0.00006622233,0.00074320554,0.00058072107,0.0062639453,0.054633997,0.90473795],"study_design_scores_gemma":[0.000025336885,0.00021172536,0.0025585224,0.02213541,0.0006323469,0.0005873178,0.00010609813,0.0009745899,0.000704776,0.0060641216,0.9659425,0.000057328514],"about_ca_topic_score_codex":0.0025956589,"about_ca_topic_score_gemma":0.0042150095,"teacher_disagreement_score":0.0046885554,"about_ca_system_score_codex":0.0010275049,"about_ca_system_score_gemma":0.0032399506,"threshold_uncertainty_score":0.014980137},"labels":[],"label_agreement":null},{"id":"W4389219633","doi":"10.1016/j.comcom.2023.11.030","title":"Prediction-Based Cooperative Cache Discovery in VANETs for Social Networking","year":2023,"lang":"en","type":"article","venue":"Computer Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Telus (Canada); Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cache; Computer network; Network packet; Data mining; Cluster analysis; Exploit; Vehicular ad hoc network; Wireless; Computer security; Machine learning; Wireless ad hoc network","score_opus":0.11623881224486594,"score_gpt":0.3029798801223548,"score_spread":0.1867410678774889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389219633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13524829,0.0022270216,0.8543624,0.0010614378,0.00032977056,0.00017759936,0.0003677769,0.0009909561,0.005234801],"genre_scores_gemma":[0.96768904,0.00033641158,0.02926793,0.000074475225,0.0000612529,0.000050430583,0.00020367627,0.00003490547,0.0022818157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883837,0.00034378725,0.000051636514,0.00024113597,0.00024860975,0.00027645167],"domain_scores_gemma":[0.9964265,0.002100841,0.00030310862,0.00032707505,0.00063390343,0.00020846084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019938431,0.0007194339,0.0017736448,0.0011575922,0.0013734265,0.0016216828,0.002587882,0.0013689715,0.0012349983],"category_scores_gemma":[0.006722534,0.00067643565,0.0004909063,0.0019475132,0.0009215408,0.002435202,0.001798482,0.0010150776,0.00026606358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025952,0.00015625279,0.0026784425,0.00009305568,0.0000846453,0.00013174604,0.0002121298,0.91937363,0.002315345,0.01938252,0.0038946958,0.05141795],"study_design_scores_gemma":[0.000005309063,0.000027784148,0.00011364124,0.000004176441,0.00000917323,0.000023766199,0.00004172104,0.99499834,0.00028533407,0.0041194926,0.0003648066,0.0000064971873],"about_ca_topic_score_codex":0.020729704,"about_ca_topic_score_gemma":0.03364707,"teacher_disagreement_score":0.020729704,"about_ca_system_score_codex":0.0014784089,"about_ca_system_score_gemma":0.002202783,"threshold_uncertainty_score":0.041218042},"labels":[],"label_agreement":null},{"id":"W4389505417","doi":"10.1016/j.comcom.2023.12.003","title":"Robust multimodal federated learning for incomplete modalities","year":2023,"lang":"en","type":"article","venue":"Computer Communications","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Modalities; Computer science; Multimodal learning; Modality (human–computer interaction); Artificial intelligence; Machine learning; Representation (politics); Feature (linguistics); Dependency (UML); Feature learning","score_opus":0.13377088027244857,"score_gpt":0.3101905550907414,"score_spread":0.17641967481829282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389505417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014065794,0.000331537,0.98272747,0.00018856068,0.00005184756,0.00005520818,0.00027799033,0.0013830586,0.00091851794],"genre_scores_gemma":[0.5392834,0.0004787425,0.44752836,0.00041488488,0.0001916206,0.00041314246,0.0024023755,0.00036054727,0.008926912],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980744,0.00049770816,0.00013272768,0.00056326826,0.00045682117,0.00027506932],"domain_scores_gemma":[0.9967541,0.0014678143,0.00021621965,0.00084243,0.0006028366,0.000116554125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003141541,0.0013473994,0.0019024904,0.0014779078,0.00091005437,0.0019322359,0.0023677263,0.0024738666,0.0050306213],"category_scores_gemma":[0.008582385,0.00057681376,0.0018317447,0.0013682181,0.00123611,0.0035999494,0.0045510237,0.0024425641,0.0018846546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083286647,0.00049166544,0.0018985252,0.00023353705,0.00026163668,0.0002479284,0.00023321435,0.18566103,0.01171437,0.011519016,0.008034451,0.7788718],"study_design_scores_gemma":[0.000018955228,0.00010037428,0.00037857456,0.000035662775,0.00005034834,0.0001121065,0.00008920955,0.9666131,0.0075575253,0.023697129,0.0013254429,0.000021435051],"about_ca_topic_score_codex":0.004122124,"about_ca_topic_score_gemma":0.004924826,"teacher_disagreement_score":0.0050306213,"about_ca_system_score_codex":0.0010298903,"about_ca_system_score_gemma":0.0016171049,"threshold_uncertainty_score":0.016829133},"labels":[],"label_agreement":null},{"id":"W4389627500","doi":"10.1016/j.comcom.2023.12.010","title":"A UAV-based coverage gap detection and resolution in cellular networks: A machine-learning approach","year":2023,"lang":"en","type":"article","venue":"Computer Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"American University in Cairo","keywords":"Computer science; Benchmark (surveying); Base station; Cellular network; Software deployment; Real-time computing; Resolution (logic); Distributed computing; Artificial intelligence; Computer network","score_opus":0.020199496974780018,"score_gpt":0.20922298017162222,"score_spread":0.1890234831968422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389627500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04241082,0.000603863,0.95540917,0.00023214413,0.00004802994,0.00002856632,0.000046716454,0.0001605089,0.0010602744],"genre_scores_gemma":[0.9042712,0.00034206628,0.09353624,0.00009737636,0.00009595147,0.00004927786,0.000081118036,0.000025132116,0.0015016702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962115,0.00013198749,0.00001672246,0.00008968461,0.000071457674,0.00006898598],"domain_scores_gemma":[0.99867284,0.0009224874,0.00010937479,0.00006557868,0.0001842449,0.00004539843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073324406,0.00048163088,0.0012059422,0.00074463047,0.00036157662,0.0008801541,0.0010920257,0.0013374316,0.00080670527],"category_scores_gemma":[0.002946055,0.00036104186,0.0005331399,0.0007576719,0.000605787,0.0010146574,0.00083379145,0.0006759633,0.00014156339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001263736,0.0000602291,0.0016786179,0.00005904158,0.000045476798,0.0000827967,0.000053555337,0.9068412,0.0030222517,0.0058058053,0.0009596441,0.08126491],"study_design_scores_gemma":[0.0000013820236,0.000008967158,0.00008765546,0.0000018678176,0.0000025443267,0.000009546691,0.0000041936937,0.99893326,0.00029233235,0.0006073547,0.000049120907,0.0000017629246],"about_ca_topic_score_codex":0.006068053,"about_ca_topic_score_gemma":0.0031458864,"teacher_disagreement_score":0.006068053,"about_ca_system_score_codex":0.00073211634,"about_ca_system_score_gemma":0.0006625095,"threshold_uncertainty_score":0.01206547},"labels":[],"label_agreement":null},{"id":"W4390640588","doi":"10.1016/j.comcom.2024.01.004","title":"Memory-enhanced appearance-motion consistency framework for video anomaly detection","year":2024,"lang":"en","type":"article","venue":"Computer Communications","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of British Columbia Hospital","funders":"","keywords":"Computer science; Anomaly detection; Benchmark (surveying); Consistency (knowledge bases); Motion (physics); Artificial intelligence; Computer vision; Representation (politics); Anomaly (physics); Focus (optics); Data consistency; Pattern recognition (psychology); Database","score_opus":0.029579345908221547,"score_gpt":0.30316696884916416,"score_spread":0.27358762294094263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390640588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012944265,0.00034029636,0.9854812,0.000049713937,0.00003396649,0.00002447721,0.00007690144,0.00075608684,0.00029313733],"genre_scores_gemma":[0.4766748,0.00064527633,0.5187002,0.00013388574,0.00015554437,0.00009625878,0.00064181146,0.0002309433,0.0027212824],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939585,0.00009437305,0.000033702934,0.00014531722,0.00024151528,0.00008920774],"domain_scores_gemma":[0.99934834,0.00013263489,0.00009823714,0.00014147672,0.00023928324,0.00003990854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083273463,0.00061816117,0.0011189167,0.0011905823,0.00027652807,0.0007385253,0.001988058,0.00060750765,0.0014210106],"category_scores_gemma":[0.0019370393,0.0003018392,0.00076400576,0.0012955256,0.0003490512,0.0010865647,0.0011308925,0.0012781267,0.00055949995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000522685,0.00030324934,0.0033184218,0.00015297966,0.00017523087,0.00013374463,0.00006526727,0.0877957,0.06509367,0.009386042,0.0037817485,0.8292714],"study_design_scores_gemma":[0.000011502397,0.00008851697,0.0008402859,0.000005915085,0.000034304627,0.00009933589,0.000012023065,0.9853994,0.009446143,0.0028479993,0.0012017913,0.0000127617395],"about_ca_topic_score_codex":0.0065909396,"about_ca_topic_score_gemma":0.007035241,"teacher_disagreement_score":0.0065909396,"about_ca_system_score_codex":0.00042473033,"about_ca_system_score_gemma":0.0011323899,"threshold_uncertainty_score":0.013105154},"labels":[],"label_agreement":null},{"id":"W4390780727","doi":"10.1016/j.comcom.2024.01.002","title":"Enhancing modular application placement in a hierarchical fog computing: A latency and communication cost-sensitive approach","year":2024,"lang":"en","type":"article","venue":"Computer Communications","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Fundação de Amparo à Pesquisa do Estado da Bahia; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Computer science; Cloud computing; Latency (audio); Edge computing; Edge device; Distributed computing; Modular design; Enabling; Computer network; Enhanced Data Rates for GSM Evolution; Network architecture; Telecommunications","score_opus":0.024592772499138996,"score_gpt":0.280134381292511,"score_spread":0.255541608793372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390780727","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07515685,0.00053604716,0.9167933,0.00025798287,0.00015051696,0.00011974331,0.00006323909,0.0007531427,0.006169156],"genre_scores_gemma":[0.8525777,0.00025176306,0.14466386,0.00012642323,0.00007264134,0.000042580177,0.00006613641,0.00010816945,0.0020907621],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994407,0.00009695588,0.000024737934,0.00011054931,0.00017935436,0.00014760198],"domain_scores_gemma":[0.9992281,0.00017435373,0.00008642485,0.00020626381,0.00021706121,0.00008780561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046143227,0.0010705491,0.0007248344,0.00048728316,0.00075783546,0.0011120474,0.001742409,0.0005343421,0.0020023792],"category_scores_gemma":[0.0016415806,0.00032016457,0.00043333296,0.00077703013,0.00042423763,0.0017676987,0.0014865764,0.0007589372,0.00041215072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005664669,0.0004931801,0.0023753392,0.0003538028,0.00015931895,0.000496238,0.00028747853,0.53528184,0.14993376,0.029805455,0.006376856,0.27387032],"study_design_scores_gemma":[0.000013861185,0.00017530547,0.00075822405,0.000012278292,0.000059111087,0.0001722088,0.000112656206,0.9713399,0.012685923,0.012372617,0.0022808881,0.000016977381],"about_ca_topic_score_codex":0.002452833,"about_ca_topic_score_gemma":0.0062555424,"teacher_disagreement_score":0.002452833,"about_ca_system_score_codex":0.0007828668,"about_ca_system_score_gemma":0.0012456801,"threshold_uncertainty_score":0.006698668},"labels":[],"label_agreement":null},{"id":"W4391067329","doi":"10.1016/j.comcom.2024.01.018","title":"Securing IIoT applications in 6G and beyond using adaptive ensemble learning and zero-touch multi-resource provisioning","year":2024,"lang":"en","type":"article","venue":"Computer Communications","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Provisioning; Resource (disambiguation); Zero (linguistics); Distributed computing; Multimedia; Human–computer interaction; Computer network","score_opus":0.030038241524896564,"score_gpt":0.28770724958308513,"score_spread":0.2576690080581886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391067329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103125855,0.00068187213,0.88937706,0.00045920513,0.00036073703,0.00008762149,0.000048580147,0.0012152283,0.0046438375],"genre_scores_gemma":[0.95760494,0.00016776621,0.039804064,0.00020407149,0.00007260769,0.000023741019,0.000044024684,0.00003383018,0.0020448999],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988674,0.00025225288,0.000054655422,0.00019009042,0.00035907046,0.00027649658],"domain_scores_gemma":[0.9984623,0.00043945722,0.0001701416,0.00043297655,0.0004024875,0.00009257472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011309572,0.00082622416,0.000907442,0.00054729223,0.0010883922,0.0014942198,0.00072821,0.00086371024,0.0011067621],"category_scores_gemma":[0.003316619,0.00025387836,0.00039911663,0.00041953434,0.0007113015,0.0023072131,0.002242679,0.0015698726,0.0004443482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012940209,0.00030462202,0.009961142,0.00016837512,0.00024276304,0.0009979878,0.00047543025,0.2390269,0.09746195,0.04705449,0.007100932,0.5959114],"study_design_scores_gemma":[0.000009576253,0.00019170363,0.0010676443,0.000024280047,0.00004197105,0.0003051216,0.00008533082,0.9651442,0.018254355,0.012638848,0.002212911,0.000024074563],"about_ca_topic_score_codex":0.0007903565,"about_ca_topic_score_gemma":0.0015192335,"teacher_disagreement_score":0.0014942198,"about_ca_system_score_codex":0.00041839725,"about_ca_system_score_gemma":0.0006137389,"threshold_uncertainty_score":0.0059811473},"labels":[],"label_agreement":null},{"id":"W4391188486","doi":"10.1016/j.comcom.2024.01.020","title":"Optimizing Secrecy Energy Efficiency in RIS-assisted MISO systems using Deep Reinforcement Learning","year":2024,"lang":"en","type":"article","venue":"Computer Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Research Foundation of Korea; Kyungpook National University","keywords":"Reinforcement learning; Secrecy; Maximization; Computer science; Base station; Efficient energy use; Suite; Energy (signal processing); Distributed computing; Mathematical optimization; Artificial intelligence; Computer network; Computer security; Engineering; Mathematics; Electrical engineering","score_opus":0.034800398673257196,"score_gpt":0.26951454209049674,"score_spread":0.23471414341723956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391188486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15281008,0.0011728773,0.82151806,0.0009573576,0.0001637079,0.000072636074,0.00011793968,0.00052690966,0.022660444],"genre_scores_gemma":[0.9904792,0.0000792653,0.0067555686,0.0000675754,0.000018368626,0.000016475677,0.000017532948,0.00001893061,0.002547124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999648,0.00008132428,0.000011730273,0.00006676768,0.00007576354,0.00011644345],"domain_scores_gemma":[0.998958,0.0006570349,0.00010092392,0.000052067597,0.00017943692,0.0000526225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006945699,0.00079271663,0.0010696953,0.00029395602,0.00040070026,0.0011248254,0.00071490393,0.0009327866,0.0026425375],"category_scores_gemma":[0.0019271721,0.0003680705,0.00027227894,0.0003309759,0.00073726306,0.000853584,0.00091568223,0.0010003962,0.00042501403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008928072,0.00003542408,0.00032913507,0.00003479983,0.000015932128,0.000047262634,0.00001964365,0.9833665,0.0015317914,0.0039317585,0.00050079555,0.010097679],"study_design_scores_gemma":[0.0000030178167,0.000013273949,0.000036892765,0.000002443858,0.0000026210644,0.0000052851005,0.0000035863134,0.99887973,0.00024285079,0.00075383816,0.000054507385,0.000001863261],"about_ca_topic_score_codex":0.0035084311,"about_ca_topic_score_gemma":0.0047771237,"teacher_disagreement_score":0.0035084311,"about_ca_system_score_codex":0.0008105743,"about_ca_system_score_gemma":0.0010778748,"threshold_uncertainty_score":0.008840203},"labels":[],"label_agreement":null},{"id":"W4391288629","doi":"10.1016/j.comcom.2024.01.028","title":"Mobility aware and energy-efficient federated deep reinforcement learning assisted resource allocation for 5G-RAN slicing","year":2024,"lang":"en","type":"article","venue":"Computer Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Reinforcement learning; Ran; Slicing; Resource allocation; C-RAN; Efficient energy use; Resource (disambiguation); Computer network; Artificial intelligence; Radio access network; Base station; World Wide Web; Electrical engineering","score_opus":0.032056670630374096,"score_gpt":0.27015181646776304,"score_spread":0.23809514583738894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391288629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065301925,0.0007315735,0.92664707,0.0003268029,0.0001566392,0.000047606074,0.00011076643,0.0011177651,0.005559749],"genre_scores_gemma":[0.9621423,0.00008007169,0.03578547,0.00010181278,0.000020690006,0.000018158808,0.000061871644,0.000033587614,0.0017560938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966526,0.000053905103,0.0000123698055,0.0000795138,0.00006644436,0.00012238018],"domain_scores_gemma":[0.99962366,0.0001645222,0.000037336104,0.000041698055,0.00009049657,0.000042311545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005388337,0.00072903733,0.00078882684,0.0002365685,0.0003585694,0.00061447424,0.0009946214,0.00050463865,0.002723318],"category_scores_gemma":[0.0012839662,0.00023132662,0.00026197595,0.00023731559,0.00039386537,0.00084532966,0.00089313206,0.00088990614,0.0003097742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030218894,0.00014549909,0.0010845192,0.00005294795,0.000043906777,0.00014595185,0.000053000793,0.8559163,0.008954305,0.0063550477,0.0032255487,0.123720765],"study_design_scores_gemma":[0.000003907281,0.000018458122,0.00005503341,0.0000024957283,0.0000038351805,0.000012591286,0.0000063710536,0.9980568,0.00054004125,0.0011768268,0.00012107946,0.000002500827],"about_ca_topic_score_codex":0.00502379,"about_ca_topic_score_gemma":0.01178972,"teacher_disagreement_score":0.00502379,"about_ca_system_score_codex":0.00059362216,"about_ca_system_score_gemma":0.0011993719,"threshold_uncertainty_score":0.009989083},"labels":[],"label_agreement":null},{"id":"W4394743819","doi":"10.1016/j.comcom.2024.04.002","title":"Enabling lightweight immersive user interaction in smart buildings through learning-based mobile panorama streaming","year":2024,"lang":"en","type":"article","venue":"Computer Communications","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Douglas College; University of Toronto; Simon Fraser University","funders":"","keywords":"Panorama; Computer science; Multimedia; Wearable computer; Human–computer interaction; Virtual reality; Mobile device; Presentation (obstetrics); Embedded system; Artificial intelligence; World Wide Web","score_opus":0.038700001859429706,"score_gpt":0.34149336966427246,"score_spread":0.3027933678048428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394743819","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3741574,0.0005089092,0.60702574,0.0002416992,0.00009389978,0.00016048134,0.000251728,0.006050326,0.011509925],"genre_scores_gemma":[0.93493366,0.00019516895,0.060526185,0.000081836784,0.000041854262,0.00007137114,0.00013383494,0.0001919316,0.0038240058],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997733,0.00004341009,0.0000063713255,0.000031331827,0.000087570945,0.000057998834],"domain_scores_gemma":[0.99976486,0.00010020613,0.000017084963,0.000036547466,0.000041686446,0.00003968613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019969256,0.00045296567,0.00034652688,0.00017845446,0.00016341609,0.0005764686,0.0005624091,0.00041164103,0.0054147705],"category_scores_gemma":[0.00081544794,0.00018634033,0.00021011897,0.00014893488,0.00023184353,0.000822051,0.0018081884,0.0004984506,0.0008700122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009144889,0.00032938036,0.0031171106,0.0004044837,0.000060746745,0.0007429008,0.0014975785,0.016015874,0.59514004,0.0037316428,0.0055006184,0.37254518],"study_design_scores_gemma":[0.00019979705,0.0016534436,0.022316156,0.00014198641,0.00016244626,0.0023217183,0.0017334014,0.5458931,0.35895813,0.009277517,0.057132654,0.00020976087],"about_ca_topic_score_codex":0.00086241384,"about_ca_topic_score_gemma":0.0014726585,"teacher_disagreement_score":0.0054147705,"about_ca_system_score_codex":0.000110930174,"about_ca_system_score_gemma":0.00017602782,"threshold_uncertainty_score":0.018114269},"labels":[],"label_agreement":null},{"id":"W4394876553","doi":"10.1016/j.comcom.2024.04.009","title":"Reinforcement learning-based dynamic load balancing in edge computing networks","year":2024,"lang":"en","type":"article","venue":"Computer Communications","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Reinforcement learning; Load balancing (electrical power); Enhanced Data Rates for GSM Evolution; Distributed computing; Artificial intelligence","score_opus":0.0169767421123599,"score_gpt":0.27428563428826,"score_spread":0.25730889217590014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394876553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10880155,0.00037616983,0.8862472,0.00035318514,0.000061258004,0.00008322988,0.000030641142,0.0006390607,0.0034077028],"genre_scores_gemma":[0.96871436,0.00007847707,0.029768437,0.0001358275,0.000021971658,0.00004782238,0.000026661828,0.000028252043,0.0011782709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995284,0.00014384382,0.000019091181,0.000104192324,0.00008306793,0.000121420446],"domain_scores_gemma":[0.9987206,0.00072565494,0.00017635516,0.000069299844,0.00020837842,0.0000997834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011866286,0.00057079346,0.0008881709,0.00036732576,0.0004975482,0.0007247882,0.0012847577,0.0005887569,0.0008286009],"category_scores_gemma":[0.0027778298,0.00026699592,0.0002038341,0.00036704785,0.0007816867,0.0008605332,0.0006655225,0.00081082614,0.00016358025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009815507,0.00007875834,0.0005801079,0.000015618269,0.000015525899,0.000026745012,0.000025719839,0.9730814,0.0009227311,0.0023415042,0.0004499853,0.022363776],"study_design_scores_gemma":[0.00000450929,0.000011149452,0.000045244557,9.416734e-7,0.0000012455222,0.0000025815182,0.000002430335,0.99895465,0.0001222834,0.00080490205,0.000048929895,0.0000012207784],"about_ca_topic_score_codex":0.0085342545,"about_ca_topic_score_gemma":0.0058417055,"teacher_disagreement_score":0.0085342545,"about_ca_system_score_codex":0.0011596825,"about_ca_system_score_gemma":0.0011185596,"threshold_uncertainty_score":0.016969144},"labels":[],"label_agreement":null},{"id":"W4395085451","doi":"10.1016/j.comcom.2024.04.031","title":"ER-OCN: Toward efficient network routing in ocean city based on deep reinforcement learning","year":2024,"lang":"en","type":"article","venue":"Computer Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Shenzhen Science and Technology Innovation Program; Basic and Applied Basic Research Foundation of Guangdong Province; National Key Research and Development Program of China; Science, Technology and Innovation Commission of Shenzhen Municipality; National Natural Science Foundation of China","keywords":"Computer science; Reinforcement learning; Distributed computing; Computer network; Network topology; Routing (electronic design automation); Artificial intelligence","score_opus":0.036314249750020476,"score_gpt":0.27000370192373235,"score_spread":0.23368945217371187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395085451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0713159,0.0007047103,0.9076218,0.0010711192,0.0004710563,0.00011049678,0.0006026454,0.007624427,0.010477871],"genre_scores_gemma":[0.7260315,0.00024354711,0.25909477,0.0006795816,0.00010943098,0.00012874116,0.0013300399,0.0005348559,0.011847526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996984,0.00006053296,0.000011051597,0.00009255039,0.00005926253,0.00007823692],"domain_scores_gemma":[0.99944633,0.00020565097,0.00004805604,0.00008526097,0.00014853082,0.00006616458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066723017,0.00088445167,0.0010982251,0.00050992484,0.00049613195,0.0009518852,0.0019832794,0.0011966525,0.0037683323],"category_scores_gemma":[0.002072406,0.00041629863,0.00045067308,0.0005168883,0.00060669903,0.0012379274,0.0014918369,0.0018892059,0.00083132344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018268725,0.00012390366,0.001123922,0.00005865143,0.000055312197,0.000057517176,0.000037095913,0.88200206,0.0014307493,0.008661101,0.013044645,0.093222335],"study_design_scores_gemma":[0.0000054730326,0.000007065973,0.000022809676,0.0000018402569,0.0000021408864,0.0000024278863,0.0000036169226,0.998247,0.00016085393,0.0012921786,0.0002532408,0.0000014264331],"about_ca_topic_score_codex":0.02161457,"about_ca_topic_score_gemma":0.034979887,"teacher_disagreement_score":0.02161457,"about_ca_system_score_codex":0.0013021772,"about_ca_system_score_gemma":0.0018422822,"threshold_uncertainty_score":0.042977512},"labels":[],"label_agreement":null},{"id":"W4396567689","doi":"10.1016/j.comcom.2024.04.037","title":"Evaluating TCP BBRv3 performance in wired broadband networks","year":2024,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"Office of Advanced Cyberinfrastructure; Oklahoma Arts Council; National Science Foundation","keywords":"Computer science; Broadband; Computer network; Telecommunications","score_opus":0.05569152008295426,"score_gpt":0.31944932197490633,"score_spread":0.2637578018919521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396567689","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99372923,0.00013554767,0.0028824515,0.00006457204,0.000026423268,0.000043653807,0.00016732268,0.0002974231,0.00265334],"genre_scores_gemma":[0.998372,0.000035591187,0.0010322748,0.000012961821,0.000010862362,0.000007852301,0.00015602759,0.000018013494,0.0003545471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99763024,0.0010125043,0.00010643909,0.00016399584,0.0006773889,0.000409401],"domain_scores_gemma":[0.99181694,0.0052250368,0.0004288495,0.0003939285,0.0017103709,0.00042495393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031512338,0.0007155079,0.00045300473,0.0010480249,0.00060244714,0.001098941,0.00088820007,0.00088753604,0.001513947],"category_scores_gemma":[0.009601301,0.00018819912,0.00022534348,0.00094021973,0.0005733786,0.0009261576,0.0004780281,0.0005632779,0.0002752744],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009714778,0.0020712952,0.05070445,0.00026305777,0.00023692311,0.00040233159,0.00023127107,0.81287456,0.049105164,0.0025234083,0.0030687419,0.06880397],"study_design_scores_gemma":[0.00018019325,0.0032180108,0.019932684,0.000012369753,0.00010939128,0.00009924983,0.00018988363,0.9536485,0.021497987,0.00055708655,0.00052174676,0.00003291348],"about_ca_topic_score_codex":0.022817856,"about_ca_topic_score_gemma":0.0124889575,"teacher_disagreement_score":0.022817856,"about_ca_system_score_codex":0.0019348705,"about_ca_system_score_gemma":0.0010391308,"threshold_uncertainty_score":0.045370042},"labels":[],"label_agreement":null},{"id":"W4399245776","doi":"10.1016/j.comcom.2024.05.021","title":"IoT video analytics for surveillance-based systems in smart cities","year":2024,"lang":"en","type":"article","venue":"Computer Communications","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Concordia University","funders":"","keywords":"Computer science; Internet of Things; Analytics; Data science; Smart city; Computer security; Telecommunications","score_opus":0.08279356799581435,"score_gpt":0.33828400735934133,"score_spread":0.255490439363527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399245776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12850514,0.0024831588,0.8502607,0.0009118081,0.00033400758,0.00014124103,0.0011110114,0.0026979856,0.013555022],"genre_scores_gemma":[0.89199007,0.0015265475,0.10057354,0.00013138012,0.00016686639,0.000070370275,0.0010845944,0.00011524386,0.0043414733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966824,0.00007635407,0.000021708547,0.00006886236,0.00012249169,0.000042411684],"domain_scores_gemma":[0.9994692,0.0001520846,0.00008151331,0.000061845865,0.0001977266,0.000037530805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003929516,0.0005248532,0.00039535068,0.001094239,0.0003074633,0.001323913,0.00047003492,0.0005239644,0.0017987139],"category_scores_gemma":[0.0011790234,0.00017469068,0.0002312393,0.0012737614,0.0002510709,0.0014903998,0.00048410764,0.00043329885,0.0005698623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005814981,0.00040249436,0.025520753,0.0005298182,0.0001482046,0.00041202825,0.00043277812,0.11659714,0.10327696,0.035154663,0.022962876,0.6939809],"study_design_scores_gemma":[0.0000138123205,0.00010625829,0.007478871,0.0000644408,0.000034120454,0.00014339542,0.00042861598,0.9394556,0.029962402,0.0119862445,0.01030426,0.000021860653],"about_ca_topic_score_codex":0.0030302885,"about_ca_topic_score_gemma":0.0032977925,"teacher_disagreement_score":0.0030302885,"about_ca_system_score_codex":0.0004967433,"about_ca_system_score_gemma":0.00038033622,"threshold_uncertainty_score":0.0060253143},"labels":[],"label_agreement":null},{"id":"W4400337417","doi":"10.1016/j.comcom.2024.06.015","title":"The evolution of detection systems and their application for intelligent transportation systems: From solo to symphony","year":2024,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"National Natural Science Foundation of China","keywords":"Computer science; Human–computer interaction; Leverage (statistics); Perception; Sensor fusion; Adaptability; Data science; Artificial intelligence","score_opus":0.017363675660523988,"score_gpt":0.24474505857895215,"score_spread":0.22738138291842816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400337417","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19689734,0.069226794,0.4978543,0.04532618,0.005546515,0.0004201801,0.0012045475,0.0019344568,0.18158971],"genre_scores_gemma":[0.71997595,0.013860937,0.22141467,0.0067080073,0.002633154,0.00021915208,0.00045336975,0.0006851819,0.03404967],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982382,0.00040972646,0.00008643068,0.00061223074,0.0005010032,0.00015247607],"domain_scores_gemma":[0.9911748,0.0033537066,0.000445018,0.0009193802,0.003494794,0.0006123268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00438832,0.00083200133,0.00058847695,0.002427617,0.00094095734,0.0051182704,0.0019733422,0.0031692928,0.005250101],"category_scores_gemma":[0.011312528,0.00085281616,0.0006419062,0.0017084668,0.0042532803,0.005236936,0.0027080134,0.0029553953,0.0012592713],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005183899,0.00037153024,0.010068638,0.00075243023,0.00014161791,0.00021068573,0.0023991514,0.013106871,0.015902894,0.26452345,0.01660946,0.67539495],"study_design_scores_gemma":[0.00011004907,0.00086074776,0.02168216,0.001167743,0.00015763952,0.0011127066,0.0023093335,0.13917276,0.017382871,0.15718764,0.65858364,0.0002727074],"about_ca_topic_score_codex":0.006895866,"about_ca_topic_score_gemma":0.004443833,"teacher_disagreement_score":0.006895866,"about_ca_system_score_codex":0.00394206,"about_ca_system_score_gemma":0.0020808617,"threshold_uncertainty_score":0.028601766},"labels":[],"label_agreement":null},{"id":"W4401842380","doi":"10.1016/j.comcom.2024.107927","title":"DTL-5G: Deep transfer learning-based DDoS attack detection in 5G and beyond networks","year":2024,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saskatchewan Polytechnic; University of Regina","funders":"Canadian Armed Forces; Ministère de la Défense Nationale; Innovation for Defence Excellence and Security","keywords":"Computer science; Denial-of-service attack; Transfer of learning; Deep learning; Computer network; Application layer DDoS attack; Artificial intelligence; Computer security; World Wide Web; The Internet","score_opus":0.020620027159599735,"score_gpt":0.2580202905755517,"score_spread":0.23740026341595197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401842380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2159761,0.0030033381,0.72396857,0.0016599364,0.00074775395,0.00038655807,0.004464654,0.037718542,0.012074573],"genre_scores_gemma":[0.8351951,0.00045179285,0.14618383,0.00072891405,0.00012972938,0.00017139147,0.004862617,0.0002589378,0.012017692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955875,0.000093669165,0.000017544044,0.000086946486,0.00015370306,0.0000894489],"domain_scores_gemma":[0.99966645,0.00009946736,0.000030589184,0.00007624551,0.00008722229,0.000039958686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079681264,0.0011037856,0.0008292162,0.0011479006,0.00035467028,0.0006341306,0.0011469191,0.0009672813,0.00295649],"category_scores_gemma":[0.0014948025,0.00023999422,0.0003238425,0.00060682424,0.00035280807,0.0009714734,0.0012650344,0.0011520123,0.0012401313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086074776,0.0006693002,0.008154263,0.00016953105,0.00020857528,0.00029304717,0.00007174153,0.22583236,0.015973339,0.005717004,0.048004396,0.6940457],"study_design_scores_gemma":[0.000022315904,0.00012291799,0.0007376202,0.000007901695,0.0000113337455,0.000048448594,0.00001183989,0.9896248,0.0053546866,0.0018958863,0.0021493852,0.000012913287],"about_ca_topic_score_codex":0.0071865306,"about_ca_topic_score_gemma":0.0118446015,"teacher_disagreement_score":0.0071865306,"about_ca_system_score_codex":0.00088434806,"about_ca_system_score_gemma":0.001020252,"threshold_uncertainty_score":0.014289379},"labels":[],"label_agreement":null},{"id":"W4402315069","doi":"10.1016/j.comcom.2024.107949","title":"Predicting and mitigating cyber threats through data mining and machine learning","year":2024,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia; Western University","funders":"","keywords":"Computer science; Data science; Machine learning; Artificial intelligence; Data mining; Computer security","score_opus":0.08790265176258188,"score_gpt":0.308995535402368,"score_spread":0.22109288363978613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402315069","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17356956,0.003310466,0.8052551,0.005581084,0.0003148086,0.0004775218,0.0019231249,0.003887532,0.005680777],"genre_scores_gemma":[0.7413656,0.0027991664,0.25090858,0.0005088699,0.000271491,0.00024919235,0.0026483075,0.00010529775,0.0011434117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983725,0.0004961144,0.00017442054,0.0003816888,0.00046382486,0.00011144447],"domain_scores_gemma":[0.99277323,0.0038736511,0.001149808,0.0010487079,0.0009580263,0.0001965925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003390526,0.0019084458,0.0011705472,0.0034478009,0.0006102601,0.0025121374,0.0018659604,0.0011894788,0.0006473973],"category_scores_gemma":[0.011004927,0.0005268601,0.0010265436,0.0025032975,0.0006628263,0.0043670963,0.0014097556,0.0022496541,0.0004873995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015614394,0.0008901248,0.053214114,0.00055522687,0.00045725913,0.00027609963,0.000292305,0.55519706,0.005102208,0.007776478,0.0053894427,0.37069353],"study_design_scores_gemma":[0.0000075379107,0.00009887409,0.0034908873,0.000088752466,0.000043633594,0.00006286475,0.00016940749,0.97785586,0.0034007768,0.012200428,0.0025516152,0.000029328983],"about_ca_topic_score_codex":0.0058893766,"about_ca_topic_score_gemma":0.008160018,"teacher_disagreement_score":0.0058893766,"about_ca_system_score_codex":0.000989865,"about_ca_system_score_gemma":0.0019601665,"threshold_uncertainty_score":0.017930984},"labels":[],"label_agreement":null},{"id":"W4403016868","doi":"10.1016/j.comcom.2024.107966","title":"RIPPLE-WiN: An efficient protocol for loop-free multipath routing in wireless networks","year":2024,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Ripple; Multipath propagation; Wireless; Multipath routing; Routing (electronic design automation); Protocol (science); Routing protocol; Dynamic Source Routing; Telecommunications; Electrical engineering; Channel (broadcasting)","score_opus":0.04827933413342932,"score_gpt":0.33312237452679905,"score_spread":0.2848430403933697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403016868","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022094702,0.001012874,0.9431045,0.0003980065,0.00053491554,0.00036369986,0.0005407393,0.02374443,0.008206141],"genre_scores_gemma":[0.49994475,0.0016274691,0.4711652,0.00042160088,0.0002629504,0.0008007266,0.002284637,0.0026236442,0.020868992],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992142,0.00015447213,0.00006347745,0.00007623755,0.000325045,0.00016654431],"domain_scores_gemma":[0.9984328,0.00050614873,0.00012233868,0.0004902287,0.0003055498,0.00014289071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014838568,0.00086915004,0.0009664936,0.0017102902,0.0014294744,0.0015816017,0.0026278167,0.00081399427,0.0053923107],"category_scores_gemma":[0.003803065,0.0005727264,0.0004757595,0.0012688966,0.00075753254,0.0026640326,0.002964707,0.0013633013,0.0013908751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029278037,0.00028290748,0.0012436858,0.00097582414,0.0003048584,0.00045520844,0.000561295,0.102162614,0.03532885,0.10181133,0.06340487,0.6905408],"study_design_scores_gemma":[0.0006177127,0.0006777524,0.00063466287,0.00015552534,0.00037367595,0.0006345675,0.0002874412,0.74159473,0.07218027,0.08833634,0.0942173,0.0002900723],"about_ca_topic_score_codex":0.0020972765,"about_ca_topic_score_gemma":0.0043000146,"teacher_disagreement_score":0.0053923107,"about_ca_system_score_codex":0.0008567672,"about_ca_system_score_gemma":0.0019970073,"threshold_uncertainty_score":0.018039107},"labels":[],"label_agreement":null},{"id":"W4404565615","doi":"10.1016/j.comcom.2024.108008","title":"A survey on authentication protocols of dynamic wireless EV charging","year":2024,"lang":"en","type":"article","venue":"Computer Communications","topic":"RFID technology advancements","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Wireless; Authentication (law); Computer network; Computer security; Telecommunications","score_opus":0.03850746091323601,"score_gpt":0.32710614945939315,"score_spread":0.2885986885461571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404565615","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014947985,0.76491636,0.15559043,0.002039792,0.0014768132,0.0004085331,0.00033651822,0.0005095139,0.059774205],"genre_scores_gemma":[0.08428058,0.85184574,0.047978174,0.0010348858,0.0013050662,0.00041262014,0.00080157345,0.00012901305,0.0122123165],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980915,0.00045794086,0.00032344265,0.0002719951,0.0006858257,0.00016930923],"domain_scores_gemma":[0.99652004,0.0021028472,0.00025187162,0.00032602288,0.00074085407,0.000058404872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018948826,0.0011251062,0.00095835933,0.003008432,0.0009013102,0.0024903517,0.001591407,0.0017382344,0.0039384384],"category_scores_gemma":[0.004823162,0.0008172355,0.00090304273,0.004157004,0.000962092,0.006022679,0.0014588486,0.0019938224,0.0027107294],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020101549,0.00019785619,0.0013783041,0.009512008,0.00009297401,0.0005468069,0.0009241431,0.0072202887,0.0076401727,0.12438585,0.02010296,0.8277977],"study_design_scores_gemma":[0.00002249105,0.0005161076,0.0015696358,0.004722667,0.00020385924,0.0038498207,0.0007362901,0.015264232,0.010554602,0.047308512,0.9150932,0.00015855662],"about_ca_topic_score_codex":0.00096911145,"about_ca_topic_score_gemma":0.00038380825,"teacher_disagreement_score":0.0039384384,"about_ca_system_score_codex":0.0010375205,"about_ca_system_score_gemma":0.0016986633,"threshold_uncertainty_score":0.013175368},"labels":[],"label_agreement":null},{"id":"W4405170942","doi":"10.1016/j.comcom.2024.108024","title":"Enhancing fog load balancing through lifelong transfer learning of reinforcement learning agents","year":2024,"lang":"en","type":"article","venue":"Computer Communications","topic":"Smart Parking Systems Research","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science; Reinforcement learning; Transfer of learning; Lifelong learning; Transfer (computing); Artificial intelligence; Human–computer interaction; Operating system","score_opus":0.03827774775568,"score_gpt":0.2996407721707222,"score_spread":0.2613630244150422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405170942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20557694,0.00024410599,0.78081566,0.0003135359,0.00022347487,0.00013555224,0.000028863544,0.0017197039,0.010942091],"genre_scores_gemma":[0.982477,0.000025086449,0.01599587,0.000068323265,0.000020269916,0.00002417289,0.000016173197,0.000028836075,0.0013443518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997502,0.000049660095,0.000008113819,0.000051437106,0.00006403008,0.00007665423],"domain_scores_gemma":[0.9993187,0.00021996113,0.000076142416,0.00009020706,0.00020759806,0.0000873845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057190494,0.00070737774,0.0005721563,0.00028742405,0.0004168021,0.00073728943,0.0012455501,0.00071576535,0.0021812888],"category_scores_gemma":[0.0021390354,0.00023547056,0.00023153008,0.00019406469,0.0005153944,0.0009846053,0.0011574682,0.0010683282,0.0004872536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026234024,0.0006345439,0.0022954606,0.00004913406,0.000054949298,0.0001392135,0.00013391505,0.84342307,0.01344468,0.003997054,0.0026229974,0.1329426],"study_design_scores_gemma":[0.00000940931,0.00003855879,0.00012963547,0.000001848576,0.000003947602,0.000009645462,0.00000880471,0.99751186,0.0009000584,0.0011167873,0.0002661518,0.0000033158904],"about_ca_topic_score_codex":0.0034780109,"about_ca_topic_score_gemma":0.00441772,"teacher_disagreement_score":0.0034780109,"about_ca_system_score_codex":0.0005292269,"about_ca_system_score_gemma":0.0007946115,"threshold_uncertainty_score":0.0072971582},"labels":[],"label_agreement":null},{"id":"W4406091448","doi":"10.1016/j.comcom.2024.108041","title":"UAVs deployment optimization in cell-free aerial communication networks","year":2025,"lang":"en","type":"article","venue":"Computer Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Université du Québec à Montréal","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science; Software deployment; Computer network; Distributed computing; Telecommunications; Software engineering","score_opus":0.00888538302555557,"score_gpt":0.21798428968501027,"score_spread":0.2090989066594547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406091448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18306597,0.0010779665,0.810306,0.00035363855,0.000052662428,0.000054216613,0.000093003255,0.00017564608,0.004820891],"genre_scores_gemma":[0.95783347,0.0004274858,0.039471336,0.000053638036,0.00001710778,0.000046399142,0.00006569,0.000025521922,0.002059246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971193,0.00013416538,0.000008484163,0.000045745437,0.000044781864,0.00005483817],"domain_scores_gemma":[0.99958104,0.00028678472,0.00005398766,0.000018250932,0.000031147836,0.0000288088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003644634,0.00070711586,0.000526958,0.0003381965,0.00033933966,0.00059362414,0.0005433498,0.0006482577,0.0006997925],"category_scores_gemma":[0.0011275401,0.00033383846,0.00022327325,0.0005380202,0.00054525974,0.00070581946,0.0006522385,0.00040141217,0.00012697231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002101616,0.000010529743,0.00028824105,0.000019400897,0.000010741889,0.000046237554,0.000021358519,0.9901468,0.0007623339,0.0032651993,0.0002637854,0.0051444364],"study_design_scores_gemma":[0.0000042244083,0.0000200753,0.00011087579,0.0000021610515,0.00000399439,0.000013107098,0.000018235223,0.99801135,0.00028259176,0.0012965148,0.00023490567,0.0000018368544],"about_ca_topic_score_codex":0.004701966,"about_ca_topic_score_gemma":0.0037522577,"teacher_disagreement_score":0.004701966,"about_ca_system_score_codex":0.0006489136,"about_ca_system_score_gemma":0.0004020973,"threshold_uncertainty_score":0.009349227},"labels":[],"label_agreement":null},{"id":"W4409123220","doi":"10.1016/j.comcom.2025.108152","title":"A hybrid swarm intelligence approach for optimizing Multimodal Large Language Models deployment in edge-cloud-based Federated Learning environments","year":2025,"lang":"en","type":"article","venue":"Computer Communications","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Khalifa University of Science, Technology and Research","keywords":"Computer science; Software deployment; Cloud computing; Enhanced Data Rates for GSM Evolution; Artificial intelligence; Distributed computing; Human–computer interaction; Machine learning; Software engineering; Operating system","score_opus":0.04005470865340984,"score_gpt":0.29565298411547924,"score_spread":0.2555982754620694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409123220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03790117,0.00018899786,0.95869124,0.0002830308,0.000051126677,0.00005329308,0.000047990517,0.001058782,0.0017243731],"genre_scores_gemma":[0.8001291,0.000117372896,0.19710475,0.00022979644,0.000028002598,0.0001215888,0.00016268206,0.00007948288,0.002027143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995683,0.00011159253,0.000025220983,0.000105392544,0.00010264291,0.00008691342],"domain_scores_gemma":[0.9994704,0.00020776228,0.000063721025,0.00006194771,0.00013947861,0.000056575776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078090385,0.000972998,0.00088409235,0.0004919213,0.00055210147,0.00093147845,0.0012620919,0.0008635515,0.00081999967],"category_scores_gemma":[0.001918558,0.0003697528,0.0006035273,0.0004812963,0.00049184705,0.0012060807,0.0011927487,0.00088506076,0.00022801699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086586355,0.000090776004,0.00085510337,0.00003175359,0.000032468244,0.00012847637,0.000065406886,0.92509145,0.003792876,0.0022671507,0.0013088266,0.066249214],"study_design_scores_gemma":[0.0000032438818,0.000010014926,0.000037093716,9.863182e-7,0.0000018127729,0.0000055054866,0.000007360238,0.9991085,0.00034914867,0.00038059225,0.00009395264,0.0000017318083],"about_ca_topic_score_codex":0.008941908,"about_ca_topic_score_gemma":0.007437597,"teacher_disagreement_score":0.008941908,"about_ca_system_score_codex":0.00080143847,"about_ca_system_score_gemma":0.0011940667,"threshold_uncertainty_score":0.017779768},"labels":[],"label_agreement":null},{"id":"W4409800697","doi":"10.1016/j.comcom.2025.108179","title":"Community-Oriented Edge Computing Platform","year":2025,"lang":"en","type":"article","venue":"Computer Communications","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Edge computing; Distributed computing; Computer architecture; World Wide Web; Telecommunications","score_opus":0.04820319692849477,"score_gpt":0.3088892081858832,"score_spread":0.26068601125738844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409800697","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18688588,0.00094072556,0.7626545,0.0016764193,0.00045555484,0.00070684665,0.00046391605,0.0035598504,0.04265636],"genre_scores_gemma":[0.7871707,0.00037133816,0.20464195,0.0004191272,0.00006819713,0.0002648906,0.0004832169,0.00013702665,0.006443589],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995881,0.00009829867,0.000014791778,0.000086984866,0.00009214679,0.000119768454],"domain_scores_gemma":[0.9993223,0.00013905778,0.00005168065,0.00014526496,0.00016156696,0.00018010216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006074373,0.00047466916,0.00034045224,0.00044961408,0.001141819,0.0011667424,0.0014798978,0.00055148796,0.003788001],"category_scores_gemma":[0.0013217485,0.00015428597,0.00038070552,0.00060262374,0.0005167299,0.0022187836,0.0023494062,0.00094282796,0.00064926804],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012194038,0.00078304886,0.004399218,0.0006537916,0.00016235666,0.00096991943,0.00062752434,0.31120208,0.056516662,0.27954522,0.055536743,0.28838408],"study_design_scores_gemma":[0.00010009795,0.00022325404,0.0010063119,0.000039306433,0.000046034056,0.0002733955,0.00032531918,0.871797,0.011211455,0.07561447,0.039311748,0.00005154193],"about_ca_topic_score_codex":0.0026523203,"about_ca_topic_score_gemma":0.003498285,"teacher_disagreement_score":0.003788001,"about_ca_system_score_codex":0.0006130134,"about_ca_system_score_gemma":0.0014195842,"threshold_uncertainty_score":0.012672126},"labels":[],"label_agreement":null},{"id":"W4409839611","doi":"10.1016/j.comcom.2025.108173","title":"A novel energy-efficient cross-layer design for scheduling and routing in 6TiSCH networks","year":2025,"lang":"en","type":"article","venue":"Computer Communications","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Ministère de l'Enseignement Supérieur et de la Recherche Scientifique","keywords":"Computer science; Scheduling (production processes); Computer network; Routing (electronic design automation); Distributed computing; Mathematical optimization","score_opus":0.06266617415485004,"score_gpt":0.3171091297572265,"score_spread":0.25444295560237645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409839611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038390134,0.00050251617,0.9527806,0.00020970337,0.00015753972,0.00009597926,0.00008054348,0.00084504986,0.0069379606],"genre_scores_gemma":[0.5651765,0.0004563059,0.42760685,0.0003069362,0.00008511614,0.00015025288,0.00020030612,0.00017955461,0.005838173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953556,0.00011398561,0.000034827157,0.00006506694,0.00018192748,0.00006862234],"domain_scores_gemma":[0.9995888,0.00008836443,0.00005338251,0.00008299994,0.00015681272,0.000029619612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005706215,0.0005017651,0.00034515993,0.0004193504,0.00047904078,0.00095936295,0.0013908937,0.0003769477,0.0026848644],"category_scores_gemma":[0.00085040607,0.0003433486,0.00033633228,0.00030090997,0.00021739306,0.00081242656,0.00069612847,0.0007082097,0.0005385405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005416848,0.00032322967,0.0016485028,0.00036612473,0.00025161103,0.00031271364,0.00024221026,0.42304248,0.2340942,0.070942044,0.009802881,0.25843233],"study_design_scores_gemma":[0.00002743498,0.00016726623,0.00020720538,0.000013567837,0.000045816396,0.0001087339,0.000024187424,0.966362,0.02286052,0.0047533414,0.0054118726,0.000018016786],"about_ca_topic_score_codex":0.0012928267,"about_ca_topic_score_gemma":0.005117605,"teacher_disagreement_score":0.0026848644,"about_ca_system_score_codex":0.00068041007,"about_ca_system_score_gemma":0.0010624344,"threshold_uncertainty_score":0.008981764},"labels":[],"label_agreement":null},{"id":"W4411540665","doi":"10.1016/j.comcom.2025.108248","title":"A Self-adaptive Hybrid Network Anomaly Detection Engine","year":2025,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Toronto Metropolitan University","funders":"","keywords":"Computer science; Anomaly detection; Anomaly (physics); Real-time computing; Computer network; Artificial intelligence; Data mining","score_opus":0.013019158686071682,"score_gpt":0.23240795493453933,"score_spread":0.21938879624846766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411540665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03324813,0.00016412206,0.9547255,0.00009074605,0.0001146652,0.00006264801,0.00008106064,0.010008166,0.0015049245],"genre_scores_gemma":[0.61997193,0.00013188492,0.3709401,0.00021425131,0.00009085608,0.00009157566,0.00035326864,0.00033092938,0.007875292],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995926,0.000032690605,0.000020877238,0.000106339,0.00020860731,0.00003884657],"domain_scores_gemma":[0.999283,0.00017949376,0.00005446027,0.00013642824,0.0003069381,0.000039686074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000603044,0.00047613517,0.0007542335,0.0010347457,0.00029289495,0.00076384924,0.0018603728,0.0006134932,0.0020106712],"category_scores_gemma":[0.0012349349,0.00029269728,0.0003981565,0.00055217807,0.00023893436,0.0012822376,0.000860778,0.00069695263,0.0008585091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005069342,0.0005742898,0.0064665894,0.00010328718,0.00026148796,0.00023617274,0.00007892198,0.123136275,0.09471695,0.00661177,0.0067721014,0.7605353],"study_design_scores_gemma":[0.000011789996,0.00005347893,0.0006180236,0.0000024878657,0.00002438696,0.00008311093,0.000004311226,0.98320156,0.013910287,0.00093495427,0.0011448931,0.00001076448],"about_ca_topic_score_codex":0.0021887294,"about_ca_topic_score_gemma":0.002828235,"teacher_disagreement_score":0.0021887294,"about_ca_system_score_codex":0.00041443485,"about_ca_system_score_gemma":0.00047332814,"threshold_uncertainty_score":0.006726384},"labels":[],"label_agreement":null},{"id":"W4412422855","doi":"10.1016/j.comcom.2025.108219","title":"Digital twin-assisted multi-layer networks for low-latency and energy-efficient communication","year":2025,"lang":"en","type":"article","venue":"Computer Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Latency (audio); Computer network; Layer (electronics); Low latency (capital markets); Application layer; Efficient energy use; Telecommunications; Operating system; Electrical engineering","score_opus":0.031221563998773204,"score_gpt":0.2733942946569427,"score_spread":0.2421727306581695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412422855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031603474,0.0007620073,0.96288425,0.00022339568,0.00009057129,0.000035701945,0.0000537577,0.0003054639,0.00404145],"genre_scores_gemma":[0.8377967,0.00071247277,0.15653527,0.00018731502,0.000046976496,0.0000622112,0.00009975853,0.000034986493,0.0045242715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976116,0.000053014734,0.000013473971,0.000049481278,0.00007301542,0.000049764654],"domain_scores_gemma":[0.9997644,0.00007530742,0.000038860657,0.00003746721,0.00006498111,0.000019096015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042609836,0.00054886076,0.00035761987,0.00033424032,0.00044958427,0.0008167447,0.0010746589,0.0005273374,0.0016604514],"category_scores_gemma":[0.00078299246,0.0001928081,0.00031612933,0.0004714711,0.0004370329,0.001747316,0.0009896411,0.0008079416,0.0002422058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002923359,0.00016306152,0.001230394,0.0002580212,0.00008772063,0.00019879882,0.00014644701,0.6461149,0.03984381,0.05585779,0.0055113705,0.2502954],"study_design_scores_gemma":[0.0000053965546,0.00003812115,0.000085281325,0.000006824201,0.000010187326,0.00003187612,0.000014467321,0.98976785,0.0033976154,0.0048992755,0.001734384,0.000008718236],"about_ca_topic_score_codex":0.0023779224,"about_ca_topic_score_gemma":0.0065757055,"teacher_disagreement_score":0.0023779224,"about_ca_system_score_codex":0.0009988234,"about_ca_system_score_gemma":0.00071700104,"threshold_uncertainty_score":0.0072470307},"labels":[],"label_agreement":null},{"id":"W4412724700","doi":"10.1016/j.comcom.2025.108280","title":"Overcoming data limitations in internet traffic forecasting: LSTM models with transfer learning and wavelet augmentation","year":2025,"lang":"en","type":"article","venue":"Computer Communications","topic":"Traffic Prediction and Management Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Northern British Columbia","funders":"","keywords":"Computer science; Transfer of learning; Wavelet; Artificial intelligence; The Internet; Transfer (computing); Internet traffic; Machine learning; Data mining; World Wide Web","score_opus":0.11100078773136625,"score_gpt":0.26791211608208815,"score_spread":0.1569113283507219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412724700","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33062506,0.002457113,0.6578399,0.0016510567,0.00048725013,0.0000877361,0.0007175383,0.0025121022,0.0036222634],"genre_scores_gemma":[0.9440835,0.00058254326,0.052370045,0.00026700232,0.00010426974,0.00009811288,0.0008776822,0.000076684875,0.0015401158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999668,0.000109863664,0.00003056844,0.00009116691,0.00005917969,0.000041091753],"domain_scores_gemma":[0.9986817,0.00085483445,0.00008074699,0.00013145574,0.00022390544,0.000027370528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016096766,0.0011193735,0.0006501721,0.00047486514,0.00028091526,0.0008125346,0.0011483583,0.0009506458,0.0008584841],"category_scores_gemma":[0.0056050643,0.00039633483,0.00065810606,0.0008920221,0.0004296737,0.0020052476,0.0009397782,0.0024849512,0.0004414254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014910162,0.0001631284,0.0030239904,0.000118023134,0.00009370893,0.00018052466,0.00014233754,0.80014354,0.00473149,0.0019510476,0.0029809405,0.18632224],"study_design_scores_gemma":[0.0000029543492,0.000014896806,0.0001951933,0.000006361846,0.0000054100424,0.000007341375,0.000010283075,0.99767476,0.0008768863,0.0009539467,0.00024743692,0.0000045712663],"about_ca_topic_score_codex":0.0074120737,"about_ca_topic_score_gemma":0.00530061,"teacher_disagreement_score":0.0074120737,"about_ca_system_score_codex":0.00049304374,"about_ca_system_score_gemma":0.0007895243,"threshold_uncertainty_score":0.0147378445},"labels":[],"label_agreement":null},{"id":"W4417436617","doi":"10.1016/j.comcom.2025.108340","title":"Power prediction and energy aware placement of containers over virtual machines","year":2025,"lang":"en","type":"article","venue":"Computer Communications","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Mitacs","keywords":"Cloud computing; Testbed; Energy consumption; Virtual machine; Live migration; Efficient energy use; Scalability; Energy (signal processing)","score_opus":0.008934456302681188,"score_gpt":0.2439694468743871,"score_spread":0.2350349905717059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417436617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49268532,0.00038530305,0.5011519,0.000557874,0.00014181742,0.00007483145,0.00022792644,0.0013903748,0.0033846402],"genre_scores_gemma":[0.9731426,0.00006144712,0.025716705,0.000034488774,0.000012863789,0.000021042912,0.00008441192,0.000034259236,0.0008920979],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978274,0.00005487318,0.000009559768,0.00006282979,0.000034352062,0.000055728862],"domain_scores_gemma":[0.99947363,0.00022002713,0.00009748265,0.00005432716,0.00011393876,0.000040726743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004739706,0.0006382771,0.00054959307,0.00034512798,0.0003284236,0.00068238744,0.0008445853,0.00051681907,0.00082742644],"category_scores_gemma":[0.0015434729,0.00036323114,0.000300441,0.00040530073,0.00039155848,0.00083541585,0.000327989,0.0005504101,0.00023775856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044349166,0.000028957083,0.0015459472,0.000009584075,0.0000059025565,0.000015158652,0.000008927038,0.98728323,0.0010084347,0.00030166292,0.00032547282,0.009422303],"study_design_scores_gemma":[7.6730277e-7,0.000004962844,0.00011908156,5.7338247e-7,7.868641e-7,0.0000015738011,0.0000024929698,0.99941933,0.0002526661,0.00016371482,0.00003343758,6.672752e-7],"about_ca_topic_score_codex":0.0077608004,"about_ca_topic_score_gemma":0.008790843,"teacher_disagreement_score":0.0077608004,"about_ca_system_score_codex":0.00084478845,"about_ca_system_score_gemma":0.000757773,"threshold_uncertainty_score":0.015431225},"labels":[],"label_agreement":null},{"id":"W6903036975","doi":"10.1016/j.comcom.2025.108275","title":"Dynamic Split Federated Learning for resource-constrained IoT systems","year":2025,"lang":"en","type":"article","venue":"Computer Communications","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Architecture; Metadata; Server; Process (computing); Federated learning; Internet of Things; Aggregate (composite); Resource (disambiguation); Task (project management)","score_opus":0.03732138526178992,"score_gpt":0.3051612359449662,"score_spread":0.2678398506831763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6903036975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06717888,0.00014687628,0.92914015,0.0002367193,0.00003587039,0.0000642299,0.000050075418,0.0012142754,0.0019329678],"genre_scores_gemma":[0.90327436,0.000062881896,0.09496948,0.00013718895,0.000011392019,0.00008250777,0.00011027091,0.000044641984,0.0013072068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932027,0.000153012,0.00004051264,0.00019888546,0.00015428416,0.00013303767],"domain_scores_gemma":[0.99923337,0.00023767378,0.00006751768,0.00021685979,0.00017270536,0.00007181841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012775218,0.0005283414,0.00065292534,0.0003649399,0.0006124314,0.0010808005,0.001546086,0.0008052687,0.0011536622],"category_scores_gemma":[0.001998286,0.00022600449,0.0004958471,0.0004482109,0.00078007235,0.0016319419,0.0015080658,0.0009935475,0.00023942374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021031701,0.00019915377,0.00205225,0.000047172885,0.00004853441,0.00017390208,0.000107519765,0.88015497,0.0061470647,0.012476781,0.0012770077,0.09710533],"study_design_scores_gemma":[0.000005171558,0.00002247485,0.0001106158,0.0000024205985,0.0000032520752,0.00001749737,0.000012011108,0.9932821,0.0011155617,0.005156653,0.000269159,0.0000031472077],"about_ca_topic_score_codex":0.0031309417,"about_ca_topic_score_gemma":0.0032859475,"teacher_disagreement_score":0.0031309417,"about_ca_system_score_codex":0.0009820473,"about_ca_system_score_gemma":0.0011432307,"threshold_uncertainty_score":0.0071252584},"labels":[],"label_agreement":null},{"id":"W93607114","doi":"10.1016/s0140-3664(99)00230-3","title":"Mobile Software Agents for Telecommunication Applications","year":2000,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Telecommunications; Software; Computer network; Operating system","score_opus":0.03112621849169535,"score_gpt":0.2868613329005219,"score_spread":0.25573511440882657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W93607114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014927902,0.032713458,0.787626,0.006121718,0.0043053017,0.00042082294,0.0005696589,0.0062245466,0.14709058],"genre_scores_gemma":[0.20414771,0.027548555,0.5679778,0.0018064267,0.0022903725,0.0007888402,0.0024168915,0.0012914777,0.19173191],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995565,0.00012824511,0.000032405133,0.000049494836,0.00019372469,0.000039588882],"domain_scores_gemma":[0.9992125,0.00026530342,0.00007494754,0.00012711006,0.0002396476,0.00008052638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045660528,0.0008059082,0.00072636537,0.0008464238,0.0007541264,0.002841807,0.0010059745,0.0019097676,0.015808105],"category_scores_gemma":[0.0018492258,0.00034244554,0.0003325415,0.0013601468,0.00057151256,0.0026060517,0.001179665,0.0016769057,0.008681187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018432128,0.00020405094,0.00046966792,0.0009705896,0.00006384277,0.0003871815,0.0004875151,0.005451962,0.015157262,0.33293787,0.10360698,0.5400788],"study_design_scores_gemma":[0.00006992357,0.00013801246,0.00033345402,0.00035230414,0.0000795961,0.00045256293,0.0001528428,0.03409443,0.00517798,0.11252934,0.84659356,0.000026033018],"about_ca_topic_score_codex":0.00073702674,"about_ca_topic_score_gemma":0.00096986885,"teacher_disagreement_score":0.015808105,"about_ca_system_score_codex":0.0004738401,"about_ca_system_score_gemma":0.00073508965,"threshold_uncertainty_score":0.052883387},"labels":[],"label_agreement":null}]}