{"meta":{"query_hash":"d5c1bdad51d5","filters":{"venue":"Computer Networks"},"cohort_total":199,"direct_labels_cover":0,"predictions_cover":199,"exported":199,"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/d5c1bdad51d5","api":"https://metacan.xera.ac/api/v1/cohort?venue=Computer+Networks"},"results":[{"id":"W1965491280","doi":"10.1016/s1389-1286(03)00287-1","title":"Ecological interface design: a new approach for visualizing network management","year":2003,"lang":"en","type":"article","venue":"Computer Networks","topic":"Human-Automation Interaction and Safety","field":"Psychology","cited_by":48,"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; Network management; Interface (matter); Node (physics); Adaptation (eye); Key (lock); Visualization; Network monitoring; Network management station; Graphical user interface; User interface; Domain (mathematical analysis); Human–computer interaction; Network architecture; Data mining; Computer network; Operating system","score_opus":0.07964716269740527,"score_gpt":0.37372792562151996,"score_spread":0.29408076292411467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965491280","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009228315,0.00019275084,0.9470468,0.00007140675,0.003513415,0.00075987837,3.7422174e-7,0.00023740287,0.04808566],"genre_scores_gemma":[0.29049784,0.000021712362,0.68095934,0.003674581,0.0027889113,0.00035287955,0.00003637838,0.000066698834,0.021601662],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819505,0.00036037376,0.00039040748,0.00047815323,0.000090588816,0.0004854174],"domain_scores_gemma":[0.99907357,0.0002907303,0.00012637468,0.00032823044,0.00003912711,0.00014198963],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00056886807,0.00020441624,0.0002496006,0.000059594055,0.000186907,0.00010168491,0.00024578365,0.00016996854,0.002399623],"category_scores_gemma":[0.000006574073,0.00019228455,0.00013684906,0.00018110953,0.000028161949,0.000065979555,0.00006777814,0.00021818867,0.0002488722],"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.00007763202,0.00015679377,0.000058701266,0.000008115379,0.00015331921,0.0000053369185,0.0003214806,0.34671906,1.8056204e-7,0.07033367,0.5497038,0.03246195],"study_design_scores_gemma":[0.0012460396,0.00016763771,0.0011215127,0.00002421555,0.000034028264,0.000033055414,0.00009515524,0.6262476,0.0000015169683,0.0011315184,0.36963117,0.0002665737],"about_ca_topic_score_codex":0.0000013923972,"about_ca_topic_score_gemma":6.7275715e-7,"teacher_disagreement_score":0.29040554,"about_ca_system_score_codex":0.00006201997,"about_ca_system_score_gemma":0.000011316636,"threshold_uncertainty_score":0.9985123},"labels":[],"label_agreement":null},{"id":"W1968273866","doi":"10.1016/s1389-1286(00)00011-6","title":"A hybrid model for specifying features and detecting interactions","year":2000,"lang":"en","type":"article","venue":"Computer Networks","topic":"Software Engineering Research","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":"University of Waterloo","funders":"","keywords":"Computer science; Artificial intelligence; Theoretical computer science","score_opus":0.02483886119907776,"score_gpt":0.2698903878882503,"score_spread":0.24505152668917254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968273866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023662616,0.0003069734,0.9749146,0.00013637112,0.00039059352,0.0001724532,7.689365e-7,0.0003502618,0.0000653441],"genre_scores_gemma":[0.7049814,0.000025826805,0.2938889,0.0001543497,0.0005545743,0.000028861594,0.0000015854922,0.00001655474,0.00034797212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990384,0.000018022596,0.0001300853,0.00035955178,0.000108488755,0.00034544547],"domain_scores_gemma":[0.9987968,0.00070572697,0.000021094815,0.00033238792,0.000043353168,0.00010061467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016742648,0.00012336313,0.00012273763,0.00008041313,0.00018288077,0.00031887484,0.00043080392,0.000032703574,0.000006495294],"category_scores_gemma":[0.000025216666,0.00012558664,0.00005189143,0.00013515359,0.000019337473,0.0002992949,0.00019313514,0.00026374307,0.000004830559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044100025,0.000007700497,0.00007982173,0.0000071955114,0.000010270512,0.0000046946952,0.00014814398,0.532308,0.0000042647616,0.00025682675,0.0037387116,0.46342996],"study_design_scores_gemma":[0.00017762432,0.000027880502,0.0010453775,0.00003626833,0.0000022663255,0.00010717673,6.724013e-7,0.99637425,0.000028347926,0.00059001846,0.0014754969,0.00013464279],"about_ca_topic_score_codex":0.0000033037466,"about_ca_topic_score_gemma":0.0000022477032,"teacher_disagreement_score":0.68131876,"about_ca_system_score_codex":0.00003383896,"about_ca_system_score_gemma":0.000014787647,"threshold_uncertainty_score":0.51212746},"labels":[],"label_agreement":null},{"id":"W1973097078","doi":"10.1016/s1389-1286(03)00247-0","title":"The formal semantics of SDL-2000: Status and perspectives","year":2003,"lang":"en","type":"article","venue":"Computer Networks","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Programming language; Compiler; Formal semantics (linguistics); Operational semantics; Semantics (computer science); Abstract machine; Unified Modeling Language; Formalism (music); Action semantics; Abstract state machines; Denotational semantics; Finite-state machine; Software","score_opus":0.019831019594329848,"score_gpt":0.25259292670944733,"score_spread":0.2327619071151175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973097078","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0084919715,0.0015794544,0.9882357,0.0000812654,0.0006156111,0.00011315044,2.1184347e-7,0.000046277066,0.0008363262],"genre_scores_gemma":[0.45440736,0.00029669472,0.5451287,0.00005049043,0.00007256376,0.0000035089229,2.4366196e-7,0.0000056827816,0.000034786044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896747,0.00016243108,0.00019914568,0.0002092652,0.00013711439,0.00032456312],"domain_scores_gemma":[0.99909127,0.0001796776,0.00011144671,0.00047552522,0.00007867181,0.00006339324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006019835,0.000100941295,0.00011642932,0.000028349443,0.00019977834,0.00011981288,0.00039861456,0.000052711304,0.0000021969395],"category_scores_gemma":[0.000032898388,0.00007515479,0.00003558492,0.0002482231,0.0001453461,0.00035787042,0.00024495512,0.00014299426,0.0000018777897],"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.0000054746974,0.00002666399,0.0019016351,0.00000706838,0.000019239065,0.0000010719482,0.0021925431,0.008449438,0.0000041595854,0.7606433,0.00052184105,0.22622754],"study_design_scores_gemma":[0.00017832646,0.00009378573,0.013694153,0.000011433983,0.00000456615,0.000017005084,0.000063315776,0.9737156,0.00008578575,0.0035882525,0.008431747,0.00011603218],"about_ca_topic_score_codex":0.000004295122,"about_ca_topic_score_gemma":0.0000023530242,"teacher_disagreement_score":0.96526617,"about_ca_system_score_codex":0.000029533956,"about_ca_system_score_gemma":0.00003446181,"threshold_uncertainty_score":0.30647236},"labels":[],"label_agreement":null},{"id":"W1973200519","doi":"10.1016/j.comnet.2005.10.009","title":"Uplink UMTS network design—an integrated approach","year":2005,"lang":"en","type":"article","venue":"Computer Networks","topic":"Wireless Communication Networks Research","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; Mathematical optimization; Telecommunications link; Heuristic; UMTS frequency bands; Set (abstract data type); Point (geometry); Cellular network; Network planning and design; Telecommunications; Mathematics; Artificial intelligence","score_opus":0.046999706054341214,"score_gpt":0.279704898206279,"score_spread":0.23270519215193775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973200519","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015069848,0.0014170432,0.994425,0.0008569624,0.00063656,0.0005651235,3.3345358e-7,0.0010241597,0.0009241475],"genre_scores_gemma":[0.18604648,0.00018441895,0.80935913,0.0012419525,0.0027820668,0.000081706225,0.000050335013,0.00005049109,0.00020343692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995563,0.0010562884,0.00063356647,0.0009978,0.0005121794,0.0012371897],"domain_scores_gemma":[0.9954901,0.0004444638,0.00015857664,0.0030990334,0.00031298414,0.00049485645],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001696405,0.00043331165,0.0004510754,0.00017072118,0.00051306054,0.00089872954,0.005755209,0.00031874733,0.00003073366],"category_scores_gemma":[0.000011906609,0.00040676474,0.00014012262,0.0016973646,0.00015295415,0.0012330133,0.0018607823,0.0011722095,0.00014173708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009876043,0.00012065527,0.000041452357,0.0000022588783,0.00002411317,0.0000038329113,0.000112226684,0.61550254,8.2717855e-7,0.007984614,0.025435578,0.35076204],"study_design_scores_gemma":[0.0004192873,0.00012677198,0.00037057104,0.000039932216,0.0000054236107,0.0000485715,0.0000031492789,0.9697036,0.0000070388246,0.00039823283,0.028433288,0.00044414354],"about_ca_topic_score_codex":0.00001388745,"about_ca_topic_score_gemma":0.000010574874,"teacher_disagreement_score":0.35420108,"about_ca_system_score_codex":0.00016634552,"about_ca_system_score_gemma":0.0001516844,"threshold_uncertainty_score":0.9998384},"labels":[],"label_agreement":null},{"id":"W1973953001","doi":"10.1016/j.comnet.2009.05.019","title":"The joint Gateway Placement and Spatial Reuse Problem in Wireless Mesh Networks","year":2009,"lang":"en","type":"article","venue":"Computer Networks","topic":"Mobile Ad Hoc Networks","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Wireless mesh network; Joint (building); Reuse; Computer network; Gateway (web page); Mesh networking; Default gateway; Wireless; Switched mesh; Distributed computing; Wireless network; Telecommunications; World Wide Web","score_opus":0.009909803166587164,"score_gpt":0.21106855384679976,"score_spread":0.2011587506802126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973953001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040038354,0.0009330665,0.99035555,0.0018956698,0.0012811009,0.0008556245,2.9151664e-7,0.00025744212,0.00041740207],"genre_scores_gemma":[0.97156143,0.0009527146,0.024099221,0.0017360904,0.0014488286,0.00007712302,0.0000074028535,0.000029339704,0.000087849985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964936,0.00032237568,0.0007607551,0.00093518273,0.00038200538,0.0011061108],"domain_scores_gemma":[0.9973372,0.00032463044,0.00025101993,0.0017439188,0.000084062776,0.00025911778],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011299553,0.00043264363,0.00045484988,0.00009182099,0.00039770274,0.0007860791,0.0020449401,0.00023922833,0.000004616117],"category_scores_gemma":[0.000007979839,0.00033698863,0.000100052326,0.00061287096,0.00013203258,0.00034841357,0.001427144,0.0008066111,0.0000071768695],"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.000035689918,0.00009797823,0.0004181761,0.000005497036,0.000025445475,0.000075859556,0.0003535804,0.36386725,0.0000035065686,0.022774693,0.018227244,0.5941151],"study_design_scores_gemma":[0.000817737,0.0003072933,0.00637115,0.00014982474,0.0000069116372,0.00004031049,0.0000050130425,0.98757714,0.0000078884395,0.0021357448,0.0021813214,0.000399666],"about_ca_topic_score_codex":0.000040720075,"about_ca_topic_score_gemma":0.00013538271,"teacher_disagreement_score":0.9675576,"about_ca_system_score_codex":0.00012052282,"about_ca_system_score_gemma":0.00005271107,"threshold_uncertainty_score":0.9999082},"labels":[],"label_agreement":null},{"id":"W1974669774","doi":"10.1016/j.comnet.2010.04.013","title":"Techno-economic analysis of EPON and WiMAX for future Fiber-Wireless (FiWi) networks","year":2010,"lang":"en","type":"article","venue":"Computer Networks","topic":"Advanced Photonic Communication Systems","field":"Engineering","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; WiMAX; Wireless; Computer network; Telecommunications; Wireless network; Fiber; Chemistry","score_opus":0.004226652558350937,"score_gpt":0.2105366872694173,"score_spread":0.20631003471106635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974669774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12848888,0.0012228228,0.8683085,0.000030451516,0.0011820951,0.00031921064,0.0000129068185,0.00022679106,0.0002083383],"genre_scores_gemma":[0.9796487,0.00020148286,0.019213626,0.000020665955,0.0007322788,0.000056354787,0.000060089624,0.000039824437,0.000026978738],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911016,0.000016037946,0.00037379187,0.00021795368,0.000049147555,0.00023289958],"domain_scores_gemma":[0.9987907,0.00020673766,0.00011353088,0.0007755053,0.00004236981,0.00007119273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017786524,0.00017882425,0.00043408404,0.00014656658,0.000061300554,0.000034559536,0.00035777714,0.00022093917,0.000024849554],"category_scores_gemma":[0.000001224949,0.00019001114,0.0001315309,0.0003053358,0.000053991622,0.00008374796,0.00012007179,0.00034577868,0.000001502642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005193729,0.0000056890635,0.0004428919,0.000017999273,0.000291757,2.2632686e-7,0.000055459182,0.9106268,0.000042248485,0.0005642772,0.000472164,0.08747524],"study_design_scores_gemma":[0.00022668275,0.00001418705,0.0015091737,0.000017446338,0.00011942254,0.0000041835738,0.0000110136925,0.9802883,0.000040304174,0.000041893345,0.017545281,0.00018207631],"about_ca_topic_score_codex":0.000011149891,"about_ca_topic_score_gemma":0.000114640316,"teacher_disagreement_score":0.8511598,"about_ca_system_score_codex":0.000033157077,"about_ca_system_score_gemma":0.000007349381,"threshold_uncertainty_score":0.7748429},"labels":[],"label_agreement":null},{"id":"W1975006608","doi":"10.1016/s1389-1286(99)00117-6","title":"A hop-by-hop flow controller for a virtual path","year":2000,"lang":"en","type":"article","venue":"Computer Networks","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":"Queen's University; University of Ottawa","funders":"","keywords":"Computer science; Hop (telecommunications); Computer network; Controller (irrigation); Flow control (data); Path (computing); Control theory (sociology); Real-time computing; Control (management)","score_opus":0.0055990812735166,"score_gpt":0.19458985343862506,"score_spread":0.18899077216510846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975006608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008016718,0.0010865479,0.9939054,0.0011031113,0.0014740515,0.00061362,0.000008796762,0.0005390362,0.0004677353],"genre_scores_gemma":[0.8982965,0.00019866087,0.08210899,0.010468446,0.004488037,0.00033165203,0.000047182693,0.00006178723,0.0039987853],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977279,0.000118475575,0.0004186105,0.0007456756,0.00025133183,0.00073804427],"domain_scores_gemma":[0.9985492,0.00041626548,0.000094920964,0.0005817099,0.00010022447,0.0002576776],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032831635,0.00033527458,0.000446043,0.000051166186,0.00026673585,0.00037777607,0.0011207596,0.00019089133,0.00010593366],"category_scores_gemma":[0.0000051242614,0.00030864764,0.0002501784,0.00030524135,0.0000632954,0.00032199177,0.000115730305,0.00026364427,0.00011670812],"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.00005855238,0.000059077094,0.000008870959,0.0000017024886,0.000043830332,0.0000058510577,0.00006806759,0.13610175,0.0000013980118,0.003347863,0.17489499,0.68540806],"study_design_scores_gemma":[0.0024882932,0.00029081872,0.000035261026,0.000028811553,0.000015521671,0.000014044175,0.0000015181353,0.832835,9.731033e-7,0.0003558418,0.16361934,0.00031457326],"about_ca_topic_score_codex":0.0000026904356,"about_ca_topic_score_gemma":0.0000020712532,"teacher_disagreement_score":0.91179645,"about_ca_system_score_codex":0.000036867474,"about_ca_system_score_gemma":0.000043475648,"threshold_uncertainty_score":0.9999366},"labels":[],"label_agreement":null},{"id":"W1979964445","doi":"10.1016/j.comnet.2004.03.024","title":"Directions in feature interaction research","year":2004,"lang":"en","type":"article","venue":"Computer Networks","topic":"Service-Oriented Architecture and Web Services","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":"Université du Québec en Outaouais; University of Ottawa","funders":"","keywords":"Computer science; Service (business); Session (web analytics); Point (geometry); Extension (predicate logic); Feature (linguistics); Service discovery; Human–computer interaction; Distributed computing; Web service; World Wide Web","score_opus":0.02376261468279348,"score_gpt":0.303484092662271,"score_spread":0.2797214779794775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979964445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015398254,0.00081714196,0.97241133,0.0051437328,0.002620567,0.0002255947,3.3095893e-7,0.00029361085,0.003089454],"genre_scores_gemma":[0.95189834,0.00009157324,0.044818863,0.0017956545,0.0012734435,0.00003221474,0.000009179499,0.000016204758,0.00006452526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984476,0.00015099248,0.00017419926,0.00048757406,0.00026922507,0.00047039415],"domain_scores_gemma":[0.99900866,0.00016421756,0.000041618543,0.0005677065,0.000115388895,0.00010240363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037008637,0.00014150463,0.00014403579,0.00038195032,0.00021019341,0.00025081888,0.000927903,0.00012232573,0.0000045523543],"category_scores_gemma":[0.0000024386416,0.0001297937,0.000057135505,0.0018088324,0.000029880708,0.00046220457,0.0005142196,0.0008599355,0.00005049495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002740864,0.00031967126,0.001409903,0.00002489202,0.000034091812,0.00013356663,0.0053952644,0.555036,0.00003549001,0.07616894,0.003872028,0.35754272],"study_design_scores_gemma":[0.0012861491,0.0002982098,0.022699157,0.00046320973,0.0000045838124,0.00015246066,0.00012468034,0.8313205,0.00031445405,0.018496031,0.12433697,0.0005035917],"about_ca_topic_score_codex":0.00028156285,"about_ca_topic_score_gemma":0.0010420943,"teacher_disagreement_score":0.9365001,"about_ca_system_score_codex":0.00011495029,"about_ca_system_score_gemma":0.000046202847,"threshold_uncertainty_score":0.52928334},"labels":[],"label_agreement":null},{"id":"W1980643693","doi":"10.1016/j.bjp.2013.12.019","title":"Popularity decays in peer-to-peer VoD systems: Impact, model, and design implications","year":2014,"lang":"en","type":"article","venue":"Computer Networks","topic":"Peer-to-Peer Network Technologies","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":"Simon Fraser University","funders":"","keywords":"Computer science; Upload; Popularity; Scalability; Peer-to-peer; Overlay; Replication (statistics); Population; Distributed computing; Scheduling (production processes); Computer network; World Wide Web; Database; Operating system","score_opus":0.03206279066061902,"score_gpt":0.2779245698085747,"score_spread":0.2458617791479557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980643693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015000562,0.00025828287,0.97565705,0.0064856973,0.00059613265,0.0008812136,0.0000045183015,0.00090237206,0.00021420125],"genre_scores_gemma":[0.6872565,0.000008461454,0.3113463,0.00087607984,0.00024788224,0.00012737272,0.000008364192,0.000028646173,0.0001004007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965296,0.00023943496,0.0005728957,0.0011166297,0.0005220801,0.0010193933],"domain_scores_gemma":[0.99680215,0.00034002552,0.00013182042,0.0018613066,0.00041420764,0.0004504643],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017248229,0.00044394538,0.00056849845,0.00048032028,0.00021682151,0.0007406907,0.0024157534,0.00032195274,7.59717e-7],"category_scores_gemma":[0.00012730817,0.0004248049,0.00008840336,0.001472829,0.000066905835,0.0004638806,0.0018683813,0.0005353574,0.00003517978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000711651,0.000044058877,0.0032715716,0.000006799566,0.000016823089,0.0000053606755,0.00018269931,0.8725551,0.000011850502,0.019036124,0.04868871,0.05617383],"study_design_scores_gemma":[0.00029837992,0.00019572368,0.021224745,0.000076120894,0.0000080664195,0.00005092089,0.000003498236,0.9671375,0.0000062640124,0.0075737513,0.0029483957,0.00047661914],"about_ca_topic_score_codex":0.00009631556,"about_ca_topic_score_gemma":0.00006538369,"teacher_disagreement_score":0.67225593,"about_ca_system_score_codex":0.0002201243,"about_ca_system_score_gemma":0.00007041287,"threshold_uncertainty_score":0.99982035},"labels":[],"label_agreement":null},{"id":"W1981422981","doi":"10.1016/j.comnet.2009.09.014","title":"Agile bandwidth management techniques in slotted all-optical packet switched networks","year":2009,"lang":"en","type":"article","venue":"Computer Networks","topic":"Advanced Optical Network Technologies","field":"Engineering","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":"University of Ottawa","funders":"Luonnontieteiden ja Tekniikan Tutkimuksen Toimikunta; Natural Sciences and Engineering Research Council of Canada; Sahand University of Technology","keywords":"Computer science; Computer network; Optical switch; Network packet; Quality of service; Star network; Packet switching; Telecommunications link; Scheduling (production processes); Edge device; Network topology; Distributed computing; Topology (electrical circuits); Electronic engineering; Ring network","score_opus":0.007456798442319953,"score_gpt":0.21874313530421835,"score_spread":0.2112863368618984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981422981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062605427,0.0010116793,0.98251647,0.00027343916,0.00049120747,0.00053142477,5.6119666e-7,0.0038231658,0.0050915293],"genre_scores_gemma":[0.7455619,0.0011126201,0.25184053,0.0007659438,0.00054940087,0.00005215997,0.000028727187,0.00006152909,0.000027210652],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978149,0.000028122398,0.0005116816,0.00047868348,0.00018660023,0.0009800019],"domain_scores_gemma":[0.9990397,0.00011805627,0.00004135946,0.0006333844,0.000028297127,0.00013921395],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001908247,0.00042823664,0.00047176465,0.00018635008,0.00004736063,0.00008294214,0.0005616987,0.00041947528,0.000015207585],"category_scores_gemma":[0.000005459237,0.0004303074,0.00009937611,0.0006795431,0.000083988125,0.00017507246,0.00021236042,0.0008612507,0.000015458585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014090937,0.000045668094,0.00012850271,0.000009867241,0.000034431905,0.00012221534,0.0000099544495,0.603312,0.0000119649685,0.0031224787,0.008158808,0.38503003],"study_design_scores_gemma":[0.00041765557,0.00012921264,0.004451239,0.0001622502,0.00002051154,0.000012596679,0.0000058192127,0.98400265,0.00008656494,0.0036076854,0.0065793893,0.00052443217],"about_ca_topic_score_codex":4.7989596e-7,"about_ca_topic_score_gemma":0.0000045601046,"teacher_disagreement_score":0.7393013,"about_ca_system_score_codex":0.00015802868,"about_ca_system_score_gemma":0.0000028458746,"threshold_uncertainty_score":0.99981487},"labels":[],"label_agreement":null},{"id":"W1982207285","doi":"10.1016/j.comnet.2009.10.008","title":"Bounds estimation and practical stability of AIMD/RED systems with time delays","year":2009,"lang":"en","type":"article","venue":"Computer Networks","topic":"Network Traffic and Congestion Control","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":"University of Victoria; University of Waterloo","funders":"","keywords":"Computer science; Bottleneck; Queue; Active queue management; Network congestion; Correctness; Flow control (data); Control theory (sociology); Queueing theory; Stability (learning theory); Queue management system; Random early detection; Real-time computing; Algorithm; Computer network; Control (management)","score_opus":0.00916971372091485,"score_gpt":0.21660174497381735,"score_spread":0.2074320312529025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982207285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010313817,0.00030927296,0.9873062,0.000992343,0.00025096402,0.0002601551,5.1824526e-7,0.00017423953,0.0003925039],"genre_scores_gemma":[0.93468636,0.000009399277,0.06483087,0.00022955009,0.00020863554,0.000006451496,0.000004367615,0.0000057316465,0.000018608896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986878,0.00013954788,0.00030760394,0.0003794233,0.000223811,0.0002618237],"domain_scores_gemma":[0.9988678,0.000261524,0.00016321652,0.00044930697,0.00012913924,0.00012897768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003765114,0.00016323937,0.00028796558,0.000042702657,0.000094512616,0.00021195655,0.00022339111,0.00009547606,0.000004898775],"category_scores_gemma":[0.000007993553,0.0001349734,0.000034522225,0.00025502348,0.00007692785,0.0004192943,0.0000589765,0.00017772216,0.000004711997],"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.000076339944,0.00014150214,0.0004408301,0.000015469084,0.000043067936,0.000026453507,0.0001412229,0.30482507,0.0000075512685,0.020701706,0.003126149,0.6704546],"study_design_scores_gemma":[0.00050584215,0.00043578728,0.0022648084,0.000056458437,0.00001769314,0.00010170996,0.000001917573,0.9958226,0.0000032668645,0.0002758592,0.00036289275,0.00015118481],"about_ca_topic_score_codex":0.0000025686238,"about_ca_topic_score_gemma":9.216082e-7,"teacher_disagreement_score":0.92437255,"about_ca_system_score_codex":0.000025066756,"about_ca_system_score_gemma":0.000053653584,"threshold_uncertainty_score":0.5504055},"labels":[],"label_agreement":null},{"id":"W1990376256","doi":"10.1016/j.comnet.2010.12.027","title":"QoS capacity of virtual wireless networks","year":2011,"lang":"en","type":"article","venue":"Computer Networks","topic":"Cognitive Radio Networks and Spectrum Sensing","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":"University of Waterloo","funders":"Korea Science and Engineering Foundation","keywords":"Computer science; Cognitive radio; Computer network; Quality of service; Wireless; Wireless network; Markov chain; Service provider; Radio resource management; Service (business); Distributed computing; Telecommunications","score_opus":0.02561916448884732,"score_gpt":0.20460074117725663,"score_spread":0.1789815766884093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990376256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045664,0.00023166685,0.9484652,0.00003146971,0.0030510863,0.00019220711,8.465808e-7,0.00024884465,0.0021146273],"genre_scores_gemma":[0.9597344,0.0000789331,0.037999485,0.00041168038,0.0017131128,0.0000044065673,0.0000035996534,0.000027247053,0.000027128377],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766093,0.00018355511,0.0005313921,0.00065192697,0.00027105835,0.0007011245],"domain_scores_gemma":[0.9982894,0.00020884312,0.00026083065,0.00083687244,0.00018336288,0.00022065495],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038738415,0.0003322861,0.00050460367,0.00012616673,0.00017089098,0.00010222889,0.0011067421,0.0002068247,0.000026000656],"category_scores_gemma":[0.0000047356452,0.00032341547,0.00021748271,0.00068540627,0.00019681879,0.00039610665,0.00057615724,0.00047478487,0.000009665545],"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.0000529072,0.00030850558,0.003280835,0.000013799267,0.0001910417,0.00013049447,0.0016113361,0.08343626,0.000028375156,0.13936326,0.005271375,0.7663118],"study_design_scores_gemma":[0.00038904857,0.00025743106,0.008393824,0.00009727396,0.000015962183,0.000060591618,0.000006506319,0.98922646,0.0001408648,0.0007241118,0.00031819937,0.00036973297],"about_ca_topic_score_codex":0.000056172492,"about_ca_topic_score_gemma":0.00002624061,"teacher_disagreement_score":0.9140704,"about_ca_system_score_codex":0.000042959768,"about_ca_system_score_gemma":0.000034275665,"threshold_uncertainty_score":0.9999218},"labels":[],"label_agreement":null},{"id":"W1992839726","doi":"10.1016/s1389-1286(00)00009-8","title":"Feature interaction detection: a LOTOS-based approach","year":2000,"lang":"en","type":"article","venue":"Computer Networks","topic":"Formal Methods in Verification","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 Ottawa","funders":"","keywords":"Computer science; Feature (linguistics); TRACE (psycholinguistics); State (computer science); Transition (genetics); Sequence (biology); Space (punctuation); Feature vector; State space; Transition system; Theoretical computer science; Programming language; Data mining; Artificial intelligence","score_opus":0.0169784077909192,"score_gpt":0.2535766569219098,"score_spread":0.2365982491309906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992839726","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001040669,0.00009434474,0.9935478,0.0001909476,0.0014663159,0.00021735429,2.377534e-7,0.00049377134,0.0029485663],"genre_scores_gemma":[0.21451227,0.0000088484,0.783545,0.00081359415,0.00082775456,0.000039615323,0.0000074530485,0.0000140646,0.00023135928],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867237,0.0001895815,0.00017397956,0.00048196403,0.00019295601,0.0002891395],"domain_scores_gemma":[0.9989496,0.000058727495,0.00008410157,0.0007540024,0.000061181556,0.000092373695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003133573,0.00017865995,0.00015457979,0.00008874618,0.00017045205,0.00026687083,0.0007630072,0.00015927284,0.00003168831],"category_scores_gemma":[0.000004392403,0.00017280382,0.000093025694,0.00059937243,0.00003719334,0.00058683794,0.00008063404,0.00040396545,0.00007336323],"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.000017591468,0.000045823974,0.000018000943,0.000006612162,0.000007672564,0.0000023167581,0.000054591073,0.2750215,0.000008254986,0.0010316086,0.0018202309,0.7219658],"study_design_scores_gemma":[0.00022114643,0.00008980213,0.00081250275,0.000018475288,0.0000041415237,0.000051400642,0.0000012908484,0.9510481,0.000261739,0.000092996765,0.0472158,0.0001826295],"about_ca_topic_score_codex":0.0000034348845,"about_ca_topic_score_gemma":9.089758e-7,"teacher_disagreement_score":0.72178316,"about_ca_system_score_codex":0.00007401507,"about_ca_system_score_gemma":0.000019361149,"threshold_uncertainty_score":0.70467347},"labels":[],"label_agreement":null},{"id":"W1993588702","doi":"10.1016/s1389-1286(00)00198-5","title":"MSC and SDL in project life cycles","year":2001,"lang":"en","type":"article","venue":"Computer Networks","topic":"BIM and Construction Integration","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":"Université de Montréal","funders":"","keywords":"Computer science","score_opus":0.009946228646182725,"score_gpt":0.2016596295578581,"score_spread":0.19171340091167538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993588702","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4479777,0.0016326645,0.5459041,0.000059063925,0.001104796,0.00011978282,3.660924e-7,0.00026110897,0.0029403907],"genre_scores_gemma":[0.9973871,0.00028127423,0.0017305706,0.00008300119,0.0004791408,0.000007525153,0.000002790317,0.000008158041,0.00002043354],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969757,0.000008994909,0.000091521724,0.00007688919,0.000027714521,0.0000973056],"domain_scores_gemma":[0.99988824,0.000013641447,0.000006987854,0.0000593181,0.0000072461203,0.000024557365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000029243383,0.00006050104,0.00006603217,0.000048708862,0.000016403992,0.000033263674,0.00003398167,0.000053716354,0.000009454044],"category_scores_gemma":[7.999959e-7,0.00005804194,0.000011884976,0.00011002546,0.000013809138,0.0000633263,0.000012287688,0.00010201301,0.000003572591],"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.0000067098867,0.000008478308,0.027459573,0.000012833732,0.00001561402,0.000009456735,0.00018740726,0.22534631,0.000008525635,0.0016214886,0.011445391,0.7338782],"study_design_scores_gemma":[0.00014164673,0.000008193237,0.01552485,0.000023800874,0.000001627971,0.000023069057,0.0000103541515,0.97418875,0.0000032455748,0.00011667867,0.009884741,0.000073030504],"about_ca_topic_score_codex":0.000009562191,"about_ca_topic_score_gemma":0.000033858727,"teacher_disagreement_score":0.7488424,"about_ca_system_score_codex":0.0000102834365,"about_ca_system_score_gemma":0.000004105569,"threshold_uncertainty_score":0.23668815},"labels":[],"label_agreement":null},{"id":"W1994844879","doi":"10.1016/j.comnet.2013.08.023","title":"Joint optimal AF relay assignment and power allocation in wireless cooperative networks","year":2013,"lang":"en","type":"article","venue":"Computer Networks","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Relay; Joint (building); Wireless; Computer network; Power (physics); Telecommunications; Wireless network","score_opus":0.01999029148705226,"score_gpt":0.23507457953705535,"score_spread":0.2150842880500031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994844879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033505816,0.0010442572,0.9621177,0.0015711952,0.0005688934,0.0005748158,1.7982373e-7,0.00014686365,0.00047031336],"genre_scores_gemma":[0.97213584,0.0010761962,0.024823394,0.0015046333,0.00019637977,0.00012369883,0.000011093822,0.000020561387,0.00010821602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977557,0.00040854007,0.0005127892,0.00062376144,0.00019822952,0.00050097954],"domain_scores_gemma":[0.998451,0.00020354023,0.00014256565,0.0008004546,0.00021038599,0.00019207434],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005017742,0.0003022153,0.0003468029,0.0001308279,0.00025706846,0.0005780977,0.0007949532,0.0001583939,0.00005828724],"category_scores_gemma":[0.00000864018,0.00028261897,0.000055370576,0.00060274,0.0001071326,0.00077602797,0.0011206918,0.0005590374,0.000032011336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007848654,0.00015206229,0.0011775981,0.0000046361383,0.000041606483,0.000012096038,0.0011503963,0.7331239,0.00009266888,0.03945781,0.01019387,0.21458548],"study_design_scores_gemma":[0.0005370873,0.00012376442,0.014693967,0.000109942885,0.0000029520218,0.000013966843,0.000019107814,0.98337495,0.000026679154,0.00005031652,0.0007151571,0.00033209662],"about_ca_topic_score_codex":0.000013003522,"about_ca_topic_score_gemma":0.000021118734,"teacher_disagreement_score":0.93863,"about_ca_system_score_codex":0.00012221253,"about_ca_system_score_gemma":0.000041292693,"threshold_uncertainty_score":0.99996257},"labels":[],"label_agreement":null},{"id":"W1995891445","doi":"10.1016/s1389-1286(01)00176-1","title":"A load adaptive mechanism for buffer management","year":2001,"lang":"en","type":"article","venue":"Computer Networks","topic":"Network Traffic and Congestion Control","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":"Nortel (Canada)","funders":"","keywords":"Computer science; Buffer (optical fiber); Mechanism (biology); Distributed computing; Computer network; Telecommunications","score_opus":0.013174040701402493,"score_gpt":0.2110804358120621,"score_spread":0.1979063951106596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995891445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015692842,0.00026951914,0.993005,0.0009510177,0.0020315067,0.00060522585,5.91686e-7,0.00043923318,0.0025409851],"genre_scores_gemma":[0.7055297,0.0001274125,0.28607216,0.0047129607,0.0018457957,0.0002508655,0.0000037485822,0.000026638205,0.0014307041],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835455,0.000050411425,0.00024922716,0.0005734364,0.00024175014,0.0005306255],"domain_scores_gemma":[0.99891317,0.00013132949,0.00008265568,0.0005613359,0.00016701552,0.00014451478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024255601,0.00022638257,0.00022882763,0.00005822024,0.00018032163,0.00019084362,0.0009117617,0.000097666445,0.000010815722],"category_scores_gemma":[0.0000017014041,0.00021540315,0.00014428142,0.00029620464,0.000024855337,0.00022229817,0.00029476726,0.00014000661,0.000047344703],"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.00002156793,0.000031319123,0.0000062881754,0.0000022315019,0.0000488091,0.000029280363,0.000030643776,0.01971104,1.8406558e-7,0.4725497,0.010971897,0.49659702],"study_design_scores_gemma":[0.0010241842,0.00016369524,0.0000897248,0.00003566597,0.000019787087,0.000026630954,0.0000042060246,0.96044517,0.0000013456572,0.018206486,0.019729005,0.0002541039],"about_ca_topic_score_codex":0.0000023248788,"about_ca_topic_score_gemma":0.0000053092376,"teacher_disagreement_score":0.94073415,"about_ca_system_score_codex":0.000073466756,"about_ca_system_score_gemma":0.000023613877,"threshold_uncertainty_score":0.8783886},"labels":[],"label_agreement":null},{"id":"W1996919739","doi":"10.1016/j.comnet.2014.12.015","title":"Router authentication, key management, and adjacency management for securing inter-router control messages","year":2015,"lang":"en","type":"article","venue":"Computer Networks","topic":"Advanced Authentication Protocols Security","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Silicon Valley Community Foundation","keywords":"Computer science; Key management; Computer network; Router; Computer security; Authentication (law); Keying; Scalability; Key (lock); Simple Network Management Protocol; Encryption; Network management; Telecommunications","score_opus":0.018260187287816827,"score_gpt":0.26230369209130366,"score_spread":0.24404350480348683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996919739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020134766,0.00023209698,0.9919328,0.00073810876,0.00083538634,0.0050749388,0.0000030994438,0.00032808728,0.00065415463],"genre_scores_gemma":[0.6024103,0.000028301112,0.3925934,0.0011639614,0.0003376743,0.0027036774,0.000014037368,0.000034691315,0.00071389024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997819,0.00010145035,0.00047228398,0.00082823395,0.00026037486,0.0005186332],"domain_scores_gemma":[0.9982983,0.000094915296,0.00021376822,0.00096677046,0.00018199586,0.00024428542],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005127844,0.00030303863,0.00028476422,0.0001529251,0.00016085598,0.00042709275,0.001119307,0.00008503107,0.000004914404],"category_scores_gemma":[0.000005912578,0.00029640266,0.00008837897,0.0002559561,0.00007066142,0.0007759571,0.00096306275,0.00015301566,0.00002357575],"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.000062817395,0.00023878843,0.0014777031,0.00023989176,0.00031063563,0.000028963575,0.0030375735,0.004574997,0.0000018008844,0.7313553,0.00870725,0.24996427],"study_design_scores_gemma":[0.0029981663,0.000109471715,0.0026047737,0.00014900678,0.000054883876,0.000013888669,0.00003935795,0.87947565,0.000015541991,0.08833332,0.025775084,0.00043087234],"about_ca_topic_score_codex":8.3526373e-7,"about_ca_topic_score_gemma":0.0000014662701,"teacher_disagreement_score":0.87490064,"about_ca_system_score_codex":0.00007808541,"about_ca_system_score_gemma":0.00001057431,"threshold_uncertainty_score":0.9999488},"labels":[],"label_agreement":null},{"id":"W1999382789","doi":"10.1016/j.comnet.2014.10.012","title":"DRIVE: An efficient and robust data dissemination protocol for highway and urban vehicular ad hoc networks","year":2014,"lang":"en","type":"article","venue":"Computer Networks","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":120,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Computer science; Dissemination; Vehicular ad hoc network; Computer network; Robustness (evolution); Wireless ad hoc network; Broadcast radiation; Distributed computing; Intelligent transportation system; Partition (number theory); Protocol (science); Overhead (engineering); Data aggregator; Wireless sensor network; Telecommunications; Wireless","score_opus":0.014751096419857916,"score_gpt":0.24992971234471256,"score_spread":0.23517861592485464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999382789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069267177,0.0008230174,0.96452093,0.000039282848,0.0005491722,0.026627358,0.000009084544,0.00046943768,0.00003502624],"genre_scores_gemma":[0.83251053,0.00019449067,0.10249413,0.00038811375,0.008269818,0.053778693,0.0017967114,0.000490587,0.000076904566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979364,0.00010583632,0.00038123393,0.0007510379,0.00018533862,0.00064014265],"domain_scores_gemma":[0.99829465,0.00024520454,0.0000879184,0.0009949424,0.0000735894,0.00030366943],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006617067,0.000401485,0.0003887793,0.00007471855,0.00020612299,0.00029607955,0.00049116317,0.000287625,0.000004856877],"category_scores_gemma":[0.0000101776295,0.00039285066,0.000046673547,0.0001816814,0.000091697184,0.0002704548,0.0003810435,0.00036297782,0.0000014809463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022695483,0.00003518588,0.00018062485,0.000085878986,0.000038813796,0.000003722088,0.0000619459,0.8696157,0.00000482294,0.00012263977,0.019890048,0.10993797],"study_design_scores_gemma":[0.0010014867,0.00017762418,0.0018980432,0.00022694386,0.00004178281,0.000021735492,0.0000033629135,0.9455705,0.000004185978,0.000019369658,0.050585445,0.0004495137],"about_ca_topic_score_codex":7.236439e-7,"about_ca_topic_score_gemma":0.000012484668,"teacher_disagreement_score":0.86202675,"about_ca_system_score_codex":0.00004501356,"about_ca_system_score_gemma":0.000007792458,"threshold_uncertainty_score":0.99985236},"labels":[],"label_agreement":null},{"id":"W2000074659","doi":"10.1016/j.comnet.2011.09.008","title":"Secure authentication scheme for passive C1G2 RFID tags","year":2011,"lang":"en","type":"article","venue":"Computer Networks","topic":"RFID technology advancements","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mutual authentication; Authentication protocol; Computer security; Authentication (law); Computer network; Replay attack; Challenge-Handshake Authentication Protocol; Protocol (science); Denial-of-service attack; Cryptography; Cryptographic protocol; The Internet","score_opus":0.01399092300302965,"score_gpt":0.194064008768619,"score_spread":0.18007308576558936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000074659","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018180655,0.00024735564,0.9790204,0.00002929377,0.0012022282,0.00028953503,0.0000026961118,0.00066699955,0.00036079032],"genre_scores_gemma":[0.84653276,0.000030017925,0.15277083,0.000091891394,0.00033329247,0.000114803996,0.000030429635,0.000039769366,0.000056177043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935037,0.0000058685173,0.00015573855,0.00017703469,0.000047798825,0.00026320518],"domain_scores_gemma":[0.99956584,0.000022960701,0.000035488985,0.00029298387,0.000042119224,0.000040589548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003909365,0.00013102597,0.00012190573,0.000051472074,0.000047849262,0.000011417379,0.00022835351,0.00015421149,0.000030969957],"category_scores_gemma":[0.0000031413126,0.0001409878,0.00004242602,0.00010957987,0.000032668264,0.00010479396,0.000057314268,0.00015600263,0.000030310963],"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.000078607976,0.0002847432,0.0079453895,0.00028736028,0.0009548898,0.000034299337,0.0024753404,0.16055936,0.0010985158,0.06937104,0.16430496,0.59260553],"study_design_scores_gemma":[0.00035638816,0.000044425535,0.002002944,0.000030121904,0.000014380288,0.0000034882357,0.0000053002846,0.98103946,0.00080102024,0.0032955934,0.012220901,0.00018594826],"about_ca_topic_score_codex":3.9394334e-7,"about_ca_topic_score_gemma":0.0000010725039,"teacher_disagreement_score":0.82835215,"about_ca_system_score_codex":0.000034382672,"about_ca_system_score_gemma":0.0000033455442,"threshold_uncertainty_score":0.57493156},"labels":[],"label_agreement":null},{"id":"W2002089561","doi":"10.1016/j.comnet.2011.06.017","title":"Wireless sensor deployment for collaborative sensing with mobile phones","year":2011,"lang":"en","type":"article","venue":"Computer Networks","topic":"Mobile Crowdsensing and Crowdsourcing","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Wireless sensor network; Wireless; Software deployment; Mobile phone; Participatory sensing; Real-time computing; Mobile device; Computer network; Telecommunications; Data science","score_opus":0.019115117437363858,"score_gpt":0.2128748731184251,"score_spread":0.19375975568106124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002089561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050815836,0.00020066107,0.9466761,0.000037431855,0.000904643,0.00063800334,0.000001894152,0.00041270634,0.00031272438],"genre_scores_gemma":[0.588662,0.000011571965,0.41040996,0.00033580462,0.00043586886,0.000032421496,0.000004455707,0.000034678604,0.00007320468],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822795,0.000094790856,0.0002776187,0.0006566848,0.00018869498,0.00055425183],"domain_scores_gemma":[0.9985037,0.00019385002,0.00016168052,0.0006707327,0.00031151326,0.00015854393],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000250197,0.00029321597,0.00033350868,0.00008148121,0.00032487317,0.00024481825,0.0004295237,0.00010342195,0.0000030001995],"category_scores_gemma":[0.000002421141,0.0002457599,0.00007953596,0.0004745218,0.000094757546,0.00024110803,0.00020428163,0.00016562044,0.0000079778165],"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.00023696851,0.0002778936,0.0007319542,0.00006381921,0.00029592548,0.00025106952,0.014462184,0.13260587,0.00027738285,0.004732805,0.011957751,0.8341064],"study_design_scores_gemma":[0.0007587554,0.0005275812,0.0002873265,0.00014246792,0.000022608021,0.000099746496,0.00014811798,0.9925334,0.00246994,0.00014560806,0.0024177996,0.00044664642],"about_ca_topic_score_codex":0.00002350619,"about_ca_topic_score_gemma":0.00001547633,"teacher_disagreement_score":0.85992754,"about_ca_system_score_codex":0.000045737826,"about_ca_system_score_gemma":0.00006641129,"threshold_uncertainty_score":0.99999946},"labels":[],"label_agreement":null},{"id":"W2004029829","doi":"10.1016/j.comnet.2014.09.017","title":"An energy-efficient distributed in-network caching scheme for green content-centric networks","year":2014,"lang":"en","type":"article","venue":"Computer Networks","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":42,"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":"National Key Research and Development Program of China","keywords":"Computer science; Distributed computing; Content centric networking; Router; Scheme (mathematics); Energy consumption; Computer network; The Internet; Efficient energy use; Nash equilibrium; Convergence (economics); Cache; Mathematical optimization","score_opus":0.017011090724601288,"score_gpt":0.21258665877453414,"score_spread":0.19557556804993287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004029829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014389459,0.0008397424,0.98097414,0.0002366471,0.002721981,0.00033405452,0.000004351255,0.00044095432,0.00005868707],"genre_scores_gemma":[0.980323,0.000024421428,0.014805434,0.0016094854,0.002952283,0.000060584403,0.00014117219,0.00004064832,0.00004294543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963924,0.00037076548,0.0006525097,0.00103964,0.00030815104,0.0012365049],"domain_scores_gemma":[0.99760336,0.0004999388,0.00024268817,0.0011336587,0.00017493873,0.00034540935],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011021281,0.000432503,0.00055294734,0.0001672023,0.00039142897,0.00042491703,0.0017450774,0.00024556395,0.0000020509476],"category_scores_gemma":[0.000018029315,0.00042631576,0.00024594323,0.00082529034,0.000055964563,0.00033935535,0.00051548454,0.00046720548,0.0000036470842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003237438,0.0001400632,0.0027498514,0.000006851886,0.000029188635,0.000012198996,0.00003651247,0.8824218,0.0000064498945,0.019603377,0.0021558802,0.09280543],"study_design_scores_gemma":[0.0013206244,0.0002239001,0.0029135866,0.00011680184,0.000014087853,0.000017206528,0.000003879665,0.9906926,0.00000204567,0.00040729152,0.0037700466,0.00051790004],"about_ca_topic_score_codex":0.0002476645,"about_ca_topic_score_gemma":0.00009364981,"teacher_disagreement_score":0.9661687,"about_ca_system_score_codex":0.00013161985,"about_ca_system_score_gemma":0.000037465248,"threshold_uncertainty_score":0.99981886},"labels":[],"label_agreement":null},{"id":"W2008102628","doi":"10.1016/s1389-1286(02)00356-0","title":"Graphic visualization and animation of LOTOS execution traces","year":2002,"lang":"en","type":"article","venue":"Computer Networks","topic":"Advanced Software Engineering Methodologies","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":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Animation; Computer graphics (images); Visualization; Programming language; Computer animation; Human–computer interaction; Artificial intelligence","score_opus":0.029004029524737174,"score_gpt":0.247902336509187,"score_spread":0.21889830698444981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008102628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007775838,0.0011035508,0.99029183,0.00003070268,0.00037631858,0.00009851024,1.9309651e-7,0.00029682,0.000026256597],"genre_scores_gemma":[0.58350116,0.00022173702,0.41613862,0.000034859582,0.000082390696,0.0000046712576,0.0000015275106,0.000006254952,0.000008764192],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992876,0.00008324038,0.00018284167,0.00021114643,0.000102015154,0.00013316738],"domain_scores_gemma":[0.9993755,0.00023259508,0.00009454019,0.0002145105,0.00005070968,0.000032138978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018834154,0.00009601293,0.00013602548,0.00009921867,0.000046629193,0.000042100848,0.00021629309,0.0000643386,0.0000018606377],"category_scores_gemma":[0.000028094457,0.0000958467,0.000025436486,0.00034797363,0.000040161663,0.00041363688,0.000105511754,0.00007032329,9.915696e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022556997,0.000036361023,0.0004824097,0.00004188552,0.000014291844,0.000002697526,0.0008397964,0.6795415,0.00013350399,0.04600231,0.0005198968,0.27238306],"study_design_scores_gemma":[0.00011420486,0.00007330262,0.0034034965,0.00003091436,0.0000030009094,0.0000092379805,0.0000028851084,0.9935876,0.00017280929,0.0023707608,0.0001335741,0.0000982247],"about_ca_topic_score_codex":7.036689e-7,"about_ca_topic_score_gemma":2.741266e-7,"teacher_disagreement_score":0.5757253,"about_ca_system_score_codex":0.000009726231,"about_ca_system_score_gemma":0.000001775839,"threshold_uncertainty_score":0.39085147},"labels":[],"label_agreement":null},{"id":"W2011639204","doi":"10.1016/j.comnet.2010.06.017","title":"Topology-aware wavelength partitioning for DWDM OBS networks: A novel approach for absolute QoS provisioning","year":2010,"lang":"en","type":"article","venue":"Computer Networks","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":"Université de Montréal","funders":"","keywords":"Computer science; Tabu search; Quality of service; Provisioning; Computer network; Network topology; Integer programming; Linear programming; Wavelength-division multiplexing; Topology (electrical circuits); Optical burst switching; Distributed computing; Algorithm; Wavelength; Optical performance monitoring; Mathematics","score_opus":0.014044711218466257,"score_gpt":0.2295407779054701,"score_spread":0.21549606668700383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011639204","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014598025,0.00035957043,0.9913078,0.000106829786,0.0032900458,0.0013562698,0.000013686258,0.001956894,0.00014911215],"genre_scores_gemma":[0.25149494,0.000039948045,0.74283373,0.00013479455,0.0044581206,0.0007298069,0.00014820333,0.000119306176,0.00004118165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772537,0.000010175299,0.00048729414,0.0005845409,0.00011137103,0.0010812443],"domain_scores_gemma":[0.99847853,0.00058734283,0.00009442237,0.00056528876,0.00013132623,0.00014310297],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002578062,0.00041299345,0.00047518537,0.000088658235,0.0003367249,0.00012556477,0.00052837766,0.00057782145,0.000006059296],"category_scores_gemma":[0.000042862008,0.0004120115,0.00019675097,0.00027152975,0.00017216116,0.00022533236,0.0002114227,0.00087871373,0.000002080504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021838741,0.000039296632,0.000041561798,0.00005893989,0.000061885265,0.0000011214579,0.0000248683,0.8834333,0.00003768521,0.0052496805,0.0074512474,0.103578575],"study_design_scores_gemma":[0.00083243795,0.00012430218,0.00011672876,0.000059430717,0.0000340873,0.00001712629,0.000019188994,0.9852187,0.000021235584,0.0012268788,0.011838132,0.00049174466],"about_ca_topic_score_codex":7.8340156e-7,"about_ca_topic_score_gemma":0.0000067873975,"teacher_disagreement_score":0.25003514,"about_ca_system_score_codex":0.000053525026,"about_ca_system_score_gemma":0.0000145008635,"threshold_uncertainty_score":0.99983317},"labels":[],"label_agreement":null},{"id":"W2012477281","doi":"10.1016/j.comnet.2012.05.006","title":"Network coding for unicast in a WiFi hotspot: Promises, challenges, and testbed implementation","year":2012,"lang":"en","type":"article","venue":"Computer Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","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":"University of Manitoba","funders":"","keywords":"Computer network; Unicast; Computer science; Linear network coding; Multicast; Hotspot (geology); Wireless network; Testbed; Backhaul (telecommunications); Wireless; Network packet; Telecommunications; Base station","score_opus":0.08024926658814768,"score_gpt":0.3134396161311884,"score_spread":0.23319034954304074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012477281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002763642,0.021006715,0.972752,0.0013944621,0.0007013682,0.0008239728,7.9497937e-7,0.0001513332,0.00040575737],"genre_scores_gemma":[0.9085789,0.006877248,0.08240134,0.0008100378,0.0011005156,0.00016379365,0.000019960507,0.000021639338,0.000026601201],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982774,0.00022261136,0.0003730763,0.000372152,0.00011031606,0.0006444171],"domain_scores_gemma":[0.9986373,0.0004269116,0.00013263816,0.0005633135,0.00008113392,0.00015868862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010415782,0.00020726715,0.00026368408,0.000116123105,0.0002261765,0.00014998268,0.0006228401,0.000085737185,0.000004521949],"category_scores_gemma":[0.000010970682,0.0002110096,0.000044899876,0.0004482816,0.00003987954,0.0006401669,0.00065545656,0.00021283029,0.0000024735423],"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.0000120379345,0.000066016626,0.0021488047,0.00001781441,0.000017874063,0.000001104815,0.0014689077,0.002034348,0.000010375827,0.2169182,0.0032387823,0.77406573],"study_design_scores_gemma":[0.0014782012,0.00013031895,0.05619062,0.00015647878,0.000010187436,0.000021202994,0.000040695322,0.90958816,0.000008262282,0.0011736251,0.030780775,0.0004215029],"about_ca_topic_score_codex":0.0000018180435,"about_ca_topic_score_gemma":0.00005283893,"teacher_disagreement_score":0.9075538,"about_ca_system_score_codex":0.000066738896,"about_ca_system_score_gemma":0.000028476334,"threshold_uncertainty_score":0.86047214},"labels":[],"label_agreement":null},{"id":"W2012888313","doi":"10.1016/j.comnet.2010.05.019","title":"Some notes on the history of protocol engineering","year":2010,"lang":"en","type":"article","venue":"Computer Networks","topic":"Formal Methods in Verification","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 Ottawa","funders":"National Physical Laboratory","keywords":"Standardization; Computer science; Conformance testing; Protocol (science); Communications protocol; Software engineering; Telecommunications; Computer network","score_opus":0.026766203610247955,"score_gpt":0.254339065222883,"score_spread":0.22757286161263507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012888313","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00049776543,0.0000135009,0.9896084,0.00012328778,0.003811161,0.005629655,9.3579004e-8,0.00012048018,0.00019563684],"genre_scores_gemma":[0.0354916,9.3322495e-7,0.9552712,0.000589955,0.0013890908,0.007180968,4.519005e-7,0.000016248601,0.000059571863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923915,0.00005176279,0.00019774516,0.00019530971,0.00014793278,0.00016810151],"domain_scores_gemma":[0.9987078,0.00030265687,0.00011332663,0.0007913446,0.00004608748,0.000038796163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052648335,0.000106693515,0.00010775474,0.000049430884,0.00003117778,0.000031036263,0.0010048274,0.000072695926,0.00000732651],"category_scores_gemma":[0.0000473498,0.00007429807,0.000051655832,0.00011754131,0.000052998083,0.00020601277,0.00020118304,0.00036906148,0.000010119057],"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.0000073913156,0.00006290768,0.00006256467,0.000025426341,0.000012054514,0.0000017755184,0.00031251373,0.05954823,0.0009311167,0.77912605,0.0076116812,0.15229832],"study_design_scores_gemma":[0.00008153926,0.00007497112,0.0009714406,0.000020610509,9.379404e-7,0.000002994724,1.4382896e-7,0.96300626,0.0006894909,0.00053709676,0.034529466,0.000085070824],"about_ca_topic_score_codex":0.000002012366,"about_ca_topic_score_gemma":2.494832e-7,"teacher_disagreement_score":0.903458,"about_ca_system_score_codex":0.000043532804,"about_ca_system_score_gemma":0.000034421773,"threshold_uncertainty_score":0.30297872},"labels":[],"label_agreement":null},{"id":"W2016425259","doi":"10.1016/s1389-1286(02)00417-6","title":"Basestation collaboration in Bluetooth voice networks","year":2003,"lang":"en","type":"article","venue":"Computer Networks","topic":"Bluetooth and Wireless Communication Technologies","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":"McMaster University","funders":"Tsinghua University","keywords":"Bluetooth; Computer science; Computer network; Voice over IP; Blocking (statistics); Telephony; Network packet; Scatternet; Wireless; Variety (cybernetics); Node (physics); Telecommunications; Operating system; The Internet","score_opus":0.010665387448061074,"score_gpt":0.2407117444782641,"score_spread":0.230046357030203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016425259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042612967,0.0011182079,0.991131,0.0006819906,0.0008174448,0.00025615608,3.666184e-7,0.00054751453,0.0011860186],"genre_scores_gemma":[0.8721733,0.00032760046,0.12645435,0.0008432145,0.00009095054,0.00004711182,0.000013179014,0.0000138926425,0.000036379388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998297,0.0002910342,0.00039609478,0.0004349349,0.00017051812,0.00041046934],"domain_scores_gemma":[0.99826485,0.0002714764,0.00016099069,0.0010946804,0.00013050044,0.000077515564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047951346,0.00019677634,0.00021708444,0.00021165684,0.0001499806,0.00033301406,0.0011305227,0.00020321459,0.000004977848],"category_scores_gemma":[0.000044029304,0.00020454582,0.000044939592,0.0017023119,0.00006202659,0.00074474385,0.00024903863,0.00037775293,0.00001884812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005254638,0.000105930594,0.004541357,0.0000062735407,0.000009927123,0.0000122906395,0.00021306424,0.66875,0.0000036842707,0.1505212,0.009577181,0.16625385],"study_design_scores_gemma":[0.0004002038,0.000054871805,0.0035878029,0.00003379383,0.0000021948363,0.0000072570174,0.000025374578,0.9802007,0.00005795908,0.001859066,0.013534381,0.00023639471],"about_ca_topic_score_codex":0.00001198502,"about_ca_topic_score_gemma":0.000066721586,"teacher_disagreement_score":0.867912,"about_ca_system_score_codex":0.000082043734,"about_ca_system_score_gemma":0.00007463198,"threshold_uncertainty_score":0.83411366},"labels":[],"label_agreement":null},{"id":"W2018558592","doi":"10.1016/j.comnet.2008.11.012","title":"Targeting spam control on middleboxes: Spam detection based on layer-3 e-mail content classification","year":2008,"lang":"en","type":"article","venue":"Computer Networks","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":28,"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; Byte; Network packet; Naive Bayes classifier; Server; Computer network; Artificial intelligence; Machine learning; Data mining; Support vector machine; Operating system","score_opus":0.04526274844761223,"score_gpt":0.21933557700468936,"score_spread":0.17407282855707712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018558592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015529565,0.00011907559,0.9780026,0.0006051486,0.003980704,0.0005198169,0.0000017350438,0.0006164623,0.00062490226],"genre_scores_gemma":[0.9872006,0.00006794557,0.006261003,0.0041824533,0.0021191807,0.000060995833,0.000015237059,0.000030240832,0.00006232926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970523,0.00037196054,0.00055227376,0.00088371785,0.0005514979,0.0005882196],"domain_scores_gemma":[0.9979846,0.0004413429,0.00031903485,0.00083446014,0.00021330356,0.00020728318],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055634737,0.00037445937,0.00036063007,0.00024440972,0.00075273006,0.00020286317,0.0007167491,0.00028043913,0.000024289817],"category_scores_gemma":[0.000035686553,0.00035573408,0.00020308555,0.00059805217,0.00008872015,0.0003803519,0.0001059677,0.0006879736,0.00015609458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029029406,0.00038491326,0.00062609924,0.000014028095,0.00003987273,0.000052820284,0.00017134676,0.8241355,0.0006112473,0.0026697607,0.008515627,0.16248849],"study_design_scores_gemma":[0.0013238272,0.000893743,0.003298052,0.00010223225,0.000008879103,0.000024393412,0.0000044617827,0.9826778,0.00043376072,0.00011496015,0.010741736,0.0003761275],"about_ca_topic_score_codex":0.000020628519,"about_ca_topic_score_gemma":0.0000074418044,"teacher_disagreement_score":0.9717416,"about_ca_system_score_codex":0.00018910487,"about_ca_system_score_gemma":0.00004487247,"threshold_uncertainty_score":0.9998895},"labels":[],"label_agreement":null},{"id":"W2019815383","doi":"10.1016/j.bjp.2013.12.008","title":"On the optimal randomized clustering in distributed sensor networks","year":2013,"lang":"en","type":"article","venue":"Computer Networks","topic":"Energy Efficient Wireless Sensor Networks","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 Calgary","funders":"","keywords":"Cluster analysis; Computer science; Wireless sensor network; Scalability; Energy consumption; Data mining; Correlation clustering; Efficient energy use; Probabilistic logic; CURE data clustering algorithm; Data stream clustering; Distributed computing; Artificial intelligence; Computer network","score_opus":0.008164872175430039,"score_gpt":0.19667539364950398,"score_spread":0.18851052147407393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019815383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020291993,0.00025237963,0.9736138,0.0017780934,0.0021009152,0.0010800757,7.020079e-7,0.00041661473,0.00046545512],"genre_scores_gemma":[0.9568212,0.00007299878,0.03918129,0.0026277024,0.00090853055,0.00022453265,0.000023370227,0.000049404433,0.00009095936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957543,0.0009512703,0.00081340317,0.0008972217,0.0004186078,0.0011651673],"domain_scores_gemma":[0.99458015,0.0034032858,0.00026848918,0.0014065306,0.00013028336,0.00021128522],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011374245,0.0005174119,0.00080014154,0.00016354574,0.0002789029,0.0007885991,0.0020465623,0.0002846427,0.000055094835],"category_scores_gemma":[0.000057353824,0.00035972556,0.00029959859,0.0010868171,0.00023225464,0.00035216784,0.0010124777,0.0009883554,0.0000868885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029142882,0.00007229401,0.000043581236,0.0000025683337,0.000038914375,0.000034355195,0.00009128735,0.96804935,8.667311e-7,0.014980425,0.006516848,0.009878099],"study_design_scores_gemma":[0.011306154,0.000054468186,0.00042549608,0.00013630734,0.000007700247,0.000022420027,0.0000067014034,0.98714864,0.000003817737,0.00024118563,0.00022721155,0.00041992284],"about_ca_topic_score_codex":0.00006570883,"about_ca_topic_score_gemma":0.000015048063,"teacher_disagreement_score":0.9365292,"about_ca_system_score_codex":0.00011669998,"about_ca_system_score_gemma":0.000022420705,"threshold_uncertainty_score":0.9998855},"labels":[],"label_agreement":null},{"id":"W2019920090","doi":"10.1016/j.comnet.2010.01.001","title":"Special issue on “Wireless Multi-Hop Networking for Infrastructure Access”","year":2010,"lang":"en","type":"article","venue":"Computer Networks","topic":"Mobile Ad Hoc Networks","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":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Wireless; Hop (telecommunications); Telecommunications; Wireless network","score_opus":0.01553892032751443,"score_gpt":0.26640746986075364,"score_spread":0.2508685495332392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019920090","genre_codex":"methods","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013518981,0.00005225814,0.9415428,0.00046864836,0.053871237,0.0009483147,0.0000030995532,0.0004975013,0.0012642507],"genre_scores_gemma":[0.17009717,0.000081015896,0.27981284,0.007045617,0.5418984,0.00028182723,0.000064936066,0.00017778685,0.00054037553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653405,0.000098431316,0.00057952007,0.001249871,0.00037927637,0.0011588691],"domain_scores_gemma":[0.9969549,0.00055754196,0.00031277924,0.0016257849,0.00019936044,0.00034962702],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00045253176,0.0005621911,0.00055136083,0.00015212876,0.00046116984,0.0012007618,0.0038592669,0.0005307811,0.000093613016],"category_scores_gemma":[0.000013154149,0.0005386097,0.0002608824,0.0006981174,0.000119560646,0.0007157167,0.0013929341,0.0013828818,0.00005205645],"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.000023123217,0.000060975057,0.00051775353,0.00000986116,0.000030456134,0.000017332146,0.00008911588,0.1151488,0.0000058121673,0.006245954,0.28574884,0.592102],"study_design_scores_gemma":[0.00066605915,0.000096918244,0.001371398,0.000044312623,0.000007689185,0.000016455002,7.2894e-7,0.6129978,0.00001841663,0.0005597302,0.3838384,0.00038215867],"about_ca_topic_score_codex":0.0000041329536,"about_ca_topic_score_gemma":0.000069438676,"teacher_disagreement_score":0.66172993,"about_ca_system_score_codex":0.00006287455,"about_ca_system_score_gemma":0.000075729615,"threshold_uncertainty_score":0.9998361},"labels":[],"label_agreement":null},{"id":"W2020828165","doi":"10.1016/j.comnet.2013.06.017","title":"Media access protocol for a coexisting cognitive femtocell network","year":2013,"lang":"en","type":"article","venue":"Computer Networks","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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 Waterloo","funders":"","keywords":"Femtocell; Computer science; Computer network; Access control; Protocol (science); Media access control; Cognitive radio; Cellular network; Distributed computing; Base station; Telecommunications; Wireless","score_opus":0.034096135636972544,"score_gpt":0.2886395412270805,"score_spread":0.25454340559010796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020828165","genre_codex":"methods","genre_gemma":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032792766,0.000028862956,0.9018137,0.0000064276496,0.0007240262,0.09567652,0.0000022862298,0.0005493688,0.0011660018],"genre_scores_gemma":[0.09251033,0.0000034377103,0.16243728,0.0002790851,0.00860233,0.7357516,0.00011395748,0.00021282944,0.00008913574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875575,0.000029087523,0.00034699458,0.0002539354,0.0000782353,0.00053601986],"domain_scores_gemma":[0.9989747,0.0004670588,0.00009140098,0.00017051047,0.00018773778,0.000108591805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001252607,0.00023085221,0.00026064445,0.0000396448,0.000117304015,0.00019168516,0.00024234991,0.00013261136,0.000044353517],"category_scores_gemma":[0.000018743642,0.0002333412,0.00006130785,0.00023302717,0.000026304213,0.0005050173,0.00011249596,0.0001690367,0.000029477102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009607674,0.000008260549,0.00022297681,0.00009750222,0.0000244924,0.0000010717129,0.00006020787,0.9397165,0.0000010182915,0.00007725986,0.022973493,0.036807563],"study_design_scores_gemma":[0.00096758915,0.000030032357,0.00030310467,0.00032740587,0.000008763068,0.0000036824763,0.000006179781,0.99541265,0.000014006553,0.00034192146,0.0023159555,0.00026870202],"about_ca_topic_score_codex":0.0000036045462,"about_ca_topic_score_gemma":0.0000049902537,"teacher_disagreement_score":0.7393764,"about_ca_system_score_codex":0.000046797893,"about_ca_system_score_gemma":0.000009338794,"threshold_uncertainty_score":0.9515378},"labels":[],"label_agreement":null},{"id":"W2020853289","doi":"10.1016/j.comnet.2011.08.001","title":"Distributed optimal dynamic base station positioning in wireless sensor networks","year":2011,"lang":"en","type":"article","venue":"Computer Networks","topic":"Indoor and Outdoor Localization Technologies","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 Alberta","funders":"","keywords":"Computer science; Base station; Wireless sensor network; Wireless; Base transceiver station; Computer network; Wireless network; Base (topology); Real-time computing; Key distribution in wireless sensor networks; Telecommunications","score_opus":0.008136615971691531,"score_gpt":0.18842472745951563,"score_spread":0.18028811148782412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020853289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09482528,0.0001290055,0.90338445,0.000008890125,0.0005564052,0.00013549166,0.000008171577,0.00080988876,0.00014244154],"genre_scores_gemma":[0.9842644,0.000073981915,0.015159862,0.00004954345,0.00010028028,0.00001648979,0.0002961636,0.000034162447,0.0000051218276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990724,0.000031396965,0.00027427223,0.00019367528,0.000074147356,0.0003541367],"domain_scores_gemma":[0.9996364,0.000038662965,0.000037389465,0.00019973132,0.000041212043,0.000046598503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008798939,0.00017689167,0.00017736525,0.00011450451,0.00006483641,0.000045342545,0.00016343281,0.00019419566,0.000023704046],"category_scores_gemma":[0.0000026324778,0.00019394595,0.000042632844,0.00037812936,0.000041042716,0.0001434721,0.00005561086,0.0002932493,0.000007389835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000100973675,0.000016387514,0.0013888488,0.00001023323,0.000014732274,0.000033355398,0.00011979942,0.98129153,0.0000075350376,0.00043779655,0.00045686823,0.016212821],"study_design_scores_gemma":[0.0003114566,0.000029038692,0.00815609,0.00006245618,0.0000075699572,0.000008828064,0.00003828535,0.99096274,0.000119164135,0.000056089048,0.000029387658,0.00021891147],"about_ca_topic_score_codex":0.000012936139,"about_ca_topic_score_gemma":0.000021079764,"teacher_disagreement_score":0.8894391,"about_ca_system_score_codex":0.000099158395,"about_ca_system_score_gemma":0.0000052767787,"threshold_uncertainty_score":0.7908886},"labels":[],"label_agreement":null},{"id":"W2022615889","doi":"10.1016/j.comnet.2008.02.023","title":"DiffServ for differentiated reliability in meshed IP/WDM networks","year":2008,"lang":"en","type":"article","venue":"Computer Networks","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Computer network; Quality of service; Node (physics); Reliability (semiconductor); Differentiated services; Network topology; Network element; Service (business)","score_opus":0.01145433324751953,"score_gpt":0.20393241786731042,"score_spread":0.19247808461979088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022615889","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1702096,0.00079672993,0.8257555,0.00005757257,0.0011142847,0.00049796543,0.000002063531,0.0015156497,0.00005065341],"genre_scores_gemma":[0.93127406,0.0004931941,0.067291625,0.0000935486,0.00056773995,0.0001311181,0.000049468348,0.00007701956,0.00002224926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811065,0.000028478657,0.0005014846,0.00045818975,0.00011024026,0.00079095596],"domain_scores_gemma":[0.99876744,0.00042135324,0.00004635144,0.0006028251,0.000055248194,0.00010678653],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012501693,0.00035174488,0.00049355987,0.00009086692,0.000096698386,0.000027082782,0.00043864056,0.0004146955,0.000011197564],"category_scores_gemma":[0.00003204511,0.00034276088,0.00013727587,0.0005004308,0.00012415554,0.00014464238,0.00019419722,0.0006208886,0.000005294037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024663474,0.000046945963,0.003713863,0.00002165051,0.000022415346,0.000015231399,0.000016651202,0.9736934,0.0000025720447,0.00043320266,0.0049599903,0.017049436],"study_design_scores_gemma":[0.0006922069,0.000060483733,0.04019368,0.00006181659,0.000008933472,0.000008321063,0.0000016707983,0.956373,0.000007723126,0.0010493033,0.0011828021,0.00036010068],"about_ca_topic_score_codex":0.0000022349877,"about_ca_topic_score_gemma":0.000010147931,"teacher_disagreement_score":0.7610644,"about_ca_system_score_codex":0.00012655075,"about_ca_system_score_gemma":0.0000061539376,"threshold_uncertainty_score":0.9999024},"labels":[],"label_agreement":null},{"id":"W2026664032","doi":"10.1016/j.comnet.2015.10.001","title":"Cloud networking and communications II","year":2015,"lang":"en","type":"article","venue":"Computer Networks","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cloud computing; Vehicular ad hoc network; Computer network; Computer security; Wireless ad hoc network; Encryption; Intelligent transportation system; Wireless; Telecommunications","score_opus":0.04610684179770604,"score_gpt":0.24952269899959642,"score_spread":0.20341585720189037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026664032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011061803,0.009171901,0.9833974,0.0014165647,0.003156613,0.00015208169,3.82254e-7,0.0005335472,0.0010653234],"genre_scores_gemma":[0.7511454,0.0008103941,0.24067974,0.002816102,0.004336043,0.000025541449,0.000013586514,0.000033829074,0.00013934028],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847597,0.00013532769,0.00029187635,0.00043976668,0.00019322161,0.00046385932],"domain_scores_gemma":[0.9976309,0.00025997515,0.00011171398,0.0015631954,0.00011146706,0.00032272795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049787265,0.0002132893,0.00025075328,0.00006493506,0.00043003447,0.00031696178,0.001693571,0.00013114922,0.0000015368656],"category_scores_gemma":[0.000008134833,0.00020571904,0.000059200283,0.0005194315,0.00012085765,0.0003317698,0.0033476327,0.000349359,0.000013852752],"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.000011840723,0.00010105878,0.0044430606,0.000005015588,0.000053859654,0.000020219533,0.0011047696,0.049738448,2.8786638e-7,0.071545824,0.17183107,0.7011446],"study_design_scores_gemma":[0.0003653965,0.00013315918,0.0005861071,0.00004949914,0.0000071224576,0.000048095055,0.000004391075,0.85431105,3.5765225e-7,0.00432285,0.13994403,0.00022795175],"about_ca_topic_score_codex":0.000013803052,"about_ca_topic_score_gemma":0.00001099037,"teacher_disagreement_score":0.8045726,"about_ca_system_score_codex":0.000036179725,"about_ca_system_score_gemma":0.0000440199,"threshold_uncertainty_score":0.8388979},"labels":[],"label_agreement":null},{"id":"W2027945131","doi":"10.1016/j.comnet.2012.06.013","title":"A survey of peer-to-peer live video streaming schemes – An algorithmic perspective","year":2012,"lang":"en","type":"article","venue":"Computer Networks","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":54,"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; Network packet; Scalability; Peer-to-peer; Computer network; The Internet; BitTorrent; Multicast; Popularity; Live streaming; PlanetLab; Distributed computing; World Wide Web","score_opus":0.02979444732761806,"score_gpt":0.2894481785821249,"score_spread":0.25965373125450686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027945131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06031357,0.0007207571,0.933742,0.0015598085,0.0019172817,0.00056791183,0.00001709622,0.0009118734,0.00024973962],"genre_scores_gemma":[0.71073604,0.000007837335,0.28754672,0.00060911354,0.00082971214,0.000040466024,0.000020981486,0.000041492178,0.00016764928],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956869,0.00033208687,0.0005760612,0.0010465634,0.0009984636,0.0013599073],"domain_scores_gemma":[0.99475455,0.0005184224,0.00023961447,0.0018984559,0.0018731506,0.00071579916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020774002,0.0005194887,0.0006818525,0.00046164013,0.00019489015,0.00028738347,0.0032469511,0.0003145212,0.00001538982],"category_scores_gemma":[0.000422204,0.0005204804,0.00013830785,0.0020104093,0.00013837597,0.0011020919,0.0025346922,0.0005950909,0.00010736142],"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.00006923872,0.0008820304,0.04565979,0.000025516812,0.0003796974,0.0000480453,0.013023228,0.061584707,0.00008048168,0.02035496,0.0941021,0.7637902],"study_design_scores_gemma":[0.00047391414,0.0006841004,0.18899073,0.00013469678,0.000023961536,0.00003811033,0.0002546376,0.80090714,0.00030073684,0.00064956176,0.0065322905,0.0010101134],"about_ca_topic_score_codex":0.0005828383,"about_ca_topic_score_gemma":0.00017333268,"teacher_disagreement_score":0.7627801,"about_ca_system_score_codex":0.00026189233,"about_ca_system_score_gemma":0.00011216781,"threshold_uncertainty_score":0.9997247},"labels":[],"label_agreement":null},{"id":"W2028966669","doi":"10.1016/s1389-1286(03)00242-1","title":"Adaptive guard channel allocation and blocking probability estimation in PCS networks","year":2003,"lang":"en","type":"article","venue":"Computer Networks","topic":"Wireless Communication Networks Research","field":"Computer Science","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":"Nortel (Canada)","funders":"","keywords":"Computer science; Computer network; Reservation; Channel allocation schemes; Blocking (statistics); Bandwidth (computing); Channel (broadcasting); Call blocking; Bandwidth allocation; Guard (computer science); Wireless; Quality of service; Dynamic bandwidth allocation; Wireless network; Distributed computing; Telecommunications","score_opus":0.03263725572200317,"score_gpt":0.26164358108936003,"score_spread":0.22900632536735688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028966669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062944447,0.0012205155,0.9904388,0.0005036308,0.000382985,0.00064663915,1.8958478e-7,0.00019000757,0.00032273988],"genre_scores_gemma":[0.872523,0.00020322629,0.12682305,0.00019946301,0.00011876434,0.00009029057,0.000008541403,0.00001851353,0.000015133162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972398,0.00059813895,0.0005113151,0.00071391393,0.0003168586,0.00061995594],"domain_scores_gemma":[0.9977651,0.0005260809,0.00017196036,0.0011769335,0.00019539586,0.00016453123],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015543634,0.00026369563,0.00030760444,0.00018816508,0.00024001567,0.00034125845,0.0010340294,0.00021213545,0.0000033025594],"category_scores_gemma":[0.00005042472,0.0002782014,0.000053346557,0.0011313822,0.00012961548,0.0006716468,0.0006936777,0.0006707872,0.0000052084133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072682506,0.000071104325,0.0008440613,0.000007549518,0.000011796652,0.0000039776523,0.00027509022,0.85746247,5.92192e-7,0.03063579,0.00030135768,0.11037897],"study_design_scores_gemma":[0.00042571034,0.00007607647,0.006938137,0.00010589015,0.0000031491556,0.00001930273,0.000007729849,0.9854606,0.0000075091743,0.0065000234,0.00019024067,0.00026567286],"about_ca_topic_score_codex":0.000022646325,"about_ca_topic_score_gemma":0.000056469842,"teacher_disagreement_score":0.8662286,"about_ca_system_score_codex":0.00016770119,"about_ca_system_score_gemma":0.00007508578,"threshold_uncertainty_score":0.99996704},"labels":[],"label_agreement":null},{"id":"W2030064403","doi":"10.1016/j.comnet.2012.07.020","title":"The SIC botnet lifecycle model: A step beyond traditional epidemiological models","year":2012,"lang":"en","type":"article","venue":"Computer Networks","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":21,"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":"Botnet; Computer science; Malware; Key (lock); Computer security; Epidemic model; Population; Node (physics); Network security; The Internet; Computer network; World Wide Web; Engineering","score_opus":0.04982928703011375,"score_gpt":0.24264355166346396,"score_spread":0.19281426463335022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030064403","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026083244,0.002018965,0.98934895,0.001041684,0.002628391,0.00020889254,0.0000017025607,0.0003094566,0.001833661],"genre_scores_gemma":[0.9189306,0.00031869294,0.073057264,0.003643191,0.003898303,0.000048763577,0.000011077977,0.00001664186,0.00007545966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765176,0.00034808522,0.00042908714,0.00042414095,0.00031925022,0.0008276801],"domain_scores_gemma":[0.9980046,0.0008385566,0.00014637165,0.00064669136,0.000065253145,0.0002984905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012619293,0.00024967888,0.00026657747,0.00004474589,0.00073388685,0.00024210554,0.0011092119,0.00021544009,0.000012063808],"category_scores_gemma":[0.0000135752725,0.00017346715,0.00019068285,0.00032221733,0.0001321886,0.0010580735,0.0005243743,0.0005678642,0.000038878243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008637386,0.00006120175,0.00003529077,0.0000013338823,0.0000153361,0.0000011518155,0.00007495292,0.55018294,5.9451685e-7,0.33247274,0.04196525,0.07518056],"study_design_scores_gemma":[0.00016682917,0.00008059873,0.0004626189,0.000011708294,0.000005939154,0.000039489347,0.0000013059943,0.893082,0.0000019888635,0.09885154,0.0070911753,0.00020481065],"about_ca_topic_score_codex":0.0000045473216,"about_ca_topic_score_gemma":0.0000033551419,"teacher_disagreement_score":0.9163223,"about_ca_system_score_codex":0.00005659263,"about_ca_system_score_gemma":0.000028318434,"threshold_uncertainty_score":0.7073785},"labels":[],"label_agreement":null},{"id":"W2030634389","doi":"10.1016/j.comnet.2009.05.006","title":"Congestion-aware channel assignment for multi-channel wireless mesh networks","year":2009,"lang":"en","type":"article","venue":"Computer Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":22,"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; Computer network; Wireless mesh network; Channel (broadcasting); Throughput; Network packet; Algorithm; Node (physics); Queueing theory; Wireless network; Wireless; Telecommunications","score_opus":0.027398310445537026,"score_gpt":0.2559608670494426,"score_spread":0.22856255660390556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030634389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012859725,0.00071468117,0.99039584,0.0009479412,0.005198924,0.001619901,0.0000052422124,0.0009171254,0.000071726805],"genre_scores_gemma":[0.9375846,0.00024279043,0.051731054,0.00495701,0.004676613,0.00034925854,0.0000976846,0.00008052472,0.00028047478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953831,0.00020658612,0.0008374245,0.0015267009,0.0004640913,0.0015821044],"domain_scores_gemma":[0.9967443,0.00041516364,0.00039756077,0.0015643291,0.00033508896,0.0005436079],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007432349,0.00073685974,0.00078559667,0.00015507436,0.0005308488,0.0006045075,0.002346067,0.0005429758,0.000009315291],"category_scores_gemma":[0.000009337495,0.0007428008,0.00037103504,0.0006993025,0.000099817385,0.0006619045,0.00059381017,0.00069537666,0.000021743295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029937768,0.00025982974,0.000022284223,0.000011551955,0.000067471316,0.00003718046,0.00015860576,0.79174733,0.0000011703031,0.012021144,0.034714762,0.16092874],"study_design_scores_gemma":[0.001767534,0.0005471312,0.0010600385,0.00019106994,0.000031015574,0.000042201067,0.0000070498486,0.99278474,0.0000130853905,0.0011920981,0.0015146664,0.0008493442],"about_ca_topic_score_codex":0.0000069997236,"about_ca_topic_score_gemma":0.000011642081,"teacher_disagreement_score":0.9386648,"about_ca_system_score_codex":0.00019246573,"about_ca_system_score_gemma":0.000075799515,"threshold_uncertainty_score":0.9995023},"labels":[],"label_agreement":null},{"id":"W2032510935","doi":"10.1016/j.comnet.2007.11.016","title":"Research on multicast routing protocols for mobile ad-hoc networks","year":2007,"lang":"en","type":"article","venue":"Computer Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":162,"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 network; Computer science; Protocol Independent Multicast; Multicast; Distributed computing; Distance Vector Multicast Routing Protocol; Xcast; Source-specific multicast","score_opus":0.0670637926794713,"score_gpt":0.3811164180693922,"score_spread":0.31405262538992096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032510935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006195896,0.0007651858,0.9743175,0.00011520011,0.0017918955,0.020838644,0.000001493732,0.00067054614,0.0008799521],"genre_scores_gemma":[0.61856943,0.000112511705,0.34176406,0.0021066142,0.0105074365,0.026144143,0.000039330873,0.0002324243,0.0005240442],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933915,0.0003911553,0.0009968779,0.001668267,0.00089060096,0.002661565],"domain_scores_gemma":[0.99274063,0.0035720994,0.0002796572,0.0022228379,0.0006184608,0.00056632026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0065709464,0.00054485485,0.0006038358,0.00033322818,0.00086858595,0.0008291778,0.0031114998,0.0005308949,0.000017175169],"category_scores_gemma":[0.000038960483,0.0005259447,0.0002936982,0.0017187817,0.00021288787,0.00046711494,0.0014800015,0.0016468777,0.00007171117],"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.00012285437,0.00020451141,0.00010390364,0.000017613747,0.000030668973,0.000049037244,0.0001550008,0.4006806,0.000002568075,0.011325097,0.016037757,0.5712704],"study_design_scores_gemma":[0.0011934221,0.001384047,0.0007043254,0.00032881217,0.000005300513,0.000022505637,0.000020494508,0.89850795,0.000033792447,0.00040057127,0.09688662,0.0005121813],"about_ca_topic_score_codex":0.000003085414,"about_ca_topic_score_gemma":0.000022931696,"teacher_disagreement_score":0.6325534,"about_ca_system_score_codex":0.00028895395,"about_ca_system_score_gemma":0.00009367018,"threshold_uncertainty_score":0.9997192},"labels":[],"label_agreement":null},{"id":"W2032667132","doi":"10.1016/s1389-1286(00)00206-1","title":"A control theoretic approach to active queue management","year":2001,"lang":"en","type":"article","venue":"Computer Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":235,"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; Active queue management; Computer network; Random early detection; Queue; Router; Traffic intensity; Network packet; Queue management system; Distributed computing; Network congestion","score_opus":0.0065303647479592695,"score_gpt":0.19690231788517518,"score_spread":0.19037195313721592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032667132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00049175,0.00015265096,0.9765111,0.0010039133,0.0010393109,0.0006990068,6.1577526e-7,0.00047689362,0.019624764],"genre_scores_gemma":[0.9297339,0.00004109612,0.062720895,0.0059176553,0.0010188427,0.00015681486,0.0000038241888,0.00002025501,0.0003867516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979204,0.00016275153,0.00028084777,0.0007276008,0.00027470003,0.0006337283],"domain_scores_gemma":[0.9986088,0.0001350401,0.00007839895,0.00081545237,0.00007549702,0.00028677552],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002906722,0.00027800427,0.00030631103,0.00012351056,0.00017175803,0.00027161895,0.0013631317,0.00009748639,0.000013084583],"category_scores_gemma":[0.0000023022646,0.00025250443,0.00012274834,0.0006612778,0.000049839728,0.00022080287,0.00034712788,0.00024397607,0.00011634039],"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.000035172987,0.000081504135,0.00003917796,0.0000029987852,0.000062446416,0.00003414153,0.00009788043,0.23215608,1.3625898e-7,0.23233777,0.0056691975,0.5294835],"study_design_scores_gemma":[0.0010864541,0.00009466722,0.0010710094,0.000029566947,0.000022274677,0.000049076614,0.0000078625435,0.9738289,4.5578741e-7,0.0014609033,0.022047086,0.00030172695],"about_ca_topic_score_codex":0.0000028117945,"about_ca_topic_score_gemma":0.000001199013,"teacher_disagreement_score":0.92924213,"about_ca_system_score_codex":0.000059965314,"about_ca_system_score_gemma":0.000015670676,"threshold_uncertainty_score":0.9999927},"labels":[],"label_agreement":null},{"id":"W2040378575","doi":"10.1016/j.comnet.2012.04.010","title":"Data uploading time estimation for CUBIC TCP in long distance networks","year":2012,"lang":"en","type":"article","venue":"Computer Networks","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 Toronto","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Computer science; Upload; TCP Westwood plus; Computer network; TCP global synchronization; Network packet; Compound TCP; Real-time computing; Transmission Control Protocol; Operating system","score_opus":0.020510824928984206,"score_gpt":0.255447522641036,"score_spread":0.23493669771205178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040378575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00060599594,0.0031272462,0.9925126,0.00032422005,0.002446663,0.00054364454,0.00000453964,0.00034369656,0.00009140499],"genre_scores_gemma":[0.8849911,0.00005108447,0.11111159,0.00067664095,0.0027475057,0.00006802862,0.00018425078,0.00003183875,0.00013797432],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975852,0.00012598236,0.0004905822,0.00066867645,0.00020190464,0.00092765316],"domain_scores_gemma":[0.99767315,0.00056909554,0.00018662194,0.00129302,0.000057601297,0.00022052544],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001011389,0.00028380472,0.00036209822,0.000099441124,0.00018348172,0.00029369618,0.0018699167,0.00016856974,0.000010984746],"category_scores_gemma":[0.000018405672,0.00028938893,0.00007740795,0.0005503967,0.000045858174,0.001598555,0.0006437373,0.00031306082,0.00004242987],"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.00001149645,0.000050823935,0.0012184697,0.0000065893355,0.000015585152,0.0000031875345,0.00004241163,0.48732084,2.0972466e-7,0.0062858155,0.012095455,0.49294913],"study_design_scores_gemma":[0.00067912095,0.000034351273,0.0041200626,0.00011523299,0.000015214968,0.000014193978,9.4299463e-7,0.98869085,5.0804636e-7,0.0001589509,0.0058404044,0.00033017877],"about_ca_topic_score_codex":0.0000028600043,"about_ca_topic_score_gemma":0.000013823536,"teacher_disagreement_score":0.8843851,"about_ca_system_score_codex":0.000078245364,"about_ca_system_score_gemma":0.00002895852,"threshold_uncertainty_score":0.99995583},"labels":[],"label_agreement":null},{"id":"W2041956541","doi":"10.1016/j.comnet.2011.05.008","title":"Comparison of different meta-heuristics to solve the global planning problem of UMTS networks","year":2011,"lang":"en","type":"article","venue":"Computer Networks","topic":"Advanced Wireless Network Optimization","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":"Carleton University","funders":"","keywords":"Computer science; UMTS frequency bands; Heuristics; Mathematical optimization; Operations research; Distributed computing; Computer network; Mathematics","score_opus":0.050233537821847675,"score_gpt":0.27208933704747085,"score_spread":0.22185579922562318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041956541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004954336,0.0022069367,0.99090445,0.000007063728,0.000711593,0.00038723176,0.0000047006797,0.00016546885,0.0006582462],"genre_scores_gemma":[0.8768978,0.000049063037,0.12260736,0.000038884766,0.00032179037,0.000025116384,0.000018793084,0.000038624123,0.0000025710106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984939,0.000042926436,0.0006550946,0.00022564728,0.00018552606,0.00039691586],"domain_scores_gemma":[0.99903786,0.00013814491,0.00019913907,0.00041615986,0.000102324906,0.00010634335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011808159,0.00029668232,0.00068530644,0.00004024129,0.000059624774,0.000017648852,0.00043988405,0.00013747838,0.000015124318],"category_scores_gemma":[0.0000029970247,0.0002222867,0.00015123212,0.00038761893,0.00006613985,0.00006456691,0.0001989534,0.00026480868,0.000001286803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024670615,0.000053039013,0.0059302347,0.00003273007,0.0004105265,0.0000015979085,0.0004885129,0.97867507,0.0000011144413,0.0013523547,0.0025108396,0.01051932],"study_design_scores_gemma":[0.00016421113,0.00010441316,0.004412935,0.000099325334,0.0002515349,0.0000021303354,0.000015073609,0.99415773,0.000059218542,0.00035199817,0.000176625,0.00020477916],"about_ca_topic_score_codex":0.000004333968,"about_ca_topic_score_gemma":0.000009181615,"teacher_disagreement_score":0.8719435,"about_ca_system_score_codex":0.0000500033,"about_ca_system_score_gemma":0.0000055518844,"threshold_uncertainty_score":0.90645885},"labels":[],"label_agreement":null},{"id":"W2043907228","doi":"10.1016/j.comnet.2014.12.010","title":"The selective use of redundancy for video streaming over Vehicular Ad Hoc Networks","year":2015,"lang":"en","type":"article","venue":"Computer Networks","topic":"Cooperative Communication and Network Coding","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":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Redundancy (engineering); Unicast; Network packet; Video quality; Linear network coding; Wireless ad hoc network; Coding (social sciences); Real-time computing; Wireless; Telecommunications","score_opus":0.052237301848793494,"score_gpt":0.27814415518822083,"score_spread":0.22590685333942734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043907228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003231871,0.010470041,0.9839497,0.00036105138,0.0012518489,0.00051399524,0.0000011205635,0.0001409731,0.00007935003],"genre_scores_gemma":[0.8857629,0.0032541258,0.108270034,0.0013073046,0.0009735287,0.00012613658,0.000021062888,0.00005113223,0.00023382517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798656,0.0003371107,0.0004750632,0.0004529866,0.00024471828,0.0005035838],"domain_scores_gemma":[0.9963298,0.0013090417,0.00028777673,0.0012407133,0.0006530846,0.00017958425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007860069,0.00025126856,0.00031582793,0.00006391114,0.00049231097,0.00046017906,0.001469068,0.000109021064,0.0000012441946],"category_scores_gemma":[0.00008321883,0.00019808399,0.0001639238,0.00069601194,0.000127151,0.0005484082,0.0009340033,0.00035553894,0.000001926323],"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.0000616219,0.0000687563,0.0005064939,0.0000053658246,0.00011864961,0.0000035588891,0.0006148052,0.33068684,0.0000086573,0.020793801,0.054701142,0.5924303],"study_design_scores_gemma":[0.0005536454,0.0001801909,0.0011551637,0.00008173393,0.000012491259,0.0000066289213,0.0000072670537,0.9001572,0.000017158065,0.0004749582,0.09714038,0.000213176],"about_ca_topic_score_codex":0.0000028901468,"about_ca_topic_score_gemma":0.000041969957,"teacher_disagreement_score":0.882531,"about_ca_system_score_codex":0.00010130309,"about_ca_system_score_gemma":0.000111852954,"threshold_uncertainty_score":0.8077631},"labels":[],"label_agreement":null},{"id":"W2046012872","doi":"10.1016/j.comnet.2009.05.009","title":"Heuristic algorithms for designing self-repairing protection trees in mesh networks","year":2009,"lang":"en","type":"article","venue":"Computer Networks","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":"University of Ottawa; University of Ontario Institute of Technology","funders":"","keywords":"Computer science; Path protection; Backup; Redundancy (engineering); Unicast; Network topology; Distributed computing; Multicast; Tree (set theory); Heuristic; Computer network; Tree network; Mesh networking; Algorithm; Time complexity; Mathematics","score_opus":0.014069754047247349,"score_gpt":0.22290728553661981,"score_spread":0.20883753148937245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046012872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025709993,0.0009562228,0.9912964,0.000050531722,0.0007544184,0.000814505,4.2265356e-7,0.0034493774,0.00010710235],"genre_scores_gemma":[0.6181616,0.00014757269,0.38060609,0.000060108963,0.00085354346,0.00011308783,0.0000065021873,0.00004573594,0.000005769979],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983483,0.000028104854,0.00040547925,0.00038680105,0.00010263764,0.0007286607],"domain_scores_gemma":[0.9993236,0.00019790877,0.00005050498,0.00031261973,0.000039104554,0.00007623871],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021511255,0.00031374022,0.00035791233,0.00014102322,0.000101002624,0.000073132236,0.0002799667,0.00030397624,0.000001616008],"category_scores_gemma":[0.000018468354,0.00033465592,0.00009639916,0.0004983379,0.000031321022,0.00019053415,0.00005910922,0.0005612853,0.0000024594326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009594283,0.000020539626,0.00005675068,0.000009792152,0.000017919378,0.000010473654,0.000020334986,0.7373038,0.000010618082,0.00033781247,0.00052565546,0.2616767],"study_design_scores_gemma":[0.00046357006,0.00019533519,0.0010759721,0.00014819004,0.000015457847,0.000011479028,0.000005612376,0.99487376,0.000029910285,0.002316626,0.0004980238,0.00036604606],"about_ca_topic_score_codex":9.893083e-7,"about_ca_topic_score_gemma":0.0000062378517,"teacher_disagreement_score":0.6155906,"about_ca_system_score_codex":0.00016474683,"about_ca_system_score_gemma":0.000005561224,"threshold_uncertainty_score":0.99991053},"labels":[],"label_agreement":null},{"id":"W2048218810","doi":"10.1016/j.comnet.2006.07.004","title":"Joint call and packet QoS in cellular packet networks","year":2006,"lang":"en","type":"article","venue":"Computer Networks","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); University of Waterloo","funders":"","keywords":"Computer science; Computer network; Network packet; Joint (building); Quality of service; Packet analyzer; Telecommunications","score_opus":0.015245315340507715,"score_gpt":0.22396984927635055,"score_spread":0.20872453393584284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048218810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012595395,0.0039074556,0.9795243,0.0012666315,0.0010309769,0.00044178343,8.523818e-7,0.00028496984,0.0009475962],"genre_scores_gemma":[0.959957,0.0005370769,0.036256224,0.0005911568,0.0023171587,0.000057388064,0.000041209525,0.000045094726,0.00019769586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99639904,0.0005698272,0.00070478383,0.00085240026,0.00042695116,0.0010470106],"domain_scores_gemma":[0.9972149,0.0004198775,0.00017482857,0.0018114026,0.00013307905,0.00024588668],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010326541,0.00037658308,0.000489432,0.0002683481,0.00022877296,0.0006130028,0.0018719637,0.00029998829,0.0000122609035],"category_scores_gemma":[0.000008660339,0.00037767703,0.0001072721,0.0011120666,0.00020090895,0.00048483207,0.0022473482,0.001016287,0.000022225662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014389529,0.00021580524,0.008782162,0.000020796087,0.00002566123,0.00016513877,0.00015052382,0.7559435,0.000022687347,0.023262402,0.09212204,0.11927491],"study_design_scores_gemma":[0.00064127735,0.00006222431,0.02339064,0.00009703811,0.000003262874,0.000025180141,0.0000024811118,0.9666544,0.000019774134,0.00095439085,0.0077529275,0.000396392],"about_ca_topic_score_codex":0.00016447312,"about_ca_topic_score_gemma":0.00019334303,"teacher_disagreement_score":0.9473616,"about_ca_system_score_codex":0.00011871384,"about_ca_system_score_gemma":0.000054966047,"threshold_uncertainty_score":0.9998675},"labels":[],"label_agreement":null},{"id":"W2050776169","doi":"10.1016/j.comnet.2006.08.017","title":"ARTP: A buffer-aware rate control protocol for media streaming","year":2006,"lang":"en","type":"article","venue":"Computer Networks","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":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Computer science; Real Time Streaming Protocol; Network congestion; Network packet; Arithmetic underflow; Buffer overflow; Computer network; Packet loss; Communication source; Protocol (science); RTP Control Protocol; Real-time computing; Operating system; The Internet","score_opus":0.010644320199232449,"score_gpt":0.23274571258119728,"score_spread":0.22210139238196483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050776169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007157839,0.000040632418,0.9535198,0.00063620636,0.00096089684,0.044001713,0.0000043902805,0.00060369686,0.00016105393],"genre_scores_gemma":[0.6959699,0.0000016120613,0.053991117,0.0027296334,0.010397542,0.23647535,0.0000409584,0.000074228825,0.00031968078],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976778,0.00016330442,0.0005099481,0.00069701514,0.00021766312,0.00073426554],"domain_scores_gemma":[0.9979144,0.00088091864,0.00021493477,0.00063380983,0.0001920531,0.00016391849],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045059563,0.00034686193,0.0004114086,0.000085588596,0.00026192836,0.0004162193,0.00096613076,0.00017104516,0.00001308006],"category_scores_gemma":[0.000008643976,0.0003130453,0.00019970519,0.0003018018,0.000059562044,0.00033087557,0.0001475835,0.00024095237,0.00002210178],"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.00009549181,0.00014597639,0.0004303873,0.00002556152,0.000047464604,0.000030354015,0.000043137108,0.27480766,0.0000048918605,0.031869277,0.06133996,0.63115984],"study_design_scores_gemma":[0.004198699,0.00013847886,0.0015813616,0.00007862294,0.000014066141,0.000011133618,0.0000013974736,0.9576331,0.0000058707647,0.0019151691,0.034072094,0.00035000988],"about_ca_topic_score_codex":0.000009420579,"about_ca_topic_score_gemma":0.000025801799,"teacher_disagreement_score":0.89952874,"about_ca_system_score_codex":0.000053079137,"about_ca_system_score_gemma":0.00006836572,"threshold_uncertainty_score":0.99993217},"labels":[],"label_agreement":null},{"id":"W2052006594","doi":"10.1016/j.comnet.2014.02.014","title":"Self-tuned distributed monitoring of multi-channel wireless networks using Gibbs sampler","year":2014,"lang":"en","type":"article","venue":"Computer Networks","topic":"Mobile Ad Hoc Networks","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":"McMaster University","funders":"Hong Kong Polytechnic University; National Science Foundation","keywords":"Computer science; Gibbs sampling; Channel (broadcasting); Wireless sensor network; Wireless; Complement (music); Wireless network; Convergence (economics); Algorithm; Distributed algorithm; Schedule; Base station; Distributed computing; Computer network; Artificial intelligence; Telecommunications","score_opus":0.025520582900214087,"score_gpt":0.24702779681014408,"score_spread":0.22150721390993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052006594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009617302,0.00063991616,0.983542,0.000039242037,0.004919622,0.00049505074,0.000003412426,0.00071695284,0.000026502803],"genre_scores_gemma":[0.757794,0.00007554789,0.23925169,0.00012115125,0.0026368748,0.00002604888,0.00002382886,0.00006269083,0.0000081342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957957,0.00040671183,0.0009670945,0.001107365,0.00048229843,0.0012407883],"domain_scores_gemma":[0.9963385,0.00059219776,0.00057745504,0.0017661559,0.0003375441,0.00038813558],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083556765,0.00059952226,0.0008557519,0.00014987009,0.0003266827,0.0003128332,0.00226318,0.0004382768,0.0000046120203],"category_scores_gemma":[0.000014677268,0.00061778777,0.00029001563,0.001149977,0.000116910334,0.000587649,0.0014931016,0.00069809414,0.000006914539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000119484375,0.00017057022,0.0027286455,0.0000348514,0.00010463898,0.000012433404,0.00016586886,0.9550075,0.000012306064,0.0014869181,0.00053276995,0.039731577],"study_design_scores_gemma":[0.0010592378,0.00012268095,0.003638632,0.00023278383,0.000038855836,0.000029154326,0.0000053261406,0.9931032,0.000087929664,0.00018203308,0.0008867645,0.00061338674],"about_ca_topic_score_codex":0.000040136852,"about_ca_topic_score_gemma":0.000005431594,"teacher_disagreement_score":0.74817675,"about_ca_system_score_codex":0.00015041337,"about_ca_system_score_gemma":0.00006132947,"threshold_uncertainty_score":0.99962735},"labels":[],"label_agreement":null},{"id":"W2055392135","doi":"10.1016/j.comnet.2014.12.008","title":"A scalable approach for serial data fusion in Wireless Sensor Networks","year":2015,"lang":"en","type":"article","venue":"Computer Networks","topic":"Energy Efficient Wireless Sensor 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 Ottawa","funders":"","keywords":"Computer science; Wireless sensor network; Scalability; Sensor fusion; Wireless; Computer network; Telecommunications; Database; Artificial intelligence","score_opus":0.048790638933015905,"score_gpt":0.2545231303293373,"score_spread":0.2057324913963214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055392135","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050741816,0.0005138811,0.9879892,0.00018421323,0.004389988,0.00084510335,0.000007787236,0.0005029622,0.0004927145],"genre_scores_gemma":[0.3746017,0.000072928786,0.6185036,0.0007676026,0.0050040656,0.0000915261,0.0006831611,0.00009593356,0.00017948418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951672,0.00034737316,0.00078061153,0.0018075579,0.0005190066,0.0013782465],"domain_scores_gemma":[0.9956555,0.00038232582,0.0002707307,0.0029620363,0.00024987396,0.0004795377],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016992253,0.0005317649,0.0007097132,0.00022267464,0.00020431467,0.00057068904,0.004288262,0.000486871,0.0000022362174],"category_scores_gemma":[0.000027688016,0.0005252487,0.00012268753,0.0013445956,0.000115286115,0.00086372846,0.0032063874,0.0006141369,0.000007903535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008637765,0.00022998893,0.00045358308,0.000014028281,0.000023013361,0.000027062977,0.00011544105,0.9320726,0.0000030561314,0.002780013,0.026413932,0.0377809],"study_design_scores_gemma":[0.0022248917,0.00015389551,0.0001390158,0.00008229599,0.0000131291745,0.000044536948,0.000015648839,0.9922429,0.0000074586787,0.000074189964,0.004385776,0.0006162954],"about_ca_topic_score_codex":0.000056594592,"about_ca_topic_score_gemma":0.000043308002,"teacher_disagreement_score":0.36952752,"about_ca_system_score_codex":0.00016177684,"about_ca_system_score_gemma":0.00013412964,"threshold_uncertainty_score":0.9997199},"labels":[],"label_agreement":null},{"id":"W2058225249","doi":"10.1016/j.bjp.2013.11.005","title":"On the performance and fairness of BitTorrent-like data swarming systems with NAT devices","year":2013,"lang":"en","type":"article","venue":"Computer Networks","topic":"Peer-to-Peer Network Technologies","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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council","keywords":"BitTorrent; Computer science; Nat; Swarming (honey bee); Computer network; Peer-to-peer","score_opus":0.02061111153448912,"score_gpt":0.21095981312702092,"score_spread":0.1903487015925318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058225249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26685992,0.0006142302,0.72992146,0.0007791011,0.0009467149,0.0004884665,0.0000014577662,0.00029559416,0.00009306208],"genre_scores_gemma":[0.9806062,0.00003923214,0.018584993,0.00047203217,0.00019222444,0.00004591417,0.0000050121653,0.00001561592,0.00003878921],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825484,0.00007128938,0.00027977087,0.0006235023,0.00034419983,0.00042640662],"domain_scores_gemma":[0.9971488,0.0004248286,0.00017238258,0.0020413124,0.00012725979,0.000085408385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038816786,0.00024473158,0.00028647808,0.00011167939,0.00017785317,0.00041878442,0.003614584,0.00009309808,0.0000017216453],"category_scores_gemma":[0.000008347608,0.00014944175,0.000018941339,0.0006337538,0.0001348149,0.0006781235,0.0026271641,0.0002885732,0.000018815184],"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.00001988444,0.000104248844,0.01881476,0.00017619481,0.00016969397,0.000018065826,0.0005900975,0.3443923,0.000009270228,0.019454388,0.12718153,0.48906958],"study_design_scores_gemma":[0.00013568603,0.00018397802,0.007082963,0.0003828883,0.0000068589325,0.000028124221,0.000024523051,0.9889741,0.000014295665,0.00006596974,0.0028897927,0.00021083016],"about_ca_topic_score_codex":0.000056586585,"about_ca_topic_score_gemma":0.0000122994015,"teacher_disagreement_score":0.71374625,"about_ca_system_score_codex":0.000021777289,"about_ca_system_score_gemma":0.000024390856,"threshold_uncertainty_score":0.67168564},"labels":[],"label_agreement":null},{"id":"W2063121583","doi":"10.1016/s1389-1286(00)00012-8","title":"Feature interaction detection contest of the Fifth International Workshop on Feature Interactions","year":2000,"lang":"en","type":"article","venue":"Computer Networks","topic":"Formal Methods in Verification","field":"Computer Science","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"CONTEST; Feature (linguistics); Computer science; Artificial intelligence; Operations research; Human–computer interaction; Mathematics; Linguistics; Political science","score_opus":0.019547714981176936,"score_gpt":0.28401772511138096,"score_spread":0.26447001013020405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063121583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009380864,0.000055399156,0.97527885,0.0028060281,0.009164779,0.0002503283,0.0000022277015,0.00016051684,0.0029009844],"genre_scores_gemma":[0.8936054,0.000053289106,0.101776384,0.0011136339,0.0013269384,0.000030326933,0.000011266324,0.000019840043,0.0020629284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868363,0.00020722447,0.00022694877,0.00039089343,0.0002828128,0.00020850978],"domain_scores_gemma":[0.99855715,0.00021784837,0.00023025136,0.00079661823,0.00014309974,0.000055044766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023053418,0.00019086493,0.00016278085,0.000108337124,0.00018473958,0.00017968017,0.0012217341,0.00014757995,0.00006114574],"category_scores_gemma":[0.000035406716,0.000147203,0.00016066812,0.00056548906,0.000061276456,0.00066433806,0.0001903939,0.0007761093,0.00003480245],"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.00007001057,0.00009727331,0.0001260816,0.000004574029,0.000044981432,0.0000016183994,0.00038172878,0.07526058,0.00012419306,0.0028749164,0.011117425,0.9098966],"study_design_scores_gemma":[0.00022331884,0.00006009449,0.009355282,0.00017207743,0.000008008219,0.000059406128,0.000011244159,0.863769,0.0007813178,0.00014947467,0.12526546,0.00014534305],"about_ca_topic_score_codex":0.000005432395,"about_ca_topic_score_gemma":0.000016532835,"teacher_disagreement_score":0.9097513,"about_ca_system_score_codex":0.00012798783,"about_ca_system_score_gemma":0.000017587487,"threshold_uncertainty_score":0.60027635},"labels":[],"label_agreement":null},{"id":"W2063608768","doi":"10.1016/j.comnet.2013.07.029","title":"A semi-Markov decision process-based joint call admission control for inter-RAT cell re-selection in next generation wireless networks","year":2013,"lang":"en","type":"article","venue":"Computer Networks","topic":"Advanced Wireless Network Optimization","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":"Toronto Metropolitan University","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Computer science; Markov decision process; Wireless network; Admission control; Wireless; Service (business); Computer network; Selection (genetic algorithm); Call Admission Control; Mathematical optimization; Operations research; Markov process; Quality of service; Telecommunications; Artificial intelligence","score_opus":0.012690482120211996,"score_gpt":0.22075599379151267,"score_spread":0.20806551167130066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063608768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033645853,0.0005366025,0.96213025,0.000050656763,0.001477651,0.001683307,0.0000015432084,0.00043640123,0.0000377324],"genre_scores_gemma":[0.9506846,0.00013682873,0.046145353,0.0003539154,0.001782462,0.00055773614,0.00017774948,0.00013698898,0.000024349647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976875,0.0000902916,0.00077698455,0.00057053595,0.00019552647,0.0006791705],"domain_scores_gemma":[0.9987944,0.0002830969,0.00017798785,0.00027816507,0.00026125627,0.00020510519],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025269596,0.00044791875,0.00048864813,0.00021968981,0.00014673482,0.00022526237,0.00023191827,0.00043551653,0.000040973122],"category_scores_gemma":[0.000015859794,0.00045815614,0.00012509926,0.00057707296,0.00002676474,0.00060467084,0.000039805895,0.00049574394,0.000007396098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006700832,0.00005337447,0.00026017308,0.00005369186,0.000010761027,0.0000016741268,0.000040749943,0.85946804,0.00063223863,0.0000040620366,0.012357035,0.1270512],"study_design_scores_gemma":[0.002105381,0.00015361456,0.00017396164,0.00034731612,0.000018660981,0.0000025445547,0.000005587724,0.9958291,0.0005162099,0.00006131406,0.00030899362,0.00047729386],"about_ca_topic_score_codex":0.000009114058,"about_ca_topic_score_gemma":0.00007943719,"teacher_disagreement_score":0.91703874,"about_ca_system_score_codex":0.0003060063,"about_ca_system_score_gemma":0.00003667864,"threshold_uncertainty_score":0.99978703},"labels":[],"label_agreement":null},{"id":"W2068379583","doi":"10.1016/j.comnet.2010.01.006","title":"Sender access and data distribution control for inter-domain multicast groups","year":2010,"lang":"en","type":"article","venue":"Computer Networks","topic":"Security in Wireless Sensor Networks","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":"Concordia University","funders":"","keywords":"Computer science; Multicast; Communication source; Computer network; Access control; Inter-domain; Xcast; Source-specific multicast; Computer security","score_opus":0.028002198897840672,"score_gpt":0.2949298534775314,"score_spread":0.26692765457969075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068379583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011323881,0.000108188455,0.9823264,0.001225918,0.003995315,0.00062858214,0.00007886014,0.00028535648,0.000027535038],"genre_scores_gemma":[0.9102874,0.000018424744,0.08598543,0.0009518017,0.0023636646,0.000033036245,0.00033032545,0.00002574486,0.0000042148713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976323,0.00010849523,0.00039234405,0.0010345896,0.00019502261,0.000637206],"domain_scores_gemma":[0.9966749,0.00081621466,0.00016442646,0.0019610287,0.00014569254,0.00023773809],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006420044,0.00030327297,0.00035619852,0.000057075373,0.0002585323,0.0010317407,0.0032720945,0.00026179646,0.0000056685117],"category_scores_gemma":[0.000038102662,0.000293751,0.000071979965,0.0002526533,0.00017518559,0.0011516454,0.0023657982,0.00062281406,0.000005000259],"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.00013287857,0.00040300604,0.0053058136,0.00008292679,0.00027205094,0.0000717322,0.0005696205,0.016475089,0.000091973554,0.20083848,0.09254713,0.6832093],"study_design_scores_gemma":[0.0013968819,0.00005865598,0.0024348274,0.000031482617,0.00001792963,0.000079512894,0.0000037190043,0.97828513,0.0000072414946,0.003986106,0.013361931,0.00033656412],"about_ca_topic_score_codex":0.0000093813005,"about_ca_topic_score_gemma":0.000059570197,"teacher_disagreement_score":0.96181005,"about_ca_system_score_codex":0.000024491594,"about_ca_system_score_gemma":0.000023677936,"threshold_uncertainty_score":0.9999515},"labels":[],"label_agreement":null},{"id":"W2069381764","doi":"10.1016/j.comnet.2012.02.002","title":"Optimization model for handoff-aware channel assignment problem for multi-radio wireless mesh networks","year":2012,"lang":"en","type":"article","venue":"Computer Networks","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; Computer Research Institute of Montréal","funders":"","keywords":"Computer science; Handover; Computer network; Wireless mesh network; Throughput; Tabu search; Load balancing (electrical power); Wireless; Optimization problem; Channel (broadcasting); Distributed computing; Wireless network; Algorithm; Grid; Telecommunications","score_opus":0.03579389945703969,"score_gpt":0.2541880922878915,"score_spread":0.21839419283085182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069381764","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022145767,0.00072213396,0.99143326,0.0001865203,0.00341719,0.003606047,0.000011083833,0.0005766577,0.000024984396],"genre_scores_gemma":[0.2508502,0.00012282634,0.7416449,0.0008107833,0.0038800219,0.0020923226,0.00017416543,0.00012229064,0.00030249316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99586743,0.00013135721,0.00078487286,0.0010666614,0.0003428995,0.0018067568],"domain_scores_gemma":[0.99722075,0.00038860293,0.0004301811,0.0011095965,0.00032830966,0.000522574],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010458909,0.0006277512,0.00068105635,0.00012342403,0.0005406786,0.00044746988,0.0014534041,0.00047791563,0.000004159986],"category_scores_gemma":[0.0000065098884,0.0006209954,0.00035478946,0.0004456462,0.00007045257,0.0011459225,0.00066476036,0.00037751382,0.000003620079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042537795,0.00024677778,0.000061976425,0.000045468038,0.00008673938,0.0000010005353,0.00035415613,0.9309659,5.892778e-7,0.00984285,0.02081673,0.037535246],"study_design_scores_gemma":[0.0023505508,0.00018223621,0.000027432003,0.00013711475,0.000052483745,0.000013454223,0.0000044796943,0.99563813,0.00000748011,0.00024729787,0.0005972701,0.00074205134],"about_ca_topic_score_codex":0.0000032933367,"about_ca_topic_score_gemma":0.000006091682,"teacher_disagreement_score":0.25082806,"about_ca_system_score_codex":0.00022592666,"about_ca_system_score_gemma":0.00007781278,"threshold_uncertainty_score":0.99962413},"labels":[],"label_agreement":null},{"id":"W2073814030","doi":"10.1016/j.comnet.2007.01.021","title":"Achieving optimal revenues in dynamically priced network services with QoS guarantees","year":2007,"lang":"en","type":"article","venue":"Computer Networks","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":"University of Victoria","funders":"","keywords":"Computer science; Quality of service; Revenue; Computer network; Bandwidth (computing); Heuristic; Bandwidth allocation; Path (computing); Service (business); Mathematical optimization; Distributed computing; Business","score_opus":0.002567059222805904,"score_gpt":0.1890420383085572,"score_spread":0.1864749790857513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073814030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08112609,0.001096119,0.9154224,0.000327955,0.0010836262,0.0003133478,3.4553528e-7,0.00035500858,0.00027514913],"genre_scores_gemma":[0.8467084,0.00004587093,0.14960217,0.001246129,0.0022957213,0.000015322217,0.000009430642,0.000026415828,0.000050532668],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997382,0.00012776723,0.00051445205,0.0006923524,0.00031833292,0.0009650838],"domain_scores_gemma":[0.9985268,0.00037277216,0.00020219787,0.00063686044,0.00008788008,0.00017350278],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009368875,0.00033175823,0.00040960824,0.000120632474,0.00017857192,0.00029109302,0.0013200082,0.00017068096,0.000003983033],"category_scores_gemma":[0.0000024249737,0.0002904091,0.000085519925,0.0009358933,0.00006537564,0.00046875767,0.00035481312,0.00051047676,0.000017916918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087962275,0.000059517854,0.010130482,0.000015186319,0.00003727192,0.00017687182,0.00024911264,0.6740222,0.0000024955725,0.004450158,0.0004986987,0.31027007],"study_design_scores_gemma":[0.00082369195,0.00017658692,0.044866152,0.0003623921,0.000010927135,0.000052308493,0.000009409831,0.95095176,6.5116285e-7,0.00007453429,0.0023065635,0.00036503345],"about_ca_topic_score_codex":0.000011465483,"about_ca_topic_score_gemma":0.00023507001,"teacher_disagreement_score":0.7658202,"about_ca_system_score_codex":0.00006212264,"about_ca_system_score_gemma":0.000038994094,"threshold_uncertainty_score":0.9999548},"labels":[],"label_agreement":null},{"id":"W2078515993","doi":"10.1016/j.comnet.2007.01.031","title":"QoS-aware bandwidth allocation and admission control in IEEE 802.16 broadband wireless access networks: A non-cooperative game theoretic approach","year":2007,"lang":"en","type":"article","venue":"Computer Networks","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":47,"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; Computer network; Polling; Bandwidth allocation; Quality of service; Wireless broadband; Admission control; Queueing theory; Bandwidth (computing); Base station; Call Admission Control; WiMAX; Wireless; Wireless network; Telecommunications","score_opus":0.006290188177697909,"score_gpt":0.22390130159399613,"score_spread":0.2176111134162982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078515993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026645627,0.00129065,0.9693536,0.000018570123,0.001129691,0.0008741721,0.0000019500976,0.00028860776,0.00039709048],"genre_scores_gemma":[0.9932772,0.0010065146,0.0036131518,0.00026173025,0.0015346741,0.0000671202,0.00010734038,0.00010894751,0.000023345598],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781775,0.000104305895,0.000585758,0.0005681359,0.00019623108,0.0007277865],"domain_scores_gemma":[0.9988466,0.0003161435,0.000120093566,0.00036024966,0.00011508074,0.00024186562],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044360867,0.0004647548,0.0005366023,0.00018574295,0.000099033176,0.00019722695,0.00034727543,0.00035756416,0.000009497908],"category_scores_gemma":[0.0000057379943,0.00045378605,0.000057885958,0.00070197973,0.00011252458,0.0005581449,0.00009282025,0.00058297184,0.0000016247857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010831473,0.000047997983,0.0015012539,0.000052598778,0.000038723763,0.000011957034,0.00023751667,0.9465282,0.000013723143,0.00013371253,0.0010315728,0.050294425],"study_design_scores_gemma":[0.0019447765,0.000061238614,0.0031573293,0.00031311536,0.000024652569,0.000016777718,0.000024664276,0.99374604,0.00004175391,0.0000603104,0.000112027476,0.00049730606],"about_ca_topic_score_codex":0.0000062481745,"about_ca_topic_score_gemma":0.00002863158,"teacher_disagreement_score":0.96663153,"about_ca_system_score_codex":0.00020243194,"about_ca_system_score_gemma":0.000020159558,"threshold_uncertainty_score":0.9997914},"labels":[],"label_agreement":null},{"id":"W2078630785","doi":"10.1016/j.comnet.2009.07.012","title":"An RL-based scheduling algorithm for video traffic in high-rate wireless personal area networks","year":2009,"lang":"en","type":"article","venue":"Computer Networks","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Sarepta Therapeutics","keywords":"Computer science; Scheduling (production processes); Reinforcement learning; Quality of service; Markov decision process; Computer network; Wireless; Wireless network; Provisioning; Algorithm; Real-time computing; Markov process; Telecommunications; Artificial intelligence","score_opus":0.015242849247015335,"score_gpt":0.2502713842551443,"score_spread":0.23502853500812895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078630785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017085344,0.0003190525,0.9767946,0.00048657064,0.0012101543,0.003595549,0.000003974461,0.0004925611,0.000012179672],"genre_scores_gemma":[0.70413667,0.000012704908,0.28894043,0.003456303,0.00251666,0.00082340767,0.00006268099,0.000043335964,0.000007836038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99605536,0.00032124747,0.00072482985,0.0012896538,0.00027692446,0.0013319617],"domain_scores_gemma":[0.9977863,0.00047244542,0.00027555384,0.00089629035,0.00017646918,0.00039295864],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011327583,0.00058609457,0.00072153227,0.00022791489,0.00035013707,0.0008170682,0.0017582143,0.00037918278,0.000009754102],"category_scores_gemma":[0.0000039031806,0.00058429624,0.00025154537,0.001000011,0.00007482009,0.00075350667,0.00012920894,0.00073446723,0.0000037179232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030273424,0.00014380799,0.000057375444,0.000005697899,0.000009560328,0.000035064477,0.000058802954,0.5532627,0.0000016096333,0.0007869598,0.0006092385,0.4449989],"study_design_scores_gemma":[0.0023123052,0.00080137,0.0017322637,0.00030324777,0.0000105212375,0.000013062278,0.0000040839404,0.9929025,0.0000097942375,0.00057237496,0.00061197154,0.0007264764],"about_ca_topic_score_codex":0.000011019988,"about_ca_topic_score_gemma":0.000025355206,"teacher_disagreement_score":0.6878542,"about_ca_system_score_codex":0.00011991361,"about_ca_system_score_gemma":0.00014011501,"threshold_uncertainty_score":0.99966085},"labels":[],"label_agreement":null},{"id":"W2079521226","doi":"10.1016/j.comnet.2004.01.001","title":"A systematic approach for encryption and authentication with fault tolerance","year":2004,"lang":"en","type":"article","venue":"Computer Networks","topic":"Cryptography and Data Security","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 Regina","funders":"","keywords":"Checksum; Computer science; Encryption; Error detection and correction; Hash function; Overhead (engineering); Authentication (law); Fault tolerance; Computation; Computer engineering; Cryptosystem; Algorithm; Theoretical computer science; Distributed computing; Computer network; Computer security; Operating system","score_opus":0.007780039958344512,"score_gpt":0.20387045805319748,"score_spread":0.19609041809485298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079521226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004690714,0.0004611291,0.9937626,0.00007841051,0.0001447653,0.00070006034,0.0000016404657,0.00013236064,0.000028282137],"genre_scores_gemma":[0.5208464,0.000012763418,0.47879854,0.00012020744,0.000112332884,0.000087014785,0.000017283595,0.0000046398036,7.717562e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990947,0.00003305832,0.00018618802,0.00036998218,0.00011942535,0.00019664459],"domain_scores_gemma":[0.99927866,0.00006250204,0.00009563538,0.000430776,0.00006398773,0.000068447705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022021738,0.00012468698,0.00018041946,0.0000549131,0.00013721576,0.00023340457,0.00035141603,0.000057117322,1.804463e-7],"category_scores_gemma":[0.0000031395707,0.00009815184,0.00004162289,0.0002473936,0.00004360102,0.00038871716,0.000091996764,0.00007972638,9.118352e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038924936,0.00026272118,0.00017207178,0.003714003,0.00008601796,0.000003903877,0.002750066,0.19286752,0.000016370968,0.7894094,0.0002932292,0.010385758],"study_design_scores_gemma":[0.0006103112,0.000116482486,0.0007078587,0.00049558515,0.000017619532,0.000034717108,0.000009115252,0.99188477,0.000008347293,0.005936435,0.000029980003,0.0001487805],"about_ca_topic_score_codex":0.0000034800537,"about_ca_topic_score_gemma":0.0000019652255,"teacher_disagreement_score":0.79901725,"about_ca_system_score_codex":0.00001570635,"about_ca_system_score_gemma":0.000014906978,"threshold_uncertainty_score":0.40025157},"labels":[],"label_agreement":null},{"id":"W2081502683","doi":"10.1016/j.comnet.2015.01.003","title":"A novel macroscopic mobility model for vehicular networks","year":2015,"lang":"en","type":"article","venue":"Computer Networks","topic":"Vehicular Ad Hoc Networks (VANETs)","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 Ottawa","funders":"","keywords":"Computer science; Vehicular ad hoc network; Mobility model; TRACE (psycholinguistics); Scale (ratio); Process (computing); Task (project management); Wireless ad hoc network; Simulation; Distributed computing; Telecommunications; Systems engineering; Wireless","score_opus":0.024968755587534593,"score_gpt":0.23150943005339555,"score_spread":0.20654067446586097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081502683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016483972,0.0024888746,0.9764016,0.00003883604,0.0025197205,0.00092321384,0.0000119302385,0.0009519874,0.0001798641],"genre_scores_gemma":[0.9055684,0.00005656384,0.09040529,0.0004803075,0.0028257335,0.00022948191,0.00014436856,0.00017922159,0.000110633344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748904,0.000037618105,0.0005242071,0.00058294635,0.000261261,0.0011049066],"domain_scores_gemma":[0.99828386,0.00012030913,0.0000691386,0.0008372868,0.00017772808,0.00051164674],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005926805,0.0004882473,0.00055105786,0.000067159956,0.000113501344,0.00015875064,0.0005560669,0.0004257576,0.0000053071226],"category_scores_gemma":[0.000011507292,0.000515425,0.00024110614,0.0003081235,0.00007916527,0.00021258689,0.00020891208,0.00056080153,0.00001445632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002288545,0.000062594234,0.00012549013,0.000036921338,0.0000933617,0.000006756742,0.00008587003,0.9601696,0.000011024173,0.00022608979,0.03190113,0.007258281],"study_design_scores_gemma":[0.001403167,0.000073374016,0.00014184063,0.00006934515,0.00004961332,0.00002622625,0.0000035361652,0.9929885,0.0000076639035,0.00034094547,0.004353394,0.000542371],"about_ca_topic_score_codex":0.000006350988,"about_ca_topic_score_gemma":0.00002962172,"teacher_disagreement_score":0.8890844,"about_ca_system_score_codex":0.0002347692,"about_ca_system_score_gemma":0.000052983123,"threshold_uncertainty_score":0.99972975},"labels":[],"label_agreement":null},{"id":"W2083719968","doi":"10.1016/j.comnet.2011.05.010","title":"Routing protocols in ad hoc networks: A survey","year":2011,"lang":"en","type":"article","venue":"Computer Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":535,"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 ad hoc network; Optimized Link State Routing Protocol; Adaptive quality of service multi-hop routing; Routing protocol; Distributed computing; Mobile ad hoc network; Ad hoc wireless distribution service; Wireless Routing Protocol; Link-state routing protocol; Vehicular ad hoc network; Wireless; Routing (electronic design automation); Telecommunications; Network packet","score_opus":0.050509421160152564,"score_gpt":0.2641481605096089,"score_spread":0.21363873934945632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083719968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013436195,0.0007954974,0.9889573,0.000027186268,0.0013297235,0.00603797,7.9451917e-7,0.0005105349,0.0009973875],"genre_scores_gemma":[0.83855814,0.00014193657,0.15339358,0.0014127286,0.0013598916,0.0048855506,0.00002521539,0.00010505839,0.00011792735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99540585,0.00075241434,0.0009047232,0.0012163448,0.00035026282,0.0013703869],"domain_scores_gemma":[0.99700487,0.00043873742,0.00033056864,0.0017723785,0.00015169701,0.0003017657],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021585107,0.00049836753,0.0006228474,0.00017558891,0.00016715044,0.00036150002,0.0029114303,0.0003502345,0.00004013954],"category_scores_gemma":[0.000024401636,0.0005003495,0.00015436765,0.0016645587,0.00009660303,0.0007537184,0.0015909397,0.00091521064,0.000053826803],"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.00009921059,0.000390717,0.067482896,0.000018096818,0.000056464803,0.00027938985,0.0011700217,0.2457992,4.8894134e-7,0.006304508,0.010087059,0.66831195],"study_design_scores_gemma":[0.00070279243,0.00020477177,0.12628801,0.00022268448,0.0000029962368,0.00002618816,0.000002439706,0.86967343,0.0000023566283,0.00040698724,0.0019656774,0.00050168263],"about_ca_topic_score_codex":0.00006955867,"about_ca_topic_score_gemma":0.00043204127,"teacher_disagreement_score":0.83721447,"about_ca_system_score_codex":0.000121832185,"about_ca_system_score_gemma":0.000085900836,"threshold_uncertainty_score":0.99974483},"labels":[],"label_agreement":null},{"id":"W2088531720","doi":"10.1016/s1389-1286(00)00186-9","title":"An end-to-end communication architecture for collaborative virtual environments","year":2001,"lang":"en","type":"article","venue":"Computer Networks","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":85,"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; Architecture; Focus (optics); Protocol (science); Human–computer interaction; Collaborative virtual environment; Object (grammar); Virtual reality; Layer (electronics); Transmission (telecommunications); State (computer science); Distributed computing; Computer network; Telecommunications; Artificial intelligence; Programming language","score_opus":0.012265574173451194,"score_gpt":0.23676647370288373,"score_spread":0.22450089952943253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088531720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002924237,0.00022951343,0.9933103,0.0009991631,0.0006566618,0.00133824,0.000005848185,0.00020560402,0.00033047065],"genre_scores_gemma":[0.6143001,0.00014437114,0.37756947,0.0059647616,0.00096815114,0.00047732593,0.00017067515,0.00004993904,0.00035523257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976231,0.00032080064,0.00036459492,0.0007762328,0.00032927401,0.0005860285],"domain_scores_gemma":[0.99731654,0.0002802139,0.0001618927,0.0018969297,0.00005564968,0.00028875947],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048725665,0.00031057984,0.00027507544,0.00014774827,0.00034046645,0.00042334956,0.0022717933,0.000108241045,0.000031743635],"category_scores_gemma":[0.000004386089,0.00031589527,0.00008567614,0.00069065654,0.00007289653,0.00038337844,0.0008373968,0.00023828703,0.00004182947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027941129,0.00009789253,0.00008684828,0.0000019980155,0.000035739442,0.000008271375,0.00037198397,0.5957905,0.000011168158,0.010664239,0.011979978,0.38092342],"study_design_scores_gemma":[0.0005192335,0.00055282883,0.0008502521,0.000026510748,0.000011895983,0.0000049951723,0.000014403013,0.7132286,0.00002091668,0.0005985203,0.28388077,0.00029108528],"about_ca_topic_score_codex":0.000008016676,"about_ca_topic_score_gemma":0.000033625034,"teacher_disagreement_score":0.6157408,"about_ca_system_score_codex":0.00015668532,"about_ca_system_score_gemma":0.00003580545,"threshold_uncertainty_score":0.9999293},"labels":[],"label_agreement":null},{"id":"W2094785769","doi":"10.1016/j.comnet.2010.11.013","title":"On the design of reliable wireless mesh network infrastructure with QoS constraints","year":2010,"lang":"en","type":"article","venue":"Computer Networks","topic":"Mobile Ad Hoc Networks","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":"Université de Montréal","funders":"","keywords":"Computer science; Wireless mesh network; Order One Network Protocol; Computer network; Mesh networking; Reliability (semiconductor); Distributed computing; Heuristics; Network topology; Network planning and design; Switched mesh; Node (physics); Wireless network; Optical mesh network; Wireless","score_opus":0.007384186214868718,"score_gpt":0.1943633807917454,"score_spread":0.18697919457687667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094785769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006819587,0.000043832046,0.98793596,0.00028792562,0.0030562307,0.00075049984,9.677041e-7,0.00020848971,0.00089649647],"genre_scores_gemma":[0.83435315,0.00002124896,0.16192523,0.0017017458,0.0018534438,0.00005471063,0.000003823531,0.000040504958,0.00004616641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973855,0.00021764907,0.00045251686,0.0006938804,0.00046509248,0.0007853732],"domain_scores_gemma":[0.9961999,0.0012397644,0.0003500753,0.0018374163,0.00018721442,0.00018564623],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008351992,0.00040604587,0.00045350485,0.00005534104,0.0002827297,0.00024218208,0.002439533,0.000287013,0.00010733413],"category_scores_gemma":[0.000011312119,0.000259413,0.00009868577,0.0008359423,0.0005164746,0.00023921023,0.00052250887,0.001320766,0.000016238058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031245396,0.000032680382,0.0003198043,0.0000050939184,0.000053702126,0.000021572841,0.000082089224,0.6730146,0.000016647416,0.20569272,0.08067042,0.040059436],"study_design_scores_gemma":[0.00043970486,0.00027734015,0.00084282656,0.00014650854,0.000014381371,0.00007502305,0.0000027307467,0.9909744,0.0000666723,0.0051856698,0.0016488992,0.00032584203],"about_ca_topic_score_codex":0.00000435403,"about_ca_topic_score_gemma":0.000007201057,"teacher_disagreement_score":0.82753354,"about_ca_system_score_codex":0.000024248233,"about_ca_system_score_gemma":0.00014281127,"threshold_uncertainty_score":0.9999858},"labels":[],"label_agreement":null},{"id":"W2097350115","doi":"10.1016/j.comnet.2011.02.011","title":"Large scale probabilistic available bandwidth estimation","year":2011,"lang":"en","type":"article","venue":"Computer Networks","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":"McGill University","funders":"","keywords":"Computer science; Probabilistic logic; Bandwidth (computing); Network packet; PlanetLab; Real-time computing; Computer network; Distributed computing; Scalability; Artificial intelligence","score_opus":0.015293814900849752,"score_gpt":0.19757449499237653,"score_spread":0.1822806800915268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097350115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013182586,0.0003158827,0.9913402,0.00010588308,0.0015493421,0.0002878714,7.830825e-7,0.0006095928,0.004472186],"genre_scores_gemma":[0.82427514,0.00001547945,0.17365511,0.0007090868,0.00058814365,0.00004877473,0.000009569669,0.000019036343,0.00067965203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998284,0.0001022951,0.00031223096,0.0005521633,0.00020585246,0.00054345344],"domain_scores_gemma":[0.9988007,0.00009569973,0.00011148253,0.00072632515,0.00008838293,0.00017740215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039719534,0.0002152715,0.0002404926,0.00006660179,0.00020406392,0.00017326769,0.000879739,0.00011774162,0.00019118533],"category_scores_gemma":[0.0000057145835,0.00020095693,0.00008992972,0.0003792999,0.00004789967,0.00045828687,0.00028466198,0.0002218737,0.00048270708],"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.000024132005,0.00037154127,0.0014825965,0.000021417545,0.00005328097,0.000040598105,0.0018730857,0.12061125,8.1091025e-7,0.083796255,0.0632835,0.72844154],"study_design_scores_gemma":[0.00051382155,0.00009753434,0.00083162024,0.000036818015,0.000012358164,0.000019545669,0.0000029102057,0.9906462,0.0000035286585,0.0024691843,0.005124949,0.00024152354],"about_ca_topic_score_codex":0.00000412447,"about_ca_topic_score_gemma":0.000011992349,"teacher_disagreement_score":0.87003493,"about_ca_system_score_codex":0.00003398632,"about_ca_system_score_gemma":0.00004291886,"threshold_uncertainty_score":0.8194786},"labels":[],"label_agreement":null},{"id":"W2098119380","doi":"10.1016/j.comnet.2010.03.012","title":"Interference aware resource allocation for hybrid hierarchical wireless networks","year":2010,"lang":"en","type":"article","venue":"Computer Networks","topic":"Advanced Wireless Network Optimization","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Computer science; Resource allocation; Computer network; Wireless network; Subcarrier; Radio resource management; Throughput; Interference (communication); Wireless; Quality of service; Distributed computing; Heuristic; Exploit; Orthogonal frequency-division multiplexing; Telecommunications; Channel (broadcasting)","score_opus":0.00630262066891268,"score_gpt":0.20701633522198595,"score_spread":0.20071371455307327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098119380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010110365,0.00014996849,0.9855723,0.00007554863,0.002631237,0.0004689302,0.0000045572883,0.00082432345,0.00016277166],"genre_scores_gemma":[0.9558807,0.000085138185,0.039675355,0.00020192645,0.0035590383,0.000116583484,0.00032449947,0.00011625238,0.00004048006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984628,0.000035438024,0.0003921612,0.0004165879,0.00012082,0.00057219143],"domain_scores_gemma":[0.99886173,0.0002935273,0.000074347365,0.00049439084,0.000102477374,0.00017352511],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016852938,0.00031517548,0.0002974671,0.00008018473,0.00015390643,0.000110208784,0.0004410231,0.0002294347,0.000015813805],"category_scores_gemma":[0.0000073730816,0.00034478106,0.000097963166,0.0002383883,0.000085862004,0.00019688395,0.00011767858,0.0008307579,0.00000557435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021334054,0.000014381232,0.00007192552,0.000017588944,0.00002164021,0.0000023136472,0.000026350315,0.8069256,0.000025056617,0.0007467742,0.009112598,0.18301444],"study_design_scores_gemma":[0.00038692114,0.00004795408,0.00017030984,0.000075434305,0.00001404553,0.00001721031,0.0000024734854,0.99039364,0.000072772535,0.00021770333,0.008229705,0.00037185266],"about_ca_topic_score_codex":8.4392116e-7,"about_ca_topic_score_gemma":0.0000140564935,"teacher_disagreement_score":0.9458969,"about_ca_system_score_codex":0.00004886094,"about_ca_system_score_gemma":0.000012672799,"threshold_uncertainty_score":0.9999004},"labels":[],"label_agreement":null},{"id":"W2099340562","doi":"10.1016/j.comnet.2011.08.018","title":"Traffic-prediction-assisted dynamic bandwidth assignment for hybrid optical wireless networks","year":2011,"lang":"en","type":"article","venue":"Computer Networks","topic":"Advanced Photonic Communication Systems","field":"Engineering","cited_by":21,"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; Computer network; Dynamic bandwidth allocation; Bandwidth (computing); Wireless network; Wireless; Telecommunications","score_opus":0.018738297843332995,"score_gpt":0.2164976568428804,"score_spread":0.19775935899954739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099340562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009031472,0.00078723615,0.9855,0.000012693109,0.0024909854,0.0005728336,0.000011812198,0.00082100614,0.0007719674],"genre_scores_gemma":[0.97070897,0.00014381236,0.028181043,0.000056750814,0.0004238487,0.00024104537,0.00011523141,0.00008790572,0.00004138386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984842,0.0000501439,0.0005185001,0.00031767166,0.00014057219,0.0004889138],"domain_scores_gemma":[0.99867636,0.00022152837,0.00007657471,0.000780927,0.00006592445,0.0001786703],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002148053,0.00027869802,0.00034123036,0.00006194066,0.00013813774,0.00004981399,0.0005096341,0.00014982274,0.000034423087],"category_scores_gemma":[0.0000024879123,0.00029906322,0.0001456103,0.00016104826,0.000061382474,0.00012146537,0.00011212597,0.0003546144,0.000009002654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020891819,0.000045931258,0.00004078675,0.00001939654,0.0000936398,0.000003969599,0.000096366806,0.8625882,0.000008648061,0.00016637002,0.0031877179,0.13372803],"study_design_scores_gemma":[0.0006486285,0.00007372487,0.0011613305,0.00008892422,0.000030464662,0.00003778103,0.000012459241,0.99310845,0.000031357416,0.00004228875,0.004477843,0.00028675125],"about_ca_topic_score_codex":0.0000013517077,"about_ca_topic_score_gemma":0.000007938667,"teacher_disagreement_score":0.9616775,"about_ca_system_score_codex":0.00018483459,"about_ca_system_score_gemma":0.00001428004,"threshold_uncertainty_score":0.9999462},"labels":[],"label_agreement":null},{"id":"W2103792020","doi":"10.1016/j.comnet.2008.11.003","title":"Overcoming controllability problems with fewest channels between testers","year":2008,"lang":"en","type":"article","venue":"Computer Networks","topic":"Software Testing and Debugging Techniques","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 Ottawa","funders":"","keywords":"Controllability; Computer science; Port (circuit theory); Sequence (biology); Set (abstract data type); Software deployment; Test (biology); Distributed computing; Mathematics; Engineering","score_opus":0.028572891636590967,"score_gpt":0.22464161361730314,"score_spread":0.19606872198071218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103792020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028497754,0.00013656996,0.9622159,0.0003673908,0.0003939336,0.00035275472,7.666147e-7,0.007892217,0.0001427221],"genre_scores_gemma":[0.76837665,0.0000055982655,0.23034632,0.0005667652,0.00062481075,0.000029634275,0.000004403121,0.000020329422,0.000025493755],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806523,0.00011077666,0.00032816065,0.0006611762,0.00028697256,0.0005476887],"domain_scores_gemma":[0.9978129,0.00077208073,0.00015720926,0.00093131786,0.0001447542,0.00018169844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004050787,0.00028820036,0.0004088665,0.00009521536,0.00032774286,0.0002036549,0.0010247142,0.00012036585,0.0000014671376],"category_scores_gemma":[0.000029631294,0.00023718057,0.00007849345,0.0005093626,0.00015268919,0.00038634043,0.00041463453,0.0003233903,0.00000852145],"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.00002195737,0.00017698183,0.74865896,0.000051304825,0.000118298594,0.00018743174,0.0013028483,0.08836968,0.000003534229,0.0006905122,0.034846433,0.12557207],"study_design_scores_gemma":[0.0008572616,0.0005169678,0.06857345,0.00024205477,0.000014001189,0.00024899954,5.2254615e-7,0.92350525,0.00001801822,0.003947337,0.0014875068,0.0005886501],"about_ca_topic_score_codex":0.000051110088,"about_ca_topic_score_gemma":0.0000022218976,"teacher_disagreement_score":0.8351355,"about_ca_system_score_codex":0.000061260376,"about_ca_system_score_gemma":0.000061453786,"threshold_uncertainty_score":0.9671943},"labels":[],"label_agreement":null},{"id":"W2111692745","doi":"10.1016/j.comnet.2007.06.022","title":"Stability and TCP-friendliness of AIMD/RED systems with feedback delays","year":2007,"lang":"en","type":"article","venue":"Computer Networks","topic":"Network Traffic and Congestion Control","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":"University of Victoria; University of Waterloo","funders":"","keywords":"Control theory (sociology); Computer science; Stability (learning theory); Transmission Control Protocol; Lyapunov function; Multiplicative function; Exponential stability; Flow control (data); Transmission (telecommunications); Flow (mathematics); Mathematics; Control (management); Telecommunications; Computer network; Mathematical analysis; Nonlinear system","score_opus":0.0088761823635611,"score_gpt":0.193013163034942,"score_spread":0.1841369806713809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111692745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028939435,0.0010140715,0.96788985,0.0001679963,0.00097115483,0.00030371628,9.585384e-7,0.0001817629,0.000531029],"genre_scores_gemma":[0.9833715,0.000020160809,0.015885659,0.00013543558,0.0005343898,0.000008137417,0.0000030138738,0.000012942801,0.000028791093],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824846,0.00009260691,0.00044659167,0.00050834095,0.00025920448,0.00044481835],"domain_scores_gemma":[0.99840575,0.0003478467,0.00019404852,0.0006340491,0.00022169575,0.00019659253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007664883,0.00022200134,0.0003739291,0.00006397342,0.000105906656,0.00012894161,0.00057868427,0.000120111385,0.0000050723424],"category_scores_gemma":[0.000003936361,0.00018039391,0.000049778537,0.000452755,0.0001413172,0.00025324262,0.00017626266,0.00021097418,0.0000021062403],"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.00020461084,0.00018535294,0.014660767,0.000086281805,0.00012775704,0.00007130893,0.00045669085,0.22231342,0.000009645731,0.037916597,0.0017429648,0.7222246],"study_design_scores_gemma":[0.00087379065,0.00019643448,0.00690145,0.00008273637,0.000014845078,0.000058109665,0.00001858759,0.9898015,0.000012343399,0.000059704675,0.0017555153,0.00022493672],"about_ca_topic_score_codex":0.000016634505,"about_ca_topic_score_gemma":0.00002646607,"teacher_disagreement_score":0.954432,"about_ca_system_score_codex":0.000026184696,"about_ca_system_score_gemma":0.000039212497,"threshold_uncertainty_score":0.735625},"labels":[],"label_agreement":null},{"id":"W2113292847","doi":"10.1016/j.comnet.2012.02.015","title":"A bandwidth and effective hit optimal cache scheme for wireless data access networks with client injected updates","year":2012,"lang":"en","type":"article","venue":"Computer Networks","topic":"Caching and Content Delivery","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":"University of Waterloo","funders":"","keywords":"Computer science; Cache; Computer network; Cache invalidation; Bandwidth (computing); Cache algorithms; WiMAX; Wireless network; Smart Cache; Data access; Wireless; Distributed computing; CPU cache; Telecommunications; Database","score_opus":0.026932808309434467,"score_gpt":0.26445712566723295,"score_spread":0.2375243173577985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113292847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1234904,0.0013925164,0.8730821,0.00013289845,0.0009589396,0.0006644744,0.000008481225,0.00024161364,0.000028548146],"genre_scores_gemma":[0.9525571,0.000052002364,0.044895448,0.000704194,0.0014938491,0.00009051203,0.00014779324,0.000033606164,0.000025516421],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977446,0.00014773545,0.0002690557,0.00082955096,0.0002089257,0.00080013764],"domain_scores_gemma":[0.9977687,0.00049310393,0.00016175443,0.0011694125,0.00012972318,0.00027731786],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061492546,0.00034612895,0.00040176828,0.000090041045,0.0003022901,0.000701861,0.0018473543,0.00015327026,0.000001836471],"category_scores_gemma":[0.000008256773,0.0002803689,0.00006154965,0.0003886193,0.00009483306,0.0015972382,0.0023833988,0.0003878773,0.0000020321713],"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.0006038939,0.00061496167,0.08093143,0.00011150511,0.0008323641,0.000039240742,0.00090437784,0.20965399,0.00002313598,0.0058939904,0.042515773,0.65787536],"study_design_scores_gemma":[0.0010768063,0.00022835127,0.01173658,0.00011085759,0.000045796023,0.000057846766,0.0000062348645,0.98472065,0.000009215995,0.000015559772,0.0015882881,0.00040384085],"about_ca_topic_score_codex":0.000034025397,"about_ca_topic_score_gemma":0.0000142371255,"teacher_disagreement_score":0.8290667,"about_ca_system_score_codex":0.000044744815,"about_ca_system_score_gemma":0.000032794753,"threshold_uncertainty_score":0.99996483},"labels":[],"label_agreement":null},{"id":"W2114865559","doi":"10.1016/j.comnet.2012.01.023","title":"Design principles and improvement of cost function based energy aware routing algorithms for wireless sensor networks","year":2012,"lang":"en","type":"article","venue":"Computer Networks","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":121,"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; Routing (electronic design automation); Energy consumption; Function (biology); Algorithm; Energy (signal processing); Wireless sensor network; Efficient energy use; Computer network","score_opus":0.03350653402361728,"score_gpt":0.23351996110550366,"score_spread":0.20001342708188638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114865559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019659149,0.00073109724,0.9934388,0.0000716896,0.0028218925,0.00065545476,0.0000025448198,0.00028785004,0.000024796835],"genre_scores_gemma":[0.79430777,0.00005761516,0.20314057,0.0005696266,0.0016714195,0.0001180074,0.000037244223,0.000057517373,0.000040239152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676275,0.00021095859,0.0007340377,0.00076857506,0.00035169566,0.001171966],"domain_scores_gemma":[0.99709845,0.000985036,0.00051809184,0.0007981989,0.00026887874,0.0003313562],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000999903,0.00047208706,0.0005528545,0.00015662686,0.00032889482,0.00019202409,0.00068448967,0.0003198821,0.0000028091013],"category_scores_gemma":[0.000007111665,0.00045944916,0.00016366434,0.0005107145,0.00011474839,0.00041452848,0.00050161564,0.00026658908,6.299069e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004101284,0.00011348155,0.00046676237,0.00001936111,0.00005127901,0.0000016960983,0.000050566083,0.7429907,0.00004047094,0.0038644488,0.0003455656,0.2520147],"study_design_scores_gemma":[0.0010122355,0.00037112515,0.0005625204,0.00014027747,0.00004323391,0.000009826279,0.000009742211,0.99523026,0.00065163214,0.000019228166,0.0014651401,0.00048478003],"about_ca_topic_score_codex":0.000021357924,"about_ca_topic_score_gemma":0.0000048060924,"teacher_disagreement_score":0.7923418,"about_ca_system_score_codex":0.00010085645,"about_ca_system_score_gemma":0.00005055948,"threshold_uncertainty_score":0.9997857},"labels":[],"label_agreement":null},{"id":"W2121522742","doi":"10.1016/j.comnet.2014.12.009","title":"Fighting pollution attacks in P2P streaming","year":2015,"lang":"en","type":"article","venue":"Computer Networks","topic":"Peer-to-Peer Network Technologies","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 Calgary","funders":"","keywords":"Computer science; Reputation; Key (lock); Reputation system; The Internet; Computer security; Peer-to-peer; Computer network; Single point of failure; Pollution; Distributed computing; World Wide Web","score_opus":0.027746372644504188,"score_gpt":0.25555827052893887,"score_spread":0.22781189788443468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121522742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025851043,0.00041134647,0.96771646,0.0021570325,0.001633647,0.00022229977,5.6918867e-7,0.0010453624,0.0009622704],"genre_scores_gemma":[0.8002204,0.000007295947,0.19810961,0.000954045,0.00059805263,0.000018471977,0.0000044830444,0.000016710486,0.000070934555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977565,0.00009759488,0.00039064616,0.00066731544,0.0003303214,0.00075766526],"domain_scores_gemma":[0.9985511,0.000102731094,0.00010897091,0.0009153302,0.00010190032,0.00022000787],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061899895,0.0002570998,0.0002958756,0.00032354528,0.00008895531,0.00027663325,0.0017840981,0.00020379023,0.0000016466098],"category_scores_gemma":[0.00004774969,0.00026060583,0.000059240578,0.0014387334,0.000043012937,0.0005056755,0.0016527214,0.0004288625,0.0000683434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054827497,0.00004162654,0.004024472,0.000003471379,0.000010030651,0.000084718806,0.00044168197,0.49671337,0.000005270244,0.0049900333,0.039976593,0.45370322],"study_design_scores_gemma":[0.00038868823,0.00011369965,0.007710156,0.00010959143,0.0000022654901,0.000027685375,0.000018012866,0.9786752,0.000031151514,0.0019812211,0.010612855,0.00032945952],"about_ca_topic_score_codex":0.000038868126,"about_ca_topic_score_gemma":0.00006286298,"teacher_disagreement_score":0.77436936,"about_ca_system_score_codex":0.00023134939,"about_ca_system_score_gemma":0.0000622867,"threshold_uncertainty_score":0.9999846},"labels":[],"label_agreement":null},{"id":"W2124042983","doi":"10.1016/j.comnet.2014.10.004","title":"On the energy cost of robustness and resiliency in IP networks","year":2014,"lang":"en","type":"article","venue":"Computer Networks","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":22,"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; Robustness (evolution); Distributed computing; Computer network","score_opus":0.006333640383086774,"score_gpt":0.18620722186322808,"score_spread":0.1798735814801413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124042983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023327125,0.00086126674,0.9743911,0.00007197438,0.0003633364,0.00010913953,2.439961e-7,0.0002287525,0.00064707105],"genre_scores_gemma":[0.991613,0.0004156855,0.007547881,0.0001363814,0.00022722069,0.000022222364,0.0000021724486,0.00002733228,0.00000812086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991059,0.000045264456,0.00023873925,0.00019622012,0.00008152853,0.00033237663],"domain_scores_gemma":[0.99879783,0.0007280605,0.00003414079,0.00038222846,0.00001828938,0.000039440183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001616231,0.00016983885,0.00023463574,0.000057643858,0.0000380501,0.00001977273,0.00029575705,0.00016845911,0.0000043569617],"category_scores_gemma":[0.000020425055,0.0001286665,0.000029439545,0.00031173593,0.00014593218,0.000049649843,0.00014272101,0.00034825868,5.7930015e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058776955,0.000007958982,0.00015098233,0.0000050145627,0.0000058697383,0.000001729912,0.0000054082493,0.81851673,6.8864813e-7,0.03778129,0.001421257,0.14209716],"study_design_scores_gemma":[0.00016861915,0.000051361676,0.00144478,0.00010305301,0.0000031490056,0.0000022171557,0.0000032718842,0.994781,0.000009404666,0.0025592248,0.0007356555,0.00013825546],"about_ca_topic_score_codex":0.000002010866,"about_ca_topic_score_gemma":0.000016925953,"teacher_disagreement_score":0.96828586,"about_ca_system_score_codex":0.000022423497,"about_ca_system_score_gemma":0.0000018013812,"threshold_uncertainty_score":0.52468675},"labels":[],"label_agreement":null},{"id":"W2124377129","doi":"10.1016/j.comnet.2008.09.012","title":"Mobility-aware clustering algorithms with interference constraints in wireless mesh networks","year":2008,"lang":"en","type":"article","venue":"Computer Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":56,"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; Cluster analysis; Computer network; Interference (communication); Throughput; Wireless mesh network; Distributed computing; Metric (unit); Wireless; Wireless network; Algorithm; Telecommunications; Machine learning","score_opus":0.017695455332587318,"score_gpt":0.225574170565699,"score_spread":0.2078787152331117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124377129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014380505,0.00017556192,0.9821677,0.00008130788,0.0015577547,0.00070989376,0.0000014258602,0.0005281835,0.00039763286],"genre_scores_gemma":[0.9547298,0.0001773127,0.043322317,0.00067799946,0.00085616804,0.000119127166,0.000016258064,0.000054579872,0.00004641563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99558246,0.00030781046,0.0008302813,0.0014954312,0.00044333097,0.0013406646],"domain_scores_gemma":[0.9971361,0.00041170244,0.0002667203,0.001619481,0.00018942214,0.0003765412],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000567833,0.0006404102,0.0007865519,0.00019843876,0.0002827039,0.0002761396,0.0023925246,0.00035202847,0.000036093857],"category_scores_gemma":[0.0000045304523,0.0005948859,0.00013891907,0.0012946414,0.00058276736,0.0008031606,0.0014601535,0.0012193924,0.000018467183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053651187,0.00024116112,0.011439531,0.00002453965,0.000063172716,0.0010585051,0.0006091741,0.70387155,0.000001298498,0.0022552076,0.0015173464,0.27886486],"study_design_scores_gemma":[0.0010968626,0.00028727227,0.008572261,0.00038554455,0.0000068350696,0.0006824613,0.000014821937,0.98811907,0.000007359676,0.00006516082,0.000072278664,0.0006900767],"about_ca_topic_score_codex":0.000048269052,"about_ca_topic_score_gemma":0.00015976105,"teacher_disagreement_score":0.94034934,"about_ca_system_score_codex":0.00019951785,"about_ca_system_score_gemma":0.0001439725,"threshold_uncertainty_score":0.99965024},"labels":[],"label_agreement":null},{"id":"W2134576430","doi":"10.1016/j.bjp.2014.01.004","title":"Energy efficient management framework for multihop TDMA-based wireless networks","year":2014,"lang":"en","type":"article","venue":"Computer Networks","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 Waterloo","funders":"European Commission","keywords":"Computer science; Time division multiple access; Computer network; Energy consumption; Scheduling (production processes); Efficient energy use; Wireless; Distributed computing; Mathematical optimization; Telecommunications; Mathematics","score_opus":0.008224359579328155,"score_gpt":0.22003438411646578,"score_spread":0.21181002453713763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134576430","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020386023,0.00046326718,0.99090326,0.00033793747,0.0057899277,0.0008372581,0.0000013779267,0.00087686366,0.0005862509],"genre_scores_gemma":[0.55592513,0.000035138313,0.43640935,0.0042237397,0.002836307,0.00037451516,0.000032204025,0.0000790611,0.000084541134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952644,0.00030347236,0.0007735888,0.0015933556,0.0005256226,0.0015395219],"domain_scores_gemma":[0.99518263,0.0014428969,0.0003639636,0.002370567,0.00019725146,0.00044268533],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009050902,0.0006728159,0.0006793891,0.0002004122,0.00046587898,0.0005815569,0.0028989818,0.00048644,0.000012980645],"category_scores_gemma":[0.00000928272,0.0006718257,0.00040432802,0.00096898817,0.00012743556,0.00017161308,0.0010734039,0.0005372725,0.000018974786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017584296,0.000096768614,0.000032987846,0.00001717173,0.000039388022,0.000008661218,0.00001529541,0.4992905,1.5789215e-7,0.19167021,0.004412405,0.30439886],"study_design_scores_gemma":[0.0012379624,0.00022532868,0.0002566113,0.0002658619,0.000034783832,0.0000064345886,0.000001667603,0.96276146,0.000013548553,0.0035980898,0.030847698,0.000750568],"about_ca_topic_score_codex":0.0000081097705,"about_ca_topic_score_gemma":0.0000062651793,"teacher_disagreement_score":0.5557213,"about_ca_system_score_codex":0.00013668461,"about_ca_system_score_gemma":0.000033006734,"threshold_uncertainty_score":0.9995733},"labels":[],"label_agreement":null},{"id":"W2135536458","doi":"10.1016/j.comnet.2010.05.005","title":"REACT: An RFID-based privacy-preserving children tracking scheme for large amusement parks","year":2010,"lang":"en","type":"article","venue":"Computer Networks","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":31,"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; University of Ontario Institute of Technology","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Amusement; Scheme (mathematics); Node (physics); Theme park; Computer security; Tracking (education); Process (computing); Identity (music); Computer network; Internet privacy; Tourism; Law","score_opus":0.008967940755026695,"score_gpt":0.2273155193027539,"score_spread":0.2183475785477272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135536458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33593675,0.00024876298,0.6605337,0.0000685668,0.0016098968,0.0007040581,0.00001044747,0.00080064184,0.000087140514],"genre_scores_gemma":[0.9114691,0.000013864129,0.083519354,0.00039841112,0.0038866086,0.00009811765,0.00043124598,0.00017260919,0.0000106870275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754333,0.000048197857,0.00046582337,0.0005668122,0.0002535973,0.0011222623],"domain_scores_gemma":[0.99812025,0.00014925408,0.00009363231,0.001208265,0.00009744252,0.00033116454],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006147897,0.00044078747,0.00040069647,0.0001041598,0.00022247179,0.0002797754,0.0009884469,0.00036516663,0.00006826762],"category_scores_gemma":[0.00001920968,0.00047681952,0.00019774544,0.00023070183,0.000027385118,0.00040315904,0.00025506088,0.00094698597,0.000010118857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013559155,0.000092783914,0.00575057,0.000037696227,0.000099196324,0.000008051957,0.000077348835,0.96126896,0.0003751125,0.0002191632,0.013216934,0.018840646],"study_design_scores_gemma":[0.0011822328,0.000068517984,0.0144332275,0.00008886547,0.000034884488,0.000011783716,0.0000020555651,0.95997775,0.00025261875,0.000071928145,0.0233343,0.0005418186],"about_ca_topic_score_codex":0.000006389393,"about_ca_topic_score_gemma":0.00011052028,"teacher_disagreement_score":0.5770144,"about_ca_system_score_codex":0.00006141068,"about_ca_system_score_gemma":0.000026610453,"threshold_uncertainty_score":0.9997684},"labels":[],"label_agreement":null},{"id":"W2140339261","doi":"10.1016/j.comnet.2005.11.007","title":"Origin authentication in interdomain routing","year":2005,"lang":"en","type":"article","venue":"Computer Networks","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":43,"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; Authentication (law); Computer security; Delegation; The Internet; Computer network; Routing (electronic design automation); Address space; World Wide Web","score_opus":0.010750026952211068,"score_gpt":0.24208424885873356,"score_spread":0.2313342219065225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140339261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069707017,0.00017081406,0.99055445,0.0007369278,0.00058471266,0.00008974197,5.7685217e-8,0.00023775503,0.0006548235],"genre_scores_gemma":[0.70462835,0.000013932438,0.294072,0.0004723449,0.0007051919,0.000006356389,0.000004396367,0.000008469197,0.00008895155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880934,0.00007978215,0.00028977625,0.00036916058,0.00012478977,0.0003271266],"domain_scores_gemma":[0.9993694,0.00006414719,0.000096711374,0.00036396712,0.000042655345,0.00006313441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040147125,0.00012946755,0.00013652067,0.0001091796,0.0000889262,0.00026635575,0.0005887031,0.00007808357,0.000005179337],"category_scores_gemma":[0.0000041201038,0.00013046719,0.0000364167,0.00057049847,0.00002254397,0.0005549409,0.00021035623,0.00019442139,0.000033084612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002436566,0.00004229623,0.0017256471,0.000002851839,0.0000032546177,0.0000026747339,0.0006585479,0.5381748,0.0000022405518,0.006413427,0.0017215023,0.45125028],"study_design_scores_gemma":[0.00025089883,0.000017049788,0.0017330513,0.00007566938,0.0000017969406,0.000008521671,0.000003034114,0.9948334,0.000012734305,0.00048283636,0.0024336327,0.00014737874],"about_ca_topic_score_codex":0.000003182007,"about_ca_topic_score_gemma":0.000017936716,"teacher_disagreement_score":0.69765764,"about_ca_system_score_codex":0.000085762964,"about_ca_system_score_gemma":0.000025656273,"threshold_uncertainty_score":0.53202975},"labels":[],"label_agreement":null},{"id":"W2143605580","doi":"10.1016/j.comnet.2005.05.022","title":"Group shared protection for spare capacity reconfiguration in optical networks","year":2005,"lang":"en","type":"article","venue":"Computer Networks","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":"University of Waterloo","funders":"","keywords":"Spare part; Computer science; Control reconfiguration; Group (periodic table); Computer network; Distributed computing; Computer security; Telecommunications; Embedded system; Operations management","score_opus":0.021311961351292787,"score_gpt":0.2113645162472868,"score_spread":0.190052554895994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143605580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01071679,0.00030030703,0.98590964,0.00016624545,0.000728703,0.000847209,0.000002086892,0.0011318057,0.00019722563],"genre_scores_gemma":[0.76635253,0.000075097494,0.231612,0.000070040434,0.0015259557,0.00027556065,0.000037945003,0.000044604407,0.000006266575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865645,0.000018611318,0.00037617097,0.0003278956,0.00008476534,0.00053608103],"domain_scores_gemma":[0.9994563,0.0001204561,0.00003901462,0.00027356023,0.000039470528,0.000071237766],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015224346,0.00023798892,0.00026696784,0.00008568998,0.00006769672,0.000069700705,0.00021154732,0.00037216558,0.000009984974],"category_scores_gemma":[0.00001889542,0.00025405356,0.0000712178,0.00029809555,0.000054624772,0.0003156553,0.000053243577,0.00054371846,0.000007782775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016282196,0.000016547145,0.000046848156,0.000012856422,0.000011462096,0.0000011668278,0.0000122286,0.7296921,0.000012931523,0.001395714,0.0007519826,0.2680299],"study_design_scores_gemma":[0.00044402378,0.00008405413,0.00101204,0.000081642924,0.0000075121734,0.000007152721,0.000004903316,0.9933071,0.000034884677,0.0009295161,0.0038047736,0.00028238175],"about_ca_topic_score_codex":0.0000013075843,"about_ca_topic_score_gemma":0.000061607185,"teacher_disagreement_score":0.75563574,"about_ca_system_score_codex":0.00020383252,"about_ca_system_score_gemma":0.0000029296118,"threshold_uncertainty_score":0.9999912},"labels":[],"label_agreement":null},{"id":"W2144208711","doi":"10.1016/j.comnet.2013.12.006","title":"Provisioning high-availability datacenter networks for full bandwidth communication","year":2014,"lang":"en","type":"article","venue":"Computer Networks","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":22,"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; Carleton University","funders":"","keywords":"Computer science; Network topology; Server; Bandwidth (computing); Computer network; Provisioning; Upgrade; Distributed computing; Load balancing (electrical power); Operating system","score_opus":0.010591038148973803,"score_gpt":0.22201073952379083,"score_spread":0.21141970137481703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144208711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007981259,0.0003133327,0.98775244,0.0010374823,0.0014993637,0.0006024216,8.685679e-7,0.0005109165,0.000301901],"genre_scores_gemma":[0.7859884,0.000014251628,0.21115497,0.001309065,0.0012528414,0.000047160174,0.0000509579,0.000027885813,0.00015451119],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749905,0.00032877136,0.0004983744,0.0008214215,0.00023915258,0.000613227],"domain_scores_gemma":[0.99656177,0.000659156,0.00023850481,0.0022423498,0.00014251647,0.0001557351],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015395996,0.00029098708,0.00034430256,0.0000816475,0.0005499655,0.00056385587,0.002309648,0.00013729543,0.0000053906324],"category_scores_gemma":[0.000027166268,0.00026029645,0.00014998045,0.00033076652,0.000079785386,0.00009749328,0.002136239,0.000341162,0.000014549692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015501782,0.00007749584,0.00032268302,0.000019430769,0.000028141721,6.426062e-7,0.0000857577,0.6494561,5.731123e-7,0.011984531,0.020664977,0.31734416],"study_design_scores_gemma":[0.0007049076,0.00019532695,0.0016873591,0.00010438497,0.000013791043,0.000004688901,0.0000025324584,0.9471322,0.0000021544759,0.0011207636,0.048736326,0.00029560775],"about_ca_topic_score_codex":0.000017824197,"about_ca_topic_score_gemma":0.000008988241,"teacher_disagreement_score":0.7780071,"about_ca_system_score_codex":0.00006354472,"about_ca_system_score_gemma":0.0000145344975,"threshold_uncertainty_score":0.9999849},"labels":[],"label_agreement":null},{"id":"W2145473395","doi":"10.1016/j.comnet.2010.08.001","title":"Design and implementation of the KioskNet system","year":2010,"lang":"en","type":"article","venue":"Computer Networks","topic":"Opportunistic and Delay-Tolerant Networks","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":"University of Waterloo","funders":"","keywords":"Interactive kiosk; Software deployment; Computer science; Variety (cybernetics); Key (lock); Computer security; Architecture; The Internet; Software; World Wide Web; Software engineering; Engineering management; Telecommunications; Operating system","score_opus":0.01117332777418436,"score_gpt":0.2269275386593774,"score_spread":0.21575421088519303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145473395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007566322,0.00007106123,0.98944294,0.00014381373,0.0022537555,0.00027064444,5.617301e-7,0.000080458245,0.00017042318],"genre_scores_gemma":[0.9110295,0.000006779652,0.088399075,0.00020715567,0.000327753,0.000007382166,0.0000013493677,0.00000690517,0.000014058009],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900836,0.00009746049,0.00026380437,0.00025158792,0.00015886778,0.00021994798],"domain_scores_gemma":[0.99902743,0.00014760974,0.00015580448,0.00052819605,0.000060783394,0.0000801684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038937625,0.00012027107,0.00015795694,0.00002876227,0.0001319933,0.00010557602,0.00062328577,0.000084025254,0.0000054437937],"category_scores_gemma":[3.7321223e-7,0.00008568625,0.000043561562,0.00019124348,0.000069044625,0.0001396948,0.0003945175,0.00021821889,0.000001839154],"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.0000069985244,0.000025572472,0.003916655,0.000033923832,0.000040078863,0.000012636742,0.00048188705,0.010665045,0.00006743739,0.07331624,0.011693996,0.8997395],"study_design_scores_gemma":[0.00023421254,0.000040288414,0.0032938858,0.000024628072,0.000007681714,0.00005645942,0.000011030868,0.99539036,0.00004121896,0.0002844485,0.00051761494,0.00009814874],"about_ca_topic_score_codex":0.000012653884,"about_ca_topic_score_gemma":0.000005397911,"teacher_disagreement_score":0.98472536,"about_ca_system_score_codex":0.000008261236,"about_ca_system_score_gemma":0.000045657707,"threshold_uncertainty_score":0.3494184},"labels":[],"label_agreement":null},{"id":"W2152582571","doi":"10.1016/j.comnet.2006.09.013","title":"Automatic high-performance reconstruction and recovery","year":2006,"lang":"en","type":"article","venue":"Computer Networks","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":21,"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; Artificial intelligence","score_opus":0.004301933042058736,"score_gpt":0.16912503453836455,"score_spread":0.16482310149630583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152582571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3797435,0.00020772322,0.61730117,0.000092737275,0.002032261,0.00007662219,1.3506317e-7,0.00026728032,0.00027857424],"genre_scores_gemma":[0.93332785,0.0001671384,0.06491662,0.0002524303,0.001260888,0.000007972503,0.0000031271486,0.000008559133,0.000055431006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895114,0.00006018878,0.0002591416,0.0003484593,0.00012296956,0.0002581022],"domain_scores_gemma":[0.99941146,0.00006692563,0.000105092564,0.00032330264,0.000040744057,0.000052499945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018914852,0.00014135629,0.00015778508,0.00009285251,0.00022392705,0.00024069368,0.00026841278,0.00010984068,0.000018079692],"category_scores_gemma":[0.0000015210916,0.0001387789,0.000033115313,0.00032807578,0.000050698112,0.00075788255,0.00020245837,0.00018987166,0.000020375712],"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.0000029835724,0.000013827063,0.00037277085,0.000009875367,0.0000058052806,0.0000026123344,0.000012390384,0.030866893,0.0000053809035,0.0038871882,0.0025996852,0.9622206],"study_design_scores_gemma":[0.00020424134,0.00012424476,0.017796824,0.000064951884,0.0000038078567,0.00016104522,3.8930955e-7,0.9757802,0.000075270225,0.0044534053,0.0011662521,0.00016937012],"about_ca_topic_score_codex":0.000032518965,"about_ca_topic_score_gemma":0.000008696032,"teacher_disagreement_score":0.9620512,"about_ca_system_score_codex":0.000033015,"about_ca_system_score_gemma":0.000012151646,"threshold_uncertainty_score":0.56592387},"labels":[],"label_agreement":null},{"id":"W2154606584","doi":"10.1016/j.comnet.2003.12.013","title":"Modelling and verification of interworking between SIP and H.323","year":2004,"lang":"en","type":"article","venue":"Computer Networks","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","cited_by":9,"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; Concordia University","keywords":"Session Initiation Protocol; Computer science; SIP trunking; Computer network; Scalability; Interoperability; Flexibility (engineering); Voice over IP; Call control; Component (thermodynamics); Protocol (science); The Internet; Server; Operating system","score_opus":0.014306324954122688,"score_gpt":0.19514217620291216,"score_spread":0.18083585124878948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154606584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2690066,0.0018031932,0.7283687,0.000008956877,0.00028552904,0.00012147373,8.7720053e-7,0.00013369901,0.00027094714],"genre_scores_gemma":[0.98709625,0.00024616,0.011962703,0.000014742849,0.00062116765,0.0000045168663,0.000007800662,0.000041861535,0.00000479624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920654,0.000020764524,0.00025182322,0.00022527811,0.00007722157,0.00021835315],"domain_scores_gemma":[0.9995706,0.00006685757,0.000047300317,0.00021939477,0.000021554404,0.00007427873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015911133,0.00015582192,0.0002372626,0.000054041593,0.000039532264,0.00004136467,0.00010494175,0.0001297904,0.0000032250828],"category_scores_gemma":[0.0000012894043,0.00017334554,0.000030629282,0.00012320111,0.00006564967,0.0000986413,0.00009224415,0.00020995131,0.0000014865773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044030503,0.000008239704,0.00229217,0.000052408956,0.000030814306,0.0000010833745,0.0003547973,0.9630164,0.0000057515313,0.00031133578,0.00004062554,0.033881973],"study_design_scores_gemma":[0.00039071246,0.000028448514,0.00238269,0.00016175666,0.000023688859,0.0000036046576,0.0000066032394,0.9952374,0.00006019097,0.00116736,0.00037620802,0.00016133844],"about_ca_topic_score_codex":0.000014316634,"about_ca_topic_score_gemma":0.0000059090867,"teacher_disagreement_score":0.71808964,"about_ca_system_score_codex":0.000034837005,"about_ca_system_score_gemma":0.000003902486,"threshold_uncertainty_score":0.7068826},"labels":[],"label_agreement":null},{"id":"W2158051955","doi":"10.1016/j.comnet.2014.07.004","title":"Software defined networking: State of the art and research challenges","year":2014,"lang":"en","type":"article","venue":"Computer Networks","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":344,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Optech (Canada); Western University","funders":"","keywords":"Computer science; Software-defined networking; Scalability; Networking hardware; Computer network; Pace; Network service; The Internet; Network virtualization; Virtualization; Cloud computing; Distributed computing; Computer security; World Wide Web","score_opus":0.04089839266182477,"score_gpt":0.25964356135899275,"score_spread":0.21874516869716798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158051955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037445487,0.0058581294,0.9859585,0.0015036504,0.0018943996,0.00025939327,5.6310364e-7,0.00022400644,0.00055676285],"genre_scores_gemma":[0.9142049,0.0023164672,0.07986024,0.0010336948,0.0022268104,0.000034449247,0.0000036960535,0.00005512899,0.0002645869],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721164,0.0005450332,0.0003743779,0.00064167776,0.00050916715,0.0007181182],"domain_scores_gemma":[0.99665743,0.0015385116,0.00015730408,0.0012626045,0.00022428435,0.00015988105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017052805,0.00023640499,0.00034695532,0.000105685656,0.00033229653,0.00019497742,0.0015483252,0.0001275815,0.000002330077],"category_scores_gemma":[0.00005329711,0.0001725919,0.000106628235,0.0007325524,0.00025749285,0.00018080551,0.0018556031,0.00058402616,0.000011849663],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009762105,0.00004056226,0.0021383092,0.000027918155,0.000028709963,0.0000031219881,0.00042139497,0.03605225,7.60074e-7,0.012614709,0.021648956,0.9270136],"study_design_scores_gemma":[0.00040617073,0.00020117317,0.02088082,0.00021745892,0.0000065706795,0.00002316209,0.0000028080667,0.87547034,0.000010161689,0.021044156,0.08147651,0.0002606432],"about_ca_topic_score_codex":0.000005756387,"about_ca_topic_score_gemma":0.000020149811,"teacher_disagreement_score":0.9267529,"about_ca_system_score_codex":0.00002252999,"about_ca_system_score_gemma":0.000039894217,"threshold_uncertainty_score":0.7038093},"labels":[],"label_agreement":null},{"id":"W2161381723","doi":"10.1016/j.comnet.2006.08.003","title":"Towards a classification of web service feature interactions","year":2006,"lang":"en","type":"article","venue":"Computer Networks","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Web service; Feature (linguistics); Benchmark (surveying); Scope (computer science); WS-Policy; Domain (mathematical analysis); Set (abstract data type); Service (business); Web modeling; Web standards; World Wide Web; Data mining; Web application security; Web development","score_opus":0.01019402495724596,"score_gpt":0.22992386866594575,"score_spread":0.21972984370869977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161381723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019604718,0.0002935639,0.9682861,0.0045190183,0.0014870836,0.00016238882,0.0000031271184,0.00028312596,0.0053608804],"genre_scores_gemma":[0.92263573,0.000010193064,0.07371595,0.002303762,0.0011728479,0.000015457837,0.000049650036,0.000015687638,0.000080732236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986951,0.000078201956,0.0002928804,0.00042008306,0.00022773667,0.00028601763],"domain_scores_gemma":[0.9986543,0.00009157034,0.00020008111,0.0007339336,0.00024934093,0.00007078951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011376496,0.00019506544,0.00021530876,0.00015066986,0.00011247878,0.0001314894,0.0011176487,0.000106364205,0.000010353036],"category_scores_gemma":[6.603621e-7,0.00017501145,0.00009842071,0.0010897975,0.000021510981,0.00036670832,0.0003742027,0.0002833688,0.000020090798],"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.00007160646,0.00084801594,0.00530711,0.00029085416,0.00021360417,0.000036309037,0.0027957475,0.23145847,0.0039830813,0.22808193,0.06247691,0.46443635],"study_design_scores_gemma":[0.00026774628,0.000038585385,0.028962515,0.00007067815,0.000012415332,0.000026535963,0.000012962931,0.92766744,0.00017732671,0.0013968124,0.04118484,0.00018215679],"about_ca_topic_score_codex":0.00018717315,"about_ca_topic_score_gemma":0.00066213805,"teacher_disagreement_score":0.903031,"about_ca_system_score_codex":0.000026908447,"about_ca_system_score_gemma":0.000056659617,"threshold_uncertainty_score":0.713676},"labels":[],"label_agreement":null},{"id":"W2184997645","doi":"10.1016/j.comnet.2015.09.038","title":"Elastic virtual machine placement in cloud computing network environments","year":2015,"lang":"en","type":"article","venue":"Computer Networks","topic":"Cloud Computing and Resource Management","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":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Computer science; Cloud computing; Virtual machine; Scalability; Distributed computing; Replication (statistics); Reduction (mathematics); Cost reduction; Virtual network; Service (business); Operating system","score_opus":0.013505631065288052,"score_gpt":0.2138439525465781,"score_spread":0.20033832148129005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184997645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027086647,0.00065272476,0.9659176,0.00028186798,0.004449743,0.00031848828,3.278208e-7,0.00027670976,0.0010158967],"genre_scores_gemma":[0.96349335,0.000009086712,0.031984698,0.0012916266,0.0027694292,0.0000083301,0.00000964052,0.0000338733,0.0003999662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996619,0.00031220732,0.0006400766,0.0008668012,0.0005632453,0.000998678],"domain_scores_gemma":[0.9983121,0.00023831564,0.00020737544,0.00087158533,0.000023566121,0.00034703902],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012225772,0.00039544786,0.00042521837,0.00014980731,0.00018546716,0.00025658912,0.0015544043,0.00012797925,0.000005987901],"category_scores_gemma":[0.000011137568,0.0003830876,0.00010714826,0.0006827893,0.00006651978,0.000053687796,0.0027587696,0.00051304913,0.000099242105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014758499,0.0001269564,0.0023485036,0.0000039349034,0.00003259512,0.00008589114,0.0004266564,0.9206232,2.4447067e-7,0.003229623,0.0134450635,0.059662588],"study_design_scores_gemma":[0.001370912,0.00028981225,0.0022215296,0.000114515016,0.000008561686,0.000023049788,0.00001933155,0.97598684,9.798107e-7,0.00034465612,0.019207975,0.00041185494],"about_ca_topic_score_codex":0.000024932277,"about_ca_topic_score_gemma":0.000009627746,"teacher_disagreement_score":0.9364067,"about_ca_system_score_codex":0.00025019379,"about_ca_system_score_gemma":0.000035413934,"threshold_uncertainty_score":0.9998621},"labels":[],"label_agreement":null},{"id":"W2216734013","doi":"10.1016/j.comnet.2015.08.030","title":"Modeling of the resource allocation in cloud computing centers","year":2015,"lang":"en","type":"article","venue":"Computer Networks","topic":"Cloud Computing and Resource Management","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":"Concordia University","funders":"","keywords":"Computer science; Cloud computing; Job queue; Distributed computing; Variable (mathematics); Service (business); Task (project management); Constant (computer programming); Virtual machine; Poisson distribution; Resource allocation; Job scheduler; Computer network; Operating system","score_opus":0.02296413607598541,"score_gpt":0.22581552281907186,"score_spread":0.20285138674308645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2216734013","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1424718,0.0001850907,0.8543148,0.00073506386,0.0012789877,0.00016816493,7.198764e-8,0.000100774436,0.00074524124],"genre_scores_gemma":[0.98706496,0.0000012300491,0.011826653,0.00056067604,0.00049953774,0.0000014797631,9.75339e-7,0.000011046993,0.000033454442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827236,0.00022934758,0.00043172995,0.00038261956,0.0003357985,0.00034814188],"domain_scores_gemma":[0.99885595,0.000074172196,0.00013970952,0.0007657299,0.00007626008,0.00008818713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000880919,0.00015681164,0.00020683877,0.000098450655,0.000091246795,0.00008979687,0.0015514559,0.00006728974,2.2918236e-7],"category_scores_gemma":[0.000013035865,0.000122904,0.000093855684,0.00068768754,0.00004270354,0.000028571969,0.0016208511,0.00026552065,0.000002514038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037050906,0.000040486368,0.0012983289,0.0000071897143,0.00000906908,0.000002709175,0.0010001825,0.96542144,5.2754535e-7,0.0026612235,0.001358204,0.02819693],"study_design_scores_gemma":[0.00043191074,0.0000311277,0.0007170947,0.00016831984,0.0000035741366,0.0000063814227,0.0000497571,0.9972213,0.000003885877,0.00029861016,0.0009351549,0.00013290778],"about_ca_topic_score_codex":0.00008512485,"about_ca_topic_score_gemma":0.000011472491,"teacher_disagreement_score":0.84459317,"about_ca_system_score_codex":0.00008727266,"about_ca_system_score_gemma":0.00003350946,"threshold_uncertainty_score":0.50118804},"labels":[],"label_agreement":null},{"id":"W2225179220","doi":"10.1016/j.comnet.2015.12.016","title":"Closed-loop design evolution of engineering system using condition monitoring through internet of things and cloud computing","year":2016,"lang":"en","type":"article","venue":"Computer Networks","topic":"Digital Transformation in Industry","field":"Engineering","cited_by":61,"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":"Canada Foundation for Innovation","keywords":"Computer science; Flexibility (engineering); Cloud computing; Context (archaeology); Distributed computing; Computer-automated design; Engineering design process; Systems engineering; Domain (mathematical analysis); Systems design; Software engineering","score_opus":0.01991847911325641,"score_gpt":0.21297908332989585,"score_spread":0.19306060421663943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2225179220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23711072,0.0002386887,0.76066107,0.000001410474,0.0015481962,0.00011191168,0.0000017232793,0.00018929885,0.00013697585],"genre_scores_gemma":[0.9660717,0.000010470639,0.033388227,0.0000014539894,0.0004937981,0.000001810298,0.0000016298573,0.000028478016,0.0000024072062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906886,0.000023157238,0.00045388096,0.0001282515,0.00012428642,0.0002015894],"domain_scores_gemma":[0.9994861,0.0001753064,0.0001059432,0.00012830649,0.00006399116,0.000040345545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016599617,0.00015671483,0.00023974947,0.00007759647,0.00002224779,0.000029436627,0.0001209266,0.00013632211,0.0000013421129],"category_scores_gemma":[0.0000040854557,0.00014426904,0.000043273434,0.0001429593,0.000039381837,0.00058304414,0.000047835063,0.00012845194,9.5190546e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005976923,0.0000062469217,0.0009427344,0.00037680974,0.00006373165,0.0000015227379,0.00041404864,0.98468924,0.0015418199,0.002110195,0.00008522274,0.009762443],"study_design_scores_gemma":[0.0003171661,0.000030867104,0.0006013469,0.002581964,0.00001728974,0.00002022353,0.00005226153,0.9892149,0.0069659986,0.000030549407,0.000019668129,0.00014773874],"about_ca_topic_score_codex":0.000008062424,"about_ca_topic_score_gemma":2.4094984e-8,"teacher_disagreement_score":0.728961,"about_ca_system_score_codex":0.00016616852,"about_ca_system_score_gemma":0.000008153126,"threshold_uncertainty_score":0.5883121},"labels":[],"label_agreement":null},{"id":"W2235450764","doi":"10.1016/j.comnet.2015.08.016","title":"A green energy-aware hybrid virtual network embedding approach","year":2015,"lang":"en","type":"article","venue":"Computer Networks","topic":"Software-Defined Networks and 5G","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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Network virtualization; Computer science; Distributed computing; Virtualization; Embedding; Efficient energy use; Virtual network; Survivability; Computer network; Quality of service; Virtual machine; Cloud computing; Operating system","score_opus":0.022111792093336705,"score_gpt":0.22389427074386387,"score_spread":0.20178247865052718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2235450764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033698036,0.0015332984,0.9916868,0.00024730113,0.0036380484,0.0001794677,0.0000018476634,0.001149968,0.0012262821],"genre_scores_gemma":[0.69612205,0.00008498496,0.27953145,0.0073909196,0.015643649,0.000091740985,0.00012254798,0.00012980077,0.00088287744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962097,0.00025132013,0.0005633249,0.0011313418,0.0005895277,0.0012547767],"domain_scores_gemma":[0.9972609,0.0002627192,0.00022781792,0.0013591108,0.00021321385,0.00067620317],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068561616,0.00053015456,0.00058667385,0.00012761193,0.00030335024,0.0005606506,0.0022387493,0.00022330406,0.000007877601],"category_scores_gemma":[0.0000071306804,0.00050281105,0.00023001824,0.001013861,0.00009269756,0.0006634813,0.0017497916,0.0005084547,0.000042998094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013886946,0.000058954603,0.0003235127,0.0000036671127,0.00004801471,0.00006721798,0.00014941735,0.60129124,4.5011785e-8,0.011808363,0.19205546,0.19418022],"study_design_scores_gemma":[0.0007081722,0.000222097,0.000113017006,0.00005861941,0.000015412776,0.00017420945,0.000006341105,0.9488019,0.0000012165613,0.003653118,0.04564858,0.00059735694],"about_ca_topic_score_codex":0.00011172355,"about_ca_topic_score_gemma":0.000007807869,"teacher_disagreement_score":0.71215534,"about_ca_system_score_codex":0.00011188964,"about_ca_system_score_gemma":0.0001251989,"threshold_uncertainty_score":0.9997423},"labels":[],"label_agreement":null},{"id":"W2276029804","doi":"10.1016/j.comnet.2015.12.021","title":"ICP: Instantaneous clustering protocol for wireless sensor networks","year":2016,"lang":"en","type":"article","venue":"Computer Networks","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"China Postdoctoral Science Foundation; Canada Foundation for Innovation","keywords":"Computer science; Cluster analysis; Computer network; Protocol (science); Wireless sensor network; Artificial intelligence; Medicine","score_opus":0.018973140840998007,"score_gpt":0.2546256221804335,"score_spread":0.2356524813394355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2276029804","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027646657,0.000026412696,0.9553364,0.0004539026,0.0022340366,0.04014226,0.0000027837866,0.0011231055,0.00040466856],"genre_scores_gemma":[0.2698402,0.00004703495,0.53704995,0.0033090634,0.011144789,0.17649646,0.000021169324,0.0004132165,0.0016781196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99538857,0.00022245398,0.00087566045,0.0014466397,0.00045307737,0.0016135814],"domain_scores_gemma":[0.9961778,0.0010451456,0.00040970065,0.00167046,0.00029672368,0.0004001607],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052636216,0.0006729692,0.00065186084,0.00018475755,0.00043984922,0.00047194926,0.0022595844,0.00043764972,0.00001681593],"category_scores_gemma":[0.000015480418,0.00050323585,0.00031670384,0.0006658251,0.00017132005,0.00051788084,0.0011503601,0.00036422303,0.000024631172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009678985,0.00009345428,0.0001175666,0.000027686367,0.000043754724,0.00008566332,0.000041233285,0.71195614,0.000037600603,0.004813849,0.00603239,0.2766539],"study_design_scores_gemma":[0.002384712,0.00031903357,0.0000908975,0.00046889225,0.000009452914,0.00017832097,0.000001919157,0.963386,0.00008149568,0.00010247621,0.032206297,0.00077048107],"about_ca_topic_score_codex":0.0000054572106,"about_ca_topic_score_gemma":0.000023895467,"teacher_disagreement_score":0.4182864,"about_ca_system_score_codex":0.00020646174,"about_ca_system_score_gemma":0.00006638854,"threshold_uncertainty_score":0.9997419},"labels":[],"label_agreement":null},{"id":"W2282452766","doi":"10.1016/j.comnet.2016.01.015","title":"Multi-objective optimization in sensor networks: Optimization classification, applications and solution approaches","year":2016,"lang":"en","type":"article","venue":"Computer Networks","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":51,"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 sensor network; Optimization problem; Mathematical optimization; Software deployment; Resource allocation; Engineering optimization; Multi-objective optimization; Distributed computing; Operations research; Machine learning; Computer network; Algorithm","score_opus":0.029462039289618845,"score_gpt":0.22233626740089985,"score_spread":0.192874228111281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2282452766","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014709495,0.00045328325,0.99708474,0.0006527065,0.00044409008,0.00070342043,0.0000013319907,0.00039444905,0.000118903394],"genre_scores_gemma":[0.2934556,0.00045919974,0.7051171,0.00015401855,0.00047931494,0.00019385123,0.000035827885,0.000035716905,0.000069345864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729747,0.000296248,0.0005572616,0.0010505412,0.00022366269,0.0005748396],"domain_scores_gemma":[0.9982387,0.00034644484,0.00029293878,0.0007766674,0.00018311702,0.0001621642],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042643386,0.0003324897,0.00030559627,0.00027578094,0.00026475862,0.00023230295,0.00061864854,0.00030449202,0.0000042238344],"category_scores_gemma":[0.000015914748,0.00028480391,0.000064381886,0.0011010974,0.00016764729,0.0007026525,0.00035675318,0.00023475119,0.0000048357083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008409716,0.000118340235,0.0010322186,0.000004721413,0.000015146118,0.0000019180948,0.000089637964,0.9345209,0.0000071020645,0.0035593158,0.00012374783,0.060518514],"study_design_scores_gemma":[0.0008463274,0.00003822132,0.0038969435,0.00008529697,0.000009272606,0.000015802389,0.000011762011,0.9945649,0.000005696376,0.000019890005,0.0001363153,0.00036958937],"about_ca_topic_score_codex":0.0000069233038,"about_ca_topic_score_gemma":0.000015725587,"teacher_disagreement_score":0.2933085,"about_ca_system_score_codex":0.00019281772,"about_ca_system_score_gemma":0.000035765912,"threshold_uncertainty_score":0.9999604},"labels":[],"label_agreement":null},{"id":"W2318072527","doi":"10.1016/j.comnet.2016.03.010","title":"Secure receiver access control for IP multicast at the network level: Design and validation","year":2016,"lang":"en","type":"article","venue":"Computer Networks","topic":"IPv6, Mobility, Handover, Networks, Security","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":"Concordia University","funders":"","keywords":"Computer science; Multicast; Computer network; Secure multicast; IPsec; Source-specific multicast; IP multicast; Xcast; Pragmatic General Multicast; Multicast address; Protocol Independent Multicast; Inter-domain; Computer security; The Internet; Operating system","score_opus":0.03135703466210409,"score_gpt":0.24149378445505948,"score_spread":0.21013674979295538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2318072527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009754636,0.0015219385,0.9838816,0.00029186974,0.0027008185,0.0014930592,0.00002274794,0.00029584157,0.000037486927],"genre_scores_gemma":[0.98836684,0.00026211145,0.0068287314,0.00040972568,0.0037266326,0.00019171323,0.000022419603,0.00008561424,0.00010619009],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981292,0.00021934163,0.00036610308,0.00044261097,0.00016625682,0.0006765045],"domain_scores_gemma":[0.99741006,0.0017428941,0.00009077687,0.00050668226,0.000114710565,0.00013487032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080258027,0.00033752486,0.00035224325,0.00002493048,0.00027334836,0.00019523453,0.00043094042,0.00025538402,0.000041245094],"category_scores_gemma":[0.000019746418,0.00022329613,0.00010903578,0.00017037531,0.00013076823,0.00032659425,0.0002237603,0.00022524316,0.000012687232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015318858,0.000015943622,0.0013018464,0.000031368978,0.00012013781,0.0000024756832,0.00010175318,0.85519093,0.000012313875,0.00022812404,0.05479858,0.08804334],"study_design_scores_gemma":[0.0021519521,0.00006221368,0.005523039,0.000108475266,0.0000815934,0.000011538698,0.0000014046302,0.9773214,0.00007026499,0.0014049117,0.012920591,0.00034260604],"about_ca_topic_score_codex":0.0000032005582,"about_ca_topic_score_gemma":0.00003126232,"teacher_disagreement_score":0.97861224,"about_ca_system_score_codex":0.0001393061,"about_ca_system_score_gemma":0.000011866388,"threshold_uncertainty_score":0.91057515},"labels":[],"label_agreement":null},{"id":"W2329971998","doi":"10.1016/j.comnet.2016.04.002","title":"Network coding-based approach for efficient video streaming over MANET","year":2016,"lang":"en","type":"article","venue":"Computer Networks","topic":"Cooperative Communication and Network Coding","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":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Computer network; Multicast; Scalable Video Coding; Mobile ad hoc network; Network packet; Multiple description coding; Linear network coding; Video quality; Scalability; Packet loss; Codec; Quality of service; Real-time computing; Telecommunications","score_opus":0.02908652807661785,"score_gpt":0.2525248268404266,"score_spread":0.22343829876380875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2329971998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041918742,0.00061010214,0.99580944,0.00067029893,0.0009799796,0.00057439203,0.0000026508774,0.00041098698,0.0005229784],"genre_scores_gemma":[0.75168145,0.000079408084,0.24451067,0.0020822904,0.0013333531,0.000121284516,0.000023072822,0.0000337275,0.00013476986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976014,0.00021674325,0.00043642963,0.0007487215,0.000241897,0.0007548145],"domain_scores_gemma":[0.9972084,0.00090930867,0.00019113159,0.0013291119,0.00017480017,0.00018722125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007052472,0.0003246027,0.00034361813,0.00009713363,0.00048451478,0.0002930915,0.0017109449,0.00013428289,0.000020311936],"category_scores_gemma":[0.000018578106,0.00024345373,0.00016864717,0.0005390158,0.00009119962,0.00019562323,0.0007405889,0.00018792518,0.0000110828805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023448827,0.000104588085,0.0004432508,0.000012541524,0.000031254185,0.000002485705,0.000058324327,0.65412873,0.000025759102,0.057324626,0.03270969,0.25513533],"study_design_scores_gemma":[0.0011543076,0.00010102592,0.0011239033,0.00014798649,0.000009612938,0.000004270907,8.8814704e-7,0.9821835,0.00002151787,0.00021669177,0.014659573,0.00037668893],"about_ca_topic_score_codex":9.991223e-7,"about_ca_topic_score_gemma":0.000003021271,"teacher_disagreement_score":0.7512988,"about_ca_system_score_codex":0.000111256544,"about_ca_system_score_gemma":0.000059479196,"threshold_uncertainty_score":0.99277556},"labels":[],"label_agreement":null},{"id":"W2347031861","doi":"10.1016/j.comnet.2016.04.014","title":"Towards collusion-attack-resilient group key management using one-way function tree","year":2016,"lang":"en","type":"article","venue":"Computer Networks","topic":"Security in Wireless Sensor Networks","field":"Computer Science","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 Ontario Institute of Technology","funders":"National Natural Science Foundation of China","keywords":"Collusion; Computer science; Node (physics); Overhead (engineering); Computer security; Tree (set theory); Forward secrecy; Key (lock); Computer network; Scheme (mathematics); Secrecy; Function (biology); Encryption; Public-key cryptography; Mathematics","score_opus":0.02473088834470229,"score_gpt":0.23782476823847556,"score_spread":0.21309387989377326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2347031861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01714016,0.0004729039,0.97315025,0.0006213342,0.0057823956,0.00055681483,0.0000018377186,0.0006534349,0.0016208551],"genre_scores_gemma":[0.8270927,0.00026188893,0.1681363,0.0016040434,0.0025864325,0.000034305904,0.000009193237,0.00006391473,0.0002111849],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961544,0.0002543145,0.0006349892,0.0011829643,0.00076493155,0.0010083665],"domain_scores_gemma":[0.9974773,0.00021683713,0.00026458586,0.001576438,0.00015077881,0.00031407442],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048141208,0.00047910408,0.00046203125,0.00025210073,0.0003943577,0.00037714824,0.0017393709,0.0002806743,0.000055958237],"category_scores_gemma":[0.0000052176483,0.00039174914,0.00022815529,0.00086352904,0.0001319632,0.00069231476,0.0019331827,0.0002991799,0.00011127428],"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.00005867848,0.0002652073,0.0003737467,0.000027096197,0.00017908293,0.000097789816,0.00018783152,0.091742404,0.00007222495,0.03998999,0.01438045,0.8526255],"study_design_scores_gemma":[0.0012397607,0.00023877861,0.00840037,0.0004061796,0.000050119004,0.000034409342,0.0000071615755,0.9740058,0.00003007544,0.0015560323,0.013395646,0.0006356714],"about_ca_topic_score_codex":0.000020821006,"about_ca_topic_score_gemma":0.000026554417,"teacher_disagreement_score":0.8822634,"about_ca_system_score_codex":0.0003545159,"about_ca_system_score_gemma":0.000028164344,"threshold_uncertainty_score":0.99985343},"labels":[],"label_agreement":null},{"id":"W237160846","doi":"10.1016/j.comnet.2015.04.011","title":"SRLG fault localization using nested m-trails","year":2015,"lang":"en","type":"article","venue":"Computer Networks","topic":"Advanced 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":"University of Waterloo","funders":"","keywords":"Traverse; Computer science; Integer programming; Latency (audio); Heuristic; Node (physics); Topology (electrical circuits); Computer network; Algorithm; Distributed computing; Telecommunications; Mathematics; Artificial intelligence","score_opus":0.027519097882130607,"score_gpt":0.23878655609429475,"score_spread":0.21126745821216414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W237160846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011591685,0.0009098851,0.9838823,0.000014627639,0.0011801097,0.00012938726,4.877942e-7,0.001902997,0.00038852988],"genre_scores_gemma":[0.7614824,0.000049297687,0.23738165,0.00014208075,0.00085029815,0.000006564057,0.00001684983,0.000059414087,0.0000113973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911106,0.00001678509,0.00021226906,0.0001838807,0.000118525466,0.0003575028],"domain_scores_gemma":[0.9994715,0.000044053642,0.000025636438,0.00027728084,0.0000675527,0.000113996495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007357717,0.00017795441,0.00018745603,0.000056634668,0.00004193391,0.000051831285,0.00021107326,0.00019583742,0.000003996889],"category_scores_gemma":[0.000011749889,0.0001806953,0.000034133842,0.00040243947,0.000062463834,0.00017627075,0.00010321172,0.0002320975,0.000019018584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023755815,0.000005967866,0.0002693799,0.0000060664897,0.000012207724,0.000010035589,0.000026449647,0.950088,0.0000064298824,0.00048258723,0.0041706995,0.044919763],"study_design_scores_gemma":[0.00021297231,0.00002537825,0.00007576318,0.000041395288,0.0000087282915,0.00001460126,0.000012047963,0.99303573,0.000021445854,0.0011858357,0.005153448,0.0002126454],"about_ca_topic_score_codex":0.0000013044681,"about_ca_topic_score_gemma":0.0000020347616,"teacher_disagreement_score":0.74989074,"about_ca_system_score_codex":0.00009352502,"about_ca_system_score_gemma":0.000007808322,"threshold_uncertainty_score":0.736854},"labels":[],"label_agreement":null},{"id":"W23910454","doi":"10.1016/j.comnet.2004.03.015","title":"Internet economics: pricing and policies","year":2004,"lang":"en","type":"article","venue":"Computer Networks","topic":"Caching and Content Delivery","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":"University of Waterloo","funders":"","keywords":"Computer science; Cloud computing; Electricity; Operational costs; Service provider; The Internet; Minification; Distributed computing; Service (business); Operations research","score_opus":0.014486474246741383,"score_gpt":0.1923403429350339,"score_spread":0.17785386868829253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W23910454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19943039,0.00038913116,0.7985898,0.0004751342,0.000624218,0.000045249813,1.3868457e-7,0.00013959473,0.0003063423],"genre_scores_gemma":[0.985749,0.000085196116,0.011909097,0.0017539517,0.00042525146,0.000002214234,0.0000010491658,0.0000069442253,0.00006726314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929214,0.000017442151,0.0001442042,0.00028338455,0.000040753006,0.0002220957],"domain_scores_gemma":[0.9995408,0.000039661183,0.000045883506,0.00027790447,0.000018216046,0.00007750726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009995191,0.0001130252,0.00013072943,0.00006269542,0.00006555054,0.00030688656,0.00042845862,0.000045108227,8.101122e-7],"category_scores_gemma":[0.0000015042843,0.000109105444,0.000043148837,0.00007768082,0.000033347485,0.00026118231,0.00048166915,0.00012943122,0.000011300535],"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.0000073264077,0.00005416831,0.0028076265,0.000010919465,0.00006555819,0.00003286168,0.0018331419,0.35447183,0.000015835434,0.26961094,0.002341552,0.36874825],"study_design_scores_gemma":[0.00034297147,0.00006649556,0.00308435,0.00004765327,0.0000032691082,0.000069680464,0.0000048723846,0.9919715,0.00001716705,0.00283547,0.0013845377,0.0001720389],"about_ca_topic_score_codex":0.00013700673,"about_ca_topic_score_gemma":0.000015120919,"teacher_disagreement_score":0.7866807,"about_ca_system_score_codex":0.000039789822,"about_ca_system_score_gemma":0.000015936872,"threshold_uncertainty_score":0.44491908},"labels":[],"label_agreement":null},{"id":"W2400162648","doi":"10.1016/j.comnet.2016.04.020","title":"DBStream: A holistic approach to large-scale network traffic monitoring and analysis","year":2016,"lang":"en","type":"article","venue":"Computer Networks","topic":"Internet Traffic Analysis and Secure E-voting","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":"University of Waterloo","funders":"European Commission","keywords":"Computer science; The Internet; Network monitoring; Cloud computing; Scheduling (production processes); Distributed computing; Process (computing); Network packet; Computer network; World Wide Web; Operating system","score_opus":0.01609610617178696,"score_gpt":0.23430615970153418,"score_spread":0.2182100535297472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400162648","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051700417,0.0003626349,0.94654554,0.00010738188,0.0007104606,0.00013283786,0.0000015664594,0.00025134,0.0001878146],"genre_scores_gemma":[0.8987456,0.000024004945,0.09916587,0.00017601569,0.0017027707,0.000016067539,0.000004850472,0.000017976263,0.00014682265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973476,0.00012856611,0.00044225133,0.00095432857,0.0002922871,0.0008349881],"domain_scores_gemma":[0.9987108,0.00020454878,0.00012669386,0.00052516937,0.0000988131,0.0003339918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055818533,0.0003140567,0.00055179105,0.0002377728,0.00023457737,0.00039124122,0.00095046265,0.00013475202,0.0000061812407],"category_scores_gemma":[0.000007558531,0.00022709525,0.00026714348,0.0015429354,0.000041514588,0.00024665715,0.0006275428,0.0001936988,0.000019659054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005521804,0.00007335079,0.0028921415,0.000005117296,0.00037011973,0.0000099498775,0.000662457,0.89866,6.4655535e-7,0.010060119,0.0018232116,0.08543739],"study_design_scores_gemma":[0.0002626649,0.000050703045,0.008482368,0.00006299152,0.00016413386,0.000009172616,0.000014149114,0.98969144,8.8275317e-7,0.000012101322,0.00092535955,0.00032404787],"about_ca_topic_score_codex":0.0000025307597,"about_ca_topic_score_gemma":0.000012162984,"teacher_disagreement_score":0.8473797,"about_ca_system_score_codex":0.00005339828,"about_ca_system_score_gemma":0.000015331967,"threshold_uncertainty_score":0.92606753},"labels":[],"label_agreement":null},{"id":"W2407119330","doi":"10.1016/j.comnet.2016.05.013","title":"Energy-balanced cooperative transmission based on relay selection and power control in energy harvesting wireless sensor network","year":2016,"lang":"en","type":"article","venue":"Computer Networks","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":60,"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":"Central South University; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Relay; Computer science; Wireless sensor network; Energy harvesting; Maximization; Energy (signal processing); Key distribution in wireless sensor networks; Residual; Computer network; Transmission (telecommunications); Wireless; Power (physics); Wireless network; Telecommunications; Mathematical optimization","score_opus":0.004295571586985616,"score_gpt":0.17612903412820516,"score_spread":0.17183346254121953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407119330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027109498,0.00050250115,0.97038025,0.0001164484,0.00084297365,0.000115268536,0.0000022652712,0.0005967113,0.00033409472],"genre_scores_gemma":[0.9911651,0.0002358405,0.006487447,0.0007485527,0.0010845097,0.00004006572,0.000012456267,0.00012385851,0.0001021466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762005,0.00029142716,0.00050691335,0.0005905095,0.00020727738,0.0007837972],"domain_scores_gemma":[0.9984294,0.00091699854,0.00008113502,0.0002764501,0.00007834584,0.00021766318],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028521215,0.00048073987,0.00051105284,0.00013924715,0.000158181,0.00009740894,0.00018991408,0.00037984207,0.0000177446],"category_scores_gemma":[0.000008774162,0.000391176,0.00007478421,0.00050422084,0.000073343836,0.00019939095,0.000031043302,0.00038003622,0.0000017515448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087687695,0.000026307667,0.0016052949,0.00000895476,0.000032372063,0.000027204527,0.000024885507,0.89038867,0.00037529005,0.0007229808,0.0011293524,0.105571],"study_design_scores_gemma":[0.002038773,0.0001825798,0.0018072468,0.0012256239,0.000012638056,0.000013572764,0.0000013234228,0.9907524,0.00017809268,0.000030593506,0.0032406636,0.00051648426],"about_ca_topic_score_codex":0.000034527344,"about_ca_topic_score_gemma":0.000111544374,"teacher_disagreement_score":0.9640556,"about_ca_system_score_codex":0.00015746037,"about_ca_system_score_gemma":0.000027535436,"threshold_uncertainty_score":0.999854},"labels":[],"label_agreement":null},{"id":"W2495118630","doi":"10.1016/j.comnet.2016.06.037","title":"Building a cloud on earth: A study of cloud computing data center simulators","year":2016,"lang":"en","type":"article","venue":"Computer Networks","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cloud computing; Computer science; Data center; Cloud testing; Software deployment; Cloud computing security; Distributed computing; Software engineering; Operating system","score_opus":0.03036247877515678,"score_gpt":0.2690659935053487,"score_spread":0.23870351473019194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2495118630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3950673,0.00004142233,0.60152483,0.0001588525,0.0025167777,0.00030348066,0.000001650984,0.0002529564,0.00013269323],"genre_scores_gemma":[0.9782474,0.0000026399282,0.019321108,0.00038560096,0.0019424043,0.000001993042,0.0000020120035,0.00003152223,0.00006532261],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644923,0.00033428267,0.00069685763,0.0012539857,0.0005775912,0.00068803254],"domain_scores_gemma":[0.9956459,0.00070868357,0.00035070168,0.0030280354,0.00009003944,0.00017667445],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009494449,0.00037137212,0.0004934707,0.00020780205,0.00024681105,0.00018624045,0.0039298874,0.000095428564,0.0000042719494],"category_scores_gemma":[0.000023388922,0.00026293885,0.00011592779,0.00059952826,0.00006787472,0.00007457293,0.0062261345,0.0002746898,0.000022518365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031391395,0.0010869228,0.0038907973,0.000019531299,0.00019790715,0.00006864851,0.0007155909,0.5005795,0.000008835491,0.0061280937,0.005278048,0.48199475],"study_design_scores_gemma":[0.0019492541,0.0006469045,0.0034591884,0.00038958597,0.000017098966,0.00001013444,0.000019916124,0.9853809,0.000009272614,0.00012963999,0.0076353936,0.00035274395],"about_ca_topic_score_codex":0.000019543939,"about_ca_topic_score_gemma":0.000004634841,"teacher_disagreement_score":0.58318007,"about_ca_system_score_codex":0.000042805295,"about_ca_system_score_gemma":0.000020112582,"threshold_uncertainty_score":0.9999823},"labels":[],"label_agreement":null},{"id":"W251114167","doi":"10.1016/j.comnet.2015.04.012","title":"Smart routing: Fine-grained stall management of video streams in mobile core networks","year":2015,"lang":"en","type":"article","venue":"Computer Networks","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Distributed computing; Bottleneck; Cellular network; Backhaul (telecommunications); Radio access network; Real-time computing; Base station; Mobile station; Embedded system","score_opus":0.02810637455799983,"score_gpt":0.23665436566227954,"score_spread":0.2085479911042797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W251114167","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062308628,0.001404121,0.93333536,0.0000677234,0.0015099514,0.0003584541,0.0000011108812,0.00019629995,0.00081832113],"genre_scores_gemma":[0.98839426,0.00007728013,0.010705278,0.00024735765,0.0003075385,0.000032466676,0.000021621945,0.000019092919,0.00019512388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795777,0.000100952486,0.0005237988,0.0005666911,0.00032126438,0.0005295268],"domain_scores_gemma":[0.9985386,0.0001120154,0.00018456294,0.00085907406,0.000113596085,0.0001921655],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062947156,0.00026187583,0.000382895,0.00012668647,0.000050336508,0.0001133274,0.0011434521,0.000120211545,0.0000033468086],"category_scores_gemma":[0.0000035741089,0.0002556098,0.0001328044,0.00060812937,0.000050824514,0.00024005728,0.0010016431,0.00031537504,0.000007994313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029982324,0.00014239216,0.003964003,0.000015000143,0.000054992088,0.0001322289,0.00025690853,0.7097124,0.0000016619754,0.004848506,0.0073747593,0.27346718],"study_design_scores_gemma":[0.0010985851,0.00021883637,0.0029978866,0.00021870718,0.000011855048,0.000011455901,0.00003530534,0.9936604,0.0000018329843,0.00037496703,0.0011075493,0.00026260142],"about_ca_topic_score_codex":0.00008954293,"about_ca_topic_score_gemma":0.000041521078,"teacher_disagreement_score":0.9260856,"about_ca_system_score_codex":0.00008523508,"about_ca_system_score_gemma":0.00003275242,"threshold_uncertainty_score":0.9999896},"labels":[],"label_agreement":null},{"id":"W2565659764","doi":"10.1016/j.comnet.2016.12.009","title":"Characteristic time routing in information centric networks","year":2016,"lang":"en","type":"article","venue":"Computer Networks","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":21,"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; Cache; Latency (audio); Computer network; Policy-based routing; The Internet; Information-centric networking; Distributed computing; Cache algorithms; Routing (electronic design automation); Static routing; Routing protocol; CPU cache; World Wide Web; Telecommunications","score_opus":0.005028162034221571,"score_gpt":0.17083391130108713,"score_spread":0.16580574926686556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2565659764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014713015,0.00007396604,0.98297006,0.00034915024,0.0012708416,0.00012805048,7.173834e-7,0.00024951057,0.00024470384],"genre_scores_gemma":[0.9969319,0.00004522885,0.0014010301,0.0009151989,0.0005892497,0.0000074150307,0.000009140239,0.000007791174,0.00009305274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859947,0.00009694007,0.00039413184,0.00027070212,0.00016283408,0.00047592606],"domain_scores_gemma":[0.99905497,0.00020587344,0.0001474599,0.00043572375,0.00005914591,0.000096843745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036073365,0.00016967295,0.00020406848,0.00016097137,0.00008714423,0.00026622904,0.00069107825,0.000103011116,0.000011422875],"category_scores_gemma":[0.000015079645,0.00012979485,0.000072364,0.0004168882,0.000020620482,0.0012255688,0.00040400372,0.00019180957,0.00019712096],"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.0000128665115,0.000031626347,0.0046971687,0.000003844495,0.000013325968,0.000026769552,0.00012762034,0.02952169,0.000013874142,0.0034973351,0.0033875157,0.9586664],"study_design_scores_gemma":[0.00045613784,0.00003298334,0.018838674,0.00013633195,0.0000024939384,0.000018239609,6.9870845e-7,0.97918576,0.0000011185084,0.00007151797,0.0010596907,0.00019636571],"about_ca_topic_score_codex":0.000012794018,"about_ca_topic_score_gemma":0.0000013307549,"teacher_disagreement_score":0.98221886,"about_ca_system_score_codex":0.0000936521,"about_ca_system_score_gemma":0.000021964479,"threshold_uncertainty_score":0.52928805},"labels":[],"label_agreement":null},{"id":"W2604587950","doi":"10.1016/j.comnet.2017.04.021","title":"Extensions to decision-tree based packet classification algorithms to address new classification paradigms","year":2017,"lang":"en","type":"article","venue":"Computer Networks","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":9,"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é du Québec à Montréal; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Decision tree; Algorithm; Decision tree learning; Network packet; Statistical classification; Tree (set theory); ID3 algorithm; Artificial intelligence; Machine learning; Incremental decision tree; Data mining; Computer network","score_opus":0.05632261106630987,"score_gpt":0.3100486628883545,"score_spread":0.2537260518220446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604587950","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000713939,0.00010072891,0.987941,0.0065462426,0.002841249,0.0005508196,0.0000023035695,0.0004140597,0.0008896149],"genre_scores_gemma":[0.35406116,0.000020624653,0.6410792,0.002730696,0.0016734631,0.000055223194,0.000042108248,0.000037622536,0.0002999279],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703956,0.000107027736,0.00052880263,0.001172179,0.0005096329,0.0006428084],"domain_scores_gemma":[0.99536824,0.00028813723,0.00036343752,0.0028365212,0.00036263032,0.0007810418],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005344506,0.00035786477,0.00035416082,0.00024451467,0.001197902,0.0021307913,0.0027276354,0.00022403702,0.000011259452],"category_scores_gemma":[0.00012105421,0.00034734883,0.00011562409,0.0006693957,0.000060117767,0.0008254392,0.0006132629,0.000285525,0.00019981903],"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.000020432235,0.000053703894,0.0004284981,0.0000030687102,0.000008596682,0.000006260703,0.000115838964,0.24308853,0.000012169726,0.0025831496,0.075751126,0.6779286],"study_design_scores_gemma":[0.00045662295,0.0001134087,0.054831166,0.0002311946,0.000012480953,0.0000056145673,0.0000037415568,0.9272217,0.000023012344,0.0010354178,0.015652943,0.0004126571],"about_ca_topic_score_codex":0.000018745357,"about_ca_topic_score_gemma":0.00003959677,"teacher_disagreement_score":0.68413323,"about_ca_system_score_codex":0.00011153715,"about_ca_system_score_gemma":0.00019348004,"threshold_uncertainty_score":0.99989784},"labels":[],"label_agreement":null},{"id":"W2607423673","doi":"10.1016/j.comnet.2017.04.004","title":"A new cooperative communication algorithm for improving connectivity in the event of network failure in VANETs","year":2017,"lang":"en","type":"article","venue":"Computer Networks","topic":"Cooperative Communication and Network Coding","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":"Université de Moncton","funders":"","keywords":"Retransmission; Computer science; Computer network; Node (physics); Relay; Network packet; Wireless ad hoc network; Throughput; Distributed computing; Tree (set theory); Wireless; Telecommunications","score_opus":0.027011757260534567,"score_gpt":0.2876495046784495,"score_spread":0.26063774741791496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607423673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016978126,0.0009832351,0.99392235,0.0020731336,0.00031942723,0.00082503207,0.0000010379472,0.00003141093,0.00014653831],"genre_scores_gemma":[0.79624194,0.00020836147,0.20278765,0.00038547927,0.00026413327,0.000073399395,0.000009558814,0.000009787495,0.000019656833],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808866,0.0005692499,0.0004587809,0.00036210913,0.00015372944,0.00036748053],"domain_scores_gemma":[0.99638677,0.0009045913,0.00037865943,0.0021123996,0.00016064096,0.00005694894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016681248,0.00019701882,0.00034186261,0.000071008835,0.00056041946,0.0003949714,0.0035168314,0.00010618619,0.0000035309533],"category_scores_gemma":[0.000055802273,0.00016417926,0.0000869193,0.00034237048,0.000087535096,0.0005630793,0.0011726428,0.0004459585,0.0000011092642],"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.000008852323,0.00007360538,0.0012186468,0.00000620452,0.000012714175,0.0000023440957,0.0014762762,0.08288646,0.000004613738,0.027437337,0.0034948485,0.8833781],"study_design_scores_gemma":[0.0009788345,0.00009679462,0.019321984,0.00015556188,0.000004208996,0.000004834657,0.000022311866,0.97610843,0.000010253227,0.0012892474,0.0018291746,0.00017837647],"about_ca_topic_score_codex":0.00010370505,"about_ca_topic_score_gemma":0.00286082,"teacher_disagreement_score":0.893222,"about_ca_system_score_codex":0.000064245636,"about_ca_system_score_gemma":0.000105766805,"threshold_uncertainty_score":0.6695036},"labels":[],"label_agreement":null},{"id":"W2609432100","doi":"10.1016/j.comnet.2017.04.054","title":"Safety message generation rate adaptation in LTE-based vehicular networks","year":2017,"lang":"en","type":"article","venue":"Computer Networks","topic":"Vehicular Ad Hoc Networks (VANETs)","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 Ottawa","funders":"","keywords":"Computer science; Beacon; AKA; Real-time computing; Queueing theory; Adaptation (eye); Software deployment; Vehicular ad hoc network; Computer network; Wireless; Telecommunications; Wireless ad hoc network","score_opus":0.01558301042563612,"score_gpt":0.21115327805450448,"score_spread":0.19557026762886837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2609432100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04217847,0.0012723973,0.95245427,0.000121081466,0.0026802232,0.00045756556,0.000002351022,0.0003697743,0.00046389483],"genre_scores_gemma":[0.9896985,0.0002530162,0.006371996,0.0003018945,0.0029389642,0.00004854146,0.00025243525,0.000102846134,0.000031792264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978439,0.00019031762,0.00054362277,0.0004814759,0.0002100202,0.0007306592],"domain_scores_gemma":[0.9984385,0.00010193263,0.00015905085,0.0010593989,0.000070633694,0.00017050459],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007751604,0.00040306867,0.0004272225,0.00011411242,0.0003754621,0.00044453534,0.0005869939,0.00037214853,0.000030442028],"category_scores_gemma":[0.000013459693,0.00044595456,0.00014125428,0.00018521362,0.000070505506,0.00043355307,0.00012126601,0.000662282,0.000024540954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019537378,0.000021770145,0.00068954355,0.0000139090325,0.000041420553,0.00008589829,0.000038306847,0.95060205,0.000025316047,0.00014421028,0.0034378262,0.04488023],"study_design_scores_gemma":[0.0011827417,0.00003280204,0.012873905,0.00013833024,0.000025146948,0.0000052266073,0.0000019273232,0.98167014,0.000031169046,0.000031055886,0.0035383077,0.0004692406],"about_ca_topic_score_codex":0.000029998,"about_ca_topic_score_gemma":0.00039084544,"teacher_disagreement_score":0.94752,"about_ca_system_score_codex":0.00019998802,"about_ca_system_score_gemma":0.000030175594,"threshold_uncertainty_score":0.9997992},"labels":[],"label_agreement":null},{"id":"W2616128853","doi":"10.1016/j.comnet.2017.05.014","title":"SERVitES: An efficient search and allocation resource protocol based on V2V communication for vehicular cloud","year":2017,"lang":"en","type":"article","venue":"Computer Networks","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":36,"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; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Computer science; Cloud computing; Protocol (science); Computer network; Resource allocation; Resource (disambiguation); Resource management (computing); Distributed computing; Vehicular ad hoc network; Wireless ad hoc network; Telecommunications; Operating system; Wireless","score_opus":0.017536323112464922,"score_gpt":0.26526345124674117,"score_spread":0.24772712813427625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2616128853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047279377,0.000097369186,0.92209566,0.00030018238,0.0002426498,0.02928219,0.0000040972845,0.00041450898,0.00028395338],"genre_scores_gemma":[0.9687624,0.000005337908,0.016974164,0.00033652797,0.0010141096,0.012643976,0.00015219729,0.000096662654,0.000014618267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986957,0.00013319521,0.00024231164,0.00033505957,0.00019558579,0.00039818438],"domain_scores_gemma":[0.99795854,0.00014560479,0.00006721342,0.0015780142,0.0000899784,0.00016062723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000713462,0.0002302768,0.00021309181,0.000060002585,0.00053303695,0.00038455514,0.0006520697,0.00018427985,0.0000037962147],"category_scores_gemma":[0.000009362228,0.00023608567,0.00006104464,0.00006695727,0.00007854649,0.0001127896,0.00015400472,0.00033834658,0.0000046804157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005639134,0.000053402666,0.00014217875,0.00008895012,0.000018728126,0.0000020011057,0.00007906866,0.9729457,0.000009651976,0.00018995284,0.0016210041,0.024792962],"study_design_scores_gemma":[0.001096389,0.00019217614,0.002486438,0.00024328589,0.000013411626,0.0000029647824,0.0000048284264,0.98136425,0.00004694147,0.000024662197,0.014273447,0.00025121425],"about_ca_topic_score_codex":0.000009337372,"about_ca_topic_score_gemma":0.000022801149,"teacher_disagreement_score":0.92148304,"about_ca_system_score_codex":0.00007667763,"about_ca_system_score_gemma":0.000015042904,"threshold_uncertainty_score":0.96272945},"labels":[],"label_agreement":null},{"id":"W2729888584","doi":"10.1016/j.comnet.2017.06.027","title":"Performance modeling and analysis of void-handling methodologies in underwater wireless sensor networks","year":2017,"lang":"en","type":"article","venue":"Computer Networks","topic":"Underwater Vehicles and Communication Systems","field":"Engineering","cited_by":32,"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":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Computer network; Void (composites); Network packet; The Void; Underwater; Routing protocol; Wireless sensor network; Distributed computing; Real-time computing","score_opus":0.0560026539149584,"score_gpt":0.26896049357701063,"score_spread":0.21295783966205223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2729888584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47312173,0.0003731743,0.5263014,0.000009800335,0.00007197521,0.000045327317,3.9077156e-7,0.000042781085,0.000033461467],"genre_scores_gemma":[0.97805613,0.0010900332,0.020689448,0.00001638169,0.0001074414,0.000007268281,0.000007981265,0.000018724659,0.000006609882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903977,0.00008267905,0.00037277903,0.0001830748,0.0000750722,0.00024661564],"domain_scores_gemma":[0.99910885,0.00011046688,0.00008990708,0.0006097671,0.00003940729,0.000041587118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000455492,0.00015235603,0.00044219915,0.00015697234,0.00014515131,0.0001344282,0.00039609283,0.00012500925,0.0000017676166],"category_scores_gemma":[9.3799156e-7,0.00013915166,0.00007224868,0.00015515217,0.00005387007,0.00016778389,0.00024578348,0.00021435897,4.21872e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005827598,0.0000039692627,0.027850443,0.000026163701,0.00020318187,9.807601e-7,0.0001816833,0.9301582,0.000046198602,0.00000946059,0.0000022519073,0.041511625],"study_design_scores_gemma":[0.00019030365,0.000010977961,0.014912788,0.00009122909,0.00007651293,0.0000017869229,0.000032259646,0.9844147,0.00007072222,0.00001732672,0.00002915994,0.00015223959],"about_ca_topic_score_codex":0.00004949975,"about_ca_topic_score_gemma":0.000058677422,"teacher_disagreement_score":0.5056119,"about_ca_system_score_codex":0.000022226006,"about_ca_system_score_gemma":0.0000029976572,"threshold_uncertainty_score":0.567444},"labels":[],"label_agreement":null},{"id":"W2780494139","doi":"10.1016/j.comnet.2017.12.009","title":"Using flow cost to globally allocate and optimize limited bandwidth in multipath routing","year":2017,"lang":"en","type":"article","venue":"Computer Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Multipath routing; Multipath propagation; Bandwidth (computing); Computer network; Routing (electronic design automation); Telecommunications; Dynamic Source Routing; Routing protocol; Channel (broadcasting)","score_opus":0.03846839244225675,"score_gpt":0.27851759476787535,"score_spread":0.2400492023256186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2780494139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023970004,0.00020287586,0.9727288,0.0004547929,0.0015322352,0.000658513,0.0000014437877,0.00016961155,0.0002817395],"genre_scores_gemma":[0.5441463,0.00003609857,0.4540164,0.001184105,0.0005570204,0.000019160767,0.000002727517,0.0000231863,0.000015012884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724865,0.00013590654,0.00048298476,0.0009755496,0.00027410846,0.000882778],"domain_scores_gemma":[0.99749076,0.00015561609,0.00025288435,0.0016355113,0.000103293205,0.0003619508],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00073380466,0.00036312934,0.0004675695,0.00011141144,0.00052643917,0.0017239773,0.002313404,0.0001955233,0.0000029743705],"category_scores_gemma":[0.00003187448,0.00037281011,0.00007440265,0.0003062492,0.00008616742,0.0007380972,0.0029272211,0.00040800238,0.000009839972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015159164,0.000030707535,0.009749159,0.0000043477717,0.000013446396,0.000076315584,0.0002622373,0.7605251,0.000005441112,0.00037694463,0.00047774668,0.22846337],"study_design_scores_gemma":[0.00096919225,0.000058776324,0.031983417,0.00026467687,0.0000075135986,0.00004040004,0.0000028681454,0.96556026,0.0000060469274,0.00009057453,0.00060765236,0.00040862706],"about_ca_topic_score_codex":0.00013719921,"about_ca_topic_score_gemma":0.00017723357,"teacher_disagreement_score":0.5201763,"about_ca_system_score_codex":0.00012459875,"about_ca_system_score_gemma":0.000051576142,"threshold_uncertainty_score":0.9998724},"labels":[],"label_agreement":null},{"id":"W2799906449","doi":"10.1016/j.comnet.2018.05.001","title":"Greedy Caching: An optimized content placement strategy for information-centric networks","year":2018,"lang":"en","type":"article","venue":"Computer Networks","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":57,"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; Cache; Latency (audio); Information-centric networking; Computer network; The Internet; Internet topology; Network topology; Download; Greedy algorithm; Enhanced Data Rates for GSM Evolution; Distributed computing; Core network; Network performance; Operating system; Algorithm","score_opus":0.045879713052084284,"score_gpt":0.25050472081307035,"score_spread":0.20462500776098608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799906449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003951558,0.00022415064,0.99081546,0.00016402351,0.0034052092,0.00067731336,0.0000037711886,0.0004138158,0.0003446874],"genre_scores_gemma":[0.958793,0.000034049895,0.03575334,0.0027866152,0.0023305337,0.000067893285,0.0001045488,0.000020297797,0.000109748595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977914,0.0001305397,0.00058517285,0.00049307896,0.00028551085,0.00071426743],"domain_scores_gemma":[0.9980611,0.0001760144,0.00025235603,0.00081660174,0.00040773972,0.00028613943],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062178954,0.00032039935,0.00034708326,0.00016817775,0.00047595135,0.00091499113,0.0011730266,0.00015708913,0.000010654515],"category_scores_gemma":[0.000010483942,0.00029650857,0.0001759649,0.00034920417,0.00007288531,0.0015712822,0.00041004753,0.0002856602,0.000026169973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010253501,0.00008491873,0.00017159845,0.0000068435666,0.00006413751,0.000003851853,0.00021279014,0.8599954,0.0000014184781,0.0070741577,0.009288581,0.122993745],"study_design_scores_gemma":[0.0020528748,0.0007690367,0.000667008,0.000039336002,0.000019997657,0.000020930927,0.000024890798,0.99236685,0.000003102145,0.0000823624,0.0035818182,0.00037179946],"about_ca_topic_score_codex":0.00006613161,"about_ca_topic_score_gemma":0.000013306901,"teacher_disagreement_score":0.95506215,"about_ca_system_score_codex":0.00009213931,"about_ca_system_score_gemma":0.00006811045,"threshold_uncertainty_score":0.9999487},"labels":[],"label_agreement":null},{"id":"W2805545219","doi":"10.1016/j.comnet.2018.05.020","title":"A quantitative relationship between Application Performance Metrics and Quality of Experience for Over-The-Top video","year":2018,"lang":"en","type":"article","venue":"Computer Networks","topic":"Image and Video Quality Assessment","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":"Telus (Canada); University of Guelph; University of Toronto","funders":"","keywords":"Computer science; Quality of experience; Session (web analytics); Metric (unit); Quality of service; Multimedia; Service quality; Quality (philosophy); Customer satisfaction; Service (business); Computer network; World Wide Web","score_opus":0.12394116873565587,"score_gpt":0.39317039971082945,"score_spread":0.2692292309751736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805545219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2894351,0.00013165805,0.70981336,0.00014187176,0.00014272961,0.00027618386,0.0000020561927,0.00003283127,0.00002420161],"genre_scores_gemma":[0.8690282,0.0000070720566,0.13039224,0.00023355454,0.00027032278,0.00004768131,0.0000058488486,0.0000052320597,0.000009867469],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9986633,0.00015395475,0.0004157177,0.0003420819,0.00021519355,0.00020973955],"domain_scores_gemma":[0.99674225,0.0021404428,0.00027995487,0.0005510202,0.00023483006,0.00005147526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011040732,0.0001156937,0.00020538946,0.00007570382,0.00028802644,0.000110197,0.0005866295,0.00006645228,7.907154e-7],"category_scores_gemma":[0.000079128295,0.000094727366,0.000046717974,0.00063076685,0.00020516945,0.0004948319,0.000278821,0.000116408,0.0000022307893],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035996844,0.000058887214,0.58143723,0.000093481416,0.000036891422,9.914322e-8,0.0046387883,0.00067264907,0.00001894454,0.26861608,0.00071474124,0.14367622],"study_design_scores_gemma":[0.00019737889,0.00016570304,0.51327103,0.00001589224,0.0000055725227,2.644259e-7,0.000018872997,0.48418018,0.000085635795,0.0015315065,0.00043321162,0.000094743664],"about_ca_topic_score_codex":0.000022646482,"about_ca_topic_score_gemma":0.000004437163,"teacher_disagreement_score":0.5795931,"about_ca_system_score_codex":0.000025809592,"about_ca_system_score_gemma":0.000028866669,"threshold_uncertainty_score":0.38628697},"labels":[],"label_agreement":null},{"id":"W2832811676","doi":"10.1016/j.comnet.2018.07.007","title":"SafePath: Differentially-private publishing of passenger trajectories in transportation systems","year":2018,"lang":"en","type":"article","venue":"Computer Networks","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Zayed University; Canada Excellence Research Chairs, Government of Canada","keywords":"Computer science; Data publishing; Scalability; Trie; Differential privacy; Raw data; Data mining; Publishing; Dimension (graph theory); Big data; Data anonymization; Task (project management); Software; Data structure; Data science; Information privacy; Database; Computer security","score_opus":0.023096862860121223,"score_gpt":0.238829086481077,"score_spread":0.2157322236209558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2832811676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12197708,0.00024517803,0.87326235,0.00095671375,0.002830374,0.00019626002,0.00000788265,0.0004498674,0.000074312484],"genre_scores_gemma":[0.884174,0.000042295756,0.115192555,0.00004981487,0.00047301684,0.000014389922,0.000033873454,0.000015325568,0.0000047144163],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790823,0.0001250089,0.00059885817,0.00057716976,0.00033489717,0.0004558279],"domain_scores_gemma":[0.99540186,0.0002121506,0.00025579246,0.0039155153,0.00015370079,0.000060953866],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0005117829,0.00021573636,0.00035918783,0.00024593034,0.00007547154,0.00051939854,0.014021506,0.00025228542,0.0000051552806],"category_scores_gemma":[0.00046537482,0.00020752086,0.00006429896,0.00092669204,0.00015720958,0.0018107013,0.0069035823,0.00037965077,0.000003606101],"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.00011296988,0.00063782773,0.13813008,0.00044590983,0.00029459823,0.00019873472,0.002852755,0.01881057,0.0009465465,0.16941933,0.24455898,0.4235917],"study_design_scores_gemma":[0.00035405814,0.00009507027,0.06589216,0.00020164285,0.0000054447073,0.0000036862461,0.000008045167,0.9229584,0.0002916786,0.009183013,0.0007796882,0.00022711836],"about_ca_topic_score_codex":0.0001324237,"about_ca_topic_score_gemma":0.00013657365,"teacher_disagreement_score":0.9041478,"about_ca_system_score_codex":0.000059905084,"about_ca_system_score_gemma":0.000033313005,"threshold_uncertainty_score":0.9913131},"labels":[],"label_agreement":null},{"id":"W2886870596","doi":"10.1016/j.comnet.2018.08.004","title":"Dynamic allocation of power delivery paths in consolidated data centers based on adaptive UPS switching","year":2018,"lang":"en","type":"article","venue":"Computer Networks","topic":"Cloud Computing and Resource Management","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 Waterloo","funders":"","keywords":"Data center; Computer science; Server; Power consumption; Real-time computing; Uninterruptible power supply; Power (physics); Embedded system; Computer network","score_opus":0.016095423086471775,"score_gpt":0.23553760944630647,"score_spread":0.2194421863598347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886870596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109236605,0.00004750193,0.8888782,0.00024372208,0.0009165347,0.00019886144,0.0000019821696,0.00011846647,0.00035807272],"genre_scores_gemma":[0.9711611,0.0000027701233,0.027745824,0.00093649625,0.00010890504,0.0000023319776,0.000021303433,0.000013361832,0.000007877509],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981467,0.0001792566,0.00037687243,0.0006778047,0.00026529154,0.00035407138],"domain_scores_gemma":[0.9980213,0.00018492939,0.00019081021,0.0014357979,0.000097063246,0.00007008391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000532629,0.00019690298,0.000232783,0.00021878965,0.00009548633,0.00008643246,0.0017994309,0.0000775057,0.0000039507822],"category_scores_gemma":[0.000008105016,0.00018711289,0.0000487172,0.00052298605,0.00006778867,0.000063998945,0.0013103542,0.0002263121,0.0000125815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068029716,0.00025533652,0.0008093799,0.0000115806915,0.000044174845,0.000032454456,0.00055076886,0.8323616,0.000015764734,0.0010058843,0.0022199939,0.16262506],"study_design_scores_gemma":[0.00057045155,0.00028221015,0.008813101,0.00028026247,0.000005976869,0.0000021536487,0.000014394694,0.9894294,0.000007879199,0.00006316965,0.00034307723,0.0001878927],"about_ca_topic_score_codex":0.00004977789,"about_ca_topic_score_gemma":0.000026047162,"teacher_disagreement_score":0.8619245,"about_ca_system_score_codex":0.000074436815,"about_ca_system_score_gemma":0.000039948245,"threshold_uncertainty_score":0.7630242},"labels":[],"label_agreement":null},{"id":"W2887555757","doi":"10.1016/j.comnet.2018.08.001","title":"Sensing, communication and security planes: A new challenge for a smart city system design","year":2018,"lang":"en","type":"article","venue":"Computer Networks","topic":"IoT Networks and Protocols","field":"Engineering","cited_by":126,"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; National Science Foundation","keywords":"Computer science; Smart city; Smart objects; Smart environment; Computer security; Robustness (evolution); Resilience (materials science); Smart system; Telecommunications; Internet of Things","score_opus":0.030001891019999925,"score_gpt":0.23649784487284786,"score_spread":0.20649595385284794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887555757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00058375293,0.0010987268,0.99374205,0.00004188737,0.00050753966,0.0028942705,0.0000014025784,0.00038993417,0.0007404287],"genre_scores_gemma":[0.92440337,0.00011827786,0.071294926,0.00011716012,0.0037303905,0.00023282404,0.000022670209,0.00005138669,0.000028976378],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992352,0.00006879783,0.0001931233,0.00017505989,0.000057137753,0.00027069668],"domain_scores_gemma":[0.9992678,0.00019161447,0.000040447598,0.00034572204,0.00004984988,0.00010454747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030111455,0.00016423369,0.00021099365,0.00002855428,0.00015291582,0.000095375646,0.00015334158,0.00016034133,0.0000046560726],"category_scores_gemma":[0.0000017446359,0.0001654424,0.000036531375,0.000073689735,0.000042098298,0.0000700616,0.00007169699,0.00016144862,0.000005235794],"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.0002323592,0.00004131164,0.00022929069,0.00076378713,0.0002667742,0.000010981601,0.0035927892,0.19523033,0.0000039124907,0.0039691706,0.41751534,0.37814397],"study_design_scores_gemma":[0.00044951582,0.00013364633,0.0000753957,0.00030613423,0.000013108117,0.000018263152,0.0000068910335,0.967034,0.000008391941,0.0007297578,0.031045757,0.0001791804],"about_ca_topic_score_codex":0.000020087544,"about_ca_topic_score_gemma":0.00003549015,"teacher_disagreement_score":0.92381966,"about_ca_system_score_codex":0.000035462464,"about_ca_system_score_gemma":0.000010620304,"threshold_uncertainty_score":0.6746545},"labels":[],"label_agreement":null},{"id":"W2901492899","doi":"10.1016/j.comnet.2018.11.010","title":"Dimensionality reduction with IG-PCA and ensemble classifier for network intrusion detection","year":2018,"lang":"en","type":"article","venue":"Computer Networks","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":304,"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; Dimensionality reduction; Artificial intelligence; Pattern recognition (psychology); Intrusion detection system; Principal component analysis; Support vector machine; Classifier (UML); Anomaly detection; False positive rate; Data mining; Machine learning; Constant false alarm rate; Multilayer perceptron; Curse of dimensionality; Artificial neural network","score_opus":0.013157224003874694,"score_gpt":0.22229643835634066,"score_spread":0.20913921435246596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901492899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037460756,0.00023755479,0.9571406,0.0003424342,0.0038220154,0.0004585599,4.630532e-7,0.0002985257,0.00023903968],"genre_scores_gemma":[0.8996146,0.00006809858,0.09277508,0.0006789374,0.006713436,0.0000454628,0.0000076056817,0.000024112433,0.00007268225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803966,0.00014000158,0.00031745655,0.00077224965,0.00023176412,0.00049888936],"domain_scores_gemma":[0.99869514,0.00014330083,0.00017899173,0.00052746123,0.0002957096,0.00015937984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057857943,0.00025299937,0.0002531438,0.00008480128,0.0009581766,0.00026126747,0.00029782832,0.00022011387,0.000007211177],"category_scores_gemma":[0.0000068437444,0.00021709317,0.00006835232,0.0005823805,0.00018144993,0.0006026601,0.0003400221,0.00027453824,0.000010373117],"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.00046200093,0.00008126692,0.00008080619,0.000023990231,0.00006535537,0.00000398966,0.00023809152,0.01801219,0.0004757826,0.016808908,0.020657556,0.9430901],"study_design_scores_gemma":[0.0006139542,0.0011971166,0.001366871,0.00008666187,0.000018805715,0.00013862496,0.000004499464,0.9577798,0.0008762987,0.008582125,0.029021025,0.0003142171],"about_ca_topic_score_codex":0.000012238111,"about_ca_topic_score_gemma":0.000055731638,"teacher_disagreement_score":0.94277585,"about_ca_system_score_codex":0.000059991948,"about_ca_system_score_gemma":0.000028949817,"threshold_uncertainty_score":0.88528025},"labels":[],"label_agreement":null},{"id":"W2913495226","doi":"10.1016/j.comnet.2019.01.016","title":"Safety and efficiency control protocol for highways using intelligent vehicular networks","year":2019,"lang":"en","type":"article","venue":"Computer Networks","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":23,"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 Excellence Research Chairs, Government of Canada","keywords":"Computer science; Protocol (science); Emergency vehicle; Throughput; Automotive engineering; Vehicular ad hoc network; Transport engineering; Real-time computing; Simulation; Wireless ad hoc network; Telecommunications; Engineering; Wireless; Medicine","score_opus":0.009968964142997595,"score_gpt":0.22719093376483648,"score_spread":0.2172219696218389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913495226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031142854,0.00041285923,0.9256358,0.000016408474,0.0012326537,0.06880329,0.000003939046,0.00064790546,0.00013285926],"genre_scores_gemma":[0.9471864,0.000050703085,0.018927457,0.0005795537,0.0040169805,0.028814597,0.00005380255,0.00032204902,0.00004845059],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976058,0.000078967314,0.00060051196,0.0005568711,0.00020230598,0.0009555478],"domain_scores_gemma":[0.9987583,0.00025915992,0.00010476022,0.0005444933,0.00009347842,0.00023979493],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004917095,0.00047211052,0.00060137216,0.00008762139,0.00015734343,0.00016503301,0.00034557717,0.0003374565,0.000026806927],"category_scores_gemma":[0.000004306964,0.00045794132,0.00018581001,0.00026045192,0.00006336537,0.00015566971,0.00013949271,0.0004822538,0.000014611241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009797443,0.000028738421,0.0004701815,0.000115669536,0.00010867383,0.000008646239,0.000029788825,0.9831684,0.000018674533,0.000324013,0.0019438261,0.013685409],"study_design_scores_gemma":[0.0024073073,0.00015819479,0.00028793298,0.00024399513,0.00004194197,0.00003543928,0.0000025279398,0.9646978,0.000014374731,0.000030479245,0.03156232,0.0005176931],"about_ca_topic_score_codex":0.0000034054924,"about_ca_topic_score_gemma":0.0000031498657,"teacher_disagreement_score":0.9440721,"about_ca_system_score_codex":0.00014964341,"about_ca_system_score_gemma":0.000022505406,"threshold_uncertainty_score":0.9997872},"labels":[],"label_agreement":null},{"id":"W2945400041","doi":"10.1016/j.comnet.2019.05.008","title":"Coded multicasting in cache-enabled vehicular ad hoc network","year":2019,"lang":"en","type":"article","venue":"Computer Networks","topic":"Caching and Content Delivery","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 Victoria","funders":"National Natural Science Foundation of China","keywords":"Computer science; Multicast; Computer network; Wireless ad hoc network; Cache; Vehicular ad hoc network; Source-specific multicast; Distributed computing; Wireless","score_opus":0.01063141649255198,"score_gpt":0.20280210028855528,"score_spread":0.1921706837960033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945400041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21537684,0.0020045813,0.77896154,0.00021168064,0.002409919,0.0003059682,2.9167396e-7,0.0003013076,0.0004278717],"genre_scores_gemma":[0.9722757,0.000053785832,0.025488919,0.0012532528,0.00062175165,0.000012780308,0.0000074263826,0.000023561573,0.0002628271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976717,0.00019817347,0.0004019782,0.0007013805,0.0002569752,0.0007697433],"domain_scores_gemma":[0.9985202,0.00029563878,0.00011940702,0.0008530146,0.000073871866,0.00013787425],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006100891,0.00026407733,0.00038981985,0.00010106306,0.000114247545,0.00029124305,0.0010592422,0.00015702026,0.000011354504],"category_scores_gemma":[0.000009626937,0.00026097853,0.00013920627,0.00059948844,0.000025417445,0.00035943883,0.00072618795,0.00055504905,0.00013170522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017202845,0.00005228778,0.008181201,0.000012480902,0.00002734333,0.00011144819,0.00019412127,0.9180173,0.000032617405,0.0012933885,0.0022692,0.06979138],"study_design_scores_gemma":[0.0009239083,0.00008191358,0.0055209463,0.00019312608,0.0000055953424,0.0000245625,0.0000058840283,0.9904965,0.000002948661,0.00018534089,0.0022339264,0.0003253222],"about_ca_topic_score_codex":0.000026423668,"about_ca_topic_score_gemma":0.000021153666,"teacher_disagreement_score":0.7568989,"about_ca_system_score_codex":0.00007776729,"about_ca_system_score_gemma":0.00003906779,"threshold_uncertainty_score":0.99998426},"labels":[],"label_agreement":null},{"id":"W2966998495","doi":"10.1016/j.comnet.2019.106879","title":"Interplay between Big Spectrum Data and Mobile Internet of Things: Current solutions and future challenges","year":2019,"lang":"en","type":"article","venue":"Computer Networks","topic":"IoT and Edge/Fog Computing","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":"Royal Bank of Canada","funders":"","keywords":"Computer science; Big data; Data science; Telecommunications; Analytics; Internet of Things; Computer security","score_opus":0.034749344533673,"score_gpt":0.27114696611532724,"score_spread":0.23639762158165423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966998495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037395973,0.019584721,0.9259848,0.0005482665,0.015801327,0.00025882173,9.2437335e-7,0.00013505443,0.00029013437],"genre_scores_gemma":[0.97044206,0.0027745983,0.014739436,0.000115109004,0.011848965,0.00000412839,0.00003405832,0.000021758111,0.00001991975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983943,0.000081853774,0.00031263995,0.00067345455,0.00014713498,0.00039062923],"domain_scores_gemma":[0.9985805,0.00018418946,0.00014971948,0.00093690975,0.00003609171,0.00011259193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045266162,0.00021020357,0.00033861984,0.000111793306,0.00007631933,0.00016074063,0.0012909847,0.00010106817,0.0000018018707],"category_scores_gemma":[0.0000022087286,0.00018956288,0.00003949095,0.0001626687,0.00006961978,0.0005489719,0.0043475404,0.00036661333,0.000009528161],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002556809,0.000028354672,0.0028990488,0.000065093736,0.00003997274,0.0000021406577,0.002234326,0.00007674749,7.8524636e-7,0.001425859,0.0028945934,0.9903305],"study_design_scores_gemma":[0.00027148554,0.00017519323,0.008700885,0.00021797394,0.000013655788,0.000025490015,0.00001786666,0.9188067,0.0000046044365,0.0005056394,0.07102627,0.00023424727],"about_ca_topic_score_codex":0.0000084825815,"about_ca_topic_score_gemma":0.0000011801175,"teacher_disagreement_score":0.9900963,"about_ca_system_score_codex":0.000016031216,"about_ca_system_score_gemma":0.000023088971,"threshold_uncertainty_score":0.773015},"labels":[],"label_agreement":null},{"id":"W2974519756","doi":"10.1016/j.comnet.2019.106900","title":"Experimental evaluation of LXC container migration for cloudlets using multipath TCP","year":2019,"lang":"en","type":"article","venue":"Computer Networks","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cloudlet; Multipath TCP; Computer science; Computer network; Quality of experience; Quality of service; Server; Cloud computing; Multihoming; Live migration; Testbed; Enhanced Data Rates for GSM Evolution; The Internet; Multipath propagation; Operating system; Virtualization; Internet Protocol; Telecommunications","score_opus":0.049737957004652354,"score_gpt":0.3072093262953446,"score_spread":0.25747136929069225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2974519756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41034022,0.00024096866,0.5812433,0.000022563707,0.0076079555,0.00044475473,1.1220876e-7,0.000046283887,0.00005388575],"genre_scores_gemma":[0.91037726,6.963521e-7,0.0870364,0.00014525877,0.0023848638,0.000013413112,0.000012597394,0.000014076278,0.00001541644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984865,0.00012285353,0.00035067025,0.00039532146,0.00033888748,0.00030574543],"domain_scores_gemma":[0.9988559,0.00013792992,0.00021333272,0.00041303443,0.0003232955,0.00005649402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081874285,0.00016618091,0.00023966786,0.00008447728,0.00009777947,0.0001011597,0.00043597035,0.00009569298,0.0000035980058],"category_scores_gemma":[0.000007874323,0.0001633737,0.00011862935,0.00019513098,0.000020623349,0.00031388612,0.0002386653,0.000091024405,0.0000068476907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004987092,0.00023739622,0.0035873412,0.000043782744,0.000077100354,0.0000017539127,0.0027520203,0.8171827,0.0073930924,0.0017778864,0.0074565066,0.15944055],"study_design_scores_gemma":[0.0011805473,0.00015136067,0.00084057177,0.000066625995,0.000014492295,0.000005987449,0.000009791121,0.9937253,0.0028596306,0.00014165671,0.00081554655,0.00018848326],"about_ca_topic_score_codex":0.000019083374,"about_ca_topic_score_gemma":7.9551114e-7,"teacher_disagreement_score":0.5000371,"about_ca_system_score_codex":0.000101343176,"about_ca_system_score_gemma":0.0000669905,"threshold_uncertainty_score":0.66621864},"labels":[],"label_agreement":null},{"id":"W2975545947","doi":"10.1016/j.comnet.2019.106904","title":"When QoE meets learning: A distributed traffic-processing framework for elastic resource provisioning in HetNets","year":2019,"lang":"en","type":"article","venue":"Computer Networks","topic":"IoT and Edge/Fog Computing","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":"Simon Fraser University","funders":"Natural Science Foundation of Hubei Province; National Natural Science Foundation of China","keywords":"Computer science; Provisioning; Computer network; Distributed computing; Resource (disambiguation); Heterogeneous network; Wireless; Telecommunications; Wireless network","score_opus":0.011308685547908141,"score_gpt":0.23748493575976634,"score_spread":0.2261762502118582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975545947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037841246,0.0005885479,0.9551744,0.00055895816,0.004658714,0.00056984095,2.0923407e-7,0.0005006441,0.000107472864],"genre_scores_gemma":[0.7439929,0.0000033157332,0.25218877,0.0003934847,0.0032378205,0.000025514044,0.000033477892,0.00005038772,0.0000743073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99689525,0.0001674238,0.0005820991,0.0009964496,0.00031515656,0.0010436432],"domain_scores_gemma":[0.9978808,0.00097629527,0.00027538027,0.00057680235,0.00011237711,0.00017832482],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007236333,0.0003739609,0.000499531,0.00020044998,0.00034299408,0.0006980314,0.0013163382,0.00030080706,0.0000028301367],"category_scores_gemma":[0.00007984313,0.0003720834,0.0001538002,0.0007297332,0.000041388168,0.00042518508,0.00074535946,0.0009055364,0.000026843578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002842491,0.00006047069,0.001258904,0.000064851745,0.000013977343,0.000016673566,0.0014341626,0.6815207,0.0000029509868,0.000906535,0.0038721366,0.31082022],"study_design_scores_gemma":[0.0006931228,0.0002196413,0.0013193616,0.00081494084,0.00000710095,0.00001787651,0.000013900789,0.9567665,0.0000050118874,0.0013359191,0.038361955,0.00044469422],"about_ca_topic_score_codex":0.0000031110642,"about_ca_topic_score_gemma":9.778023e-7,"teacher_disagreement_score":0.70615166,"about_ca_system_score_codex":0.0001148567,"about_ca_system_score_gemma":0.0000888997,"threshold_uncertainty_score":0.9998731},"labels":[],"label_agreement":null},{"id":"W2975661269","doi":"10.1016/j.comnet.2019.106927","title":"Unmanned aerial vehicle-assisted energy-efficient data collection scheme for sustainable wireless sensor networks","year":2019,"lang":"en","type":"article","venue":"Computer Networks","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":32,"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":"Canada Excellence Research Chairs, Government of Canada","keywords":"Computer science; Wireless sensor network; Efficient energy use; Real-time computing; Data collection; Cluster analysis; Drone; Scheme (mathematics); Computer network; Artificial intelligence","score_opus":0.009680749464402269,"score_gpt":0.20277228941135053,"score_spread":0.19309153994694828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975661269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02860277,0.00024522666,0.96863,0.000029680443,0.0010921109,0.00067829207,0.0000049630758,0.00038860636,0.00032834295],"genre_scores_gemma":[0.95734626,0.00015862123,0.037941467,0.00011685373,0.0018878938,0.00017247583,0.0013469298,0.00010761097,0.00092186825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987532,0.000025515988,0.00027466042,0.0003942726,0.00009987414,0.00045249774],"domain_scores_gemma":[0.99890465,0.00008705831,0.00006215123,0.00070499914,0.00016160596,0.00007955482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016264842,0.00019830174,0.000222962,0.00007736842,0.00018122332,0.0001601398,0.0003448311,0.00019409516,0.000017795235],"category_scores_gemma":[0.0000024609642,0.00021491991,0.000052315205,0.000509793,0.000018264585,0.00013953641,0.0001763542,0.00012993813,0.0000063074463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004446976,0.000042883916,0.00006839425,0.000023253417,0.000041118445,9.818492e-7,0.000013163536,0.9582646,0.00002759726,0.0009938291,0.029660719,0.010819007],"study_design_scores_gemma":[0.0009737448,0.00004795838,0.00028023307,0.000020132999,0.000014177082,0.0000031289426,0.000013421494,0.96995425,0.000026369573,0.0000105924255,0.028410392,0.00024557707],"about_ca_topic_score_codex":0.000021155007,"about_ca_topic_score_gemma":0.000005385895,"teacher_disagreement_score":0.93068856,"about_ca_system_score_codex":0.000108045686,"about_ca_system_score_gemma":0.00002230323,"threshold_uncertainty_score":0.876418},"labels":[],"label_agreement":null},{"id":"W2978924428","doi":"10.1016/j.comnet.2019.106937","title":"A functional taxonomy of caching schemes: Towards guided designs in information-centric networks","year":2019,"lang":"en","type":"article","venue":"Computer Networks","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":31,"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":"Queen's University","keywords":"Computer science; Scalability; The Internet; Benchmark (surveying); Distributed computing; Domain (mathematical analysis); Information-centric networking; Taxonomy (biology); Architecture; Internet of Things; Computer network; World Wide Web; Database","score_opus":0.03709930418390768,"score_gpt":0.214658890796357,"score_spread":0.1775595866124493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978924428","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026374083,0.000333927,0.9702511,0.00008772109,0.0017858719,0.00035696864,6.859683e-7,0.00011326576,0.00069637055],"genre_scores_gemma":[0.9840261,0.000026758766,0.014725162,0.0008228922,0.0002943843,0.000025170457,0.000022067563,0.0000081351145,0.00004937529],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983264,0.00010507219,0.0005838391,0.00030641223,0.00027694303,0.00040133263],"domain_scores_gemma":[0.99884504,0.00015265816,0.00022806774,0.0005430253,0.00014022425,0.00009100899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005060531,0.00020251486,0.00031088394,0.0002833832,0.000066870685,0.00018119554,0.0007566295,0.00012900084,0.000023332716],"category_scores_gemma":[0.000010459408,0.00019998591,0.00013630559,0.0006908145,0.000024338955,0.0011244379,0.0004486493,0.0003784799,0.000040436953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013252562,0.00003994342,0.009282433,0.000014123984,0.000026978796,0.0000039042156,0.000076967444,0.8899653,0.0000030953204,0.0037679123,0.005599769,0.09120631],"study_design_scores_gemma":[0.00080725754,0.0000568415,0.008596108,0.00009997851,0.000004682808,0.000017674462,0.0000072456914,0.9860893,0.000004413413,0.000055363525,0.0040487275,0.00021240462],"about_ca_topic_score_codex":0.00009700798,"about_ca_topic_score_gemma":0.0000038740113,"teacher_disagreement_score":0.957652,"about_ca_system_score_codex":0.000093735645,"about_ca_system_score_gemma":0.00011048269,"threshold_uncertainty_score":0.8155189},"labels":[],"label_agreement":null},{"id":"W3006903979","doi":"10.1016/j.comnet.2020.107172","title":"GR and BP neural network-based performance prediction of dual-antenna mobile communication networks","year":2020,"lang":"en","type":"article","venue":"Computer Networks","topic":"Machine Learning and ELM","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 Victoria","funders":"Lanzhou Jiaotong University; Key Technology Research and Development Program of Shandong; National Natural Science Foundation of China; Natural Science Foundation of Shandong Province; Ministry of Education","keywords":"Computer science; Support vector machine; Artificial neural network; Rayleigh fading; Extreme learning machine; Phase-shift keying; Antenna (radio); Algorithm; Quadrature amplitude modulation; Radial basis function; Bit error rate; Fading; Artificial intelligence; Machine learning; Channel (broadcasting); Telecommunications","score_opus":0.012280665267196013,"score_gpt":0.2066395395311718,"score_spread":0.1943588742639758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006903979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04812971,0.0019300599,0.9479745,0.00076063577,0.0005236588,0.00023971719,0.0000011056055,0.0003333558,0.00010727179],"genre_scores_gemma":[0.9749024,0.0002706289,0.022020247,0.0018983125,0.0008166279,0.000020623218,0.00003743391,0.000019093146,0.000014668164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983201,0.00024409624,0.00041499967,0.00043537212,0.00019865383,0.00038677306],"domain_scores_gemma":[0.9986404,0.00019280364,0.0002350165,0.00065548596,0.0000968457,0.00017945784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038649922,0.00022072971,0.00031160543,0.00004358217,0.00025300524,0.00015464661,0.0006959744,0.0001303669,0.0000069393723],"category_scores_gemma":[0.000006305984,0.00021277025,0.00007794207,0.0005162524,0.00010138885,0.00036899248,0.00057493785,0.00044416977,0.0000031163615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021371616,0.000025738478,0.010887621,0.000026654841,0.000015758667,0.0000022568252,0.00019739561,0.8778852,0.000001990281,0.0002581434,0.0042014006,0.10647645],"study_design_scores_gemma":[0.0005147684,0.0004317276,0.020699874,0.00009021149,0.000013142178,0.000011541818,0.0000023199686,0.97480375,0.000002266274,0.000019870258,0.0032453116,0.00016519902],"about_ca_topic_score_codex":0.0000111067,"about_ca_topic_score_gemma":0.0000015437541,"teacher_disagreement_score":0.92677265,"about_ca_system_score_codex":0.000013890108,"about_ca_system_score_gemma":0.000021294589,"threshold_uncertainty_score":0.8676519},"labels":[],"label_agreement":null},{"id":"W3019465497","doi":"10.1016/j.comnet.2020.107278","title":"Congestion tracking control for multi-router TCP/AQM network based on integral backstepping","year":2020,"lang":"en","type":"article","venue":"Computer Networks","topic":"Network Traffic and Congestion Control","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":"Lakehead University","funders":"Taishan Scholar Project of Shandong Province","keywords":"Active queue management; Computer science; Computer network; Network congestion; Explicit Congestion Notification; TCP Friendly Rate Control; Router; TCP tuning; Packet loss; TCP global synchronization; TCP Vegas; Bottleneck; TCP Westwood plus; CUBIC TCP; Backstepping; Network packet; Control (management); Adaptive control; Embedded system","score_opus":0.03965669460011897,"score_gpt":0.24895093754890907,"score_spread":0.2092942429487901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3019465497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021195936,0.0003275092,0.98885745,0.0055620586,0.003027055,0.0010726671,0.000005042791,0.0008407305,0.00009552686],"genre_scores_gemma":[0.8103413,0.0000074941727,0.15748253,0.026863035,0.00507594,0.00012792992,0.00002651885,0.000047997702,0.000027242218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676156,0.0002804579,0.0006328886,0.0010600726,0.00031632558,0.000948671],"domain_scores_gemma":[0.997548,0.0009346509,0.0002734487,0.0006022478,0.00022422647,0.00041744972],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055447477,0.0004982712,0.0006173981,0.00007543959,0.00035894715,0.00056554796,0.0012105288,0.00026762867,0.000015413578],"category_scores_gemma":[0.000044383945,0.0004734238,0.00035219183,0.00050251186,0.00007132475,0.00040665665,0.00013731541,0.000599398,0.000041698953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012356005,0.0000467552,0.00038119146,0.000011615695,0.000043652817,0.000013222762,0.00006999441,0.63212025,0.000001521315,0.005638309,0.0096430695,0.35190684],"study_design_scores_gemma":[0.0047187274,0.0005441826,0.0012144776,0.00019505153,0.000041338822,0.000005249077,0.000003405315,0.9828445,0.0000025102313,0.000088723056,0.009823861,0.000518],"about_ca_topic_score_codex":0.000002003151,"about_ca_topic_score_gemma":0.000005149688,"teacher_disagreement_score":0.83137494,"about_ca_system_score_codex":0.00007121089,"about_ca_system_score_gemma":0.00007285902,"threshold_uncertainty_score":0.9997718},"labels":[],"label_agreement":null},{"id":"W3020847852","doi":"10.1016/j.comnet.2020.107289","title":"ERRANT: Realistic emulation of radio access networks","year":2020,"lang":"en","type":"article","venue":"Computer Networks","topic":"Image and Video Quality Assessment","field":"Computer Science","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":"Western University","funders":"European Commission","keywords":"Computer science; Emulation; Radio access network; Upload; Computer network; Quality of experience; Cellular network; Quality of service; Distributed computing; World Wide Web; Base station; Mobile station","score_opus":0.05900736033322978,"score_gpt":0.30808244292052994,"score_spread":0.24907508258730016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3020847852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005008682,0.00036852673,0.9958419,0.0016141083,0.0008688188,0.00021247585,0.0000011033328,0.00020328161,0.00038887074],"genre_scores_gemma":[0.96248114,0.00005040054,0.032827802,0.0032213007,0.0013621859,0.0000068514505,0.0000228632,0.00001556531,0.0000119179895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981996,0.00018857396,0.0005032385,0.00047908456,0.0002792373,0.00035028651],"domain_scores_gemma":[0.9986861,0.00019754935,0.0002407646,0.0005744106,0.00012195314,0.00017921912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002667755,0.00019647086,0.00035443794,0.00005225544,0.000102908205,0.00031119006,0.0014721944,0.00010847647,0.000015821868],"category_scores_gemma":[0.000012199319,0.00019319025,0.00012104371,0.0006358331,0.000049892773,0.00071278785,0.00073869614,0.00025795234,0.0000069552216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015407537,0.00004507725,0.0007075739,0.00003693899,0.00003803238,0.00002387303,0.00046925768,0.87815523,0.0000042882302,0.0137050925,0.01625791,0.090541326],"study_design_scores_gemma":[0.00035884243,0.00011193712,0.0067227203,0.000047877085,0.000013511969,0.0000056191216,0.0000025306372,0.9906906,0.000019875944,0.00047916116,0.0013410276,0.0002062788],"about_ca_topic_score_codex":0.000027234508,"about_ca_topic_score_gemma":0.0000028109184,"teacher_disagreement_score":0.9630141,"about_ca_system_score_codex":0.000027819466,"about_ca_system_score_gemma":0.00004258712,"threshold_uncertainty_score":0.787807},"labels":[],"label_agreement":null},{"id":"W3033527907","doi":"10.1016/j.comnet.2020.107350","title":"Power allocation and resource assignment for secure D2D communication underlaying cellular networks: A Tabu search approach","year":2020,"lang":"en","type":"article","venue":"Computer Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":22,"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":"Polytechnique Montréal","keywords":"Computer science; Eavesdropping; Tabu search; Cellular network; Power control; Mathematical optimization; Resource allocation; Distributed computing; Computational complexity theory; Computer network; Algorithm; Power (physics); Mathematics","score_opus":0.04357913623413174,"score_gpt":0.25308148273789105,"score_spread":0.20950234650375932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033527907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006911553,0.0047667413,0.9875597,0.005118005,0.00012673871,0.0007916851,8.312113e-7,0.00026356985,0.00068160804],"genre_scores_gemma":[0.8851705,0.0007266657,0.10986453,0.0036529845,0.0003473149,0.00008638595,0.00008667905,0.00003190363,0.000033028427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770314,0.0005191959,0.0004161772,0.00066442246,0.00024617734,0.0004508865],"domain_scores_gemma":[0.997901,0.00042586066,0.00015308986,0.0010747582,0.00018334806,0.0002618977],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080913334,0.0002754491,0.0003062729,0.00006541007,0.0006647704,0.00056297996,0.0015451374,0.00015735083,0.000006794705],"category_scores_gemma":[0.000012508404,0.00028227194,0.000091967915,0.0005996688,0.000098641016,0.0003794054,0.0015119793,0.0005170944,0.0000032908108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049855822,0.00015768906,0.00025866443,0.000053980166,0.00012176203,0.0000024654119,0.0065682847,0.66472906,0.000114212606,0.09569401,0.02561467,0.20663534],"study_design_scores_gemma":[0.00058731565,0.00013266315,0.00016212257,0.00006049633,0.0000105111385,0.000004653197,0.00008865739,0.97885346,0.000022787108,0.00011569798,0.01965881,0.00030283284],"about_ca_topic_score_codex":0.0000013089251,"about_ca_topic_score_gemma":0.0000012293659,"teacher_disagreement_score":0.88447934,"about_ca_system_score_codex":0.00007577654,"about_ca_system_score_gemma":0.000041000407,"threshold_uncertainty_score":0.9999629},"labels":[],"label_agreement":null},{"id":"W3043824282","doi":"10.1016/j.comnet.2021.108492","title":"Energy efficiency through joint routing and function placement in different modes of SDN/NFV networks","year":2021,"lang":"en","type":"preprint","venue":"Computer Networks","topic":"Software-Defined Networks and 5G","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":"University of Toronto","funders":"","keywords":"Computer science; Network Functions Virtualization; Scalability; Distributed computing; Efficient energy use; Software-defined networking; Computer network; Cloud computing; Engineering","score_opus":0.021715928076708614,"score_gpt":0.21903283082289135,"score_spread":0.19731690274618274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043824282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023876118,0.011012129,0.9603349,0.00012578003,0.0039006395,0.0003496127,0.0000016583529,0.00023414292,0.00016503857],"genre_scores_gemma":[0.971305,0.0020436884,0.024431927,0.0005325979,0.0014534707,0.00007355089,0.00008453372,0.00005135707,0.000023855147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99533355,0.00036793255,0.0012384861,0.0016537575,0.00049949775,0.00090677827],"domain_scores_gemma":[0.99721754,0.00039726953,0.0006625695,0.0013838469,0.00017127719,0.00016751765],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005137438,0.0007812729,0.0012525751,0.0002022939,0.00016642381,0.000538447,0.001052054,0.00067720615,0.000011452594],"category_scores_gemma":[0.000010678408,0.00071989524,0.000310733,0.00060208305,0.00011339076,0.0002701277,0.0055337334,0.0011703039,4.3537645e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023172752,0.00020030895,0.0014776712,0.00008637984,0.00008995462,0.000028325958,0.0004173792,0.9194555,0.0000029596756,0.0054383078,0.00089110446,0.0718889],"study_design_scores_gemma":[0.0007003047,0.00018775066,0.00502595,0.0014724215,0.000042420084,0.0000149547595,0.00002584566,0.99026406,0.000027735668,0.001461992,0.00013303093,0.00064351066],"about_ca_topic_score_codex":0.00019534038,"about_ca_topic_score_gemma":0.00007356256,"teacher_disagreement_score":0.9474289,"about_ca_system_score_codex":0.00016909612,"about_ca_system_score_gemma":0.00010451141,"threshold_uncertainty_score":0.9995252},"labels":[],"label_agreement":null},{"id":"W3049739154","doi":"10.1016/j.comnet.2020.107482","title":"Real-time dissemination of emergency warning messages in 5G enabled selfish vehicular social networks","year":2020,"lang":"en","type":"article","venue":"Computer Networks","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":10,"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":"Institute of Population and Public Health; King Saud University","keywords":"Computer science; Computer network; Selfishness; Overhead (engineering); Node (physics); Reputation; Dissemination; Distributed computing; Vehicular ad hoc network; Wireless ad hoc network; Computer security; Wireless; Telecommunications","score_opus":0.01459281520450111,"score_gpt":0.2434643021491746,"score_spread":0.2288714869446735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3049739154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012321854,0.0003167782,0.9833049,0.0009334304,0.0010017717,0.00029014176,0.0000016957931,0.0002816106,0.0015477842],"genre_scores_gemma":[0.9857397,0.00039939763,0.011536258,0.00027911496,0.0018154175,0.000018328617,0.00005390426,0.00003771045,0.000120135715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969934,0.0002873537,0.0008951154,0.0007430547,0.00040663162,0.00067441806],"domain_scores_gemma":[0.9985195,0.00023427681,0.00042030428,0.0004155723,0.00016937355,0.00024101525],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058297015,0.00035543114,0.0006521526,0.00010601859,0.00019195749,0.00011615842,0.001102962,0.00032123673,0.00007837241],"category_scores_gemma":[0.0000096808,0.0003712053,0.00020467288,0.001173149,0.000053935815,0.00043694596,0.0004880106,0.0005243914,0.000011284471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008489596,0.00026130682,0.00454427,0.00010265017,0.00015488763,0.0003330495,0.0043862793,0.47129998,0.00016258098,0.004472348,0.14076704,0.37343073],"study_design_scores_gemma":[0.0003540687,0.00010489574,0.0045090877,0.00011534123,0.000022683083,0.00000488076,0.000014723087,0.993685,0.000008287241,0.00019415989,0.00060896075,0.00037792113],"about_ca_topic_score_codex":0.000017066091,"about_ca_topic_score_gemma":0.000002449432,"teacher_disagreement_score":0.9734179,"about_ca_system_score_codex":0.000047037043,"about_ca_system_score_gemma":0.000054858163,"threshold_uncertainty_score":0.999874},"labels":[],"label_agreement":null},{"id":"W3080531147","doi":"10.1016/j.comnet.2020.107440","title":"Delivering Video-on-Demand services with IEEE 802.11p to major non-urban roads: A stochastic performance analysis","year":2020,"lang":"en","type":"article","venue":"Computer Networks","topic":"Vehicular Ad Hoc Networks (VANETs)","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":"Wilfrid Laurier University; University of Ottawa","funders":"","keywords":"Computer science; Probabilistic logic; Service (business); Codec; Throughput; Blocking (statistics); IEEE 802; Discrete event simulation; Computer network; Real-time computing; Simulation; Quality of service; Telecommunications; Wireless","score_opus":0.004442533530198014,"score_gpt":0.16736481772743067,"score_spread":0.16292228419723265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080531147","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40235484,0.00022257655,0.5963991,0.000048765884,0.0002645339,0.000274479,0.0000026818796,0.00034332904,0.000089686146],"genre_scores_gemma":[0.9891707,0.000026623267,0.007249062,0.0014190587,0.0019390433,0.000048083486,0.000032638975,0.000103966115,0.00001086403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979029,0.00003220499,0.00037107046,0.00061291497,0.00032610723,0.00075477245],"domain_scores_gemma":[0.9987587,0.00007419596,0.00006672347,0.000529844,0.00006786356,0.0005027047],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012585899,0.00048248752,0.0006121634,0.00018585095,0.00013851273,0.00018471606,0.0005699939,0.00014502238,0.00002711523],"category_scores_gemma":[0.0000010968919,0.0004534593,0.00015663008,0.0014504454,0.00002573917,0.00021420402,0.0001474731,0.0004819785,0.00012662451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006876685,0.000013263857,0.001445723,0.00010015205,0.00073563645,0.000043699078,0.00070999324,0.9900062,0.000018304247,0.0000021114129,0.0024984619,0.004357661],"study_design_scores_gemma":[0.00052233634,0.0002964305,0.0053183925,0.0002559983,0.00034618567,0.0000092149485,0.000009017566,0.99208724,0.000030292533,8.41318e-7,0.00056621595,0.0005578497],"about_ca_topic_score_codex":0.000015031931,"about_ca_topic_score_gemma":0.00006285896,"teacher_disagreement_score":0.5891501,"about_ca_system_score_codex":0.00008319697,"about_ca_system_score_gemma":0.000012173676,"threshold_uncertainty_score":0.99979174},"labels":[],"label_agreement":null},{"id":"W3087454209","doi":"10.1016/j.comnet.2020.107558","title":"IoT in medical & pharmaceutical: Designing lightweight RFID security protocols for ensuring supply chain integrity","year":2020,"lang":"en","type":"article","venue":"Computer Networks","topic":"RFID technology advancements","field":"Engineering","cited_by":59,"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; Vanier College","funders":"","keywords":"Computer science; Supply chain; Internet of Things; Protocol (science); Computer security; Blockchain; Data integrity; Cryptographic protocol; Embedded system; Cryptography; Business","score_opus":0.04033999035970266,"score_gpt":0.31164890673529455,"score_spread":0.2713089163755919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3087454209","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02058873,0.00029493147,0.97037965,0.00092105166,0.00044781348,0.006291532,0.000004482625,0.0009967887,0.00007501711],"genre_scores_gemma":[0.90706295,0.00005010057,0.08499929,0.0011437524,0.0012839532,0.005334986,0.00002896234,0.00009181761,0.000004203389],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982011,0.000069744136,0.00046796884,0.0004159946,0.0002217655,0.0006234379],"domain_scores_gemma":[0.9991791,0.00023076378,0.000043565855,0.00025593967,0.00003706092,0.00025353374],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004255166,0.00027767298,0.00039147315,0.00008698257,0.00006031986,0.00003734363,0.00054823735,0.00038727347,0.000061750914],"category_scores_gemma":[0.00007018174,0.00029234658,0.00007507225,0.00034863962,0.00006929286,0.000091773065,0.00023071194,0.0013437156,0.000016884727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004093533,0.0004469914,0.039487872,0.0016594171,0.00042714065,0.0004021803,0.0023758218,0.55205035,0.0012959557,0.0034007253,0.043327644,0.3547165],"study_design_scores_gemma":[0.0013527762,0.00005673516,0.0002590541,0.0002807898,0.000007075636,0.000008999126,0.0000029836071,0.9482168,0.0024410225,0.000565793,0.046515837,0.00029211096],"about_ca_topic_score_codex":0.0000011266524,"about_ca_topic_score_gemma":0.000010494946,"teacher_disagreement_score":0.8864742,"about_ca_system_score_codex":0.00009740609,"about_ca_system_score_gemma":0.000022938268,"threshold_uncertainty_score":0.99995285},"labels":[],"label_agreement":null},{"id":"W3097879566","doi":"10.1016/j.comnet.2020.107628","title":"An Intelligent UAV based Data Aggregation Algorithm for 5G-enabled Internet of Things","year":2020,"lang":"en","type":"article","venue":"Computer Networks","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":28,"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; Data aggregator; Internet of Things; Baseline (sea); Reinforcement learning; Efficient energy use; Process (computing); Task (project management); Energy (signal processing); Decomposition; Real-time computing; Wireless sensor network; Computer security; Computer network; Artificial intelligence","score_opus":0.024192507684663574,"score_gpt":0.23190480561957957,"score_spread":0.207712297934916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3097879566","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021353958,0.00012377018,0.9988745,0.000055471537,0.00020333484,0.00028253798,0.000009829366,0.00018204929,0.000054954406],"genre_scores_gemma":[0.27995574,0.000035657984,0.7175772,0.00038502115,0.0005287055,0.000027461607,0.001448874,0.000035319714,0.0000059862236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994085,0.000011478601,0.00021208629,0.00019746264,0.000059119273,0.000111345034],"domain_scores_gemma":[0.99944943,0.000041286276,0.000046997407,0.000340076,0.00005858047,0.00006360994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000092193055,0.00009371542,0.000122055986,0.000027367054,0.000020595688,0.000044484525,0.00036742276,0.00006343035,0.000016321004],"category_scores_gemma":[0.0000025993218,0.00009818101,0.000025682424,0.00015005081,0.0000115338025,0.00021573289,0.000036609905,0.00007950282,0.000002686968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026929688,0.0000118472335,0.00000866709,0.000020599487,0.000012125823,1.5922497e-7,0.000110752255,0.6733823,0.000009478176,0.00007048274,0.0048848446,0.3214861],"study_design_scores_gemma":[0.00018409704,0.00005796022,0.00001807378,0.000027137514,0.000014005949,3.7476414e-7,0.0000039965544,0.99344385,0.0005047911,0.000036231926,0.005610629,0.00009885886],"about_ca_topic_score_codex":0.000006693413,"about_ca_topic_score_gemma":7.6058683e-7,"teacher_disagreement_score":0.3213872,"about_ca_system_score_codex":0.000014668384,"about_ca_system_score_gemma":0.0000074869176,"threshold_uncertainty_score":0.40037054},"labels":[],"label_agreement":null},{"id":"W3116066402","doi":"10.1016/j.comnet.2020.107751","title":"Physical resilience to insider attacks in IoT networks: Independent cryptographically secure sequences for DSSS anti-jamming","year":2020,"lang":"en","type":"article","venue":"Computer Networks","topic":"Chaos-based Image/Signal Encryption","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; Jamming; Resilience (materials science); Wireless; Spread spectrum; Direct-sequence spread spectrum; Network packet; Computer network; Physical layer; Computer security; Wireless ad hoc network; Distributed computing; Telecommunications; Channel (broadcasting)","score_opus":0.01658024795988068,"score_gpt":0.25998338440962027,"score_spread":0.2434031364497396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116066402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08461296,0.00016088407,0.9092764,0.004152312,0.00067317527,0.00079117843,0.0000018628009,0.00030289954,0.000028335493],"genre_scores_gemma":[0.89125216,0.000017572971,0.09730081,0.0093948385,0.0019095575,0.00007805392,0.000009272683,0.000034537108,0.0000031903858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99635774,0.00021108382,0.0005924207,0.0013559471,0.00055087276,0.0009319634],"domain_scores_gemma":[0.99795777,0.0005388625,0.00018745616,0.00062272913,0.00020278296,0.00049037696],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004897073,0.0004370064,0.0005599208,0.00021041227,0.00019864674,0.00049039494,0.001813295,0.00021346327,0.0000047803574],"category_scores_gemma":[0.000054970267,0.00043550253,0.0002262088,0.0020302238,0.00011390641,0.0005620179,0.00084371277,0.00073903083,0.000017912844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048620328,0.00009226953,0.0012478639,0.000030932064,0.00002014306,0.00007787174,0.001192705,0.94768864,0.00030506673,0.0033715605,0.0033572186,0.042567115],"study_design_scores_gemma":[0.00068361487,0.0005389684,0.004787457,0.00016274626,0.000011209264,0.0000128729225,0.00002092743,0.9910041,0.00011617707,0.0011282945,0.0010136263,0.00051999063],"about_ca_topic_score_codex":0.000023606324,"about_ca_topic_score_gemma":0.00004515973,"teacher_disagreement_score":0.8119756,"about_ca_system_score_codex":0.00009843726,"about_ca_system_score_gemma":0.00010921683,"threshold_uncertainty_score":0.9998097},"labels":[],"label_agreement":null},{"id":"W3120131065","doi":"10.1016/j.comnet.2021.107819","title":"SP2F: A secured privacy-preserving framework for smart agricultural Unmanned Aerial Vehicles","year":2021,"lang":"en","type":"article","venue":"Computer Networks","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":184,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Botnet; Computer security; Scalability; Anomaly detection; Single point of failure; The Internet; Artificial intelligence; Computer network; Database; World Wide Web","score_opus":0.013115433886856046,"score_gpt":0.2389738888592537,"score_spread":0.22585845497239765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120131065","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026947958,0.00078302773,0.96323615,0.006617836,0.0013708619,0.0003791922,0.0000035379092,0.00058631843,0.00007513387],"genre_scores_gemma":[0.48520684,0.000032596512,0.5125522,0.00085943314,0.0011398725,0.00012572443,0.00003185235,0.000014200942,0.000037311227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819493,0.0000807826,0.00032420526,0.0007164054,0.00015426679,0.0005294039],"domain_scores_gemma":[0.9979464,0.00033574816,0.00012909295,0.0012336322,0.00023838312,0.0001167386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020951331,0.00023043502,0.00030076987,0.00005177875,0.00038069705,0.00031375332,0.0018226987,0.00039536093,0.000009995083],"category_scores_gemma":[0.00005249755,0.00021249888,0.00016857174,0.0006850656,0.00006408801,0.00019413319,0.0017207981,0.0004282524,0.000010301079],"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.000018067169,0.00024451988,0.0003858259,0.000039385497,0.0001277416,0.000029681483,0.00070753763,0.00530786,0.0001417547,0.84871995,0.053657416,0.09062027],"study_design_scores_gemma":[0.0005304039,0.0000738634,0.0031115306,0.0000733847,0.000015072823,0.000048985134,0.000019472986,0.83062506,0.00074834056,0.13809006,0.02628928,0.00037456024],"about_ca_topic_score_codex":0.000003417333,"about_ca_topic_score_gemma":0.000010238118,"teacher_disagreement_score":0.8253172,"about_ca_system_score_codex":0.00003642157,"about_ca_system_score_gemma":0.000051350955,"threshold_uncertainty_score":0.8665453},"labels":[],"label_agreement":null},{"id":"W3127503959","doi":"10.1016/j.comnet.2021.107904","title":"Stochastic joint rate control and resource allocation for wireless video surveillance","year":2021,"lang":"en","type":"article","venue":"Computer Networks","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Newfoundland and Labrador; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Base station; Telecommunications link; Resource allocation; Lyapunov optimization; Wireless; Real-time computing; Upload; Latency (audio); Quality of service; Optimization problem; Mathematical optimization; Computer network; Algorithm; Telecommunications; Artificial intelligence","score_opus":0.00652270278845727,"score_gpt":0.18868521973132946,"score_spread":0.1821625169428722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127503959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046633733,0.0016539589,0.99238116,0.00012603348,0.0005595291,0.00030293877,0.000005169249,0.0002774707,0.000030379644],"genre_scores_gemma":[0.98272556,0.00013868911,0.015742019,0.00026283538,0.0008659234,0.00006103569,0.000113923525,0.000060243678,0.000029754385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990716,0.000059088805,0.00024623325,0.00027447855,0.00006381514,0.00028476177],"domain_scores_gemma":[0.99928576,0.00025117825,0.000051615978,0.00022348962,0.0001104604,0.00007748324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016765695,0.00017315302,0.0002584261,0.000031065647,0.00008416161,0.00006821407,0.000070164686,0.00009731382,0.0000025707973],"category_scores_gemma":[0.000012925492,0.00019901099,0.0000408507,0.00016549903,0.000028638293,0.00009270787,0.000036607915,0.00013311832,0.000001440315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011766211,0.0000061652468,0.000030355895,0.000031052394,0.00003275543,0.0000026710698,0.000029963205,0.95878404,0.0001060914,0.00031349398,0.002200093,0.038451545],"study_design_scores_gemma":[0.00086192624,0.000019598247,0.0010481724,0.00006870525,0.000010992566,0.00000943626,0.0000041759113,0.9965634,0.00003388772,0.00011691124,0.0010516564,0.00021117167],"about_ca_topic_score_codex":4.060051e-7,"about_ca_topic_score_gemma":0.0000074231466,"teacher_disagreement_score":0.9780622,"about_ca_system_score_codex":0.000048907452,"about_ca_system_score_gemma":0.000010414588,"threshold_uncertainty_score":0.8115433},"labels":[],"label_agreement":null},{"id":"W3163488673","doi":"10.1016/j.comnet.2021.108177","title":"Task offloading in Edge and Cloud Computing: A survey on mathematical, artificial intelligence and control theory solutions","year":2021,"lang":"en","type":"article","venue":"Computer Networks","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":261,"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":"Engineering and Physical Sciences Research Council; CHIST-ERA; Agence Nationale de la Recherche","keywords":"Computer science; Cloud computing; Task (project management); Distributed computing; Edge computing; Enhanced Data Rates for GSM Evolution; Resource (disambiguation); Control (management); Edge device; Artificial intelligence; Computer network; Systems engineering","score_opus":0.046479772578705496,"score_gpt":0.2598257109771863,"score_spread":0.21334593839848082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163488673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030530956,0.0007642595,0.96268743,0.00030949598,0.0052737547,0.0001740954,6.61526e-7,0.00012326526,0.00013606274],"genre_scores_gemma":[0.97359985,0.000031275868,0.022641258,0.0008313592,0.002853491,0.0000032186103,0.0000066733833,0.000018758725,0.000014107622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973195,0.0006289387,0.00052032515,0.0007088621,0.00017756967,0.0006447834],"domain_scores_gemma":[0.99681664,0.0023291735,0.00011134876,0.00046454964,0.00010727365,0.00017099158],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019284498,0.000262284,0.00042363853,0.00013562644,0.00035255685,0.0005189654,0.00044299697,0.0001383214,0.0000021438684],"category_scores_gemma":[0.000117067,0.00026225045,0.000059023136,0.0005834945,0.00015009221,0.00015763626,0.00084555516,0.00046675224,0.000015823358],"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.000054522985,0.00043279896,0.0029175,0.000063240004,0.00008638094,0.00022119042,0.0029163032,0.03778029,0.00003772945,0.2035059,0.0045309453,0.7474532],"study_design_scores_gemma":[0.00019443805,0.00007883414,0.008546939,0.00020366845,0.0000073618876,0.000057975292,0.00001241495,0.9548915,0.000023531693,0.035518523,0.00018421537,0.00028057295],"about_ca_topic_score_codex":0.000009992282,"about_ca_topic_score_gemma":0.00001124701,"teacher_disagreement_score":0.9430689,"about_ca_system_score_codex":0.00004133375,"about_ca_system_score_gemma":0.00006489817,"threshold_uncertainty_score":0.99998295},"labels":[],"label_agreement":null},{"id":"W3173901672","doi":"10.1016/j.comnet.2021.108241","title":"LA-Trickle: A novel algorithm to reduce the convergence time of the wireless sensor networks","year":2021,"lang":"en","type":"article","venue":"Computer Networks","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","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":"University of Toronto","funders":"","keywords":"Computer science; Learning automata; Convergence (economics); Wireless sensor network; Algorithm; Routing protocol; The Internet; Computer network; Routing (electronic design automation); Automaton; Real-time computing; Theoretical computer science","score_opus":0.009133769860138205,"score_gpt":0.2143535463267099,"score_spread":0.2052197764665717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173901672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009258198,0.0006759674,0.98343843,0.0016025183,0.003994585,0.00038621592,0.0000045218476,0.00021284756,0.00042674268],"genre_scores_gemma":[0.7790939,0.00019794046,0.21017963,0.0056069465,0.0028001526,0.00006014614,0.000016366801,0.000113484006,0.0019314311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959455,0.000683588,0.00071508146,0.0010319524,0.00070579106,0.0009180772],"domain_scores_gemma":[0.9951929,0.0011804594,0.00035411937,0.0025258735,0.0004938914,0.00025276426],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007832551,0.00046008543,0.0005478427,0.000079843965,0.0004181362,0.00032039674,0.0035385427,0.00032062395,0.000025617519],"category_scores_gemma":[0.000034269055,0.00031831145,0.0003375112,0.0031262904,0.00029697412,0.00018567879,0.002709859,0.00088515435,0.000030110605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006290396,0.00012753328,0.00008867197,0.0000057509315,0.00006382503,0.0000401573,0.00030045028,0.8892729,0.0001428433,0.0028066777,0.0109961005,0.09614875],"study_design_scores_gemma":[0.00038637928,0.000043242497,0.0016414858,0.00018018422,0.00002545462,0.00022727749,0.000016735135,0.98793924,0.0007194863,0.000022398686,0.008405696,0.0003924224],"about_ca_topic_score_codex":0.000020363274,"about_ca_topic_score_gemma":0.00000676852,"teacher_disagreement_score":0.77325875,"about_ca_system_score_codex":0.00008451431,"about_ca_system_score_gemma":0.00017658465,"threshold_uncertainty_score":0.9999269},"labels":[],"label_agreement":null},{"id":"W3185489179","doi":"10.1016/j.comnet.2021.108337","title":"On the prediction of large-scale road-network constrained trajectories","year":2021,"lang":"en","type":"article","venue":"Computer Networks","topic":"Data Management and Algorithms","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":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Canada Research Chairs","keywords":"Computer science; Trajectory; Cluster analysis; Data mining; Scale (ratio); Train; Hierarchical clustering; Machine learning; Artificial intelligence","score_opus":0.012205791133143457,"score_gpt":0.2113775098579765,"score_spread":0.19917171872483302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185489179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015318737,0.0001782651,0.99180526,0.0006739433,0.0025413868,0.00013896059,0.000013059661,0.00014078595,0.0029764818],"genre_scores_gemma":[0.8829774,0.00014078409,0.10863072,0.0033990894,0.0036744613,0.000033062977,0.0001916213,0.000029901967,0.0009229105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867797,0.00012684452,0.00025743243,0.00036451482,0.00024223744,0.00033098235],"domain_scores_gemma":[0.99878734,0.00020694538,0.00009949648,0.0007679529,0.00008741843,0.00005083368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035964185,0.00014358183,0.00018528552,0.00002849681,0.00017598135,0.00018760224,0.0007655685,0.000059024314,0.000042341195],"category_scores_gemma":[0.000009115597,0.00010819807,0.00009307767,0.0005624769,0.00006639917,0.00025067426,0.0005096271,0.00018546537,0.0000100173365],"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.000012587581,0.00027626855,0.0010526952,0.000024301191,0.00018631753,0.000060679544,0.0006921118,0.110765465,0.0000073680153,0.46947694,0.23440681,0.18303846],"study_design_scores_gemma":[0.00028902307,0.000079509475,0.0038886736,0.00006204181,0.000010801967,0.0000061227142,0.000016433163,0.9806662,0.000039051425,0.002687342,0.012147259,0.00010750516],"about_ca_topic_score_codex":0.0000019233878,"about_ca_topic_score_gemma":0.0000053916715,"teacher_disagreement_score":0.88317454,"about_ca_system_score_codex":0.000012481116,"about_ca_system_score_gemma":0.000029865423,"threshold_uncertainty_score":0.44121894},"labels":[],"label_agreement":null},{"id":"W3206834915","doi":"10.1016/j.comnet.2021.108541","title":"Towards efficient and flexible management and interworking techniques for Industrial Internet of Things","year":2021,"lang":"en","type":"article","venue":"Computer Networks","topic":"Smart Grid Security and Resilience","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 British Columbia","funders":"","keywords":"Computer science; Industrial Internet; Internet of Things; The Internet; Telecommunications; Data science; Engineering management; World Wide Web","score_opus":0.014763273079255398,"score_gpt":0.21436268740764494,"score_spread":0.19959941432838954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206834915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051351372,0.0015217919,0.9453396,0.000026769325,0.00088144524,0.0001713304,6.4624066e-7,0.00012192033,0.0005850863],"genre_scores_gemma":[0.9673376,0.00024701393,0.031880256,0.000074487005,0.00039102678,0.000013443588,0.0000048629986,0.000012909374,0.000038419614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950606,0.00001086371,0.00014594242,0.00014769376,0.000054673732,0.00013477667],"domain_scores_gemma":[0.9997921,0.0000409797,0.000019977455,0.00009114695,0.000020662648,0.000035105695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000110655375,0.00008768122,0.00013854925,0.000042387102,0.000023259874,0.000046543446,0.00007929409,0.000080056154,0.0000024328303],"category_scores_gemma":[0.0000021093938,0.00008471153,0.00002764013,0.00008730957,0.000039137445,0.00003655106,0.00019917227,0.00012063629,1.0625018e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032737873,0.00003966144,0.00051391695,0.00035664084,0.00013269314,0.000026220283,0.0014737226,0.060271308,0.000046991787,0.0039575086,0.008352854,0.92479575],"study_design_scores_gemma":[0.0002557413,0.000045369412,0.00021739336,0.00039301,0.000015488122,0.000016791544,0.000026796703,0.98631394,0.003135739,0.00015086553,0.009319486,0.000109401415],"about_ca_topic_score_codex":0.0000021589908,"about_ca_topic_score_gemma":5.6051294e-7,"teacher_disagreement_score":0.9260426,"about_ca_system_score_codex":0.000012163016,"about_ca_system_score_gemma":0.0000032980322,"threshold_uncertainty_score":0.34544358},"labels":[],"label_agreement":null},{"id":"W3209237170","doi":"10.1016/j.comnet.2021.108567","title":"A survey on sleep mode techniques for ultra-dense networks in 5G and beyond","year":2021,"lang":"en","type":"article","venue":"Computer Networks","topic":"Advanced MIMO Systems Optimization","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 Windsor","funders":"","keywords":"Base station; Sleep mode; Computer science; Energy consumption; Carbon footprint; Sleep (system call); Efficient energy use; Mode (computer interface); Cellular network; Telecommunications; Power consumption; Computer network; Energy (signal processing); Power (physics); Electrical engineering; Human–computer interaction","score_opus":0.009876084007682475,"score_gpt":0.229342415917302,"score_spread":0.21946633190961953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209237170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001469837,0.0013005565,0.99567986,0.000012857358,0.0006015835,0.00035924758,0.000009351865,0.00028518564,0.00028150075],"genre_scores_gemma":[0.95473355,0.0003062479,0.04392262,0.00017690571,0.00051665213,0.00007140306,0.00017370188,0.0000696667,0.00002927183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990511,0.00006649767,0.00026206518,0.00027828975,0.000051603096,0.00029047416],"domain_scores_gemma":[0.9992927,0.00030207718,0.00003389775,0.00024171334,0.00006836314,0.00006125192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001897424,0.00018463655,0.00026096884,0.00006505702,0.00003940537,0.000054445383,0.00008386317,0.00017474387,0.0000017148762],"category_scores_gemma":[0.000013262277,0.00020854437,0.00003473065,0.00023486541,0.000016314676,0.00009650648,0.000023031535,0.00020551041,6.1707135e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013085751,0.000013490168,0.0006104874,0.000020333091,0.000014921028,0.000009706453,0.000048806898,0.9533176,0.000012447655,0.00008945708,0.002649727,0.04319996],"study_design_scores_gemma":[0.00030806966,0.000037591624,0.0015143013,0.00009820876,0.0000045236984,0.000007666034,0.00000289481,0.99724054,0.00016935362,0.00009552844,0.00030968414,0.00021163863],"about_ca_topic_score_codex":0.000010847999,"about_ca_topic_score_gemma":0.00021224807,"teacher_disagreement_score":0.9532637,"about_ca_system_score_codex":0.000059181406,"about_ca_system_score_gemma":0.0000058736928,"threshold_uncertainty_score":0.8504192},"labels":[],"label_agreement":null},{"id":"W4200029245","doi":"10.1016/j.comnet.2021.108676","title":"A blockchain-based Fog-oriented lightweight framework for smart public vehicular transportation systems","year":2021,"lang":"en","type":"article","venue":"Computer Networks","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Seneca Polytechnic","funders":"University of Sharjah","keywords":"Computer science; Cloud computing; Intelligent transportation system; Vehicular ad hoc network; Blockchain; Smart city; Edge computing; Authentication (law); Computer network; Computer security; Distributed computing; Wireless ad hoc network; Telecommunications; Wireless; Internet of Things; Transport engineering; Operating system","score_opus":0.012185732989054135,"score_gpt":0.2244934033120049,"score_spread":0.21230767032295078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200029245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010834989,0.0015752483,0.9804584,0.0043053483,0.0014671,0.00060134183,0.000010058354,0.0007246226,0.00002290904],"genre_scores_gemma":[0.70300657,0.000010803424,0.2950606,0.0009584197,0.00042159873,0.0003994858,0.000095278105,0.000023176239,0.00002408887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782276,0.000100423385,0.00046630006,0.00082633237,0.00023436148,0.0005498093],"domain_scores_gemma":[0.9975739,0.0003564759,0.0001840018,0.0012362996,0.00048517642,0.0001641348],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003366883,0.00026107533,0.0003527274,0.00014037559,0.00037809677,0.00023478454,0.00088148465,0.0004821932,0.0000055143482],"category_scores_gemma":[0.000019488914,0.00026796933,0.00019985877,0.0011800348,0.00007202203,0.00006244225,0.0000820341,0.00041298868,0.0000072175662],"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.0000052363107,0.00022100688,0.00062892115,0.000043593212,0.0000687983,0.000034211884,0.00012894957,0.043470345,0.000009237478,0.93781954,0.0020166398,0.015553497],"study_design_scores_gemma":[0.0004734255,0.00006748341,0.00042870452,0.00007303735,0.000019260908,0.000011746909,0.000007457885,0.93372613,0.00019878804,0.010758816,0.05395019,0.00028493794],"about_ca_topic_score_codex":0.000005359582,"about_ca_topic_score_gemma":0.0000146228185,"teacher_disagreement_score":0.9270607,"about_ca_system_score_codex":0.000053946027,"about_ca_system_score_gemma":0.00013893981,"threshold_uncertainty_score":0.99997723},"labels":[],"label_agreement":null},{"id":"W4200095019","doi":"10.1016/j.comnet.2021.108672","title":"A lightweight federated learning based privacy preserving B5G pandemic response network using unmanned aerial vehicles: A proof-of-concept","year":2021,"lang":"en","type":"article","venue":"Computer Networks","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":45,"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; Lakehead University; Thunder Bay Regional Research Institute","funders":"Alfaisal University","keywords":"Computer science; Asynchronous communication; Proof of concept; Dissemination; Wearable computer; Coronavirus disease 2019 (COVID-19); Pandemic; Artificial intelligence; Deep learning; Machine learning; Distributed computing; Computer network; Embedded system; Telecommunications; Infectious disease (medical specialty)","score_opus":0.03507582837450485,"score_gpt":0.2695242747563507,"score_spread":0.23444844638184587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200095019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123535134,0.0013166653,0.8697661,0.0019331239,0.0016550982,0.00043615798,0.000003778423,0.0013255157,0.00002839746],"genre_scores_gemma":[0.58475643,0.0000175351,0.41389728,0.00034524282,0.00082357624,0.000024231247,0.00004431907,0.00005864637,0.00003274123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99412453,0.0016066585,0.0009957466,0.0014372919,0.0005830544,0.0012527439],"domain_scores_gemma":[0.9910152,0.001530375,0.00060449156,0.0062039434,0.0004443343,0.00020167867],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0014521009,0.0005410747,0.00078544044,0.00020846937,0.00063832954,0.00073955796,0.014616108,0.00054284255,0.000031263],"category_scores_gemma":[0.004294232,0.00056404993,0.00022574842,0.0023127845,0.00020855943,0.0009174319,0.05578202,0.001201035,0.000004000037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004525306,0.00021255268,0.005702253,0.00007891428,0.0001919147,0.00039459905,0.00034591748,0.90036064,0.0009870413,0.00014413596,0.044787876,0.046341643],"study_design_scores_gemma":[0.0012268897,0.0001947186,0.00076383137,0.000714306,0.000027984723,0.0000681372,0.000008971675,0.9829698,0.0060683284,0.0035789434,0.0037858165,0.0005922375],"about_ca_topic_score_codex":0.000019347086,"about_ca_topic_score_gemma":0.0000068928734,"teacher_disagreement_score":0.4612213,"about_ca_system_score_codex":0.00021883813,"about_ca_system_score_gemma":0.0005774798,"threshold_uncertainty_score":0.9996811},"labels":[],"label_agreement":null},{"id":"W4200169175","doi":"10.1016/j.comnet.2021.108666","title":"6Graph: A graph-theoretic approach to address pattern mining for Internet-wide IPv6 scanning","year":2021,"lang":"en","type":"article","venue":"Computer Networks","topic":"Network Security and Intrusion Detection","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":"University of Victoria","funders":"National Key Research and Development Program of China","keywords":"Computer science; IPv6; The Internet; Exploit; Cluster analysis; IPv6 address; Data mining; Graph; Hamming distance; Clustering coefficient; Address space; Theoretical computer science; Artificial intelligence; Computer network; Computer security; Algorithm; World Wide Web","score_opus":0.01881201905651248,"score_gpt":0.23112194388917884,"score_spread":0.21230992483266636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200169175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007897673,0.00057797093,0.98657,0.00033778255,0.002886015,0.00040989704,0.0000016286185,0.00032039732,0.0009986489],"genre_scores_gemma":[0.8193258,0.00003466981,0.17408483,0.004828374,0.0013580337,0.00014839214,0.000028754965,0.000040362087,0.00015075141],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738705,0.0001840668,0.00045302647,0.0009998224,0.00027371588,0.00070231536],"domain_scores_gemma":[0.99823606,0.00036821354,0.00013882971,0.0007515649,0.0002326468,0.00027268697],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047446982,0.00031330858,0.00037381588,0.00021891618,0.00025881786,0.0006211721,0.0011244547,0.00017923297,0.000015065046],"category_scores_gemma":[0.000027639142,0.00032717938,0.0002601163,0.0010872058,0.000060667575,0.00033541015,0.00094824325,0.00032341725,0.000011083592],"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.000048765578,0.00026478822,0.0013108583,0.00011066434,0.00015808425,0.000058354555,0.0039482587,0.1415175,0.000015976426,0.04258739,0.082558155,0.7274212],"study_design_scores_gemma":[0.0004712303,0.00018036901,0.0005044815,0.00023685973,0.00001652749,0.00006954242,0.000026625965,0.982007,0.00022510301,0.0018199441,0.014018912,0.0004233904],"about_ca_topic_score_codex":0.000010545745,"about_ca_topic_score_gemma":0.000013586003,"teacher_disagreement_score":0.8404895,"about_ca_system_score_codex":0.000043268727,"about_ca_system_score_gemma":0.000039049042,"threshold_uncertainty_score":0.99991804},"labels":[],"label_agreement":null},{"id":"W4224302201","doi":"10.1016/j.comnet.2022.108955","title":"Predictive Congestion Control based on Collaborative Information Sharing for Vehicular Ad hoc Networks","year":2022,"lang":"en","type":"article","venue":"Computer Networks","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":26,"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; Wireless ad hoc network; Computer network; Vehicular ad hoc network; Network congestion; Mobile ad hoc network; Control (management); Information sharing; Distributed computing; Telecommunications; World Wide Web; Artificial intelligence; Wireless","score_opus":0.0039004208747442574,"score_gpt":0.1795329988676412,"score_spread":0.17563257799289694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224302201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036062363,0.0019969468,0.9885564,0.00011354204,0.0027165168,0.001926989,0.000096428426,0.00075052143,0.00023640605],"genre_scores_gemma":[0.9922606,0.000092296694,0.0029661434,0.0013982628,0.0010032252,0.0011898332,0.0009895584,0.00008806918,0.000012052478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792546,0.00013831606,0.00049965305,0.00038265606,0.00037149995,0.0006823883],"domain_scores_gemma":[0.99864393,0.0003580963,0.00015879625,0.0004649504,0.00020216862,0.00017207632],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059178646,0.00039483962,0.0004220624,0.00017919875,0.00044952563,0.00018691117,0.00041706619,0.00020048751,0.000038433638],"category_scores_gemma":[0.000014234954,0.0004531607,0.00016284124,0.0005850915,0.00004230148,0.00040229555,0.0001261495,0.00077864405,0.000007645957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031372273,0.000032142376,0.00014050042,0.000028481658,0.00013931001,0.000009062731,0.00013157641,0.9598889,9.799162e-7,0.00015707975,0.016071524,0.023086742],"study_design_scores_gemma":[0.0027552473,0.00063969556,0.00080911577,0.00008510781,0.00007088127,0.0000069945627,0.000026792704,0.9582026,0.0000023759242,0.00004525003,0.036926858,0.00042905807],"about_ca_topic_score_codex":6.549555e-7,"about_ca_topic_score_gemma":0.000003468664,"teacher_disagreement_score":0.9886543,"about_ca_system_score_codex":0.00047656402,"about_ca_system_score_gemma":0.00004522613,"threshold_uncertainty_score":0.99979204},"labels":[],"label_agreement":null},{"id":"W4225114712","doi":"10.1016/j.comnet.2022.109012","title":"Guest Editorial: Recent Advances in Connected and Autonomous Unmanned Aerial/Ground Vehicles","year":2022,"lang":"en","type":"editorial","venue":"Computer Networks","topic":"UAV Applications and Optimization","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":"Thompson Rivers University","funders":"","keywords":"Computer science; Unmanned ground vehicle; Aeronautics; Artificial intelligence","score_opus":0.003907308575485497,"score_gpt":0.20589863999262226,"score_spread":0.20199133141713677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225114712","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000039263283,0.009043829,0.023727108,0.000020915399,0.96620935,0.00036895642,0.00003969112,0.00039426092,0.00015662894],"genre_scores_gemma":[0.000104352024,0.026350116,0.001400762,0.000012594359,0.9701266,0.00017378721,0.0017211384,0.00009162596,0.000019001898],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99850714,0.000063508574,0.00042396493,0.00043184235,0.00025479263,0.00031876442],"domain_scores_gemma":[0.99901557,0.0003844346,0.00010449835,0.0003175142,0.00010175932,0.000076228804],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019908925,0.00032143248,0.00041656528,0.00013182905,0.00011296811,0.00016403357,0.0002777268,0.0005837767,0.00003077129],"category_scores_gemma":[0.000020138894,0.0003752086,0.000037028713,0.00034997845,0.00003672132,0.00017390303,0.00017158837,0.0008271478,0.0000033903414],"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.000010856071,0.0000136083745,0.0000029121404,0.000027930018,0.000013510073,0.0000019490972,0.000035079076,0.38764483,3.0570615e-7,0.000015462723,0.6037328,0.008500724],"study_design_scores_gemma":[0.0004099787,0.00003759052,0.00001231305,0.00003972092,0.000015308187,5.64322e-7,0.000003811857,0.27219215,4.105475e-7,0.000042439096,0.7269707,0.0002750078],"about_ca_topic_score_codex":0.00001949581,"about_ca_topic_score_gemma":0.000067815345,"teacher_disagreement_score":0.123237856,"about_ca_system_score_codex":0.00024843338,"about_ca_system_score_gemma":0.00005116791,"threshold_uncertainty_score":0.99987},"labels":[],"label_agreement":null},{"id":"W4242466174","doi":"10.1016/s1389-1286(04)00154-9","title":"Dynamic spectrum utilization in ad hoc networks☆","year":2004,"lang":"en","type":"article","venue":"Computer Networks","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":1,"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":"University of Waterloo; University of Toronto; University of Vermont; University of Saskatchewan; Connaught Fund; Arizona State University","keywords":"Computer science; Computer network; Network packet; Erasure; Wireless ad hoc network; Software deployment; Scheme (mathematics); Coding (social sciences); Distributed computing; Real-time computing; Wireless; Telecommunications","score_opus":0.026185402855866076,"score_gpt":0.28382230956256194,"score_spread":0.25763690670669587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242466174","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032011624,0.007871451,0.9841204,0.002625979,0.0010171975,0.00044354546,4.2353327e-7,0.00043467205,0.00028516614],"genre_scores_gemma":[0.93026984,0.004563831,0.06402381,0.0006632101,0.00026752317,0.000050044033,0.000041415726,0.000044591918,0.00007575722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968864,0.0003060707,0.00059005007,0.0007879477,0.00044400973,0.0009855545],"domain_scores_gemma":[0.99728787,0.0002354322,0.00016376772,0.0019891874,0.00009903553,0.00022470177],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006648288,0.00032835684,0.00036623603,0.00033837184,0.00022940784,0.0004567357,0.00314109,0.00025110497,0.000015474254],"category_scores_gemma":[0.000010784064,0.0003494796,0.00011557839,0.0022331493,0.00012326166,0.0007155286,0.0016510617,0.00090050657,0.00006297364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000927362,0.00010653192,0.00024317362,0.0000046934524,0.000011339604,0.000031899355,0.00013453956,0.81524485,7.4343353e-7,0.008764966,0.00050790125,0.17494008],"study_design_scores_gemma":[0.0009098723,0.00010287275,0.012337716,0.00013776122,0.0000023656366,0.00002731567,0.0000040092737,0.97899354,0.0000035592902,0.0035468645,0.0035875686,0.0003465692],"about_ca_topic_score_codex":0.000014064649,"about_ca_topic_score_gemma":0.00034861141,"teacher_disagreement_score":0.92706865,"about_ca_system_score_codex":0.00041182665,"about_ca_system_score_gemma":0.00012858142,"threshold_uncertainty_score":0.9998957},"labels":[],"label_agreement":null},{"id":"W4281725275","doi":"10.1016/j.comnet.2022.109086","title":"G-3MRP: A game-theoretical multimedia multimetric map-aware routing protocol for vehicular ad hoc networks","year":2022,"lang":"en","type":"article","venue":"Computer Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":13,"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":"Agencia Estatal de Investigación","keywords":"Computer science; Computer network; Network packet; Routing (electronic design automation); Vehicular ad hoc network; Wireless ad hoc network; Routing protocol; Protocol (science); Resource (disambiguation); Telecommunications; Wireless","score_opus":0.014222453476649148,"score_gpt":0.26176634968466866,"score_spread":0.2475438962080195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281725275","genre_codex":"methods","genre_gemma":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000056842844,0.00046326738,0.91559696,0.0003379659,0.0026152362,0.0799207,0.000008027253,0.00094228535,0.00005870578],"genre_scores_gemma":[0.15256685,0.000017242872,0.33774406,0.003357264,0.0051601776,0.50045633,0.0001613403,0.00029327723,0.00024342521],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930529,0.0007701484,0.0011802923,0.0019832565,0.000965554,0.0020478743],"domain_scores_gemma":[0.9948889,0.0016216689,0.00056093035,0.0020602539,0.00029031432,0.00057795376],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018625455,0.00081315474,0.0008952082,0.0003504139,0.0010074714,0.0006247807,0.003819934,0.00038456992,0.00022925693],"category_scores_gemma":[0.000049186998,0.00083802047,0.00058942544,0.0021667387,0.0002599997,0.00045551013,0.004179204,0.001743853,0.00003317186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000111763606,0.0002581139,0.00015320643,0.000034336263,0.00007546998,0.00009695553,0.00020155717,0.6632138,8.4872255e-7,0.006395322,0.024100455,0.3053582],"study_design_scores_gemma":[0.0032895452,0.000747059,0.00019146375,0.00009665988,0.000029018816,0.00008043825,0.000011613128,0.907642,0.0000047622816,0.0008271391,0.08619507,0.00088521844],"about_ca_topic_score_codex":0.000003584266,"about_ca_topic_score_gemma":0.0000023981618,"teacher_disagreement_score":0.5778529,"about_ca_system_score_codex":0.0003828646,"about_ca_system_score_gemma":0.00015229739,"threshold_uncertainty_score":0.99940705},"labels":[],"label_agreement":null},{"id":"W4294724150","doi":"10.1016/j.comnet.2022.109359","title":"Self-healing and optimal fault tolerant routing in wireless sensor networks using genetical swarm optimization","year":2022,"lang":"en","type":"article","venue":"Computer Networks","topic":"Energy Efficient Wireless Sensor Networks","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Swarm behaviour; Wireless sensor network; Wireless; Fault tolerance; Routing (electronic design automation); Fault (geology); Multipath routing; Computer network; Genetic algorithm; Distributed computing; Dynamic Source Routing; Routing protocol; Artificial intelligence; Telecommunications; Machine learning; Biology","score_opus":0.011585290675501878,"score_gpt":0.22103110426408834,"score_spread":0.20944581358858647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294724150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17173603,0.00047612854,0.82537043,0.00013836258,0.00151688,0.00033291162,9.264419e-7,0.00038858986,0.0000397459],"genre_scores_gemma":[0.5999276,0.00006324686,0.398906,0.00040478166,0.0006141417,0.000014041204,0.00001515025,0.000048317586,0.0000067274727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955604,0.00065270794,0.0008181349,0.001237771,0.00054384716,0.0011871583],"domain_scores_gemma":[0.99827623,0.00037117724,0.0002833757,0.0007025625,0.00010392245,0.0002627471],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008959267,0.00046898905,0.0005623033,0.00027018643,0.00077265606,0.00043719844,0.0010104706,0.00022785793,0.000008666444],"category_scores_gemma":[0.00000570201,0.000544059,0.00011462095,0.0013286904,0.00008059782,0.00029928534,0.0021128277,0.0010879247,8.1239085e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001966774,0.00012999495,0.0010002641,0.000010592039,0.000027222686,0.00014746265,0.00049809064,0.9873675,0.0000047803956,0.0019529884,0.000046250985,0.008795198],"study_design_scores_gemma":[0.0008289118,0.00009359957,0.00018025853,0.00007311283,0.00001789212,0.00020994768,0.00004484258,0.9978253,0.000009281865,0.0000058973437,0.00011742254,0.0005934799],"about_ca_topic_score_codex":0.000039985534,"about_ca_topic_score_gemma":0.00000618134,"teacher_disagreement_score":0.42819157,"about_ca_system_score_codex":0.00030316605,"about_ca_system_score_gemma":0.00006810224,"threshold_uncertainty_score":0.9997011},"labels":[],"label_agreement":null},{"id":"W4294842700","doi":"10.1016/j.comnet.2022.109339","title":"Intelligent Horizontal Autoscaling in Edge Computing using a Double Tower Neural Network","year":2022,"lang":"en","type":"article","venue":"Computer Networks","topic":"IoT and Edge/Fog Computing","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Tower; Artificial neural network; Enhanced Data Rates for GSM Evolution; Edge computing; Artificial intelligence; Real-time computing; Structural engineering","score_opus":0.031614162385587403,"score_gpt":0.25827745599307755,"score_spread":0.22666329360749016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294842700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15470377,0.00084804813,0.80718887,0.00012260108,0.036089007,0.000342269,1.3623026e-7,0.00040435584,0.00030096434],"genre_scores_gemma":[0.9095716,0.0000045667516,0.07725324,0.0009890484,0.0120731145,0.000013045232,0.000013170843,0.000052787575,0.000029469871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958549,0.00030990975,0.00084071496,0.0010336244,0.00049421325,0.0014666129],"domain_scores_gemma":[0.99845725,0.00024241311,0.00027640775,0.0007495333,0.00006604416,0.00020836582],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012865736,0.00043518693,0.00053065224,0.0002687038,0.0010798818,0.00050485774,0.0019884636,0.00011496671,0.000013659005],"category_scores_gemma":[0.000003881283,0.00049563247,0.00023005795,0.0017896553,0.000054032647,0.00040341634,0.005111205,0.0012479641,0.0000070814535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025332169,0.00008850874,0.0032903152,0.000006866423,0.00002083065,0.00016006528,0.000987136,0.8976516,0.0000055080495,0.0007564435,0.005266163,0.0917412],"study_design_scores_gemma":[0.0007389322,0.00015360536,0.00078190037,0.0000713372,0.000007819991,0.00019660786,0.000019461193,0.9892594,0.00000888386,0.00029213948,0.007917267,0.00055263034],"about_ca_topic_score_codex":0.00011338673,"about_ca_topic_score_gemma":0.00000558682,"teacher_disagreement_score":0.7548678,"about_ca_system_score_codex":0.0004428418,"about_ca_system_score_gemma":0.00011076849,"threshold_uncertainty_score":0.99974954},"labels":[],"label_agreement":null},{"id":"W4313531834","doi":"10.1016/j.comnet.2022.109553","title":"Distributed denial of service attack prediction: Challenges, open issues and opportunities","year":2023,"lang":"en","type":"article","venue":"Computer Networks","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":115,"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":"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":"Denial-of-service attack; Computer science; Application layer DDoS attack; Computer security; Trinoo; Cyber-attack; State (computer science); Service (business); The Internet; World Wide Web; Business","score_opus":0.09810496895091683,"score_gpt":0.28576060608195636,"score_spread":0.18765563713103953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313531834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023582125,0.0057950346,0.94568163,0.017999329,0.004221581,0.0006499195,0.00003448476,0.001044656,0.0009912213],"genre_scores_gemma":[0.9322729,0.035152014,0.02104343,0.0038099238,0.0064104497,0.00012658979,0.00039145438,0.00007719263,0.0007160626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998716,0.00012930467,0.0003031578,0.00038739422,0.00019511831,0.00026903732],"domain_scores_gemma":[0.9990469,0.000108400905,0.000118336946,0.00046438855,0.00014612677,0.00011581456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041406724,0.00015388393,0.00025433704,0.00008948026,0.00018648262,0.00024225611,0.0009711563,0.00012799511,0.000013831138],"category_scores_gemma":[0.0000032631704,0.00015374299,0.000037677797,0.0005184588,0.000054005868,0.00065891613,0.0018909209,0.0001691641,0.000012448613],"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.000059692484,0.000104965126,0.00018004316,0.00014206234,0.00012006486,0.00006712287,0.0019777354,0.048922803,0.000006410519,0.049230583,0.17089857,0.72828996],"study_design_scores_gemma":[0.00031494943,0.00015772769,0.003637659,0.00009622712,0.000006802458,0.000028567692,0.000022210097,0.88818914,0.000013514357,0.001275514,0.10611758,0.0001401384],"about_ca_topic_score_codex":0.000035609,"about_ca_topic_score_gemma":0.00004839669,"teacher_disagreement_score":0.9246382,"about_ca_system_score_codex":0.000014277282,"about_ca_system_score_gemma":0.000026152991,"threshold_uncertainty_score":0.6269457},"labels":[],"label_agreement":null},{"id":"W4321487091","doi":"10.1016/j.comnet.2023.109648","title":"Deep learning for encrypted traffic classification in the face of data drift: An empirical study","year":2023,"lang":"en","type":"article","venue":"Computer Networks","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":47,"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; Encryption; Traffic classification; Granularity; Artificial intelligence; Data mining; Machine learning; Deep learning; Quality of service; Computer network","score_opus":0.08433534082062956,"score_gpt":0.338235020470347,"score_spread":0.25389967964971744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321487091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21623023,0.000039357277,0.7829089,0.00019361294,0.00018989331,0.00030894007,3.6080314e-7,0.00012010136,0.000008568349],"genre_scores_gemma":[0.99321276,0.000006028059,0.006233782,0.00011485562,0.00028027926,0.00002095654,0.00011021593,0.000010647405,0.000010465234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979066,0.00045658922,0.000449009,0.00060541794,0.00026983,0.00031254077],"domain_scores_gemma":[0.9984748,0.0005437838,0.00015766617,0.0007105513,0.00007071622,0.000042508884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018914023,0.00014260695,0.00025074012,0.00014323625,0.00013444596,0.0001883903,0.002625177,0.0000784242,0.0000016804013],"category_scores_gemma":[0.00002472069,0.000107235515,0.00006969444,0.0010848604,0.00003113699,0.0003584603,0.0004092285,0.00031189088,0.000005676212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052883115,0.00017494407,0.001186805,0.000004372003,0.000025345053,0.000005627318,0.009449884,0.8471434,4.8456377e-7,0.0013203507,0.0009222035,0.1397613],"study_design_scores_gemma":[0.00030170684,0.0002477232,0.021484436,0.000013972894,0.000015393252,0.0000021046549,0.001205163,0.9761495,1.2122302e-7,0.000005939664,0.00045838236,0.00011557718],"about_ca_topic_score_codex":0.0000031986526,"about_ca_topic_score_gemma":0.00011182158,"teacher_disagreement_score":0.77698255,"about_ca_system_score_codex":0.000014933609,"about_ca_system_score_gemma":0.00002015442,"threshold_uncertainty_score":0.48782754},"labels":[],"label_agreement":null},{"id":"W4362696452","doi":"10.1016/j.comnet.2023.109760","title":"Deep reinforcement learning for next-generation IoT networks","year":2023,"lang":"en","type":"article","venue":"Computer Networks","topic":"Privacy-Preserving Technologies in Data","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":"St. Francis Xavier University; École de Technologie Supérieure","funders":"","keywords":"Computer science; Upload; Homomorphic encryption; Protocol (science); Computer security; Reinforcement learning; Information privacy; Edge device; Artificial intelligence; Distributed computing; Encryption; Cloud computing","score_opus":0.06494033577398167,"score_gpt":0.27452910674072173,"score_spread":0.20958877096674006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362696452","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043130163,0.00031816622,0.9890154,0.004232061,0.0025587606,0.00047304423,1.9134697e-7,0.0028934884,0.000077568446],"genre_scores_gemma":[0.44747737,0.00036672284,0.54686105,0.00136165,0.0030715293,0.00023539994,0.00035742304,0.00006114508,0.0002076724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761295,0.00008648596,0.00042650985,0.00077681185,0.00026854413,0.0008287127],"domain_scores_gemma":[0.9952065,0.0003616899,0.00018116068,0.0040338617,0.00011321936,0.000103590864],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00072858133,0.00027076728,0.00026416508,0.00020284165,0.00045422738,0.0006100822,0.012366484,0.00025881524,0.000007499132],"category_scores_gemma":[0.000716271,0.00027878687,0.000118622265,0.0010889145,0.000057442954,0.00051632454,0.03370493,0.0004645021,0.000048368045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024637677,0.000005862575,0.000060642316,0.0000053950903,0.000018515811,0.0000055494957,0.000019844894,0.6288465,0.000008925414,0.0014476348,0.23490267,0.13467598],"study_design_scores_gemma":[0.00032865143,0.00014560984,0.00013681254,0.000034332814,0.0000070108076,0.0000060551215,0.0000037068771,0.98200047,0.000033440083,0.0046936367,0.012299616,0.0003106535],"about_ca_topic_score_codex":0.0000049315927,"about_ca_topic_score_gemma":0.000005242604,"teacher_disagreement_score":0.44704607,"about_ca_system_score_codex":0.00009335239,"about_ca_system_score_gemma":0.00002699038,"threshold_uncertainty_score":0.99996644},"labels":[],"label_agreement":null},{"id":"W4379883149","doi":"10.1016/j.comnet.2023.109863","title":"Congestion-aware delay-guaranteed scheduling and routing with renewal optimization","year":2023,"lang":"en","type":"article","venue":"Computer Networks","topic":"Age of Information Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada; University of Victoria","keywords":"Computer science; Queuing delay; Goodput; Computer network; Network congestion; Network delay; Network packet; Distributed computing; Queue; Scheduling (production processes); End-to-end delay; Mathematical optimization; Throughput; Wireless","score_opus":0.008632974006670659,"score_gpt":0.20337254341311012,"score_spread":0.19473956940643947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379883149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033886244,0.00003322747,0.9946833,0.00032118155,0.00036873037,0.0001826595,5.262249e-7,0.000798043,0.00022366049],"genre_scores_gemma":[0.503395,0.000040380397,0.49584112,0.00039799698,0.00021706228,0.000010488372,0.000050647275,0.00001612777,0.000031174346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988783,0.000047045032,0.00027678482,0.00030775197,0.00020305929,0.0002870575],"domain_scores_gemma":[0.9991864,0.00011193737,0.00015967934,0.0002916673,0.00016452669,0.00008579226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027986296,0.00016106,0.00014811162,0.00015932485,0.00028193204,0.0004294175,0.00033134606,0.00009362605,0.0000040853097],"category_scores_gemma":[0.000011594777,0.00014904627,0.000023084574,0.0008535521,0.00004128837,0.000880056,0.00027880757,0.00014297296,0.000013840245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054409043,0.0000042296087,0.00057812076,0.0000061725864,0.0000118179605,0.0000109887515,0.0003691917,0.9825511,2.138636e-7,0.0027097962,0.00022811211,0.013524837],"study_design_scores_gemma":[0.0004282517,0.000057052075,0.00048321797,0.000099673016,0.0000053182594,0.000058311598,0.000023884682,0.99855113,0.0000029174773,0.000054657074,0.000043478485,0.00019210388],"about_ca_topic_score_codex":0.0000044539593,"about_ca_topic_score_gemma":0.0000019072227,"teacher_disagreement_score":0.5000064,"about_ca_system_score_codex":0.00002953857,"about_ca_system_score_gemma":0.00003669733,"threshold_uncertainty_score":0.60779303},"labels":[],"label_agreement":null},{"id":"W4384927200","doi":"10.1016/j.comnet.2023.109937","title":"Optimal radio resource management in 5G NR featuring network slicing","year":2023,"lang":"en","type":"article","venue":"Computer Networks","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":22,"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 à Trois-Rivières","funders":"","keywords":"Computer science; Slicing; Radio access network; Scheduling (production processes); Computer network; Leverage (statistics); Throughput; Distributed computing; Latency (audio); Mathematical optimization; Wireless; Base station; Telecommunications","score_opus":0.012785287946105608,"score_gpt":0.22045911138658025,"score_spread":0.20767382344047464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384927200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011207314,0.0010458163,0.98098505,0.0005231228,0.0023446248,0.0004015189,3.373815e-7,0.0015481405,0.0019440782],"genre_scores_gemma":[0.6296015,0.0008192353,0.35590383,0.0031758016,0.008589058,0.00016297313,0.00006690052,0.00017400936,0.0015067363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99659616,0.00016092231,0.0005076521,0.00096987,0.0003843711,0.001381011],"domain_scores_gemma":[0.9981926,0.0003632419,0.00012869766,0.0010757904,0.000037231104,0.00020241328],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009074522,0.00037826612,0.00042651032,0.0003076118,0.00029305287,0.0004360553,0.0016602301,0.00018598112,0.000006428772],"category_scores_gemma":[0.000005281404,0.00039067864,0.00013948012,0.003437667,0.00004442366,0.0003211345,0.001455127,0.00058704935,0.00009802463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009687976,0.000018228136,0.0020748302,0.00001195873,0.0000355668,0.0002693643,0.00017654983,0.77220803,1.2155068e-7,0.0039008942,0.076630905,0.14466384],"study_design_scores_gemma":[0.00062968273,0.00005355949,0.036926113,0.00023874444,0.000008938594,0.0000296931,0.000010906113,0.9321953,0.000001129535,0.0004074413,0.029078472,0.0004200297],"about_ca_topic_score_codex":0.000016854592,"about_ca_topic_score_gemma":0.000010127296,"teacher_disagreement_score":0.62508124,"about_ca_system_score_codex":0.000108351385,"about_ca_system_score_gemma":0.000019015431,"threshold_uncertainty_score":0.9998545},"labels":[],"label_agreement":null},{"id":"W4384938185","doi":"10.1016/j.comnet.2023.109938","title":"How to cope with malicious federated learning clients: An unsupervised learning-based approach","year":2023,"lang":"en","type":"article","venue":"Computer Networks","topic":"Privacy-Preserving Technologies in Data","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 Ottawa","funders":"","keywords":"Computer science; Federated learning; The Internet; Computer security; Edge device; Server; Artificial intelligence; Computer network; World Wide Web; Cloud computing; Operating system","score_opus":0.026848411178421246,"score_gpt":0.24478634274298444,"score_spread":0.2179379315645632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384938185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023634769,0.00005086757,0.96235245,0.0060126944,0.0004499133,0.00048838183,0.0000018586676,0.006862807,0.00014623674],"genre_scores_gemma":[0.637096,0.000012083997,0.36112916,0.0009227424,0.00025706465,0.00008263533,0.00024107809,0.00007141145,0.00018783845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99623597,0.00041800726,0.00030040086,0.0014216475,0.00054497086,0.0010790144],"domain_scores_gemma":[0.994561,0.00022731062,0.00015378107,0.0045521534,0.00020931572,0.00029641695],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00071877305,0.00044064573,0.00043010697,0.0003968512,0.00064366375,0.0018933724,0.01576205,0.00026996204,0.0000041585176],"category_scores_gemma":[0.000784888,0.00039713425,0.000067668334,0.0031220664,0.0001101909,0.000817445,0.026284467,0.00110177,0.00007138761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003345205,0.00009173064,0.003012143,0.000021056954,0.00004147728,0.00010503716,0.00011093502,0.8644997,0.000015662543,0.00016187913,0.06104276,0.07086416],"study_design_scores_gemma":[0.0007426434,0.0008024038,0.0014478649,0.00008007933,0.000007771885,0.000018409077,0.000043177624,0.9871544,0.000050608804,0.00023743245,0.00887276,0.000542441],"about_ca_topic_score_codex":0.000019750936,"about_ca_topic_score_gemma":0.000009250156,"teacher_disagreement_score":0.6134612,"about_ca_system_score_codex":0.000097361284,"about_ca_system_score_gemma":0.00007680588,"threshold_uncertainty_score":0.99984807},"labels":[],"label_agreement":null},{"id":"W4384938588","doi":"10.1016/j.comnet.2023.109939","title":"DESLR: Energy-efficient and secure layered routing based on channel-aware trust model for UASNs","year":2023,"lang":"en","type":"article","venue":"Computer Networks","topic":"Underwater Vehicles and Communication Systems","field":"Engineering","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 Ottawa","funders":"","keywords":"Computer science; Energy consumption; Computer network; Network packet; Transmission (telecommunications); Routing protocol; Routing (electronic design automation); Distributed computing; Reliability (semiconductor); Telecommunications","score_opus":0.02250660040501383,"score_gpt":0.21051083676775567,"score_spread":0.18800423636274183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384938588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076037277,0.0001179012,0.99119306,0.00009974242,0.00020049991,0.00016202219,0.000010286425,0.00055158336,0.00006118492],"genre_scores_gemma":[0.9973454,0.000026490412,0.0018397506,0.00021557191,0.00031043607,0.00007248328,0.00006881076,0.00004782253,0.0000732531],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919516,0.000026195023,0.00019593727,0.00019497778,0.000090520545,0.0002972303],"domain_scores_gemma":[0.99946386,0.00009647958,0.000030267294,0.00029804808,0.00003400098,0.00007732035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014987323,0.00015820078,0.00016827637,0.00007683536,0.00014480554,0.00008829514,0.00019944675,0.000101379075,0.000001098862],"category_scores_gemma":[4.0964005e-7,0.00015424819,0.000061509374,0.00017731491,0.000012205088,0.000026646723,0.00008573595,0.000111987974,0.0000034457375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005411399,0.000010229106,0.0000149290645,0.000025461657,0.000015415499,9.115514e-7,0.0002144231,0.99115884,0.000008311639,0.00020666145,0.0017773476,0.0065620732],"study_design_scores_gemma":[0.00039460382,0.000024734709,0.000046442026,0.00009251515,0.000005678044,0.0000012679885,0.000016452248,0.9967493,0.000032621007,0.00006783665,0.002393413,0.00017513763],"about_ca_topic_score_codex":0.0000023483365,"about_ca_topic_score_gemma":0.0000035425974,"teacher_disagreement_score":0.9897417,"about_ca_system_score_codex":0.00003393037,"about_ca_system_score_gemma":0.0000071053596,"threshold_uncertainty_score":0.62900585},"labels":[],"label_agreement":null},{"id":"W4385583293","doi":"10.1016/j.comnet.2023.109956","title":"Exploring the potential, limitations, and future directions of wireless technologies in smart grid networks: A comparative analysis","year":2023,"lang":"en","type":"article","venue":"Computer Networks","topic":"Smart Grid Security and Resilience","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 New Brunswick","funders":"","keywords":"Smart grid; Computer science; Smart meter; Grid; Network packet; Wireless; Electricity; Telecommunications; Computer network; Electrical engineering","score_opus":0.035891847079305296,"score_gpt":0.2238176784431304,"score_spread":0.18792583136382512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385583293","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8685762,0.0067900205,0.12039941,0.0003732136,0.0027785727,0.00022325935,0.000003901934,0.000787996,0.00006740603],"genre_scores_gemma":[0.9771543,0.021980258,0.00030991124,0.0000079335505,0.0004689816,0.000052964107,0.000015969707,0.000007215169,0.0000024691792],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992892,0.000045057965,0.00020831476,0.00016171734,0.000082718136,0.0002129482],"domain_scores_gemma":[0.99949425,0.00022207816,0.000031757492,0.00020173454,0.000028261955,0.00002192783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013426547,0.00011904392,0.0002415473,0.00028838892,0.00012560334,0.000040263407,0.00017734291,0.00006913625,7.513199e-7],"category_scores_gemma":[0.0000023462676,0.00009397031,0.00006921293,0.0026125514,0.00010854971,0.00013610948,0.00010145988,0.00028421183,0.0000013047833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000272868,0.000008934566,0.0020011722,0.00000907869,0.0001436279,0.0000044262983,0.0009335079,0.9589151,0.0000025998902,0.0001727333,0.0009203307,0.036885723],"study_design_scores_gemma":[0.000071258175,0.00001179789,0.086412914,0.00003175679,0.000048781792,0.000001973026,0.0011753525,0.90972465,0.0000093075005,0.000027091404,0.0023905993,0.00009450516],"about_ca_topic_score_codex":0.000010457816,"about_ca_topic_score_gemma":0.00022225433,"teacher_disagreement_score":0.1200895,"about_ca_system_score_codex":0.000013870287,"about_ca_system_score_gemma":0.0000035875887,"threshold_uncertainty_score":0.38319978},"labels":[],"label_agreement":null},{"id":"W4385583369","doi":"10.1016/j.comnet.2023.109963","title":"A Novel Ant Colony-inspired Coverage Path Planning for Internet of Drones","year":2023,"lang":"en","type":"article","venue":"Computer Networks","topic":"Robotic Path Planning Algorithms","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 Ottawa","funders":"","keywords":"Drone; Computer science; Context (archaeology); Ant colony optimization algorithms; The Internet; Ant colony; Path (computing); Motion planning; Energy consumption; Cover (algebra); Robot; Distributed computing; Artificial intelligence; Computer network; World Wide Web","score_opus":0.0352631949391018,"score_gpt":0.2689008076533971,"score_spread":0.23363761271429528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385583369","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069209207,0.00013436898,0.98939604,0.00012558854,0.0024730961,0.00034585185,0.000009050382,0.00051559415,0.00007946997],"genre_scores_gemma":[0.47323096,0.000010702737,0.52527744,0.00039922126,0.00070618856,0.00005839011,0.000064795466,0.0000363135,0.00021597724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982217,0.000044189488,0.00042561904,0.000527743,0.00024093625,0.00053980923],"domain_scores_gemma":[0.9985585,0.0005490488,0.00016573978,0.00051358255,0.0001010721,0.00011203272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004667026,0.00022460936,0.00039187897,0.00016815141,0.00008885418,0.00012571819,0.0011257604,0.00012877086,0.0000011180691],"category_scores_gemma":[0.000025411828,0.00022111928,0.0001253872,0.0006180222,0.000050944815,0.00021310187,0.000622692,0.00017248948,0.000013386146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026604326,0.00009381779,0.0019295686,0.000060991508,0.000086770015,0.0000967489,0.0015552505,0.8990596,0.00014410772,0.004559021,0.048274826,0.044112686],"study_design_scores_gemma":[0.00078058307,0.00028211734,0.006475053,0.00024501153,0.000008570944,0.00002998818,0.0000047042986,0.9898276,0.000065153894,0.00029925027,0.0017428072,0.00023917948],"about_ca_topic_score_codex":0.000017798531,"about_ca_topic_score_gemma":3.283671e-7,"teacher_disagreement_score":0.46631005,"about_ca_system_score_codex":0.000037296744,"about_ca_system_score_gemma":0.00005143216,"threshold_uncertainty_score":0.90169823},"labels":[],"label_agreement":null},{"id":"W4385614768","doi":"10.1016/j.comnet.2023.109966","title":"SoftCaching: A framework for caching node selection and routing in Software-Defined Information Centric Internet of Things","year":2023,"lang":"en","type":"article","venue":"Computer Networks","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":12,"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é de Montréal","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science; Computer network; Cache; Node (physics); Software-defined networking; The Internet; Provisioning; Routing (electronic design automation); Distributed computing","score_opus":0.012629286823528148,"score_gpt":0.22367562899437776,"score_spread":0.2110463421708496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385614768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076992095,0.000059106853,0.92154706,0.00015183649,0.00068385823,0.00020052053,5.9765136e-7,0.00035371337,0.000011230993],"genre_scores_gemma":[0.8879602,0.000016605538,0.111421615,0.0004279737,0.00012629555,0.000013738511,0.000015567672,0.000009814226,0.000008210259],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998759,0.00006781066,0.00040907288,0.00026604164,0.0001537782,0.00034434945],"domain_scores_gemma":[0.99882007,0.00066331826,0.00020179039,0.00018981709,0.00007071445,0.000054294116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006809763,0.00015006437,0.00022757401,0.00034458502,0.00011033652,0.00023886816,0.00037612475,0.0001266757,4.453718e-7],"category_scores_gemma":[0.00014137625,0.00015464997,0.000072571005,0.0007425607,0.000013943636,0.0010140026,0.00037324525,0.00034777683,0.0000030398678],"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.000053943764,0.00004480492,0.02794826,0.00012989974,0.000048458704,0.000006108091,0.006638135,0.37210503,0.000015060856,0.04502273,0.0010948912,0.54689264],"study_design_scores_gemma":[0.00038568454,0.00006250645,0.0045782775,0.00024353665,0.0000056419976,0.000012420114,0.000015681248,0.9915922,0.000007584661,0.002855064,0.00008916725,0.0001522174],"about_ca_topic_score_codex":0.00016744416,"about_ca_topic_score_gemma":0.0000055127684,"teacher_disagreement_score":0.8109681,"about_ca_system_score_codex":0.000052391024,"about_ca_system_score_gemma":0.000025042136,"threshold_uncertainty_score":0.63064426},"labels":[],"label_agreement":null},{"id":"W4386584698","doi":"10.1016/j.comnet.2023.110005","title":"SIDS: A federated learning approach for intrusion detection in IoT using Social Internet of Things","year":2023,"lang":"en","type":"article","venue":"Computer Networks","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":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Intrusion detection system; Exploit; Server; Internet of Things; Process (computing); The Internet; Computer security; Machine learning; Federated learning; Artificial intelligence; Collaborative learning; World Wide Web; Knowledge management","score_opus":0.025185980045027288,"score_gpt":0.24907093883059706,"score_spread":0.22388495878556977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386584698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16534694,0.000036777463,0.8331717,0.000029584326,0.000816577,0.00026509637,1.3804345e-7,0.0002812318,0.000051955292],"genre_scores_gemma":[0.9641739,0.000012065921,0.035033204,0.00009992879,0.0006013983,0.000021362372,0.000012565747,0.000019151083,0.000026405007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983735,0.00019123648,0.0004166011,0.0004515217,0.00018596191,0.0003811411],"domain_scores_gemma":[0.99936545,0.0001299971,0.00021065066,0.00014149708,0.00010734406,0.00004504494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000726069,0.00017139467,0.00028459576,0.00031555333,0.00028043098,0.00017378891,0.00038531233,0.00022411402,0.0000026022576],"category_scores_gemma":[0.000018072396,0.00018103948,0.00011194069,0.0014303701,0.000039457947,0.00033729628,0.00046586804,0.0004298456,0.0000024617812],"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.00007095523,0.000056247405,0.000085037806,0.000049699138,0.00002098439,0.0000045434363,0.0022467922,0.46998233,0.00072116475,0.0007214339,0.0004071006,0.5256337],"study_design_scores_gemma":[0.0004899314,0.0001768429,0.00029870763,0.000063541,0.000004896205,0.000012490959,0.000024580224,0.997112,0.0007265364,0.00051791145,0.0003909689,0.00018160717],"about_ca_topic_score_codex":0.000073312054,"about_ca_topic_score_gemma":0.000009705662,"teacher_disagreement_score":0.798827,"about_ca_system_score_codex":0.00008549222,"about_ca_system_score_gemma":0.000022545464,"threshold_uncertainty_score":0.7382575},"labels":[],"label_agreement":null},{"id":"W4387399999","doi":"10.1016/j.comnet.2023.110054","title":"A survey on network simulators, emulators, and testbeds used for research and education","year":2023,"lang":"en","type":"article","venue":"Computer Networks","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":65,"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 Naval Research; U.S. Department of Energy; National Science Foundation","keywords":"Computer science; Scalability; Troubleshooting; Implementation; Scale (ratio); Data science; Software engineering; Operating system","score_opus":0.08270804077577822,"score_gpt":0.35106977501435555,"score_spread":0.26836173423857734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387399999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.133667,0.0026372822,0.85762477,0.0006764093,0.0034151056,0.0011256885,0.000007646468,0.00079405634,0.000052016818],"genre_scores_gemma":[0.98090947,0.00020471905,0.014764719,0.0007693192,0.002814939,0.000094911535,0.00010915567,0.000055084278,0.0002776961],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973961,0.00027470858,0.00030729984,0.0008432364,0.0003200757,0.0008585667],"domain_scores_gemma":[0.99433887,0.004358161,0.000079866484,0.0006952542,0.000251845,0.00027600996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022851168,0.0002513334,0.00031367852,0.00018960217,0.0005472184,0.00055718294,0.00057344127,0.00020587862,0.0000013643512],"category_scores_gemma":[0.00007598924,0.00023872158,0.00004848848,0.0017562492,0.00011094945,0.00021389182,0.00065029145,0.00036819675,0.000012353433],"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.00003964883,0.00010744767,0.09876434,0.000028762248,0.000042094587,0.0000058422816,0.00021785521,0.1592332,4.856583e-7,0.020057557,0.44060633,0.28089643],"study_design_scores_gemma":[0.0003937678,0.00037231375,0.1677998,0.00010151538,0.0000033877686,0.0000031969369,0.0000021662192,0.81303555,8.1006164e-7,0.007949982,0.010103104,0.00023439323],"about_ca_topic_score_codex":0.00003899846,"about_ca_topic_score_gemma":0.00003216433,"teacher_disagreement_score":0.8472425,"about_ca_system_score_codex":0.000039074628,"about_ca_system_score_gemma":0.000121583624,"threshold_uncertainty_score":0.9734784},"labels":[],"label_agreement":null},{"id":"W4388383276","doi":"10.1016/j.comnet.2023.110088","title":"Multi-resource predictive workload consolidation approach in virtualized environments","year":2023,"lang":"en","type":"article","venue":"Computer Networks","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cloud computing; Workload; Service-level agreement; Virtualization; Server; Energy consumption; Service provider; Distributed computing; Host (biology); Service level; Data center; Consolidation (business); Computer network; Operating system; Service (business)","score_opus":0.017839238175518114,"score_gpt":0.22830548357156658,"score_spread":0.21046624539604847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388383276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024159499,0.00016715858,0.9731834,0.00019078537,0.0005280809,0.0004131798,6.0120095e-7,0.0005813418,0.0007759731],"genre_scores_gemma":[0.93535554,0.000037366925,0.06219132,0.00076353253,0.000553748,0.000079129895,0.00003391241,0.00003559663,0.00094984955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997609,0.000275299,0.000394884,0.00078951387,0.00033863273,0.00059262244],"domain_scores_gemma":[0.99883336,0.00018259103,0.00013137801,0.0007180392,0.000011693895,0.00012292067],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064882706,0.00025295553,0.0002802492,0.00029336382,0.00016533116,0.0001883814,0.0011126621,0.00013115008,0.0000025963107],"category_scores_gemma":[0.0000072187067,0.0002485098,0.00009521065,0.0011753009,0.00007077525,0.000053124037,0.0014733942,0.0003279066,0.00010379907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009002748,0.00013160342,0.0010201901,0.0000064496776,0.000030449211,0.00002926684,0.00081168715,0.90504956,0.000003460573,0.00034207548,0.0032831614,0.08928309],"study_design_scores_gemma":[0.0010899825,0.000053531123,0.022582408,0.00007574233,0.0000055535616,0.000005087161,0.000042862433,0.969859,0.000003295816,0.0000640792,0.005967567,0.0002508981],"about_ca_topic_score_codex":0.0000074702657,"about_ca_topic_score_gemma":8.8575797e-7,"teacher_disagreement_score":0.91119605,"about_ca_system_score_codex":0.00009157882,"about_ca_system_score_gemma":0.000012029937,"threshold_uncertainty_score":0.9999967},"labels":[],"label_agreement":null},{"id":"W4388485385","doi":"10.1016/j.comnet.2023.110095","title":"Privacy-aware load balancing in fog networks: A reinforcement learning approach","year":2023,"lang":"en","type":"article","venue":"Computer Networks","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":13,"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; Workload; Distributed computing; Load balancing (electrical power); Software deployment; Adaptation (eye); Real-time computing; Computer network; Artificial intelligence; Grid","score_opus":0.016204994064070926,"score_gpt":0.22805538886100774,"score_spread":0.21185039479693682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388485385","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052169,0.00028445624,0.9826432,0.00015721803,0.008751718,0.00034362962,1.9232381e-8,0.0011761019,0.0014267475],"genre_scores_gemma":[0.9602225,0.000096744465,0.029206328,0.00071733777,0.009082165,0.000051451854,0.000046982164,0.00006389151,0.000512593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99642456,0.00019445657,0.0006455145,0.0009126733,0.0004850003,0.0013378208],"domain_scores_gemma":[0.9984243,0.00026074014,0.00019825256,0.0008157319,0.00010586989,0.00019511234],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013202028,0.00038812996,0.00045934162,0.0002952037,0.00036042472,0.00048329684,0.001664887,0.00021062719,0.0000021113062],"category_scores_gemma":[0.00002303102,0.00039792736,0.00015549158,0.0022853126,0.000040095205,0.00046630154,0.0024858592,0.00091156934,0.000078028446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005368033,0.000022705277,0.0032338265,0.000023194856,0.00001872828,0.00006636813,0.0010994741,0.889814,7.1094973e-7,0.0002625415,0.02026452,0.085188575],"study_design_scores_gemma":[0.0005876081,0.000080278594,0.003943986,0.00019194542,0.0000044277404,0.000023313338,0.000012912491,0.9847597,0.0000017043628,0.00013071377,0.0098146675,0.00044873494],"about_ca_topic_score_codex":0.000032092354,"about_ca_topic_score_gemma":0.0000017567486,"teacher_disagreement_score":0.9550056,"about_ca_system_score_codex":0.00024966281,"about_ca_system_score_gemma":0.00010256197,"threshold_uncertainty_score":0.99984723},"labels":[],"label_agreement":null},{"id":"W4389371749","doi":"10.1016/j.comnet.2023.110136","title":"Connecting Internet of Drones and Urban Computing: Methods, protocols and applications","year":2023,"lang":"en","type":"article","venue":"Computer Networks","topic":"UAV Applications and Optimization","field":"Engineering","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":"University of Ottawa","funders":"","keywords":"Drone; Computer science; The Internet; Underpinning; Realm; Domain (mathematical analysis); Emergency management; Global Positioning System; Service provider; Computer security; Service (business); Telecommunications; World Wide Web","score_opus":0.01643676683900644,"score_gpt":0.287643128680931,"score_spread":0.2712063618419246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389371749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004670701,0.00016158693,0.9927848,0.000013008635,0.000039567916,0.0018818227,8.2974213e-7,0.00028579944,0.00016185686],"genre_scores_gemma":[0.5542919,0.00008428635,0.4435107,0.000028447988,0.00043781401,0.0015266646,0.00004824195,0.000046347875,0.000025559813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995486,0.000018933135,0.00016751052,0.0001315042,0.000028805485,0.00010463944],"domain_scores_gemma":[0.9996595,0.00012855662,0.0000272194,0.00012333602,0.000025465057,0.000035952453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001517287,0.000076705066,0.00012196802,0.000054999717,0.00004371798,0.00003719909,0.00006857229,0.00004863882,0.000002089763],"category_scores_gemma":[0.0000019009132,0.00008055109,0.000013039303,0.00023845921,0.000022391101,0.000035951758,0.00008808887,0.00007144624,0.0000014622909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014047185,0.00000869081,0.0013273542,0.00009998962,0.000026430846,1.9735639e-7,0.0004067901,0.62006205,0.00006547354,0.00405521,0.002273586,0.3716728],"study_design_scores_gemma":[0.00011251037,0.000012848465,0.0014027457,0.000037652422,0.000005666586,0.0000032452767,0.000013740129,0.9872693,0.0000825132,0.00018997557,0.010792437,0.0000773916],"about_ca_topic_score_codex":0.0000020108623,"about_ca_topic_score_gemma":6.794701e-7,"teacher_disagreement_score":0.5496212,"about_ca_system_score_codex":0.000005523758,"about_ca_system_score_gemma":0.0000017156427,"threshold_uncertainty_score":0.32847783},"labels":[],"label_agreement":null},{"id":"W4390238639","doi":"10.1016/j.comnet.2023.110156","title":"Leveraging pervasive computing for ambient intelligence: A survey on recent advancements, applications and open challenges","year":2023,"lang":"en","type":"article","venue":"Computer Networks","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":20,"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; Ambient intelligence; Leverage (statistics); Data science; Ubiquitous computing; Open research; Field (mathematics); Analytics; Context (archaeology); Context-aware pervasive systems; Human–computer interaction; Artificial intelligence; World Wide Web","score_opus":0.1642765570846529,"score_gpt":0.34758982131269406,"score_spread":0.18331326422804115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390238639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013906474,0.00071302423,0.9936614,0.0011083974,0.00093259476,0.001759289,0.000009545002,0.0002902466,0.0001348579],"genre_scores_gemma":[0.96734595,0.002947712,0.026710585,0.0012764832,0.0007397743,0.0006692138,0.00015320236,0.00004753142,0.000109539906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978664,0.00023480195,0.00037254472,0.0008763788,0.0002084081,0.0004414586],"domain_scores_gemma":[0.9973828,0.0014124305,0.00019407392,0.00059582444,0.00027873312,0.00013610937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012832723,0.00022538498,0.00033884216,0.00015118651,0.00038421256,0.00054720265,0.0011989907,0.00007259589,0.0000027580008],"category_scores_gemma":[0.00002789295,0.00023477986,0.00005331096,0.00062459323,0.00003650164,0.00034780096,0.0015808886,0.00018058854,0.00003942186],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011797779,0.000061732935,0.00043186705,0.000024090687,0.00004021794,0.000002562973,0.0007491155,0.008873796,0.0000013642664,0.0018366477,0.002064776,0.985902],"study_design_scores_gemma":[0.00041071858,0.00017787033,0.017233472,0.00019464437,0.0000052363075,0.000009340812,0.00009714421,0.94187117,0.0000264394,0.0012541864,0.038383067,0.00033671746],"about_ca_topic_score_codex":0.000032520744,"about_ca_topic_score_gemma":0.000046137353,"teacher_disagreement_score":0.9855653,"about_ca_system_score_codex":0.000080316466,"about_ca_system_score_gemma":0.000043247644,"threshold_uncertainty_score":0.9574045},"labels":[],"label_agreement":null},{"id":"W4391319116","doi":"10.1016/j.comnet.2024.110193","title":"Comparative analysis of 2D mesh topologies with additional communication links for on-chip networks","year":2024,"lang":"en","type":"article","venue":"Computer Networks","topic":"Interconnection Networks and Systems","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":"Western University","funders":"","keywords":"Computer science; Network topology; Mesh networking; Polygon mesh; Scalability; Network on a chip; Bottleneck; Distributed computing; MPSoC; Interconnection; Node (physics); Energy consumption; Order One Network Protocol; Wireless mesh network; Topology (electrical circuits); System on a chip; Embedded system; Routing (electronic design automation); Computer network; Routing protocol; Telecommunications; Wireless","score_opus":0.030682383227629704,"score_gpt":0.28096183304776445,"score_spread":0.2502794498201347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391319116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006533145,0.00091357913,0.99498165,0.0003689015,0.0011431193,0.00035907977,0.000055750104,0.00027005537,0.0012545519],"genre_scores_gemma":[0.96820515,0.000050725397,0.029805625,0.00047528814,0.0007206716,0.00014908623,0.0004288514,0.00001306566,0.00015154718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998224,0.00020676955,0.0004899015,0.0005292074,0.00022413695,0.000325967],"domain_scores_gemma":[0.9965029,0.0021742433,0.00019538237,0.0007881376,0.00026507134,0.0000742981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041711144,0.00024869916,0.00059266604,0.00034215883,0.00021578404,0.00034873805,0.0008870039,0.00023380911,0.00008570142],"category_scores_gemma":[0.0000050169792,0.00019415212,0.00031448784,0.0013939899,0.00013627134,0.0002807652,0.00020078951,0.00048428532,0.000005522703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003579293,0.000043006155,0.00006073417,0.000012402976,0.0010643534,0.0000029875996,0.00034386804,0.7824703,2.1321546e-7,0.12490892,0.08393635,0.0071210945],"study_design_scores_gemma":[0.00018322814,0.0003846438,0.00094086636,0.00027722088,0.00014906465,0.000008638011,0.000037034875,0.985856,0.000004562426,0.000634044,0.011300943,0.00022373753],"about_ca_topic_score_codex":0.00001178996,"about_ca_topic_score_gemma":0.00007478251,"teacher_disagreement_score":0.9675518,"about_ca_system_score_codex":0.000060438393,"about_ca_system_score_gemma":0.000047951253,"threshold_uncertainty_score":0.7917294},"labels":[],"label_agreement":null},{"id":"W4391731133","doi":"10.1016/j.comnet.2024.110241","title":"Service function chain network planning through offline, online and infeasibility restoration techniques","year":2024,"lang":"en","type":"article","venue":"Computer Networks","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":"Ciena (Canada); École de Technologie Supérieure; Carleton University","funders":"","keywords":"Computer science; Service (business); Function (biology); Chain (unit); Computer network; Operations research; Real-time computing","score_opus":0.028437877003767802,"score_gpt":0.27319965100376764,"score_spread":0.24476177399999985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391731133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050651887,0.0077595925,0.98079515,0.0011686558,0.0027195564,0.00032601843,0.0000023282869,0.0020338492,0.00012968737],"genre_scores_gemma":[0.5226451,0.000517255,0.454372,0.009551684,0.012508032,0.000063478066,0.00019399777,0.00008054658,0.00006788778],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978781,0.00014656225,0.00043386983,0.0008331418,0.00023108325,0.00047725538],"domain_scores_gemma":[0.99865115,0.00035729134,0.00009898251,0.0006528109,0.00012894491,0.000110836314],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005725634,0.00030754477,0.0002922446,0.00008031666,0.00024118678,0.0006264061,0.00045839077,0.00025188862,0.000004460249],"category_scores_gemma":[0.000009295419,0.00028439445,0.00007293877,0.0011838061,0.000045377627,0.00096110534,0.000573963,0.0005301719,0.0000077316645],"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.00004586984,0.000084405285,0.004489177,0.00012663292,0.00008101578,0.000060050726,0.00073202926,0.31574994,0.0000049019714,0.025444409,0.06411179,0.5890698],"study_design_scores_gemma":[0.0001304859,0.00017230527,0.0074395672,0.0004035068,0.000018599278,0.000034690656,0.000004559242,0.9413977,0.000002516282,0.010419868,0.03967755,0.00029863484],"about_ca_topic_score_codex":0.000048294198,"about_ca_topic_score_gemma":0.000051232066,"teacher_disagreement_score":0.6256478,"about_ca_system_score_codex":0.00006162783,"about_ca_system_score_gemma":0.00005631414,"threshold_uncertainty_score":0.99996084},"labels":[],"label_agreement":null},{"id":"W4391756394","doi":"10.1016/j.comnet.2024.110244","title":"Secure and efficient communication approaches for Industry 5.0 in edge computing","year":2024,"lang":"en","type":"article","venue":"Computer Networks","topic":"User Authentication and Security Systems","field":"Computer Science","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Edge computing; Enhanced Data Rates for GSM Evolution; Secure communication; Distributed computing; Theoretical computer science; Computer security; Computer network; Telecommunications; Encryption","score_opus":0.037115842245077975,"score_gpt":0.2573876387572004,"score_spread":0.22027179651212242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391756394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041633915,0.0034365477,0.9523515,0.0011815452,0.000684912,0.00038318723,9.783151e-7,0.00021310437,0.00011431962],"genre_scores_gemma":[0.98560166,0.000013414208,0.01386857,0.00021185556,0.00023111956,0.000022357064,0.000011666398,0.000011406601,0.000027963762],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988788,0.00011133269,0.00027780168,0.00039324648,0.00010184486,0.00023699849],"domain_scores_gemma":[0.9991219,0.00028598573,0.000046054087,0.0004448981,0.000030244599,0.00007088706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006122455,0.00012937572,0.00016184701,0.00012976746,0.00010969145,0.00052193145,0.00056178035,0.00025647125,8.117322e-7],"category_scores_gemma":[0.000004744848,0.00012472793,0.000045216177,0.00039111724,0.000042709977,0.00013991255,0.0003876193,0.0005513926,0.000003881078],"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.0000066010844,0.00019379902,0.0018541211,0.00038447473,0.00006344765,0.0000107780625,0.069069706,0.08191806,0.0000026205075,0.38246706,0.007457108,0.4565722],"study_design_scores_gemma":[0.00018855631,0.00001923838,0.0017192046,0.00022246865,0.0000035897124,0.000015799615,0.000040391184,0.9925067,0.0000022255456,0.0009885286,0.004157036,0.00013626825],"about_ca_topic_score_codex":0.0000053504564,"about_ca_topic_score_gemma":0.0000060474426,"teacher_disagreement_score":0.94396776,"about_ca_system_score_codex":0.00003630183,"about_ca_system_score_gemma":0.000026987382,"threshold_uncertainty_score":0.50862575},"labels":[],"label_agreement":null},{"id":"W4392246655","doi":"10.1016/j.comnet.2024.110294","title":"Zero-touch networks: Towards next-generation network automation","year":2024,"lang":"en","type":"article","venue":"Computer Networks","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":48,"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; Western University","funders":"","keywords":"Computer science; Zero (linguistics); Automation; Computer network; Embedded system","score_opus":0.03595581639039572,"score_gpt":0.24838031137009065,"score_spread":0.21242449497969493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392246655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012204702,0.004336715,0.91517854,0.0006744539,0.075267725,0.00029800838,1.2039828e-7,0.0021775526,0.0008464073],"genre_scores_gemma":[0.62689716,0.00028572633,0.24080682,0.0026180164,0.12867433,0.000053574026,0.00013571557,0.00011605137,0.00041258545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966319,0.00021969117,0.00066244527,0.001040292,0.0004108314,0.0010348463],"domain_scores_gemma":[0.9984448,0.00020912667,0.00012967498,0.0008530354,0.00013765447,0.00022572017],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00078941684,0.00045193607,0.00038918745,0.00018381065,0.00050258625,0.0028415895,0.0012295311,0.00030752056,0.000008497918],"category_scores_gemma":[0.000008185299,0.0004371689,0.00024010857,0.0015564486,0.000052948944,0.0014297288,0.0008322183,0.0006163942,0.00013695739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014083748,0.000013474965,0.000038789458,0.0000132761625,0.00003419602,0.000034269015,0.00014544833,0.39064267,0.000005354169,0.004377867,0.2216786,0.38301465],"study_design_scores_gemma":[0.000152656,0.00008790856,0.00048663263,0.00020829677,0.000019271221,0.000063838466,6.759392e-7,0.93941545,0.000009774319,0.0016419811,0.057443142,0.0004703947],"about_ca_topic_score_codex":0.000015158995,"about_ca_topic_score_gemma":0.0000022637191,"teacher_disagreement_score":0.6743717,"about_ca_system_score_codex":0.00015713833,"about_ca_system_score_gemma":0.00012735235,"threshold_uncertainty_score":0.999808},"labels":[],"label_agreement":null},{"id":"W4393059603","doi":"10.1016/j.comnet.2024.110335","title":"Computation offloading in NOMA-MEC-enabled aerial-vehicular networks exploiting mmWave capabilities","year":2024,"lang":"en","type":"article","venue":"Computer Networks","topic":"UAV Applications and Optimization","field":"Engineering","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":"École de Technologie Supérieure","funders":"National Research Foundation of Korea; Ministry of Science, ICT and Future Planning; King Saud University","keywords":"Computer science; Mobile edge computing; Computer network; Edge computing; Computation offloading; Server; Wireless network; Cellular network; Distributed computing; Noma; Wireless; Enhanced Data Rates for GSM Evolution; Telecommunications link; Telecommunications","score_opus":0.007105512449075009,"score_gpt":0.19634469706353191,"score_spread":0.1892391846144569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393059603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05160176,0.0018370831,0.94298774,0.000036855483,0.0015044629,0.00031589757,0.0000014920828,0.0008027001,0.0009119873],"genre_scores_gemma":[0.9783803,0.00017670417,0.019539539,0.000054655553,0.0015582929,0.00008902517,0.00012009234,0.00006183702,0.000019527888],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869806,0.00004430945,0.0004261046,0.00033434658,0.00010685868,0.00039030216],"domain_scores_gemma":[0.9994896,0.00017133568,0.000030021558,0.00019527692,0.000044734847,0.00006903775],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023731134,0.00022720094,0.0002389154,0.00017223951,0.000089160516,0.00031196716,0.00013583172,0.00016867067,0.000023537736],"category_scores_gemma":[0.0000032359615,0.00025092476,0.00007395585,0.00059448974,0.000029115312,0.00028193742,0.000060586593,0.00032426708,0.000017259796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030531164,0.000009405219,0.00009238295,0.00006315991,0.000026313588,0.000011189817,0.0004540448,0.9688424,0.000014742265,0.0010854233,0.0015814475,0.027816463],"study_design_scores_gemma":[0.00019964096,0.000017749502,0.00024900734,0.0002395952,0.0000141844075,0.000009654196,0.000052545096,0.99711,0.000014928524,0.00032951016,0.0015001643,0.00026302057],"about_ca_topic_score_codex":0.000020480402,"about_ca_topic_score_gemma":0.000015947162,"teacher_disagreement_score":0.92677855,"about_ca_system_score_codex":0.00016465556,"about_ca_system_score_gemma":0.00001423616,"threshold_uncertainty_score":0.9999943},"labels":[],"label_agreement":null},{"id":"W4397001512","doi":"10.1016/j.comnet.2024.110508","title":"FTG-Net-E: A hierarchical ensemble graph neural network for DDoS attack detection","year":2024,"lang":"en","type":"article","venue":"Computer Networks","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"European Commission","keywords":"Computer science; Denial-of-service attack; Artificial intelligence; Artificial neural network; Graph; Machine learning; Theoretical computer science; The Internet; World Wide Web","score_opus":0.01786878164698726,"score_gpt":0.2513169081498057,"score_spread":0.2334481265028184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4397001512","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048376108,0.0027868296,0.976245,0.000685168,0.013388889,0.0006075024,0.0000019010424,0.0012711247,0.0001760108],"genre_scores_gemma":[0.92060626,0.00021984796,0.064797364,0.0016736757,0.012239874,0.00017077793,0.000023248358,0.00006627571,0.00020267532],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970945,0.00019306157,0.00049747794,0.0010054597,0.00030389114,0.0009056245],"domain_scores_gemma":[0.9983451,0.00055570074,0.000086683074,0.0006680041,0.0001041709,0.00024035366],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005849977,0.00036575663,0.0003463305,0.00019875112,0.0005343426,0.0009730706,0.0008470151,0.00031122443,0.00001624886],"category_scores_gemma":[0.000009098413,0.00035034696,0.00037874034,0.0013667458,0.000082773746,0.00069544034,0.0004477773,0.00076538965,0.0000466536],"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.000039092378,0.000028022843,0.0000096074955,0.00003662294,0.000049925075,0.000025519306,0.00010885009,0.28023934,0.00002194524,0.0092860935,0.045386378,0.6647686],"study_design_scores_gemma":[0.0002751459,0.00041856852,0.00011630241,0.00010722209,0.000019639443,0.00012805557,8.6608424e-7,0.86060554,0.00005849619,0.01058606,0.12733482,0.00034928063],"about_ca_topic_score_codex":0.000009067024,"about_ca_topic_score_gemma":0.00004590511,"teacher_disagreement_score":0.9157686,"about_ca_system_score_codex":0.00007188911,"about_ca_system_score_gemma":0.000042633754,"threshold_uncertainty_score":0.99989486},"labels":[],"label_agreement":null},{"id":"W4399422086","doi":"10.1016/j.comnet.2024.110576","title":"Machine learning-enabled hybrid intrusion detection system with host data transformation and an advanced two-stage classifier","year":2024,"lang":"en","type":"article","venue":"Computer Networks","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada); Nokia (Canada); Ciena (Canada); University of Ottawa","funders":"","keywords":"Computer science; Intrusion detection system; Host (biology); Classifier (UML); Artificial intelligence; Transformation (genetics); Machine learning; Pattern recognition (psychology); Data mining","score_opus":0.01333889536162386,"score_gpt":0.23499311405528003,"score_spread":0.22165421869365617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399422086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023936108,0.0011213323,0.97123986,0.00011753783,0.0017943261,0.00037117524,0.0000061136006,0.0011467327,0.00026680322],"genre_scores_gemma":[0.9890806,0.00027149566,0.009479819,0.00010252228,0.0008452449,0.000017134043,0.000115262155,0.000030602918,0.00005731476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787444,0.00025005668,0.00035114537,0.00086783915,0.00028952883,0.00036698693],"domain_scores_gemma":[0.9987677,0.00009371724,0.000104548955,0.0007937764,0.000073865034,0.00016639897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062608934,0.00027888917,0.0002497078,0.0001928526,0.00047616378,0.0009490873,0.00066998875,0.00010266116,0.000008558875],"category_scores_gemma":[0.0000031245859,0.00023168745,0.000036498262,0.000601139,0.000052504744,0.0031533437,0.00041797655,0.0006723727,0.000012774199],"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.00011311451,0.000031293595,0.00002377203,0.00015827268,0.000040128052,0.00006914018,0.0004657449,0.14075677,0.00021942354,0.005928055,0.000105342886,0.8520889],"study_design_scores_gemma":[0.0005863743,0.0005586289,0.00009171847,0.00028872865,0.000019590401,0.0002635042,0.00002172789,0.97427016,0.00025064131,0.000052907762,0.023295775,0.00030022257],"about_ca_topic_score_codex":0.00005541047,"about_ca_topic_score_gemma":0.00015241593,"teacher_disagreement_score":0.9651445,"about_ca_system_score_codex":0.000085901076,"about_ca_system_score_gemma":0.000031406642,"threshold_uncertainty_score":0.944794},"labels":[],"label_agreement":null},{"id":"W4400038006","doi":"10.1016/j.comnet.2024.110615","title":"Collaborative computation offloading and wireless charging scheduling in multi-UAV-assisted MEC networks: A TD3-based approach","year":2024,"lang":"en","type":"article","venue":"Computer Networks","topic":"UAV Applications and Optimization","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":"University of British Columbia","funders":"","keywords":"Computer science; Scheduling (production processes); Wireless; Computation; Computer network; Wireless network; Computation offloading; Distributed computing; Real-time computing; Mathematical optimization; Embedded system; Telecommunications; Internet of Things; Algorithm","score_opus":0.011441911540798684,"score_gpt":0.22813502498554256,"score_spread":0.21669311344474387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400038006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027229551,0.0024871354,0.9688323,0.000030410856,0.00039961634,0.00039533954,0.0000025462857,0.0005232216,0.00009983714],"genre_scores_gemma":[0.80418235,0.00011157826,0.19518453,0.000041625004,0.00023091563,0.000076843324,0.00012031733,0.000047636793,0.0000041922194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989211,0.00004987179,0.00030816818,0.00035257364,0.00008813897,0.0002801624],"domain_scores_gemma":[0.9995797,0.0001300273,0.000036002508,0.00012554153,0.000057624868,0.00007107438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020261969,0.00021635882,0.00023193512,0.00020561498,0.000101374084,0.00029406697,0.0000938201,0.00014700889,0.0000020035823],"category_scores_gemma":[0.0000017583361,0.00023445177,0.000034260014,0.0010875454,0.000032430067,0.00018807693,0.000038901362,0.000304323,0.0000021874507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004052396,0.000024703708,0.00020365727,0.00008258359,0.00002958652,0.0000046605824,0.00035167884,0.9503624,0.00002519142,0.00031178823,0.00013575733,0.048463967],"study_design_scores_gemma":[0.00043306942,0.00001086752,0.0012549334,0.00029755168,0.000016876245,0.000004375354,0.00005125331,0.9975423,0.000008283472,0.000011452351,0.00012459951,0.0002444252],"about_ca_topic_score_codex":0.000006459272,"about_ca_topic_score_gemma":0.000010990349,"teacher_disagreement_score":0.7769528,"about_ca_system_score_codex":0.00011067875,"about_ca_system_score_gemma":0.00002235933,"threshold_uncertainty_score":0.95606655},"labels":[],"label_agreement":null},{"id":"W4400315824","doi":"10.1016/j.comnet.2024.110622","title":"A reliable cluster-based opportunistic routing protocol for underwater wireless sensor networks","year":2024,"lang":"en","type":"article","venue":"Computer Networks","topic":"Underwater Vehicles and Communication Systems","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 Ottawa","funders":"","keywords":"Computer science; Computer network; Routing protocol; Network packet; Routing table; Distributed computing; Source routing; Packet forwarding; Geographic routing; Dynamic Source Routing; Wireless sensor network","score_opus":0.033585800511155735,"score_gpt":0.2658980584267568,"score_spread":0.23231225791560106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400315824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017091015,0.00005196051,0.96923447,0.00013024242,0.0005332682,0.028390646,0.000004300649,0.0012328973,0.00025132348],"genre_scores_gemma":[0.88287383,0.0000059940203,0.023467045,0.00045556558,0.0020389478,0.09049559,0.000103448634,0.00020595572,0.00035359806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983481,0.000063269435,0.00053709105,0.00035689754,0.00013285436,0.0005617941],"domain_scores_gemma":[0.9989687,0.00023922038,0.000048833084,0.000535762,0.00006772273,0.00013971797],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035892392,0.00030936138,0.00030979127,0.00008440511,0.00016901433,0.0005328446,0.0003818948,0.0002087507,0.000016743761],"category_scores_gemma":[4.5579117e-7,0.00027827473,0.00016124434,0.00022501951,0.000035558227,0.00012385496,0.00011166533,0.00034977225,0.000020844735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023066255,0.000022946371,0.00006333796,0.00042535743,0.0000753199,0.000010550042,0.000058982117,0.9701614,0.000032297343,0.00048577972,0.0069034663,0.021737497],"study_design_scores_gemma":[0.00058287807,0.000058559104,0.0000070746473,0.000646656,0.000018088029,0.0000135228565,0.000008396983,0.8599737,0.000052070896,0.00006686869,0.13826749,0.00030463768],"about_ca_topic_score_codex":0.0000050685667,"about_ca_topic_score_gemma":0.0000035195762,"teacher_disagreement_score":0.9457674,"about_ca_system_score_codex":0.000108788794,"about_ca_system_score_gemma":0.000033754495,"threshold_uncertainty_score":0.9999669},"labels":[],"label_agreement":null},{"id":"W4400412096","doi":"10.1016/j.comnet.2024.110627","title":"Multi-objective optimization of asymmetric bit rate partitioning for multipath protection in elastic optical networks","year":2024,"lang":"en","type":"article","venue":"Computer Networks","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":"University of Waterloo","funders":"Universidade Federal de Pernambuco; Fundação de Amparo à Ciência e Tecnologia do Estado de Pernambuco; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Computer science; Bit (key); Multipath propagation; Bit rate; Bit error rate; Computer network; Electronic engineering; Telecommunications","score_opus":0.01447497690937439,"score_gpt":0.2320071166591421,"score_spread":0.2175321397497677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400412096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001957547,0.0019338762,0.9929011,0.00001785087,0.0012981973,0.00083396974,0.0000026834884,0.0010241941,0.000030568266],"genre_scores_gemma":[0.63733244,0.00016670398,0.36190024,0.000008113568,0.0003068501,0.00021288528,0.000018183604,0.000050396473,0.000004224235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863654,0.000034865832,0.00044180345,0.00035671776,0.00008370337,0.00044636178],"domain_scores_gemma":[0.9990912,0.0005520996,0.00004166076,0.0001867879,0.000074600954,0.000053646854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024383885,0.00023477408,0.00030862083,0.0003398474,0.000050808183,0.00006918769,0.00014654297,0.00028782073,0.000002741572],"category_scores_gemma":[0.000085930915,0.00023901445,0.00009110942,0.0013570588,0.00007625252,0.0002272247,0.00007771523,0.00050643185,0.0000025276174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020244945,0.000029096971,0.000057443147,0.00008626747,0.00003783317,0.0000068499153,0.000026184458,0.91879624,0.000017515753,0.0004566092,0.00005478295,0.08041093],"study_design_scores_gemma":[0.00044801104,0.00013183363,0.00075466925,0.00039873604,0.000023021506,0.0000044263625,0.000008264051,0.9976217,0.00007193654,0.00023035122,0.00007020961,0.00023679843],"about_ca_topic_score_codex":0.0000015397185,"about_ca_topic_score_gemma":0.0000070690326,"teacher_disagreement_score":0.63537484,"about_ca_system_score_codex":0.00015413057,"about_ca_system_score_gemma":0.000010390185,"threshold_uncertainty_score":0.9746726},"labels":[],"label_agreement":null},{"id":"W4400621233","doi":"10.1016/j.comnet.2024.110638","title":"NEMa: A Novel Energy-Efficient Mobility Management Protocol for 5G/6G-Enabled Sustainable Vehicular Networks","year":2024,"lang":"en","type":"article","venue":"Computer Networks","topic":"Vehicular Ad Hoc Networks (VANETs)","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":"University of Ottawa","funders":"","keywords":"Computer science; Protocol (science); Mobility management; Computer network; Efficient energy use; Energy (signal processing); Telecommunications; Electrical engineering","score_opus":0.0078338640315653,"score_gpt":0.22655450255568355,"score_spread":0.21872063852411824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400621233","genre_codex":"methods","genre_gemma":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021092266,0.0009918534,0.9293524,0.000060369322,0.0015453036,0.06432776,0.000003791968,0.0019374333,0.0015701428],"genre_scores_gemma":[0.3912903,0.00006497024,0.027108112,0.0006578504,0.008134824,0.5689263,0.0002393113,0.0007391897,0.0028391539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99571234,0.00007626462,0.00079273304,0.0010847454,0.00039611635,0.001937813],"domain_scores_gemma":[0.99814624,0.00021693604,0.000070861286,0.0010460297,0.00017334631,0.0003466197],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009194381,0.0007498142,0.0006310209,0.0002287992,0.00028767725,0.000668805,0.0006870971,0.00042659027,0.00004694912],"category_scores_gemma":[0.0000045193538,0.0007332718,0.00045085503,0.001036245,0.00008408366,0.00022162525,0.00032331914,0.00065743434,0.000015279085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005206856,0.00017786038,0.0000065018194,0.0012854787,0.00037648258,0.00023646514,0.000040497485,0.9120259,0.0000029706118,0.012165793,0.058870587,0.014759357],"study_design_scores_gemma":[0.0011553918,0.000092843395,0.00004658847,0.00042383853,0.00007635383,0.000029783167,0.000012398893,0.7656087,0.000013890281,0.00031634374,0.23161553,0.0006083328],"about_ca_topic_score_codex":0.000015636851,"about_ca_topic_score_gemma":0.0000074820146,"teacher_disagreement_score":0.9022443,"about_ca_system_score_codex":0.00056071265,"about_ca_system_score_gemma":0.00004914881,"threshold_uncertainty_score":0.99951184},"labels":[],"label_agreement":null},{"id":"W4400624425","doi":"10.1016/j.comnet.2024.110631","title":"Delay-aware and reliable medium access control protocols for UWSNs: Features, protocols, and classification","year":2024,"lang":"en","type":"article","venue":"Computer Networks","topic":"Underwater Vehicles and Communication Systems","field":"Engineering","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 Ottawa","funders":"","keywords":"Computer science; Access control; Computer network; Protocol (science)","score_opus":0.035629344448467284,"score_gpt":0.2975680834453182,"score_spread":0.26193873899685094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400624425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022592876,0.0013397931,0.948735,0.00035018992,0.00015695959,0.04864701,0.0000075983353,0.00046362626,0.000073922005],"genre_scores_gemma":[0.7605541,0.000110880275,0.005869835,0.00021560206,0.0010044564,0.23193698,0.00005173602,0.000081550104,0.00017489602],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916166,0.000032917116,0.00025725606,0.00024819895,0.00008584052,0.00021414869],"domain_scores_gemma":[0.9994287,0.00009975553,0.00003243931,0.0003010897,0.000056352532,0.00008164997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021394325,0.0001630302,0.00020092516,0.000051913154,0.00009971202,0.00073322427,0.00026267735,0.00014373902,0.0000024369976],"category_scores_gemma":[6.274623e-7,0.0001413104,0.000034208886,0.00010853602,0.00003021192,0.0002538189,0.00008868225,0.00020419018,0.0000021471694],"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.00028658312,0.00014802678,0.0074937553,0.008301007,0.0007781706,0.000023290297,0.0012533712,0.113092154,0.0009476654,0.0074793953,0.2510321,0.6091645],"study_design_scores_gemma":[0.00043670268,0.000045100358,0.0011020127,0.00043055412,0.000009560706,0.000020590642,0.0000040131285,0.6923813,0.000029938283,0.00022237052,0.30519077,0.00012706098],"about_ca_topic_score_codex":0.000003187682,"about_ca_topic_score_gemma":0.000006366284,"teacher_disagreement_score":0.94286513,"about_ca_system_score_codex":0.000031614854,"about_ca_system_score_gemma":0.000016074448,"threshold_uncertainty_score":0.70704985},"labels":[],"label_agreement":null},{"id":"W4402512197","doi":"10.1016/j.comnet.2024.110803","title":"Survey of fault management techniques for edge-enabled distributed metaverse applications","year":2024,"lang":"en","type":"article","venue":"Computer Networks","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Metaverse; Fault management; Distributed computing; Data science; Human–computer interaction; Telecommunications; Virtual reality; Aerospace engineering","score_opus":0.020678418733659252,"score_gpt":0.2670983728822739,"score_spread":0.24641995414861464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402512197","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008173141,0.00069320574,0.99311596,0.000096396536,0.004124484,0.00080377056,0.0000061201795,0.0006729322,0.00040539776],"genre_scores_gemma":[0.24312367,0.00015357572,0.7491874,0.00037939806,0.0055497047,0.0005689181,0.00054213527,0.00007246559,0.00042272575],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984286,0.000080955935,0.00040120995,0.00054136827,0.00016047686,0.00038740024],"domain_scores_gemma":[0.99860567,0.00038203405,0.00009036766,0.0006415488,0.00020015774,0.00008022595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007989169,0.00019909457,0.00027733005,0.00015823253,0.0001427784,0.00028135683,0.0010135082,0.000095314084,0.0000012596502],"category_scores_gemma":[0.00000482458,0.00018720144,0.00014208394,0.0010306082,0.000043420325,0.00021101661,0.0006372201,0.0001546909,0.000012586499],"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.0000081180615,0.00008926185,0.00012517534,0.00024273906,0.00021238117,0.000011824348,0.0001062521,0.0075086937,0.000004689253,0.012197367,0.19211297,0.7873805],"study_design_scores_gemma":[0.00011595181,0.000045116976,0.0011519372,0.0000912183,0.000024442217,0.000003526102,0.0000010722326,0.84141445,0.00009057448,0.0009604468,0.155916,0.0001852698],"about_ca_topic_score_codex":0.000015368425,"about_ca_topic_score_gemma":0.0000016973574,"teacher_disagreement_score":0.83390576,"about_ca_system_score_codex":0.000050900795,"about_ca_system_score_gemma":0.00003328296,"threshold_uncertainty_score":0.7633853},"labels":[],"label_agreement":null},{"id":"W4402735076","doi":"10.1016/j.comnet.2024.110797","title":"HAC-SAGIN: High-altitude computing enabled space-air-ground integrated networks for 6G","year":2024,"lang":"en","type":"article","venue":"Computer Networks","topic":"UAV Applications and Optimization","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":"École de Technologie Supérieure","funders":"King Saud University","keywords":"Computer science; Effects of high altitude on humans; Space (punctuation); Altitude (triangle); Aerospace engineering; Real-time computing; Meteorology; Physics; Operating system","score_opus":0.006286885833229979,"score_gpt":0.20334350033187873,"score_spread":0.19705661449864875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402735076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022402746,0.0029141814,0.98963773,0.00018807969,0.0026104483,0.00055957405,0.0000055324244,0.0015429899,0.00030121556],"genre_scores_gemma":[0.8691895,0.00021885464,0.12660314,0.00019230772,0.0030050422,0.00008015247,0.00037709594,0.00012529663,0.00020859764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862504,0.000023973067,0.00035481039,0.0004050171,0.00009713329,0.0004940505],"domain_scores_gemma":[0.9992267,0.00021015864,0.000035880737,0.0003286165,0.000090240515,0.00010843165],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002049227,0.000297657,0.00028391375,0.000117899675,0.00016607394,0.0003405893,0.00025444437,0.00021391279,0.000021192685],"category_scores_gemma":[0.000002388374,0.00029386484,0.00010993938,0.0006162579,0.000033481414,0.00016454418,0.00008235661,0.0003754007,0.000021179376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004751835,0.000014288021,0.000026379048,0.000074388336,0.00009779012,0.000003995633,0.00007439917,0.90751296,0.0000044366298,0.0051503577,0.04082607,0.04621015],"study_design_scores_gemma":[0.00028649557,0.000032171723,0.00024195113,0.00020489727,0.00004241531,0.0000075004486,0.0000070519945,0.95073056,0.000008153266,0.0002391337,0.047890943,0.00030874362],"about_ca_topic_score_codex":0.000025258489,"about_ca_topic_score_gemma":0.000018096882,"teacher_disagreement_score":0.86694926,"about_ca_system_score_codex":0.00013054753,"about_ca_system_score_gemma":0.000020377207,"threshold_uncertainty_score":0.99995136},"labels":[],"label_agreement":null},{"id":"W4403539633","doi":"10.1016/j.comnet.2024.110857","title":"Enhancing smart city IoT communication: A two-layer NOMA-based network with caching mechanisms and optimized resource allocation","year":2024,"lang":"en","type":"article","venue":"Computer Networks","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":5,"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":"Trent University; Northern Border University; Nottingham Trent University; Prince Sattam bin Abdulaziz University","keywords":"Noma; Computer science; Internet of Things; Computer network; Resource allocation; Layer (electronics); Physical layer; Resource (disambiguation); Application layer; Distributed computing; Telecommunications; Wireless; Computer security; Telecommunications link; Software deployment","score_opus":0.010492886745415817,"score_gpt":0.21953519674516106,"score_spread":0.20904230999974524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403539633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004505283,0.0066280644,0.9850398,0.0004089617,0.00016282042,0.00029428917,0.0000010412091,0.002700555,0.0002591886],"genre_scores_gemma":[0.5910784,0.00013612214,0.4084167,0.00012879245,0.00009271131,0.000058480808,0.00002958279,0.0000493917,0.000009801994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877226,0.00010747903,0.0003242279,0.00031445574,0.00013668848,0.00034490775],"domain_scores_gemma":[0.9983036,0.0005157739,0.00005990248,0.001004099,0.00004753523,0.00006908789],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003785918,0.00027415817,0.0002806762,0.00010948758,0.00026756595,0.00021442396,0.0005194613,0.0001493127,0.000008505021],"category_scores_gemma":[0.000005614292,0.0002664079,0.00004494939,0.00046473814,0.00009950914,0.00015906127,0.00029126668,0.0007018055,0.000003906138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013053828,0.000007565393,0.000027376906,0.00003795581,0.0000529653,0.0000043458003,0.00008123315,0.9586526,0.0000859846,0.0034121776,0.00041653114,0.03720818],"study_design_scores_gemma":[0.00041499353,0.000036234505,0.00008782744,0.000592124,0.000021976626,0.000015765423,0.000022153861,0.9940429,0.0005963166,0.00085530104,0.0030081647,0.00030629593],"about_ca_topic_score_codex":0.000010532711,"about_ca_topic_score_gemma":0.000048392416,"teacher_disagreement_score":0.5865731,"about_ca_system_score_codex":0.000107433705,"about_ca_system_score_gemma":0.00001995467,"threshold_uncertainty_score":0.99997884},"labels":[],"label_agreement":null},{"id":"W4404298362","doi":"10.1016/j.comnet.2024.110901","title":"Deep reinforcement learning for autonomous SideLink radio resource management in platoon-based C-V2X networks: An overview","year":2024,"lang":"en","type":"article","venue":"Computer Networks","topic":"Power Line Communications and Noise","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Reinforcement learning; Platoon; Artificial intelligence; Machine learning; Computer network; Control (management)","score_opus":0.023574340880973918,"score_gpt":0.25888936378314575,"score_spread":0.23531502290217182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404298362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038117426,0.029802741,0.9669651,0.000089594265,0.00067950843,0.0005183814,3.9487287e-7,0.00071903964,0.00084409787],"genre_scores_gemma":[0.96450585,0.002497145,0.030608805,0.0004666772,0.0009701549,0.0002779205,0.0003709462,0.00013593696,0.00016654794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985847,0.00006341256,0.00047904334,0.00031464922,0.000101018275,0.00045720502],"domain_scores_gemma":[0.998998,0.00020861559,0.0000335302,0.0006290489,0.000021161235,0.00010965702],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004175317,0.00025530008,0.0002547971,0.00018897002,0.000105070474,0.00018928996,0.00044622796,0.00012062026,0.000021813023],"category_scores_gemma":[0.0000020480584,0.0002754275,0.000119962715,0.0003732093,0.000019791312,0.000140345,0.0001421171,0.00046015138,0.000008910726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000911496,0.000015241294,0.00002385195,0.000105988365,0.00005535418,0.00001435925,0.000083085186,0.8346994,1.9259244e-7,0.001329419,0.0033965046,0.1602675],"study_design_scores_gemma":[0.00037965344,0.00006067934,0.00012057124,0.00031973637,0.000026676542,0.0000023256448,0.000010456152,0.8163383,8.9389135e-7,0.00005113012,0.1824386,0.0002510073],"about_ca_topic_score_codex":0.0000054397647,"about_ca_topic_score_gemma":0.000020415066,"teacher_disagreement_score":0.9641247,"about_ca_system_score_codex":0.00017923683,"about_ca_system_score_gemma":0.000014366373,"threshold_uncertainty_score":0.9999698},"labels":[],"label_agreement":null},{"id":"W4404409616","doi":"10.1016/j.comnet.2024.110888","title":"Automated orchestration of virtualized deployments of mobile core networks","year":2024,"lang":"en","type":"article","venue":"Computer Networks","topic":"Software-Defined Networks and 5G","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":"University of Regina","funders":"","keywords":"Computer science; Orchestration; Network Functions Virtualization; Core (optical fiber); Core network; Computer network; Embedded system; Operating system; Telecommunications; Cloud computing","score_opus":0.018984513890839633,"score_gpt":0.2708662913249166,"score_spread":0.2518817774340769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404409616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015835097,0.0034091212,0.97619724,0.00002758084,0.002528797,0.00035791722,0.000002879735,0.0015260936,0.00011526059],"genre_scores_gemma":[0.961068,0.00022540013,0.037870243,0.0001445425,0.00053636957,0.000039484148,0.00003768471,0.000037274793,0.000041048854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978288,0.00010455322,0.00075146137,0.0005650749,0.00032748433,0.00042263808],"domain_scores_gemma":[0.9983278,0.00047132184,0.00022081328,0.0007152141,0.00014292871,0.000121941885],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003675595,0.0002783679,0.0004823476,0.00016253063,0.00006668665,0.0001550024,0.0008996689,0.00023448434,0.000017370721],"category_scores_gemma":[0.0000071574573,0.00025381346,0.00019813728,0.001195358,0.00009761303,0.00036141806,0.0004008759,0.00028752972,0.000008376731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018487079,0.00009919854,0.0006822423,0.00006647842,0.00012319072,0.000030123165,0.00024826764,0.8295543,0.000033178094,0.011497526,0.015072011,0.14257498],"study_design_scores_gemma":[0.00036904143,0.0003037336,0.0013548272,0.0003599441,0.000026504467,0.00001943183,0.0000029132268,0.995403,0.00006197135,0.0005555532,0.001313444,0.00022967123],"about_ca_topic_score_codex":0.000019161642,"about_ca_topic_score_gemma":0.0000028618135,"teacher_disagreement_score":0.94523287,"about_ca_system_score_codex":0.000038832124,"about_ca_system_score_gemma":0.00008246813,"threshold_uncertainty_score":0.9999914},"labels":[],"label_agreement":null},{"id":"W4404625491","doi":"10.1016/j.comnet.2024.110916","title":"Towards 6G vehicular networks: Vision, technologies, and open challenges","year":2024,"lang":"en","type":"article","venue":"Computer Networks","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"National Natural Science Foundation of China","keywords":"Computer science; Telecommunications; Data science; Artificial intelligence","score_opus":0.017346286212520035,"score_gpt":0.25457378423681026,"score_spread":0.23722749802429022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404625491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042882346,0.24951716,0.7412971,0.0011308679,0.00058948755,0.00024150564,0.0000010998532,0.006165684,0.0006282139],"genre_scores_gemma":[0.8440049,0.121788755,0.033811815,0.00004645416,0.00015745006,0.00009066853,0.000012745677,0.000067864064,0.000019343837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989549,0.000025591104,0.00024036456,0.00036246388,0.00008711172,0.00032955696],"domain_scores_gemma":[0.9989036,0.00012388355,0.000023172568,0.0008797324,0.000029611341,0.000040000603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001718456,0.00024618395,0.00028416704,0.00012730034,0.00009336801,0.0003246353,0.0012852472,0.00031730763,0.000004961416],"category_scores_gemma":[0.000008688285,0.00022868079,0.000040652387,0.00036596644,0.00014422543,0.0003582821,0.0019159483,0.00062016863,0.00000955269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.1477744e-7,0.0000046249543,0.0000039675974,0.00003016769,0.0000340171,0.000012694459,0.000025808817,0.3723726,0.000002241168,0.007928753,0.0034970744,0.61608714],"study_design_scores_gemma":[0.000095233234,0.000039133596,0.00013909691,0.0002692589,0.000006605658,0.000019909896,0.00006198136,0.8832968,0.000037405833,0.0042837495,0.11150491,0.0002459086],"about_ca_topic_score_codex":0.00000200726,"about_ca_topic_score_gemma":0.0000063108228,"teacher_disagreement_score":0.8435761,"about_ca_system_score_codex":0.000057412566,"about_ca_system_score_gemma":0.000008647826,"threshold_uncertainty_score":0.93253314},"labels":[],"label_agreement":null},{"id":"W4405092505","doi":"10.1016/j.comnet.2024.110963","title":"Physically-consistent EM models-aware RIS-aided communication — A survey","year":2024,"lang":"en","type":"article","venue":"Computer Networks","topic":"Advanced Wireless Communication Technologies","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":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia; Université du Québec à Trois-Rivières","funders":"","keywords":"Computer science; Human–computer interaction","score_opus":0.023595136909429628,"score_gpt":0.22815696794545728,"score_spread":0.20456183103602765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405092505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062364084,0.009185532,0.97972536,0.0001091483,0.00038455604,0.00017145011,0.000008716542,0.0038591197,0.00031969912],"genre_scores_gemma":[0.9792269,0.002091781,0.018241469,0.000057071316,0.00008902845,0.000058215686,0.00014526754,0.000061975814,0.000028333601],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990115,0.00009974072,0.00028888157,0.00022772873,0.0001119841,0.00026015582],"domain_scores_gemma":[0.9981474,0.0004200603,0.000029680845,0.0012819191,0.00007149631,0.00004942862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017641543,0.00020854529,0.00023174482,0.000088444176,0.00009323477,0.00015902553,0.00079655385,0.00014845828,0.000006928287],"category_scores_gemma":[0.000006242812,0.00021377062,0.000084982545,0.0004280914,0.00007630411,0.00027823646,0.00042663023,0.0005857664,0.000041944924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016833221,0.000012084681,0.000016505006,0.000023983466,0.000047683534,0.0000019256056,0.0000978776,0.79599434,0.0000060287894,0.0022351579,0.0063960156,0.1951667],"study_design_scores_gemma":[0.00008784424,0.000012232407,0.00059790676,0.0001631275,0.000006928322,0.0000036878125,0.000019362285,0.99335235,0.00004548813,0.0038197886,0.0016633043,0.00022796469],"about_ca_topic_score_codex":0.000009301458,"about_ca_topic_score_gemma":0.000051720523,"teacher_disagreement_score":0.97299045,"about_ca_system_score_codex":0.000098524404,"about_ca_system_score_gemma":0.000010760641,"threshold_uncertainty_score":0.8717313},"labels":[],"label_agreement":null},{"id":"W4405394913","doi":"10.1016/j.comnet.2024.110984","title":"A survey on encrypted network traffic: A comprehensive survey of identification/classification techniques, challenges, and future directions","year":2024,"lang":"en","type":"article","venue":"Computer Networks","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Identification (biology); Encryption; Traffic classification; Survey research; Data science; Data mining; Computer security","score_opus":0.04034202833914588,"score_gpt":0.26707474181491137,"score_spread":0.22673271347576548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405394913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007801478,0.029085578,0.95916927,0.00043554162,0.0023871271,0.0003426386,0.000014355403,0.00064005994,0.00012395618],"genre_scores_gemma":[0.98956096,0.0049885795,0.003996567,0.000104086226,0.0011067928,0.000021739674,0.00016185721,0.000025833308,0.000033561733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972057,0.0007274679,0.0006282173,0.0008236222,0.00027996182,0.0003350435],"domain_scores_gemma":[0.99792373,0.0008759956,0.00020600123,0.0004809173,0.0004110456,0.0001022917],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013698663,0.00027721896,0.00041744814,0.00021805568,0.00015583284,0.00030782382,0.000616461,0.00021122133,0.0000050393865],"category_scores_gemma":[0.000014933851,0.00025330274,0.0001191522,0.0010630066,0.0000829849,0.00021729626,0.00017582554,0.00041729517,0.000009139796],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014806395,0.00009713897,0.00011299086,0.000041679108,0.00019416801,0.000008529783,0.00081078697,0.030432284,0.000002330844,0.06277256,0.0094759185,0.8960368],"study_design_scores_gemma":[0.000060806666,0.00007967366,0.20617475,0.00013015229,0.000015967113,0.00000834865,0.000007976317,0.7837515,0.0000015919326,0.0000135257305,0.009565966,0.00018976748],"about_ca_topic_score_codex":0.00005005525,"about_ca_topic_score_gemma":0.0005160488,"teacher_disagreement_score":0.9817595,"about_ca_system_score_codex":0.000048991937,"about_ca_system_score_gemma":0.000049185644,"threshold_uncertainty_score":0.9999919},"labels":[],"label_agreement":null},{"id":"W4407270122","doi":"10.1016/j.comnet.2025.111098","title":"Machine learning approaches for predicting link failures in production networks","year":2025,"lang":"en","type":"article","venue":"Computer Networks","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Link (geometry); Production (economics); Artificial intelligence; Machine learning; Computer network","score_opus":0.018787687066132507,"score_gpt":0.23553449379358837,"score_spread":0.21674680672745586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407270122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027054903,0.0006075768,0.994954,0.002008441,0.0005910943,0.0006275272,2.68376e-7,0.0006193479,0.00032123053],"genre_scores_gemma":[0.84100306,0.00007174156,0.1569763,0.00021699005,0.0009421719,0.00036041415,0.000016187558,0.000013549984,0.0003995882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987035,0.00006561391,0.00031244344,0.00054288463,0.00007228123,0.00030330347],"domain_scores_gemma":[0.9992855,0.00012355299,0.00011005971,0.0003864578,0.000055138175,0.000039297323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042635016,0.00015474643,0.0001806747,0.00016596171,0.00028851704,0.00016911153,0.0005117385,0.00013992505,9.125283e-7],"category_scores_gemma":[0.000015422733,0.00015648188,0.00007966395,0.00077462546,0.000031905336,0.00021521507,0.00029189698,0.0004154484,7.6527533e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042602264,0.000021460504,0.0022582961,0.000010085435,0.000009082827,3.089478e-7,0.000038866416,0.59743977,0.0000010784764,0.01838814,0.00077098596,0.38105765],"study_design_scores_gemma":[0.00015968729,0.000051772968,0.0016267776,0.00006065147,0.0000052950154,0.0000038419766,0.0000044410435,0.9773965,0.000035044606,0.0020603945,0.018462168,0.00013345895],"about_ca_topic_score_codex":0.000020228224,"about_ca_topic_score_gemma":0.000022220309,"teacher_disagreement_score":0.8407325,"about_ca_system_score_codex":0.000050135153,"about_ca_system_score_gemma":0.000021512436,"threshold_uncertainty_score":0.6381146},"labels":[],"label_agreement":null},{"id":"W4407739855","doi":"10.1016/j.comnet.2025.111151","title":"Quantum internet building blocks state of research and development","year":2025,"lang":"en","type":"article","venue":"Computer Networks","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Advanced Research Projects Agency - Energy; U.S. Department of Defense; National Science Foundation","keywords":"Computer science; The Internet; Development (topology); State (computer science); Computer network; World Wide Web; Algorithm","score_opus":0.028744957231417522,"score_gpt":0.2991632960473617,"score_spread":0.2704183388159442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407739855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08068849,0.00031718783,0.91754633,0.00012726706,0.0004687732,0.00010854905,1.5560964e-7,0.00008036349,0.0006628835],"genre_scores_gemma":[0.9171208,0.000038059527,0.082438864,0.0002681444,0.000032369877,0.000008219835,0.0000015008211,0.0000034515563,0.00008859644],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988567,0.000056892866,0.0003484963,0.00023103073,0.00021661435,0.0002902373],"domain_scores_gemma":[0.9992151,0.0001599609,0.000067664936,0.000299577,0.00018937586,0.00006832072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006818265,0.000100448866,0.0001509932,0.00041091093,0.00010720627,0.00018860097,0.0006618505,0.000044199394,0.0000029790608],"category_scores_gemma":[0.000004304178,0.000093116454,0.00002618976,0.00076991564,0.00011222404,0.00021546167,0.0008543357,0.00022827151,0.0000034958853],"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.00001809167,0.000084004474,0.0035425893,0.00008519007,0.00008115253,0.000006203742,0.0021933499,0.006406476,0.000014609835,0.31373528,0.018538235,0.65529484],"study_design_scores_gemma":[0.00023756818,0.000064196814,0.005317599,0.00017207448,8.6357306e-7,0.0000034533248,0.0000103179855,0.96438503,0.0004935825,0.0075855316,0.021627927,0.00010187785],"about_ca_topic_score_codex":0.0000076209176,"about_ca_topic_score_gemma":0.000002707653,"teacher_disagreement_score":0.95797855,"about_ca_system_score_codex":0.000019191324,"about_ca_system_score_gemma":0.00006277033,"threshold_uncertainty_score":0.3797179},"labels":[],"label_agreement":null},{"id":"W4407821236","doi":"10.1016/j.comnet.2025.111115","title":"Spectrum efficiency through data: A methodology for evaluating local licensing strategies","year":2025,"lang":"en","type":"article","venue":"Computer Networks","topic":"ICT Impact and Policies","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":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Telecommunications","score_opus":0.11613301343842485,"score_gpt":0.38485429812623767,"score_spread":0.2687212846878128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407821236","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01128955,0.0016410011,0.981859,0.00015293644,0.0025742627,0.00021000733,0.0000049989653,0.00031716065,0.0019510585],"genre_scores_gemma":[0.88814336,0.000058734375,0.109625705,0.0005682741,0.0014420213,0.00000906136,0.000057386078,0.000033616856,0.00006183296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990402,0.00007596189,0.00023136685,0.00013876874,0.00006312113,0.00045060035],"domain_scores_gemma":[0.9987755,0.0007167161,0.000027053486,0.00042500542,0.00002689101,0.000028855055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004581434,0.00017002683,0.0002585887,0.000057616035,0.00012344692,0.00013041649,0.0003600961,0.000114903276,0.0000056014883],"category_scores_gemma":[0.000017522796,0.00016424876,0.000050609033,0.0002346296,0.00006355837,0.00021616922,0.00017906597,0.00019317711,0.0000033664833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009299537,0.0000069260627,0.000016119688,0.000056716228,0.00005632854,6.4467207e-7,0.00096894184,0.93043566,0.000030496225,0.00834316,0.011902182,0.048173554],"study_design_scores_gemma":[0.00026630145,0.00006266344,0.00019433426,0.00007378671,0.000038505128,0.0000062796985,0.00024651882,0.98986554,0.00011907423,0.0029944547,0.0059788367,0.00015368528],"about_ca_topic_score_codex":0.000024604282,"about_ca_topic_score_gemma":0.00002637876,"teacher_disagreement_score":0.8768538,"about_ca_system_score_codex":0.000038613405,"about_ca_system_score_gemma":0.00004782601,"threshold_uncertainty_score":0.669787},"labels":[],"label_agreement":null},{"id":"W4408709164","doi":"10.1016/j.comnet.2025.111216","title":"Efficient resource allocation in 5G massive MIMO-NOMA networks: Comparative analysis of SINR-aware power allocation and spatial correlation-based clustering","year":2025,"lang":"en","type":"article","venue":"Computer Networks","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":"Université TÉLUQ; Université du Québec à Montréal","funders":"Agence Nationale de la Recherche","keywords":"Noma; Computer science; Cluster analysis; Resource allocation; MIMO; Spatial correlation; Power (physics); Distributed computing; Computer network; Telecommunications; Artificial intelligence; Telecommunications link","score_opus":0.008562191614217068,"score_gpt":0.23449375505939823,"score_spread":0.22593156344518117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408709164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055163153,0.0010579089,0.94277364,0.0001065523,0.00018000935,0.00030320362,0.0000026780533,0.00025307268,0.00015979348],"genre_scores_gemma":[0.99427265,0.00004340151,0.005415943,0.00005389591,0.000021054473,0.000042635907,0.00013171096,0.000013641901,0.000005075597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988157,0.000091777285,0.00050254253,0.00026993456,0.000109315,0.00021071282],"domain_scores_gemma":[0.99870783,0.000467942,0.0001550714,0.00052847195,0.00010990356,0.000030793846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014710923,0.00020407977,0.00041158756,0.0005907518,0.00007492469,0.00003426114,0.0002854759,0.00018376386,0.000004598823],"category_scores_gemma":[0.000011879866,0.00023270778,0.000064838976,0.0015227393,0.000112082416,0.00005305193,0.00013168207,0.00029936963,5.736006e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021760417,0.0000331852,0.0034639789,0.000020945172,0.00015488104,6.5938707e-7,0.00023561256,0.97755307,0.000013832657,0.00027632556,0.000092470225,0.018133262],"study_design_scores_gemma":[0.00037354868,0.000023648345,0.045641698,0.00017413986,0.00006610539,1.6876217e-7,0.00012739123,0.9532288,0.00008278042,0.000013986441,0.00009646783,0.00017130845],"about_ca_topic_score_codex":0.000035370067,"about_ca_topic_score_gemma":0.00024222421,"teacher_disagreement_score":0.9391095,"about_ca_system_score_codex":0.0001578378,"about_ca_system_score_gemma":0.00001609734,"threshold_uncertainty_score":0.9489548},"labels":[],"label_agreement":null},{"id":"W4409450139","doi":"10.1016/j.comnet.2025.111286","title":"Exploring the unseen: A transformer-based unknown traffic detection scheme with contextual feature representation","year":2025,"lang":"en","type":"article","venue":"Computer Networks","topic":"Internet Traffic Analysis and Secure E-voting","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":"Artificial Intelligence in Medicine (Canada)","funders":"Defense Acquisition Program Administration; Korea Research Institute for Defense Technology Planning and Advancement","keywords":"Computer science; Scheme (mathematics); Transformer; Representation (politics); Artificial intelligence; Feature (linguistics); Feature learning; Pattern recognition (psychology); Voltage; Electrical engineering","score_opus":0.025876661494656665,"score_gpt":0.2356179155682298,"score_spread":0.20974125407357314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409450139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06415429,0.00016411692,0.93312883,0.0010255685,0.0008414042,0.00024516848,2.119979e-7,0.00025990664,0.00018049628],"genre_scores_gemma":[0.9899668,0.0000114527065,0.008707432,0.00074556406,0.00036410004,0.000052292817,0.0000074271557,0.000011909459,0.000132995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843013,0.0001474419,0.00027624477,0.0005328244,0.0002544175,0.00035893498],"domain_scores_gemma":[0.9991072,0.00022993155,0.00009837708,0.00036985113,0.0001377684,0.00005690962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030268513,0.00023241334,0.00025011177,0.00013989653,0.00034645505,0.00038848072,0.000716493,0.00008097777,0.0000026162602],"category_scores_gemma":[0.000005417248,0.00015553874,0.0001724231,0.0010876011,0.00007109559,0.00042624376,0.000051274685,0.00047119983,0.0000040314676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035835357,0.0000331075,0.00001797833,0.0000084657095,0.000091291906,0.000009031038,0.0005415515,0.68070537,0.000007840568,0.014157232,0.00055300037,0.30383927],"study_design_scores_gemma":[0.00056188885,0.00011879069,0.0004918552,0.000128844,0.000034130924,0.000009144304,0.000054782235,0.9952078,0.00014378483,0.000003987434,0.0030652082,0.00017982224],"about_ca_topic_score_codex":0.000006805883,"about_ca_topic_score_gemma":0.00020259494,"teacher_disagreement_score":0.92581254,"about_ca_system_score_codex":0.000055568198,"about_ca_system_score_gemma":0.000055164786,"threshold_uncertainty_score":0.6342686},"labels":[],"label_agreement":null},{"id":"W4409880074","doi":"10.1016/j.comnet.2025.111340","title":"MFTE: Multifactor and fuzzy trust evaluation for federated learning in mobile edge computing","year":2025,"lang":"en","type":"article","venue":"Computer Networks","topic":"Privacy-Preserving Technologies in Data","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":"University of British Columbia","funders":"Fundamental Research Funds for the Central Universities; Government of Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer science; Edge computing; Enhanced Data Rates for GSM Evolution; Fuzzy logic; Mobile edge computing; Artificial intelligence; Distributed computing","score_opus":0.027685458648088045,"score_gpt":0.3026497872618097,"score_spread":0.27496432861372166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409880074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054779883,0.0011957298,0.9400681,0.0011470816,0.0010882018,0.00089411536,0.0000013844156,0.00067806756,0.00014739942],"genre_scores_gemma":[0.7345317,0.000045595574,0.2649239,0.00022093192,0.0001253857,0.00008321798,0.000034580426,0.00001229341,0.000022383152],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980521,0.00018532951,0.00038317285,0.0007455755,0.00017505247,0.00045875832],"domain_scores_gemma":[0.9973343,0.0006902463,0.00013002494,0.0016415467,0.00015832332,0.000045574572],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0011678616,0.00021522261,0.00028851262,0.00024533988,0.00029654065,0.00046229688,0.004770914,0.00021571455,0.0000018946221],"category_scores_gemma":[0.0015190887,0.00022599062,0.000044297634,0.0007276512,0.000066330525,0.00038461853,0.02128678,0.00046536306,0.0000021381954],"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.000009444947,0.00003997585,0.005793628,0.000032110795,0.000021681011,0.000002880027,0.00008619145,0.06827363,0.000019405723,0.0004534814,0.021987632,0.90327996],"study_design_scores_gemma":[0.0009952813,0.00007479815,0.0076230383,0.00016158131,0.00000766263,0.0000028836894,0.00001391812,0.9805232,0.000060290706,0.008128605,0.0022010908,0.00020764634],"about_ca_topic_score_codex":0.000012176113,"about_ca_topic_score_gemma":0.00001351711,"teacher_disagreement_score":0.91224957,"about_ca_system_score_codex":0.00014219398,"about_ca_system_score_gemma":0.00008000703,"threshold_uncertainty_score":0.9866289},"labels":[],"label_agreement":null},{"id":"W4410119408","doi":"10.1016/j.comnet.2025.111314","title":"Covert channel by exploiting error-correcting codes","year":2025,"lang":"en","type":"article","venue":"Computer Networks","topic":"Advanced Steganography and Watermarking Techniques","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":"McMaster University","funders":"Army Research Office; Israel Science Foundation","keywords":"Computer science; Channel (broadcasting); Covert channel; Algorithm; Error detection and correction; Telecommunications; Speech recognition","score_opus":0.011182666594586195,"score_gpt":0.24643411604890295,"score_spread":0.23525144945431675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410119408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012739082,0.0007178636,0.9928656,0.0003442385,0.0017884494,0.00016405534,0.0000010804409,0.0012522204,0.0015925504],"genre_scores_gemma":[0.87296695,0.00006678912,0.12395082,0.0024464517,0.00030238627,0.00003935696,0.000011369684,0.000016206059,0.0001996528],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842983,0.00009075422,0.00030332227,0.00054379215,0.00013843871,0.0004938429],"domain_scores_gemma":[0.9989665,0.0002211474,0.000114331546,0.00055768056,0.0000704278,0.000069904665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028988536,0.00023532641,0.00026101776,0.00015496177,0.00036153744,0.000273924,0.0011044397,0.00012276322,0.0000011143737],"category_scores_gemma":[0.000008748154,0.00023354955,0.00011812748,0.0006946768,0.00005335853,0.0004964478,0.00070504815,0.0003298215,0.00000251478],"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.000018658664,0.00011797412,0.002052165,0.00004992423,0.00010116143,0.000036753107,0.0005845965,0.032187823,0.00010448051,0.018846657,0.15481293,0.79108685],"study_design_scores_gemma":[0.00021055005,0.000053012143,0.0001458589,0.00028717096,0.000006321694,0.000015224428,0.000011880925,0.97427726,0.0021128098,0.010063974,0.012491743,0.0003241949],"about_ca_topic_score_codex":0.00000806103,"about_ca_topic_score_gemma":0.0000013095735,"teacher_disagreement_score":0.94208944,"about_ca_system_score_codex":0.000037246326,"about_ca_system_score_gemma":0.000018332712,"threshold_uncertainty_score":0.95238745},"labels":[],"label_agreement":null},{"id":"W4410768835","doi":"10.1016/j.comnet.2025.111374","title":"CNN-DAG-Editor: A Convolutional Neural Network offloading analyzer with Multi-Objective Dynamic Adaptive Resource Competitive Swarm Optimization","year":2025,"lang":"en","type":"article","venue":"Computer Networks","topic":"IoT and Edge/Fog Computing","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; University of British Columbia","funders":"National Key Research and Development Program of China; China Scholarship Council; Fudan University","keywords":"Computer science; Swarm behaviour; Convolutional neural network; Spectrum analyzer; Resource (disambiguation); Artificial intelligence; Computer network; Telecommunications","score_opus":0.00728712140067076,"score_gpt":0.21962669476134247,"score_spread":0.21233957336067172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410768835","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00055339304,0.0006316375,0.9771759,0.00028222013,0.018963456,0.00048496373,0.0000014314076,0.0005376331,0.001369352],"genre_scores_gemma":[0.35271102,0.00002235341,0.62170213,0.0025619185,0.022349548,0.00005827301,0.00010657946,0.00007376933,0.00041440854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99650073,0.00036445516,0.00053715834,0.0011230669,0.00048824228,0.0009863725],"domain_scores_gemma":[0.9976452,0.0006218664,0.0003103302,0.000638913,0.0005985422,0.0001851255],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005496675,0.0005195069,0.0005578434,0.00029382683,0.0007994595,0.00042646297,0.0011404991,0.00023113553,0.000003573183],"category_scores_gemma":[0.00001761505,0.0004940971,0.00018129952,0.0017414513,0.00022716925,0.0005599768,0.0010070093,0.00061909185,0.000009511348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007764041,0.00007988895,0.0008376071,0.000010160095,0.0001925272,0.000028607386,0.00033430543,0.9599142,5.021065e-7,0.0027669976,0.02646263,0.009294943],"study_design_scores_gemma":[0.0011700208,0.00020002524,0.003931095,0.00038394384,0.000047978778,0.00002467626,0.000030785453,0.9874886,0.000002254659,0.00011861047,0.006079787,0.00052222447],"about_ca_topic_score_codex":0.000023538036,"about_ca_topic_score_gemma":0.000016700273,"teacher_disagreement_score":0.3554738,"about_ca_system_score_codex":0.00046500703,"about_ca_system_score_gemma":0.00025406285,"threshold_uncertainty_score":0.9997511},"labels":[],"label_agreement":null},{"id":"W4411020796","doi":"10.1016/j.comnet.2025.111425","title":"Metaversal intelligence: Unifying human-AI interactions in human-in-the-loop AIB-Metaverse","year":2025,"lang":"en","type":"article","venue":"Computer Networks","topic":"Anomaly Detection Techniques and Applications","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Metaverse; Human-in-the-loop; Loop (graph theory); Possible world; Human–computer interaction; Cognitive science; Epistemology; Virtual reality; Psychology; Philosophy","score_opus":0.02705932915303069,"score_gpt":0.3333167116682958,"score_spread":0.30625738251526513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411020796","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00414531,0.00007199943,0.9909015,0.0008799983,0.00044282712,0.00035202518,3.9260888e-7,0.00022996591,0.0029759519],"genre_scores_gemma":[0.9807426,0.000023874898,0.016395343,0.0020265589,0.00016030246,0.00011643339,0.000005893565,0.000008611931,0.000520411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839216,0.00015690854,0.00048546278,0.0004897578,0.00014304814,0.00033263196],"domain_scores_gemma":[0.99883145,0.00017433913,0.00009906677,0.0007901346,0.00006325156,0.00004173981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048664623,0.00019043108,0.00022639993,0.00044647968,0.0003404632,0.00030042208,0.0014403975,0.000083420346,0.000026623224],"category_scores_gemma":[0.000004361542,0.0001737736,0.00012481051,0.0017646181,0.000073427786,0.0003884486,0.00044411296,0.00068858685,0.000020198924],"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.000005689141,0.00045011792,0.002342107,0.000022937038,0.000057534948,0.00005423923,0.000992324,0.093523175,0.00012563942,0.73509973,0.015619708,0.15170681],"study_design_scores_gemma":[0.00024279923,0.0000575746,0.004240459,0.000118158765,0.000016012043,0.000018115636,0.00009956915,0.9464806,0.0003794241,0.019831581,0.028236529,0.0002792106],"about_ca_topic_score_codex":0.00013519934,"about_ca_topic_score_gemma":0.0002162784,"teacher_disagreement_score":0.97659725,"about_ca_system_score_codex":0.00011071072,"about_ca_system_score_gemma":0.000031448188,"threshold_uncertainty_score":0.7086282},"labels":[],"label_agreement":null},{"id":"W4412028175","doi":"10.1016/j.comnet.2025.111527","title":"A comparative analysis of indoor localization technologies","year":2025,"lang":"en","type":"article","venue":"Computer Networks","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Rehabilitation Institute; University of Toronto; University Health Network","funders":"Mitacs","keywords":"Computer science; Telecommunications","score_opus":0.007589706687746166,"score_gpt":0.23070494578989606,"score_spread":0.2231152391021499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412028175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005378318,0.0010030098,0.9899525,0.000025225403,0.00030339882,0.00011232122,0.0000029547343,0.0014800305,0.0017422499],"genre_scores_gemma":[0.9973444,0.00011971416,0.0024109697,0.00004526456,0.000013854767,0.000012553309,0.000032006243,0.000005136017,0.000016132748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993669,0.000013909396,0.0002632223,0.00013710867,0.00006662129,0.0001522407],"domain_scores_gemma":[0.9995438,0.000061404826,0.000039719416,0.00026708184,0.00007900234,0.000009009159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000052337724,0.00012262823,0.00036487883,0.0006569108,0.000042482323,0.000021871989,0.00024192095,0.00017497558,0.000007341096],"category_scores_gemma":[0.0000061505116,0.000117284086,0.000087161025,0.0028783814,0.0001020221,0.000052664836,0.00009053654,0.00012536734,0.0000017579678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027994151,0.000010712005,0.0046510245,0.000018631,0.0005762057,6.265029e-7,0.000075471624,0.963488,0.0000079033325,0.007287768,0.00411799,0.019762898],"study_design_scores_gemma":[0.00011928518,0.000012642425,0.0020659307,0.00003195644,0.00018179779,1.5443506e-7,0.00009178633,0.9927243,0.002409191,0.00043792865,0.0018250591,0.00009998292],"about_ca_topic_score_codex":0.0000025421837,"about_ca_topic_score_gemma":0.000011413067,"teacher_disagreement_score":0.99196607,"about_ca_system_score_codex":0.000034112232,"about_ca_system_score_gemma":0.000006925453,"threshold_uncertainty_score":0.47827062},"labels":[],"label_agreement":null},{"id":"W4412043538","doi":"10.1016/j.comnet.2025.111497","title":"HGC-LSTM: A graph neural network-based model for HO forecasting in mobile networks","year":2025,"lang":"en","type":"article","venue":"Computer Networks","topic":"Human Mobility and Location-Based Analysis","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; CHIST-ERA; Agence Nationale de la Recherche","keywords":"Computer science; Artificial neural network; Artificial intelligence; Graph; Machine learning; Theoretical computer science","score_opus":0.0298964832580121,"score_gpt":0.292543697360874,"score_spread":0.2626472141028619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412043538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01142356,0.0011031032,0.9846913,0.0003984339,0.0007401122,0.00096488005,0.0000027453457,0.00015632222,0.0005195489],"genre_scores_gemma":[0.99131256,0.000046314424,0.004269466,0.002091471,0.0014640171,0.00040694285,0.0000710604,0.000021372181,0.00031676836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974284,0.0003235129,0.0005569773,0.00058099476,0.00020992539,0.00090015767],"domain_scores_gemma":[0.99809664,0.0010337108,0.00014945037,0.00038700583,0.00018957134,0.00014363737],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015963496,0.0002475411,0.00043068617,0.00021568863,0.0009062558,0.00022071628,0.00054739875,0.00028700917,0.00002689958],"category_scores_gemma":[0.0000433844,0.0002691908,0.00032777787,0.0015098265,0.0002454816,0.00015248939,0.00008866263,0.00039182435,0.0000011597003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036785612,0.0000753894,0.0072442493,0.000017957425,0.000029094503,0.0000019678719,0.00043314966,0.9037002,4.7487294e-8,0.001815974,0.0052836994,0.08136154],"study_design_scores_gemma":[0.00057592796,0.000042566367,0.00047757637,0.00013058416,0.000050853374,9.906838e-8,0.00007076717,0.99313587,1.4546829e-7,0.0032396102,0.0020274252,0.00024856484],"about_ca_topic_score_codex":0.0005489791,"about_ca_topic_score_gemma":0.021616515,"teacher_disagreement_score":0.98042184,"about_ca_system_score_codex":0.00016232303,"about_ca_system_score_gemma":0.00025390423,"threshold_uncertainty_score":0.99997604},"labels":[],"label_agreement":null},{"id":"W4412434458","doi":"10.1016/j.comnet.2025.111513","title":"Continuous multi-task pre-training for malicious URL detection and webpage classification","year":2025,"lang":"en","type":"article","venue":"Computer Networks","topic":"Spam and Phishing Detection","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":"123 Certification (Canada)","funders":"National Natural Science Foundation of China","keywords":"Computer science; Task (project management); Training (meteorology); Information retrieval; Web page; Training set; Artificial intelligence; Machine learning; Data mining; World Wide Web","score_opus":0.024987624030681006,"score_gpt":0.26383518699554676,"score_spread":0.23884756296486576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412434458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017147502,0.00036355006,0.9787637,0.0002392888,0.0026094967,0.00042077416,8.7524955e-7,0.00036228375,0.00009254264],"genre_scores_gemma":[0.9454301,0.000023396231,0.053343926,0.0004820734,0.0004480595,0.0000734338,0.0000046475816,0.000010360953,0.0001839891],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988713,0.00007087587,0.00023398575,0.00047758108,0.000077735545,0.0002685184],"domain_scores_gemma":[0.9991931,0.00020574249,0.000104617466,0.00035221592,0.0000850811,0.000059280293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003332513,0.00014991185,0.00018076635,0.00012714826,0.00028431334,0.00033288964,0.00033208093,0.00015547933,5.005162e-7],"category_scores_gemma":[0.000019715615,0.00015602884,0.000060619852,0.00030596368,0.000037488193,0.00026553823,0.00014062751,0.00017742552,0.0000017699867],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023350687,0.00003080652,0.00035774361,0.000022871289,0.000031408414,0.000001398402,0.0006251941,0.004047966,0.00077826635,0.002645758,0.0008936233,0.99054164],"study_design_scores_gemma":[0.0005883535,0.00009655494,0.028159562,0.00004894521,0.000013128206,0.0000127240755,0.000010946302,0.9626567,0.00016726369,0.0007508578,0.0073446343,0.00015032754],"about_ca_topic_score_codex":0.000016431262,"about_ca_topic_score_gemma":0.00003615158,"teacher_disagreement_score":0.9903913,"about_ca_system_score_codex":0.000043850625,"about_ca_system_score_gemma":0.000022661712,"threshold_uncertainty_score":0.6362671},"labels":[],"label_agreement":null},{"id":"W4412987964","doi":"10.1016/j.comnet.2025.111587","title":"Resource optimization for minimizing latency and cost in UAV-assisted mobile edge computing (MEC) networks","year":2025,"lang":"en","type":"article","venue":"Computer Networks","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":2,"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; Mobile edge computing; Latency (audio); Edge computing; Enhanced Data Rates for GSM Evolution; Computer network; Distributed computing; Real-time computing; Telecommunications","score_opus":0.006639410913375636,"score_gpt":0.21757127381386937,"score_spread":0.21093186290049373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412987964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003026822,0.0012994576,0.9934902,0.00003888862,0.00037151578,0.00085699145,0.0000018660982,0.00024873397,0.00066549575],"genre_scores_gemma":[0.7132698,0.00038995815,0.28471413,0.00028451046,0.00060159195,0.00028541958,0.00030720822,0.00006781427,0.00007955333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899703,0.000027478049,0.00035708444,0.00027724868,0.000044796616,0.00029636617],"domain_scores_gemma":[0.99944466,0.00020045397,0.00005046879,0.00020403648,0.000051177427,0.000049173264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017502153,0.00017388265,0.00022153788,0.00014157145,0.00013922503,0.00011207539,0.0001348856,0.00017239891,0.000003959458],"category_scores_gemma":[0.000003912554,0.00019965849,0.000039183,0.0005360517,0.00002557568,0.00008582477,0.00008228536,0.00017650168,4.0233277e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006800909,0.00001732073,0.0003983409,0.000032333126,0.000014755834,5.121137e-7,0.000073989395,0.8575384,0.0000010718489,0.00019458974,0.0036626265,0.13805926],"study_design_scores_gemma":[0.00063357694,0.000017223285,0.001282443,0.00015356355,0.000016909162,0.0000020943264,0.000020375812,0.9915334,0.0000024575118,0.0000196926,0.006139667,0.00017858471],"about_ca_topic_score_codex":0.00000399809,"about_ca_topic_score_gemma":0.00000775561,"teacher_disagreement_score":0.710243,"about_ca_system_score_codex":0.00006826825,"about_ca_system_score_gemma":0.000008587766,"threshold_uncertainty_score":0.81418365},"labels":[],"label_agreement":null},{"id":"W4413343888","doi":"10.1016/j.comnet.2025.111601","title":"ZETROS: A zero-trust IoT network security framework using distributed blacklisting, trust scoring and smart contracts","year":2025,"lang":"en","type":"article","venue":"Computer Networks","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Privy Council Office","funders":"Business Finland","keywords":"Computer science; Blacklisting; Internet of Things; Computer security; Computer network; Computational trust; Trust management (information system); Reputation; Law","score_opus":0.009602886607560849,"score_gpt":0.24442572360472625,"score_spread":0.2348228369971654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413343888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08785951,0.0018234808,0.9071664,0.0007293542,0.0011854051,0.0003992072,0.000006101416,0.00067521265,0.00015532652],"genre_scores_gemma":[0.862157,0.00006744849,0.13627326,0.0009255227,0.0005027516,0.00003014309,0.00001257858,0.000016744427,0.000014588359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973377,0.000121408004,0.0005402486,0.00096640794,0.00018030746,0.00085393403],"domain_scores_gemma":[0.99777335,0.00043144068,0.00023983662,0.0012222284,0.00015339414,0.00017974077],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058729394,0.0003822097,0.0005187212,0.0001434386,0.0008088954,0.00047216838,0.0012504477,0.00056980405,0.0000043860905],"category_scores_gemma":[0.000056041095,0.00040834042,0.00010664706,0.0015076562,0.00029042608,0.00016555765,0.0014637163,0.00110635,0.00000353888],"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.000047046957,0.0003246965,0.0830758,0.00009488275,0.00028268897,0.000079846475,0.0003086683,0.14021733,0.000014941934,0.66928536,0.016411789,0.08985697],"study_design_scores_gemma":[0.0003601974,0.000030955747,0.008779058,0.00028356764,0.00003123148,0.000029950037,0.000004344336,0.90810984,0.000018440038,0.07442438,0.0075872988,0.00034075277],"about_ca_topic_score_codex":0.00004819467,"about_ca_topic_score_gemma":0.000015714377,"teacher_disagreement_score":0.7742975,"about_ca_system_score_codex":0.0001041673,"about_ca_system_score_gemma":0.00007550346,"threshold_uncertainty_score":0.99983686},"labels":[],"label_agreement":null},{"id":"W4413920164","doi":"10.1016/j.comnet.2025.111657","title":"DETROIT: Decomposition techniques for a hierarchy of 6G network intent management functions","year":2025,"lang":"en","type":"article","venue":"Computer Networks","topic":"Software-Defined Networks and 5G","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":"Artificial Intelligence in Medicine (Canada)","funders":"H2020 Excellent Science; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; European Commission","keywords":"Computer science; Decomposition; Hierarchy; Network management; Computer network","score_opus":0.007502420502444573,"score_gpt":0.25223456090748597,"score_spread":0.2447321404050414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413920164","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016967178,0.0010383939,0.9934216,0.0004961225,0.0023197432,0.0007836357,0.0000023298614,0.00053399196,0.0012344692],"genre_scores_gemma":[0.17603569,0.0001692258,0.8196415,0.0021557892,0.0010737178,0.00038060837,0.00004694288,0.000025952553,0.00047058493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981878,0.0000714317,0.00050805975,0.0005551534,0.0001616139,0.00051594595],"domain_scores_gemma":[0.9984793,0.00033161478,0.00016147201,0.00076082576,0.00018424257,0.000082525905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000384999,0.00024310607,0.00034769322,0.00023146711,0.00025207078,0.00014558609,0.0009217836,0.00013706968,0.0000041528338],"category_scores_gemma":[0.0000041045882,0.00023928136,0.00023655848,0.001019022,0.00006212643,0.00019544971,0.00068985304,0.00020050895,0.0000031346012],"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.000046019784,0.00011910182,0.00073057564,0.000065993685,0.00016454532,0.0000049820987,0.000029037732,0.08963002,0.0000023108485,0.11196195,0.15132076,0.6459247],"study_design_scores_gemma":[0.0005126194,0.00026646047,0.002656348,0.00045369114,0.000056756282,0.0000071588934,0.0000035474268,0.92632073,0.000042599608,0.0194474,0.049966104,0.00026660375],"about_ca_topic_score_codex":0.0000052889663,"about_ca_topic_score_gemma":0.0000053634835,"teacher_disagreement_score":0.83669066,"about_ca_system_score_codex":0.00008132996,"about_ca_system_score_gemma":0.000028122513,"threshold_uncertainty_score":0.97576106},"labels":[],"label_agreement":null},{"id":"W4414106880","doi":"10.1016/j.comnet.2025.111679","title":"Energy efficient resource allocation and trajectory optimization method for secure digital twin-enabled UAV-assisted MEC in 6G networks","year":2025,"lang":"en","type":"article","venue":"Computer Networks","topic":"UAV Applications and Optimization","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":"École de Technologie Supérieure","funders":"King Saud University","keywords":"Correctness; Efficient energy use; Energy consumption; Mobile device; Mobile edge computing; Edge device; Enhanced Data Rates for GSM Evolution; Computation; Resource allocation; Quality of service","score_opus":0.004126109852434968,"score_gpt":0.20171763998627468,"score_spread":0.1975915301338397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414106880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054896227,0.0008311793,0.99713826,0.00006254042,0.0002591001,0.0003824103,0.0000030347555,0.00021659001,0.00055792346],"genre_scores_gemma":[0.664593,0.00015474389,0.33339983,0.00029091243,0.00042552664,0.0002969898,0.00060929393,0.000067588655,0.00016211656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990168,0.000039291164,0.00032297656,0.00030460078,0.00006582178,0.00025047563],"domain_scores_gemma":[0.9994245,0.00018821095,0.00004946901,0.00021925081,0.000066139175,0.000052437925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016993292,0.0001848734,0.00020870124,0.00017043918,0.00009213713,0.00015578265,0.00012455886,0.00019680898,0.0000029121159],"category_scores_gemma":[0.0000043455457,0.00020250004,0.000047189467,0.0005882303,0.000022719658,0.00009302196,0.000049116115,0.00013113458,1.825375e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015620519,0.000031077,0.000030863965,0.00002628633,0.000027258613,3.2520404e-7,0.00006487845,0.9145999,0.0000031884874,0.0011086696,0.0023983058,0.08169364],"study_design_scores_gemma":[0.0006031474,0.000022167302,0.00028240553,0.00006817728,0.000023245078,0.0000018583321,0.000015085958,0.9924532,0.000010352923,0.00004108786,0.0062969,0.00018237758],"about_ca_topic_score_codex":0.0000053363024,"about_ca_topic_score_gemma":0.0000093192075,"teacher_disagreement_score":0.664044,"about_ca_system_score_codex":0.00009682178,"about_ca_system_score_gemma":0.000014619387,"threshold_uncertainty_score":0.8257712},"labels":[],"label_agreement":null},{"id":"W4414518972","doi":"10.1016/j.comnet.2025.111739","title":"Adversarial attack and defence of federated learning-based network traffic classification in edge computing environment","year":2025,"lang":"en","type":"article","venue":"Computer Networks","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":1,"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":"University of Waterloo; Universiti Malaya; Ministry of Higher Education, Malaysia","keywords":"Backdoor; Adversarial system; Scalability; Enhanced Data Rates for GSM Evolution; Attack surface; Class (philosophy); Attack model; Edge device; Security domain","score_opus":0.013098955191162697,"score_gpt":0.2304691209984866,"score_spread":0.2173701658073239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414518972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09752735,0.00038874726,0.9011341,0.00013735409,0.0004899617,0.00015440103,1.3025208e-7,0.00008034104,0.000087653716],"genre_scores_gemma":[0.98468435,0.000019568195,0.01481679,0.00021316457,0.00021838807,0.000003558645,0.000011905199,0.000008320873,0.000023941471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803215,0.00027153385,0.000573899,0.0005697044,0.00017367025,0.0003790587],"domain_scores_gemma":[0.9991324,0.00032590958,0.00023626555,0.00019684288,0.000050276205,0.000058312202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006251319,0.00020753857,0.0003698278,0.00014067834,0.00017410275,0.00015747949,0.0004686818,0.00014481672,0.0000043100995],"category_scores_gemma":[0.000010660729,0.00021211855,0.000094263676,0.0005637624,0.000086604676,0.00011482131,0.00027259428,0.00039565406,0.000002988293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001342555,0.000055675937,0.0018296335,0.000014933584,0.00002807648,0.0000045096326,0.00017560867,0.9295686,0.0000017218869,0.005684964,0.00052499736,0.062097877],"study_design_scores_gemma":[0.00059088424,0.000071790084,0.008113905,0.00019704015,0.000014884056,0.0000013555665,0.0000142625595,0.9902245,0.000003204027,0.000005413259,0.0005920729,0.00017070209],"about_ca_topic_score_codex":0.000004646431,"about_ca_topic_score_gemma":0.000021817445,"teacher_disagreement_score":0.887157,"about_ca_system_score_codex":0.00006994739,"about_ca_system_score_gemma":0.00005212624,"threshold_uncertainty_score":0.86499435},"labels":[],"label_agreement":null},{"id":"W4415828031","doi":"10.1016/j.comnet.2025.111825","title":"Novel secure user scheduling for uplink wireless networks against potential eavesdroppers","year":2025,"lang":"en","type":"article","venue":"Computer Networks","topic":"Wireless Communication Security Techniques","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":"Nexen (Canada)","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea; Ministry of Science ICT and Future Planning; National Research Foundation of Korea; Ministry of Science, ICT and Future Planning","keywords":"Telecommunications link; Secrecy; Scheduling (production processes); Base station; Channel state information; User equipment; Wireless; Wireless network","score_opus":0.007955866449695299,"score_gpt":0.2290825939709418,"score_spread":0.2211267275212465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415828031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009148202,0.0015041403,0.9846886,0.00026576457,0.0017600857,0.0005980796,0.000005367038,0.0016139768,0.00041580052],"genre_scores_gemma":[0.8543382,0.00044860624,0.14320439,0.0007457065,0.00085081323,0.00012876389,0.00013634408,0.00008905498,0.000058062695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844676,0.000033107197,0.00048331468,0.00036843194,0.00011620832,0.0005521497],"domain_scores_gemma":[0.99867284,0.00016686982,0.00007288705,0.00083619484,0.00014672954,0.00010449448],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024349047,0.00035070523,0.00039633276,0.0001674353,0.00022322469,0.00019983397,0.0008673209,0.00043195923,0.000005494187],"category_scores_gemma":[0.000004735141,0.00040525116,0.0002094253,0.00041576006,0.000074952586,0.00017590675,0.00034589207,0.00070660835,0.0000022849606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012087317,0.000036357353,0.00006854631,0.00005719927,0.00012180193,0.0000016243928,0.00005423057,0.9266219,0.00019381223,0.004243605,0.012008093,0.05658073],"study_design_scores_gemma":[0.00057582674,0.000016901056,0.0001635699,0.00029577396,0.000029908488,0.0000030660808,0.000010997098,0.9854108,0.00016552316,0.00012463755,0.01282819,0.00037479072],"about_ca_topic_score_codex":0.000004250505,"about_ca_topic_score_gemma":0.000009828311,"teacher_disagreement_score":0.84519005,"about_ca_system_score_codex":0.0001138237,"about_ca_system_score_gemma":0.000026331503,"threshold_uncertainty_score":0.99983996},"labels":[],"label_agreement":null},{"id":"W4416373354","doi":"10.1016/j.comnet.2025.111867","title":"Twin delayed deep deterministic policy gradient-based physical layer security and SEE in RIS-aided UAV communication","year":2025,"lang":"en","type":"article","venue":"Computer Networks","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"Ericsson (Canada); Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Physical layer; Reinforcement learning; Channel state information; Beamforming; Wireless; Channel (broadcasting); Secrecy; Wireless network; Wireless sensor network","score_opus":0.007173095657860164,"score_gpt":0.2513448086381928,"score_spread":0.24417171298033263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416373354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24458428,0.0014830183,0.75221,0.00027981112,0.00009772538,0.0002314792,0.000002376984,0.00073632126,0.00037496677],"genre_scores_gemma":[0.9874543,0.00031414058,0.011901426,0.00016506543,0.000049428738,0.000061736726,0.000026871978,0.000022775375,0.0000042574807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990732,0.00008970699,0.00026420553,0.00019831538,0.00006388118,0.00031067745],"domain_scores_gemma":[0.9985693,0.0003891341,0.000047031328,0.0009149032,0.00003293029,0.00004672111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010001452,0.00019351536,0.0002617824,0.00023301947,0.00009078341,0.000048565566,0.00055775786,0.00014083939,0.0000011337615],"category_scores_gemma":[0.000027387112,0.00021663931,0.000042252406,0.000551582,0.00013886488,0.00010265221,0.0003446154,0.00049774226,0.0000029986888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001287334,0.00007705845,0.000945127,0.00004124173,0.000027383472,0.0000030946185,0.00039030632,0.8798218,0.000032672975,0.0049151443,0.00031395545,0.11341939],"study_design_scores_gemma":[0.0005027215,0.000024680628,0.003058134,0.00009785808,0.000007453086,0.000001396959,0.000029539833,0.988184,0.00016661428,0.00711928,0.000628539,0.00017983526],"about_ca_topic_score_codex":0.000024418965,"about_ca_topic_score_gemma":0.00011535646,"teacher_disagreement_score":0.74287003,"about_ca_system_score_codex":0.00014890183,"about_ca_system_score_gemma":0.00001891167,"threshold_uncertainty_score":0.88342947},"labels":[],"label_agreement":null},{"id":"W4416427222","doi":"10.1016/j.comnet.2025.111877","title":"Dynamic network management games for optimal adaptive defense decisions against malware propagation in IoT and ad-Hoc networks","year":2025,"lang":"en","type":"article","venue":"Computer Networks","topic":"Software-Defined Networks and 5G","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":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Malware; Network topology; Adversary; Node (physics); Stochastic game; Network management; Dynamic network analysis; Adversarial system; Game theory; Wireless network","score_opus":0.010172169109103672,"score_gpt":0.23474031910102122,"score_spread":0.22456814999191754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416427222","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004176454,0.012559158,0.97869194,0.00036433153,0.002056976,0.0015673848,0.0000034379698,0.0003791314,0.00020121316],"genre_scores_gemma":[0.39613423,0.0033015138,0.5972828,0.0020075012,0.000464613,0.00043792478,0.000066845685,0.000058891073,0.00024566447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964792,0.00017731995,0.00073881494,0.0012564029,0.00025372766,0.0010945112],"domain_scores_gemma":[0.9974714,0.0010636939,0.00021652042,0.0009014957,0.00015800969,0.00018890623],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006937315,0.000515212,0.0005884314,0.00031292147,0.0004216394,0.00044153992,0.0010443459,0.0003191837,0.0000020705202],"category_scores_gemma":[0.000016085161,0.0005068379,0.00018540339,0.0015077102,0.000109818444,0.0002866084,0.0012856973,0.0004992898,0.0000035144221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080140744,0.00004504887,0.00032415707,0.0000131112565,0.000056036617,0.000028403283,0.000054415766,0.55340564,4.560196e-8,0.0065407925,0.0072387615,0.43221346],"study_design_scores_gemma":[0.0014606498,0.00020535459,0.008975937,0.0008300417,0.00003856073,0.000012077688,0.000020203559,0.9787797,2.3494727e-7,0.0034475294,0.0057425993,0.0004871207],"about_ca_topic_score_codex":0.0000021712715,"about_ca_topic_score_gemma":0.00006036224,"teacher_disagreement_score":0.43172634,"about_ca_system_score_codex":0.00017312293,"about_ca_system_score_gemma":0.00005964691,"threshold_uncertainty_score":0.99973834},"labels":[],"label_agreement":null},{"id":"W4416529936","doi":"10.1016/j.comnet.2025.111872","title":"Detecting application transitions and identifying application types for intent-based network assurance: A machine learning perspective","year":2025,"lang":"en","type":"article","venue":"Computer Networks","topic":"Software-Defined Networks and 5G","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":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Autoencoder; Classifier (UML); Random forest; Edge device; Pipeline (software); Softmax function; Workload; Enhanced Data Rates for GSM Evolution; Identification (biology)","score_opus":0.009792187031828846,"score_gpt":0.253770590823932,"score_spread":0.24397840379210314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416529936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042134483,0.00268134,0.99402297,0.0011102394,0.0005014949,0.0006989563,0.0000015488886,0.00048367563,0.000078450656],"genre_scores_gemma":[0.8469724,0.000052818887,0.15133607,0.0007096599,0.0005396024,0.00031927272,0.00002933913,0.000019342044,0.000021487791],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984481,0.000089641726,0.0002972228,0.00066426606,0.000112939604,0.00038783465],"domain_scores_gemma":[0.9985387,0.00064314064,0.00014945019,0.00036942068,0.00022944609,0.000069863476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043487755,0.0002121058,0.0002539948,0.00011918254,0.0006471313,0.00028447498,0.0004053078,0.0001313571,7.885252e-7],"category_scores_gemma":[0.000027099091,0.0002236308,0.00010641305,0.00081641256,0.00004772633,0.00021054107,0.00014109474,0.00033630055,0.0000020670677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029061133,0.000033571614,0.0017256584,0.000047082747,0.000056770827,9.564242e-7,0.00018890787,0.663309,0.000025359363,0.034367193,0.00044579635,0.29977068],"study_design_scores_gemma":[0.000548,0.00005878189,0.00220262,0.00013992416,0.000035315465,0.000004915962,0.000018746898,0.9879202,0.000017741115,0.0069763116,0.0018708528,0.00020657411],"about_ca_topic_score_codex":0.000035746856,"about_ca_topic_score_gemma":0.000072341834,"teacher_disagreement_score":0.84655106,"about_ca_system_score_codex":0.00008559826,"about_ca_system_score_gemma":0.000043432632,"threshold_uncertainty_score":0.9119399},"labels":[],"label_agreement":null},{"id":"W7117580558","doi":"10.1016/j.comnet.2025.111963","title":"CAN-BiGRUBERT: Unveiling automotive vehicle intruders by profiling and characterizing anomalies in controller area network","year":2025,"lang":"en","type":"article","venue":"Computer Networks","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Mitacs; Canada Research Chairs","keywords":"Intrusion detection system; Profiling (computer programming); Identifier; Encoder; Automotive industry; Intrusion; Exploit; CAN bus; Controller (irrigation)","score_opus":0.0034739580682152113,"score_gpt":0.1774685711376597,"score_spread":0.1739946130694445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117580558","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6604347,0.013833712,0.3190153,0.0008563226,0.0026229254,0.0011932593,0.000012224003,0.0010678488,0.0009636685],"genre_scores_gemma":[0.99458593,0.0003669482,0.0027764116,0.0013636532,0.00064933364,0.00006333684,0.00006526925,0.00006972807,0.000059370384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770755,0.000111365516,0.0005477305,0.0005268097,0.00013892968,0.000967617],"domain_scores_gemma":[0.9991176,0.00028883884,0.00007351788,0.000285161,0.000059277696,0.00017558536],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003787398,0.00043770947,0.0006283368,0.0001502966,0.00015423601,0.00020487234,0.00026835562,0.00028823697,0.000007983952],"category_scores_gemma":[0.000016649534,0.00047683084,0.000083929066,0.00060704665,0.00009115428,0.00019063719,0.00020316239,0.000729362,0.0000024695505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002558827,0.000017488663,0.010198635,0.000051464005,0.00014595415,0.000026909593,0.0001601872,0.9614623,0.0001519822,0.00019957617,0.0068848245,0.020675084],"study_design_scores_gemma":[0.0011203878,0.000027204034,0.0050692074,0.00045253662,0.000029645087,0.000007737552,0.000028536906,0.99064755,0.00010775643,0.00020921552,0.0018855145,0.00041472455],"about_ca_topic_score_codex":0.00002417579,"about_ca_topic_score_gemma":0.00009092535,"teacher_disagreement_score":0.3341512,"about_ca_system_score_codex":0.00017843265,"about_ca_system_score_gemma":0.00003459244,"threshold_uncertainty_score":0.9997683},"labels":[],"label_agreement":null}]}