{"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060543385,0.00019328823,0.9855568,0.00025916108,0.00008437569,0.0000853755,0.0002791405,0.0034764125,0.0040112007],"genre_scores_gemma":[0.114842325,0.0003471296,0.8807846,0.00013581493,0.00005740722,0.000419825,0.00032457034,0.00082507066,0.0022633611],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994592,0.00024069293,0.000040621657,0.000073583265,0.0001366402,0.00004928199],"domain_scores_gemma":[0.99788874,0.0010934449,0.00010486925,0.00033656796,0.0004078732,0.00016840053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013064127,0.0014197547,0.00062482746,0.0030366625,0.0011553108,0.0036742243,0.0016401354,0.0012192857,0.010081184],"category_scores_gemma":[0.0061273095,0.0006272308,0.00089269,0.0017689419,0.001076514,0.0030432136,0.0023707263,0.0016548069,0.0010062184],"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.00075371546,0.00043074615,0.012794212,0.001690865,0.0003691116,0.0008210142,0.010320069,0.061888803,0.063860096,0.24064983,0.045992766,0.56042886],"study_design_scores_gemma":[0.0002902542,0.00020467285,0.0070198057,0.00035565975,0.00036441116,0.0011366418,0.0024008097,0.5545128,0.027339354,0.23003079,0.1760702,0.0002745732],"about_ca_topic_score_codex":0.004811942,"about_ca_topic_score_gemma":0.007042283,"teacher_disagreement_score":0.010081184,"about_ca_system_score_codex":0.000536808,"about_ca_system_score_gemma":0.0009804771,"threshold_uncertainty_score":0.033724904},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033195363,0.000023817574,0.9938824,0.00007109211,0.000011028411,0.000061881045,0.0002462835,0.0018193654,0.00056454726],"genre_scores_gemma":[0.15404132,0.0001034787,0.839476,0.00023085355,0.0000360853,0.00047646504,0.0011994642,0.0006714842,0.0037648808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705195,0.00065462786,0.00032229393,0.0006246398,0.0011261894,0.00022026147],"domain_scores_gemma":[0.9907601,0.0045066117,0.0006609921,0.0025140634,0.0012865314,0.00027167916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026131684,0.0014872215,0.0010433159,0.0020141716,0.0007664874,0.0032113942,0.0038649968,0.0025636214,0.0042232713],"category_scores_gemma":[0.009442938,0.0013743915,0.0025301834,0.0013055961,0.0015117222,0.006470864,0.0026769408,0.0024042444,0.0015929366],"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.00094664114,0.00055674074,0.01027683,0.0006492867,0.00040749175,0.0017583804,0.0011938778,0.37723204,0.035291854,0.3801465,0.010269501,0.18127084],"study_design_scores_gemma":[0.000041020132,0.00007157996,0.00024384845,0.000025877882,0.00011957883,0.00021299552,0.00004764108,0.92344004,0.0070788786,0.063250504,0.0054263147,0.000041731757],"about_ca_topic_score_codex":0.0069006192,"about_ca_topic_score_gemma":0.009735088,"teacher_disagreement_score":0.0069006192,"about_ca_system_score_codex":0.0011566894,"about_ca_system_score_gemma":0.0018819011,"threshold_uncertainty_score":0.014128208},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018591538,0.019845683,0.9154721,0.014927036,0.00079765846,0.00010368552,0.00015799949,0.001589352,0.028514996],"genre_scores_gemma":[0.5128636,0.025470896,0.44256368,0.0032633462,0.0017038458,0.00027177503,0.00088365783,0.0010032635,0.011976008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99290484,0.003013559,0.0006601438,0.00071001024,0.002192327,0.00051911286],"domain_scores_gemma":[0.98587453,0.008515944,0.00068072247,0.0020066248,0.0023484768,0.0005736879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013432407,0.0009937789,0.001362193,0.001914091,0.0011067694,0.01027007,0.0034478516,0.0025281985,0.004100554],"category_scores_gemma":[0.013289861,0.0009190194,0.0010345081,0.0021882942,0.008717691,0.018205069,0.0028093609,0.0047656777,0.0011787736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006359335,0.00009431278,0.00023244316,0.0002894684,0.000012797816,0.00003035456,0.00025785118,0.00516348,0.0006000591,0.94749403,0.0015925083,0.04416911],"study_design_scores_gemma":[0.00008419523,0.00009570861,0.00013796768,0.00045988944,0.000024125924,0.00013597489,0.0003319918,0.051547542,0.0036347664,0.8819817,0.06151856,0.000047701185],"about_ca_topic_score_codex":0.004627956,"about_ca_topic_score_gemma":0.0026001623,"teacher_disagreement_score":0.013432407,"about_ca_system_score_codex":0.004702109,"about_ca_system_score_gemma":0.0058248565,"threshold_uncertainty_score":0.071038246},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004462529,0.0007270276,0.98486763,0.00021932078,0.00006133637,0.000088506,0.00002959845,0.00034410987,0.009199948],"genre_scores_gemma":[0.5254255,0.002544796,0.45417318,0.00034928668,0.0006080628,0.00031722855,0.00012916597,0.00040811262,0.016044602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968599,0.0009756801,0.000112024914,0.00032033157,0.0014622422,0.00026976268],"domain_scores_gemma":[0.9980959,0.00045113088,0.0001310744,0.00033210134,0.0008952228,0.000094496725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018806341,0.0012689142,0.0015238741,0.00093718246,0.0011223316,0.0036812187,0.0025753386,0.0011993969,0.005200588],"category_scores_gemma":[0.0041310578,0.0014877829,0.0007895409,0.00088287215,0.00069749384,0.0033464215,0.0021405332,0.0014937475,0.0016244117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021542859,0.00022863562,0.0020462016,0.00038380278,0.00025774367,0.00022548984,0.00039127728,0.43700123,0.030290676,0.116806135,0.004873582,0.4072798],"study_design_scores_gemma":[0.000019954998,0.0002092823,0.00040516572,0.00006844609,0.00014509757,0.00021723183,0.00013185329,0.9517802,0.0097986935,0.026062183,0.011134102,0.000027820313],"about_ca_topic_score_codex":0.0020203767,"about_ca_topic_score_gemma":0.0046905763,"teacher_disagreement_score":0.005200588,"about_ca_system_score_codex":0.0024418996,"about_ca_system_score_gemma":0.0019250893,"threshold_uncertainty_score":0.017717302},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090394944,0.0022092732,0.89793754,0.0018280061,0.00021314554,0.00017233811,0.00033974266,0.00033734512,0.006567684],"genre_scores_gemma":[0.81177324,0.0022029895,0.17583062,0.0002461439,0.00049971486,0.00020916933,0.00043917866,0.00022022614,0.008578773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971522,0.0014104358,0.00013563427,0.00040609238,0.00051091757,0.0003847608],"domain_scores_gemma":[0.9912917,0.0065602087,0.0006832942,0.0007420565,0.00038983606,0.00033293825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00445447,0.0013459624,0.0028530916,0.0012110306,0.0013473211,0.002392977,0.0036357103,0.003663061,0.0036364512],"category_scores_gemma":[0.015716892,0.0019073698,0.0012903835,0.0034520372,0.0024273759,0.0061782836,0.0031377266,0.0014072325,0.0005641214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047198625,0.00014060107,0.0012119587,0.00031056366,0.00015685287,0.0003596769,0.00018342944,0.878588,0.00163549,0.051989608,0.006398453,0.058553424],"study_design_scores_gemma":[0.00011032764,0.000122044265,0.00045197376,0.00002437591,0.000076757344,0.00024305728,0.00015043603,0.92373884,0.0009147438,0.07248719,0.0016531866,0.000027195783],"about_ca_topic_score_codex":0.0033958228,"about_ca_topic_score_gemma":0.0030258521,"teacher_disagreement_score":0.00445447,"about_ca_system_score_codex":0.0012022972,"about_ca_system_score_gemma":0.00146063,"threshold_uncertainty_score":0.023557723},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3020109,0.007738603,0.36564967,0.019365294,0.00063016446,0.0004249975,0.0015128637,0.00019368243,0.30247387],"genre_scores_gemma":[0.96217114,0.0023676166,0.0070567955,0.00029910216,0.00026541526,0.0001544891,0.00017656338,0.00005991195,0.027449057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992773,0.00030188306,0.000015807362,0.000045949713,0.0002021508,0.00015689337],"domain_scores_gemma":[0.9973985,0.001971408,0.00015565306,0.00006799538,0.00025667186,0.00014976664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002148892,0.00071234524,0.0007123699,0.0012145865,0.0011468754,0.0026555627,0.0014213205,0.0018215048,0.010500327],"category_scores_gemma":[0.0062703807,0.0007914912,0.0009707142,0.0013050255,0.0017845155,0.0039009692,0.00096671423,0.0021578623,0.00047972708],"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.0000810043,0.0000844723,0.0008642295,0.00007297409,0.0000321227,0.00018513955,0.000044562243,0.47117212,0.0006657772,0.515834,0.0038641635,0.0070994026],"study_design_scores_gemma":[0.000019247436,0.000036467438,0.0011128174,0.000024989165,0.00002447596,0.00006200055,0.00008307802,0.8545257,0.00016806166,0.14105697,0.0028636043,0.00002263218],"about_ca_topic_score_codex":0.011045658,"about_ca_topic_score_gemma":0.012622471,"teacher_disagreement_score":0.011045658,"about_ca_system_score_codex":0.005806572,"about_ca_system_score_gemma":0.0031896299,"threshold_uncertainty_score":0.042129755},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03859606,0.00041873075,0.94707245,0.00033712818,0.00055739976,0.00039287357,0.00015018287,0.00528401,0.0071912957],"genre_scores_gemma":[0.6226376,0.00025985113,0.36762893,0.0003402747,0.0002411931,0.00026357532,0.00023126973,0.00016821973,0.008229003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953413,0.000073399046,0.00003155526,0.00013705608,0.00014956322,0.00007434042],"domain_scores_gemma":[0.99919933,0.00016496964,0.00004383303,0.00016438196,0.00030849525,0.00011895684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008236843,0.0007338148,0.000814213,0.0011908839,0.0012524097,0.0015889754,0.0025909203,0.0010000722,0.0065164804],"category_scores_gemma":[0.0016060118,0.00030223918,0.00033810365,0.00049282034,0.0006215673,0.0014539334,0.0010046829,0.0012120174,0.00093814236],"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.0020355643,0.0010100837,0.0021698517,0.0003680323,0.00026611387,0.0004069836,0.00045923164,0.17484836,0.112585135,0.08293511,0.021702427,0.60121304],"study_design_scores_gemma":[0.00012833727,0.00046759046,0.00036881366,0.000022379823,0.00009986342,0.0001541827,0.00004252197,0.95587444,0.020057114,0.010383762,0.012347151,0.000053851985],"about_ca_topic_score_codex":0.0028941694,"about_ca_topic_score_gemma":0.0044021374,"teacher_disagreement_score":0.0065164804,"about_ca_system_score_codex":0.0008280452,"about_ca_system_score_gemma":0.0013658056,"threshold_uncertainty_score":0.021799803},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03532015,0.124326944,0.55396533,0.0651211,0.0034308191,0.0002486683,0.000384366,0.0029189996,0.21428369],"genre_scores_gemma":[0.4127978,0.09479592,0.40738004,0.011287367,0.0063908,0.0007935042,0.0013609327,0.000945433,0.06424822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99606377,0.0013445216,0.00013694464,0.00085704797,0.0011894457,0.00040832296],"domain_scores_gemma":[0.98242974,0.012094939,0.00044318178,0.0019826829,0.0022939064,0.0007555784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006131568,0.0010180629,0.002163175,0.0040765735,0.0024483476,0.011520599,0.0050665056,0.0060358704,0.027612958],"category_scores_gemma":[0.011145474,0.0011253784,0.0016278992,0.006560628,0.0064947493,0.02843665,0.003313539,0.0048827683,0.0058703762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019421768,0.00051523827,0.0025288723,0.0007448093,0.000048286223,0.0001647955,0.001161988,0.0020735292,0.0014502151,0.7369297,0.02172531,0.23246299],"study_design_scores_gemma":[0.000062707804,0.00016540001,0.0012180902,0.00035698133,0.000042745796,0.00033123948,0.0017767759,0.0210747,0.0010254022,0.8363414,0.13754031,0.00006425176],"about_ca_topic_score_codex":0.0028052616,"about_ca_topic_score_gemma":0.0023517793,"teacher_disagreement_score":0.027612958,"about_ca_system_score_codex":0.0028643042,"about_ca_system_score_gemma":0.0025130014,"threshold_uncertainty_score":0.09237456},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81844693,0.0014599599,0.16057505,0.0047117383,0.00017995435,0.00025811634,0.00057360367,0.00094110385,0.012853481],"genre_scores_gemma":[0.99641633,0.00022785451,0.0020445932,0.00007977048,0.000038378643,0.00003411879,0.00006500371,0.00005548636,0.0010385131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99626476,0.0015282322,0.00016367769,0.00053118577,0.0008530727,0.0006591437],"domain_scores_gemma":[0.94048786,0.045939803,0.0033866374,0.0031832997,0.0055197384,0.0014826847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070520956,0.00056561496,0.0012717987,0.0015480055,0.0015417314,0.0031896494,0.002569235,0.0018812125,0.0027767508],"category_scores_gemma":[0.06423538,0.00072196685,0.0006373901,0.0015702874,0.0021594833,0.0064251707,0.0019070739,0.0023152758,0.00049238716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026444795,0.0011753399,0.07902631,0.0006586837,0.00019816618,0.00094707275,0.0037545455,0.49979565,0.014999735,0.28865865,0.0094788475,0.09866251],"study_design_scores_gemma":[0.00010623002,0.00027678045,0.00618284,0.00005492441,0.00009117141,0.00025058142,0.0009955472,0.9413929,0.003182248,0.045829125,0.0015692528,0.000068385634],"about_ca_topic_score_codex":0.011920749,"about_ca_topic_score_gemma":0.0074619497,"teacher_disagreement_score":0.011920749,"about_ca_system_score_codex":0.0040345965,"about_ca_system_score_gemma":0.0017677231,"threshold_uncertainty_score":0.03729546},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20189111,0.002722629,0.78154427,0.00045111447,0.00027521164,0.000038924616,0.000045508874,0.0003584972,0.012672672],"genre_scores_gemma":[0.91762733,0.0010323877,0.07725855,0.00008909262,0.000121502206,0.000030907027,0.000028581408,0.000028793187,0.0037828411],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998492,0.000038355647,0.000005257277,0.000017480375,0.000063678766,0.000026015447],"domain_scores_gemma":[0.999729,0.00012252215,0.000038796814,0.00005291786,0.00003926166,0.00001745412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023056103,0.00022125307,0.00017710312,0.00029201192,0.00037218168,0.0005378172,0.00051452656,0.00027359853,0.0010199988],"category_scores_gemma":[0.00061472267,0.00019284396,0.00011468793,0.0004597786,0.00042358163,0.0007792621,0.00050552934,0.0006031828,0.00016526514],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006636138,0.00018799798,0.0016912285,0.0001938477,0.00006271158,0.000404941,0.00040095067,0.12691653,0.22466932,0.25555733,0.003577392,0.38567424],"study_design_scores_gemma":[0.000051221912,0.0001991622,0.0007762243,0.00002409919,0.00003039096,0.00056767854,0.00013430761,0.86507964,0.032917283,0.09199658,0.008194835,0.000028648781],"about_ca_topic_score_codex":0.00022244883,"about_ca_topic_score_gemma":0.0004481827,"teacher_disagreement_score":0.0010199988,"about_ca_system_score_codex":0.00021401363,"about_ca_system_score_gemma":0.00021557459,"threshold_uncertainty_score":0.003412187},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08116492,0.0004912397,0.9111772,0.00038580946,0.000097625525,0.000053649892,0.00007554844,0.00032682795,0.006227136],"genre_scores_gemma":[0.9868767,0.000074623036,0.012042865,0.000028046827,0.000017517226,0.000029929328,0.000028374132,0.000014879457,0.0008870474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875855,0.0003377622,0.00006696757,0.00025474458,0.00036208337,0.00021998149],"domain_scores_gemma":[0.9941929,0.003510703,0.0006225906,0.00035038745,0.0011850296,0.0001383996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030392304,0.0008085866,0.0009359479,0.00088755204,0.000715317,0.0022257713,0.0010600433,0.0009879468,0.0020122458],"category_scores_gemma":[0.011533987,0.0004298503,0.00041982255,0.00050120556,0.0011515525,0.0013440147,0.0019254924,0.0011774197,0.00021379886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043625233,0.000043865468,0.0006805836,0.0001517157,0.00004133418,0.00008213183,0.00013930276,0.9504483,0.0033682592,0.020952312,0.00054922095,0.02310673],"study_design_scores_gemma":[0.000005545162,0.000017703258,0.000092366325,0.0000049879122,0.00000479179,0.0000054292964,0.0000068059812,0.9971661,0.0006015934,0.0019935085,0.00009656442,0.0000046788687],"about_ca_topic_score_codex":0.0053858985,"about_ca_topic_score_gemma":0.002899377,"teacher_disagreement_score":0.0053858985,"about_ca_system_score_codex":0.001379961,"about_ca_system_score_gemma":0.0010699292,"threshold_uncertainty_score":0.016073167},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4361275,0.0057861716,0.4803603,0.0072667347,0.0005665619,0.0000682596,0.0013166552,0.0009863897,0.067521416],"genre_scores_gemma":[0.9917604,0.00092532043,0.0043715485,0.00015413215,0.00019969461,0.000054132106,0.00011985522,0.000059325623,0.0023555034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862576,0.00047587452,0.000052848274,0.00015781494,0.00033010743,0.00035758506],"domain_scores_gemma":[0.98095787,0.0147087965,0.0007200492,0.001126905,0.0017942408,0.00069228787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002339969,0.0005773709,0.0009449539,0.00142169,0.0010457459,0.0032494753,0.001521833,0.00092009874,0.006995125],"category_scores_gemma":[0.019002724,0.0005114458,0.00023508113,0.0014272227,0.001596479,0.004455138,0.0016747597,0.001135443,0.0005233016],"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.00038571618,0.00008207071,0.00079964567,0.00020474616,0.000043719392,0.00014399449,0.00028210666,0.34809268,0.008137816,0.6016517,0.006439915,0.03373584],"study_design_scores_gemma":[0.000019223253,0.00003085549,0.00035589316,0.00004470589,0.00001748402,0.00011086267,0.00009529719,0.732599,0.0016850078,0.2624963,0.0025249617,0.000020337233],"about_ca_topic_score_codex":0.001883896,"about_ca_topic_score_gemma":0.00087604555,"teacher_disagreement_score":0.006995125,"about_ca_system_score_codex":0.0017462882,"about_ca_system_score_gemma":0.0010032381,"threshold_uncertainty_score":0.023400962},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017583165,0.00006802863,0.9778782,0.000085463515,0.000029178053,0.00017674993,0.00011701256,0.0020786675,0.0019834598],"genre_scores_gemma":[0.49068102,0.000106046864,0.50408334,0.00020048762,0.00005431981,0.00038169333,0.0003738712,0.00037546427,0.0037436697],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974353,0.0005119182,0.0001703179,0.00053733255,0.0011122647,0.00023295241],"domain_scores_gemma":[0.9942842,0.0025962295,0.00057401,0.0012508064,0.0011006959,0.0001940915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017466872,0.0013120995,0.0015255088,0.0036456855,0.0011400274,0.0018844778,0.0029208253,0.0015762129,0.0048707672],"category_scores_gemma":[0.0061017075,0.00075242086,0.0018000441,0.0012786832,0.0018166889,0.0040202285,0.0021817114,0.0013702309,0.0012172846],"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.002242316,0.000831946,0.018670056,0.001022952,0.0004417621,0.0011949568,0.0007634176,0.10702069,0.116269276,0.14007176,0.0068439855,0.6046269],"study_design_scores_gemma":[0.000064015025,0.00025488914,0.0018003016,0.000051625044,0.00010303217,0.00046060845,0.00012375493,0.8856217,0.045282967,0.063069716,0.003088456,0.00007896813],"about_ca_topic_score_codex":0.0011622249,"about_ca_topic_score_gemma":0.0020426577,"teacher_disagreement_score":0.0048707672,"about_ca_system_score_codex":0.00081030774,"about_ca_system_score_gemma":0.0010310335,"threshold_uncertainty_score":0.01629436},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27987024,0.005451174,0.5949334,0.0071233124,0.00017747591,0.00009790343,0.0007494046,0.00056246924,0.11103458],"genre_scores_gemma":[0.9586818,0.0007516003,0.027806573,0.00014076168,0.00010352681,0.00009483416,0.00020244451,0.00009355739,0.01212482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99768186,0.0010623037,0.00014054037,0.00031009965,0.0005594923,0.00024568973],"domain_scores_gemma":[0.9830935,0.012611984,0.0013966932,0.00092465215,0.0012633206,0.0007098518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033756658,0.00041994144,0.0008078449,0.0025147588,0.0008511348,0.002865383,0.00089380366,0.0010843958,0.009624057],"category_scores_gemma":[0.020376567,0.00049995806,0.0005212402,0.0029509512,0.002744487,0.005944309,0.0020006772,0.0012290358,0.00085700525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093385606,0.000045549117,0.002470921,0.00007101117,0.000014520075,0.000064927175,0.00036237514,0.055091996,0.0001547454,0.8645651,0.0022279609,0.074837506],"study_design_scores_gemma":[0.000013539873,0.00003073629,0.00047068135,0.00004138024,0.000009983714,0.000054575426,0.00018483626,0.1389963,0.00031260404,0.8522493,0.0076249335,0.000011055792],"about_ca_topic_score_codex":0.006305927,"about_ca_topic_score_gemma":0.0045046643,"teacher_disagreement_score":0.009624057,"about_ca_system_score_codex":0.0030321951,"about_ca_system_score_gemma":0.001789959,"threshold_uncertainty_score":0.032195687},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05285147,0.00062962755,0.94258606,0.00027472398,0.00004572528,0.00003674641,0.00006436808,0.00010278577,0.003408418],"genre_scores_gemma":[0.91220343,0.0004980957,0.08369483,0.00006234441,0.00008741731,0.00011001561,0.00005059755,0.000029034401,0.003264245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991698,0.00038660888,0.000040393825,0.00011796899,0.00016697028,0.00011821158],"domain_scores_gemma":[0.99767774,0.0017475721,0.0001526028,0.00013317745,0.0002369946,0.000051919105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013918749,0.00052902446,0.0009417744,0.0006137421,0.00050701445,0.0009910483,0.0009359479,0.0009010951,0.0010877366],"category_scores_gemma":[0.005765629,0.0005149254,0.00032411463,0.0013737647,0.00082329905,0.0013363142,0.0008919575,0.00050608115,0.00025263362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002328069,0.0000687457,0.00053768774,0.00009007576,0.000041326028,0.00007080026,0.00016049948,0.89115304,0.0033392017,0.02548928,0.0012483058,0.07756825],"study_design_scores_gemma":[0.000025142721,0.000036400714,0.00011361633,0.0000047402887,0.000011234316,0.00002818898,0.000023985222,0.978803,0.0006401551,0.019993821,0.00031361502,0.0000061097976],"about_ca_topic_score_codex":0.0029297003,"about_ca_topic_score_gemma":0.0035346297,"teacher_disagreement_score":0.0029297003,"about_ca_system_score_codex":0.0005534252,"about_ca_system_score_gemma":0.0010898935,"threshold_uncertainty_score":0.007360995},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0255339,0.00091602246,0.9557317,0.0005627819,0.0006367027,0.00020909823,0.00014858667,0.009472383,0.00678886],"genre_scores_gemma":[0.70815355,0.0006580373,0.2711775,0.00073067617,0.00078628055,0.0003424408,0.0002860005,0.00049982604,0.017365603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922264,0.00010265655,0.000056489513,0.00016583425,0.0003093604,0.00014302504],"domain_scores_gemma":[0.9976578,0.00058379344,0.00015645383,0.00079094694,0.0006137841,0.00019716073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011109023,0.00086039095,0.00086275,0.0016956555,0.0015544291,0.0022477915,0.0045882766,0.0013868172,0.0077040163],"category_scores_gemma":[0.0038255812,0.00056301756,0.00047834055,0.0012786716,0.0010405087,0.0037184516,0.0022248863,0.001994892,0.0017780504],"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.0014007231,0.0011921483,0.0015142561,0.00026321565,0.00016924561,0.00037184625,0.00041529787,0.07464578,0.12507515,0.14626202,0.025634358,0.62305593],"study_design_scores_gemma":[0.00019136124,0.00030921906,0.00058346824,0.00003519237,0.00013612471,0.00031354773,0.000046558198,0.88302594,0.042636707,0.05509923,0.017498612,0.0001240585],"about_ca_topic_score_codex":0.0016584733,"about_ca_topic_score_gemma":0.0022946706,"teacher_disagreement_score":0.0077040163,"about_ca_system_score_codex":0.0010310889,"about_ca_system_score_gemma":0.0009403035,"threshold_uncertainty_score":0.025772512},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11581595,0.000896635,0.86847985,0.000540091,0.00020348608,0.0003961695,0.000097751916,0.003367858,0.0102022],"genre_scores_gemma":[0.87875414,0.00024689184,0.11506758,0.00011125104,0.000104930325,0.00010630855,0.00017011695,0.000051054118,0.0053876583],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988085,0.00032181042,0.00009706075,0.00016312882,0.0004134678,0.00019600154],"domain_scores_gemma":[0.9983681,0.00029775247,0.0001780138,0.00072877976,0.0003547683,0.000072604205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081917254,0.0004618431,0.00044095606,0.0009296755,0.001151619,0.0013526002,0.001266123,0.0007254746,0.002498284],"category_scores_gemma":[0.0026195429,0.00024609015,0.0002641066,0.0005655123,0.000692995,0.0035547987,0.0012320816,0.00087864086,0.0010485847],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015970251,0.00067202555,0.004768298,0.0002949857,0.00014080315,0.000866397,0.0006080397,0.059728198,0.1764193,0.21555436,0.013252086,0.52609843],"study_design_scores_gemma":[0.0001171973,0.000618604,0.0025045474,0.000032854015,0.00023392352,0.0009308656,0.0002720056,0.83179957,0.11309487,0.035248537,0.01505466,0.000092339294],"about_ca_topic_score_codex":0.0011746224,"about_ca_topic_score_gemma":0.0026139761,"teacher_disagreement_score":0.002498284,"about_ca_system_score_codex":0.00073303684,"about_ca_system_score_gemma":0.0012441297,"threshold_uncertainty_score":0.008357644},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.122795686,0.0025883939,0.83153516,0.0012551489,0.0008523367,0.001191166,0.0016810586,0.01686971,0.021231374],"genre_scores_gemma":[0.84158593,0.0011454159,0.12104613,0.0004827139,0.00020372117,0.0005742223,0.0024008718,0.0005063572,0.032054648],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994758,0.00007644413,0.000034619174,0.000058079306,0.0002952114,0.00005980134],"domain_scores_gemma":[0.9992593,0.00020705504,0.00007641182,0.0001313837,0.00026343772,0.000062424064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006878577,0.00046213245,0.0006531218,0.00097648846,0.0008408941,0.0007693985,0.0010490228,0.0005563943,0.0018611735],"category_scores_gemma":[0.0021943706,0.00028903104,0.0002138594,0.00048823137,0.0004089674,0.0013302598,0.0017818589,0.0005451727,0.0006673778],"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.002040033,0.0005478388,0.0058388677,0.000971105,0.00038772382,0.0011559778,0.0010646133,0.091177635,0.10791109,0.046749137,0.09459416,0.64756185],"study_design_scores_gemma":[0.00062293414,0.0014817276,0.0036568828,0.000050527025,0.0002840792,0.0019114083,0.000555832,0.6983838,0.0996117,0.013481901,0.17979392,0.00016529628],"about_ca_topic_score_codex":0.0016893052,"about_ca_topic_score_gemma":0.0029244453,"teacher_disagreement_score":0.0018611735,"about_ca_system_score_codex":0.00046061625,"about_ca_system_score_gemma":0.0009567902,"threshold_uncertainty_score":0.006226301},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.234884,0.002081162,0.70662415,0.002042335,0.0011176968,0.00092918397,0.0011759021,0.004443989,0.046701573],"genre_scores_gemma":[0.9370456,0.00030488227,0.033600565,0.0003403326,0.00017469589,0.000341071,0.00064682215,0.000058949547,0.027487138],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977075,0.00039709813,0.00015271758,0.00039444002,0.0006402952,0.0007079464],"domain_scores_gemma":[0.99745876,0.00041603684,0.00026268407,0.0010201135,0.00067951554,0.00016290946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014057136,0.0011048581,0.00076337415,0.0010791678,0.0023064238,0.002016743,0.0013883408,0.0023703924,0.0066617997],"category_scores_gemma":[0.0018691034,0.0003595774,0.00057954184,0.0011620562,0.0010689701,0.0027331808,0.0034859097,0.0013949781,0.003913554],"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.0073426287,0.0004335687,0.003976317,0.0009867324,0.00019181748,0.0020758512,0.0019157808,0.018200124,0.3919417,0.32413465,0.028658822,0.22014204],"study_design_scores_gemma":[0.00135659,0.00315832,0.005467819,0.00027543074,0.00055219774,0.006325634,0.00061766116,0.27817324,0.42240837,0.11343459,0.16761926,0.00061091833],"about_ca_topic_score_codex":0.0010571752,"about_ca_topic_score_gemma":0.00072916725,"teacher_disagreement_score":0.0066617997,"about_ca_system_score_codex":0.0012763821,"about_ca_system_score_gemma":0.0018425541,"threshold_uncertainty_score":0.022285938},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1579115,0.001119112,0.8288202,0.00074199605,0.00033100246,0.00016464453,0.00011318151,0.00087708933,0.009921196],"genre_scores_gemma":[0.91494566,0.00036835752,0.080505766,0.00012322697,0.0000669375,0.000094723364,0.000067251225,0.000033531065,0.0037945956],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993781,0.00018948915,0.000022910428,0.0001739371,0.00016072213,0.00007483916],"domain_scores_gemma":[0.99934465,0.00032213642,0.000046674635,0.00013211326,0.00010769585,0.000046722158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005335497,0.0006154264,0.00063863426,0.00045013358,0.00065485324,0.0006432953,0.0009464257,0.0010916215,0.0017900994],"category_scores_gemma":[0.0015825214,0.0004592849,0.0003495292,0.0005302077,0.00034343667,0.0013894174,0.0013463328,0.00051751063,0.0006098511],"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.00093368144,0.00047430638,0.008008724,0.00043875122,0.00015738401,0.0018392556,0.0007412105,0.23080271,0.28315502,0.016423805,0.009212799,0.44781235],"study_design_scores_gemma":[0.000054082717,0.0005446899,0.002913825,0.000029568459,0.00005659033,0.00069572154,0.00039993078,0.9329422,0.044621035,0.0073624225,0.01033389,0.000045937548],"about_ca_topic_score_codex":0.0012652146,"about_ca_topic_score_gemma":0.0025365502,"teacher_disagreement_score":0.0017900994,"about_ca_system_score_codex":0.00038714992,"about_ca_system_score_gemma":0.0002777006,"threshold_uncertainty_score":0.0059884787},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15404966,0.0009767573,0.8348648,0.0005835505,0.00038883448,0.0002285147,0.00025277078,0.0023584375,0.006296662],"genre_scores_gemma":[0.9261165,0.00021101027,0.07000219,0.0001509418,0.00006322736,0.000047870468,0.00014156646,0.00005912601,0.0032075013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953914,0.00009576475,0.000025587815,0.00007965372,0.00015267769,0.00010716239],"domain_scores_gemma":[0.9988249,0.00024080412,0.00008223531,0.00028058587,0.00045001047,0.000121496516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063798693,0.0006689433,0.0014688987,0.0006958403,0.0013274135,0.001079521,0.0023105335,0.0008247089,0.0016483166],"category_scores_gemma":[0.0014527722,0.00026057742,0.00030835718,0.0011204717,0.0005064418,0.0012147478,0.0013071346,0.00059425476,0.0003338512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025012717,0.001380386,0.0037953972,0.0003701335,0.0002698797,0.0007237214,0.00040333284,0.40605944,0.16125639,0.04491981,0.024745274,0.353575],"study_design_scores_gemma":[0.000035638346,0.00009071474,0.00029472663,0.0000056257477,0.00003885603,0.00012802995,0.00003606594,0.9858683,0.008455979,0.003656329,0.0013680683,0.000021762671],"about_ca_topic_score_codex":0.0038901952,"about_ca_topic_score_gemma":0.010282986,"teacher_disagreement_score":0.0038901952,"about_ca_system_score_codex":0.0016462143,"about_ca_system_score_gemma":0.0015286541,"threshold_uncertainty_score":0.011944234},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24347423,0.00076506805,0.56951606,0.0037967078,0.001424971,0.00047146255,0.01724774,0.11204263,0.05126111],"genre_scores_gemma":[0.76245767,0.0009569404,0.2035731,0.0005387253,0.00018013176,0.0003999383,0.0065093013,0.0066037774,0.018780367],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998703,0.000029279146,0.000009516778,0.000015982092,0.000048297745,0.00002655554],"domain_scores_gemma":[0.99822587,0.0010597655,0.0000950017,0.0001458556,0.00028467248,0.0001889291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003431876,0.001007332,0.00037834112,0.0015087927,0.00040149942,0.0010290345,0.00059234427,0.0006930804,0.023245249],"category_scores_gemma":[0.0024457334,0.0002710613,0.00034948208,0.00096170756,0.00032381288,0.000505405,0.000615733,0.0013606444,0.0011068945],"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.004221233,0.0006566189,0.00862998,0.002466267,0.00018686218,0.00264037,0.0054269806,0.3097279,0.08561914,0.050322525,0.20114207,0.32896],"study_design_scores_gemma":[0.00024398742,0.00016981814,0.006725985,0.00027123667,0.000060639635,0.00036379998,0.00042333754,0.9003026,0.027691124,0.010438085,0.053215858,0.00009358629],"about_ca_topic_score_codex":0.006652371,"about_ca_topic_score_gemma":0.0067704823,"teacher_disagreement_score":0.023245249,"about_ca_system_score_codex":0.000407383,"about_ca_system_score_gemma":0.000740398,"threshold_uncertainty_score":0.07776308},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02715243,0.0002206012,0.97015184,0.000089142166,0.000041579206,0.000033199816,0.000030076377,0.00030954182,0.001971592],"genre_scores_gemma":[0.4234259,0.00024474648,0.57368624,0.00007610885,0.000057130455,0.00005363993,0.00012024363,0.00010285356,0.002233115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970657,0.000064379354,0.000017658356,0.00005636019,0.0001270186,0.000027977158],"domain_scores_gemma":[0.9996276,0.00010062913,0.000042125695,0.00012567238,0.00008227299,0.00002171661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003751488,0.00034050125,0.00044655686,0.00050059444,0.0006293806,0.0006834887,0.00093856297,0.00034853662,0.000945152],"category_scores_gemma":[0.0008501237,0.00028654656,0.00029063373,0.0005467362,0.00029413265,0.0013836788,0.0007844032,0.0005344478,0.0001918148],"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.0001875252,0.00018206394,0.0010824582,0.00020749806,0.00007367,0.00014091397,0.00034527067,0.11776936,0.18591782,0.039466538,0.0026384334,0.6519884],"study_design_scores_gemma":[0.000021228076,0.00008895908,0.0009329306,0.000016304684,0.000053274118,0.00038920555,0.0001032278,0.93168783,0.044288993,0.01724785,0.005138854,0.000031289637],"about_ca_topic_score_codex":0.0004966439,"about_ca_topic_score_gemma":0.0020131702,"teacher_disagreement_score":0.000945152,"about_ca_system_score_codex":0.0003353741,"about_ca_system_score_gemma":0.00052670046,"threshold_uncertainty_score":0.0031618476},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44623145,0.0013662805,0.51435864,0.0068399203,0.0006317702,0.0008426338,0.0006225457,0.0047125556,0.024394173],"genre_scores_gemma":[0.9139497,0.00044659036,0.082493536,0.00016947878,0.000083740684,0.0003250012,0.0003662783,0.00011266994,0.0020528988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965354,0.0016190812,0.000109350534,0.00027790724,0.0008031388,0.0006550619],"domain_scores_gemma":[0.9912709,0.0027558035,0.00041780647,0.0020072735,0.00248154,0.0010666326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073291142,0.0005023999,0.0008047394,0.0008157728,0.0012351802,0.0021937035,0.0023503485,0.0010147507,0.0028636847],"category_scores_gemma":[0.01103128,0.00023063642,0.00023717577,0.00092048594,0.0017778254,0.00500704,0.0017566695,0.0017306587,0.0003814946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039804564,0.0025926977,0.019165419,0.0006999376,0.00026146363,0.0004097741,0.0012292771,0.31422326,0.07187647,0.27272633,0.031355202,0.2814797],"study_design_scores_gemma":[0.00036946937,0.0034851925,0.00386648,0.0001314398,0.00011389051,0.00031061904,0.001478354,0.82502854,0.087837934,0.052241936,0.025006434,0.000129714],"about_ca_topic_score_codex":0.007660247,"about_ca_topic_score_gemma":0.00791308,"teacher_disagreement_score":0.007660247,"about_ca_system_score_codex":0.0021738168,"about_ca_system_score_gemma":0.002590027,"threshold_uncertainty_score":0.038760543},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031891312,0.19102614,0.21966678,0.16072968,0.027098492,0.00016709439,0.00071097957,0.00045456024,0.3969571],"genre_scores_gemma":[0.18411723,0.31494987,0.13796602,0.061084475,0.04980326,0.00077425607,0.00093643414,0.0010370113,0.24933146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967186,0.0013951753,0.00025275396,0.00039335317,0.0010295582,0.00021056303],"domain_scores_gemma":[0.9773831,0.019576212,0.00035726844,0.0014097029,0.001014901,0.00025887857],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0072941543,0.0012129627,0.0008961329,0.0035520198,0.003213692,0.0055729602,0.0020435872,0.003382592,0.01609273],"category_scores_gemma":[0.018004583,0.0010255529,0.0009950048,0.004498049,0.01983564,0.017316982,0.0033077393,0.012854632,0.0038389622],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015449461,0.0000132157065,0.000037380512,0.00016524935,0.0000054855495,0.000046022506,0.00033108535,0.00042230333,0.00008225324,0.9613767,0.023709191,0.013795619],"study_design_scores_gemma":[0.000008521322,0.000011234476,0.000044780518,0.00022224936,0.0000039793363,0.00004523942,0.00007342095,0.00036317925,0.00018861465,0.78163147,0.21739115,0.000016093029],"about_ca_topic_score_codex":0.0034625824,"about_ca_topic_score_gemma":0.003043131,"teacher_disagreement_score":0.9967863,"about_ca_system_score_codex":0.0052268654,"about_ca_system_score_gemma":0.0024149076,"threshold_uncertainty_score":0.05383551},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46198002,0.0016002023,0.44891053,0.00058312446,0.00013718083,0.0001263693,0.000079914455,0.0008018336,0.085780844],"genre_scores_gemma":[0.96006846,0.00037256218,0.02876343,0.00004801758,0.00005787366,0.00006147039,0.00007550071,0.000045442972,0.010507257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839455,0.0007012216,0.00005099878,0.00024887588,0.00030455075,0.00029981023],"domain_scores_gemma":[0.99608576,0.0024405157,0.00023302871,0.00049878145,0.0003896747,0.00035229634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013877136,0.00037141322,0.0006174522,0.00075758056,0.002173346,0.0027862843,0.0009777066,0.0014909897,0.0071892333],"category_scores_gemma":[0.0049437876,0.0004971173,0.00035931368,0.0011418093,0.00061421515,0.0031978227,0.0029109935,0.000794914,0.0017950287],"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.0034772477,0.0010098602,0.02046902,0.0004211647,0.0002451842,0.0029286668,0.010416851,0.12842062,0.050820846,0.36303926,0.007713103,0.4110381],"study_design_scores_gemma":[0.00041977724,0.0011359665,0.006848704,0.00018900014,0.00028768444,0.0026584535,0.0070493985,0.6807777,0.034154985,0.2188204,0.04753242,0.00012550384],"about_ca_topic_score_codex":0.0012491435,"about_ca_topic_score_gemma":0.0015776565,"teacher_disagreement_score":0.0071892333,"about_ca_system_score_codex":0.00040603123,"about_ca_system_score_gemma":0.0006690402,"threshold_uncertainty_score":0.024050415},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71750885,0.00029236395,0.27322656,0.00027482343,0.00007794331,0.00017435403,0.00015612981,0.0036006542,0.004688256],"genre_scores_gemma":[0.96910065,0.000060286657,0.029491153,0.000045923105,0.000039046947,0.000026452024,0.00011300968,0.000035065303,0.0010883956],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993561,0.00013260443,0.000039313694,0.00007751192,0.00022111626,0.00017334937],"domain_scores_gemma":[0.9979844,0.000569687,0.00029277836,0.00033143527,0.00067918864,0.00014243832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007551152,0.00069175643,0.0008585042,0.0018825872,0.00064334396,0.0013704331,0.0006587041,0.00094419793,0.0011552359],"category_scores_gemma":[0.0024679888,0.0002379713,0.00044305096,0.0006585361,0.00045498574,0.0015414606,0.00078958296,0.00043951516,0.00073636335],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030804614,0.0014659001,0.110618845,0.000195425,0.00029992143,0.00039669866,0.00036741077,0.035919763,0.25707832,0.004892804,0.004394334,0.5812901],"study_design_scores_gemma":[0.000034322868,0.00019939912,0.017569436,0.000011492796,0.00010774466,0.0001887756,0.0000619085,0.8914927,0.08719596,0.0023162665,0.00078996434,0.00003193637],"about_ca_topic_score_codex":0.001828492,"about_ca_topic_score_gemma":0.0018034583,"teacher_disagreement_score":0.0018825872,"about_ca_system_score_codex":0.0004662157,"about_ca_system_score_gemma":0.00070669176,"threshold_uncertainty_score":0.003993511},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023183832,0.0024525486,0.9632863,0.0026203056,0.0004465767,0.00017384734,0.00024132538,0.0004163748,0.0071788738],"genre_scores_gemma":[0.6489159,0.0054399157,0.32886294,0.0012774426,0.0013302283,0.0008218243,0.0008183401,0.00070187316,0.01183151],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99536693,0.0026264954,0.00018730633,0.0006755808,0.0007588273,0.0003848514],"domain_scores_gemma":[0.98045933,0.015227023,0.000975857,0.0016076661,0.0011970141,0.00053316884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006672897,0.0018400967,0.0033224137,0.0020716025,0.0017003015,0.0020950632,0.0046934043,0.002591243,0.004927287],"category_scores_gemma":[0.03463537,0.0014146873,0.0012273946,0.0033453812,0.0040066647,0.005940675,0.0045752474,0.0028856874,0.00074648944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047171867,0.00010710862,0.00043961086,0.00033055758,0.000087365835,0.000049922655,0.00014439263,0.7827602,0.0011504764,0.16852145,0.008903569,0.037033632],"study_design_scores_gemma":[0.000086602864,0.00007199301,0.0001749471,0.00003440634,0.000026601847,0.000024194453,0.00004177143,0.86472154,0.00029545208,0.13313222,0.0013705863,0.000019684701],"about_ca_topic_score_codex":0.005015467,"about_ca_topic_score_gemma":0.0054361215,"teacher_disagreement_score":0.006672897,"about_ca_system_score_codex":0.0035707871,"about_ca_system_score_gemma":0.003436157,"threshold_uncertainty_score":0.035290122},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00075905223,0.0232286,0.004912836,0.012465659,0.8719214,0.00019634381,0.00038542855,0.0003763039,0.08575423],"genre_scores_gemma":[0.0048077567,0.031278748,0.0018625365,0.005437837,0.7292172,0.00019320623,0.0011759228,0.00040337784,0.22562346],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99864286,0.00019590084,0.00012638504,0.00027034595,0.00061181077,0.00015263654],"domain_scores_gemma":[0.9964414,0.0008399091,0.00025947273,0.00026850853,0.001495682,0.00069514103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015436308,0.0027556547,0.0031679766,0.0039228476,0.0016539366,0.004548406,0.0022960256,0.00375386,0.08583087],"category_scores_gemma":[0.0032900493,0.00057661365,0.0014857571,0.0025602765,0.0008779236,0.0036301403,0.0016982566,0.0028158836,0.033513542],"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.00006278897,0.000051060026,0.00013002128,0.0004720765,0.00003066254,0.00013650578,0.000009326706,0.0002442085,0.0007329925,0.0030527771,0.95378786,0.04128961],"study_design_scores_gemma":[0.000013928408,0.00008381589,0.00049224327,0.00013450188,0.00003438941,0.00023768895,0.000013140752,0.0008019681,0.0003181397,0.0018123173,0.99604213,0.000015690717],"about_ca_topic_score_codex":0.000660926,"about_ca_topic_score_gemma":0.001686546,"teacher_disagreement_score":0.08583087,"about_ca_system_score_codex":0.0012341412,"about_ca_system_score_gemma":0.0011292552,"threshold_uncertainty_score":0.28713286},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16752374,0.0015206438,0.8082294,0.0021943091,0.0006112887,0.00026669467,0.0003188838,0.000473317,0.018861674],"genre_scores_gemma":[0.9661162,0.0003648261,0.028564192,0.00019998754,0.00013444593,0.00013259503,0.00006915459,0.000015239044,0.0044033714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993593,0.00015515975,0.000024457999,0.000099242214,0.00018681565,0.00017506978],"domain_scores_gemma":[0.99878496,0.00060260115,0.00009177732,0.00007812198,0.0003867682,0.000055780434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007786772,0.00066327903,0.0005036151,0.00061614625,0.0011092182,0.0014452216,0.0008474132,0.0008196579,0.0023425806],"category_scores_gemma":[0.002656602,0.00020042849,0.00026520502,0.0007332108,0.00075482274,0.0008628018,0.001364278,0.00084541616,0.00028235154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011808331,0.0004255696,0.0025865722,0.0005323995,0.00020751388,0.0015943854,0.0005589599,0.4700402,0.07590639,0.22269411,0.012821758,0.21145137],"study_design_scores_gemma":[0.00004782388,0.00020121783,0.00038827205,0.00001812151,0.000066733526,0.00023748224,0.00007061202,0.97728354,0.0034500514,0.016429376,0.001777561,0.00002917135],"about_ca_topic_score_codex":0.00656005,"about_ca_topic_score_gemma":0.009785826,"teacher_disagreement_score":0.00656005,"about_ca_system_score_codex":0.0015251536,"about_ca_system_score_gemma":0.0017143575,"threshold_uncertainty_score":0.013043761},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0182421,0.00069920515,0.9793513,0.00017730866,0.00008047491,0.00001614079,0.000038399772,0.00012359655,0.0012713821],"genre_scores_gemma":[0.9116152,0.0010192682,0.08329333,0.000060700477,0.00014476437,0.00008170853,0.000112413436,0.00003962117,0.0036330924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991604,0.0002862979,0.00003247079,0.00020116717,0.00021769619,0.00010184783],"domain_scores_gemma":[0.99916506,0.00049750326,0.00009227599,0.000096678305,0.00011668193,0.000031797863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009162552,0.0005743467,0.0012084007,0.0005532219,0.00045928577,0.0007918631,0.0011790504,0.0006340614,0.0007893047],"category_scores_gemma":[0.0032787665,0.0006683,0.0002597866,0.0013191485,0.0008566052,0.0013771442,0.0009759705,0.00051864696,0.00019520175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009969849,0.000023843013,0.00032234794,0.00003474445,0.000021419057,0.000023616169,0.000031636813,0.95750004,0.0017745749,0.007975894,0.00061156135,0.031580653],"study_design_scores_gemma":[0.000010692044,0.000021470865,0.00011543951,0.000002547756,0.0000060411144,0.000011541678,0.000010652016,0.9944148,0.00043627515,0.0046197767,0.00034692098,0.000003736935],"about_ca_topic_score_codex":0.0034008035,"about_ca_topic_score_gemma":0.0042299847,"teacher_disagreement_score":0.0034008035,"about_ca_system_score_codex":0.00089804543,"about_ca_system_score_gemma":0.0009242354,"threshold_uncertainty_score":0.0067620277},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041373495,0.01074959,0.89333934,0.005427209,0.0033988657,0.00020402667,0.0005745287,0.0011411379,0.04379183],"genre_scores_gemma":[0.7292753,0.0066465028,0.21757783,0.0014080338,0.0017105212,0.00024072589,0.00082532194,0.00032606977,0.041989658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994823,0.00014779391,0.000040250616,0.00005841453,0.00021013705,0.000060999828],"domain_scores_gemma":[0.99918824,0.00032105405,0.000038715447,0.0001950274,0.00021251323,0.00004441958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011443158,0.0004426493,0.0004890959,0.00045852724,0.00063277705,0.0013710955,0.0011904915,0.00083880627,0.0064407014],"category_scores_gemma":[0.0027369473,0.0002920534,0.0002574982,0.0005852261,0.000969152,0.001937578,0.00084063865,0.0015840787,0.0014112929],"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.000348394,0.00007299163,0.00029681248,0.00022285714,0.00001635487,0.00030310388,0.00017793715,0.018382914,0.01367751,0.84958935,0.01933827,0.09757347],"study_design_scores_gemma":[0.000078161465,0.00019249498,0.00058633514,0.0001401313,0.00004264131,0.00042221445,0.00010718706,0.44275936,0.012846211,0.4611721,0.081597686,0.00005550793],"about_ca_topic_score_codex":0.0010904834,"about_ca_topic_score_gemma":0.0013906758,"teacher_disagreement_score":0.0064407014,"about_ca_system_score_codex":0.0010668265,"about_ca_system_score_gemma":0.00080166943,"threshold_uncertainty_score":0.021546304},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00078490266,0.01599997,0.009479592,0.004205669,0.014289233,0.0003498716,0.0041883495,0.0018987075,0.9488036],"genre_scores_gemma":[0.005186705,0.0129456725,0.002306106,0.0010710044,0.0032175223,0.00015559587,0.00323132,0.0006233378,0.97126263],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999233,0.000071818045,0.00003596878,0.00015267784,0.00038981365,0.00011663701],"domain_scores_gemma":[0.9987914,0.00014414656,0.00005019331,0.00019762699,0.0005277386,0.00028891198],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009228407,0.0013039663,0.00084503123,0.0027768803,0.0012538586,0.0045752428,0.00080117997,0.0011422178,0.36179358],"category_scores_gemma":[0.0019912298,0.000454249,0.00046759404,0.003435589,0.00052135496,0.0023820433,0.0018274776,0.0023645859,0.26469964],"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.00003051664,0.000026538031,0.00017656076,0.00020734874,0.000007036017,0.00004201532,0.000025412592,0.00038511786,0.0011657112,0.016054155,0.85347474,0.1284048],"study_design_scores_gemma":[0.0000040932196,0.000020246169,0.0005569492,0.0001536409,0.0000033157326,0.000083050305,0.000019265472,0.00041702672,0.0002501224,0.002503725,0.9959806,0.00000796256],"about_ca_topic_score_codex":0.004602421,"about_ca_topic_score_gemma":0.005534204,"teacher_disagreement_score":0.36179358,"about_ca_system_score_codex":0.0021232006,"about_ca_system_score_gemma":0.0019328338,"threshold_uncertainty_score":0.910324},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025544042,0.15284581,0.7876082,0.0038278576,0.00069294573,0.00039641527,0.00024493414,0.00046707687,0.028372634],"genre_scores_gemma":[0.36486766,0.22362812,0.395724,0.0008899811,0.0032657674,0.00048870343,0.00086982705,0.00021047427,0.010055344],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99754155,0.0005378743,0.00019877111,0.000414836,0.0011393243,0.00016758635],"domain_scores_gemma":[0.996323,0.0022870712,0.0002290807,0.00047540513,0.0005882982,0.00009722744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028577254,0.0008593881,0.0018142883,0.0017467312,0.0010884778,0.002469385,0.0030892221,0.0020478072,0.0026053516],"category_scores_gemma":[0.008278379,0.0006145911,0.00059296703,0.0037772467,0.0011467153,0.0051549505,0.0012984711,0.0015645542,0.00079188426],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021951334,0.00026973002,0.0013610962,0.0022894025,0.00008294153,0.00011838956,0.00016576487,0.068372965,0.0059978087,0.27116483,0.009080126,0.6408774],"study_design_scores_gemma":[0.00012762014,0.0007126773,0.0014789188,0.00087718514,0.00017962945,0.0020878098,0.00030929508,0.59562933,0.008354748,0.24942283,0.14070618,0.00011373969],"about_ca_topic_score_codex":0.00075522455,"about_ca_topic_score_gemma":0.0005777505,"teacher_disagreement_score":0.0030892221,"about_ca_system_score_codex":0.0016300629,"about_ca_system_score_gemma":0.001556036,"threshold_uncertainty_score":0.015113294},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05861981,0.00028724733,0.9392113,0.000117943084,0.000027121241,0.00002577309,0.00005315442,0.00051512325,0.0011424586],"genre_scores_gemma":[0.9155627,0.00025282748,0.08232118,0.000036401474,0.000057662575,0.00003877497,0.00008647671,0.00005745317,0.001586565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987129,0.0004227354,0.00004545965,0.00017926497,0.0002993312,0.00034032203],"domain_scores_gemma":[0.9930529,0.005196723,0.0004542446,0.00041745175,0.00070985744,0.00016888595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019603372,0.0006378234,0.0011741912,0.00089256285,0.0007045805,0.0012095441,0.0014063951,0.00073137996,0.001287325],"category_scores_gemma":[0.009400508,0.0006158289,0.0002598302,0.0012153358,0.0013739282,0.0016636376,0.0009218191,0.0010803373,0.00023809748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008933513,0.00007702128,0.0019612715,0.000048032438,0.000031299896,0.000049977993,0.00011970909,0.9042429,0.0039943047,0.013281479,0.0009071289,0.0743935],"study_design_scores_gemma":[0.000008228254,0.000013758658,0.00013334655,0.0000015318336,0.0000068412937,0.000012635217,0.000009567024,0.9957553,0.0009008372,0.0030584799,0.000095219715,0.0000043073615],"about_ca_topic_score_codex":0.017112076,"about_ca_topic_score_gemma":0.012899539,"teacher_disagreement_score":0.017112076,"about_ca_system_score_codex":0.0016346858,"about_ca_system_score_gemma":0.0023962965,"threshold_uncertainty_score":0.034024954},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035558164,0.00083538296,0.8827415,0.012614731,0.0003975362,0.00034919623,0.0017069764,0.00074763404,0.06504884],"genre_scores_gemma":[0.7836824,0.0031288574,0.17116086,0.0027348164,0.0007473289,0.0007981187,0.001456158,0.00036197517,0.035929564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990657,0.00039637,0.000043761094,0.00012430394,0.00025981068,0.00011019893],"domain_scores_gemma":[0.99633044,0.0017814826,0.0003452111,0.00046389148,0.0007099123,0.00036905552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025987977,0.0007616462,0.00094945176,0.0016986836,0.00081678014,0.0026538596,0.0037478146,0.002136445,0.007961317],"category_scores_gemma":[0.008912693,0.0005517335,0.0010269035,0.0011746085,0.0019784162,0.006586127,0.0022195342,0.0034530198,0.0015013025],"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.000046556386,0.00012546295,0.0036670752,0.000110836445,0.0000515061,0.00012867778,0.00040531697,0.09470988,0.00031874795,0.87163305,0.009072153,0.019730764],"study_design_scores_gemma":[0.000032126445,0.000049310023,0.0006627224,0.000050339237,0.000045662804,0.00015513535,0.00014579749,0.5811427,0.00010999631,0.40342546,0.014152472,0.000028241173],"about_ca_topic_score_codex":0.010749229,"about_ca_topic_score_gemma":0.00948776,"teacher_disagreement_score":0.010749229,"about_ca_system_score_codex":0.0019540426,"about_ca_system_score_gemma":0.0032771667,"threshold_uncertainty_score":0.026633203},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051627044,0.0011557308,0.9429569,0.0004596632,0.00030905096,0.00009358881,0.00007626915,0.0007827117,0.0025391225],"genre_scores_gemma":[0.9129984,0.00033848642,0.08455637,0.000063432286,0.0001490303,0.00006550929,0.00007580152,0.00007110539,0.0016819269],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928135,0.00027100372,0.00003502916,0.00009724385,0.00016215758,0.0001532761],"domain_scores_gemma":[0.99791855,0.0011626601,0.00018522986,0.00021756937,0.000376604,0.00013937578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013718382,0.000468433,0.00067369145,0.0009595219,0.0009558507,0.0008149178,0.0014905907,0.00043992154,0.0020145376],"category_scores_gemma":[0.005196527,0.000412842,0.0002510149,0.0008479042,0.0005200372,0.0015935609,0.0011546556,0.0008461286,0.00018075023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005542106,0.0002376251,0.0016256968,0.00018553693,0.00007528093,0.00012042312,0.00016925164,0.7239242,0.015772862,0.016040046,0.006132151,0.2351627],"study_design_scores_gemma":[0.000017752576,0.000039359675,0.0001948881,0.0000049777573,0.00001577082,0.00003043122,0.000022227934,0.9928485,0.0015330833,0.004650128,0.0006323203,0.000010503687],"about_ca_topic_score_codex":0.0022795561,"about_ca_topic_score_gemma":0.0043073627,"teacher_disagreement_score":0.0022795561,"about_ca_system_score_codex":0.00079508265,"about_ca_system_score_gemma":0.0009044394,"threshold_uncertainty_score":0.0072550774},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028452601,0.24374117,0.64657485,0.01042102,0.0033293024,0.0003709107,0.00019100313,0.0006850916,0.06623409],"genre_scores_gemma":[0.31127167,0.324534,0.32022074,0.0032798767,0.00822264,0.00062469026,0.001039264,0.0004496811,0.03035747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701655,0.00077921554,0.0001876819,0.0005060209,0.0012477576,0.0002628046],"domain_scores_gemma":[0.985899,0.009371846,0.00041911527,0.0013006984,0.002750534,0.00025885602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042091333,0.0012516004,0.0015093344,0.002902861,0.0016897459,0.0039185034,0.0032214215,0.002515246,0.0052413247],"category_scores_gemma":[0.01376283,0.0010094085,0.0008225862,0.005387804,0.0017860144,0.014186336,0.0014593287,0.003957222,0.0016059001],"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.00020712135,0.0003370277,0.0011896652,0.0025933774,0.0001474757,0.00017983951,0.0005805509,0.02995694,0.013934594,0.39683655,0.01384121,0.54019564],"study_design_scores_gemma":[0.00013216768,0.0007857521,0.0011052721,0.0016266324,0.00039492728,0.0015560638,0.0009037829,0.23710959,0.036288906,0.44840267,0.2715588,0.00013548904],"about_ca_topic_score_codex":0.0012078622,"about_ca_topic_score_gemma":0.00091697613,"teacher_disagreement_score":0.0052413247,"about_ca_system_score_codex":0.0024994202,"about_ca_system_score_gemma":0.001803102,"threshold_uncertainty_score":0.022260249},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020857453,0.0008362601,0.9873317,0.0006675397,0.00026017733,0.000032066982,0.000048029382,0.00010119587,0.008637276],"genre_scores_gemma":[0.71277475,0.0051685497,0.2519575,0.0010931853,0.003111869,0.00044780257,0.00017701657,0.00021306261,0.025056252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987801,0.00034447803,0.000055102235,0.00018527312,0.00049553957,0.00013949636],"domain_scores_gemma":[0.99849725,0.00083850103,0.00010050393,0.00012984363,0.00034070865,0.00009333557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016612096,0.0013794965,0.0013161685,0.0014234051,0.0009849201,0.00361811,0.003658487,0.0017123383,0.0041303243],"category_scores_gemma":[0.004363233,0.0006843503,0.0010952475,0.0015906852,0.0027901821,0.0040526283,0.0015893793,0.0035296367,0.0005894745],"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.000014635843,0.000054767268,0.00007094335,0.00005419088,0.000020652391,0.000034427398,0.000072525516,0.09348889,0.0007363303,0.89254385,0.0018237268,0.011084975],"study_design_scores_gemma":[0.000012532893,0.000028345848,0.000038569473,0.00001471826,0.000018920839,0.000019521227,0.000016851009,0.49301982,0.00025443343,0.50334466,0.0032176916,0.000014001602],"about_ca_topic_score_codex":0.003499246,"about_ca_topic_score_gemma":0.002403134,"teacher_disagreement_score":0.0041303243,"about_ca_system_score_codex":0.002267622,"about_ca_system_score_gemma":0.001767612,"threshold_uncertainty_score":0.016452849},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5553338,0.00062496855,0.44112614,0.00016852882,0.000031634172,0.000040303905,0.000103959566,0.0011781416,0.0013925133],"genre_scores_gemma":[0.9822665,0.000055441495,0.017268205,0.0000074192703,0.000008667424,0.000009895073,0.00004933237,0.00001866062,0.00031583753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950933,0.00012629367,0.000024280867,0.00010236773,0.00014533899,0.00009228137],"domain_scores_gemma":[0.9954787,0.0031809108,0.0002740888,0.00027854525,0.00064990186,0.00013784533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012649213,0.00039522332,0.0005902042,0.0009826298,0.0005829856,0.000634392,0.00097026443,0.0006144231,0.00061338744],"category_scores_gemma":[0.0076637706,0.00029502405,0.00019406395,0.0010376999,0.00041022725,0.000781493,0.0005694526,0.0006846775,0.00009868939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077130896,0.00014720143,0.014924526,0.00009177747,0.000042585267,0.000099816265,0.00020856397,0.86677825,0.007181852,0.002574595,0.0008125138,0.106367044],"study_design_scores_gemma":[0.0000016497054,0.0000070742512,0.0004896351,9.875673e-7,0.000001987855,0.000005512507,0.0000072671332,0.9988305,0.00046735615,0.00016443008,0.000021368154,0.0000022606353],"about_ca_topic_score_codex":0.031934872,"about_ca_topic_score_gemma":0.014799778,"teacher_disagreement_score":0.031934872,"about_ca_system_score_codex":0.0010662545,"about_ca_system_score_gemma":0.0010571309,"threshold_uncertainty_score":0.06349796},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6422236,0.011714574,0.29507592,0.0018716685,0.001033251,0.0006401948,0.0012922231,0.0020392814,0.044109322],"genre_scores_gemma":[0.8747335,0.0016687082,0.12012058,0.00033680664,0.0001100179,0.00030313857,0.0006605142,0.00023537168,0.0018313423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867684,0.0007671717,0.000077857614,0.00009566499,0.00017206221,0.00021045325],"domain_scores_gemma":[0.99188656,0.006639976,0.00024964285,0.0004133205,0.0005520763,0.0002584357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033529052,0.0015344452,0.0016033463,0.0021774552,0.00094764616,0.0015497613,0.002032973,0.002316782,0.0027775206],"category_scores_gemma":[0.0079682795,0.000767969,0.0014543405,0.0021079378,0.00067405816,0.0015053549,0.00076992187,0.0014318492,0.0003058795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036681266,0.00016423679,0.0006888855,0.00013538137,0.0001606325,0.000025203155,0.000045675242,0.96938086,0.00024266535,0.0023080169,0.0010141053,0.025467614],"study_design_scores_gemma":[0.00014844512,0.00023336329,0.00045255397,0.000041900385,0.00011107767,0.000015093751,0.00008784001,0.99624676,0.0003984285,0.0017271026,0.00052467175,0.000012765923],"about_ca_topic_score_codex":0.013566902,"about_ca_topic_score_gemma":0.014900839,"teacher_disagreement_score":0.013566902,"about_ca_system_score_codex":0.002497892,"about_ca_system_score_gemma":0.0026894545,"threshold_uncertainty_score":0.02697587},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39212438,0.004477857,0.5947674,0.0007422526,0.00021437756,0.00006612689,0.00011581163,0.00035348826,0.0071382793],"genre_scores_gemma":[0.9817949,0.000582558,0.016587747,0.00005282029,0.000073931646,0.0000144198975,0.000040249375,0.00001864403,0.00083472923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960345,0.00011669517,0.000019913781,0.00004809115,0.00013313453,0.00007878172],"domain_scores_gemma":[0.99766135,0.0013931382,0.00020502445,0.00030218868,0.00037694018,0.00006133933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006774847,0.0004093969,0.00042279574,0.00051582983,0.00051042455,0.00041753802,0.00062932057,0.0004363768,0.00042968418],"category_scores_gemma":[0.0035305996,0.00025381954,0.00021567328,0.00047756376,0.00051617733,0.00082007697,0.00053388876,0.0003972046,0.000104492356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015871258,0.00018219555,0.0041435696,0.0005494981,0.00020837011,0.0015566626,0.00065808726,0.35186955,0.24079055,0.09191386,0.0055816337,0.30095893],"study_design_scores_gemma":[0.000032050237,0.00040966674,0.0011185554,0.000028643522,0.000113654714,0.00080730073,0.00015386827,0.9402588,0.034617044,0.019279262,0.003150585,0.000030644733],"about_ca_topic_score_codex":0.0009805051,"about_ca_topic_score_gemma":0.0017713895,"teacher_disagreement_score":0.0009805051,"about_ca_system_score_codex":0.00035170454,"about_ca_system_score_gemma":0.00050683203,"threshold_uncertainty_score":0.0035828948},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04798873,0.00067189237,0.9474005,0.00019973853,0.000053607047,0.00014497554,0.000104796076,0.00042290855,0.0030128052],"genre_scores_gemma":[0.47292888,0.0005227722,0.5240859,0.00009595287,0.000052251075,0.00028024148,0.0002352513,0.0001260107,0.0016726963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994355,0.0002562698,0.00003527417,0.00007217016,0.00009683173,0.00010393702],"domain_scores_gemma":[0.9965713,0.0026972638,0.00024307854,0.00015831126,0.00022744745,0.000102581675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017215187,0.00095308037,0.0011764875,0.0016288528,0.0007503755,0.0011178028,0.0018555076,0.0014621706,0.002853302],"category_scores_gemma":[0.005883952,0.0010390453,0.0007946373,0.0013411524,0.0009736745,0.0017225934,0.0009637213,0.0008758987,0.00030672198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007322296,0.000047151214,0.00028881113,0.00007165969,0.000022145176,0.000027680702,0.00006607804,0.9555379,0.0005383334,0.006380067,0.0008764657,0.036070544],"study_design_scores_gemma":[0.0000341939,0.000033064487,0.000051558723,0.000010894707,0.000011227793,0.000011680603,0.00003066113,0.9920224,0.00027984512,0.0072272746,0.00028188562,0.000005300292],"about_ca_topic_score_codex":0.00308889,"about_ca_topic_score_gemma":0.0038005456,"teacher_disagreement_score":0.00308889,"about_ca_system_score_codex":0.0012619855,"about_ca_system_score_gemma":0.0012285648,"threshold_uncertainty_score":0.009545267},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2075291,0.0032643958,0.77502316,0.0020534822,0.0008094708,0.0000654295,0.00011576875,0.0008299327,0.010309288],"genre_scores_gemma":[0.97852236,0.000539493,0.016191581,0.00011099387,0.00035340787,0.00003865429,0.000049806917,0.000063903,0.0041297395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981504,0.0006181184,0.00007243286,0.0001831455,0.0006458728,0.00032992827],"domain_scores_gemma":[0.9904901,0.006441099,0.0004319006,0.00087204477,0.0011561732,0.000608675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003180197,0.0005557055,0.0011657497,0.0005169183,0.0010506611,0.0026847993,0.0012649026,0.0013985257,0.0016457911],"category_scores_gemma":[0.012769282,0.00057898666,0.00026718943,0.00089900603,0.001396064,0.002718476,0.0016773137,0.001562083,0.00039299388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019565532,0.00032776725,0.0045888256,0.00020523612,0.000116708674,0.00056709576,0.00070942735,0.41052657,0.02595557,0.35003778,0.0072341016,0.19777441],"study_design_scores_gemma":[0.00004071368,0.000088378736,0.0007528642,0.000007769097,0.000045085962,0.00009564882,0.00008236414,0.91183764,0.0026267755,0.08250909,0.0018903372,0.00002333517],"about_ca_topic_score_codex":0.0022816132,"about_ca_topic_score_gemma":0.0022938454,"teacher_disagreement_score":0.003180197,"about_ca_system_score_codex":0.0011564911,"about_ca_system_score_gemma":0.0012490186,"threshold_uncertainty_score":0.016818643},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016874868,0.002070416,0.9322247,0.0005739491,0.0010031537,0.00036996944,0.0006867754,0.03703938,0.009156719],"genre_scores_gemma":[0.51966846,0.0017583683,0.45450634,0.0011519532,0.000994518,0.0005893876,0.0018189612,0.0019735817,0.017538445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988632,0.0002140417,0.000084600695,0.00015663689,0.0005476946,0.00013386126],"domain_scores_gemma":[0.9981059,0.0005764183,0.00011225386,0.0004703111,0.00054865226,0.00018657136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016744288,0.0008910546,0.00093835685,0.0014128777,0.0010251357,0.0017453773,0.003211356,0.000978881,0.0040144552],"category_scores_gemma":[0.0053915875,0.00045034155,0.00044486183,0.00085057545,0.000720517,0.0018838277,0.0018657065,0.0025995271,0.0012523445],"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.0028436591,0.00046502126,0.0011612113,0.0006665803,0.00024457293,0.0006020572,0.0003362583,0.055941127,0.092093796,0.05392689,0.0815155,0.7102034],"study_design_scores_gemma":[0.0003001908,0.0003646337,0.00072931405,0.00006166235,0.00017088621,0.00084884156,0.000041375966,0.851859,0.07393937,0.020696523,0.050810393,0.0001777827],"about_ca_topic_score_codex":0.0019841488,"about_ca_topic_score_gemma":0.0022746194,"teacher_disagreement_score":0.0040144552,"about_ca_system_score_codex":0.00071985024,"about_ca_system_score_gemma":0.0009775306,"threshold_uncertainty_score":0.013429701},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046693657,0.00011784281,0.9521822,0.00013395188,0.000029217394,0.000029500881,0.000026044814,0.00025043747,0.00053710956],"genre_scores_gemma":[0.93980247,0.00008483671,0.05860423,0.0000622025,0.000056461184,0.00007923987,0.00007902073,0.000060867485,0.0011707137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903595,0.0004173292,0.000038289047,0.00023677018,0.00016253947,0.00010906348],"domain_scores_gemma":[0.99173707,0.0067488323,0.00038028255,0.0004910383,0.0004236694,0.00021899208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026975127,0.00054052344,0.0013333998,0.00060505845,0.0004930433,0.00093632477,0.0018712557,0.0010413686,0.0011687881],"category_scores_gemma":[0.011919863,0.00070114527,0.00054204185,0.0005425996,0.0015181184,0.0018986687,0.0017029187,0.0012162982,0.00016230917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020981365,0.00005643429,0.0021567002,0.000036050395,0.0000698446,0.00005537945,0.000080415106,0.9595927,0.0020833686,0.016176457,0.0003641016,0.019118678],"study_design_scores_gemma":[0.000005135748,0.000004333068,0.000065517015,9.245893e-7,0.0000022161348,0.000003888114,0.0000018337046,0.9978556,0.00011262584,0.0019246361,0.000021429052,0.0000018002913],"about_ca_topic_score_codex":0.0044953804,"about_ca_topic_score_gemma":0.0047410377,"teacher_disagreement_score":0.0044953804,"about_ca_system_score_codex":0.0009808915,"about_ca_system_score_gemma":0.000825842,"threshold_uncertainty_score":0.0142659545},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003269399,0.00028125782,0.9947167,0.0001265238,0.00009753905,0.000047236346,0.00003351421,0.00035454571,0.0010732369],"genre_scores_gemma":[0.28754514,0.0009058927,0.7044125,0.00027694143,0.00032603645,0.00032770954,0.0002662512,0.00018357522,0.0057558655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989242,0.00018431658,0.000066485656,0.00016106041,0.00058382,0.000080059384],"domain_scores_gemma":[0.9989611,0.0003653399,0.00006788765,0.00029775038,0.00026799642,0.000040021456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014238979,0.0008412884,0.00093932706,0.0007844768,0.000801611,0.00095887727,0.0018900584,0.00074310426,0.0030229017],"category_scores_gemma":[0.0034390008,0.0004808435,0.00066963694,0.0012284472,0.00075930974,0.0024972826,0.0026073384,0.0014017766,0.000686402],"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.00037429077,0.00020417244,0.000785734,0.00029586328,0.00016150536,0.00031326953,0.00019524118,0.3790956,0.042643968,0.085590005,0.009353856,0.48098642],"study_design_scores_gemma":[0.000013191146,0.000051488692,0.00010717685,0.0000090007625,0.000019030025,0.00006779437,0.000024058685,0.97240067,0.0054406924,0.019461518,0.0023941465,0.000011200337],"about_ca_topic_score_codex":0.0016402309,"about_ca_topic_score_gemma":0.0032274767,"teacher_disagreement_score":0.0030229017,"about_ca_system_score_codex":0.00068977,"about_ca_system_score_gemma":0.0010246675,"threshold_uncertainty_score":0.010112643},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86233926,0.0016933826,0.124764726,0.0014973386,0.00042017212,0.00012536577,0.0001845179,0.00035177075,0.008623466],"genre_scores_gemma":[0.9946518,0.000119743316,0.0044897823,0.000049095153,0.00007683873,0.000014263272,0.000024632503,0.000024096476,0.00054981373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951309,0.0023310801,0.0002222514,0.00051284966,0.00106955,0.00073337124],"domain_scores_gemma":[0.9387925,0.04847791,0.0018912248,0.0038746372,0.0057805507,0.0011831822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01047944,0.00069538254,0.0015364204,0.0010330023,0.001968804,0.0023496677,0.0017109758,0.0012683837,0.0013972756],"category_scores_gemma":[0.041941136,0.0004554874,0.0003507195,0.0009025679,0.0023843946,0.003271771,0.001981106,0.0014753775,0.00022336269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033093803,0.00035592171,0.0072610136,0.00015380392,0.0001334382,0.00024477358,0.0005018561,0.87664276,0.012241837,0.068207465,0.0029170816,0.028030677],"study_design_scores_gemma":[0.00003970263,0.00014488756,0.0006524141,0.0000064660026,0.000025447176,0.000058272777,0.00008065321,0.9886262,0.0019882892,0.0081596775,0.00019834173,0.000019606752],"about_ca_topic_score_codex":0.005219101,"about_ca_topic_score_gemma":0.0037195948,"teacher_disagreement_score":0.01047944,"about_ca_system_score_codex":0.0022220248,"about_ca_system_score_gemma":0.0020113075,"threshold_uncertainty_score":0.055421233},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15411316,0.006166458,0.70288444,0.0472569,0.022529192,0.0030473273,0.005337057,0.009376873,0.049288623],"genre_scores_gemma":[0.5696928,0.0023260533,0.25482658,0.004139846,0.007632606,0.0012668543,0.019926809,0.0027282564,0.13746013],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99127805,0.0033329886,0.00046932907,0.0012160451,0.0026212698,0.0010823474],"domain_scores_gemma":[0.97977346,0.007816322,0.00043097485,0.0022654529,0.007270132,0.0024435958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016432732,0.0018754633,0.004115822,0.0024898848,0.003621102,0.0066433754,0.0032452692,0.0039158408,0.01517898],"category_scores_gemma":[0.014478274,0.0008039346,0.0021117497,0.0010452594,0.0018073191,0.0048450325,0.0038470235,0.0034418327,0.0040941974],"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.005811962,0.0025143512,0.009030329,0.0011001768,0.00047162137,0.0013651607,0.00095127785,0.012202951,0.030205807,0.02546571,0.5026471,0.40823352],"study_design_scores_gemma":[0.0015142685,0.0027984276,0.017616015,0.00042668908,0.0007639335,0.001848699,0.0020323377,0.31881347,0.13206431,0.05301857,0.46872896,0.00037425515],"about_ca_topic_score_codex":0.008018792,"about_ca_topic_score_gemma":0.016628923,"teacher_disagreement_score":0.016432732,"about_ca_system_score_codex":0.002653491,"about_ca_system_score_gemma":0.0042908737,"threshold_uncertainty_score":0.08690566},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024832498,0.00039098013,0.9721344,0.00030165084,0.00014355872,0.000078168916,0.00007265529,0.00041388482,0.0016321202],"genre_scores_gemma":[0.9528044,0.00024556805,0.04446852,0.00017183104,0.000112990325,0.00012217785,0.00011473256,0.00004507618,0.0019148311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745315,0.00074050686,0.00012222659,0.00049584615,0.00060825935,0.00058000616],"domain_scores_gemma":[0.9963946,0.0022115065,0.00024443338,0.00013117558,0.0007899018,0.00022844179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040266393,0.0010765423,0.0031884415,0.0007732342,0.0011023864,0.0017994941,0.002720993,0.0013982927,0.0033079986],"category_scores_gemma":[0.005209064,0.0009125063,0.0012371324,0.00079503714,0.0016239277,0.0014534703,0.0023126835,0.002078986,0.00039078842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038393453,0.00013933633,0.0004869763,0.00006900972,0.000085255946,0.00009171846,0.00007565211,0.9603694,0.0017176683,0.010063855,0.0012037874,0.025313355],"study_design_scores_gemma":[0.00000780937,0.000011036539,0.0000358686,0.0000018223085,0.0000067760334,0.000004180884,0.0000020817608,0.9991326,0.00007992838,0.00068085804,0.00003288523,0.000004275282],"about_ca_topic_score_codex":0.025345035,"about_ca_topic_score_gemma":0.022074094,"teacher_disagreement_score":0.025345035,"about_ca_system_score_codex":0.0019527726,"about_ca_system_score_gemma":0.0045016287,"threshold_uncertainty_score":0.050395012},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0868339,0.0001902313,0.90899414,0.00025644476,0.00008955997,0.00016216333,0.000054444303,0.0005077708,0.0029113728],"genre_scores_gemma":[0.9553963,0.00007860193,0.041620295,0.00005676417,0.00008746654,0.00011443256,0.000053171643,0.00006355569,0.0025293939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703074,0.00074793445,0.00019367077,0.00046827536,0.0009420652,0.00061734585],"domain_scores_gemma":[0.9882302,0.0059821373,0.0012385487,0.0018775384,0.0021217228,0.0005498779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005345058,0.00063658005,0.0011481822,0.00121179,0.0016066525,0.0023600827,0.0025338768,0.0008290112,0.0028560995],"category_scores_gemma":[0.011039622,0.0004540793,0.0004113339,0.0007663742,0.0019104386,0.0024201241,0.002480937,0.0014852476,0.00041429873],"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.0049829604,0.0008708402,0.004003719,0.0002569598,0.00015687036,0.00041110363,0.0021450422,0.338473,0.059545606,0.3707358,0.008025174,0.21039294],"study_design_scores_gemma":[0.00008956892,0.00016119056,0.00029712098,0.000009179899,0.000037718684,0.000059872797,0.00007610197,0.96112514,0.0073229596,0.029567752,0.0012284028,0.000024982937],"about_ca_topic_score_codex":0.002264684,"about_ca_topic_score_gemma":0.002265115,"teacher_disagreement_score":0.005345058,"about_ca_system_score_codex":0.0018031973,"about_ca_system_score_gemma":0.0014695877,"threshold_uncertainty_score":0.028267741},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020709457,0.00073630066,0.96697456,0.0009137288,0.00013577091,0.00013304435,0.0003274934,0.00015369097,0.009915897],"genre_scores_gemma":[0.86531943,0.0014875089,0.11518859,0.0003201689,0.00021263913,0.00048088856,0.0005265098,0.00013312112,0.0163313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909544,0.00031362777,0.000029665362,0.00016902339,0.00020239525,0.00018992521],"domain_scores_gemma":[0.9991793,0.0004902243,0.0000931197,0.000034476445,0.00014902272,0.000053766336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012400434,0.0011666085,0.0015255467,0.00082860485,0.00058254733,0.0018040222,0.0020112942,0.0021714661,0.004788925],"category_scores_gemma":[0.0023370963,0.00064938003,0.00081823725,0.0013770852,0.00070360355,0.0016153889,0.0012459743,0.0015822245,0.00044937024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026944079,0.000028894761,0.00013050727,0.000048979444,0.000015293515,0.00004322697,0.000015247743,0.9865545,0.00036405463,0.007285452,0.0009644378,0.0045223734],"study_design_scores_gemma":[0.000005410055,0.000010492758,0.000046754652,0.0000033985564,0.0000053596773,0.000008033247,0.0000073572187,0.99766576,0.000046817786,0.0020276501,0.00017025167,0.0000026909368],"about_ca_topic_score_codex":0.008488754,"about_ca_topic_score_gemma":0.0061819446,"teacher_disagreement_score":0.008488754,"about_ca_system_score_codex":0.0018131341,"about_ca_system_score_gemma":0.0015985713,"threshold_uncertainty_score":0.016878664},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4340941,0.0008441092,0.53999484,0.0024448228,0.0002407446,0.00015613303,0.00027731876,0.00066099764,0.021286977],"genre_scores_gemma":[0.97963804,0.00021682685,0.018197197,0.00005978175,0.00007475007,0.00002919429,0.00003297082,0.00007723425,0.0016741082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852824,0.00047275182,0.00004131423,0.00013063115,0.00027291896,0.0005541316],"domain_scores_gemma":[0.99593157,0.0027948294,0.00034278558,0.00018771614,0.00036595823,0.0003772593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024220587,0.0011649732,0.0019035483,0.00091978855,0.0010804156,0.0030406397,0.0019784763,0.0013915423,0.0032105166],"category_scores_gemma":[0.009922992,0.0010718048,0.0003849506,0.0016792663,0.002018277,0.0029795675,0.0021704496,0.0017361168,0.00036461162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007551814,0.00020900431,0.0006620231,0.00013779447,0.00004125528,0.0003690504,0.00012888016,0.7354354,0.0054894113,0.22511306,0.0037639958,0.027894937],"study_design_scores_gemma":[0.00006601623,0.000037554917,0.00011853178,0.000007894281,0.00001190709,0.000052353593,0.000037887487,0.90781957,0.0010488572,0.09035199,0.00043538483,0.000012042944],"about_ca_topic_score_codex":0.0031130528,"about_ca_topic_score_gemma":0.0030641435,"teacher_disagreement_score":0.0032105166,"about_ca_system_score_codex":0.0023715838,"about_ca_system_score_gemma":0.002255788,"threshold_uncertainty_score":0.017207086},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044673044,0.00057590165,0.94444543,0.0011768993,0.00011566421,0.00010848625,0.000047128437,0.00008448128,0.008772922],"genre_scores_gemma":[0.9620943,0.0004337625,0.031574715,0.00012393617,0.00010709602,0.00012878688,0.000018940638,0.00002676862,0.005491666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972875,0.001508178,0.00006957242,0.00018032141,0.0006371475,0.00031737823],"domain_scores_gemma":[0.99702555,0.0020826554,0.00025094967,0.000102495316,0.000379455,0.0001588675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003253883,0.0011396143,0.0012493363,0.00082301826,0.0007951114,0.002366689,0.002580936,0.0017922712,0.0015379259],"category_scores_gemma":[0.006836907,0.0008184844,0.00060499244,0.0009043481,0.0025125688,0.003199658,0.0016645155,0.0015967923,0.00018275218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103738465,0.00007575127,0.00023034072,0.00005520543,0.000043463428,0.00009966189,0.00016172804,0.84335095,0.0015890494,0.14184162,0.0011006546,0.0113477735],"study_design_scores_gemma":[0.000012526782,0.000016089967,0.00004456794,0.0000037501686,0.000008176262,0.000015053225,0.00002305553,0.9678753,0.0001953849,0.03157236,0.00022540928,0.0000083039895],"about_ca_topic_score_codex":0.008234299,"about_ca_topic_score_gemma":0.0049982304,"teacher_disagreement_score":0.008234299,"about_ca_system_score_codex":0.0028960044,"about_ca_system_score_gemma":0.0027958346,"threshold_uncertainty_score":0.021012127},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018590456,0.00030168338,0.97788095,0.00014972429,0.00014757099,0.0000581873,0.000024340077,0.0011284632,0.0017186034],"genre_scores_gemma":[0.6644455,0.00021862584,0.33175415,0.00024266026,0.00019799762,0.00015098922,0.00012966254,0.00024077966,0.0026195336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992142,0.0002810603,0.000051153558,0.00012325191,0.0002267436,0.00010354175],"domain_scores_gemma":[0.9980094,0.0011200183,0.00011828437,0.00014341253,0.00048462697,0.00012440672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020843113,0.0008468759,0.0011487714,0.0008605878,0.0009214161,0.001058397,0.0021286306,0.00083591667,0.002486034],"category_scores_gemma":[0.0044382466,0.00044809002,0.00041140016,0.0006146509,0.00073817524,0.0011901571,0.0009158446,0.0010609213,0.00064724835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010669758,0.00033926143,0.00074771774,0.00014697651,0.00009321179,0.00014025613,0.00018868521,0.65901446,0.02670161,0.010359261,0.005050892,0.29615062],"study_design_scores_gemma":[0.000028857738,0.00003478744,0.00004005637,0.000002240252,0.000006143903,0.000011225138,0.000005761715,0.99811006,0.0010060801,0.00056956586,0.00018042435,0.0000048068077],"about_ca_topic_score_codex":0.0048917895,"about_ca_topic_score_gemma":0.0059685186,"teacher_disagreement_score":0.0048917895,"about_ca_system_score_codex":0.0013699053,"about_ca_system_score_gemma":0.0014803128,"threshold_uncertainty_score":0.011023045},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054754183,0.00042241122,0.99558866,0.00033820656,0.00010950481,0.00010107364,0.00002133281,0.00026770882,0.0026035928],"genre_scores_gemma":[0.05494838,0.001564732,0.9336269,0.00052483333,0.00028933896,0.00057930325,0.00012012999,0.00023155441,0.008114824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935762,0.0016440726,0.00058102567,0.0006835808,0.0030877101,0.0004273751],"domain_scores_gemma":[0.99581474,0.0007485552,0.00019268594,0.0020342292,0.0011026347,0.00010725529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027066655,0.0016016528,0.001480224,0.003088439,0.0027570245,0.0037932787,0.0035181288,0.0029253685,0.003146356],"category_scores_gemma":[0.0067086187,0.0010727819,0.0025263496,0.002392936,0.005173341,0.0071527273,0.004809036,0.0058825603,0.00277518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034006378,0.000062947336,0.00017733697,0.00025084216,0.000041073898,0.00014826034,0.0002738619,0.0057836818,0.0037902507,0.903299,0.0046972013,0.08144156],"study_design_scores_gemma":[0.000031427466,0.000098117365,0.0001438973,0.0002092364,0.00009807807,0.0006744939,0.00012611525,0.05266879,0.008700086,0.87604284,0.0611255,0.00008135007],"about_ca_topic_score_codex":0.0014083025,"about_ca_topic_score_gemma":0.00194235,"teacher_disagreement_score":0.0037932787,"about_ca_system_score_codex":0.0019505222,"about_ca_system_score_gemma":0.0036505125,"threshold_uncertainty_score":0.0143143535},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0130283525,0.0006134177,0.9760109,0.00054078276,0.0002773854,0.00005258599,0.00029432552,0.0002743337,0.0089078285],"genre_scores_gemma":[0.842022,0.0039587957,0.13019925,0.00033022795,0.00063523604,0.00031674563,0.0010348057,0.00027377158,0.021229072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996822,0.00007509562,0.000017200651,0.000059205817,0.00012001161,0.00004640298],"domain_scores_gemma":[0.99965703,0.00009650772,0.000056427474,0.00005966372,0.000093127004,0.00003727957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033232028,0.00062894553,0.0007984617,0.00065255683,0.0005542353,0.0011449979,0.0016586627,0.0009256446,0.00146261],"category_scores_gemma":[0.0013889452,0.00039105956,0.0006691796,0.0010369972,0.00066600187,0.0021858322,0.0013469068,0.0009382814,0.0006160397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017506816,0.00002208972,0.00038637803,0.000042896103,0.00001904124,0.0001706002,0.000056433415,0.84062475,0.0017435363,0.14490573,0.0023450875,0.009665938],"study_design_scores_gemma":[0.0000036312556,0.000007941571,0.00006596304,0.00000475954,0.0000069880625,0.000038360417,0.00001064491,0.98225534,0.000118685246,0.0152403675,0.0022405137,0.000006798217],"about_ca_topic_score_codex":0.0059263594,"about_ca_topic_score_gemma":0.0038980371,"teacher_disagreement_score":0.0059263594,"about_ca_system_score_codex":0.00095172285,"about_ca_system_score_gemma":0.00090454967,"threshold_uncertainty_score":0.011783779},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046757413,0.8433426,0.13432944,0.0023723508,0.001839754,0.00022699413,0.00022028948,0.00049572863,0.01249715],"genre_scores_gemma":[0.026842955,0.89116096,0.07355061,0.00083138666,0.0028040044,0.0002201395,0.00061180134,0.0001166231,0.003861452],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99741083,0.00047155857,0.00043556673,0.00038082618,0.0011590614,0.00014216463],"domain_scores_gemma":[0.99486107,0.0033396238,0.00025678053,0.0004371345,0.00096204504,0.00014333185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032666326,0.0015869287,0.0027296282,0.0032828082,0.0009933345,0.0050241477,0.0031680232,0.0024806065,0.0034974758],"category_scores_gemma":[0.007101894,0.0011398097,0.00083715696,0.009672769,0.001261127,0.010113766,0.0018083896,0.0027666392,0.0021722885],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012875747,0.0003054447,0.0012930636,0.006705636,0.00011443257,0.00014229091,0.00021700251,0.011237562,0.0019019669,0.044077247,0.022126496,0.91175],"study_design_scores_gemma":[0.000120680714,0.0006719133,0.002038442,0.003552488,0.00043176027,0.00299489,0.0008205302,0.06815908,0.005130195,0.13395669,0.78195083,0.00017261774],"about_ca_topic_score_codex":0.001260368,"about_ca_topic_score_gemma":0.0009036926,"teacher_disagreement_score":0.0050241477,"about_ca_system_score_codex":0.0010589694,"about_ca_system_score_gemma":0.0018563468,"threshold_uncertainty_score":0.01727581},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008851511,0.00009057765,0.98212415,0.00018931802,0.000076241224,0.00012339852,0.00003189025,0.0041687097,0.0043441937],"genre_scores_gemma":[0.32369596,0.00028987566,0.65731514,0.00022213577,0.00010097133,0.00035431125,0.00040449123,0.0003967496,0.017220365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867576,0.00032898245,0.00012318643,0.00018814454,0.0005242491,0.00015958455],"domain_scores_gemma":[0.99836904,0.00027283907,0.00007499125,0.00048820066,0.00047328314,0.00032158633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019877004,0.0006067097,0.0006793795,0.00070711045,0.0018139128,0.003551171,0.0032361986,0.0022071577,0.0043217856],"category_scores_gemma":[0.0030724443,0.0006353811,0.00051685254,0.000619518,0.0009259092,0.0047754147,0.004415799,0.002131012,0.0019949821],"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.0014370725,0.0012752992,0.003372893,0.00040358235,0.00024997775,0.0011413941,0.003904504,0.10831986,0.06406147,0.2919196,0.03613317,0.4877811],"study_design_scores_gemma":[0.000087140135,0.00039075626,0.00076554314,0.00006947788,0.00014758094,0.00047752797,0.00035459612,0.855568,0.024783252,0.060041416,0.057188995,0.00012568923],"about_ca_topic_score_codex":0.002460439,"about_ca_topic_score_gemma":0.0034859162,"teacher_disagreement_score":0.0043217856,"about_ca_system_score_codex":0.0006804898,"about_ca_system_score_gemma":0.0010910175,"threshold_uncertainty_score":0.014457822},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021357404,0.0017278866,0.97042626,0.00054902874,0.00009989378,0.00006814224,0.0000625797,0.00012066395,0.0055881804],"genre_scores_gemma":[0.710823,0.005770105,0.278024,0.00020866717,0.00038242355,0.00027930012,0.00019970458,0.00023368701,0.0040790914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940264,0.00025321456,0.0000326992,0.00006363648,0.00018034644,0.000067486755],"domain_scores_gemma":[0.9978713,0.001518652,0.00018888217,0.00010045788,0.00026331955,0.000057375644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012630774,0.0008490264,0.0007193767,0.0006566585,0.00049034203,0.0011501975,0.0014883789,0.00085297535,0.0018302039],"category_scores_gemma":[0.005820677,0.0006662386,0.00034943793,0.0008038465,0.0007296187,0.0017955456,0.0011319935,0.00066858064,0.00030482683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001664151,0.000030208763,0.00050407037,0.0004025155,0.00005181106,0.00018778375,0.00015205567,0.8440879,0.007858011,0.08237058,0.0032813468,0.060907394],"study_design_scores_gemma":[0.000021442727,0.000071656286,0.000116572155,0.000032088723,0.000021239024,0.000051025872,0.000035428213,0.964883,0.001350533,0.03027021,0.003134965,0.000011832362],"about_ca_topic_score_codex":0.0013422641,"about_ca_topic_score_gemma":0.001213099,"teacher_disagreement_score":0.0018302039,"about_ca_system_score_codex":0.0008436659,"about_ca_system_score_gemma":0.0006839031,"threshold_uncertainty_score":0.0066798925},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051460315,0.0003737715,0.94617975,0.00034243346,0.000043638407,0.000028698983,0.00019115758,0.00044446148,0.00093568297],"genre_scores_gemma":[0.9418548,0.0003130516,0.055860985,0.00006404314,0.000112120324,0.0000717824,0.00036524227,0.00007290884,0.0012849837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986902,0.0005045715,0.00005575547,0.0003004535,0.00033544155,0.000113625676],"domain_scores_gemma":[0.9863484,0.010940491,0.00074380904,0.00096136506,0.0007978734,0.0002080264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028069147,0.00079534174,0.0018159369,0.0011647596,0.00056006585,0.001471687,0.0019817746,0.0015871434,0.001536588],"category_scores_gemma":[0.021320483,0.0015808279,0.0007680872,0.0016790001,0.0011096521,0.0033712923,0.0016337398,0.0018301804,0.00022869716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006141402,0.000022548917,0.0008935594,0.000026580014,0.000034976743,0.000032782395,0.00001371896,0.98180354,0.00039618782,0.008105519,0.00043481006,0.0081743095],"study_design_scores_gemma":[0.0000017134137,0.0000018340552,0.00009429039,8.521002e-7,0.000002433928,0.0000039639663,0.0000010980852,0.99629945,0.000058879057,0.0035026264,0.00003112862,0.0000018166924],"about_ca_topic_score_codex":0.006430954,"about_ca_topic_score_gemma":0.0062517016,"teacher_disagreement_score":0.006430954,"about_ca_system_score_codex":0.0012117957,"about_ca_system_score_gemma":0.0010019357,"threshold_uncertainty_score":0.014844596},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09470492,0.0006483019,0.8970383,0.0002579315,0.00004938457,0.0000474356,0.000096095435,0.00027213502,0.006885495],"genre_scores_gemma":[0.9459044,0.00018724421,0.051286276,0.000075040276,0.000047914742,0.00006147513,0.00005367502,0.000043322885,0.0023407447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956256,0.00013965585,0.0000146720795,0.000056854034,0.000119351156,0.00010690613],"domain_scores_gemma":[0.99923325,0.00047670194,0.00007333561,0.00006709377,0.00009309862,0.000056416568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089580123,0.0004871826,0.000707578,0.00055495254,0.00047554937,0.00074806396,0.0012526159,0.00051756395,0.0021045334],"category_scores_gemma":[0.0019695857,0.000334364,0.00025422644,0.00085724454,0.0005531259,0.0010000342,0.0010243083,0.0004553747,0.00020461711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102566206,0.000044763863,0.00040197253,0.000048237875,0.000034718403,0.000042266496,0.0000416626,0.95714444,0.0033520735,0.013171897,0.001111979,0.0245034],"study_design_scores_gemma":[0.0000057744337,0.000013468241,0.000093654024,0.0000014237193,0.0000061967767,0.000010667666,0.000009397749,0.9953157,0.00024614052,0.00416331,0.00013161828,0.0000027857159],"about_ca_topic_score_codex":0.0027650571,"about_ca_topic_score_gemma":0.0053615794,"teacher_disagreement_score":0.0027650571,"about_ca_system_score_codex":0.0010881729,"about_ca_system_score_gemma":0.00068509526,"threshold_uncertainty_score":0.007895291},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24600331,0.00031206323,0.7491255,0.00036504475,0.00012521762,0.000041250627,0.00008361434,0.0007817374,0.003162361],"genre_scores_gemma":[0.9737637,0.000038897695,0.025370976,0.00002931653,0.00002729887,0.000018966735,0.000039630177,0.000018978822,0.0006921955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996413,0.00010085061,0.00001236741,0.00006529588,0.000100021796,0.00008015163],"domain_scores_gemma":[0.9988049,0.0006440873,0.00010810515,0.00014178004,0.0002358137,0.00006524709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008649902,0.0004266717,0.00047991896,0.0005169065,0.0005225522,0.00062332593,0.001134759,0.0003936281,0.0010560981],"category_scores_gemma":[0.0022965632,0.0002766871,0.00016560745,0.00051687175,0.0004337239,0.0011479788,0.00068435003,0.00066038163,0.00014759986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050227664,0.00022958407,0.0016982298,0.000033416152,0.000041382376,0.000053390002,0.00006574232,0.84773105,0.013616646,0.0067474563,0.0017291342,0.12755167],"study_design_scores_gemma":[0.0000033375668,0.000007001824,0.00007502177,5.6247364e-7,0.0000020003515,0.0000043930645,0.00000304784,0.99805367,0.00070435624,0.0010879692,0.000056462344,0.0000021217536],"about_ca_topic_score_codex":0.003448879,"about_ca_topic_score_gemma":0.0066864477,"teacher_disagreement_score":0.003448879,"about_ca_system_score_codex":0.0007608635,"about_ca_system_score_gemma":0.0007736009,"threshold_uncertainty_score":0.006857574},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17186737,0.00029325837,0.81941456,0.00053625857,0.0000921346,0.00018503249,0.000072209354,0.0055040354,0.002035213],"genre_scores_gemma":[0.8877092,0.000056470788,0.109992854,0.00019186221,0.00009462671,0.00015678389,0.00007399551,0.000346919,0.0013772637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9825514,0.009176255,0.0009510575,0.0027018087,0.0025752664,0.0020441033],"domain_scores_gemma":[0.7596581,0.15041229,0.013700916,0.058581904,0.012067631,0.0055792257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012700512,0.001809279,0.002356856,0.0022905096,0.0016492632,0.0026733314,0.006137359,0.0024626357,0.004993968],"category_scores_gemma":[0.07616233,0.0015339353,0.0010113458,0.0007666598,0.0029640503,0.0112951975,0.007478928,0.0038897218,0.0007114273],"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.008105781,0.0031530953,0.053432755,0.0012658412,0.0007085732,0.0029057956,0.0031502312,0.17185333,0.096281804,0.077984266,0.00561338,0.5755452],"study_design_scores_gemma":[0.0007550443,0.0024117825,0.0038538685,0.0001472823,0.00043646464,0.0015750219,0.00049117894,0.80518174,0.07359594,0.107988425,0.0033435638,0.00021964534],"about_ca_topic_score_codex":0.0011981181,"about_ca_topic_score_gemma":0.0021199428,"teacher_disagreement_score":0.012700512,"about_ca_system_score_codex":0.0007889351,"about_ca_system_score_gemma":0.0028258343,"threshold_uncertainty_score":0.06716752},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68304294,0.0008134838,0.30665123,0.00097402354,0.00011799829,0.00010857508,0.00030142293,0.00071352854,0.0072768843],"genre_scores_gemma":[0.9969536,0.00005929329,0.0024186792,0.000019318328,0.000018356051,0.000023525936,0.00002900348,0.000017106719,0.0004612874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982692,0.00065097614,0.00007839435,0.00026489096,0.0004399217,0.0002965507],"domain_scores_gemma":[0.97577083,0.017743409,0.0023534573,0.0008629544,0.0027392446,0.000530141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036021343,0.00072338665,0.00095725973,0.0012875526,0.0011052081,0.001654276,0.0010758297,0.0010328237,0.0023949188],"category_scores_gemma":[0.022065978,0.00046132365,0.0004119828,0.0005676581,0.0011605362,0.0014037732,0.0013059115,0.0010885306,0.00026686257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018450153,0.00017100753,0.0038970625,0.00024281624,0.00013924722,0.00033783013,0.00047538552,0.9058079,0.016680408,0.043339357,0.0019234202,0.025140615],"study_design_scores_gemma":[0.000029030249,0.00008452583,0.00051617547,0.000007730101,0.000020663378,0.000039398048,0.000026873977,0.99188495,0.0016717047,0.005595487,0.00011264551,0.000010793469],"about_ca_topic_score_codex":0.0027125515,"about_ca_topic_score_gemma":0.0017091858,"teacher_disagreement_score":0.0036021343,"about_ca_system_score_codex":0.0015746527,"about_ca_system_score_gemma":0.0007742078,"threshold_uncertainty_score":0.019050121},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.139122,0.002726779,0.8515403,0.0005257198,0.0002233297,0.00020659645,0.00023779695,0.0017008543,0.003716625],"genre_scores_gemma":[0.91183716,0.0004959965,0.08454216,0.000118389806,0.00012123559,0.00008425597,0.00011959621,0.00008078158,0.0026005004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866045,0.00031472603,0.00008849934,0.00014042597,0.00055250834,0.00024337335],"domain_scores_gemma":[0.9964539,0.0014877825,0.00027051184,0.000697744,0.0008957536,0.00019433146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015805162,0.0007696361,0.0019464986,0.0013356515,0.0014174263,0.0018191638,0.0028434978,0.0010139004,0.0017811015],"category_scores_gemma":[0.0063313213,0.0005052487,0.00031894076,0.001905528,0.0010407438,0.0025727027,0.0015824965,0.0010212794,0.00028040714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031825316,0.00079895905,0.0034002601,0.0004456208,0.00021393909,0.00043833445,0.0005696286,0.45675898,0.039972037,0.097618766,0.017278258,0.37932256],"study_design_scores_gemma":[0.00005522574,0.00016415348,0.00021302156,0.000009295609,0.000048370373,0.0001406195,0.000045413984,0.98770577,0.0029751325,0.0077403863,0.0008761074,0.000026443653],"about_ca_topic_score_codex":0.004786028,"about_ca_topic_score_gemma":0.008325115,"teacher_disagreement_score":0.004786028,"about_ca_system_score_codex":0.0022426483,"about_ca_system_score_gemma":0.002215053,"threshold_uncertainty_score":0.01627165},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036981073,0.00048449644,0.99461305,0.00011090133,0.00004513844,0.00003618307,0.000010050015,0.000121941455,0.0008801607],"genre_scores_gemma":[0.24641702,0.001708584,0.7476573,0.00019515272,0.0001307657,0.00028917138,0.00009641138,0.00022024925,0.0032853417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992065,0.0002192717,0.000052632986,0.00008171493,0.00038849047,0.000051497067],"domain_scores_gemma":[0.99889237,0.0003731292,0.000095605,0.00013816166,0.00047344613,0.000027345563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014951355,0.0010586794,0.00068371574,0.0007960359,0.00041481602,0.001086276,0.0018434279,0.00077459525,0.0010526201],"category_scores_gemma":[0.0042228745,0.0004989226,0.0004889733,0.00076766685,0.00048541554,0.0016211121,0.0007094537,0.0011485405,0.00034258678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012124629,0.00013692139,0.00061952387,0.00034155525,0.00008709148,0.000057263296,0.000107259075,0.5830926,0.028678149,0.10483826,0.002306139,0.279614],"study_design_scores_gemma":[0.000011973942,0.000084138934,0.00015146453,0.00001764962,0.00002812845,0.00007339302,0.00001064362,0.97848094,0.007271056,0.010509621,0.0033479137,0.000013189411],"about_ca_topic_score_codex":0.0010221564,"about_ca_topic_score_gemma":0.0012459862,"teacher_disagreement_score":0.0018434279,"about_ca_system_score_codex":0.0008433789,"about_ca_system_score_gemma":0.0008005686,"threshold_uncertainty_score":0.007907152},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34708315,0.0033615318,0.624508,0.004144075,0.0006268467,0.00030110095,0.00011806563,0.0038448793,0.016012322],"genre_scores_gemma":[0.9767889,0.00047716126,0.019794958,0.00038385615,0.00015026334,0.00004163309,0.00006883311,0.00013125288,0.0021632072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99671715,0.00097378454,0.00011784068,0.00043654835,0.0012964671,0.000458141],"domain_scores_gemma":[0.98939615,0.006108906,0.0008499809,0.0016385732,0.0014802082,0.0005261294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035001177,0.00077364914,0.0012312451,0.000971621,0.0020227174,0.0021136578,0.0014259781,0.0023853693,0.0013301268],"category_scores_gemma":[0.019082582,0.0004697709,0.0003969067,0.00093391596,0.002059216,0.0041100993,0.0033935083,0.0026730974,0.00042054598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036261268,0.0007735826,0.013550513,0.0004257046,0.0004014425,0.0019680872,0.0016516659,0.4453799,0.07102653,0.12850498,0.024796406,0.307895],"study_design_scores_gemma":[0.00007594642,0.00024186251,0.00087619154,0.00002496261,0.00005305394,0.00045099572,0.00029019656,0.9282249,0.011564687,0.053311385,0.0048602903,0.000025470179],"about_ca_topic_score_codex":0.0014749421,"about_ca_topic_score_gemma":0.0011344046,"teacher_disagreement_score":0.0035001177,"about_ca_system_score_codex":0.0009221661,"about_ca_system_score_gemma":0.0009460894,"threshold_uncertainty_score":0.01851064},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4502827,0.016907547,0.28041646,0.03129115,0.0019494066,0.00014070774,0.0012884423,0.00025484592,0.21746871],"genre_scores_gemma":[0.9762007,0.0033075814,0.0076439846,0.0004095293,0.0006199604,0.000054449825,0.0001397972,0.00014126256,0.011482737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989446,0.00037497643,0.00004047108,0.00010455696,0.0002906879,0.00024476883],"domain_scores_gemma":[0.9821821,0.015938198,0.0003766395,0.0006511006,0.0006093852,0.00024250861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002008898,0.000870321,0.0009590271,0.0017374925,0.00094375055,0.0023307465,0.002044418,0.0018676993,0.014922561],"category_scores_gemma":[0.017557165,0.0005438389,0.0006573785,0.0019883523,0.0027600979,0.007948395,0.0015998436,0.0022035744,0.00055166567],"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.00040699306,0.00009670677,0.0010369765,0.00023099336,0.00005522712,0.00020659086,0.00008068033,0.22082412,0.0019393845,0.7276589,0.0073174476,0.04014582],"study_design_scores_gemma":[0.000042472304,0.00006585967,0.0014452075,0.000089064546,0.000061409046,0.00018376748,0.00016947869,0.3871244,0.0011811823,0.60601366,0.00358191,0.00004156503],"about_ca_topic_score_codex":0.0020118237,"about_ca_topic_score_gemma":0.0018470656,"teacher_disagreement_score":0.014922561,"about_ca_system_score_codex":0.0026672373,"about_ca_system_score_gemma":0.000724601,"threshold_uncertainty_score":0.049920917},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042154647,0.0012216477,0.95309275,0.0004102266,0.000108869426,0.00007899215,0.00007075829,0.0003272064,0.0025348458],"genre_scores_gemma":[0.67490757,0.000884912,0.3207438,0.00015293356,0.00018490056,0.00017142764,0.00023710453,0.00014389856,0.0025734843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906737,0.0003694491,0.00005633259,0.00012749912,0.00026043158,0.00011892037],"domain_scores_gemma":[0.99674964,0.0020321144,0.00025078576,0.00032857226,0.00051366596,0.00012513943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018564324,0.0006780512,0.0011328505,0.0011088147,0.0011159951,0.0009985375,0.00304349,0.00113083,0.0011634147],"category_scores_gemma":[0.0076887025,0.00066723087,0.00047360573,0.0023162002,0.0006610233,0.0023876023,0.0016978703,0.0009828499,0.00028787574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022456347,0.000095175885,0.00088593835,0.00009550849,0.00007267219,0.00004708736,0.00015203684,0.8702255,0.00250845,0.018685715,0.002305229,0.10470212],"study_design_scores_gemma":[0.000018681974,0.000029400991,0.00014590465,0.0000066378566,0.000012959681,0.000029146635,0.000032709184,0.990921,0.0006466729,0.007576316,0.00057270436,0.000007735598],"about_ca_topic_score_codex":0.003790409,"about_ca_topic_score_gemma":0.0047010398,"teacher_disagreement_score":0.003790409,"about_ca_system_score_codex":0.0009891904,"about_ca_system_score_gemma":0.0011139611,"threshold_uncertainty_score":0.009817839},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032978412,0.00029995016,0.9927295,0.00014704505,0.000080303405,0.000048575337,0.000037037786,0.00037772127,0.0029821056],"genre_scores_gemma":[0.54569274,0.0013197599,0.43579638,0.00018210323,0.00022813736,0.00037516264,0.00022226061,0.00019135521,0.015992109],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996319,0.00006509574,0.00002420498,0.000050988263,0.00016976244,0.000057966572],"domain_scores_gemma":[0.99977463,0.00006276078,0.00001807793,0.000038500868,0.00007981195,0.000026136548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063924934,0.0005173807,0.00057943776,0.00058549363,0.0007003756,0.0015644013,0.0018340076,0.00067830266,0.0027054108],"category_scores_gemma":[0.00087630306,0.00025197066,0.00045171392,0.00048732705,0.00040730785,0.0015564814,0.0012299288,0.0009487343,0.0006604959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105218794,0.00021301818,0.0004844655,0.00018997326,0.000081524726,0.00041696598,0.000257873,0.4356977,0.021309825,0.38591665,0.0072293826,0.1480974],"study_design_scores_gemma":[0.000010129407,0.00003307845,0.00008263758,0.000011416746,0.000022401517,0.00008243451,0.000036847243,0.95964664,0.0020990032,0.030936569,0.0070266305,0.000012268254],"about_ca_topic_score_codex":0.0020272995,"about_ca_topic_score_gemma":0.0033208572,"teacher_disagreement_score":0.0027054108,"about_ca_system_score_codex":0.0006435666,"about_ca_system_score_gemma":0.0009571393,"threshold_uncertainty_score":0.009050548},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16350327,0.0011960506,0.80381334,0.00065685826,0.00044306848,0.0006180716,0.0024479525,0.0115867555,0.015734635],"genre_scores_gemma":[0.85705364,0.00043198286,0.12373922,0.00022908942,0.00007395551,0.00024942236,0.0021182247,0.00012655562,0.015977904],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915695,0.0001586079,0.00005483162,0.00017154233,0.000309868,0.00014823992],"domain_scores_gemma":[0.99872464,0.00021239495,0.00013975521,0.00065064925,0.00016610355,0.000106497944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088800467,0.0005362383,0.00097587006,0.0007890369,0.0010079526,0.0007545839,0.0023096302,0.0010073478,0.0029705158],"category_scores_gemma":[0.0016842737,0.00029249003,0.00053077354,0.0011704214,0.0006833353,0.0025124229,0.0038164004,0.0008974975,0.0013126814],"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.0052692005,0.00052158,0.0067654843,0.0007225259,0.00028662276,0.0010600396,0.00094287447,0.075475365,0.12913656,0.049825776,0.039865885,0.69012815],"study_design_scores_gemma":[0.0005239907,0.0021301657,0.006400042,0.00009613517,0.0002674127,0.002736614,0.00084603066,0.70471644,0.16638319,0.028523074,0.08709749,0.00027935748],"about_ca_topic_score_codex":0.0013724674,"about_ca_topic_score_gemma":0.001647409,"teacher_disagreement_score":0.0029705158,"about_ca_system_score_codex":0.0006357736,"about_ca_system_score_gemma":0.0009778977,"threshold_uncertainty_score":0.009937346},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055011872,0.001041799,0.9349905,0.0015808863,0.00019492189,0.00007330939,0.000062274754,0.0002611195,0.0067832386],"genre_scores_gemma":[0.921324,0.0010375417,0.07199887,0.00016755472,0.00025650434,0.00008441482,0.00009273587,0.00009816125,0.004940266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967121,0.0018090012,0.0001099968,0.00037778873,0.00056259497,0.00042845056],"domain_scores_gemma":[0.98251027,0.012173229,0.0009254154,0.0023442023,0.0015496277,0.00049720606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005525171,0.0007333751,0.0016263811,0.0012229495,0.0016950261,0.003326765,0.0022559576,0.0022941555,0.003750689],"category_scores_gemma":[0.026849676,0.00077698054,0.00051717635,0.002177274,0.002934109,0.007702456,0.0035645799,0.0028582977,0.0007147211],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007180125,0.00014857424,0.0019635241,0.000117497155,0.000046055968,0.00015105333,0.0002792988,0.32988492,0.0013071803,0.59512657,0.0058517563,0.0644056],"study_design_scores_gemma":[0.000031620715,0.000038077862,0.0001803096,0.000014564081,0.000017928858,0.000038778297,0.0000692098,0.767099,0.0005624697,0.23094358,0.0009923712,0.000012118783],"about_ca_topic_score_codex":0.0014972612,"about_ca_topic_score_gemma":0.0015108602,"teacher_disagreement_score":0.005525171,"about_ca_system_score_codex":0.0015415304,"about_ca_system_score_gemma":0.0017761885,"threshold_uncertainty_score":0.029220223},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28882495,0.0013539521,0.69650877,0.0008605439,0.00055337575,0.000096760705,0.00010503395,0.0012397341,0.010456925],"genre_scores_gemma":[0.9789122,0.000113164315,0.018921416,0.00007193868,0.00009102483,0.000021767533,0.00004241117,0.000031762684,0.0017943179],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966216,0.00008812013,0.000014939839,0.000051072788,0.000079500875,0.00010425109],"domain_scores_gemma":[0.99900526,0.00034470524,0.00009847389,0.00037548266,0.00011816753,0.00005793753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006401257,0.0004137523,0.00048944453,0.00047346487,0.00096611667,0.00086202397,0.00095393835,0.00054111367,0.0043471013],"category_scores_gemma":[0.0014113548,0.00017573619,0.0003151895,0.00036344316,0.0007479745,0.0014183004,0.0009140309,0.00061761786,0.00031191652],"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.0040052007,0.00026273236,0.0014904987,0.000443953,0.00020907116,0.0008539451,0.0008026624,0.3039453,0.08717899,0.16178334,0.016366344,0.42265794],"study_design_scores_gemma":[0.0002426622,0.0006321957,0.00082405156,0.000049151982,0.00012742952,0.00043770726,0.0001994785,0.7708632,0.03979489,0.17778067,0.009012883,0.000035752895],"about_ca_topic_score_codex":0.0005302532,"about_ca_topic_score_gemma":0.0011689517,"teacher_disagreement_score":0.0043471013,"about_ca_system_score_codex":0.00074361253,"about_ca_system_score_gemma":0.00064531306,"threshold_uncertainty_score":0.01454258},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41844225,0.003253472,0.55773026,0.002681015,0.0008935374,0.00030269998,0.0005177354,0.0024043927,0.013774635],"genre_scores_gemma":[0.9756454,0.00025295647,0.022836462,0.000105995015,0.0001263528,0.000028399665,0.00011667037,0.000072290866,0.0008155853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925107,0.0001589836,0.000036595215,0.00013244376,0.00019711473,0.00022370857],"domain_scores_gemma":[0.9968604,0.0010786306,0.0003231583,0.0005588118,0.00071302097,0.0004660457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015636039,0.0005691913,0.00074342405,0.00062082603,0.0014491541,0.002258653,0.0021960991,0.00074652146,0.0041326922],"category_scores_gemma":[0.0067391144,0.00055603427,0.0003127398,0.00074876327,0.0004594298,0.0030924778,0.0017097669,0.0009808737,0.0005085044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016918109,0.00048132462,0.011365878,0.0007205964,0.00029911246,0.0010840798,0.00044986943,0.6417268,0.06821481,0.054075398,0.034169283,0.18572098],"study_design_scores_gemma":[0.00004943168,0.00011554931,0.0010771449,0.000028738395,0.00003993871,0.00025161865,0.00018546861,0.9720416,0.0051633054,0.017127708,0.0038987498,0.000020789803],"about_ca_topic_score_codex":0.0015722077,"about_ca_topic_score_gemma":0.005520517,"teacher_disagreement_score":0.0041326922,"about_ca_system_score_codex":0.0011796908,"about_ca_system_score_gemma":0.0015329263,"threshold_uncertainty_score":0.013825238},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09517945,0.0002654675,0.8757147,0.00029639964,0.000233126,0.0008733188,0.00022615398,0.008294824,0.018916644],"genre_scores_gemma":[0.7566537,0.00018532242,0.23114693,0.0001629306,0.00002990339,0.00050608243,0.00035511007,0.0002751608,0.010684865],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99950826,0.00008736791,0.000038251877,0.00008875915,0.00017684621,0.000100509125],"domain_scores_gemma":[0.999624,0.000058887937,0.0000339097,0.00007797144,0.00014953045,0.00005564243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004842842,0.00030888943,0.00047047582,0.00039763327,0.00056318584,0.0012795555,0.0016963619,0.0006654508,0.00656918],"category_scores_gemma":[0.0010447009,0.00029561136,0.00020176648,0.00022730719,0.00040689667,0.0008545765,0.0007447359,0.0006169748,0.0016585689],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021219777,0.0009436387,0.0073405765,0.0011548062,0.00023973343,0.0009449098,0.0010845228,0.28671515,0.17977375,0.09341672,0.014628258,0.411636],"study_design_scores_gemma":[0.00037077564,0.0010293344,0.0016201218,0.00008864286,0.00013683003,0.00043235766,0.0002533933,0.8075738,0.10921462,0.010234744,0.068957545,0.0000878325],"about_ca_topic_score_codex":0.0017819139,"about_ca_topic_score_gemma":0.0018103161,"teacher_disagreement_score":0.00656918,"about_ca_system_score_codex":0.00051203725,"about_ca_system_score_gemma":0.0013457546,"threshold_uncertainty_score":0.021976113},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060549337,0.00035871592,0.9257249,0.0006780315,0.00021678743,0.00006858655,0.00015076637,0.008531056,0.0037217848],"genre_scores_gemma":[0.66326094,0.0002041645,0.32708806,0.00021414118,0.00013235855,0.00006914128,0.0006191776,0.0004003936,0.008011569],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990865,0.0001711012,0.000040078197,0.00014691206,0.00038309194,0.00017216252],"domain_scores_gemma":[0.99804175,0.000438192,0.00014334731,0.0009197508,0.00037699437,0.00007989847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097149657,0.00097504054,0.00072785205,0.0010816648,0.00097092235,0.0013260873,0.0015328265,0.0012399612,0.005392319],"category_scores_gemma":[0.0034348462,0.00047887323,0.00033635856,0.00089296605,0.00072152604,0.002113332,0.0017432319,0.0014073787,0.0018247344],"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.0015822959,0.00030455613,0.004393724,0.0001354306,0.000101955084,0.00041493683,0.00016560104,0.10054606,0.10722921,0.020166919,0.022965461,0.74199384],"study_design_scores_gemma":[0.000034089215,0.00007824403,0.0009035896,0.000008653159,0.000020186753,0.00025901216,0.000048492286,0.9065465,0.07617129,0.011458765,0.004448392,0.000022775024],"about_ca_topic_score_codex":0.0012495285,"about_ca_topic_score_gemma":0.0014443672,"teacher_disagreement_score":0.005392319,"about_ca_system_score_codex":0.00043000196,"about_ca_system_score_gemma":0.0009287565,"threshold_uncertainty_score":0.018039107},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15312007,0.00035161056,0.83203256,0.0005332012,0.00014524387,0.0003884893,0.00032418908,0.0020021254,0.011102535],"genre_scores_gemma":[0.8930609,0.0002246731,0.101912625,0.000090097885,0.000046074583,0.0002565935,0.00043466006,0.000336542,0.0036377923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947225,0.0018236819,0.0003446367,0.00048224058,0.0019954948,0.0006314888],"domain_scores_gemma":[0.9913487,0.005357439,0.00062035024,0.0012419642,0.0012751091,0.00015653379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052771275,0.0009257795,0.0009679958,0.0007982327,0.0009747954,0.00294094,0.0030504398,0.002423693,0.0022108962],"category_scores_gemma":[0.014246532,0.0012986201,0.0018165592,0.00037637728,0.002583139,0.003139421,0.00200443,0.001904331,0.00036682622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020352275,0.00012170424,0.0013726872,0.00016510896,0.00007403379,0.00048783314,0.00038723496,0.90371025,0.009495843,0.073818624,0.00063053734,0.009532595],"study_design_scores_gemma":[0.00002381904,0.00003333058,0.00019696359,0.000017740354,0.00002274377,0.000032310683,0.000028374214,0.98321486,0.0041409987,0.011074122,0.0012044922,0.000010291073],"about_ca_topic_score_codex":0.017546099,"about_ca_topic_score_gemma":0.008543276,"teacher_disagreement_score":0.017546099,"about_ca_system_score_codex":0.0022849783,"about_ca_system_score_gemma":0.0039642956,"threshold_uncertainty_score":0.03488791},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006402831,0.8345374,0.05322447,0.078797266,0.004165345,0.00007019557,0.00018607792,0.0002332894,0.022383094],"genre_scores_gemma":[0.09676515,0.8502651,0.03014293,0.0071815546,0.011231913,0.0001073597,0.0003106153,0.00008658962,0.003908849],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9952018,0.0015374221,0.00031902717,0.0006924634,0.0018493474,0.00039995514],"domain_scores_gemma":[0.97108924,0.020519614,0.0010912147,0.0011430229,0.004757359,0.001399575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013364646,0.00105887,0.001852101,0.0023166598,0.0011193212,0.010122787,0.00392804,0.003918574,0.0057435003],"category_scores_gemma":[0.014001258,0.0005774821,0.0005163887,0.0045498335,0.0045819064,0.01882226,0.0033936438,0.0060981107,0.0017026155],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021959121,0.00024197181,0.0015657919,0.0035792757,0.000055782097,0.000069038346,0.000386183,0.005175549,0.0014464135,0.27166292,0.027512416,0.6880851],"study_design_scores_gemma":[0.0000429614,0.00042996713,0.001359143,0.0065591023,0.000087451896,0.00048807435,0.0025497656,0.04982023,0.0024621417,0.45279557,0.4832594,0.00014619593],"about_ca_topic_score_codex":0.0016783113,"about_ca_topic_score_gemma":0.0017544207,"teacher_disagreement_score":0.013364646,"about_ca_system_score_codex":0.0023894405,"about_ca_system_score_gemma":0.004548372,"threshold_uncertainty_score":0.07067984},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057902966,0.0014331772,0.9141478,0.0012750006,0.00037582702,0.00063472794,0.0012385738,0.0033753735,0.019616527],"genre_scores_gemma":[0.28168675,0.0016289473,0.6981449,0.0004602608,0.0003881352,0.0007214795,0.0043590777,0.0005676378,0.012042814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754274,0.00037610365,0.00036412533,0.00039836168,0.0010405105,0.00027821973],"domain_scores_gemma":[0.9960574,0.00084780727,0.00044101727,0.00082320307,0.0014859387,0.0003447477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013259402,0.0012143465,0.0010342603,0.0060195005,0.0015966995,0.0045310054,0.0016756377,0.0020781662,0.0037377437],"category_scores_gemma":[0.004448823,0.00046458514,0.0018988285,0.0037677074,0.0015760305,0.0059703635,0.0015482649,0.002301496,0.0019460457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034275634,0.00078328256,0.021881606,0.00049490255,0.00015234035,0.0010534687,0.0014164282,0.013999353,0.02357362,0.46812645,0.019817708,0.448358],"study_design_scores_gemma":[0.00006819045,0.00034103927,0.010227403,0.0003622901,0.00024131387,0.002319549,0.0013136171,0.3740458,0.011021073,0.49348816,0.106441356,0.00013016742],"about_ca_topic_score_codex":0.003633533,"about_ca_topic_score_gemma":0.0024361392,"teacher_disagreement_score":0.0060195005,"about_ca_system_score_codex":0.001207617,"about_ca_system_score_gemma":0.0021110536,"threshold_uncertainty_score":0.012504041},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56766474,0.0013047785,0.41559696,0.0009896368,0.0004719148,0.000116210926,0.00012679973,0.000747713,0.01298118],"genre_scores_gemma":[0.97643435,0.00015146777,0.021957537,0.000026981546,0.000049146165,0.000010605153,0.00003739934,0.000035890425,0.0012965917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903643,0.0003144499,0.000045294237,0.00011589222,0.00022526557,0.00026282974],"domain_scores_gemma":[0.99879265,0.00048953464,0.00016034194,0.00019718878,0.00018721305,0.00017301289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001123321,0.00037185184,0.00058849825,0.00057585357,0.0011748614,0.0014928082,0.0011343819,0.00050777255,0.001888546],"category_scores_gemma":[0.0037589814,0.00035310586,0.00017364578,0.0011909084,0.00051935064,0.0016182084,0.001056795,0.00049106,0.00023660863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008224111,0.0002597982,0.005129091,0.000088900975,0.000038159556,0.00041918608,0.00010601109,0.8656676,0.007242137,0.029865298,0.004039164,0.08632229],"study_design_scores_gemma":[0.0000097026395,0.000037707752,0.0005062255,0.0000032123191,0.0000073656556,0.0000622705,0.00007066307,0.9914057,0.0011684805,0.0060273544,0.00069735927,0.000003950945],"about_ca_topic_score_codex":0.002979881,"about_ca_topic_score_gemma":0.005825014,"teacher_disagreement_score":0.002979881,"about_ca_system_score_codex":0.0008328168,"about_ca_system_score_gemma":0.0010120098,"threshold_uncertainty_score":0.0063177943},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19499491,0.0025101171,0.7215277,0.0042927708,0.00044239196,0.0002770552,0.0010184338,0.0005354786,0.074401185],"genre_scores_gemma":[0.96235746,0.0009742144,0.017612597,0.00018998371,0.00012026896,0.0001713594,0.00022747745,0.00013985267,0.018206792],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925023,0.00025006768,0.000024634068,0.00010471631,0.00015295518,0.00021729033],"domain_scores_gemma":[0.99918395,0.00038796838,0.00008778531,0.000040173643,0.00018412729,0.00011601959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009716603,0.0007502461,0.0013484418,0.0006584197,0.0009736514,0.0024883896,0.002546592,0.0019788484,0.0047444208],"category_scores_gemma":[0.002773991,0.00085732294,0.000909351,0.0012140006,0.0011238069,0.0017458767,0.0011554846,0.0013154097,0.00058855943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015643194,0.000014512474,0.00019839407,0.0000143876905,0.0000061396668,0.000024527606,0.000014999104,0.9855054,0.00020854789,0.012659932,0.00043170896,0.0009058856],"study_design_scores_gemma":[0.0000027561475,0.0000026348698,0.000063634405,0.0000018859627,0.000002131997,0.000003259152,0.0000062607915,0.9981489,0.00003602473,0.0015437715,0.00018679163,0.0000019619329],"about_ca_topic_score_codex":0.05557537,"about_ca_topic_score_gemma":0.020153679,"teacher_disagreement_score":0.05557537,"about_ca_system_score_codex":0.0031684118,"about_ca_system_score_gemma":0.003583909,"threshold_uncertainty_score":0.11050379},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17319016,0.0001754687,0.81249857,0.00023116983,0.00013451432,0.00011168562,0.000061719846,0.0014713716,0.012125302],"genre_scores_gemma":[0.9892509,0.00003851924,0.009450666,0.00002801137,0.000008150273,0.000040186205,0.000027611384,0.000015551934,0.0011405273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962676,0.00006590816,0.000017827266,0.00012262384,0.00012203376,0.000044746328],"domain_scores_gemma":[0.9996038,0.00010894839,0.000069103044,0.000041154213,0.00015686742,0.000020235333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045134893,0.00043902377,0.00040030206,0.0003113541,0.00053279754,0.0008500986,0.00050477555,0.00042016807,0.001328169],"category_scores_gemma":[0.00089988403,0.0001656286,0.00036573346,0.0001871696,0.00034757968,0.00052546314,0.0004772901,0.0003067916,0.00019808635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007714667,0.00029168947,0.007619337,0.00032291393,0.00018377318,0.00055576366,0.0006126903,0.7356879,0.08892417,0.010155416,0.002005746,0.15286914],"study_design_scores_gemma":[0.000027567581,0.00020051759,0.0021294046,0.000009823535,0.000040004277,0.00008018757,0.000035742152,0.9848701,0.010025684,0.0015024198,0.0010629188,0.000015681177],"about_ca_topic_score_codex":0.002541291,"about_ca_topic_score_gemma":0.001796605,"teacher_disagreement_score":0.002541291,"about_ca_system_score_codex":0.00039116692,"about_ca_system_score_gemma":0.00044215607,"threshold_uncertainty_score":0.0050530434},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021118088,0.00034508883,0.9680663,0.00015526007,0.00007583503,0.00002959172,0.000029084804,0.00018995469,0.009990802],"genre_scores_gemma":[0.7909757,0.0005628127,0.19508472,0.0001394181,0.00006825492,0.00006933931,0.00008321065,0.00009040119,0.012926028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977237,0.00006040693,0.0000057056177,0.000042871994,0.00008588012,0.000032684915],"domain_scores_gemma":[0.9997954,0.00006457737,0.0000158385,0.00003869315,0.00006563123,0.000019797051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028204187,0.00064480584,0.000514828,0.00047755308,0.00037273433,0.00084815023,0.0012558325,0.00060342177,0.0025595874],"category_scores_gemma":[0.000539682,0.00022936649,0.00039743638,0.0005118803,0.00036540136,0.001568607,0.0012953306,0.000536565,0.000381999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011590308,0.000188043,0.000568357,0.00013273358,0.000074342126,0.00019127528,0.00009148276,0.7418463,0.02109971,0.09888952,0.0024541493,0.13434814],"study_design_scores_gemma":[0.0000022673762,0.000018015548,0.000050413655,0.000003964532,0.000008555618,0.000037142087,0.000015491869,0.98833466,0.0012655096,0.009248665,0.0010107167,0.0000046219725],"about_ca_topic_score_codex":0.0006164185,"about_ca_topic_score_gemma":0.0011649755,"teacher_disagreement_score":0.0025595874,"about_ca_system_score_codex":0.00034478577,"about_ca_system_score_gemma":0.00037515702,"threshold_uncertainty_score":0.008562624},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039859605,0.00056969177,0.9740201,0.00036825408,0.00041799273,0.00018928185,0.0006109289,0.011928287,0.007909356],"genre_scores_gemma":[0.16885929,0.0013280356,0.80298835,0.0005499882,0.00035791058,0.0009732401,0.0030404648,0.0023175615,0.019585231],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990753,0.00016473581,0.00005612583,0.00012844647,0.00045072896,0.00012477546],"domain_scores_gemma":[0.9991691,0.00013823988,0.00005877078,0.0003117421,0.0002464879,0.00007571548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009521174,0.0005961154,0.0008011921,0.0013701551,0.0013404998,0.0011146697,0.0023817613,0.00095817586,0.0060328324],"category_scores_gemma":[0.002429113,0.00040852497,0.00048783573,0.0023733138,0.0005574147,0.0018758373,0.002530897,0.0021552162,0.002505294],"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.0006272211,0.00015599,0.0006903773,0.0005743093,0.00011270169,0.00024369093,0.0004610768,0.0543832,0.021013098,0.10389307,0.17019567,0.64764965],"study_design_scores_gemma":[0.00026297866,0.00034447396,0.0013492662,0.00012480463,0.00018256658,0.0015341698,0.0002775516,0.532576,0.07786102,0.09863532,0.28666332,0.0001886004],"about_ca_topic_score_codex":0.0017680622,"about_ca_topic_score_gemma":0.0024588036,"teacher_disagreement_score":0.0060328324,"about_ca_system_score_codex":0.0006913903,"about_ca_system_score_gemma":0.0015864937,"threshold_uncertainty_score":0.020181835},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071101002,0.013668256,0.97284037,0.0011979218,0.0001769616,0.00007589156,0.0000988788,0.000087733024,0.004743854],"genre_scores_gemma":[0.35591295,0.03679552,0.5912877,0.00067062164,0.0016677388,0.0006858431,0.0005616104,0.00020739732,0.012210611],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991357,0.00035297286,0.00006096419,0.00014746941,0.00023998639,0.00006287956],"domain_scores_gemma":[0.99841166,0.00093705306,0.00025179036,0.00010218073,0.00024759868,0.000049662893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002444527,0.0015505516,0.0017021139,0.0016070511,0.00049108436,0.0020998039,0.0015225187,0.0017289962,0.0018856218],"category_scores_gemma":[0.004029013,0.00055457,0.0013293492,0.0031985356,0.0008499569,0.002049649,0.0011596655,0.002042339,0.0004252041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005887766,0.0002126722,0.0014340343,0.0008023173,0.00017532654,0.00004413848,0.00008703646,0.69882035,0.0007980295,0.09796623,0.006014018,0.19358695],"study_design_scores_gemma":[0.000006235568,0.00003688993,0.00038704567,0.000057720994,0.000024494859,0.00002777061,0.000029360379,0.95426047,0.00027738095,0.041949634,0.0029332142,0.00000972207],"about_ca_topic_score_codex":0.0019269492,"about_ca_topic_score_gemma":0.0015933188,"teacher_disagreement_score":0.002444527,"about_ca_system_score_codex":0.00092401885,"about_ca_system_score_gemma":0.00097628246,"threshold_uncertainty_score":0.012928009},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06349512,0.00067213364,0.92835206,0.00026313346,0.000108809654,0.00070705725,0.000048590395,0.0016237923,0.004729242],"genre_scores_gemma":[0.88828856,0.0003741735,0.107993096,0.00010560462,0.00009385453,0.0003530046,0.00007776414,0.000107454,0.0026065854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99108183,0.003063812,0.00042740745,0.00073522335,0.0038301595,0.0008614564],"domain_scores_gemma":[0.98808426,0.0049748993,0.0011501017,0.0019035896,0.0036631217,0.00022401771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071066194,0.0008403591,0.0009914828,0.0012755643,0.0009978105,0.0027695296,0.0030267239,0.0013053126,0.0028465497],"category_scores_gemma":[0.009846471,0.0004592162,0.0006963859,0.00041704933,0.002331849,0.0021465374,0.0012925294,0.0017764609,0.0005933673],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027100088,0.0013992452,0.0061160047,0.0012197905,0.000426763,0.00062706525,0.0019612254,0.2769736,0.16477054,0.2725321,0.005089987,0.2661737],"study_design_scores_gemma":[0.00018291433,0.0018996308,0.0006094604,0.0000834419,0.0002004051,0.00027388262,0.000084574094,0.89948,0.084238365,0.007968797,0.0049222773,0.000056285055],"about_ca_topic_score_codex":0.0022307085,"about_ca_topic_score_gemma":0.0012956952,"teacher_disagreement_score":0.0071066194,"about_ca_system_score_codex":0.0021445244,"about_ca_system_score_gemma":0.0024040008,"threshold_uncertainty_score":0.037583828},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015972305,0.00031750833,0.979538,0.00021273163,0.00009955471,0.000067621215,0.00006843697,0.0002371611,0.003486661],"genre_scores_gemma":[0.681282,0.0008743033,0.30787542,0.00020823082,0.00017649413,0.00015925981,0.0002560472,0.00007715342,0.009091125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996488,0.00007189892,0.0000130031995,0.0000432287,0.00016472902,0.00005837998],"domain_scores_gemma":[0.9994271,0.00020872637,0.000028037359,0.00005634986,0.00025147595,0.00002831515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004954261,0.0005459907,0.0005043694,0.0006890302,0.00043942238,0.0005929868,0.000841778,0.0005635741,0.0016131412],"category_scores_gemma":[0.0014117319,0.00018437063,0.00025389675,0.0007551976,0.00038106297,0.00084104843,0.0007188647,0.0008676626,0.0003029425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003392199,0.00022356446,0.0006697017,0.00019151939,0.00007520549,0.0002863846,0.0001778976,0.5777942,0.07293416,0.08745463,0.007220154,0.25263342],"study_design_scores_gemma":[0.0000035222715,0.00002230175,0.000042163003,0.0000036961314,0.000005713226,0.000032699707,0.000010367559,0.9934855,0.0026413766,0.0031388458,0.0006099001,0.0000039126367],"about_ca_topic_score_codex":0.0043784087,"about_ca_topic_score_gemma":0.006320908,"teacher_disagreement_score":0.0043784087,"about_ca_system_score_codex":0.0007736971,"about_ca_system_score_gemma":0.0010346294,"threshold_uncertainty_score":0.008705854},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032570053,0.0006905165,0.96363395,0.00046734716,0.000120560755,0.00013466364,0.000055084674,0.0008269651,0.0015007027],"genre_scores_gemma":[0.79857546,0.0004542278,0.19783024,0.00031899387,0.0001306539,0.00015229925,0.00018858351,0.00007816513,0.0022714555],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960846,0.0011311021,0.00022435359,0.00060453755,0.0012282236,0.0007272041],"domain_scores_gemma":[0.99391466,0.0022900687,0.0008216139,0.0019131538,0.0007838339,0.00027661127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027607358,0.00085722003,0.0019762546,0.0013839593,0.0016345698,0.0020547651,0.0026141652,0.001979128,0.0013494695],"category_scores_gemma":[0.0072000367,0.0004904734,0.00081165356,0.0015105566,0.0017368873,0.0054637943,0.00617785,0.002520959,0.00074809755],"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.0020723136,0.0005397958,0.0018880503,0.0007163494,0.00044150054,0.0008276509,0.0016463124,0.28974515,0.11821465,0.23223509,0.013031842,0.3386412],"study_design_scores_gemma":[0.000076273536,0.00040141947,0.00027024563,0.000044029464,0.000081584585,0.00043149642,0.00018099278,0.89112467,0.016294688,0.08675365,0.004282763,0.00005814151],"about_ca_topic_score_codex":0.00043327262,"about_ca_topic_score_gemma":0.00043916568,"teacher_disagreement_score":0.0027607358,"about_ca_system_score_codex":0.00090576924,"about_ca_system_score_gemma":0.0013354054,"threshold_uncertainty_score":0.014600337},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06589232,0.00019212924,0.9238917,0.00016449114,0.00010469162,0.000110548346,0.00014909766,0.0021758245,0.0073191505],"genre_scores_gemma":[0.6388608,0.0001133627,0.35522532,0.000082557475,0.000026263084,0.00006136672,0.00020642017,0.00010747386,0.005316371],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99941957,0.00010242709,0.000057705864,0.000108971224,0.00020613734,0.00010533084],"domain_scores_gemma":[0.99797076,0.00031903762,0.00034984387,0.0006409371,0.0005992828,0.00012016511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005825437,0.0006397375,0.00072146684,0.0016149562,0.000983611,0.0014091274,0.0012428903,0.00088149856,0.005251946],"category_scores_gemma":[0.0030372576,0.0003864419,0.0004519982,0.0010991142,0.0007350298,0.002140689,0.0021239896,0.0006426962,0.0014047754],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017734173,0.00044564513,0.0071571306,0.00038106708,0.00008945125,0.000656284,0.000598259,0.27215418,0.08170438,0.046632312,0.0070354124,0.58137256],"study_design_scores_gemma":[0.00005110409,0.000342284,0.0005639167,0.0000664411,0.000026611422,0.00022531717,0.00013539099,0.9513909,0.027511885,0.01539665,0.0042529902,0.00003645699],"about_ca_topic_score_codex":0.002479855,"about_ca_topic_score_gemma":0.0047738245,"teacher_disagreement_score":0.005251946,"about_ca_system_score_codex":0.0009116565,"about_ca_system_score_gemma":0.001607403,"threshold_uncertainty_score":0.017569482},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054674733,0.14772843,0.231695,0.15546596,0.004531573,0.00019409052,0.0011874681,0.0005155392,0.40400726],"genre_scores_gemma":[0.7945246,0.0791604,0.019411799,0.0059054494,0.008421161,0.00023402089,0.00029367045,0.00013461149,0.091914296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980488,0.0010947265,0.00006142376,0.00015500313,0.0005131567,0.00012700258],"domain_scores_gemma":[0.99537706,0.0030315302,0.00034655002,0.00039862603,0.00064535707,0.00020080336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023946555,0.0011939047,0.0014947754,0.0015694414,0.001163034,0.009606222,0.0010945471,0.0066515924,0.012495411],"category_scores_gemma":[0.014470208,0.0009838571,0.00041323336,0.0047692363,0.0046879128,0.012024401,0.0012701959,0.004284565,0.0019736052],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001506112,0.000048719216,0.000238528,0.00007385731,0.000010218142,0.00003960931,0.000054278727,0.005833185,0.00008316212,0.9676961,0.012897206,0.013010204],"study_design_scores_gemma":[0.0000144565465,0.000008121793,0.00025009745,0.000056080262,0.000011548165,0.00011562563,0.000060648035,0.00849887,0.000054627475,0.9728785,0.018040393,0.000011013704],"about_ca_topic_score_codex":0.0039688773,"about_ca_topic_score_gemma":0.0027248687,"teacher_disagreement_score":0.012495411,"about_ca_system_score_codex":0.0052623046,"about_ca_system_score_gemma":0.0026454558,"threshold_uncertainty_score":0.041801274},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00408491,0.00011569313,0.9922192,0.00005249141,0.000024580911,0.000040346553,0.00015366968,0.0023609302,0.0009482748],"genre_scores_gemma":[0.24286036,0.00057640095,0.75192684,0.0001406355,0.00015434685,0.00020160325,0.0008014048,0.00082478154,0.0025135856],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988734,0.00026401546,0.000061287305,0.00019411716,0.00053050445,0.00007665715],"domain_scores_gemma":[0.99870455,0.00042145522,0.00014148513,0.00037930935,0.0002635618,0.000089683934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012407374,0.001229383,0.0016616114,0.0030861164,0.0005449441,0.0027132314,0.0022266493,0.0008928444,0.0021004605],"category_scores_gemma":[0.003424842,0.0005776792,0.0011225807,0.0023516114,0.0007080346,0.00279312,0.0026067283,0.0011691427,0.0008030897],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002214508,0.00035911467,0.0073935157,0.0003052033,0.0005066205,0.00043832333,0.00029471505,0.3916159,0.030069865,0.053683866,0.008525179,0.5065863],"study_design_scores_gemma":[0.0000066324296,0.000026596317,0.0008629983,0.0000116480505,0.000034163117,0.00010063205,0.000057472378,0.9656561,0.0034279055,0.026324678,0.0034707861,0.00002043466],"about_ca_topic_score_codex":0.0022094576,"about_ca_topic_score_gemma":0.0032534206,"teacher_disagreement_score":0.0030861164,"about_ca_system_score_codex":0.000514648,"about_ca_system_score_gemma":0.00088669447,"threshold_uncertainty_score":0.0070267916},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1469394,0.0012735213,0.8475133,0.00029740168,0.000104331535,0.000041333413,0.00002950199,0.00012705049,0.0036742142],"genre_scores_gemma":[0.9839914,0.00033426977,0.014422914,0.000036488767,0.000028435863,0.000030778185,0.0000141977625,0.0000073531955,0.0011342353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996667,0.00010295478,0.000017766499,0.00008561102,0.00009363123,0.000033379863],"domain_scores_gemma":[0.9996092,0.00022749508,0.00004748801,0.000032143,0.00006967922,0.000013960198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057454046,0.00036812364,0.00060603383,0.0002741573,0.000371927,0.000463011,0.0007487743,0.00036971614,0.0004612221],"category_scores_gemma":[0.0008686354,0.00025628018,0.00022688322,0.000515245,0.00043074737,0.00075673417,0.0005181044,0.0002602167,0.00008612474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006174388,0.00021259324,0.0022706506,0.00023854016,0.00015374162,0.0004283182,0.0005506592,0.68195,0.10873434,0.0444161,0.002153678,0.158274],"study_design_scores_gemma":[0.000010480131,0.000083248626,0.0002819417,0.0000042785487,0.000018262253,0.00007072945,0.000032590156,0.9918744,0.002994014,0.0043157367,0.00030613242,0.000008132262],"about_ca_topic_score_codex":0.0005628346,"about_ca_topic_score_gemma":0.00096383796,"teacher_disagreement_score":0.0007487743,"about_ca_system_score_codex":0.00027298933,"about_ca_system_score_gemma":0.00029587361,"threshold_uncertainty_score":0.0030385256},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88909656,0.0009774909,0.062426426,0.0031535712,0.00013145558,0.00013988797,0.00032969215,0.00018761937,0.04355723],"genre_scores_gemma":[0.98981667,0.0003318597,0.0074240314,0.000108310516,0.00003184317,0.00003072965,0.00009491958,0.0000957104,0.0020659897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995988,0.00017754988,0.000017548295,0.00004826723,0.00007017745,0.000087726665],"domain_scores_gemma":[0.9951692,0.0035187015,0.00024904756,0.00036280084,0.0003728499,0.00032732126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009416595,0.0004132909,0.0009101666,0.0006423797,0.0011254702,0.0016430747,0.0018703288,0.0015294113,0.002975604],"category_scores_gemma":[0.009667312,0.00050169596,0.00067363784,0.00090350915,0.0017213746,0.002729818,0.0012105545,0.0015798806,0.0001343999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055322715,0.000089304864,0.0019497998,0.000035412413,0.00002826276,0.000081452556,0.00013188324,0.93136436,0.00035212794,0.06339911,0.0006641354,0.0018488751],"study_design_scores_gemma":[0.000020407882,0.000018621735,0.00029433842,0.0000072120993,0.0000069893,0.0000126912555,0.00006840522,0.99216676,0.0001234955,0.0069628255,0.00031277555,0.0000055447003],"about_ca_topic_score_codex":0.029488264,"about_ca_topic_score_gemma":0.011926929,"teacher_disagreement_score":0.029488264,"about_ca_system_score_codex":0.0017452817,"about_ca_system_score_gemma":0.0019753878,"threshold_uncertainty_score":0.058633268},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31473896,0.0021373935,0.6647519,0.0006227503,0.00042626332,0.00027542224,0.00045477535,0.012491007,0.0041015185],"genre_scores_gemma":[0.93736356,0.0002416919,0.06014897,0.000108622975,0.00007084009,0.000043515018,0.00025117077,0.00018923129,0.0015824172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952674,0.00009421715,0.000036266934,0.0001041532,0.00012310588,0.0001156496],"domain_scores_gemma":[0.99814415,0.0006308581,0.00020723089,0.00049764663,0.00034590682,0.00017413103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001282934,0.000732325,0.0008766355,0.000981529,0.0007859209,0.0011300741,0.0017996663,0.00052809995,0.0016302607],"category_scores_gemma":[0.003505808,0.0004326816,0.00021672584,0.0007233253,0.00051183865,0.0016021949,0.001081924,0.00069109286,0.0002933379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020439106,0.0003776566,0.008212009,0.00024113248,0.00014275036,0.00030155416,0.00040337787,0.43818823,0.08325411,0.015756965,0.019754795,0.43132347],"study_design_scores_gemma":[0.000027859856,0.0001059429,0.00050551683,0.0000055033174,0.000023212053,0.00003496669,0.000034636727,0.9891338,0.005709996,0.0032471295,0.0011579792,0.000013525417],"about_ca_topic_score_codex":0.005145444,"about_ca_topic_score_gemma":0.011053453,"teacher_disagreement_score":0.005145444,"about_ca_system_score_codex":0.0010507071,"about_ca_system_score_gemma":0.001311385,"threshold_uncertainty_score":0.010230958},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117117845,0.003202902,0.8675612,0.0023452952,0.0002180414,0.0000853452,0.00019440442,0.00050073984,0.008774211],"genre_scores_gemma":[0.9424764,0.0028667687,0.04366205,0.0002437413,0.00029940408,0.00009387875,0.00020934809,0.00014294146,0.010005481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988949,0.0003645608,0.000047165904,0.00017302134,0.00032232355,0.00019810848],"domain_scores_gemma":[0.9869163,0.008810552,0.0015292027,0.0007531577,0.0012924311,0.00069837255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019629344,0.00052761345,0.0009781511,0.0017016586,0.0010496326,0.0030470642,0.0018011618,0.0014624344,0.002580033],"category_scores_gemma":[0.013993958,0.0005655888,0.00036694252,0.0031610515,0.0019148078,0.0048730997,0.0008940724,0.0013155595,0.00032957],"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.00020304284,0.0000554483,0.001905642,0.00016392964,0.000036171918,0.00016485431,0.0003345434,0.23963624,0.0026660773,0.71856385,0.004978321,0.031291816],"study_design_scores_gemma":[0.000021715554,0.00004633893,0.00038628685,0.000015558262,0.000028265109,0.00013845626,0.000078715646,0.70317763,0.0007499491,0.29248145,0.0028573035,0.000018354925],"about_ca_topic_score_codex":0.0039422056,"about_ca_topic_score_gemma":0.0033709302,"teacher_disagreement_score":0.0039422056,"about_ca_system_score_codex":0.003704012,"about_ca_system_score_gemma":0.001589514,"threshold_uncertainty_score":0.026874602},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007435294,0.00048581182,0.98863834,0.0003359352,0.00028368144,0.00009508347,0.00015987836,0.0007226292,0.0018432877],"genre_scores_gemma":[0.18785353,0.0013536079,0.8017121,0.0006157849,0.0006882036,0.00029516112,0.0011127469,0.0002399064,0.0061290064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985581,0.0004055267,0.00015124392,0.00020401998,0.0005820325,0.00009910941],"domain_scores_gemma":[0.9948826,0.0017821582,0.00026014153,0.0009925563,0.001886034,0.00019654687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030131782,0.00086816004,0.0010512607,0.0011503169,0.00058466214,0.0018536883,0.0023872887,0.0010655604,0.0044489773],"category_scores_gemma":[0.009779608,0.00036290303,0.00089293503,0.0018167071,0.00038410746,0.0030980278,0.0013436454,0.0024517367,0.002571209],"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.00025129082,0.0007830497,0.003982066,0.00022560757,0.00025264247,0.00010989354,0.00013888415,0.16683666,0.0052373754,0.052982215,0.017844897,0.75135547],"study_design_scores_gemma":[0.000019308143,0.00006086152,0.00030055558,0.000022654314,0.000045589863,0.00006927654,0.000014216187,0.9620243,0.0015280008,0.030378291,0.0055211554,0.000015925081],"about_ca_topic_score_codex":0.0022021604,"about_ca_topic_score_gemma":0.0034902836,"teacher_disagreement_score":0.0044489773,"about_ca_system_score_codex":0.0006039934,"about_ca_system_score_gemma":0.0014046076,"threshold_uncertainty_score":0.015935421},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023211487,0.00032374723,0.97346467,0.00017539714,0.00011527765,0.00009099388,0.000037727554,0.00035569433,0.002225095],"genre_scores_gemma":[0.674627,0.00030449618,0.31934714,0.0002360875,0.0001258236,0.0003094633,0.0001893565,0.000089194735,0.0047713914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907506,0.00023678488,0.00004697392,0.00017289881,0.0003142261,0.0001541422],"domain_scores_gemma":[0.99757296,0.0013345047,0.00017533846,0.00020686063,0.0005947688,0.00011567313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014163717,0.0008479656,0.0012580203,0.0012611012,0.0010190479,0.00086082396,0.0028057203,0.0013614336,0.0016643108],"category_scores_gemma":[0.004811246,0.00034956122,0.00052682345,0.0013809386,0.00082369806,0.0017846777,0.0018979234,0.0011020981,0.00030836335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031980634,0.00019463441,0.0008459603,0.00010820502,0.00006433897,0.00010957691,0.00023417399,0.770604,0.0072864364,0.018817432,0.0051589566,0.19625649],"study_design_scores_gemma":[0.000022767394,0.00008051822,0.00007408891,0.000004849187,0.000010521951,0.00003907545,0.000019658002,0.9959501,0.00075021107,0.0024232531,0.00061781344,0.0000071102936],"about_ca_topic_score_codex":0.0048368773,"about_ca_topic_score_gemma":0.0058285296,"teacher_disagreement_score":0.0048368773,"about_ca_system_score_codex":0.0008191496,"about_ca_system_score_gemma":0.0014839048,"threshold_uncertainty_score":0.009617448},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34073338,0.00340114,0.64295954,0.0006637036,0.0003622655,0.000087021275,0.0001917601,0.0012229796,0.0103782145],"genre_scores_gemma":[0.9942027,0.00020381177,0.0045883637,0.00003536938,0.00002683099,0.00001027947,0.000046945337,0.000009473813,0.0008762559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947673,0.000124492,0.000026068974,0.00007126199,0.00013006931,0.00017138642],"domain_scores_gemma":[0.9991605,0.00037923505,0.00006519604,0.00007848994,0.00028554563,0.000031055675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086850463,0.00039237193,0.00044615034,0.00043727102,0.00047991466,0.0006130227,0.0006182563,0.0003842386,0.0006561786],"category_scores_gemma":[0.0019702362,0.00018711945,0.00016574062,0.00046744544,0.00032923586,0.0005763991,0.00046001005,0.0004326707,0.00023118021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071901974,0.00013243023,0.0053599603,0.00010905023,0.000063199084,0.0002939968,0.00023858932,0.75790036,0.03233421,0.009854969,0.0032190734,0.18977518],"study_design_scores_gemma":[0.0000089885325,0.00010629021,0.0013442667,0.00000692626,0.00002815967,0.000093817594,0.00007676267,0.99083686,0.0044122334,0.0020323698,0.0010405495,0.000012839883],"about_ca_topic_score_codex":0.008104245,"about_ca_topic_score_gemma":0.008585616,"teacher_disagreement_score":0.008104245,"about_ca_system_score_codex":0.00067269703,"about_ca_system_score_gemma":0.00069543027,"threshold_uncertainty_score":0.016114116},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08908715,0.0018670232,0.8615317,0.0007235507,0.0007902059,0.0006326031,0.0008808185,0.030182917,0.014304114],"genre_scores_gemma":[0.90858114,0.00044557935,0.08257171,0.0002977776,0.00009138593,0.0001845156,0.0011384665,0.00043725368,0.0062521417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994223,0.00012221794,0.000037636928,0.000073339135,0.00018416649,0.00016028671],"domain_scores_gemma":[0.9995401,0.00011242749,0.000036975216,0.00011245226,0.00010949296,0.000088610584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006797953,0.0006737415,0.001009914,0.00071767264,0.00094368804,0.0011836737,0.0018611258,0.00045249224,0.0023349114],"category_scores_gemma":[0.0011677003,0.0002777933,0.00035291337,0.0006753474,0.00044528337,0.001464377,0.0020595843,0.0008874066,0.0006033269],"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.004683733,0.0009790299,0.0032972835,0.00052283495,0.00039296868,0.0006104078,0.00038846675,0.15747023,0.069897555,0.06811822,0.10225905,0.59138024],"study_design_scores_gemma":[0.00018360575,0.0002515382,0.0007461343,0.00001915452,0.00006457319,0.00019592393,0.00015194448,0.9500757,0.019571226,0.009023371,0.019657347,0.00005940093],"about_ca_topic_score_codex":0.0074268575,"about_ca_topic_score_gemma":0.008247982,"teacher_disagreement_score":0.0074268575,"about_ca_system_score_codex":0.0008051356,"about_ca_system_score_gemma":0.0019135425,"threshold_uncertainty_score":0.01476723},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049999297,0.0009974714,0.9450096,0.0002903714,0.000052930707,0.00005486503,0.00005544224,0.00017384515,0.0033662105],"genre_scores_gemma":[0.9441642,0.0010809095,0.051566478,0.00007521763,0.00007554054,0.00008119727,0.00007798619,0.00009497541,0.002783533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991105,0.00035463244,0.00003521545,0.00009678788,0.00028567406,0.00011704602],"domain_scores_gemma":[0.99756217,0.0015149268,0.00025387784,0.00012373748,0.0004933505,0.000051871273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023645968,0.00069169444,0.00066105137,0.0005823536,0.000431891,0.0008988553,0.0014106755,0.00060640334,0.0011802595],"category_scores_gemma":[0.0062054256,0.00029164992,0.00041640992,0.00071823475,0.00057547004,0.0013711276,0.0008107098,0.00059267576,0.00012340046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023146562,0.00002777728,0.00027367804,0.000047860958,0.0000140999355,0.000012859128,0.00003097952,0.9764885,0.0012024553,0.006992288,0.00026504067,0.01462138],"study_design_scores_gemma":[4.263569e-7,0.000008146956,0.000029972107,0.0000017538223,0.0000018042649,0.0000023143436,0.000004352994,0.9989618,0.00019144126,0.0007334684,0.00006349271,9.461198e-7],"about_ca_topic_score_codex":0.0063633504,"about_ca_topic_score_gemma":0.0035979897,"teacher_disagreement_score":0.0063633504,"about_ca_system_score_codex":0.0014443322,"about_ca_system_score_gemma":0.001120894,"threshold_uncertainty_score":0.012652636},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1351273,0.00082945207,0.85969156,0.00045462517,0.00014171509,0.00008686099,0.000101052094,0.00053979916,0.0030276885],"genre_scores_gemma":[0.8819738,0.00023115767,0.11544605,0.00008068414,0.000073841715,0.00007595797,0.00008351011,0.00022971272,0.00180532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903655,0.00039567632,0.00003578893,0.00010195113,0.00023339872,0.00019652476],"domain_scores_gemma":[0.99606836,0.0028756694,0.0002426118,0.0002479139,0.00040410244,0.00016135327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003498039,0.0013331637,0.0017940857,0.0015296988,0.0008250822,0.001430028,0.0014216162,0.0011888808,0.0019554305],"category_scores_gemma":[0.009340386,0.0007595652,0.00047173773,0.0014749637,0.0009849839,0.0032576816,0.001318585,0.00085282297,0.00016247592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010638266,0.00003818783,0.0005001769,0.000018145665,0.000025953823,0.00001125618,0.000019899504,0.97348255,0.0006843607,0.004424329,0.00044972068,0.020239135],"study_design_scores_gemma":[0.0000046733794,0.000022750908,0.000071670984,0.0000023026037,0.000012217898,0.0000048478523,0.0000056985964,0.99707854,0.0002798024,0.0024256331,0.00008851511,0.0000034528023],"about_ca_topic_score_codex":0.0063742497,"about_ca_topic_score_gemma":0.007833495,"teacher_disagreement_score":0.0063742497,"about_ca_system_score_codex":0.0024651121,"about_ca_system_score_gemma":0.0021731323,"threshold_uncertainty_score":0.018499613},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06907572,0.0012234235,0.91973263,0.0005504983,0.00032535437,0.00026306097,0.00039814314,0.004113257,0.004317945],"genre_scores_gemma":[0.7680325,0.0005184097,0.22727497,0.00020444566,0.00016692463,0.000115292234,0.0003503587,0.00028165107,0.0030554775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991196,0.00022093515,0.000040607196,0.00013034877,0.000257365,0.00023116937],"domain_scores_gemma":[0.99860066,0.000488299,0.00013181877,0.00029843795,0.00033609045,0.00014479533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090560183,0.0013939389,0.001846633,0.0012011474,0.0013020528,0.0015321691,0.0027437287,0.001328729,0.0022427838],"category_scores_gemma":[0.0033755118,0.0006169557,0.0004734924,0.0025522655,0.00074726954,0.0015213485,0.0013015623,0.00071119,0.0006977381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012664866,0.00030369742,0.0018027632,0.00019095319,0.00012544352,0.00024752266,0.00018523693,0.71256834,0.021213876,0.019749591,0.026262434,0.21608366],"study_design_scores_gemma":[0.000029738894,0.000054970595,0.00013083991,0.0000044836756,0.0000212558,0.000057433586,0.000025647681,0.9938127,0.0018066044,0.0033916454,0.00065276923,0.000011986837],"about_ca_topic_score_codex":0.013031697,"about_ca_topic_score_gemma":0.023935836,"teacher_disagreement_score":0.013031697,"about_ca_system_score_codex":0.0023805313,"about_ca_system_score_gemma":0.0034866384,"threshold_uncertainty_score":0.025911689},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91940963,0.0009859621,0.07450705,0.00015291032,0.000037917755,0.000077378485,0.0006406456,0.0003798151,0.0038086553],"genre_scores_gemma":[0.9937251,0.000077051576,0.00569374,0.000014272969,0.000018180037,0.000016308359,0.00022200856,0.00001763021,0.00021579952],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959266,0.0011867564,0.0003940583,0.0005244919,0.0017035288,0.00026457675],"domain_scores_gemma":[0.9098159,0.064713426,0.010286504,0.0031062462,0.010475931,0.0016019829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003919944,0.00051885756,0.0003311075,0.002867663,0.00022598641,0.0014202374,0.00049463456,0.00087434315,0.0011504386],"category_scores_gemma":[0.045452274,0.00019913737,0.00028297567,0.0020399701,0.0005665276,0.0022204989,0.00069211447,0.0005606763,0.0002595133],"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.0022211832,0.0007055682,0.7022993,0.00047821374,0.00056761294,0.00036860292,0.00088100234,0.060518533,0.047105633,0.0043178215,0.0016877328,0.17884886],"study_design_scores_gemma":[0.00003195713,0.0032440668,0.59100527,0.00009745681,0.00032026847,0.0016353182,0.00084400544,0.37402308,0.02347611,0.0031797013,0.0020085985,0.00013413763],"about_ca_topic_score_codex":0.0013294859,"about_ca_topic_score_gemma":0.0010928431,"teacher_disagreement_score":0.003919944,"about_ca_system_score_codex":0.00048736186,"about_ca_system_score_gemma":0.0003228505,"threshold_uncertainty_score":0.020730913},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06039792,0.0010493723,0.91036785,0.0035665543,0.0006898524,0.00029512178,0.0044472376,0.010780069,0.008406102],"genre_scores_gemma":[0.8698683,0.0010309832,0.10647501,0.0006477084,0.00070154574,0.00024701803,0.0049599833,0.0010582978,0.015011208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99461997,0.0018062226,0.0003837725,0.00095979235,0.0015480517,0.00068217015],"domain_scores_gemma":[0.97721714,0.007021668,0.00087002426,0.013148938,0.001193635,0.00054872816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055902726,0.00077105075,0.0015404732,0.0014107884,0.0014942233,0.0042807017,0.0028569999,0.0024841393,0.00868921],"category_scores_gemma":[0.02641854,0.0008447482,0.0011233997,0.0032785656,0.0019181306,0.0091587715,0.0054203663,0.0025768946,0.0037325963],"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.003674211,0.00044641303,0.0058671604,0.0004487573,0.00030970466,0.0010411137,0.0011624082,0.22530064,0.00733312,0.37275687,0.06490125,0.31675833],"study_design_scores_gemma":[0.0002645923,0.00019436846,0.00051046826,0.000052740204,0.00008309124,0.00045494718,0.00014484255,0.57502306,0.009712305,0.39280403,0.020703852,0.000051708284],"about_ca_topic_score_codex":0.001797953,"about_ca_topic_score_gemma":0.0017544901,"teacher_disagreement_score":0.00868921,"about_ca_system_score_codex":0.0020550496,"about_ca_system_score_gemma":0.0042483127,"threshold_uncertainty_score":0.02956456},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61592996,0.00056146045,0.37387496,0.00031746196,0.00019712048,0.00010174548,0.00008228151,0.0006560805,0.008278925],"genre_scores_gemma":[0.9940613,0.0000381681,0.005495709,0.000013443586,0.000009686118,0.000007353766,0.000012385213,0.000007053013,0.00035488952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997048,0.00008866416,0.00001454547,0.00006583157,0.000045099252,0.000081079386],"domain_scores_gemma":[0.9994185,0.00024802712,0.000052299867,0.00005471547,0.00014203067,0.00008450609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005013066,0.00039990997,0.0005641924,0.00040958074,0.0005357407,0.001062445,0.0007514252,0.00024079757,0.0017987124],"category_scores_gemma":[0.0012185879,0.0002244414,0.00019188707,0.00045865314,0.00032817383,0.0005727712,0.00047017678,0.000418421,0.000107183965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013434781,0.00028703958,0.004396952,0.00009574626,0.000082191254,0.00023214934,0.00018909767,0.80841887,0.016806727,0.008822317,0.0025009217,0.15682445],"study_design_scores_gemma":[0.000013958622,0.000067216366,0.00056841923,0.0000030152623,0.000018127792,0.00002519508,0.00003672816,0.9964869,0.0011790113,0.0013674437,0.00022937133,0.000004661813],"about_ca_topic_score_codex":0.00210511,"about_ca_topic_score_gemma":0.0038843937,"teacher_disagreement_score":0.00210511,"about_ca_system_score_codex":0.000599585,"about_ca_system_score_gemma":0.00063297484,"threshold_uncertainty_score":0.0060173273},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023362767,0.007866154,0.82211834,0.085860245,0.0014583238,0.00017052417,0.00025938204,0.00084062153,0.058063608],"genre_scores_gemma":[0.65677375,0.010753622,0.29682797,0.0049405727,0.0015566882,0.00034128074,0.00027117724,0.00030388345,0.028231014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849224,0.00039510147,0.0000948362,0.00022222553,0.00060642377,0.00018909654],"domain_scores_gemma":[0.9973706,0.0006746107,0.0002142825,0.00042697584,0.0009151404,0.00039836759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002442118,0.00089883903,0.0011045329,0.0006126007,0.0016426805,0.008663147,0.0018003149,0.0034317805,0.005975176],"category_scores_gemma":[0.00378449,0.00064860133,0.00046276874,0.0007052217,0.0038632262,0.01778139,0.004115593,0.004664921,0.001352387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009218939,0.0001004693,0.0009546876,0.00032279268,0.00006638709,0.00009208939,0.00038687402,0.03480557,0.004976141,0.8460631,0.017690498,0.09444919],"study_design_scores_gemma":[0.00003877056,0.00018172963,0.00073069334,0.00025307367,0.000091031834,0.00021014406,0.0018606372,0.1413947,0.00344401,0.6760256,0.17567362,0.00009592493],"about_ca_topic_score_codex":0.0039837323,"about_ca_topic_score_gemma":0.0038853937,"teacher_disagreement_score":0.008663147,"about_ca_system_score_codex":0.00183629,"about_ca_system_score_gemma":0.0042657503,"threshold_uncertainty_score":0.019989014},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058119494,0.0012463324,0.9333399,0.0003334783,0.00040208382,0.00014600174,0.00059477263,0.0031299032,0.0026880067],"genre_scores_gemma":[0.51456237,0.0011096477,0.47330108,0.00014823556,0.0003078759,0.0003413623,0.0028808583,0.00020349353,0.0071450905],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985689,0.0002686987,0.00009641885,0.00029532344,0.00058155996,0.00018909067],"domain_scores_gemma":[0.9991775,0.00013583912,0.000037354945,0.00017290417,0.00044748216,0.000028770239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010549804,0.0009746589,0.001348366,0.001584676,0.00091722474,0.0010338317,0.0010406049,0.00073701475,0.0018191949],"category_scores_gemma":[0.0022637178,0.00028917272,0.001942219,0.0019571763,0.00025576318,0.0011633404,0.0009038489,0.001662617,0.0010252027],"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.00021496478,0.00028012984,0.0038587698,0.00009469204,0.00024091908,0.00009584589,0.000121415025,0.05424335,0.012835394,0.0032039084,0.011020186,0.9137904],"study_design_scores_gemma":[0.000009935889,0.00008236243,0.0042509525,0.000011916235,0.0000852545,0.00011803139,0.000047397996,0.98233527,0.0073208674,0.0028253354,0.0028858287,0.000026832147],"about_ca_topic_score_codex":0.0063680015,"about_ca_topic_score_gemma":0.0058337376,"teacher_disagreement_score":0.0063680015,"about_ca_system_score_codex":0.0004645862,"about_ca_system_score_gemma":0.0012353137,"threshold_uncertainty_score":0.012661874},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07002265,0.0005674529,0.90892935,0.0005442939,0.00040263293,0.00040610012,0.00020690673,0.0022854095,0.01663517],"genre_scores_gemma":[0.9665196,0.0001317012,0.026496414,0.000086319145,0.000052253003,0.00014091785,0.00021722559,0.000033713728,0.0063217976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933285,0.000114811846,0.000052902138,0.000121366356,0.00023885022,0.00013915956],"domain_scores_gemma":[0.9989524,0.00023706105,0.00010758092,0.00012909636,0.0005227506,0.000051078496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008827312,0.00049102935,0.0004979735,0.0010591975,0.0009608238,0.0010481752,0.0011454856,0.0004140378,0.0014677864],"category_scores_gemma":[0.0013866045,0.00016753848,0.0002337669,0.00053652975,0.00053686503,0.0010079733,0.0010941823,0.0007024683,0.00029874468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006971253,0.00043650743,0.0034253285,0.00023871142,0.00017006461,0.00045162515,0.0006932795,0.46690595,0.042464525,0.12992685,0.022014864,0.33257523],"study_design_scores_gemma":[0.000049918177,0.00024646556,0.0010065633,0.000014835847,0.00007393762,0.00013511343,0.000114469214,0.9606148,0.012644009,0.013627617,0.011436545,0.000035650457],"about_ca_topic_score_codex":0.004774488,"about_ca_topic_score_gemma":0.005592791,"teacher_disagreement_score":0.004774488,"about_ca_system_score_codex":0.000991094,"about_ca_system_score_gemma":0.0013918802,"threshold_uncertainty_score":0.009493411},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4127597,0.0026077188,0.5760472,0.00054997497,0.00028357178,0.00010032623,0.0002776943,0.0007480643,0.00662577],"genre_scores_gemma":[0.979006,0.0003033549,0.018910322,0.000034718185,0.00002891268,0.00001850039,0.000073495525,0.00001564804,0.0016090244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995142,0.00014358139,0.000021629781,0.00005466636,0.00015274047,0.00011307512],"domain_scores_gemma":[0.9981839,0.0008345006,0.00012073198,0.00018048589,0.0006183411,0.00006198525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006307506,0.00031907062,0.00066658796,0.0008950018,0.0007817534,0.0006810231,0.0010908258,0.0005767648,0.0006248391],"category_scores_gemma":[0.0025890283,0.00022148862,0.00018767516,0.0011216139,0.000456342,0.0008342178,0.00053970335,0.0003875888,0.00009719554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008998957,0.00018277937,0.0037264102,0.00031306536,0.000101908685,0.00093707396,0.00044678597,0.7330589,0.042309027,0.07924992,0.0059883604,0.13278581],"study_design_scores_gemma":[0.0000086925065,0.000056946672,0.00018961544,0.000008661095,0.000017356644,0.00010610961,0.00004244314,0.99104464,0.0029610791,0.004803456,0.0007501124,0.000010851353],"about_ca_topic_score_codex":0.008496331,"about_ca_topic_score_gemma":0.00994164,"teacher_disagreement_score":0.008496331,"about_ca_system_score_codex":0.0013095195,"about_ca_system_score_gemma":0.0009956345,"threshold_uncertainty_score":0.016893804},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010736401,0.64401466,0.045573518,0.2610719,0.008157541,0.0000636789,0.0002630288,0.0003346127,0.02978464],"genre_scores_gemma":[0.22450428,0.6736113,0.033880126,0.032951724,0.025031898,0.00016747572,0.00039596934,0.00010667945,0.009350564],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978472,0.0006233758,0.00012449855,0.0003488539,0.00072081614,0.00033521705],"domain_scores_gemma":[0.987064,0.008484426,0.0008777683,0.00042557713,0.0019561457,0.0011920304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007801351,0.0007087225,0.0012401538,0.0013342547,0.0013450878,0.009206025,0.0023338166,0.0064748535,0.009399563],"category_scores_gemma":[0.0073623993,0.0005095993,0.00063582417,0.0024303359,0.0047357106,0.0209643,0.0047120294,0.005656021,0.0020224575],"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.00033518096,0.00028121486,0.004083694,0.004252124,0.00013515001,0.0002706218,0.00064891,0.0044084447,0.0024604958,0.32161918,0.06896127,0.5925438],"study_design_scores_gemma":[0.00005417387,0.0003004093,0.0023152262,0.004346351,0.000121177465,0.0007563707,0.0053482684,0.020454839,0.0012912691,0.4852629,0.4795902,0.00015878867],"about_ca_topic_score_codex":0.00091307866,"about_ca_topic_score_gemma":0.0018755249,"teacher_disagreement_score":0.009399563,"about_ca_system_score_codex":0.0012974463,"about_ca_system_score_gemma":0.0034829194,"threshold_uncertainty_score":0.041257977},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9833287,0.0003574567,0.008952723,0.00016834811,0.00040742793,0.00012933798,0.00029094217,0.0029798571,0.0033851278],"genre_scores_gemma":[0.994768,0.00008157398,0.004007517,0.00004710751,0.000017981363,0.00002933867,0.00023253096,0.00008775229,0.0007281004],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986947,0.00025425578,0.00009787225,0.00023890699,0.00028477304,0.00042951532],"domain_scores_gemma":[0.99606484,0.0013577474,0.0003318183,0.00076551834,0.0010238665,0.0004562178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013454971,0.0009855101,0.0005458458,0.0005930764,0.0007002782,0.0008599471,0.0014956519,0.0006909539,0.0032885927],"category_scores_gemma":[0.004110314,0.00025471603,0.00028779753,0.0006234361,0.00056048395,0.0012218772,0.0005229172,0.0008587988,0.0005443401],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.02835975,0.0075597716,0.025255946,0.002015869,0.00058361446,0.0023193324,0.00085236534,0.2300961,0.4854361,0.0045838994,0.025482757,0.18745445],"study_design_scores_gemma":[0.00089885923,0.006512718,0.0247739,0.00009126611,0.00028521896,0.0005924021,0.000895667,0.76111704,0.1994223,0.000990372,0.0043084756,0.00011178724],"about_ca_topic_score_codex":0.004139663,"about_ca_topic_score_gemma":0.0021477074,"teacher_disagreement_score":0.004139663,"about_ca_system_score_codex":0.00057599327,"about_ca_system_score_gemma":0.00072369934,"threshold_uncertainty_score":0.011001468},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015486136,0.00009056281,0.97954273,0.00038800284,0.00009610849,0.00009026327,0.00004691182,0.0016765159,0.0025826849],"genre_scores_gemma":[0.7614457,0.00011238292,0.23442955,0.00022266785,0.00012443737,0.00014505033,0.00013252303,0.00027643336,0.003111222],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991172,0.00022748484,0.00004937806,0.00018504301,0.00023616,0.00018471014],"domain_scores_gemma":[0.99887806,0.0004659378,0.00007161289,0.00020993913,0.00020143586,0.00017295971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002493202,0.00062060356,0.0009829823,0.00041651414,0.0010328626,0.0024196175,0.0021918037,0.0011622455,0.0027489383],"category_scores_gemma":[0.0045436583,0.00041046747,0.0005387749,0.00040227023,0.0011086653,0.002829033,0.0025886465,0.0017386276,0.00043484164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071617815,0.0005414112,0.004179845,0.00013006025,0.00012740765,0.00055354444,0.00089002104,0.5540703,0.014198488,0.21049964,0.011075842,0.20301732],"study_design_scores_gemma":[0.000013658487,0.000023764165,0.00012676367,0.000005542388,0.000008462602,0.000023066586,0.000038533595,0.96578014,0.0010898254,0.03165687,0.0012233993,0.000009999188],"about_ca_topic_score_codex":0.004878632,"about_ca_topic_score_gemma":0.0064373733,"teacher_disagreement_score":0.004878632,"about_ca_system_score_codex":0.0007634523,"about_ca_system_score_gemma":0.0014154238,"threshold_uncertainty_score":0.013185501},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25998393,0.00090138527,0.7302542,0.00036472507,0.00014215356,0.00009224439,0.00012034847,0.00030318255,0.00783798],"genre_scores_gemma":[0.97785646,0.00011776697,0.020128455,0.000031198833,0.0000120064,0.000028975286,0.0000433555,0.000003965594,0.0017778628],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984026,0.000034600635,0.0000068319428,0.000038254515,0.00004953968,0.000030530176],"domain_scores_gemma":[0.9998925,0.000023006889,0.000018825622,0.000017255405,0.00003719189,0.000011183582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001830998,0.0003408941,0.00035785366,0.0002559735,0.00041363714,0.00027347985,0.0005529035,0.00027015625,0.00070734735],"category_scores_gemma":[0.00029272717,0.00007766658,0.00017135475,0.00043602192,0.00020070675,0.0005341733,0.00050980115,0.00020469769,0.00009505411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004893652,0.0002662182,0.0024313089,0.0002015398,0.000115065115,0.00038382356,0.00025150573,0.5521123,0.12239877,0.024776025,0.0053217267,0.29125232],"study_design_scores_gemma":[0.000011783862,0.00016192517,0.00064339174,0.0000037385,0.000012900119,0.00009722827,0.000060694485,0.987483,0.007966934,0.002444259,0.0011051855,0.000009004429],"about_ca_topic_score_codex":0.0013137383,"about_ca_topic_score_gemma":0.0036413164,"teacher_disagreement_score":0.0013137383,"about_ca_system_score_codex":0.00029073516,"about_ca_system_score_gemma":0.00049967004,"threshold_uncertainty_score":0.0026121736},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008889059,0.0005005926,0.9859794,0.00061346055,0.000044879656,0.0001619715,0.00009967153,0.00038812225,0.0033229722],"genre_scores_gemma":[0.23611665,0.0015778006,0.7572058,0.00033931748,0.00011146188,0.0005872727,0.00036321647,0.0002656082,0.0034328385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950629,0.0021541466,0.0005793446,0.000544371,0.0012308595,0.00042848082],"domain_scores_gemma":[0.98617727,0.004419575,0.00093579706,0.0042052874,0.0036258537,0.0006362964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006305858,0.0012601473,0.0012297999,0.0023733838,0.002010966,0.0063615777,0.0038973542,0.0029777025,0.0025165812],"category_scores_gemma":[0.016300704,0.0011573822,0.0010703284,0.0026440886,0.003399587,0.0089764865,0.0023057328,0.0032872302,0.0008435675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009543646,0.0001097447,0.0015432335,0.00029120676,0.00003624018,0.000085297695,0.00056657667,0.038342923,0.0037025525,0.8892672,0.0026197592,0.06333975],"study_design_scores_gemma":[0.00003137391,0.00023083093,0.00043834667,0.00026313582,0.00009586766,0.000298252,0.00036780894,0.40633282,0.004543368,0.56320786,0.02413164,0.000058692098],"about_ca_topic_score_codex":0.0026706022,"about_ca_topic_score_gemma":0.0031548277,"teacher_disagreement_score":0.0063615777,"about_ca_system_score_codex":0.002760027,"about_ca_system_score_gemma":0.003864263,"threshold_uncertainty_score":0.033348978},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56995684,0.0013444662,0.41736796,0.0004833093,0.00018606517,0.000040685994,0.0002838809,0.0014735674,0.008863131],"genre_scores_gemma":[0.9926052,0.00011458301,0.0059352973,0.000020998094,0.00001984025,0.000008966665,0.000078264566,0.000019402178,0.0011973857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996842,0.00007967273,0.00001268679,0.00007561578,0.00009020771,0.000057655787],"domain_scores_gemma":[0.99924976,0.00036777114,0.00008378363,0.000053487704,0.00021499951,0.000030159488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005448436,0.00071707345,0.0004538478,0.00075814745,0.00019855189,0.00052950723,0.0006086149,0.00067954394,0.0010231058],"category_scores_gemma":[0.0021092722,0.00016936634,0.00028465144,0.00053661154,0.00032288962,0.0006075108,0.00036350466,0.0005796874,0.00037812872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018503347,0.000034245022,0.0023635388,0.000030163368,0.000022642524,0.00005240755,0.00001625259,0.95802885,0.003341391,0.0008441268,0.0003917207,0.034689605],"study_design_scores_gemma":[7.2557606e-7,0.0000075077073,0.00031887103,8.6263196e-7,0.000001987323,0.000004873669,0.0000014698514,0.9991671,0.00035792787,0.000116695526,0.000020565793,0.0000013742804],"about_ca_topic_score_codex":0.0073489984,"about_ca_topic_score_gemma":0.004313088,"teacher_disagreement_score":0.0073489984,"about_ca_system_score_codex":0.0007368213,"about_ca_system_score_gemma":0.00029906354,"threshold_uncertainty_score":0.014612436},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07879235,0.00038292102,0.9166425,0.00017106411,0.00016877585,0.000046471512,0.000015913882,0.0004728888,0.0033070513],"genre_scores_gemma":[0.97768915,0.00008938649,0.021161336,0.000039071787,0.000020754116,0.00003147799,0.000010208146,0.000010033374,0.00094855035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999551,0.00009465822,0.000021277725,0.00012611694,0.00014642214,0.00006038658],"domain_scores_gemma":[0.9994325,0.00021775173,0.000061046776,0.000037552592,0.00021502796,0.000036153502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077932,0.00047812954,0.000666728,0.0004228659,0.0006215353,0.000783528,0.0010315635,0.00054101495,0.0011435482],"category_scores_gemma":[0.0014142832,0.0002187412,0.00027476647,0.00037293107,0.00058416615,0.00066364295,0.0006587401,0.0008670853,0.000088501445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005966489,0.00028900953,0.0016011053,0.00018212528,0.000093183866,0.0001994274,0.00026885522,0.77907664,0.04021209,0.020084796,0.0021177717,0.15527825],"study_design_scores_gemma":[0.00000853204,0.000047296977,0.00008243643,0.0000021092658,0.000006552844,0.000010552648,0.0000032205035,0.9981396,0.0010352915,0.0005588441,0.000101387224,0.0000040809323],"about_ca_topic_score_codex":0.0054823053,"about_ca_topic_score_gemma":0.0035897032,"teacher_disagreement_score":0.0054823053,"about_ca_system_score_codex":0.00077621016,"about_ca_system_score_gemma":0.0007906718,"threshold_uncertainty_score":0.010900795},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077802196,0.00030683773,0.89554226,0.00066192617,0.00026341208,0.00009571411,0.0005635273,0.0020837432,0.022680342],"genre_scores_gemma":[0.90833133,0.0002090468,0.084025756,0.00020389521,0.000064879794,0.00007651688,0.0004192927,0.00023992121,0.0064293444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994485,0.0002931125,0.000015335165,0.0000546427,0.00013825757,0.00005016606],"domain_scores_gemma":[0.9986083,0.0009429765,0.0000834276,0.00013425366,0.00018532289,0.000045701996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071831484,0.0005341193,0.00040836027,0.00032614835,0.00026421493,0.0007350855,0.0009840196,0.0010266775,0.0054448936],"category_scores_gemma":[0.0051069558,0.00026057992,0.00032306978,0.0003761291,0.00040684294,0.00094178424,0.0007263474,0.0007791359,0.0006536794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012487543,0.00004613395,0.00045767712,0.00004040506,0.000015297686,0.00008791599,0.000047505204,0.96813923,0.0015442678,0.014156505,0.0027460065,0.0125941485],"study_design_scores_gemma":[0.000008618784,0.000017772665,0.000053025233,0.0000032672713,0.0000021917479,0.000028956483,0.000005164018,0.99729544,0.00042562708,0.0015146473,0.0006422694,0.0000030731248],"about_ca_topic_score_codex":0.002938121,"about_ca_topic_score_gemma":0.00181046,"teacher_disagreement_score":0.0054448936,"about_ca_system_score_codex":0.00048047604,"about_ca_system_score_gemma":0.00033870857,"threshold_uncertainty_score":0.018214941},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07507439,0.0027267276,0.8965824,0.0012320156,0.0001666518,0.00032890736,0.00051859353,0.00083746895,0.02253282],"genre_scores_gemma":[0.7076847,0.0011847531,0.2801938,0.00044558677,0.00012109058,0.00042684723,0.00034848938,0.00022617717,0.009368545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946314,0.0002752241,0.000015412159,0.000065461914,0.000073736126,0.00010701749],"domain_scores_gemma":[0.9984938,0.0012056939,0.0000794838,0.000051909665,0.00012536296,0.000043751235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012243441,0.001246543,0.0013295384,0.0018515668,0.000782057,0.001645832,0.001414544,0.001638335,0.010010678],"category_scores_gemma":[0.0037742604,0.0007712837,0.0007201706,0.0022785466,0.0010607949,0.0012669511,0.0009881172,0.001006704,0.000802105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008518297,0.00004961808,0.00025147654,0.000078783996,0.00003603542,0.00003637389,0.0000475673,0.9566983,0.0003905592,0.0075644865,0.0024680828,0.03229356],"study_design_scores_gemma":[0.000026874643,0.000024836878,0.00005211574,0.000011722638,0.0000106743355,0.000012218105,0.000031758125,0.9936279,0.00012866079,0.005722782,0.0003467278,0.0000037093143],"about_ca_topic_score_codex":0.008937494,"about_ca_topic_score_gemma":0.007774053,"teacher_disagreement_score":0.010010678,"about_ca_system_score_codex":0.0015449447,"about_ca_system_score_gemma":0.00182899,"threshold_uncertainty_score":0.033489108},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6129398,0.0006141538,0.3751913,0.00038818046,0.00008209903,0.000041792995,0.00009653918,0.0007463524,0.009899853],"genre_scores_gemma":[0.9838464,0.000048816546,0.014989444,0.000017228147,0.0000075524763,0.000010784429,0.000026840537,0.000033010707,0.0010199458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995715,0.00012882306,0.000018459641,0.00006581256,0.00010881933,0.000106629326],"domain_scores_gemma":[0.9992163,0.00039451793,0.00006194472,0.00013482812,0.00015059164,0.00004180969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007828835,0.00048526638,0.00044604315,0.00037097002,0.00038775324,0.0009305329,0.0007713436,0.00035426914,0.0015307713],"category_scores_gemma":[0.001860882,0.00021752159,0.00017565311,0.0004330641,0.0003494671,0.0010013779,0.00067457545,0.00027925274,0.00018523494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090445334,0.0002536635,0.0025058605,0.000084464344,0.00005310279,0.00006285363,0.00011881634,0.7808295,0.03180884,0.015796863,0.001447351,0.16613422],"study_design_scores_gemma":[0.000014059946,0.00006039584,0.0004660753,0.0000057753878,0.000015190527,0.000022122227,0.000043546734,0.98680484,0.0059902524,0.0062705204,0.0003018056,0.0000053809026],"about_ca_topic_score_codex":0.0018488086,"about_ca_topic_score_gemma":0.0042561125,"teacher_disagreement_score":0.0018488086,"about_ca_system_score_codex":0.0007462086,"about_ca_system_score_gemma":0.0005511437,"threshold_uncertainty_score":0.0054141283},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67684484,0.0018915923,0.31149825,0.00096195086,0.00028841672,0.00014284038,0.00024238347,0.00067226315,0.0074573867],"genre_scores_gemma":[0.9972276,0.00009018311,0.001996513,0.000025833779,0.000014347268,0.000007302732,0.000030005856,0.0000035044702,0.00060459273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995426,0.000140124,0.000023313833,0.0000659855,0.00013142622,0.0000965473],"domain_scores_gemma":[0.9982919,0.0009702031,0.00017854631,0.00010674031,0.000371379,0.00008117912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079727144,0.00032600848,0.00044915828,0.00063907384,0.00039786435,0.0006089929,0.00048781387,0.00046499516,0.0005886604],"category_scores_gemma":[0.0037771983,0.00014913909,0.00012902323,0.0004929136,0.00027682827,0.0007013885,0.0008355973,0.0003052811,0.000118997705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003092715,0.00031466305,0.012304059,0.0005625572,0.00020774735,0.0013362757,0.0019029458,0.5795273,0.08432111,0.033676922,0.007404607,0.27534905],"study_design_scores_gemma":[0.000030991567,0.0003275752,0.002748766,0.000015969164,0.00006142507,0.00023370615,0.00037729053,0.9822817,0.0059612915,0.0052323486,0.0027082672,0.000020679689],"about_ca_topic_score_codex":0.0019083485,"about_ca_topic_score_gemma":0.0031831884,"teacher_disagreement_score":0.0019083485,"about_ca_system_score_codex":0.0004009364,"about_ca_system_score_gemma":0.0004781008,"threshold_uncertainty_score":0.0042164326},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45510957,0.002553585,0.52130485,0.0025496879,0.00013708588,0.0002981204,0.00089013425,0.00057365594,0.016583292],"genre_scores_gemma":[0.9896408,0.00073162204,0.0072085345,0.00008500584,0.000061233135,0.000044809847,0.00017240275,0.0000522847,0.0020033747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980392,0.0006064793,0.00005844317,0.00024116236,0.00047297656,0.0005818793],"domain_scores_gemma":[0.99127126,0.0064042485,0.0007252325,0.00018058973,0.0011747994,0.00024387486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039031066,0.0014030728,0.0010773605,0.0012424742,0.0008827102,0.0017252334,0.0016614129,0.0014373433,0.0017117994],"category_scores_gemma":[0.010285389,0.000847106,0.0006758103,0.001554046,0.0015882167,0.0019202287,0.001385914,0.0010601585,0.00022339889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009399329,0.00005498729,0.001466994,0.00005570315,0.000032147113,0.00010224518,0.000039460254,0.9800284,0.0013964209,0.010993532,0.0010402531,0.0046958053],"study_design_scores_gemma":[0.0000041635717,0.000034385026,0.0004190864,0.0000039084644,0.000012428172,0.000027163103,0.000023446806,0.9976624,0.0002907759,0.0014328366,0.000082304585,0.0000071107697],"about_ca_topic_score_codex":0.030927876,"about_ca_topic_score_gemma":0.020598544,"teacher_disagreement_score":0.030927876,"about_ca_system_score_codex":0.004998614,"about_ca_system_score_gemma":0.0021553463,"threshold_uncertainty_score":0.06149572},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020706875,0.0004654353,0.9723518,0.0006547416,0.000132128,0.00016877716,0.000026645355,0.0003772831,0.0051163156],"genre_scores_gemma":[0.6107069,0.0012222036,0.37868184,0.0005602507,0.00012101454,0.00023555548,0.00012744608,0.00012239807,0.008222396],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897337,0.00031354997,0.00010428711,0.00013170196,0.00035454222,0.00012255396],"domain_scores_gemma":[0.9981913,0.0006750705,0.0003409296,0.00031512044,0.00040277123,0.000074799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015666987,0.0005637173,0.0003095129,0.0004340475,0.0006303405,0.002047973,0.0009898182,0.0012394536,0.0015691754],"category_scores_gemma":[0.002762639,0.00047219006,0.00047076514,0.0003728639,0.00083493313,0.0033020081,0.0015143342,0.0011464801,0.00082893687],"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.00052616466,0.0003136032,0.005263664,0.0011449057,0.00014553352,0.0010379186,0.0011417073,0.10862663,0.31583345,0.2983038,0.008174458,0.2594881],"study_design_scores_gemma":[0.000050035433,0.00056626945,0.0011070372,0.00025495412,0.00013850593,0.0009442398,0.0006737934,0.69350237,0.19694236,0.057320565,0.048419505,0.00008036883],"about_ca_topic_score_codex":0.00053546147,"about_ca_topic_score_gemma":0.00088485464,"teacher_disagreement_score":0.002047973,"about_ca_system_score_codex":0.00067637285,"about_ca_system_score_gemma":0.0012979488,"threshold_uncertainty_score":0.008285582},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03514073,0.0006009812,0.95925236,0.00018527279,0.00017655618,0.00005345074,0.000039883416,0.00045265802,0.0040980247],"genre_scores_gemma":[0.69533783,0.00031689982,0.30070078,0.00013239193,0.000070380454,0.00007646731,0.00014256875,0.000040116684,0.0031825441],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998443,0.000029022185,0.000008286283,0.00003368675,0.00005556183,0.00002907981],"domain_scores_gemma":[0.99989796,0.000030131889,0.000011862246,0.00001006537,0.000043004453,0.0000069305656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002499214,0.00044990046,0.0005784861,0.00033533128,0.00045738762,0.00046006442,0.0005303869,0.00039867914,0.0011107351],"category_scores_gemma":[0.0004399247,0.00013869921,0.00031051753,0.00040801047,0.0001730981,0.00051698636,0.0004082602,0.0003281144,0.00017730384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028949446,0.00010650201,0.00166643,0.000085213636,0.00009370746,0.00010958898,0.000105180836,0.61956596,0.021213222,0.012321418,0.006284865,0.33815837],"study_design_scores_gemma":[0.0000064924257,0.000040232982,0.00018730275,0.000002729955,0.000008930039,0.000027853426,0.0000125298475,0.99672997,0.0013196146,0.0008888645,0.00077213516,0.0000032754679],"about_ca_topic_score_codex":0.0034324313,"about_ca_topic_score_gemma":0.0054207337,"teacher_disagreement_score":0.0034324313,"about_ca_system_score_codex":0.000460827,"about_ca_system_score_gemma":0.00047744226,"threshold_uncertainty_score":0.0068249106},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18578836,0.00066609425,0.79751736,0.00078077015,0.00024245097,0.00013076581,0.00012051629,0.00064626406,0.014107397],"genre_scores_gemma":[0.9415774,0.00029486185,0.05445171,0.000099578014,0.000079516074,0.00005928064,0.00008984455,0.00004628922,0.0033016226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993273,0.0001353226,0.000044807988,0.00011830893,0.00028180503,0.00009238705],"domain_scores_gemma":[0.9975561,0.0006302643,0.00046009387,0.000848411,0.00040519048,0.00009994432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084670645,0.0006465744,0.00047961716,0.000681399,0.00066905486,0.0010546377,0.0006247224,0.0007484655,0.0026638033],"category_scores_gemma":[0.0035767201,0.0002782492,0.00037690997,0.00043395633,0.0011861739,0.0019880335,0.0013296208,0.0012854682,0.00094372354],"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.0017752623,0.00023520176,0.0025522672,0.00042159524,0.00012998703,0.0005945511,0.00050143775,0.17760068,0.3286297,0.33092815,0.0026165615,0.15401465],"study_design_scores_gemma":[0.00009720104,0.0010349351,0.0016634959,0.00016330044,0.00013106577,0.0012538825,0.00023843587,0.70287997,0.19486815,0.08638711,0.011185008,0.000097481585],"about_ca_topic_score_codex":0.00013879697,"about_ca_topic_score_gemma":0.00017758978,"teacher_disagreement_score":0.0026638033,"about_ca_system_score_codex":0.0003906463,"about_ca_system_score_gemma":0.00066045567,"threshold_uncertainty_score":0.008911252},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026773052,0.00023325093,0.95604855,0.00046663205,0.000118916236,0.0003244299,0.0007286288,0.007996773,0.0073097954],"genre_scores_gemma":[0.8070717,0.00039097,0.17438766,0.00022564574,0.0000766878,0.00035435605,0.0019854298,0.00064759323,0.014859956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898976,0.00017901,0.000051123632,0.00013820203,0.0004070037,0.00023489547],"domain_scores_gemma":[0.99911827,0.000185802,0.00005806811,0.0004333887,0.00012166463,0.000082756516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015495961,0.0005547741,0.000499888,0.0006286968,0.0010458645,0.0014979515,0.0017170879,0.0013009779,0.0057975356],"category_scores_gemma":[0.0018574232,0.00032894942,0.00054371683,0.0005120297,0.0011101849,0.00340701,0.0031895572,0.0015541516,0.0012716582],"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.0014582784,0.00037212827,0.00248872,0.00050550787,0.00014419295,0.0014089486,0.0007163308,0.25082204,0.04066399,0.3839525,0.034652017,0.28281534],"study_design_scores_gemma":[0.00010776979,0.00020287588,0.00051660824,0.00004659835,0.00003132119,0.00030267015,0.00012862388,0.77165776,0.023936195,0.14573744,0.057273977,0.00005814188],"about_ca_topic_score_codex":0.0044789556,"about_ca_topic_score_gemma":0.0038648725,"teacher_disagreement_score":0.0057975356,"about_ca_system_score_codex":0.00076516974,"about_ca_system_score_gemma":0.0018642349,"threshold_uncertainty_score":0.019394696},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02943559,0.0007572779,0.96642584,0.00085532636,0.00013820191,0.00006400556,0.00014560993,0.00014974875,0.002028412],"genre_scores_gemma":[0.9467288,0.0009206728,0.043392625,0.00027821152,0.00033995052,0.0002028544,0.00020135354,0.00013497818,0.007800619],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704355,0.0014138641,0.00010412835,0.00044798607,0.00050381874,0.00048660714],"domain_scores_gemma":[0.9901447,0.007587732,0.0008633699,0.0002870633,0.0007651178,0.0003519918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053391317,0.0017761252,0.0026932007,0.0009644245,0.0005614004,0.0021916358,0.002233933,0.0020075142,0.0021321347],"category_scores_gemma":[0.018930795,0.0015982729,0.00090154423,0.0013641377,0.0022951097,0.0027404283,0.002424053,0.0021804972,0.00026444628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120353,0.00004148438,0.00019019842,0.000035706904,0.000039009192,0.000039675302,0.000026612819,0.9742647,0.0005677052,0.019226624,0.00064354343,0.004804413],"study_design_scores_gemma":[0.0000089888645,0.000009218366,0.00005211848,0.000002132263,0.0000042144507,0.0000052305377,0.0000030981753,0.9958677,0.00007229354,0.003921692,0.00004880084,0.0000044749017],"about_ca_topic_score_codex":0.011388156,"about_ca_topic_score_gemma":0.0064693075,"teacher_disagreement_score":0.011388156,"about_ca_system_score_codex":0.0027599642,"about_ca_system_score_gemma":0.0025969085,"threshold_uncertainty_score":0.02823639},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008802986,0.2616687,0.6940359,0.0051944903,0.0016752419,0.00010167379,0.00022370633,0.00032339082,0.027973859],"genre_scores_gemma":[0.3466231,0.4226493,0.2092756,0.0023603523,0.007286036,0.00028727693,0.0006248627,0.00023586578,0.010657576],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990381,0.0001891521,0.00009067597,0.00019581191,0.00038872423,0.000097655065],"domain_scores_gemma":[0.9982999,0.0011527819,0.00010240615,0.00015768777,0.00023350459,0.00005372629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013368126,0.0010061819,0.002083389,0.0015213006,0.0007501749,0.0037512435,0.0018148904,0.001464822,0.002199258],"category_scores_gemma":[0.0031730598,0.0005003719,0.0009829698,0.003995797,0.0014049608,0.0039001468,0.0015377598,0.0017508933,0.000617018],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010911947,0.00032875364,0.0013983973,0.0027076043,0.0001039263,0.00015346485,0.00016472857,0.07614709,0.0018598058,0.35807544,0.014045032,0.5449067],"study_design_scores_gemma":[0.00002714811,0.00013203423,0.0010310586,0.00072469143,0.00007727023,0.00042635438,0.00023675874,0.54388297,0.0016286907,0.38339993,0.068356246,0.00007688858],"about_ca_topic_score_codex":0.0026333004,"about_ca_topic_score_gemma":0.0019353192,"teacher_disagreement_score":0.0037512435,"about_ca_system_score_codex":0.0012954016,"about_ca_system_score_gemma":0.002072115,"threshold_uncertainty_score":0.009398878},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00554533,0.0002958661,0.9908736,0.00017782034,0.00017811447,0.00006656674,0.000039282506,0.0015555501,0.0012677567],"genre_scores_gemma":[0.11394976,0.0003059229,0.8768753,0.00032140088,0.00014882699,0.00041671432,0.00020488142,0.0005201525,0.007257027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922657,0.00021314774,0.00004174279,0.00011477632,0.00029478894,0.00010905351],"domain_scores_gemma":[0.9985329,0.00058976415,0.000100933525,0.00022432773,0.00044255756,0.00010952709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011426787,0.0010388512,0.0013619361,0.0012331587,0.0009776037,0.0009025602,0.002276659,0.0013787085,0.0062742955],"category_scores_gemma":[0.004060458,0.00045131496,0.0006951768,0.0008452201,0.00072954537,0.0022039958,0.0020980882,0.0018466428,0.0020546527],"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.00083433994,0.00028951562,0.0011089084,0.00040085134,0.00015003124,0.00017775952,0.0001911823,0.19055346,0.029087864,0.023297565,0.025746524,0.72816205],"study_design_scores_gemma":[0.000057832276,0.00012122612,0.00013084937,0.0000134078955,0.000015851349,0.00010081512,0.000020491156,0.9866223,0.0049692015,0.0030349751,0.00489745,0.000015676329],"about_ca_topic_score_codex":0.0024969939,"about_ca_topic_score_gemma":0.0048891185,"teacher_disagreement_score":0.0062742955,"about_ca_system_score_codex":0.00065421197,"about_ca_system_score_gemma":0.0019263724,"threshold_uncertainty_score":0.020989597},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43348137,0.002481645,0.5546559,0.0028019624,0.0002614152,0.00013715836,0.002105682,0.001010919,0.0030639914],"genre_scores_gemma":[0.9755942,0.0005794291,0.020424057,0.00011325424,0.00011525142,0.000056290464,0.0012608599,0.00005840613,0.0017981797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931407,0.00022843304,0.000037707294,0.00020527873,0.00009798349,0.000116368596],"domain_scores_gemma":[0.98650604,0.011380365,0.0006247,0.00042397904,0.0006376705,0.00042724912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002008446,0.0010654554,0.0021093998,0.0014914222,0.00082146097,0.0013853606,0.0024261314,0.0021939457,0.0019852216],"category_scores_gemma":[0.015398084,0.001014528,0.00063998386,0.0024645715,0.0013916814,0.0027227004,0.0018528557,0.0016887906,0.00034606122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005546661,0.000019478095,0.0013457291,0.000015802269,0.000015741009,0.000018611494,0.000013305564,0.9924745,0.000044177494,0.0013049238,0.0005216612,0.004170632],"study_design_scores_gemma":[0.000002056945,0.0000030592005,0.000098620105,0.0000012143676,8.72475e-7,0.0000013445591,0.000003117539,0.9988727,0.00001379698,0.0009778218,0.000024412402,9.3141205e-7],"about_ca_topic_score_codex":0.06520441,"about_ca_topic_score_gemma":0.03534632,"teacher_disagreement_score":0.06520441,"about_ca_system_score_codex":0.0018680922,"about_ca_system_score_gemma":0.0019498179,"threshold_uncertainty_score":0.12964976},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014793512,0.00042152262,0.9817614,0.0002508029,0.000061094484,0.000050116872,0.00001887732,0.00048450375,0.002158249],"genre_scores_gemma":[0.5076847,0.0009207098,0.48704657,0.00017812001,0.00008237808,0.00010585183,0.0001596997,0.00014679488,0.0036752098],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999358,0.00015720364,0.00003992663,0.000090233494,0.00027485527,0.000079812715],"domain_scores_gemma":[0.99933344,0.00016055134,0.00008170419,0.00026755867,0.0001317439,0.000024917728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092062756,0.00055603165,0.00039074462,0.0006534393,0.0006539047,0.0010418395,0.0012058647,0.0006304339,0.0011608708],"category_scores_gemma":[0.0014995736,0.00032171185,0.00035452656,0.0006026553,0.0005230473,0.0023521069,0.001411043,0.0012162176,0.0003858399],"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.00018793857,0.0002912813,0.0015100612,0.00027018978,0.000119636825,0.0002357633,0.00048678523,0.20752071,0.1291207,0.09640211,0.005380381,0.55847454],"study_design_scores_gemma":[0.000016584963,0.00013604139,0.0006673419,0.000038826405,0.00003738324,0.00018094075,0.00017658029,0.9172861,0.020450003,0.05056912,0.010418004,0.000023111279],"about_ca_topic_score_codex":0.0007869712,"about_ca_topic_score_gemma":0.0020077836,"teacher_disagreement_score":0.0012058647,"about_ca_system_score_codex":0.00038301785,"about_ca_system_score_gemma":0.00048155445,"threshold_uncertainty_score":0.0048688054},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01327431,0.6310912,0.30765453,0.0016187755,0.001377808,0.0001831337,0.00037431563,0.00053773914,0.04388824],"genre_scores_gemma":[0.15592642,0.707895,0.11043874,0.001451918,0.0032416342,0.00020064968,0.0008837549,0.00021716292,0.019744657],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99950373,0.00010100602,0.00004109511,0.000096096934,0.00019571345,0.000062326784],"domain_scores_gemma":[0.9993799,0.00034900545,0.000044449498,0.000065044514,0.0001351869,0.000026340807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060388894,0.0010719218,0.0008956361,0.0013441727,0.00047305055,0.0013908374,0.0012523308,0.0007016981,0.006449618],"category_scores_gemma":[0.0014956311,0.00043443518,0.0006313803,0.0023301633,0.00038539452,0.0020583528,0.00095173233,0.0010576335,0.0015352147],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012068087,0.00012349548,0.0009327527,0.0023733722,0.000085875916,0.00009587023,0.00010233108,0.013439999,0.005080358,0.025275873,0.0138385445,0.9385309],"study_design_scores_gemma":[0.00006414557,0.001267957,0.004828432,0.0031419687,0.0004454653,0.0030780989,0.0005558528,0.15789925,0.010976085,0.07809065,0.7394872,0.00016494341],"about_ca_topic_score_codex":0.0014829703,"about_ca_topic_score_gemma":0.0024479178,"teacher_disagreement_score":0.006449618,"about_ca_system_score_codex":0.00047179416,"about_ca_system_score_gemma":0.00087688107,"threshold_uncertainty_score":0.021576107},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028589183,0.0002669973,0.9509312,0.00032307318,0.00017528787,0.0005243133,0.0005504414,0.0078474935,0.010791951],"genre_scores_gemma":[0.7780617,0.0004683808,0.20457047,0.00017248935,0.00006462283,0.00051957584,0.0017281758,0.00061469397,0.013799851],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994012,0.00013157529,0.00004282658,0.00007782726,0.00021003727,0.00013654058],"domain_scores_gemma":[0.9993231,0.00013304262,0.000037221296,0.00023807878,0.00014224823,0.00012631409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010427028,0.0004374063,0.00063306565,0.00053780974,0.0010741184,0.0014548766,0.0016778286,0.0009256745,0.007715207],"category_scores_gemma":[0.001439069,0.0003607563,0.00049533026,0.00051613257,0.0006520104,0.0021727073,0.0029698152,0.0012203325,0.0017509826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012914417,0.00060303,0.0037273222,0.00061315694,0.00019396712,0.0012802831,0.00070342177,0.42475775,0.03584129,0.26533887,0.027185969,0.23846355],"study_design_scores_gemma":[0.000077992336,0.00006960579,0.00027586627,0.000038623297,0.000031710908,0.00008808072,0.00006306569,0.9171062,0.0066521415,0.04749686,0.02806384,0.000035990262],"about_ca_topic_score_codex":0.008659798,"about_ca_topic_score_gemma":0.010091749,"teacher_disagreement_score":0.008659798,"about_ca_system_score_codex":0.0007651829,"about_ca_system_score_gemma":0.00249721,"threshold_uncertainty_score":0.025809884},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064541556,0.0003459374,0.9208936,0.00083822757,0.0002956875,0.00043827033,0.00028140424,0.003621007,0.008744233],"genre_scores_gemma":[0.88950956,0.0001257641,0.105813146,0.00031919588,0.00004004938,0.00015811599,0.00022591559,0.000036932535,0.0037712252],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989812,0.00022509678,0.000034042434,0.00019476192,0.00034250438,0.00022233074],"domain_scores_gemma":[0.99911386,0.00024778748,0.0000953641,0.0002682463,0.0001816791,0.00009300355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010369701,0.00048071562,0.0006086322,0.00037321472,0.00082257687,0.0010734786,0.0015091319,0.0010159764,0.002594005],"category_scores_gemma":[0.0015748806,0.00016305607,0.00038475505,0.00028585675,0.0006698658,0.001948773,0.0025308381,0.00097586174,0.00057605305],"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.0023618091,0.0009666711,0.0038133753,0.0006153325,0.00025621074,0.0015413219,0.00035524927,0.3033136,0.078423165,0.12934339,0.026370948,0.4526389],"study_design_scores_gemma":[0.0000684343,0.00031597863,0.00046843447,0.000024222707,0.000033769506,0.00049640826,0.00009427404,0.95199937,0.020105993,0.018615404,0.007749685,0.000028043203],"about_ca_topic_score_codex":0.0015746295,"about_ca_topic_score_gemma":0.0017470298,"teacher_disagreement_score":0.002594005,"about_ca_system_score_codex":0.0007483763,"about_ca_system_score_gemma":0.0014063034,"threshold_uncertainty_score":0.008677781},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010822712,0.0006303727,0.9805792,0.00063834427,0.00007794303,0.00028103666,0.0023258731,0.002467437,0.0021770652],"genre_scores_gemma":[0.1430629,0.0009877044,0.8446698,0.00042158255,0.00017733654,0.00036186242,0.005182716,0.00046569903,0.0046702665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986759,0.0004080233,0.00007210877,0.00034068708,0.00041401834,0.000089155204],"domain_scores_gemma":[0.9975309,0.0012588822,0.00022870056,0.00052011985,0.00034487667,0.00011665863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013104684,0.0012745976,0.0013282816,0.006084439,0.0013475444,0.0024953187,0.0026742597,0.0016790631,0.004060076],"category_scores_gemma":[0.0057924204,0.0006959779,0.0019723761,0.0038439913,0.0011255061,0.003332498,0.0019459253,0.0016885864,0.0011007483],"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.00031205828,0.000592669,0.00975976,0.00095681945,0.0007277471,0.0006044679,0.00063387153,0.24219821,0.008191205,0.21762417,0.036646318,0.48175272],"study_design_scores_gemma":[0.000025948764,0.00007166967,0.0010396561,0.000071016904,0.000093610994,0.00026756554,0.00013181868,0.846969,0.0019962338,0.13547182,0.013837065,0.000024602146],"about_ca_topic_score_codex":0.007371399,"about_ca_topic_score_gemma":0.012215213,"teacher_disagreement_score":0.007371399,"about_ca_system_score_codex":0.0013585945,"about_ca_system_score_gemma":0.0023753084,"threshold_uncertainty_score":0.014656961},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04705593,0.00060099096,0.947966,0.0002478116,0.00024109767,0.00005651155,0.000039224306,0.00038860997,0.0034038294],"genre_scores_gemma":[0.9922333,0.0001054226,0.0068502324,0.000025995836,0.000036644313,0.000026446189,0.000019832969,0.000008966468,0.0006933004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993231,0.000119079756,0.000031597017,0.00017030713,0.00022460464,0.00013134736],"domain_scores_gemma":[0.99895906,0.0005029686,0.00013225626,0.00008360268,0.0002690204,0.000053076164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010003428,0.0006440225,0.0010074433,0.00062179595,0.0008415177,0.0010068532,0.0016679841,0.0005557042,0.00090567133],"category_scores_gemma":[0.0023274147,0.00041928902,0.00037956543,0.0007501699,0.00077989424,0.0011672843,0.0010604429,0.0009813921,0.000103979466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015862998,0.00008436578,0.0004706382,0.000050073002,0.0000438632,0.00007103939,0.000109026354,0.94541097,0.0025107374,0.00962318,0.0011186866,0.040348828],"study_design_scores_gemma":[0.0000070220135,0.000029788947,0.00007923465,0.0000018613281,0.000008863883,0.0000073291776,0.000007790456,0.99762374,0.00029370876,0.0017954004,0.00014113792,0.0000040812943],"about_ca_topic_score_codex":0.01136239,"about_ca_topic_score_gemma":0.01017589,"teacher_disagreement_score":0.01136239,"about_ca_system_score_codex":0.0008652148,"about_ca_system_score_gemma":0.0012612796,"threshold_uncertainty_score":0.022592545},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000038411963,0.008357757,0.00022683527,0.01506407,0.9744451,0.000013217745,0.00004346225,0.00003934673,0.001771799],"genre_scores_gemma":[0.00037902314,0.0052506006,0.00008936752,0.006545333,0.9815694,0.000010264898,0.000024180104,0.000027044638,0.006104801],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967301,0.0005225336,0.00031905822,0.00047712855,0.0017112021,0.00023994825],"domain_scores_gemma":[0.9854799,0.005458595,0.0011844623,0.0003283147,0.005142602,0.0024061962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038533348,0.002775684,0.0029181119,0.0027686688,0.0015867414,0.0060351808,0.0025417446,0.010306646,0.0176131],"category_scores_gemma":[0.014729561,0.00082205416,0.0017935213,0.0014050009,0.0014772093,0.0031223805,0.0011913452,0.010207329,0.010888062],"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.00003714976,0.000012559544,0.000018900158,0.00025007778,0.000020463794,0.000091449474,0.0000046474834,0.000053825217,0.00007510494,0.00029727872,0.9919708,0.0071677663],"study_design_scores_gemma":[0.000069340436,0.00004183771,0.00022025565,0.0002810021,0.000055812485,0.0002336716,0.000017185923,0.00031780335,0.00013703531,0.0011368003,0.99747354,0.000015694784],"about_ca_topic_score_codex":0.0006478837,"about_ca_topic_score_gemma":0.002082617,"teacher_disagreement_score":0.0176131,"about_ca_system_score_codex":0.0014971694,"about_ca_system_score_gemma":0.0016187994,"threshold_uncertainty_score":0.058921754},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38710642,0.002288529,0.5958294,0.00053859066,0.00027097928,0.00007195502,0.0001335439,0.0003738191,0.01338669],"genre_scores_gemma":[0.9854425,0.00036140432,0.012205951,0.000030340145,0.000052443364,0.00002231895,0.000035522946,0.00002505033,0.00182454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995578,0.00013273166,0.000016159926,0.00009024224,0.000088281,0.000114748465],"domain_scores_gemma":[0.99845326,0.0010270168,0.00010488375,0.000118707045,0.0002002997,0.00009581977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085333514,0.00044610776,0.00056015817,0.00057252694,0.00062904326,0.0010105955,0.00093322096,0.0003716309,0.0016422747],"category_scores_gemma":[0.0028973732,0.00043285632,0.00017865469,0.0007708472,0.0006317746,0.0014473805,0.0006235767,0.00043498757,0.00022617566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007418607,0.00026076927,0.0044206507,0.00016020624,0.00009261332,0.0003380722,0.000247753,0.7558232,0.011487337,0.072160356,0.003902325,0.1503648],"study_design_scores_gemma":[0.000011189724,0.000048634465,0.0005139947,0.0000068814475,0.000018445446,0.00009350404,0.00007656254,0.9782848,0.0009176318,0.019297075,0.00072288373,0.000008427627],"about_ca_topic_score_codex":0.0018456507,"about_ca_topic_score_gemma":0.0016784822,"teacher_disagreement_score":0.0018456507,"about_ca_system_score_codex":0.00077156635,"about_ca_system_score_gemma":0.0005169545,"threshold_uncertainty_score":0.005598128},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011978971,0.00073270994,0.9610039,0.00060648395,0.0003273078,0.00028133846,0.00049781887,0.0029837287,0.021587709],"genre_scores_gemma":[0.59267074,0.0016485249,0.37709716,0.00044670596,0.00013571723,0.0006297804,0.0011079416,0.000419567,0.025843855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997341,0.000096810516,0.000012463521,0.00003324005,0.000085157924,0.000038140523],"domain_scores_gemma":[0.99977034,0.00008546139,0.00002476451,0.00003315855,0.000051769148,0.000034553304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051559706,0.0006212087,0.00033869565,0.0005848344,0.00043276098,0.00095149304,0.0012376551,0.00080928113,0.004170579],"category_scores_gemma":[0.0011600018,0.0001438305,0.00036056203,0.00059639785,0.0005172727,0.0010104188,0.0011968617,0.0008376621,0.0012595891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037267926,0.00022231213,0.0010895637,0.00042493784,0.0001247159,0.00065943005,0.00026544524,0.38331205,0.024150193,0.29836076,0.04109857,0.24991937],"study_design_scores_gemma":[0.000049764938,0.0001304377,0.00023087238,0.000049420818,0.00003562613,0.00025568018,0.000056839846,0.88599867,0.004922627,0.05818944,0.05003682,0.00004378317],"about_ca_topic_score_codex":0.003307994,"about_ca_topic_score_gemma":0.00391119,"teacher_disagreement_score":0.004170579,"about_ca_system_score_codex":0.00062042143,"about_ca_system_score_gemma":0.00096985267,"threshold_uncertainty_score":0.013951957},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10840953,0.00043257143,0.8865762,0.0003622999,0.00008449286,0.000039804483,0.000018848825,0.00010796901,0.003968414],"genre_scores_gemma":[0.9281442,0.00018698063,0.069889255,0.00003982422,0.000020262469,0.000053946125,0.00001926659,0.000019757934,0.0016266172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998584,0.00005074312,0.000006258716,0.000021420276,0.000047590307,0.000015586003],"domain_scores_gemma":[0.9996793,0.0001784056,0.000048947644,0.000020075453,0.000060498674,0.000012651942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045964794,0.00026567548,0.00036329177,0.0003951875,0.0003260094,0.00051119213,0.00044746874,0.00052913313,0.00049280765],"category_scores_gemma":[0.0015409301,0.0001841561,0.00031897027,0.0003739122,0.0006511109,0.0005370301,0.0003880896,0.00036563392,0.00004911078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017003607,0.000018693678,0.0002268374,0.000014683447,0.000013353452,0.0000133820095,0.000033290304,0.98017234,0.0012323294,0.0072439113,0.00017083276,0.0108432695],"study_design_scores_gemma":[0.0000030189185,0.000008175682,0.000040194398,0.0000010878258,0.0000017942778,0.0000029068283,0.000005316285,0.9977285,0.00014785261,0.0019972043,0.00006281543,0.0000011535822],"about_ca_topic_score_codex":0.0036882244,"about_ca_topic_score_gemma":0.0021742876,"teacher_disagreement_score":0.0036882244,"about_ca_system_score_codex":0.0005769941,"about_ca_system_score_gemma":0.0005424349,"threshold_uncertainty_score":0.007333517},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14981358,0.00071248104,0.83437777,0.0002733787,0.00034009945,0.0000606477,0.000064485546,0.0012360608,0.013121521],"genre_scores_gemma":[0.94348085,0.0001297328,0.053815454,0.00008515122,0.000039018807,0.000019541218,0.000035395005,0.000026703005,0.0023681107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998864,0.000014505083,0.0000067114042,0.000035103192,0.000033185912,0.000024171875],"domain_scores_gemma":[0.9998325,0.00003899324,0.000014871701,0.000021804268,0.00007765226,0.000014017499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027536208,0.00037447613,0.00030917433,0.00023024774,0.00038495995,0.00058301614,0.00067222374,0.00035780677,0.0017621322],"category_scores_gemma":[0.0004302051,0.00015815638,0.00024366901,0.00027667312,0.00026923517,0.00073226535,0.00047179955,0.0005072182,0.00025226272],"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.00036840548,0.0003027974,0.0025533258,0.00011181845,0.00007595469,0.0002266131,0.00011058005,0.42175442,0.060294624,0.012163313,0.0044012517,0.49763688],"study_design_scores_gemma":[0.0000035273147,0.000047071964,0.00017254769,0.000004106079,0.00000943592,0.000014861388,0.000009264953,0.9943246,0.003966708,0.0010353541,0.00040772874,0.000004776322],"about_ca_topic_score_codex":0.0048528467,"about_ca_topic_score_gemma":0.00715012,"teacher_disagreement_score":0.0048528467,"about_ca_system_score_codex":0.00043010587,"about_ca_system_score_gemma":0.00039946,"threshold_uncertainty_score":0.009649217},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17845352,0.09721183,0.5821161,0.11751528,0.0021849335,0.00021975681,0.0007878377,0.0018352256,0.019675452],"genre_scores_gemma":[0.92875665,0.013699186,0.0511163,0.0007834145,0.0027406171,0.00005912714,0.0004229426,0.000056306737,0.0023654294],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966785,0.0012782642,0.00019241877,0.0006980996,0.0008363593,0.0003163829],"domain_scores_gemma":[0.9777474,0.015471832,0.0009351616,0.0014666594,0.0035000734,0.0008789434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010840787,0.00087326247,0.002213953,0.0016987441,0.0009785183,0.006008344,0.0026296985,0.002486887,0.0019314537],"category_scores_gemma":[0.018717669,0.0004456003,0.00047673736,0.0018087202,0.0018066776,0.009634188,0.0018172138,0.0032290325,0.0007598345],"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.00040176432,0.000937534,0.057324138,0.00042424092,0.00021197715,0.00011510764,0.00023774077,0.094903626,0.0013646198,0.048490442,0.021041013,0.7745479],"study_design_scores_gemma":[0.000030045365,0.00016743998,0.0038903444,0.00018018798,0.00004184279,0.00017094954,0.0008772107,0.82651854,0.00078072463,0.16076128,0.006537847,0.000043561475],"about_ca_topic_score_codex":0.0035749685,"about_ca_topic_score_gemma":0.003181213,"teacher_disagreement_score":0.010840787,"about_ca_system_score_codex":0.00093721953,"about_ca_system_score_gemma":0.0020441008,"threshold_uncertainty_score":0.057332277},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98943555,0.0005097932,0.008644358,0.00044307462,0.00003680069,0.000031502947,0.00011934868,0.000055800567,0.0007237828],"genre_scores_gemma":[0.99757606,0.000100561374,0.0017044415,0.000037007765,0.00001978572,0.000007212893,0.00015858607,0.000007346987,0.00038910453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972926,0.0013277894,0.00013808846,0.0003516316,0.0005242499,0.0003655466],"domain_scores_gemma":[0.96755266,0.024453774,0.0022597027,0.0023046264,0.0028379469,0.00059127895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009760717,0.0006183862,0.0007560145,0.0007940892,0.0005547572,0.0013257135,0.0010678205,0.0013423861,0.0009244807],"category_scores_gemma":[0.039063923,0.00025208722,0.00044724214,0.0011161871,0.0009208456,0.0033189356,0.0010207152,0.002242643,0.00041285282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004158788,0.0040623117,0.34762156,0.00025683173,0.0004096979,0.00046223713,0.0007369108,0.37017807,0.003274593,0.00790049,0.0073639364,0.25357464],"study_design_scores_gemma":[0.000027383292,0.00024954433,0.016674943,0.000022955262,0.00004090825,0.00010228082,0.00017962231,0.9772699,0.0015024603,0.0034671067,0.00044756045,0.00001538632],"about_ca_topic_score_codex":0.0049983747,"about_ca_topic_score_gemma":0.0022967544,"teacher_disagreement_score":0.009760717,"about_ca_system_score_codex":0.0013518635,"about_ca_system_score_gemma":0.00091580703,"threshold_uncertainty_score":0.051620245},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040679168,0.0012178846,0.9507206,0.0014852501,0.00014411566,0.000036874488,0.00014373368,0.0004689582,0.005103432],"genre_scores_gemma":[0.95838964,0.00041816203,0.035932597,0.00021766782,0.000054459266,0.00004695672,0.00014612662,0.000040367308,0.004754044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967444,0.00009865748,0.000011737422,0.000069239206,0.00007029998,0.00007567485],"domain_scores_gemma":[0.99890244,0.0006890218,0.000089403984,0.00008822867,0.00016117244,0.000069724905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011646677,0.0004434752,0.00074157724,0.00024187741,0.00031495158,0.00074419985,0.0009952248,0.00089685124,0.0026245995],"category_scores_gemma":[0.0030829695,0.0002822821,0.0002825395,0.00033377323,0.00075709017,0.0013449468,0.0010285738,0.0018112651,0.00028971827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007315858,0.000055907843,0.00063535,0.00004778295,0.000029008259,0.0000425011,0.000026021713,0.9323047,0.0006813637,0.02370478,0.0026165585,0.03978285],"study_design_scores_gemma":[0.0000026851656,0.0000073519773,0.000040006846,0.000003286221,0.0000021307776,0.0000034654438,0.0000025143281,0.9900574,0.00011117222,0.009550843,0.00021773127,0.0000012767466],"about_ca_topic_score_codex":0.005234152,"about_ca_topic_score_gemma":0.006189414,"teacher_disagreement_score":0.005234152,"about_ca_system_score_codex":0.0011560819,"about_ca_system_score_gemma":0.0009394237,"threshold_uncertainty_score":0.010407388},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030723684,0.0012108333,0.9636847,0.00071774225,0.00017615604,0.000051818188,0.000072785886,0.0002754229,0.0030868503],"genre_scores_gemma":[0.91265666,0.0010125808,0.08045688,0.00016863724,0.00026906992,0.00009414837,0.00010404373,0.0001720739,0.005065935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986167,0.00059620704,0.000049239694,0.00019005612,0.00027989535,0.0002679071],"domain_scores_gemma":[0.9960425,0.0028272907,0.0003071302,0.00026616608,0.00033725897,0.00021971324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030687572,0.000998899,0.0019352048,0.0010581934,0.00084852247,0.0020491213,0.0025984577,0.0012937253,0.0019812917],"category_scores_gemma":[0.011652609,0.00089603814,0.0007785469,0.0018067644,0.0015908821,0.0023579819,0.0019377448,0.0019913996,0.00024686495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020621906,0.00005633147,0.00029344318,0.000057041598,0.00004312325,0.000031183747,0.000046980243,0.9187714,0.0011722294,0.06171935,0.0016522425,0.015950419],"study_design_scores_gemma":[0.000006781434,0.000010076852,0.000027727008,0.0000020891323,0.0000055614964,0.0000052860873,0.0000030676645,0.9882671,0.00012441668,0.011395491,0.000148953,0.0000033707677],"about_ca_topic_score_codex":0.0050069955,"about_ca_topic_score_gemma":0.0035832026,"teacher_disagreement_score":0.0050069955,"about_ca_system_score_codex":0.003117817,"about_ca_system_score_gemma":0.0025210993,"threshold_uncertainty_score":0.022621453},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13260822,0.0012066503,0.8546345,0.0006044568,0.0002230824,0.00010648712,0.00019025247,0.00052460405,0.009901796],"genre_scores_gemma":[0.9451058,0.00023011547,0.05326758,0.00008973221,0.00007167905,0.000023865174,0.000037265232,0.00003304188,0.0011409498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915004,0.0002984117,0.000032590386,0.00015664406,0.00013712708,0.00022521493],"domain_scores_gemma":[0.99865144,0.00086718414,0.00012563267,0.00010596891,0.00015326845,0.0000966229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014423378,0.00079152884,0.0013242938,0.0003936011,0.0005351344,0.0010160669,0.0007457375,0.00062828563,0.0022545476],"category_scores_gemma":[0.003290709,0.00045136892,0.0003351545,0.0005797316,0.0006858603,0.00111704,0.0008541258,0.00066192297,0.00016404821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044322564,0.00008897213,0.00069232873,0.000078446006,0.00004139317,0.00016051054,0.000057398884,0.9300436,0.006993013,0.022605477,0.0024329487,0.03636271],"study_design_scores_gemma":[0.000010211245,0.00003755603,0.00012517339,0.0000054857333,0.000009255909,0.000017311784,0.00001487643,0.9947996,0.00057960517,0.0042149383,0.00018106565,0.000005005962],"about_ca_topic_score_codex":0.0064658294,"about_ca_topic_score_gemma":0.0084398985,"teacher_disagreement_score":0.0064658294,"about_ca_system_score_codex":0.0013019881,"about_ca_system_score_gemma":0.0019728811,"threshold_uncertainty_score":0.012856364},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01686128,0.00007514602,0.9788943,0.00083385163,0.000042847583,0.0001387125,0.0000573059,0.0013530456,0.0017436192],"genre_scores_gemma":[0.62566423,0.000104000115,0.36840037,0.00046737766,0.00009432814,0.00015816408,0.00019793866,0.00026768996,0.004645982],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99509394,0.0016562049,0.00025948536,0.0010175304,0.0013094152,0.00066353567],"domain_scores_gemma":[0.9868636,0.004200352,0.0008594177,0.005344247,0.0022469007,0.00048554598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053196107,0.00089392887,0.0018304059,0.0009974508,0.002062623,0.002981176,0.0046662893,0.0042779204,0.0024728018],"category_scores_gemma":[0.017595213,0.0006260509,0.0014815412,0.0009389678,0.0029113756,0.008184894,0.004767182,0.0035630066,0.0010033523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007654621,0.0007791145,0.00763723,0.00021429644,0.00033619662,0.00047552152,0.0008028422,0.5550143,0.011426661,0.08075888,0.010296181,0.33149326],"study_design_scores_gemma":[0.000008214785,0.0000331911,0.00018188273,0.000010837326,0.000017526381,0.00011496543,0.000083010804,0.9663609,0.0028201998,0.029566064,0.00078908924,0.000013999899],"about_ca_topic_score_codex":0.0031033636,"about_ca_topic_score_gemma":0.003485269,"teacher_disagreement_score":0.0053196107,"about_ca_system_score_codex":0.0013828073,"about_ca_system_score_gemma":0.0031729133,"threshold_uncertainty_score":0.028133154},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02139571,0.0002783663,0.97340393,0.0003632011,0.0001291224,0.00008375051,0.0001604452,0.0018892279,0.0022961695],"genre_scores_gemma":[0.85910904,0.0003260331,0.13453716,0.00014750508,0.000056667854,0.00011990569,0.0003534669,0.00014984967,0.005200371],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911815,0.00023041322,0.00004868049,0.00011883323,0.0003101557,0.00017378524],"domain_scores_gemma":[0.99905974,0.00028043057,0.00010068223,0.000190782,0.0002726799,0.000095704774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010972766,0.0006775147,0.0008311103,0.0004484231,0.0005710233,0.0011983664,0.0015292277,0.0006773407,0.0015154023],"category_scores_gemma":[0.0025631273,0.0002769225,0.00064665277,0.0004323264,0.00058651716,0.002034,0.0019515472,0.0011946845,0.00040672196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033363973,0.00013097319,0.00079254207,0.000116040566,0.00006960884,0.00021490717,0.00015059029,0.8333473,0.012194459,0.046574064,0.0067991754,0.09927666],"study_design_scores_gemma":[0.0000070371657,0.000037253987,0.00005471315,0.000004497957,0.000007992312,0.000024516066,0.000020381853,0.9924958,0.0013676736,0.005041008,0.0009303218,0.000008893555],"about_ca_topic_score_codex":0.0062262528,"about_ca_topic_score_gemma":0.007619717,"teacher_disagreement_score":0.0062262528,"about_ca_system_score_codex":0.0013378985,"about_ca_system_score_gemma":0.0020706248,"threshold_uncertainty_score":0.012380004},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39016756,0.1680221,0.050207816,0.040989563,0.00042295954,0.00009990573,0.00063140015,0.00008131292,0.3493774],"genre_scores_gemma":[0.9436528,0.048289977,0.0037179373,0.00034387433,0.00020679628,0.000020409983,0.00008449333,0.000016083322,0.0036676724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987663,0.0006636335,0.00004254657,0.0000752453,0.0003234487,0.00012888806],"domain_scores_gemma":[0.9906283,0.0066290936,0.0007667859,0.00031080173,0.0014942661,0.0001707869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038697785,0.00041211533,0.00039612915,0.002927421,0.0006547431,0.0047238944,0.0008860024,0.00087109336,0.004665971],"category_scores_gemma":[0.008481991,0.00015206216,0.00039610706,0.005310359,0.0022566852,0.008919027,0.001378631,0.0009788647,0.00029845856],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032269766,0.00007883363,0.025463253,0.0011261981,0.00022317978,0.00042130353,0.0008700199,0.03518769,0.001434618,0.7365939,0.003148596,0.19512974],"study_design_scores_gemma":[0.00004750969,0.0008239137,0.06821439,0.0028522671,0.000626883,0.0017276357,0.0229512,0.11352872,0.0034514097,0.61192095,0.17372102,0.00013403375],"about_ca_topic_score_codex":0.004314092,"about_ca_topic_score_gemma":0.009843999,"teacher_disagreement_score":0.0047238944,"about_ca_system_score_codex":0.0024058097,"about_ca_system_score_gemma":0.0011173968,"threshold_uncertainty_score":0.020465553},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026731558,0.0003924528,0.9643804,0.00018205293,0.00012962484,0.000111542264,0.00008974699,0.00066260115,0.0073199705],"genre_scores_gemma":[0.4823645,0.0003532057,0.51014334,0.00011629939,0.00004560369,0.00022010556,0.0002036839,0.00013208759,0.006421165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984837,0.000025626701,0.0000054505917,0.000036504887,0.00006403319,0.000020041847],"domain_scores_gemma":[0.99982125,0.00006372297,0.000020184762,0.000022097889,0.00005017175,0.000022582803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017505752,0.0005875676,0.00066816754,0.0005049817,0.0004981663,0.0005396756,0.0011568557,0.00073378056,0.0021790233],"category_scores_gemma":[0.0006119113,0.00035813145,0.00046913078,0.0006373179,0.00030783901,0.00048158248,0.0007669309,0.0005870107,0.00031161867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006365893,0.000068031244,0.0005409111,0.0000881001,0.000040978404,0.00011467759,0.00005133309,0.88730496,0.005902635,0.0057875845,0.002821113,0.09721602],"study_design_scores_gemma":[0.000005518841,0.000017008535,0.0000399308,0.0000018321733,0.0000033675053,0.000017250828,0.00000466285,0.99856204,0.00026806595,0.0005344998,0.0005432901,0.0000025635713],"about_ca_topic_score_codex":0.008162261,"about_ca_topic_score_gemma":0.008501559,"teacher_disagreement_score":0.008162261,"about_ca_system_score_codex":0.0004627469,"about_ca_system_score_gemma":0.0009415012,"threshold_uncertainty_score":0.01622951},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005054418,0.00038483093,0.98043925,0.0001909473,0.00013625217,0.00017926517,0.00015426648,0.011767283,0.0016934313],"genre_scores_gemma":[0.27323815,0.00079849525,0.7158393,0.00048529898,0.00015928547,0.0004834203,0.00093431125,0.001770518,0.006291208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881554,0.00024249822,0.000095300355,0.0001622874,0.0005329955,0.00015147752],"domain_scores_gemma":[0.9984491,0.00046138756,0.000102345875,0.0005300401,0.0002753382,0.00018175556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024361904,0.0008017584,0.0012096622,0.0010414945,0.0016102744,0.0032385127,0.0043604667,0.0017447767,0.0028304725],"category_scores_gemma":[0.0036858667,0.0007965151,0.00095015357,0.0011776591,0.0014745151,0.0028753087,0.0028605831,0.0022960103,0.0006441987],"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.00077180436,0.0004986571,0.003097101,0.00068809366,0.0003869811,0.0006775737,0.0010554427,0.27937636,0.021023272,0.33918974,0.044266045,0.30896905],"study_design_scores_gemma":[0.000051504776,0.000065818596,0.00024211747,0.00003966926,0.00006179983,0.00014135576,0.00006109103,0.9357967,0.004779907,0.04217291,0.016528657,0.00005836957],"about_ca_topic_score_codex":0.012221331,"about_ca_topic_score_gemma":0.021714887,"teacher_disagreement_score":0.012221331,"about_ca_system_score_codex":0.0014133165,"about_ca_system_score_gemma":0.002513977,"threshold_uncertainty_score":0.024300396},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023860358,0.0001855442,0.9686973,0.00020444518,0.000118826894,0.000119107004,0.000177823,0.005529375,0.0011071977],"genre_scores_gemma":[0.5481765,0.00016960196,0.447285,0.0003040246,0.00007419337,0.00015226513,0.0006446804,0.00012277404,0.003070944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921346,0.00019961894,0.000059228867,0.00016661997,0.0002645225,0.000096478514],"domain_scores_gemma":[0.9990728,0.00031193864,0.00007949865,0.00020155335,0.0002478957,0.000086303124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019625225,0.00067623454,0.0012067299,0.0013446516,0.0006837747,0.0010414054,0.0016526649,0.0008503695,0.0012788349],"category_scores_gemma":[0.0021121264,0.00024114473,0.0009922065,0.0008485383,0.00051913044,0.0014771093,0.0017709942,0.0011712986,0.0003529601],"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.00064570305,0.0011698273,0.011595452,0.00017204606,0.0006255063,0.00024486618,0.0001802618,0.27480197,0.009265567,0.014725152,0.009431582,0.677142],"study_design_scores_gemma":[0.000011094834,0.00007835439,0.0004851953,0.0000052151418,0.000022550726,0.00004431108,0.0000258482,0.98958427,0.002558257,0.005951147,0.0012256046,0.000008114453],"about_ca_topic_score_codex":0.0034619723,"about_ca_topic_score_gemma":0.004713219,"teacher_disagreement_score":0.0034619723,"about_ca_system_score_codex":0.00067286374,"about_ca_system_score_gemma":0.0011762432,"threshold_uncertainty_score":0.010378957},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03884884,0.5402908,0.35843524,0.0023999182,0.0015144672,0.00071153115,0.00430478,0.005480451,0.048014026],"genre_scores_gemma":[0.14383467,0.603804,0.2249203,0.0016833037,0.0007646927,0.000652881,0.0091700535,0.0013036388,0.01386655],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965063,0.0009331605,0.0004360861,0.00037996803,0.0015668578,0.00017760067],"domain_scores_gemma":[0.9920512,0.0049338187,0.00057251094,0.0008101071,0.0013989233,0.00023347944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034394455,0.0011901951,0.0015168382,0.0049607316,0.0004692088,0.002386352,0.0020691345,0.0012209563,0.005230298],"category_scores_gemma":[0.010960993,0.00083465787,0.00066905195,0.008722893,0.00039220045,0.004060643,0.0010113023,0.0009775874,0.0019407572],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024150907,0.00021401762,0.0037460474,0.0067584203,0.00010030211,0.00011464751,0.00013917868,0.012120103,0.008032366,0.015190075,0.022595037,0.93074816],"study_design_scores_gemma":[0.00007550984,0.00079007656,0.0055328193,0.005302609,0.0003653397,0.0018744849,0.00043427697,0.036254194,0.019029647,0.013374448,0.9168141,0.00015237603],"about_ca_topic_score_codex":0.0013316346,"about_ca_topic_score_gemma":0.001510138,"teacher_disagreement_score":0.005230298,"about_ca_system_score_codex":0.0008401601,"about_ca_system_score_gemma":0.0016686599,"threshold_uncertainty_score":0.018189728},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078935996,0.00095264026,0.91607153,0.00038058395,0.00015257281,0.000076312936,0.000053007218,0.00043398095,0.0029434685],"genre_scores_gemma":[0.96247977,0.00027530294,0.03603191,0.00007988053,0.0000691462,0.00003893103,0.000045995672,0.000034809138,0.00094427547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993722,0.00019450176,0.00003119507,0.00011209954,0.00016345734,0.0001265833],"domain_scores_gemma":[0.9988839,0.0005005137,0.00012619766,0.00011405718,0.00027435413,0.00010094849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011945354,0.0005289365,0.001090446,0.00059107394,0.0005081688,0.00143531,0.0018150511,0.0006378839,0.0011335528],"category_scores_gemma":[0.0026542381,0.00048061597,0.0003585542,0.0009838898,0.0005228699,0.0014122764,0.0007978319,0.0008032159,0.0001738033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012789964,0.00009249353,0.0012778722,0.00004471987,0.000043618413,0.00009314672,0.00005048873,0.9517259,0.0017264658,0.004791729,0.00080087915,0.039224867],"study_design_scores_gemma":[0.000001047525,0.0000054722796,0.000044342865,0.0000010161505,0.0000025392608,0.0000049006762,0.0000045885367,0.999385,0.00007051239,0.00044573302,0.000034041746,8.4714503e-7],"about_ca_topic_score_codex":0.0064890874,"about_ca_topic_score_gemma":0.0063547934,"teacher_disagreement_score":0.0064890874,"about_ca_system_score_codex":0.00069470925,"about_ca_system_score_gemma":0.0010944987,"threshold_uncertainty_score":0.012902677},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045373794,0.0002845621,0.94903505,0.000608613,0.00007804873,0.000100514415,0.0000388343,0.00022140362,0.004259275],"genre_scores_gemma":[0.9715784,0.00008718661,0.026746264,0.00012878896,0.000047227102,0.00004052474,0.000018796503,0.000022978838,0.0013297313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992274,0.00025296808,0.000027942982,0.00017095976,0.00013470945,0.00018593433],"domain_scores_gemma":[0.99746037,0.001668376,0.00024212165,0.00011647241,0.00033714372,0.00017559157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020001344,0.0007844813,0.0015754753,0.0004941322,0.00063572545,0.0012400735,0.0019246404,0.001348282,0.001999182],"category_scores_gemma":[0.004443559,0.00041857976,0.00047959838,0.00045939785,0.0010688152,0.0014108797,0.0012259714,0.001659056,0.00017385917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010695379,0.00013124662,0.0005159257,0.000035223362,0.00004691844,0.00005237476,0.00005007319,0.9722072,0.0009041516,0.00577564,0.0007913041,0.019383091],"study_design_scores_gemma":[0.0000062474987,0.000015038527,0.000044597728,0.000002367866,0.000004634028,0.000006097929,0.0000059727176,0.99773896,0.000084962456,0.002025319,0.000063592684,0.0000021081355],"about_ca_topic_score_codex":0.00570004,"about_ca_topic_score_gemma":0.0056234114,"teacher_disagreement_score":0.00570004,"about_ca_system_score_codex":0.0011149187,"about_ca_system_score_gemma":0.0014464167,"threshold_uncertainty_score":0.011333764},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019882524,0.0056644916,0.95961565,0.0009729882,0.00032895978,0.00013698367,0.0001363631,0.0003543533,0.012907713],"genre_scores_gemma":[0.5750729,0.016877772,0.38632748,0.00025489673,0.0005740703,0.00061987323,0.0004391089,0.00019809711,0.019635804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993548,0.00030990774,0.000029851197,0.000089983216,0.00018265107,0.000032800577],"domain_scores_gemma":[0.9986779,0.0006982667,0.00009378578,0.0002857574,0.00019995138,0.000044241482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000836934,0.00050577294,0.0004238389,0.0015336565,0.0006769697,0.0020717809,0.00080878736,0.00077730196,0.0026524842],"category_scores_gemma":[0.002655636,0.00034188366,0.0003863992,0.0021998745,0.0009654252,0.0030645353,0.00090583577,0.0010936362,0.0005010773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008312227,0.00013219725,0.0025457363,0.000317762,0.0000615564,0.000120996985,0.00028327695,0.19574855,0.004062535,0.5446444,0.0068765795,0.24512334],"study_design_scores_gemma":[0.000014458756,0.00006089436,0.0006972155,0.00008939008,0.000027732112,0.0002161171,0.0001932797,0.8116668,0.0035336246,0.15522699,0.02823345,0.00004004461],"about_ca_topic_score_codex":0.0018341638,"about_ca_topic_score_gemma":0.0017565606,"teacher_disagreement_score":0.0026524842,"about_ca_system_score_codex":0.0007643965,"about_ca_system_score_gemma":0.0006352367,"threshold_uncertainty_score":0.008873463},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032714284,0.96461886,0.022061188,0.0019200938,0.00052207947,0.000060197173,0.00006155728,0.00012620365,0.007358479],"genre_scores_gemma":[0.024569832,0.94856435,0.022795744,0.00085877784,0.0014366778,0.0000532736,0.0001770124,0.000036321024,0.0015080397],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982821,0.00037225435,0.00016513253,0.00031981964,0.00071640336,0.00014424944],"domain_scores_gemma":[0.9953187,0.0031437587,0.00025204802,0.00027166167,0.00081364356,0.00020027983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024204878,0.0012074094,0.001640761,0.0029685027,0.0004796686,0.003533671,0.00214085,0.0016040166,0.0027659407],"category_scores_gemma":[0.004231533,0.00072363834,0.000843758,0.007419623,0.0011458604,0.0074854083,0.0026760546,0.002361181,0.0014317408],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007809883,0.00016564265,0.0022667171,0.008182755,0.000074041476,0.00015831875,0.0002197686,0.0017301091,0.0030010634,0.020868827,0.009102383,0.9541523],"study_design_scores_gemma":[0.000029672603,0.0005657933,0.0049979584,0.0057854056,0.00035472415,0.0024719636,0.0016992441,0.021377657,0.005963754,0.0535438,0.9030207,0.00018933258],"about_ca_topic_score_codex":0.0011119271,"about_ca_topic_score_gemma":0.0013714208,"teacher_disagreement_score":0.003533671,"about_ca_system_score_codex":0.00053378084,"about_ca_system_score_gemma":0.001379888,"threshold_uncertainty_score":0.012800872},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8879273,0.0025767877,0.08214829,0.00035364245,0.00014364671,0.00006389878,0.00056307693,0.00028348004,0.025939867],"genre_scores_gemma":[0.9892943,0.00049151387,0.008408202,0.000018653634,0.000020043333,0.000023078208,0.0002011803,0.000029388326,0.0015137108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996846,0.00013288819,0.000009019357,0.000027661237,0.00009178494,0.00005408055],"domain_scores_gemma":[0.99774915,0.0014161101,0.00012729509,0.00015707262,0.00048100858,0.00006934769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065718876,0.00047317296,0.00046402725,0.001620782,0.0003707305,0.0007888595,0.00059766736,0.00047991713,0.0049319603],"category_scores_gemma":[0.003010648,0.00019083518,0.00043676136,0.0013289916,0.00025203,0.0010576074,0.00031248084,0.00021667356,0.00025922447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042405396,0.000091589136,0.0017527711,0.00023142647,0.00006795573,0.00014047894,0.000062977655,0.9313037,0.0077476627,0.016350724,0.0020648546,0.03976177],"study_design_scores_gemma":[0.000011302028,0.00021267602,0.00216868,0.000019233137,0.00005610231,0.000086722335,0.00011594443,0.99038714,0.0016659471,0.0038514142,0.0014126297,0.00001221556],"about_ca_topic_score_codex":0.0022616454,"about_ca_topic_score_gemma":0.0029886714,"teacher_disagreement_score":0.0049319603,"about_ca_system_score_codex":0.0010321985,"about_ca_system_score_gemma":0.00039841433,"threshold_uncertainty_score":0.016499043},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0107952,0.000095919764,0.9843739,0.00010009515,0.000026376227,0.000065525164,0.000057277783,0.00023931748,0.0042464565],"genre_scores_gemma":[0.63762856,0.00021642802,0.3527919,0.00008115466,0.000058038182,0.0001916551,0.00022663678,0.00025521062,0.008550381],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990289,0.0003730185,0.00004123352,0.0001618841,0.00024244435,0.00015250681],"domain_scores_gemma":[0.997359,0.0016541836,0.00020126326,0.00019736464,0.00046375365,0.00012432411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021104398,0.0017354938,0.0014230047,0.0016552821,0.00094382156,0.0015471699,0.0015923104,0.001163332,0.007479873],"category_scores_gemma":[0.0048689325,0.0008907939,0.00105321,0.0013840919,0.001179533,0.0027553798,0.0012763683,0.0020118265,0.00057470397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004589323,0.00004150226,0.00013335093,0.000037148566,0.000011181394,0.00003015883,0.000035814428,0.9677952,0.00037785695,0.00781453,0.0005580398,0.023119317],"study_design_scores_gemma":[0.0000041236112,0.000021143323,0.000023339178,0.0000050108088,0.000004907377,0.0000067702945,0.000008078815,0.9940019,0.0002328428,0.005505999,0.000182755,0.0000030463736],"about_ca_topic_score_codex":0.010483426,"about_ca_topic_score_gemma":0.01196231,"teacher_disagreement_score":0.010483426,"about_ca_system_score_codex":0.0015790444,"about_ca_system_score_gemma":0.0025969592,"threshold_uncertainty_score":0.025022686},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023010088,0.002110028,0.89973414,0.004566088,0.00044383496,0.0002405683,0.00011263268,0.0011367901,0.0686459],"genre_scores_gemma":[0.5181248,0.0029120278,0.4229004,0.000994689,0.00036188413,0.00029518775,0.000352473,0.00031799247,0.05374049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982504,0.0005850989,0.00008423491,0.00015519524,0.00060340547,0.00032158487],"domain_scores_gemma":[0.99897814,0.0002528018,0.000071408576,0.0004725541,0.00016382197,0.00006120086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016595876,0.00056779874,0.0004117246,0.0010644757,0.0015526961,0.0033242425,0.0015994756,0.0018887745,0.007815216],"category_scores_gemma":[0.0021622954,0.00039896826,0.0006841958,0.0010176648,0.0014629867,0.0051390207,0.003766487,0.002742762,0.0027579726],"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.00007036286,0.00007710394,0.00025543608,0.000076365424,0.00001895021,0.000106776795,0.00019106209,0.011972317,0.0038444907,0.8941435,0.0080863945,0.08115724],"study_design_scores_gemma":[0.000025269037,0.00014283495,0.00036358845,0.00011453318,0.000036945698,0.00032343317,0.00032258712,0.1999766,0.011411295,0.67933273,0.10790341,0.00004672125],"about_ca_topic_score_codex":0.0012644436,"about_ca_topic_score_gemma":0.0019270969,"teacher_disagreement_score":0.007815216,"about_ca_system_score_codex":0.0012981286,"about_ca_system_score_gemma":0.0017464827,"threshold_uncertainty_score":0.026144505},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042185288,0.02121192,0.7672583,0.017496629,0.003625474,0.00017043499,0.00044637895,0.0046044295,0.14300118],"genre_scores_gemma":[0.67374176,0.022938333,0.2153604,0.007898674,0.0019656895,0.00017627579,0.0010197737,0.00049775146,0.07640138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999579,0.000071181246,0.0000124568705,0.00008387361,0.00016732069,0.00008610936],"domain_scores_gemma":[0.99905545,0.00024358177,0.000053501386,0.00015592502,0.00028268728,0.00020883171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000854217,0.0005658514,0.00041818112,0.0005800552,0.000500582,0.0025766005,0.00161873,0.0015694966,0.0108940005],"category_scores_gemma":[0.0014177819,0.0002386129,0.0002767346,0.00060208264,0.00090140937,0.006096366,0.0030793885,0.0019095333,0.002601914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027989908,0.00019823688,0.0017514318,0.0004166618,0.000050554092,0.00025089167,0.00047357596,0.009307721,0.030292021,0.50769585,0.072507605,0.3767756],"study_design_scores_gemma":[0.000037929098,0.00034512827,0.001190285,0.00035570026,0.00006831522,0.0005387219,0.00043830601,0.14071621,0.01327822,0.3915165,0.45145005,0.000064684675],"about_ca_topic_score_codex":0.00088329794,"about_ca_topic_score_gemma":0.0013833842,"teacher_disagreement_score":0.0108940005,"about_ca_system_score_codex":0.0006488783,"about_ca_system_score_gemma":0.00086137047,"threshold_uncertainty_score":0.036444068},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.518862,0.0019357434,0.4366849,0.0006886756,0.0004049206,0.000056387387,0.0002874968,0.0004848489,0.040594973],"genre_scores_gemma":[0.99190885,0.00012470079,0.006204762,0.000027272521,0.000017434664,0.000009480717,0.00004169392,0.000008187305,0.0016577106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987423,0.000025481337,0.0000031612587,0.000021357278,0.000026049463,0.00004957114],"domain_scores_gemma":[0.9998472,0.000074006,0.000011576916,0.000025287347,0.000027834234,0.000014003796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000104353945,0.00033568311,0.00027716896,0.00015144776,0.00033253673,0.0005377362,0.0002637292,0.00021710202,0.0014391306],"category_scores_gemma":[0.00044179315,0.00009137045,0.00011693227,0.0003143636,0.00018861842,0.00040556584,0.0005090548,0.0002011142,0.00018402516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058229815,0.00006779458,0.0019471695,0.00013343188,0.000047501202,0.0005273811,0.00013264258,0.81319773,0.03998424,0.019333603,0.0051989704,0.11884723],"study_design_scores_gemma":[0.0000040132154,0.000032053118,0.0003973828,0.000005427892,0.0000056273566,0.000047441106,0.00004552457,0.99336064,0.002631295,0.0026166183,0.0008511386,0.000002799069],"about_ca_topic_score_codex":0.0026996594,"about_ca_topic_score_gemma":0.0073728296,"teacher_disagreement_score":0.0026996594,"about_ca_system_score_codex":0.00023098724,"about_ca_system_score_gemma":0.00036832778,"threshold_uncertainty_score":0.0053679347},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19961311,0.005625886,0.753288,0.0015326873,0.0007732445,0.00042541325,0.0059930785,0.02590787,0.006840699],"genre_scores_gemma":[0.73902863,0.001333524,0.23547849,0.0008354189,0.00022285122,0.00028121728,0.014972009,0.00039347532,0.00745437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949586,0.00011239433,0.00002510479,0.00015525526,0.00013926113,0.00007206935],"domain_scores_gemma":[0.9993507,0.00020710046,0.000063165266,0.000120863195,0.00020913902,0.0000489767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089440134,0.0019221242,0.0012995643,0.002154031,0.00053185504,0.00070144807,0.0020608844,0.0013752112,0.0011878676],"category_scores_gemma":[0.0022374175,0.00051802763,0.0010812326,0.0012641443,0.0003005579,0.0018438719,0.0010003058,0.0019458726,0.00074147125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030010747,0.0004865621,0.007895078,0.000120174656,0.00044179757,0.00014837523,0.000049464095,0.62078345,0.0031332904,0.0019009698,0.024294583,0.34044617],"study_design_scores_gemma":[0.000009120411,0.000029680588,0.00035092022,0.0000046236923,0.000018980672,0.000017284983,0.0000052630776,0.99706334,0.00061618054,0.001120178,0.0007581214,0.000006173957],"about_ca_topic_score_codex":0.017029537,"about_ca_topic_score_gemma":0.028986244,"teacher_disagreement_score":0.017029537,"about_ca_system_score_codex":0.0012622741,"about_ca_system_score_gemma":0.000909773,"threshold_uncertainty_score":0.033860803},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078431375,0.00021266603,0.9019846,0.0001970566,0.00011911622,0.00032922684,0.00025591918,0.01602502,0.0024450482],"genre_scores_gemma":[0.73901826,0.00014981718,0.25363785,0.00020996205,0.000073944386,0.00039348216,0.0009996993,0.00014882605,0.005368133],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987895,0.000120408986,0.00011794524,0.00037337322,0.00048158725,0.000117121504],"domain_scores_gemma":[0.999193,0.000167663,0.00007958248,0.00014711954,0.00036176376,0.000050856146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008001766,0.000704828,0.0010467501,0.0011843668,0.0005060425,0.0009704494,0.0014370594,0.0006459936,0.0012569687],"category_scores_gemma":[0.0015051191,0.00030813794,0.0007053568,0.0008736536,0.00032518027,0.0017816477,0.0010355385,0.0008719217,0.0008412171],"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.0009693489,0.0010572304,0.009548071,0.0001711487,0.00017742082,0.0005618773,0.00025362495,0.07837334,0.0764719,0.0064037275,0.006410391,0.8196018],"study_design_scores_gemma":[0.000023112847,0.00016138206,0.0011893384,0.000004896488,0.00003110725,0.00016510281,0.00001568537,0.97213566,0.023435831,0.00091162045,0.0019027002,0.000023514462],"about_ca_topic_score_codex":0.003107562,"about_ca_topic_score_gemma":0.0019471082,"teacher_disagreement_score":0.003107562,"about_ca_system_score_codex":0.0006685692,"about_ca_system_score_gemma":0.0009978737,"threshold_uncertainty_score":0.0061789155},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020676348,0.00035120617,0.9737283,0.00015394374,0.0001248009,0.000034253844,0.00004032876,0.00012347827,0.004767402],"genre_scores_gemma":[0.9155068,0.00024770643,0.080725834,0.00010119982,0.00009638263,0.000054960867,0.00005284063,0.0000705906,0.0031438384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996332,0.000101655496,0.00001258869,0.00006085342,0.00008892023,0.00010275663],"domain_scores_gemma":[0.99945134,0.00029395314,0.000048111124,0.000051265626,0.000103738625,0.00005157191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006458299,0.00068381475,0.0010328321,0.00039322904,0.0005871139,0.0011048728,0.0013397849,0.00073824846,0.0028486915],"category_scores_gemma":[0.0014189266,0.00029106854,0.00066851656,0.0008576416,0.00054448383,0.0008436522,0.00094715913,0.0007210517,0.00027006198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015136665,0.00005087177,0.00032336608,0.00005586228,0.00003959465,0.000084600884,0.000051616444,0.95662266,0.0026100865,0.01022757,0.001155485,0.02862699],"study_design_scores_gemma":[0.0000029766604,0.000011400665,0.00004257898,0.00000148739,0.0000033883348,0.000011203254,0.000008965474,0.9979213,0.00018649292,0.0016479924,0.00016008492,0.0000021444946],"about_ca_topic_score_codex":0.0067281337,"about_ca_topic_score_gemma":0.0077191656,"teacher_disagreement_score":0.0067281337,"about_ca_system_score_codex":0.00068957015,"about_ca_system_score_gemma":0.0011244328,"threshold_uncertainty_score":0.0133779645},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11128866,0.0015682965,0.8744271,0.00056917605,0.0005913659,0.0004765357,0.00040193074,0.0032145584,0.0074623846],"genre_scores_gemma":[0.7976333,0.00074235676,0.1924158,0.00018773084,0.00014739293,0.00048173903,0.00047716778,0.00024762138,0.0076669534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963367,0.000065540065,0.000025620271,0.0000377932,0.00019475685,0.000042681542],"domain_scores_gemma":[0.9993255,0.00021211882,0.00007006004,0.00013679285,0.00020533334,0.0000501399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058808894,0.00037721242,0.00045102744,0.00069016183,0.0010237518,0.00045216372,0.0013780186,0.00038363723,0.00083783927],"category_scores_gemma":[0.0015694198,0.00030612893,0.00025726802,0.0006802477,0.00033279616,0.00074243464,0.0011142333,0.00048693074,0.0002260599],"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.0012108282,0.00025898498,0.0024100575,0.00041182528,0.00017806281,0.0007066262,0.00048226202,0.41047475,0.08125075,0.030202229,0.0233327,0.44908088],"study_design_scores_gemma":[0.00008212679,0.00027194855,0.0009941064,0.000018132263,0.00007380589,0.00023621306,0.00008854139,0.9661955,0.013466001,0.0062998207,0.012220152,0.000053607077],"about_ca_topic_score_codex":0.004456301,"about_ca_topic_score_gemma":0.008640047,"teacher_disagreement_score":0.004456301,"about_ca_system_score_codex":0.0005782083,"about_ca_system_score_gemma":0.0010879558,"threshold_uncertainty_score":0.008860767},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19874924,0.0013540157,0.7886949,0.0004925912,0.00011000864,0.00014957266,0.00016457213,0.0002689644,0.010016172],"genre_scores_gemma":[0.936636,0.00024220988,0.059898492,0.00008772946,0.00003317555,0.00009328027,0.000084761916,0.000075152144,0.0028493404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993843,0.00024679763,0.00001770584,0.00007638175,0.000118318385,0.00015640461],"domain_scores_gemma":[0.99894375,0.0007099088,0.000108922555,0.000034460198,0.00014292827,0.000060090482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015124219,0.001452143,0.0015332812,0.0008901623,0.00049704313,0.00132104,0.0012199548,0.001386025,0.0028615925],"category_scores_gemma":[0.002501649,0.0006612795,0.0006248671,0.000679084,0.0007680389,0.0012176005,0.0011252922,0.00093128724,0.00022070987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048878446,0.000024428351,0.00008605868,0.000023913752,0.000018468947,0.00001826724,0.000011467927,0.9938366,0.000426114,0.000961261,0.00015718996,0.004387344],"study_design_scores_gemma":[0.0000064592555,0.000022594091,0.000035133286,0.000002875065,0.0000042003326,0.0000036865588,0.0000070977453,0.99938273,0.00011897141,0.00036936923,0.000044955148,0.000001884047],"about_ca_topic_score_codex":0.0057481066,"about_ca_topic_score_gemma":0.0043204236,"teacher_disagreement_score":0.0057481066,"about_ca_system_score_codex":0.0012348455,"about_ca_system_score_gemma":0.0012598736,"threshold_uncertainty_score":0.01142925},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05048954,0.004973152,0.90672547,0.0015602054,0.0020968386,0.00066571264,0.0010286206,0.006379068,0.026081335],"genre_scores_gemma":[0.7928103,0.0026514945,0.1727989,0.0007846254,0.00032076737,0.0006534406,0.0022675206,0.00025528556,0.027457656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943966,0.00012939729,0.00004790417,0.000057901067,0.00021619085,0.00010894816],"domain_scores_gemma":[0.99953496,0.00008764748,0.000049283797,0.000087944965,0.00017087594,0.00006927498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010356298,0.0005910827,0.0007783585,0.00078100094,0.0012614718,0.0010666609,0.0014763114,0.000585324,0.0022817282],"category_scores_gemma":[0.0012643677,0.00021317111,0.00036314427,0.0007372979,0.0005360094,0.0015585752,0.002453686,0.0011800202,0.000896124],"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.0014083601,0.00037664967,0.0025795805,0.0006741474,0.00031751464,0.0011932859,0.00051151175,0.09235454,0.1061611,0.18466862,0.076693274,0.53306144],"study_design_scores_gemma":[0.00012449855,0.0004908546,0.0010220994,0.00010209552,0.00014823733,0.0011879854,0.00029231978,0.73915493,0.034560382,0.041998714,0.18074551,0.00017240988],"about_ca_topic_score_codex":0.0017204226,"about_ca_topic_score_gemma":0.003977361,"teacher_disagreement_score":0.0022817282,"about_ca_system_score_codex":0.00061461574,"about_ca_system_score_gemma":0.0011144388,"threshold_uncertainty_score":0.0076331496},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095943965,0.017455922,0.865957,0.0013884568,0.0007760007,0.0010246757,0.00054712885,0.0016267606,0.015280057],"genre_scores_gemma":[0.75021917,0.012385842,0.2199098,0.0004074681,0.0006071836,0.0013080365,0.0013796199,0.00016668862,0.01361614],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99911946,0.0000921143,0.00012819454,0.00013040083,0.00041790793,0.00011187481],"domain_scores_gemma":[0.99813604,0.00037957367,0.0002959537,0.0003727747,0.0007138735,0.00010172246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010498737,0.0008656176,0.0006289282,0.0021205028,0.001046472,0.0017760085,0.001660747,0.0007363437,0.00089227676],"category_scores_gemma":[0.0023951968,0.00035677347,0.00037886194,0.0016009726,0.0007150794,0.002242693,0.0010518403,0.0015064577,0.00036613937],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080079905,0.00056101085,0.009823729,0.0009767165,0.00013711028,0.0006238429,0.0011928503,0.056162853,0.08303387,0.21887244,0.012966378,0.6148484],"study_design_scores_gemma":[0.00005205523,0.0007784607,0.00498549,0.00029295328,0.00022361778,0.0018332312,0.00057585194,0.76899135,0.06649867,0.07894151,0.07662508,0.00020177479],"about_ca_topic_score_codex":0.0031544229,"about_ca_topic_score_gemma":0.0028529032,"teacher_disagreement_score":0.0031544229,"about_ca_system_score_codex":0.0012673163,"about_ca_system_score_gemma":0.0013840952,"threshold_uncertainty_score":0.00919503},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03056025,0.37534013,0.5652932,0.0019386325,0.0012944081,0.0003107171,0.0002802887,0.0026600077,0.022322394],"genre_scores_gemma":[0.5170387,0.22019413,0.24303149,0.0013741954,0.0022867147,0.00022440292,0.0010646378,0.0003364545,0.014449237],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991008,0.00011879649,0.00010146212,0.00022190042,0.00033498008,0.00012202051],"domain_scores_gemma":[0.99837637,0.00052589335,0.00018155834,0.00031368705,0.0005370174,0.000065518325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010160581,0.001060601,0.0012544248,0.002059157,0.00085550285,0.001619823,0.0029457384,0.00093248446,0.0029401095],"category_scores_gemma":[0.0019832747,0.00041514973,0.0007363443,0.0024975887,0.00042917597,0.0030266114,0.0009518294,0.00101931,0.00079929375],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023303379,0.00024089082,0.0016017286,0.0031404288,0.00015108197,0.00012421442,0.00018472697,0.017719785,0.007964866,0.013677107,0.01068038,0.9442818],"study_design_scores_gemma":[0.00014464071,0.0018354304,0.008700064,0.0039908634,0.0011461128,0.0035881207,0.001150976,0.3977033,0.04862612,0.06516768,0.46774453,0.00020214567],"about_ca_topic_score_codex":0.0014835515,"about_ca_topic_score_gemma":0.0015963924,"teacher_disagreement_score":0.0029457384,"about_ca_system_score_codex":0.00080478116,"about_ca_system_score_gemma":0.0011052602,"threshold_uncertainty_score":0.00983566},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16701587,0.007450054,0.51977533,0.0050840867,0.004888633,0.0009576532,0.0053182947,0.051668763,0.23784143],"genre_scores_gemma":[0.86688834,0.0013927718,0.08962902,0.0012039838,0.00032608924,0.00020179912,0.0047477507,0.0008884061,0.034721766],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977046,0.00004978363,0.0000053765652,0.000032431457,0.00007426403,0.00006770606],"domain_scores_gemma":[0.99970406,0.00003995036,0.000015479352,0.00007159874,0.00008778361,0.00008097848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004571978,0.00067260215,0.00047052873,0.00043479793,0.0007574665,0.001313612,0.0007758267,0.0005414493,0.012586679],"category_scores_gemma":[0.00061184156,0.0001214103,0.00018823646,0.00051044446,0.0003903658,0.0010522216,0.0015164729,0.0011620102,0.0022227988],"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.0018201608,0.00040025287,0.0030610804,0.00038004987,0.00015465154,0.0006487595,0.00029560935,0.051727418,0.043938562,0.11183945,0.36127156,0.42446244],"study_design_scores_gemma":[0.00024292196,0.0011039365,0.0024014234,0.00010876085,0.00008301761,0.00050844846,0.00025645294,0.6522196,0.036764104,0.05169683,0.25452,0.000094470895],"about_ca_topic_score_codex":0.0019018702,"about_ca_topic_score_gemma":0.0046157218,"teacher_disagreement_score":0.012586679,"about_ca_system_score_codex":0.00054781727,"about_ca_system_score_gemma":0.00079364894,"threshold_uncertainty_score":0.04210663},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17123231,0.0022966561,0.8111724,0.00090184336,0.00078229496,0.00012293039,0.00030895852,0.001612182,0.011570415],"genre_scores_gemma":[0.94794416,0.0004274424,0.048756894,0.0001710563,0.00014454832,0.000070828246,0.000094764204,0.000029847615,0.0023605241],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995254,0.00015708401,0.000018176166,0.00007311498,0.00009182801,0.00013431265],"domain_scores_gemma":[0.9988514,0.00033443558,0.00010692548,0.00021153323,0.0004082552,0.0000873783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006357027,0.0011090497,0.0011637516,0.0004948633,0.0011208999,0.001238204,0.0011781142,0.00087994366,0.0012278921],"category_scores_gemma":[0.0016695108,0.00041247558,0.00041289945,0.00096678926,0.000583549,0.0018224213,0.0012607415,0.0008258373,0.0005025005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015709538,0.00057948125,0.00550165,0.00044362454,0.00029593197,0.0010858655,0.0004545933,0.51831424,0.16049843,0.050114796,0.019617362,0.24152301],"study_design_scores_gemma":[0.000022084412,0.0001269597,0.00052511285,0.000010882127,0.000070916074,0.00020727786,0.0000641468,0.9857429,0.0059510777,0.0046699187,0.0025644915,0.00004421668],"about_ca_topic_score_codex":0.0052241236,"about_ca_topic_score_gemma":0.014917598,"teacher_disagreement_score":0.0052241236,"about_ca_system_score_codex":0.0008441315,"about_ca_system_score_gemma":0.0011663379,"threshold_uncertainty_score":0.010387421},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012754946,0.011324551,0.9674346,0.00087725505,0.00018084484,0.000051471223,0.00008071739,0.0005482112,0.0067474428],"genre_scores_gemma":[0.8631336,0.010866756,0.112717524,0.0004823793,0.0004967779,0.00014824585,0.00026305122,0.00014117525,0.011750409],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99972874,0.00006792376,0.000013541653,0.00006381625,0.0000732513,0.000052610645],"domain_scores_gemma":[0.9995308,0.00024515876,0.00003707236,0.000030440384,0.000119538854,0.00003711849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008255784,0.00083910045,0.0010047528,0.00029074625,0.00023990659,0.0009517446,0.0012265613,0.0010892261,0.0015286163],"category_scores_gemma":[0.0014666205,0.0003655264,0.00037517617,0.0005666072,0.0005625348,0.000902595,0.0009811653,0.001879563,0.00038960052],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053663385,0.00008448348,0.00057667284,0.00016360582,0.000056184446,0.00003549424,0.000042099633,0.81929594,0.0015813567,0.016434794,0.0031786216,0.15849707],"study_design_scores_gemma":[0.0000028658433,0.000024333895,0.00007139249,0.000011720791,0.0000047050344,0.000008025393,0.0000044511125,0.9944411,0.00028918622,0.0041355984,0.0010030972,0.0000034743805],"about_ca_topic_score_codex":0.008239378,"about_ca_topic_score_gemma":0.005982771,"teacher_disagreement_score":0.008239378,"about_ca_system_score_codex":0.00090283714,"about_ca_system_score_gemma":0.0010530084,"threshold_uncertainty_score":0.016382873},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28048962,0.00072763755,0.68632686,0.00048426384,0.00038555491,0.00038300714,0.00040959797,0.020448817,0.010344671],"genre_scores_gemma":[0.8981075,0.00010824,0.09935333,0.00006912016,0.000041319454,0.00008236263,0.00043973722,0.00050965406,0.0012887063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979296,0.0006431839,0.00012859635,0.0004493259,0.0005067275,0.00034249757],"domain_scores_gemma":[0.9968004,0.0011587045,0.00024510073,0.0010152959,0.00044505944,0.00033539467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017746262,0.0008072116,0.00078174286,0.0010105371,0.00080758135,0.001980432,0.0013953223,0.00045570408,0.002465614],"category_scores_gemma":[0.0064753657,0.00057629443,0.00045882957,0.00052896066,0.00062623207,0.0014000576,0.0022573306,0.0008138558,0.0005125746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022510663,0.00045118292,0.011126197,0.00029541436,0.00032130734,0.0009336801,0.0009396095,0.44372886,0.08814865,0.027001541,0.015403557,0.40939897],"study_design_scores_gemma":[0.000031473173,0.00006115407,0.0008048382,0.000009442231,0.000023880451,0.000060801784,0.00008615302,0.98240316,0.007990086,0.0058872383,0.0026307546,0.000010930098],"about_ca_topic_score_codex":0.0022858419,"about_ca_topic_score_gemma":0.003787416,"teacher_disagreement_score":0.002465614,"about_ca_system_score_codex":0.00073312595,"about_ca_system_score_gemma":0.0013955741,"threshold_uncertainty_score":0.009385228},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025199654,0.36082318,0.35050127,0.18144284,0.009151038,0.00015800084,0.0006976967,0.00088042713,0.071145914],"genre_scores_gemma":[0.39921325,0.35802186,0.17622392,0.01938746,0.013874756,0.00023012688,0.0014375048,0.00022122046,0.031389922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870527,0.0005131956,0.000054156124,0.0001479776,0.0003949876,0.00018440944],"domain_scores_gemma":[0.9975969,0.00087635225,0.00014987831,0.00017489676,0.0008427492,0.00035917698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003632984,0.0008064808,0.00071150326,0.0010877852,0.00074064604,0.0042614853,0.001827221,0.0034819613,0.0040955395],"category_scores_gemma":[0.0034464232,0.00037213025,0.00034966154,0.0016295307,0.0016952367,0.008839714,0.0029882053,0.004374932,0.001974061],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014819886,0.00008593934,0.0022152003,0.00084795465,0.00004359499,0.00015143027,0.00042431816,0.011747365,0.0031337128,0.5949741,0.05226804,0.3339602],"study_design_scores_gemma":[0.00001642709,0.00018960064,0.0007753565,0.0006781923,0.000036491452,0.0003907701,0.0012473777,0.04402348,0.0013022509,0.41932014,0.5319674,0.00005248489],"about_ca_topic_score_codex":0.00284359,"about_ca_topic_score_gemma":0.0040706675,"teacher_disagreement_score":0.0042614853,"about_ca_system_score_codex":0.0013278635,"about_ca_system_score_gemma":0.002634206,"threshold_uncertainty_score":0.01921326},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066111805,0.031754993,0.93565017,0.0009353948,0.00017135296,0.000039749764,0.000102686296,0.00027417374,0.024460325],"genre_scores_gemma":[0.43381986,0.13956311,0.40109646,0.00086727686,0.0008848227,0.00037773588,0.0007243778,0.0005821341,0.02208424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996718,0.000108017724,0.000020257507,0.00004461927,0.0001345096,0.000020698697],"domain_scores_gemma":[0.99939203,0.000405074,0.000047408514,0.000054287095,0.00008480757,0.000016307842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006180925,0.0008934912,0.0010723849,0.000557491,0.00023756188,0.0014448239,0.0011649778,0.001029723,0.0026107957],"category_scores_gemma":[0.00120353,0.0005375466,0.00081267126,0.0009003528,0.00057035894,0.0011450376,0.00079293834,0.00090515026,0.00089609285],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005025213,0.00009682528,0.0009483455,0.0019181493,0.000094377516,0.00014497651,0.00012784106,0.6727751,0.0053882883,0.108380295,0.006140434,0.20393504],"study_design_scores_gemma":[0.000009814605,0.0000581999,0.00022104512,0.00016662717,0.000022150483,0.00014322207,0.000053821648,0.9364802,0.0017921114,0.028174717,0.032851327,0.000026696705],"about_ca_topic_score_codex":0.00064313435,"about_ca_topic_score_gemma":0.00058584835,"teacher_disagreement_score":0.0026107957,"about_ca_system_score_codex":0.0004174833,"about_ca_system_score_gemma":0.00052064477,"threshold_uncertainty_score":0.008733988},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05459932,0.74156255,0.16836193,0.0073501416,0.0015959166,0.00027229806,0.0010934615,0.000685096,0.024479365],"genre_scores_gemma":[0.14401296,0.8027221,0.041566454,0.0015570234,0.0030354706,0.00013375298,0.0020647047,0.00013124755,0.004776311],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973794,0.00061653927,0.0003245642,0.00035687664,0.0011490581,0.0001735692],"domain_scores_gemma":[0.9914479,0.005035177,0.00052787823,0.00063735305,0.0021894046,0.0001623635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030851904,0.00081055757,0.0015896934,0.005031122,0.00065067323,0.0030157133,0.0011178486,0.00095814804,0.002226609],"category_scores_gemma":[0.008893999,0.00048458847,0.00077503093,0.0074451263,0.0006892288,0.007926658,0.0009868292,0.0013526117,0.0010962955],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010855727,0.00018444585,0.008187658,0.0022598142,0.00006080505,0.00007056348,0.000094690215,0.0048106518,0.0017578693,0.0142106125,0.011563265,0.95669097],"study_design_scores_gemma":[0.000052014067,0.0010930117,0.027624572,0.008273039,0.00051712437,0.005825105,0.0018186223,0.15753947,0.017935043,0.08118833,0.6978238,0.00030974406],"about_ca_topic_score_codex":0.0010528354,"about_ca_topic_score_gemma":0.00096363964,"teacher_disagreement_score":0.005031122,"about_ca_system_score_codex":0.00073445565,"about_ca_system_score_gemma":0.0014452945,"threshold_uncertainty_score":0.016316295},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15264641,0.0031135844,0.83679295,0.0018970777,0.00017016317,0.00015768858,0.0010682049,0.0019710849,0.002182917],"genre_scores_gemma":[0.91857177,0.00097048114,0.0766036,0.00023978157,0.00024419528,0.00017514844,0.001273873,0.000072962124,0.00184817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990683,0.00034081252,0.00007258857,0.00025418887,0.00014857734,0.000115502226],"domain_scores_gemma":[0.9933542,0.005159595,0.0006045957,0.00025578178,0.0004899979,0.00013583664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002870087,0.001816357,0.0011719173,0.0031624022,0.00065225275,0.0014506523,0.0020309803,0.001771355,0.0011689885],"category_scores_gemma":[0.008044329,0.00075229106,0.00088631525,0.0020027023,0.00078762317,0.0018313219,0.0009085264,0.0026543317,0.00047189445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024539719,0.00005385664,0.0030314303,0.000027327074,0.00004284336,0.000022749444,0.000019434297,0.97577614,0.00011292298,0.0007779115,0.0004157165,0.019695109],"study_design_scores_gemma":[0.000001504081,0.00000664619,0.00019029401,0.0000039243164,0.0000026080152,0.000002880336,0.0000061759774,0.9977549,0.00004629254,0.0019231152,0.000059448168,0.000002204567],"about_ca_topic_score_codex":0.015842484,"about_ca_topic_score_gemma":0.009778246,"teacher_disagreement_score":0.015842484,"about_ca_system_score_codex":0.0016964985,"about_ca_system_score_gemma":0.0009517999,"threshold_uncertainty_score":0.031500578},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023152463,0.37119588,0.13615859,0.092025466,0.0064049177,0.00023083917,0.00075830426,0.0018967825,0.36817673],"genre_scores_gemma":[0.33651042,0.49200243,0.10194334,0.0075479727,0.0053977584,0.00052277383,0.0010975848,0.00075529795,0.05422246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99858886,0.00040513798,0.00007357431,0.00020024211,0.0005415521,0.00019066189],"domain_scores_gemma":[0.9970493,0.0013383433,0.00016000039,0.00051393703,0.0005933323,0.0003451753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036574216,0.0005453871,0.0006153349,0.0016001094,0.0016017853,0.0064208307,0.0013403319,0.0027610194,0.0131595405],"category_scores_gemma":[0.0045497944,0.0006220559,0.00048408733,0.0015745508,0.0036718128,0.014306927,0.0028719353,0.0033694296,0.0040727113],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004028041,0.000053196258,0.00015324722,0.00067172636,0.000011719506,0.00004925267,0.00018411814,0.0014410168,0.0015157463,0.84919405,0.019282505,0.12740317],"study_design_scores_gemma":[0.000011355294,0.000107194915,0.00024889098,0.0008589204,0.000014168058,0.00014506045,0.00019144472,0.005662688,0.0033897662,0.28387186,0.7054583,0.0000403744],"about_ca_topic_score_codex":0.001177487,"about_ca_topic_score_gemma":0.00064123975,"teacher_disagreement_score":0.0131595405,"about_ca_system_score_codex":0.0028773355,"about_ca_system_score_gemma":0.002807948,"threshold_uncertainty_score":0.044023037},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13606565,0.00020160608,0.83459836,0.00015111122,0.000035741356,0.0009593523,0.001709689,0.00055247894,0.025726082],"genre_scores_gemma":[0.6973454,0.00015682998,0.29620737,0.000049783055,0.000020325455,0.0012073378,0.0007643454,0.00017562415,0.004072955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9883553,0.005938464,0.0006883118,0.0009459094,0.003596125,0.00047593442],"domain_scores_gemma":[0.9552046,0.033344373,0.0030415016,0.0035451062,0.004313034,0.00055143377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01679003,0.0014296984,0.0012943144,0.010174387,0.0011086193,0.00501235,0.0017532678,0.0011325668,0.006111762],"category_scores_gemma":[0.046185475,0.0004520152,0.0011990663,0.008891457,0.0020501122,0.0061916406,0.002107325,0.0012475395,0.00068590336],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008523796,0.0011087771,0.06986739,0.00067711994,0.00094355043,0.00018670472,0.0017654923,0.32849964,0.0062200734,0.2594346,0.0030504211,0.3273938],"study_design_scores_gemma":[0.00011268384,0.0014050202,0.020357706,0.00022913085,0.00045993133,0.00017222196,0.0023882634,0.8457397,0.023596724,0.0937723,0.011594575,0.00017168606],"about_ca_topic_score_codex":0.00712095,"about_ca_topic_score_gemma":0.006494272,"teacher_disagreement_score":0.01679003,"about_ca_system_score_codex":0.0031686618,"about_ca_system_score_gemma":0.0024692111,"threshold_uncertainty_score":0.088795245},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28410086,0.0072890194,0.69243413,0.000687782,0.00015939299,0.00010752432,0.0001618282,0.00036455927,0.01469499],"genre_scores_gemma":[0.9782752,0.00092375936,0.019678436,0.00006501266,0.000053613177,0.000018885421,0.000036826365,0.000024454752,0.0009238986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988022,0.00047104692,0.000033168486,0.000110730354,0.00033182235,0.00025103317],"domain_scores_gemma":[0.9972053,0.0019231093,0.00021225234,0.00013198453,0.0004497541,0.000077641234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001888812,0.0008610459,0.0011276846,0.00094060414,0.0006604496,0.0012698445,0.0011392626,0.00069789804,0.0011131358],"category_scores_gemma":[0.004283833,0.0003569337,0.0004995812,0.0018374546,0.0007065554,0.0013335992,0.0007010317,0.0003762833,0.00016008661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018702672,0.000063271254,0.0007691319,0.000087097265,0.000059564496,0.000058512327,0.000046086425,0.96339434,0.002288121,0.00960651,0.00051604165,0.022924239],"study_design_scores_gemma":[0.0000072942057,0.00006682554,0.0006266571,0.0000071620243,0.00003128175,0.000048272697,0.00004375585,0.9960824,0.0006239762,0.002276,0.0001781671,0.000008178774],"about_ca_topic_score_codex":0.005144849,"about_ca_topic_score_gemma":0.009396073,"teacher_disagreement_score":0.005144849,"about_ca_system_score_codex":0.0016824547,"about_ca_system_score_gemma":0.001863323,"threshold_uncertainty_score":0.01220715},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03747101,0.0000973312,0.96077543,0.00009133006,0.000022873313,0.000041275085,0.000082847066,0.0006788395,0.00073904725],"genre_scores_gemma":[0.8207649,0.00014685157,0.1770687,0.00010747221,0.00005408785,0.000048029902,0.0003364625,0.00009232569,0.001381156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922466,0.00017588842,0.00003544023,0.0002182001,0.0002172021,0.0001285501],"domain_scores_gemma":[0.999164,0.00023648638,0.00007132766,0.0003104058,0.00016232589,0.00005545243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088716694,0.00059655134,0.0011612822,0.0009259916,0.00056246266,0.00091287546,0.0016575499,0.0008245728,0.0013598036],"category_scores_gemma":[0.0023742805,0.0002817293,0.0008021711,0.0010641143,0.0007869476,0.0020994653,0.0020037184,0.0011817006,0.00051614805],"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.0012472265,0.00041637322,0.0032056014,0.00014438039,0.00011119759,0.00030024952,0.00021938355,0.12217309,0.07176729,0.0482938,0.00366467,0.74845666],"study_design_scores_gemma":[0.000014217582,0.000085504566,0.00035193187,0.0000041611293,0.000032234126,0.00011341047,0.000021190946,0.9760833,0.00996101,0.012487865,0.00083257677,0.000012578999],"about_ca_topic_score_codex":0.0018109366,"about_ca_topic_score_gemma":0.0024278932,"teacher_disagreement_score":0.0018109366,"about_ca_system_score_codex":0.0004731446,"about_ca_system_score_gemma":0.0008358239,"threshold_uncertainty_score":0.004691839},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026431846,0.00028541288,0.9715336,0.0001956631,0.000050041264,0.000077496414,0.00013968191,0.0004250584,0.0008611341],"genre_scores_gemma":[0.70771,0.00016182485,0.28954396,0.000077938275,0.00005800559,0.000117569194,0.00031189047,0.00006321477,0.001955503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960658,0.0018976745,0.00021553892,0.00042169375,0.0011475403,0.00025180055],"domain_scores_gemma":[0.9946253,0.0026187117,0.00033735062,0.00060356787,0.001569614,0.00024551936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006235764,0.0007776186,0.0012618804,0.0013528257,0.0008568076,0.001741267,0.0012608718,0.0012611347,0.0025959415],"category_scores_gemma":[0.015094192,0.0002658161,0.0009974812,0.0010071608,0.0007100063,0.0030179066,0.0020376872,0.0014812632,0.0003698494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011940282,0.000392008,0.005729199,0.00031266137,0.00034924346,0.00017538178,0.00036641353,0.50837296,0.0050192093,0.058180913,0.005915281,0.41399273],"study_design_scores_gemma":[0.000012298254,0.000091604605,0.0004156617,0.00001899867,0.000022573038,0.000037114212,0.000034992358,0.9828051,0.0010544858,0.014772911,0.0007215069,0.000012795859],"about_ca_topic_score_codex":0.00621597,"about_ca_topic_score_gemma":0.00626706,"teacher_disagreement_score":0.006235764,"about_ca_system_score_codex":0.0019365842,"about_ca_system_score_gemma":0.0018877309,"threshold_uncertainty_score":0.032978237},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3025991,0.0017253461,0.6675542,0.0012548234,0.00065141113,0.000101210986,0.0003327682,0.0016157291,0.024165325],"genre_scores_gemma":[0.9499853,0.00093953504,0.04114166,0.00010861531,0.00016774863,0.00003649827,0.00011700718,0.00007042831,0.0074331495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995602,0.00005821614,0.000012995725,0.0000629631,0.00021747737,0.00008814056],"domain_scores_gemma":[0.997572,0.0012060166,0.00030944662,0.00045111234,0.00040056717,0.00006095551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033755516,0.00087983924,0.0004984725,0.0009379333,0.0005387312,0.00083827495,0.0005003485,0.0012337286,0.002106522],"category_scores_gemma":[0.0033707044,0.00026573223,0.00029828446,0.0006915745,0.0008707888,0.0014097308,0.00084878656,0.00086476235,0.0004144176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010385246,0.00017914968,0.0033530253,0.0004896374,0.00018080778,0.002284961,0.00048160815,0.3325955,0.17700475,0.31816912,0.005986427,0.15823649],"study_design_scores_gemma":[0.000045209614,0.00014125547,0.0007792703,0.00006922848,0.000060818726,0.0009411276,0.00003410447,0.8511321,0.108626105,0.03269278,0.0054268227,0.0000512529],"about_ca_topic_score_codex":0.0013376507,"about_ca_topic_score_gemma":0.0014662665,"teacher_disagreement_score":0.002106522,"about_ca_system_score_codex":0.00052219495,"about_ca_system_score_gemma":0.0006636885,"threshold_uncertainty_score":0.0070469975},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030290991,0.0004610476,0.8737287,0.0020151017,0.0042443248,0.00029536156,0.0036643802,0.046619758,0.03868039],"genre_scores_gemma":[0.38018635,0.000331499,0.5082702,0.0007596795,0.000708423,0.00023112298,0.0065139746,0.0051312046,0.097867556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997645,0.000030154484,0.000014557497,0.00008150148,0.000062986066,0.000046364243],"domain_scores_gemma":[0.9996393,0.00006888953,0.00001677893,0.000086446315,0.00014543276,0.00004320999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005722598,0.0010851403,0.000528661,0.00051758834,0.0004426383,0.0010221121,0.001656526,0.000646385,0.031145854],"category_scores_gemma":[0.0019225029,0.00044728775,0.0005461518,0.0005161434,0.0002380607,0.0010832007,0.0009540107,0.0011472031,0.005163034],"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.00091998745,0.00026727904,0.002058698,0.00032480538,0.00015035321,0.0004255137,0.00007095662,0.16598858,0.015254229,0.020330328,0.2569788,0.53723055],"study_design_scores_gemma":[0.00005687563,0.000033692042,0.00029069476,0.00001153827,0.000019627296,0.00005005514,0.000012115897,0.95838493,0.010532646,0.0058525917,0.024742374,0.000012941439],"about_ca_topic_score_codex":0.008548763,"about_ca_topic_score_gemma":0.019140922,"teacher_disagreement_score":0.031145854,"about_ca_system_score_codex":0.0008164035,"about_ca_system_score_gemma":0.0015008913,"threshold_uncertainty_score":0.10419321},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023750832,0.00037377037,0.95314866,0.0009955519,0.00014561137,0.00013399607,0.00012443117,0.002617253,0.018709902],"genre_scores_gemma":[0.69391334,0.0003934427,0.29729137,0.00036327532,0.00010997415,0.00021941376,0.0004109038,0.00063457264,0.0066637723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978701,0.0008510959,0.00013842588,0.00038748296,0.00047543916,0.00027735002],"domain_scores_gemma":[0.99535465,0.0016227608,0.00035421323,0.0017627607,0.00053738017,0.00036823816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038277714,0.0008298806,0.0009536967,0.0015890964,0.0014803656,0.0061607794,0.0030376979,0.002133591,0.008103287],"category_scores_gemma":[0.009137166,0.000615461,0.0012430724,0.0011552932,0.003270516,0.009476846,0.008088188,0.0028600106,0.0016439],"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.00033313315,0.00025469429,0.004499308,0.00031815263,0.00019337038,0.00031011147,0.0027359647,0.0655663,0.007938921,0.7876334,0.003465656,0.12675093],"study_design_scores_gemma":[0.000026026988,0.00010907258,0.00048406134,0.00009463105,0.00007006456,0.00010491248,0.0006019391,0.45338538,0.005320876,0.52561486,0.014157146,0.00003102053],"about_ca_topic_score_codex":0.0023720902,"about_ca_topic_score_gemma":0.0025320998,"teacher_disagreement_score":0.008103287,"about_ca_system_score_codex":0.0012216851,"about_ca_system_score_gemma":0.0024436226,"threshold_uncertainty_score":0.027108192},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3651231,0.06799599,0.48708194,0.001386571,0.0010613546,0.0003085668,0.0026565124,0.0033006943,0.07108529],"genre_scores_gemma":[0.93421125,0.013822291,0.044917632,0.00015122583,0.00021378596,0.00010699573,0.0017811606,0.00012396036,0.00467161],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980013,0.00059522624,0.000108732966,0.0003141106,0.0007882395,0.0001924123],"domain_scores_gemma":[0.99570113,0.001966704,0.0004288225,0.0002875183,0.0015360971,0.00007976249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001096235,0.0006414794,0.00051729736,0.0028241207,0.0003178977,0.0011843832,0.00068933197,0.0005975637,0.0024097015],"category_scores_gemma":[0.0046981825,0.00016924914,0.000576888,0.0032455516,0.00025023066,0.0014624204,0.00072001177,0.0002531718,0.0010322005],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005982596,0.0000796404,0.027801972,0.0027973598,0.00036108878,0.00052452495,0.00041629473,0.04280369,0.011486076,0.008185085,0.009156567,0.8957894],"study_design_scores_gemma":[0.00013391512,0.0033563082,0.19644657,0.002618309,0.0019484219,0.008077394,0.005756257,0.46272203,0.08617907,0.011240097,0.22107063,0.00045106406],"about_ca_topic_score_codex":0.0020812529,"about_ca_topic_score_gemma":0.0017513076,"teacher_disagreement_score":0.0028241207,"about_ca_system_score_codex":0.00058899936,"about_ca_system_score_gemma":0.0003854669,"threshold_uncertainty_score":0.00806123},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061464507,0.002231801,0.9223295,0.0012431585,0.00079693855,0.000084153246,0.002418331,0.0055676783,0.003863911],"genre_scores_gemma":[0.8415017,0.0011109712,0.14326334,0.00064302614,0.0003263416,0.00018161202,0.0027445792,0.00031929716,0.009909158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984384,0.000030733845,0.000009098017,0.00006193505,0.00002219925,0.000032210697],"domain_scores_gemma":[0.99958616,0.00021183991,0.000031002368,0.00002995908,0.00011435614,0.000026708642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049596716,0.00089458027,0.0009342778,0.00070400233,0.00033694942,0.00069107575,0.0017922915,0.00146345,0.0032491246],"category_scores_gemma":[0.0016469816,0.00041127292,0.00068618124,0.0011506721,0.00031426112,0.0011493821,0.0006454238,0.0022061877,0.0011151258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013735265,0.00011233833,0.0014351202,0.000086710046,0.00012000385,0.000079712474,0.00004484417,0.81285846,0.0016392597,0.0029483119,0.008465696,0.17207223],"study_design_scores_gemma":[0.0000018820244,0.0000056171707,0.00007742412,0.0000033217977,0.000004605565,0.0000035883097,0.0000019446422,0.9988269,0.00011976563,0.00079423207,0.00015841977,0.0000022548502],"about_ca_topic_score_codex":0.04194867,"about_ca_topic_score_gemma":0.042569675,"teacher_disagreement_score":0.04194867,"about_ca_system_score_codex":0.0009489345,"about_ca_system_score_gemma":0.0009621433,"threshold_uncertainty_score":0.08340901},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19226229,0.003773494,0.7779375,0.0009170071,0.0011335622,0.00037252603,0.0012751359,0.01705253,0.005275927],"genre_scores_gemma":[0.77109903,0.0005299668,0.20888972,0.0010492877,0.0004914117,0.00048618802,0.005199232,0.0005511119,0.011704075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984364,0.00029830833,0.000100523685,0.00047041278,0.00024689437,0.00044746933],"domain_scores_gemma":[0.99542,0.0019562817,0.0002010575,0.00064418337,0.0014227048,0.00035591744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029150043,0.0021756452,0.0021161302,0.0013508442,0.0011598831,0.0011165551,0.0022878763,0.0030711752,0.0044616736],"category_scores_gemma":[0.0054482645,0.0007446748,0.0014702666,0.0015346549,0.0006446427,0.0015664308,0.001777777,0.0046976698,0.0039307517],"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.0015535178,0.0018638337,0.0052013807,0.00026845874,0.000160683,0.00024258063,0.0001576829,0.047011245,0.03742642,0.0007693346,0.019212028,0.8861329],"study_design_scores_gemma":[0.00004047736,0.00032052965,0.0035107026,0.00002827104,0.00005871571,0.000104201965,0.00007216132,0.97605973,0.016210807,0.0011104296,0.0024502215,0.000033639964],"about_ca_topic_score_codex":0.011684142,"about_ca_topic_score_gemma":0.014169655,"teacher_disagreement_score":0.011684142,"about_ca_system_score_codex":0.00069778203,"about_ca_system_score_gemma":0.002250622,"threshold_uncertainty_score":0.023232281},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07337407,0.0009748656,0.91487414,0.0005927535,0.000075755066,0.000118233154,0.00015277977,0.00017451694,0.00966288],"genre_scores_gemma":[0.9040547,0.00070085836,0.090671934,0.00013811528,0.00003443389,0.00018964015,0.0001267335,0.00009045323,0.003993026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950707,0.00018408392,0.0000128516995,0.00006197279,0.000094907606,0.00013901311],"domain_scores_gemma":[0.9993837,0.00041124303,0.00006731983,0.000019441302,0.00007239071,0.000045864897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007160287,0.0010212829,0.0011458418,0.00049595843,0.0006048474,0.0012934481,0.0009204666,0.0008645246,0.0025803274],"category_scores_gemma":[0.0020148063,0.00047468816,0.0004145038,0.0009012377,0.00064874964,0.0012160984,0.00081635296,0.0008848723,0.00021116193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030255393,0.00002271975,0.00013151759,0.00003435239,0.000006760465,0.000027511594,0.000011679321,0.98990345,0.0006542671,0.003936955,0.0004762294,0.004764329],"study_design_scores_gemma":[0.0000033708611,0.000011816558,0.000036679183,0.0000031803831,0.0000023301623,0.000005022448,0.000009884446,0.99843293,0.00017416563,0.001189961,0.00012914494,0.000001602481],"about_ca_topic_score_codex":0.008307556,"about_ca_topic_score_gemma":0.00709228,"teacher_disagreement_score":0.008307556,"about_ca_system_score_codex":0.0016481127,"about_ca_system_score_gemma":0.0016300606,"threshold_uncertainty_score":0.016518354},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00670313,0.00018269863,0.98252225,0.00037499482,0.000084721956,0.00028684695,0.00007590735,0.002578301,0.0071911546],"genre_scores_gemma":[0.3927405,0.0007326065,0.583811,0.00047785073,0.00011798907,0.0008150548,0.0005028351,0.00054151163,0.020260654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806994,0.0004944487,0.00014700856,0.0002481533,0.00081451103,0.00022587634],"domain_scores_gemma":[0.99901724,0.00019894446,0.0001768283,0.0002665316,0.00017605041,0.00016439024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032723306,0.0007167008,0.0007876682,0.0011391785,0.0012756906,0.0030242184,0.003055929,0.0014144618,0.0030987496],"category_scores_gemma":[0.0026395419,0.0005569655,0.0010671538,0.00062262174,0.0028698142,0.0055980124,0.004947657,0.0023435804,0.0010360838],"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.00027577713,0.0001831736,0.00092217186,0.00022348603,0.00007285663,0.00050251663,0.00055486825,0.08106975,0.008103861,0.8152409,0.0069859507,0.085864626],"study_design_scores_gemma":[0.00012052652,0.00016501713,0.00031461395,0.00009570398,0.00004463716,0.00036205802,0.00014615776,0.72976834,0.007109001,0.18980633,0.07197411,0.00009347507],"about_ca_topic_score_codex":0.0026402473,"about_ca_topic_score_gemma":0.0026689807,"teacher_disagreement_score":0.0032723306,"about_ca_system_score_codex":0.0016648942,"about_ca_system_score_gemma":0.003048145,"threshold_uncertainty_score":0.01730591},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007391653,0.00013139745,0.9830382,0.00009606781,0.00005626714,0.000086445405,0.00016684238,0.0020563733,0.0069767823],"genre_scores_gemma":[0.13818896,0.00029158263,0.8403365,0.00020702505,0.00006970966,0.00017429102,0.0011330588,0.00087350025,0.018725306],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994609,0.000109243774,0.000037642832,0.00007082035,0.0002176072,0.00010382147],"domain_scores_gemma":[0.9994092,0.00010508615,0.000046912708,0.0001977813,0.00017933127,0.00006167017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009424328,0.0009924528,0.00049726985,0.0015361711,0.0009292548,0.0014882081,0.0010144748,0.00046106454,0.010970385],"category_scores_gemma":[0.0017587034,0.00044220668,0.0009250204,0.0008757848,0.00040069222,0.0016156106,0.0018022482,0.0015740365,0.002941474],"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.00044456584,0.00024713014,0.0019433122,0.0002716548,0.00011450577,0.00032274667,0.00078601006,0.041110024,0.040955763,0.16873743,0.028492184,0.71657467],"study_design_scores_gemma":[0.000064470485,0.00016332662,0.0015620886,0.00014463853,0.000111077294,0.00034930912,0.00032365776,0.7985704,0.023114963,0.10487255,0.07067072,0.000052818017],"about_ca_topic_score_codex":0.0039443728,"about_ca_topic_score_gemma":0.00844312,"teacher_disagreement_score":0.010970385,"about_ca_system_score_codex":0.00077729154,"about_ca_system_score_gemma":0.0010052357,"threshold_uncertainty_score":0.036699593},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020207688,0.00050295674,0.97358286,0.00021250242,0.000054051055,0.000033296903,0.00006701637,0.000105916995,0.005233742],"genre_scores_gemma":[0.8711054,0.0005962696,0.12016441,0.00010116992,0.000050779916,0.00011713308,0.0001533172,0.00006409732,0.007647449],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998375,0.00004715678,0.0000065717013,0.000030439855,0.00004226276,0.000035986555],"domain_scores_gemma":[0.99977034,0.00013015147,0.000021277912,0.00001173755,0.00005354125,0.000012914952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038879577,0.0006681816,0.0007778284,0.00031266472,0.00032030256,0.00071526447,0.00053977617,0.00063991005,0.0031909675],"category_scores_gemma":[0.00094596687,0.0003183945,0.00044620433,0.0005272907,0.00037800762,0.0006661126,0.0006421026,0.0006779055,0.00028501588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049411225,0.000013014269,0.000221979,0.000034354245,0.000017144239,0.000039636903,0.000021883441,0.9795982,0.0009508735,0.0056281006,0.00068149983,0.012743852],"study_design_scores_gemma":[0.00000188185,0.0000067823626,0.000032953954,0.0000019194201,0.0000021745068,0.0000068132213,0.0000053882163,0.9989735,0.000094555275,0.00076433516,0.00010839234,0.0000013558348],"about_ca_topic_score_codex":0.0063242363,"about_ca_topic_score_gemma":0.0059528914,"teacher_disagreement_score":0.0063242363,"about_ca_system_score_codex":0.00061432674,"about_ca_system_score_gemma":0.00092672074,"threshold_uncertainty_score":0.0125748515},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25937295,0.00026350125,0.73439914,0.00063688663,0.00012175793,0.000052526888,0.00005788481,0.00044695867,0.0046483823],"genre_scores_gemma":[0.9878236,0.000032646116,0.010594241,0.000048008653,0.000017037752,0.000009870544,0.000024032695,0.000009195904,0.0014414015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844354,0.00055682805,0.00005037764,0.0002309962,0.0003595738,0.00035875072],"domain_scores_gemma":[0.996503,0.0019144508,0.0003249272,0.00053857645,0.0005484357,0.00017060651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024096235,0.0005931366,0.00091854576,0.00080555765,0.0006491681,0.0010380885,0.0012061357,0.0014337854,0.0010570977],"category_scores_gemma":[0.0056885523,0.00021068107,0.00060547463,0.0005156143,0.0012168695,0.0014985407,0.0018352912,0.0011478034,0.00019333167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007909756,0.00014943072,0.0022416008,0.000041459454,0.00008335049,0.0001414613,0.000091901595,0.88069606,0.009784092,0.040304966,0.0014040885,0.064270526],"study_design_scores_gemma":[0.0000030909314,0.000030030664,0.00010749451,0.000001601714,0.0000035488908,0.000021137615,0.0000058503447,0.995363,0.0010586894,0.0033373975,0.00006537991,0.0000027327262],"about_ca_topic_score_codex":0.0014137734,"about_ca_topic_score_gemma":0.0008941111,"teacher_disagreement_score":0.0024096235,"about_ca_system_score_codex":0.0010857288,"about_ca_system_score_gemma":0.000956493,"threshold_uncertainty_score":0.012743473},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043748606,0.00055931654,0.94947773,0.00026008877,0.0002108174,0.0000874276,0.000055863875,0.0005317791,0.005068381],"genre_scores_gemma":[0.90046656,0.00038310298,0.09533483,0.00013854363,0.00021507291,0.000070130125,0.000055055843,0.00006410144,0.0032725765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891806,0.00028125825,0.000049592643,0.0001553829,0.00032978045,0.0002660876],"domain_scores_gemma":[0.99775606,0.0008687494,0.00027130585,0.00056280574,0.00037270595,0.0001683754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010966419,0.0007296796,0.00090907206,0.0005041033,0.0012690502,0.0012735218,0.0009848047,0.0005256908,0.0020653857],"category_scores_gemma":[0.0031351354,0.00036507542,0.00032114587,0.0006808878,0.0006803624,0.0010910732,0.0014040212,0.0009819944,0.00063410547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017723322,0.00046358598,0.002056158,0.00023654793,0.0001566035,0.00070287235,0.0005722929,0.43833116,0.11667175,0.17727315,0.010072104,0.25169137],"study_design_scores_gemma":[0.000036138415,0.00018843178,0.00020021076,0.0000098264045,0.000031200954,0.00021426183,0.00005531115,0.971837,0.009510904,0.01527426,0.002622611,0.000019817595],"about_ca_topic_score_codex":0.0012249337,"about_ca_topic_score_gemma":0.0025297694,"teacher_disagreement_score":0.0020653857,"about_ca_system_score_codex":0.0008365047,"about_ca_system_score_gemma":0.002098176,"threshold_uncertainty_score":0.00690943},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059077963,0.00057286513,0.93372244,0.00041488063,0.00017059725,0.000041528143,0.00006811429,0.0005479446,0.0053836284],"genre_scores_gemma":[0.9557591,0.00018499285,0.03863096,0.00016643284,0.000036076173,0.000028013905,0.00004937235,0.000046764108,0.0050982074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996997,0.00006770527,0.000009513166,0.000054603035,0.00008102811,0.000087386135],"domain_scores_gemma":[0.99940443,0.00032753454,0.000045920424,0.000054639302,0.000119851786,0.00004773225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007917197,0.00062377605,0.0008236811,0.00020699267,0.00033731246,0.0007716652,0.00073359703,0.00067665684,0.0023555828],"category_scores_gemma":[0.0015864968,0.00032038655,0.00031206672,0.00017452386,0.0007394905,0.001081489,0.0013334322,0.0011126216,0.00030673546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005417697,0.000096651886,0.0010307007,0.0000840662,0.000047031295,0.00011364896,0.000070176735,0.8921705,0.0074793785,0.02378807,0.0021378116,0.07244015],"study_design_scores_gemma":[0.0000035387452,0.000028118584,0.000053968146,0.0000031646925,0.0000030901447,0.000009341766,0.0000051561456,0.99738985,0.0007347186,0.001637631,0.00012859191,0.0000029296073],"about_ca_topic_score_codex":0.0029899122,"about_ca_topic_score_gemma":0.0049320282,"teacher_disagreement_score":0.0029899122,"about_ca_system_score_codex":0.0006400226,"about_ca_system_score_gemma":0.0015480968,"threshold_uncertainty_score":0.007880211},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14709644,0.0011708196,0.8095485,0.0046747066,0.00042085457,0.00047432462,0.00044540042,0.00026712535,0.03590188],"genre_scores_gemma":[0.96546745,0.00043443937,0.020196842,0.00037233953,0.00011631351,0.00024244058,0.00011480032,0.00005831512,0.012997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985123,0.0007079556,0.000041783343,0.0002296362,0.00020445391,0.00030381206],"domain_scores_gemma":[0.98959523,0.00837572,0.00060116925,0.000166187,0.0006100886,0.00065158296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031194063,0.001912571,0.0031312169,0.001361706,0.0010524412,0.003103483,0.002618885,0.0039647906,0.006842595],"category_scores_gemma":[0.014909207,0.0011661462,0.0009696073,0.00095795497,0.0027750453,0.0032266774,0.0027523781,0.0028743711,0.00035546575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016485422,0.000087281885,0.00031472236,0.000084349194,0.000053182743,0.0001056918,0.00008891446,0.8984974,0.0004297542,0.09342714,0.0023166824,0.0044300365],"study_design_scores_gemma":[0.000022461047,0.00002077426,0.00005687717,0.000009470212,0.000009159886,0.000008668784,0.000019741514,0.9761969,0.00003683613,0.023435045,0.00017724224,0.000006807166],"about_ca_topic_score_codex":0.009955167,"about_ca_topic_score_gemma":0.0072335135,"teacher_disagreement_score":0.009955167,"about_ca_system_score_codex":0.0039407583,"about_ca_system_score_gemma":0.0030874792,"threshold_uncertainty_score":0.028592348},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31345603,0.0014491464,0.5571472,0.0015000588,0.00042988348,0.00082424324,0.029293349,0.08868484,0.007215337],"genre_scores_gemma":[0.5994861,0.0004857766,0.32400247,0.0004542375,0.000092279064,0.0005471508,0.0707174,0.0011032667,0.0031113739],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986211,0.00020290508,0.0001367872,0.0004466767,0.00045654428,0.00013603785],"domain_scores_gemma":[0.9968454,0.0008805791,0.00037822072,0.0010634729,0.00068163796,0.00015061002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018403209,0.0013657875,0.00055405096,0.0020882823,0.0003839023,0.0013390426,0.001528751,0.00071143574,0.001135675],"category_scores_gemma":[0.0076294085,0.00036040632,0.00065989944,0.0011280768,0.0004404112,0.0021006765,0.001216494,0.0017035974,0.0012986227],"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.0012057276,0.001175976,0.15081094,0.000932758,0.00027800453,0.00045151016,0.00047459995,0.16310279,0.049920734,0.0073881717,0.08201455,0.5422442],"study_design_scores_gemma":[0.00003514306,0.00015985913,0.01648856,0.00006401855,0.000027428445,0.00011520286,0.00008665106,0.94058853,0.02431644,0.0061773066,0.011899163,0.00004169268],"about_ca_topic_score_codex":0.0045897444,"about_ca_topic_score_gemma":0.008072206,"teacher_disagreement_score":0.0045897444,"about_ca_system_score_codex":0.0006834574,"about_ca_system_score_gemma":0.0010879677,"threshold_uncertainty_score":0.009732664},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7690649,0.0034891425,0.19383432,0.00085114554,0.00046688304,0.0003577382,0.0048581343,0.018883334,0.008194346],"genre_scores_gemma":[0.9560624,0.0005347648,0.03210026,0.00021452214,0.00008003732,0.00008113484,0.00729417,0.00015207588,0.0034806086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963367,0.000048429512,0.000017134984,0.00011479187,0.00010726364,0.00007865519],"domain_scores_gemma":[0.9995073,0.00013198754,0.00009840685,0.00010084498,0.00011086856,0.00005057653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005022998,0.0016057831,0.000670889,0.0014442372,0.00029651236,0.0006723672,0.0011811446,0.0007151319,0.000829549],"category_scores_gemma":[0.0014096744,0.00024194247,0.00052903907,0.00060675194,0.00028117598,0.0013387027,0.0008659071,0.0009824113,0.00057281106],"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.0008778767,0.00083723536,0.08555764,0.0003935646,0.0004749351,0.00066390185,0.0002921561,0.35375535,0.021773696,0.0028175872,0.029636366,0.5029196],"study_design_scores_gemma":[0.000012290709,0.0001510079,0.0070955926,0.0000208455,0.000049140708,0.00014607588,0.00006837493,0.98252994,0.006309422,0.0010967108,0.0024985322,0.000022079728],"about_ca_topic_score_codex":0.012061789,"about_ca_topic_score_gemma":0.021798197,"teacher_disagreement_score":0.012061789,"about_ca_system_score_codex":0.000708962,"about_ca_system_score_gemma":0.0006902605,"threshold_uncertainty_score":0.02398312},"labels":[],"label_agreement":null}]}