{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":99,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":99,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"f1b03580179b","filters":{"venue":"Cluster Computing"}},"results":[{"id":"W3005560537","doi":"10.1007/s10586-020-03058-6","title":"A decentralized lightweight blockchain-based authentication mechanism for IoT systems","year":2020,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":296,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Blockchain; Internet of Things; Authentication (law); Computer security; Access control; Confidentiality; Smart objects; Mechanism (biology); The Internet; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.01976899737891828,"gpt":0.2450762067288921,"spread":0.2253072093499739,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003029425,0.0001872106,0.0002547131,0.00008997995,0.0003462505,0.0001381657,0.001046689,0.0001611395,0.000001991941],"category_scores_gemma":[0.00008704821,0.0001844543,0.0001070715,0.0004602102,0.00004027168,0.00001444317,0.0002448651,0.0001636325,0.00002576885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004612339,"about_ca_system_score_gemma":0.00007762839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006539922,"about_ca_topic_score_gemma":0.000001100993,"domain_scores_codex":[0.9983597,0.00007132944,0.0004012426,0.0005980024,0.0001761475,0.0003936155],"domain_scores_gemma":[0.9986587,0.0002216089,0.0002089797,0.0005593824,0.0002037828,0.0001475043],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001240978,0.0000832045,0.00004919902,0.0001190221,0.00003126636,0.000002195873,0.001405734,0.004243146,0.001890008,0.9867126,0.0007143124,0.00473692],"study_design_scores_gemma":[0.0008594804,0.00006650617,0.0000143541,0.00002949141,0.00001566429,0.000005588513,0.00003559895,0.9808993,0.004943315,0.01050693,0.002416347,0.0002074761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06674533,0.0001380611,0.9110706,0.02004521,0.0002677003,0.0008958818,0.000004176242,0.0007955285,0.00003743426],"genre_scores_gemma":[0.870456,4.945069e-7,0.1267887,0.002526072,0.0001172468,0.00008114544,0.000004087817,0.00001608934,0.00001024531],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9766561,"threshold_uncertainty_score":0.752183,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1599674946","doi":"10.1023/a:1013985610753","title":"Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks","year":2002,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":140,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Greedy algorithm; Node (physics); Hop (telecommunications); Packet forwarding; Computer network; Algorithm; Network packet; Geographic routing; Communication source; Routing protocol; Static routing","retraction":null,"screen_n_in":null,"score":{"opus":0.01072992971202405,"gpt":0.2009819713228837,"spread":0.1902520416108597,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004687774,0.0002684386,0.0003190484,0.0001375107,0.0001649495,0.0003189252,0.0007367602,0.0001028387,0.000008655714],"category_scores_gemma":[0.0000112448,0.0002477732,0.0000481476,0.0004842664,0.00007980908,0.0003000111,0.0006234138,0.000488687,0.000006312552],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007789599,"about_ca_system_score_gemma":0.00001766092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007063863,"about_ca_topic_score_gemma":0.00008093825,"domain_scores_codex":[0.9978639,0.0001467689,0.0004358233,0.000665009,0.0002501615,0.0006383226],"domain_scores_gemma":[0.9988164,0.000369314,0.0001656177,0.0004784221,0.00005529714,0.000114916],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004919665,0.0001213997,0.1543256,0.00004423229,0.00003669766,0.0003434867,0.001926365,0.5959694,0.00004461144,0.0009646541,0.0004218466,0.2457525],"study_design_scores_gemma":[0.001132811,0.00006671262,0.005226509,0.0004777249,0.000005985314,0.0001036631,0.00003191039,0.9925586,0.00002357667,0.00001227771,0.00005639785,0.000303861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3288075,0.0001665447,0.6696445,0.0001241958,0.0001901048,0.0001712544,1.839476e-7,0.0001331332,0.0007625906],"genre_scores_gemma":[0.9738443,0.000005513596,0.02427161,0.001620899,0.0002004338,0.000005519287,0.000001078337,0.00002612232,0.00002450522],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6453729,"threshold_uncertainty_score":0.9999974,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2588845958","doi":"10.1007/s10586-017-0767-x","title":"Towards product customization and personalization in IoT-enabled cloud manufacturing","year":2017,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Digital Transformation in Industry","field":"Engineering","cited_by":130,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Computer science; Cloud computing; Personalization; Product (mathematics); Production (economics); Internet of Things; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.0159458025311729,"gpt":0.2331499591818148,"spread":0.2172041566506419,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001811265,0.0001152724,0.0001165664,0.00008442024,0.00018877,0.0003112249,0.0001363849,0.00006054252,0.000008520309],"category_scores_gemma":[0.00003803125,0.000126041,0.00001703003,0.00003958849,0.00003238596,0.0004233132,0.00006054787,0.0001470289,0.000009157546],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006901661,"about_ca_system_score_gemma":0.000009307297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000102568,"about_ca_topic_score_gemma":0.000005516939,"domain_scores_codex":[0.9993409,0.00001331976,0.0002139844,0.0001461325,0.0001016782,0.0001839861],"domain_scores_gemma":[0.9996864,0.0000170214,0.00005156417,0.0001852697,0.0000216155,0.0000381648],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001584568,0.00002533669,0.02172133,0.001047891,0.00003149589,0.000009253115,0.005823578,0.8001165,0.0002263907,0.0002856261,0.001303487,0.1693933],"study_design_scores_gemma":[0.0008803007,0.000007389741,0.04974779,0.0002897926,0.000007324079,0.00001759035,0.0002587299,0.9418684,0.004810507,0.0001201742,0.001707893,0.0002841411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9288973,0.00004880162,0.03647697,0.0001682499,0.0006750042,0.0002206081,0.000001653943,0.0001893521,0.03332206],"genre_scores_gemma":[0.9987132,0.000005977544,0.000887545,0.00002932528,0.0002340526,0.000002981387,0.000007759795,0.00002259966,0.00009657435],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1691092,"threshold_uncertainty_score":0.5139802,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2180880586","doi":"10.1007/s10586-015-0477-1","title":"A distributed frequent itemset mining algorithm using Spark for Big Data analytics","year":2015,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"National Natural Science Foundation of China","keywords":"Computer science; SPARK (programming language); Pruning; Scalability; Data mining; Association rule learning; Big data; Benchmark (surveying); GSP Algorithm; Computation; Process (computing); Algorithm; Apriori algorithm; Database","retraction":null,"screen_n_in":null,"score":{"opus":0.256721916407233,"gpt":0.3448207135320219,"spread":0.08809879712478885,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001036732,0.0002033393,0.0002613151,0.0001062886,0.0002982788,0.0005187726,0.002141742,0.00006780546,3.438585e-7],"category_scores_gemma":[0.0001772376,0.0002048026,0.00005127842,0.0006081271,0.00004886507,0.0004397513,0.002239486,0.0001221252,0.00000877726],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001106967,"about_ca_system_score_gemma":0.0002018745,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007003674,"about_ca_topic_score_gemma":0.000006757093,"domain_scores_codex":[0.9979699,0.00005252266,0.000448926,0.0007716049,0.0002814592,0.0004755628],"domain_scores_gemma":[0.9973832,0.0002633619,0.0002398247,0.00165059,0.0002253887,0.0002376395],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005244244,0.0001725707,0.0005813639,0.00004655312,0.0001142064,0.00001847718,0.001642299,0.01847068,0.00007813767,0.0006521526,0.05862522,0.9195931],"study_design_scores_gemma":[0.0005611943,0.00003569737,0.00004988499,0.00006024087,0.00002810855,0.0000443178,0.0001786821,0.9652516,0.00003403154,0.0002981326,0.03320465,0.0002534656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002917122,0.00008794206,0.9940563,0.0006621887,0.001136005,0.0002797706,0.0006056078,0.0001900616,0.00006494976],"genre_scores_gemma":[0.02365058,0.000001233824,0.9737769,0.0003265189,0.001136952,0.000006783082,0.00104808,0.00002245437,0.00003045782],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9467809,"threshold_uncertainty_score":0.8351608,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2966314110","doi":"10.1007/s10586-019-02954-w","title":"Optimizing virtual machine placement in IaaS data centers: taxonomy, review and open issues","year":2019,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Virtual machine; Energy consumption; Virtualization; Data center; Distributed computing; Live migration; Process (computing); Cloud computing; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.0498184945699232,"gpt":0.2964128105983675,"spread":0.2465943160284443,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001632481,0.0002430343,0.0004715744,0.000121498,0.0001359893,0.0005714965,0.003681735,0.00003833588,0.00002009991],"category_scores_gemma":[0.00003210931,0.000221279,0.00003397176,0.0003186895,0.00002806089,0.0001834464,0.02004584,0.0002426825,0.00005492567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006781792,"about_ca_system_score_gemma":0.00002581031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001715995,"about_ca_topic_score_gemma":0.00001807317,"domain_scores_codex":[0.9976487,0.0002027709,0.000502965,0.0009825686,0.000229043,0.0004339938],"domain_scores_gemma":[0.9980107,0.0001425134,0.0001980292,0.001528685,0.00002700253,0.00009307783],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007187684,0.0008093429,0.02291079,0.004140941,0.0003959645,0.0001531705,0.007630249,0.215642,0.00004462106,0.006736868,0.0629826,0.6784816],"study_design_scores_gemma":[0.001021504,0.00009151391,0.0003497128,0.001845658,0.00001681669,0.00001946453,0.0001459777,0.9378815,0.000004272432,0.0000157006,0.05830783,0.0003000274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1368544,0.06231213,0.728674,0.03345215,0.0029253,0.01027387,0.00001864308,0.0008235959,0.0246659],"genre_scores_gemma":[0.7656652,0.0006480663,0.2151567,0.0148118,0.0002934366,0.00002868373,0.00005819896,0.00006099957,0.00327691],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7222395,"threshold_uncertainty_score":0.9878799,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3000966336","doi":"10.1007/s10586-020-03046-w","title":"A game theoretic analysis of resource mining in blockchain","year":2020,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Brandon University; University of Waterloo","funders":"Narodowym Centrum Nauki; University of Waterloo; Narodowe Centrum Nauki","keywords":"Blockchain; Computer science; Resource (disambiguation); Theoretical computer science; Data mining; Computer security; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01345167988311627,"gpt":0.2382449520520059,"spread":0.2247932721688896,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000458506,0.0001059945,0.0003124403,0.0003443321,0.00004973292,0.00002543774,0.0009208603,0.00008692764,0.000003902186],"category_scores_gemma":[0.00007127348,0.0001080022,0.0000974499,0.003005425,0.00009198883,0.0000233898,0.0006504254,0.0001877498,0.000002835739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001736313,"about_ca_system_score_gemma":0.00001795338,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008694593,"about_ca_topic_score_gemma":0.000007644463,"domain_scores_codex":[0.9987585,0.0001045557,0.0003791545,0.0004015208,0.0001310998,0.0002251849],"domain_scores_gemma":[0.9990215,0.0002585471,0.0001580766,0.0004685339,0.00003582289,0.00005752419],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003666548,0.0003439489,0.07621127,0.0001965528,0.0006881962,0.00005422277,0.1017141,0.2552912,0.0009436223,0.4194149,0.000358192,0.1447472],"study_design_scores_gemma":[0.0002133308,0.00002840676,0.002662092,0.00001953603,0.00003642133,0.000002050155,0.0002611222,0.9950396,0.0002492069,0.001181654,0.0002017149,0.0001048077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5581276,0.00007197532,0.4388556,0.002304386,0.00001062589,0.00008201143,6.652446e-7,0.0001092918,0.0004377636],"genre_scores_gemma":[0.9748934,7.354185e-7,0.0240452,0.001027085,0.00001934439,0.000003542908,0.000001640126,0.00000545037,0.000003612721],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7397485,"threshold_uncertainty_score":0.4404201,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2064808093","doi":"10.1007/s10586-009-0088-9","title":"Sensor scheduling for p-percent coverage in wireless sensor networks","year":2009,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Athabasca University; University of Alberta","funders":"National Science Foundation","keywords":"Computer science; Wireless sensor network; Scheduling (production processes); Cover (algebra); Distributed algorithm; Computer network; Distributed computing; Set cover problem; Real-time computing; Algorithm; Set (abstract data type); Mathematical optimization; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01304630472321107,"gpt":0.2467971900716462,"spread":0.2337508853484352,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007095938,0.0003919277,0.0004957045,0.0002336316,0.0003051868,0.0003507011,0.0009602284,0.0002247137,0.000001740946],"category_scores_gemma":[0.00005735058,0.0004112557,0.0001839256,0.000719188,0.00004685867,0.0002820553,0.0003251817,0.000464072,0.00001015373],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002096178,"about_ca_system_score_gemma":0.00004698259,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001050172,"about_ca_topic_score_gemma":0.000009154036,"domain_scores_codex":[0.9966751,0.0001829779,0.000713256,0.0009634927,0.0003323886,0.00113277],"domain_scores_gemma":[0.9980627,0.0006206757,0.0002403239,0.000756443,0.0001407023,0.0001791035],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002359295,0.0001037805,0.0005204137,0.0000152232,0.000009138604,0.00004144997,0.0004968922,0.9459646,0.0002864621,0.004291913,0.0000856823,0.04816086],"study_design_scores_gemma":[0.001314848,0.0001011753,0.001850256,0.0002309312,0.00000618242,0.00004749509,0.00005689396,0.9952583,0.0002342638,0.0001243497,0.000292455,0.0004828002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3438939,0.00009375388,0.6535493,0.0006962812,0.0007523161,0.0003617432,6.528043e-7,0.0002771717,0.0003749941],"genre_scores_gemma":[0.853701,0.00001419086,0.1433616,0.002239927,0.000566563,0.000005264131,0.000008819802,0.00003168316,0.00007095472],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5101876,"threshold_uncertainty_score":0.9998339,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3198861897","doi":"10.1007/s10586-021-03402-4","title":"Toward integrating software defined networks with the Internet of Things: a review","year":2021,"lang":"en","type":"review","venue":"Cluster Computing","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Software deployment; The Internet; Orchestration; Software-defined networking; World Wide Web; Telecommunications; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.03871512774760118,"gpt":0.2824244045812103,"spread":0.2437092768336092,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001515599,0.0008205317,0.002919089,0.0001257176,0.0001936584,0.0003941397,0.003182196,0.0003009383,0.00001375691],"category_scores_gemma":[0.0004114132,0.0004657995,0.0008556781,0.001721916,0.0001235988,0.0002579321,0.002673107,0.001463812,0.00001105017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001097486,"about_ca_system_score_gemma":0.0003954132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003008409,"about_ca_topic_score_gemma":0.000005030866,"domain_scores_codex":[0.9955131,0.0007876952,0.001409894,0.001072759,0.0005216251,0.0006948794],"domain_scores_gemma":[0.9935249,0.002782296,0.0016555,0.001563889,0.0003493913,0.0001240134],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000001035459,0.00002021476,0.000005341488,0.01602598,0.0001895495,0.0000359025,0.0005074788,0.0003020856,1.353427e-9,0.0007221449,0.008799026,0.9733912],"study_design_scores_gemma":[0.0001964097,0.0001071809,7.751773e-7,0.3366247,0.0006090986,0.0006013413,0.00003199573,0.08000193,9.002485e-8,0.0000254021,0.581074,0.000727108],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[1.061606e-7,0.5089407,0.4897869,0.0001491172,0.0003498441,0.000492487,7.598812e-7,0.0001655524,0.0001145858],"genre_scores_gemma":[0.00001777138,0.8778681,0.1189865,0.002549726,0.00031444,0.00004393162,0.00005023604,0.00008163346,0.00008759085],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.9726641,"threshold_uncertainty_score":0.9997793,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2049096082","doi":"10.1007/s10586-008-0059-6","title":"Translating Service Level Objectives to lower level policies for multi-tier services","year":2008,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Service-level agreement; Service level objective; Service level; Service (business); Domain (mathematical analysis); Service provider; Quality (philosophy); Quality of service; Service design; Process management; Software engineering; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.09111181423032377,"gpt":0.2979178296390462,"spread":0.2068060154087225,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004946014,0.0003730723,0.0003817322,0.0002550388,0.001033355,0.0002385592,0.001506598,0.00009546828,0.000001845957],"category_scores_gemma":[0.00002993235,0.0003552045,0.0001884658,0.0007907799,0.00004004802,0.00009165242,0.001177532,0.0002001091,0.00004613013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008295594,"about_ca_system_score_gemma":0.0000572907,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003070962,"about_ca_topic_score_gemma":0.0001653537,"domain_scores_codex":[0.9973451,0.00009612849,0.0005221704,0.0008448822,0.0003705547,0.0008211469],"domain_scores_gemma":[0.9984358,0.0002559691,0.0001789825,0.0006687747,0.0002637617,0.0001967137],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009140414,0.0006523173,0.004323334,0.001018185,0.0003207286,0.00005407183,0.2485042,0.5250098,0.00154719,0.002025089,0.001564084,0.2148896],"study_design_scores_gemma":[0.001131648,0.0001090987,0.01664172,0.0002203302,0.00001310211,0.00004730667,0.0008624857,0.9771364,0.0002298767,0.00006793474,0.00302482,0.0005153335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3568676,0.00006445548,0.6387029,0.002419403,0.000590548,0.0004900575,0.000006165263,0.0003397433,0.0005191975],"genre_scores_gemma":[0.6964886,3.980041e-7,0.2972111,0.005180902,0.0003740524,0.00001351633,0.000002242772,0.00003335952,0.0006958529],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4521265,"threshold_uncertainty_score":0.99989,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3123965728","doi":"10.1007/s10586-021-03231-5","title":"Towards the design of real-time autonomous IoT NIDS","year":2021,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Botnet; Internet of Things; Scalability; Intrusion detection system; Feature selection; Classifier (UML); Sliding window protocol; Data mining; Network packet; Computer network; Artificial intelligence; Real-time computing; Machine learning; Computer security; The Internet; Window (computing); Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.02480977710524583,"gpt":0.2412618987365219,"spread":0.216452121631276,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007079922,0.0001101177,0.0001742111,0.00004248799,0.0002409991,0.0001245601,0.0006257067,0.00006374864,0.00003554375],"category_scores_gemma":[0.00005753995,0.00008662316,0.00008090456,0.0004719009,0.00005127255,0.00009931073,0.000735235,0.0001646035,0.00004120693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003823223,"about_ca_system_score_gemma":0.0001333592,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002772743,"about_ca_topic_score_gemma":0.000001841768,"domain_scores_codex":[0.9986311,0.0003280103,0.0002991494,0.0002932146,0.0002126881,0.0002358974],"domain_scores_gemma":[0.9988417,0.0002939345,0.0001362941,0.0005364601,0.0001459889,0.0000456487],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000029698,0.0001824925,0.00008289904,0.0000725321,0.00009455274,0.0000639795,0.009402837,0.1666329,0.0170314,0.01799443,0.009407821,0.7790045],"study_design_scores_gemma":[0.0001745483,0.00006400998,0.000361481,0.00004421378,0.000006116776,0.00006970682,0.0000252411,0.9856718,0.01003397,0.001756454,0.001682367,0.0001101597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03741631,0.0001299831,0.9567571,0.001082105,0.0006887895,0.0001256489,3.37358e-7,0.0001522302,0.003647451],"genre_scores_gemma":[0.8688511,0.00002009956,0.1296113,0.00074377,0.0003589432,0.000002370193,0.000001147436,0.00001227014,0.000398963],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8314348,"threshold_uncertainty_score":0.353239,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1573408443","doi":"10.1023/a:1025718026938","title":"Behavior and Performance of Interactive Multi-Player Game Servers","year":2003,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Server; Bottleneck; Benchmarking; Scalability; Online transaction processing; Class (philosophy); Architecture; The Internet; Software deployment; Transaction processing; Database transaction; World Wide Web; Software engineering; Database; Artificial intelligence; Embedded system","retraction":null,"screen_n_in":null,"score":{"opus":0.01698121329126262,"gpt":0.2482413719262037,"spread":0.231260158634941,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003690174,0.0001526098,0.0001919263,0.0001104845,0.0001189121,0.00007787131,0.0003949666,0.00004116063,0.000002879621],"category_scores_gemma":[0.00002798451,0.0001409518,0.0000554376,0.0002199998,0.00005229118,0.00005445074,0.0005825256,0.0001624743,0.000008272114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003299009,"about_ca_system_score_gemma":0.00001613611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001211685,"about_ca_topic_score_gemma":0.00000131908,"domain_scores_codex":[0.9988123,0.0001020397,0.0002812618,0.0003666285,0.0001675797,0.0002702094],"domain_scores_gemma":[0.9992368,0.0001122329,0.0001658059,0.0003499044,0.00006568561,0.00006955845],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006781388,0.001159542,0.3187069,0.0006966055,0.0002714428,0.00009144079,0.0332509,0.1077559,0.001558415,0.006859983,0.0004831232,0.5290979],"study_design_scores_gemma":[0.0007784722,0.0001269112,0.04180057,0.0001196222,0.00001444589,0.00004921179,0.0001806845,0.9549618,0.001225295,0.0000126388,0.000524111,0.0002062406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8901042,0.00006612354,0.1083148,0.00005204965,0.0003436408,0.0001619284,2.143983e-7,0.00008282517,0.0008741771],"genre_scores_gemma":[0.9666782,0.000001447141,0.03291655,0.0001629969,0.00002585191,0.000002348409,2.665635e-7,0.000009525776,0.0002028321],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8472059,"threshold_uncertainty_score":0.5747848,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2156080250","doi":"10.1007/s10586-014-0359-y","title":"Carbon-aware distributed cloud: multi-level grouping genetic algorithm","year":2014,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Carbon footprint; Cloud computing; Greenhouse gas; Genetic algorithm; Distributed computing; Bin packing problem; Algorithm; Reduction (mathematics); Bin; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.02141251415636504,"gpt":0.2360213925604552,"spread":0.2146088784040902,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000713058,0.0003668154,0.0003739943,0.0001614635,0.000474017,0.000368099,0.001591842,0.0001116317,0.000001742025],"category_scores_gemma":[0.00006448488,0.0003560126,0.0001587358,0.0005696538,0.00006577592,0.00002843438,0.002347026,0.0003388225,0.00003854375],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001162553,"about_ca_system_score_gemma":0.00002760322,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008535807,"about_ca_topic_score_gemma":0.000004477776,"domain_scores_codex":[0.9969968,0.0002770193,0.0005623209,0.0009111832,0.0004343006,0.0008183349],"domain_scores_gemma":[0.9981318,0.0002693043,0.0002480188,0.001023147,0.0001178437,0.000209894],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002585443,0.0001427548,0.001363358,0.00008636359,0.00007383094,0.00004272831,0.001433946,0.1965576,0.00001969543,0.0004560461,0.0006658185,0.7991553],"study_design_scores_gemma":[0.0009216703,0.00005871731,0.01124138,0.0001330983,0.00001526346,0.00004693403,0.00005858959,0.9845879,0.00003934798,0.0001711408,0.002264558,0.0004613778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07537422,0.00009647849,0.921093,0.0005143289,0.001647179,0.0002423628,0.000002757935,0.0007008096,0.0003288503],"genre_scores_gemma":[0.7590609,7.298424e-7,0.2391754,0.0007002039,0.0008643936,0.000004047439,0.000007346759,0.00003098134,0.0001559846],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.798694,"threshold_uncertainty_score":0.9998892,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3082025521","doi":"10.1007/s10586-020-03153-8","title":"TempoCode-IoT: temporal codebook-based encoding of flow features for intrusion detection in Internet of Things","year":2020,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Codebook; Discriminative model; Intrusion detection system; Internet of Things; Botnet; Feature (linguistics); Artificial intelligence; Encoding (memory); Data mining; State (computer science); Representation (politics); The Internet; Machine learning; Code (set theory); Pattern recognition (psychology); Computer security; Algorithm; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.01865479277437609,"gpt":0.2405657773245639,"spread":0.2219109845501878,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005489374,0.000154715,0.0003121635,0.0001829044,0.0000782517,0.00004970756,0.0004858193,0.0001217715,0.000003627571],"category_scores_gemma":[0.0001420547,0.000153174,0.0001226261,0.0004332488,0.00004389102,0.0002391004,0.0003381969,0.0002489299,0.000001195422],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004728935,"about_ca_system_score_gemma":0.00003932411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000992916,"about_ca_topic_score_gemma":0.00003453636,"domain_scores_codex":[0.9985021,0.0001169338,0.0005665374,0.0003785942,0.000216952,0.0002188961],"domain_scores_gemma":[0.9989742,0.0002817518,0.0003592599,0.000203271,0.0001181225,0.00006337898],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008312229,0.0001997738,0.002310774,0.00126054,0.00004584693,0.000008533046,0.02895787,0.08125648,0.06146119,0.001655332,0.0007522131,0.8212602],"study_design_scores_gemma":[0.0007717359,0.0003222563,0.0001888197,0.0002520529,0.000004411072,0.000003608335,0.00003940841,0.8813823,0.1162474,0.0003586924,0.000301701,0.0001276014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1757303,0.00005278039,0.8228407,0.000430228,0.0003988456,0.0003469596,7.642408e-7,0.00008309803,0.0001163473],"genre_scores_gemma":[0.9191286,0.000001023795,0.08007976,0.0006534862,0.0001122192,0.000004855428,0.000002817971,0.00001113136,0.000006091543],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8211326,"threshold_uncertainty_score":0.6246254,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2588816312","doi":"10.1007/s10586-017-0770-2","title":"Efficient and robust frame-synchronized blind audio watermarking by featuring multilevel DWT and DCT","year":2017,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Ministry of Science and Technology, Taiwan; McGill University; University of Florida","keywords":"Digital watermarking; Computer science; Discrete cosine transform; Discrete wavelet transform; Watermark; Payload (computing); Frame (networking); Robustness (evolution); Artificial intelligence; Algorithm; Speech recognition; Wavelet; Wavelet transform; Image (mathematics); Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01989940736353675,"gpt":0.2601512023865371,"spread":0.2402517950230004,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005446328,0.0003147518,0.0003318413,0.0001416689,0.001713234,0.001193631,0.0009704243,0.000136969,7.481668e-7],"category_scores_gemma":[0.00007161206,0.0002832506,0.0000632317,0.00008252444,0.0002405984,0.0003855602,0.002235463,0.0003603917,0.000001459753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003779999,"about_ca_system_score_gemma":0.00001580291,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002830855,"about_ca_topic_score_gemma":0.000002292652,"domain_scores_codex":[0.998035,0.00008230463,0.0003215046,0.0007672954,0.000223899,0.0005700633],"domain_scores_gemma":[0.9984497,0.0001645783,0.0003036451,0.0008518968,0.00007563656,0.0001544876],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001895891,0.000264661,0.0603545,0.0006274951,0.0002170002,0.0001908559,0.01139331,0.01335204,0.01080785,0.0019578,0.001140918,0.8995039],"study_design_scores_gemma":[0.00168243,0.00005434539,0.01730394,0.0004031899,0.00001405886,0.00009691382,0.00002144832,0.9739935,0.004748737,0.000576049,0.000589977,0.0005153593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4038874,0.0002827646,0.594633,0.000248571,0.0002472774,0.0002052307,0.000001850316,0.0002512193,0.0002427224],"genre_scores_gemma":[0.8177896,0.00001766163,0.1818736,0.0001436307,0.00009589274,0.000005462864,0.000001980987,0.0000195667,0.00005267577],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9606415,"threshold_uncertainty_score":0.999962,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071880963","doi":"10.1023/b:clus.0000003942.73875.29","title":"A Synchronous Co-Allocation Mechanism for Grid Computing Systems","year":2003,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Victoria; Purdue University","keywords":"Computer science; Quality of service; Reservation; Resource allocation; Distributed computing; Grid; Queueing theory; Grid computing; Computer network; Scheme (mathematics); Service (business); Variety (cybernetics)","retraction":null,"screen_n_in":null,"score":{"opus":0.02016856657880273,"gpt":0.2640230197982302,"spread":0.2438544532194275,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001785198,0.00040532,0.0005332484,0.0001865252,0.0007782961,0.000787901,0.001180748,0.0001749778,0.000001467477],"category_scores_gemma":[0.0002084397,0.0004174681,0.0001992817,0.0004850111,0.00004981965,0.0002897157,0.0002327845,0.0002403643,0.00008039582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002246404,"about_ca_system_score_gemma":0.0001752484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003474068,"about_ca_topic_score_gemma":0.000001488598,"domain_scores_codex":[0.9964441,0.0004064605,0.000885557,0.0009276083,0.0004222312,0.0009140452],"domain_scores_gemma":[0.9973594,0.000672124,0.0005109408,0.0008317469,0.0004201124,0.0002057083],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001127605,0.0001841038,0.0004005166,0.0006164298,0.000146561,0.00002012312,0.003822464,0.1732541,0.0003821175,0.8049665,0.008958128,0.007237694],"study_design_scores_gemma":[0.001082882,0.0001361261,0.00005215443,0.0002666471,0.00001597167,0.0002435315,0.0002231615,0.987538,0.00030818,0.00167151,0.00793014,0.0005317354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02134665,0.0002324523,0.9686475,0.0001830707,0.005266415,0.00106735,0.000009856763,0.0007556555,0.002491005],"genre_scores_gemma":[0.9422981,0.00000132473,0.05626422,0.0004592051,0.0007433756,0.00001846673,0.00004174478,0.00003982769,0.0001337818],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9209514,"threshold_uncertainty_score":0.9998277,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3192838559","doi":"10.1007/s10586-021-03361-w","title":"ProBlock: a novel approach for fake news detection","year":2021,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Misinformation and Its Impacts","field":"Social Sciences","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brandon University","funders":"","keywords":"Computer science; Upload; Correctness; Voting; Social media; Fake news; Internet privacy; News media; Probabilistic logic; The Internet; World Wide Web; Computer security; Artificial intelligence; Algorithm; Advertising","retraction":null,"screen_n_in":null,"score":{"opus":0.0530046895499609,"gpt":0.318441151762184,"spread":0.2654364622122231,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004219774,0.00006023967,0.00008586427,0.0000359099,0.0005331031,0.0001769043,0.00008649511,0.00006283442,0.00001539618],"category_scores_gemma":[0.0003611001,0.00006051239,0.00005603143,0.000218351,0.00002903941,0.0001739244,0.00004594399,0.00006892178,0.000007908881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005821799,"about_ca_system_score_gemma":0.0001272462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000559825,"about_ca_topic_score_gemma":0.000168583,"domain_scores_codex":[0.9992665,0.00004190167,0.0001714525,0.0001257822,0.000157346,0.0002370155],"domain_scores_gemma":[0.9995371,0.00007487785,0.00007998523,0.00008976724,0.0001366847,0.00008156318],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004009523,0.0003047425,0.0003615742,0.0003369495,0.00006128317,0.000001026189,0.2701417,0.01134295,0.002917433,0.0131367,0.006570279,0.6947852],"study_design_scores_gemma":[0.001928269,0.00005262661,0.000905772,0.0000690097,0.00002260695,0.00001982837,0.05657355,0.7723804,0.002311735,0.0003080257,0.1650309,0.0003972993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03607221,0.00001647178,0.9014328,0.0006132097,0.0003112774,0.0003225821,0.000001577108,0.0000930323,0.06113683],"genre_scores_gemma":[0.9533634,0.00000166551,0.04304601,0.001244657,0.0004792566,0.000002313673,0.00001019626,0.000007562174,0.001844889],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9172912,"threshold_uncertainty_score":0.4100252,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4407937593","doi":"10.1007/s10586-024-04933-2","title":"Forecasting workload in cloud computing: towards uncertainty-aware predictions and transfer learning","year":2025,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Traffic Prediction and Management Techniques","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"Horizon 2020 Framework Programme; Science Foundation Ireland","keywords":"Computer science; Workload; Cloud computing; Transfer of learning; Transfer (computing); Distributed computing; Artificial intelligence; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01328293720874745,"gpt":0.2304287846941724,"spread":0.2171458474854249,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003326758,0.0001876198,0.0002151023,0.0003084347,0.0001882708,0.00008529914,0.0001305736,0.0001017234,0.000003012678],"category_scores_gemma":[0.00002598723,0.0002113818,0.00005026585,0.0004342278,0.0000409638,0.00008839567,0.00013395,0.0004698403,0.000001212651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001055466,"about_ca_system_score_gemma":0.00001453417,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002415675,"about_ca_topic_score_gemma":0.00003464821,"domain_scores_codex":[0.998893,0.00005407734,0.0003606242,0.0002611988,0.0001005823,0.0003305011],"domain_scores_gemma":[0.9996778,0.0001067543,0.00001836514,0.0001185253,0.00002700391,0.00005156875],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006282654,0.00001374771,0.002340635,0.0001668092,0.00003450027,0.0000049669,0.001054882,0.7696656,0.00001489397,0.000211094,0.001763765,0.2247228],"study_design_scores_gemma":[0.0005715495,0.00002039286,0.002236652,0.0006790608,0.00001897562,0.000006597445,0.0005922765,0.992295,0.00003393959,0.00004361612,0.003337496,0.0001644523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1592693,0.000265861,0.8279837,0.0001643989,0.0006644136,0.0002648104,0.000001234529,0.003344565,0.008041688],"genre_scores_gemma":[0.998336,0.00004686384,0.001223206,0.0001512805,0.0001303499,0.000006886637,0.000007089903,0.00002325928,0.00007507236],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8390667,"threshold_uncertainty_score":0.8619898,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3096318863","doi":"10.1007/s10586-020-03199-8","title":"MMHGE: detecting mild cognitive impairment based on multi-atlas multi-view hybrid graph convolutional networks and ensemble learning","year":2020,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Dementia and Cognitive Impairment Research","field":"Medicine","cited_by":28,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Natural Science Foundation of Hunan Province; National Natural Science Foundation of China","keywords":"Computer science; Discriminative model; Cognitive impairment; Graph; Artificial intelligence; Pattern recognition (psychology); Convolutional neural network; Cognition; Machine learning; Medicine; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03560893031235769,"gpt":0.3067903673563582,"spread":0.2711814370440006,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006560714,0.000320575,0.0004209591,0.0001555035,0.0005025459,0.00009737278,0.00009175818,0.00007818007,0.00005905475],"category_scores_gemma":[0.0003986164,0.0003024023,0.0001653302,0.0003077083,0.0001397851,0.00007559843,0.000249891,0.0008654807,0.00005021984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007590964,"about_ca_system_score_gemma":0.00009387519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001519659,"about_ca_topic_score_gemma":0.000003640886,"domain_scores_codex":[0.9974186,0.0003329074,0.0004208462,0.000682533,0.0004642662,0.0006808546],"domain_scores_gemma":[0.9983854,0.0006361863,0.0001558853,0.0001091818,0.0002796269,0.0004337531],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002621871,0.001470722,0.8446506,0.001297821,0.0006056693,0.0006094236,0.001684753,0.03069765,0.001429893,0.00001058256,0.0006948972,0.1142261],"study_design_scores_gemma":[0.009008058,0.001236501,0.1440836,0.0009532533,0.0001193702,0.00004705718,0.0005848553,0.8425843,0.001012135,0.000001770257,0.0001079131,0.0002612329],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.592696,0.0004779392,0.4044945,0.0007549791,0.000103824,0.0009973714,0.000003536089,0.000151143,0.0003207114],"genre_scores_gemma":[0.9912531,0.00002435451,0.003867017,0.004316337,0.0002969708,0.0000240443,0.00006855124,0.00004762765,0.0001019725],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8118866,"threshold_uncertainty_score":0.9999428,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4405350980","doi":"10.1007/s10586-024-04878-6","title":"Metaheuristic-based task scheduling for latency-sensitive IoT applications in edge computing","year":2024,"lang":"en","type":"article","venue":"Cluster Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Cloud computing; Distributed computing; Scheduling (production processes); Job shop scheduling; Edge computing; Particle swarm optimization; Energy consumption; Metaheuristic; Latency (audio); Internet of Things; Real-time computing; Mathematical optimization; Computer network; Embedded system; Algorithm; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.0209975618664177,"gpt":0.2827724796412178,"spread":0.2617749177748001,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001478482,0.0004076141,0.0004882191,0.000556813,0.0005825639,0.0008987067,0.0009419488,0.000152151,6.14001e-7],"category_scores_gemma":[0.0001554527,0.0004132817,0.000257698,0.001408437,0.00007676151,0.0002733319,0.0006859982,0.0005333644,0.00005425173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002055416,"about_ca_system_score_gemma":0.000257903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002583514,"about_ca_topic_score_gemma":0.000003271627,"domain_scores_codex":[0.9966356,0.0001612452,0.0008132393,0.00116077,0.0002939178,0.0009352782],"domain_scores_gemma":[0.9965213,0.002348622,0.0001749204,0.0005817142,0.0002185029,0.0001549488],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004341627,0.0004533542,0.002672829,0.002181404,0.0002805583,0.0002163396,0.01561223,0.3110931,0.002832776,0.03395822,0.003562731,0.627093],"study_design_scores_gemma":[0.0005204966,0.00004668186,0.0006065156,0.0005348425,0.00002737007,0.00002132732,0.0000799956,0.9898189,0.0007187473,0.001451713,0.005697079,0.0004763218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04584899,0.0006824829,0.9448578,0.000788037,0.005521953,0.0008984855,0.000001566142,0.0008526457,0.000548083],"genre_scores_gemma":[0.7259728,9.061197e-7,0.2712009,0.0004812774,0.002228278,0.00001732431,0.00002008987,0.00004655646,0.0000318249],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6801239,"threshold_uncertainty_score":0.9998319,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3003707605","doi":"10.1007/s10586-020-03064-8","title":"Securing the LoRaWAN join procedure using blockchains","year":2020,"lang":"en","type":"article","venue":"Cluster Computing","topic":"IoT Networks and Protocols","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Network packet; Computer security; Computer network; Authentication (law); Replay attack; Distributed computing","retraction":null,"screen_n_in":null,"score":{"opus":0.02626890686645879,"gpt":0.2362873881786082,"spread":0.2100184813121494,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001425415,0.0001555657,0.0001464118,0.00001883105,0.0002055994,0.000104852,0.0002144835,0.00005929557,0.0000123886],"category_scores_gemma":[0.00001500316,0.0001231031,0.00005832254,0.0002198162,0.00002044474,0.00004804223,0.0001449689,0.0003172373,0.00001802364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003208099,"about_ca_system_score_gemma":0.00001535096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002329944,"about_ca_topic_score_gemma":0.000001936875,"domain_scores_codex":[0.999165,0.00003016983,0.0002115586,0.0001646651,0.0001112001,0.0003173896],"domain_scores_gemma":[0.9996725,0.00005149181,0.0000367253,0.0001397805,0.00002066929,0.00007888275],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004660222,0.000003022026,0.0003994603,0.0001895324,0.00002243493,0.000006572525,0.003310557,0.9896187,0.0004935691,0.0000484046,0.002414492,0.003488583],"study_design_scores_gemma":[0.000213228,0.0000141852,0.00009302762,0.0001195739,0.00000840906,0.0000162606,0.0001241833,0.9940218,0.000498676,0.00004002194,0.004687047,0.0001636145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.70609,0.0005182308,0.2803678,0.002024631,0.0007379752,0.004885863,0.000002500978,0.001140506,0.004232518],"genre_scores_gemma":[0.9952502,8.236326e-7,0.001769324,0.001302059,0.001594234,0.00002819324,0.000001163071,0.00004583201,0.000008187269],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2891602,"threshold_uncertainty_score":0.502,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2025713912","doi":"10.1007/s10586-012-0243-6","title":"Special issue on energy-aware computing and communications","year":2013,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Energy (signal processing); Distributed computing; Telecommunications; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.01632456257095322,"gpt":0.2467239862909705,"spread":0.2303994237200173,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003552747,0.0002620396,0.0002641326,0.000179509,0.0007949712,0.0006128223,0.001713962,0.00007600175,0.00002167982],"category_scores_gemma":[0.00002190803,0.0002466473,0.00008027927,0.0003685559,0.0001187227,0.0000595014,0.0039201,0.0002871852,0.0001976278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006080489,"about_ca_system_score_gemma":0.00001751307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000112473,"about_ca_topic_score_gemma":0.000006219466,"domain_scores_codex":[0.9979987,0.0002078986,0.0004135037,0.0005950638,0.0002931505,0.000491751],"domain_scores_gemma":[0.9977175,0.0004888821,0.0001841596,0.001347669,0.0000996957,0.0001621127],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001676302,0.00009328855,0.00040197,0.00002567486,0.00003201573,0.000005633585,0.002107567,0.0050919,0.000007379026,0.01100963,0.04174239,0.9394809],"study_design_scores_gemma":[0.0003650093,0.00006695306,0.001737453,0.0001204001,0.000005698568,0.00002110976,0.0001841357,0.9150174,0.00001796147,0.0006114829,0.08156812,0.0002842956],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1108156,0.0002458611,0.7439073,0.01787308,0.003111039,0.0006794564,0.000001158662,0.001219616,0.1221468],"genre_scores_gemma":[0.959959,0.000005080453,0.0292708,0.004073673,0.005604011,0.000004251393,0.000003311692,0.000025219,0.0010546],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9391966,"threshold_uncertainty_score":0.9999986,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4366496383","doi":"10.1007/s10586-023-03991-2","title":"Task scheduling in the internet of things: challenges, solutions, and future trends","year":2023,"lang":"en","type":"article","venue":"Cluster Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Internet of Things; Scheduling (production processes); Task (project management); The Internet; Data science; World Wide Web; Systems engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03479724700029281,"gpt":0.2583736419641086,"spread":0.2235763949638158,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001760135,0.0001558436,0.0002098042,0.0003413293,0.000176952,0.0001351656,0.0008863974,0.00008085224,4.477057e-7],"category_scores_gemma":[0.00003514936,0.0001226999,0.00006229727,0.0009124315,0.00004981302,0.0002847439,0.001093557,0.0003205156,0.000009963139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002346461,"about_ca_system_score_gemma":0.00002223978,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002560098,"about_ca_topic_score_gemma":0.000002869516,"domain_scores_codex":[0.9983894,0.0001927446,0.0003620959,0.0003821814,0.0002294256,0.0004441683],"domain_scores_gemma":[0.9990666,0.0003374216,0.0001373062,0.0003771554,0.00004076346,0.00004076567],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004646724,0.00004334193,0.0009355955,0.0001161698,0.00002196903,0.00002689587,0.07466459,0.0007435897,0.00004605596,0.01020198,0.003154554,0.9100406],"study_design_scores_gemma":[0.0003402106,0.00004116191,0.01178692,0.0001514284,0.00000447919,0.0000438712,0.001021274,0.9784134,0.000013377,0.0008891735,0.007131062,0.0001636593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6079245,0.01064468,0.319822,0.0343717,0.01568122,0.0004077957,3.627453e-7,0.0009438538,0.01020387],"genre_scores_gemma":[0.9829797,0.000105788,0.01433481,0.0005603084,0.001952457,0.000002411948,0.000003731812,0.00001331266,0.00004743986],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9776698,"threshold_uncertainty_score":0.5003557,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4308791329","doi":"10.1007/s10586-022-03797-8","title":"Modeling and simulation of smart grid-aware edge computing federations","year":2022,"lang":"en","type":"article","venue":"Cluster Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Ministerio de Asuntos Económicos y Transformación Digital, Gobierno de España; Google","keywords":"Computer science; Edge computing; Smart grid; Distributed computing; Dimensioning; Enhanced Data Rates for GSM Evolution; Energy consumption; Grid; Computer network; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.03031318669241316,"gpt":0.2695484688946377,"spread":0.2392352822022246,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0009125724,0.0002141331,0.0003056196,0.0002304553,0.001817836,0.0002559091,0.0005956067,0.00004910146,0.000002360828],"category_scores_gemma":[0.00005543753,0.0002476635,0.00009365573,0.0005281912,0.0000355781,0.000316348,0.002490594,0.0003605141,0.000003110853],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009285013,"about_ca_system_score_gemma":0.00008361939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004248762,"about_ca_topic_score_gemma":0.000002095262,"domain_scores_codex":[0.9977716,0.0002274337,0.0006309536,0.0005543958,0.0003814463,0.0004341945],"domain_scores_gemma":[0.9986848,0.0004354013,0.000228204,0.0003961528,0.0001631924,0.00009229733],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005081897,0.00003598276,0.0009213549,0.00004022493,0.00001452259,0.000003708905,0.003615226,0.9739526,0.00005238572,0.0002542021,0.0002433936,0.0208613],"study_design_scores_gemma":[0.0004464024,0.0000792127,0.0002546714,0.00005130728,0.00000909381,0.00003651508,0.0001993174,0.9978222,0.00004204099,0.0003478285,0.0004539793,0.000257444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3025639,0.0001036059,0.692881,0.0002252924,0.00362098,0.0001726584,5.499694e-7,0.0001791544,0.000252843],"genre_scores_gemma":[0.9773012,6.154123e-7,0.02122191,0.0003632389,0.001056215,0.00000203984,0.000009840785,0.00002122075,0.0000237426],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6747373,"threshold_uncertainty_score":0.9999976,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2104464824","doi":"10.1007/s10586-014-0349-0","title":"Recent trends in interactive multimedia computing for industry","year":2014,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Multimedia Communication and Technology","field":"Social Sciences","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Multimedia; Interactive media; Human–computer interaction","retraction":null,"screen_n_in":null,"score":{"opus":0.04951955399076109,"gpt":0.3810236748002913,"spread":0.3315041208095302,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00128741,0.0001070547,0.0001971047,0.0002747004,0.0003322849,0.00004830313,0.0004726174,0.0002954767,0.00007280834],"category_scores_gemma":[0.00104953,0.0001162143,0.00004995715,0.000436635,0.0001598472,0.00008134172,0.0002487387,0.0005754304,0.00001490278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001791319,"about_ca_system_score_gemma":0.00003881677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00028233,"about_ca_topic_score_gemma":0.001284145,"domain_scores_codex":[0.998576,0.0003588511,0.0003131389,0.0002458925,0.0001270252,0.000379039],"domain_scores_gemma":[0.99803,0.001359886,0.0001718284,0.0002526054,0.0001046954,0.00008100588],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000010548,0.00005582417,0.01104178,0.000003593043,0.000006926563,2.739678e-7,0.0158513,0.0001761061,0.00002101966,0.0013954,0.0006896224,0.9707476],"study_design_scores_gemma":[0.001522403,0.00003864177,0.01518461,0.00009133069,0.000006464475,0.000001253624,0.004551079,0.7776836,0.00009029765,0.0004202254,0.2001664,0.0002438016],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8421619,0.0001192991,0.05454319,0.02487791,0.002270455,0.0008074819,0.000003375645,0.0006641696,0.07455222],"genre_scores_gemma":[0.9790814,0.000009072878,0.01965636,0.000692936,0.0003161193,0.000006764195,0.00001346018,0.00001294458,0.0002109548],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9705038,"threshold_uncertainty_score":0.4739081,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2592666947","doi":"10.1007/s10586-017-0815-6","title":"Collision detection for virtual environment using particle swarm optimization with adaptive cauchy mutation","year":2017,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Particle swarm optimization; Computer science; Multi-swarm optimization; Collision detection; Algorithm; Mathematical optimization; Adaptive mutation; Cauchy distribution; Mutation; Collision; Swarm behaviour; Genetic algorithm; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03538594963211208,"gpt":0.2655798658036606,"spread":0.2301939161715485,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000375654,0.0001470931,0.0001468276,0.00004984688,0.001165312,0.0003811288,0.0003960948,0.0000590266,5.335197e-7],"category_scores_gemma":[0.00006477592,0.0001383926,0.00003614641,0.00006905945,0.00005719618,0.0006681941,0.0002447877,0.00008634343,0.000005152234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001631566,"about_ca_system_score_gemma":0.00003646737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003809961,"about_ca_topic_score_gemma":0.000001802371,"domain_scores_codex":[0.9987637,0.00006355497,0.0002244832,0.00042526,0.0002398013,0.0002832261],"domain_scores_gemma":[0.9988735,0.0001354317,0.0003599634,0.0004773919,0.00008080173,0.00007293512],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002876099,0.00002323,0.0001508036,0.000004784097,0.00001249595,0.000007173637,0.0008393507,0.9808712,0.0002661251,0.00006229272,0.000003676638,0.01773009],"study_design_scores_gemma":[0.0009523168,0.0003573618,0.001136757,0.00006855935,0.00001804904,0.00004297585,0.00009268906,0.9903201,0.00676529,0.00005375051,0.000007432943,0.0001846825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1651971,0.000008875511,0.833869,0.00009785294,0.0003576219,0.0003641517,0.000001176643,0.00008451855,0.00001970568],"genre_scores_gemma":[0.5502713,2.78084e-7,0.4495876,0.00003167131,0.0000797234,0.000005582937,0.000001828133,0.000009823576,0.00001219478],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3850743,"threshold_uncertainty_score":0.8962759,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4292259733","doi":"10.1007/s10586-022-03659-3","title":"When explainable AI meets IoT applications for supervised learning","year":2022,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brandon University","funders":"Høgskulen på Vestlandet","keywords":"Computer science; Internet of Things; Field (mathematics); Artificial intelligence; Process (computing); Deep learning; Big data; Machine learning; Interpretation (philosophy); Computation; Data mining; Algorithm; Embedded system","retraction":null,"screen_n_in":null,"score":{"opus":0.01501950209814968,"gpt":0.259273588772887,"spread":0.2442540866747373,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004371067,0.0001173839,0.0001340908,0.0001170927,0.001894401,0.0001921589,0.0008507869,0.00003165693,0.00003033872],"category_scores_gemma":[0.0000122481,0.0001367635,0.00009762574,0.0003830859,0.00002034861,0.0001471128,0.0009387435,0.0002576646,0.00001260284],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001032317,"about_ca_system_score_gemma":0.00004634464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001639635,"about_ca_topic_score_gemma":9.369114e-7,"domain_scores_codex":[0.998753,0.00007527363,0.0002551413,0.0004470378,0.0001683741,0.0003011894],"domain_scores_gemma":[0.9991319,0.0001550731,0.0001157165,0.0004375323,0.00009364692,0.00006615207],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001871197,0.0003173378,0.0004784726,0.0001171466,0.00005136987,0.000003004008,0.004951387,0.09833608,0.003268702,0.2213022,0.02501378,0.6461418],"study_design_scores_gemma":[0.0001910132,0.00006748778,0.00002210129,0.000002859372,0.000003763587,0.00001545283,0.0001955991,0.6007734,0.0005360227,0.004366621,0.3936923,0.0001334457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001847932,0.00006341737,0.9914585,0.004072602,0.000087286,0.0008753217,0.000002415696,0.0007394359,0.0008531246],"genre_scores_gemma":[0.7446465,0.000001056325,0.2512808,0.001603527,0.0001375586,0.001242859,0.00001313752,0.00002063728,0.001053925],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7427986,"threshold_uncertainty_score":0.999405,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2786800158","doi":"10.1007/s10586-018-1854-3","title":"Cost-sensitive large margin distribution machine for fault detection of wind turbines","year":2018,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Machine Fault Diagnosis Techniques","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Science Foundation of Hainan Province; National Natural Science Foundation of China","keywords":"Margin (machine learning); Wind power; Computer science; Support vector machine; Benchmark (surveying); Turbine; Sensitivity (control systems); Fault (geology); Fault detection and isolation; Machine learning; Artificial intelligence; Engineering; Geology","retraction":null,"screen_n_in":null,"score":{"opus":0.01220134722858529,"gpt":0.2825349271661472,"spread":0.2703335799375619,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003045442,0.0001737108,0.0002238081,0.00007597609,0.0001114746,0.00002320033,0.0001064739,0.00009898111,0.000005564598],"category_scores_gemma":[0.0001256766,0.0001776791,0.00008137583,0.0001663144,0.00004192821,0.00008734476,0.00008193474,0.0001284151,0.000006354087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008988287,"about_ca_system_score_gemma":0.000005166283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000236105,"about_ca_topic_score_gemma":0.00006149642,"domain_scores_codex":[0.9990746,0.00003446133,0.0003025596,0.0001941243,0.0001047214,0.0002895224],"domain_scores_gemma":[0.9993272,0.0001805445,0.00008273024,0.0001801836,0.0001855118,0.00004384788],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005516304,0.0006585919,0.01572972,0.00274688,0.0006381588,0.00001485436,0.006179413,0.04199902,0.2437953,0.00137737,0.02855006,0.657759],"study_design_scores_gemma":[0.000517738,0.00009504872,0.00395233,0.00009115547,0.00001934393,0.000007624772,0.00002169328,0.7709049,0.2197608,0.00008297056,0.004382262,0.0001641187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3443356,0.00004619023,0.65398,0.00003440986,0.0003242133,0.0005045409,0.0001450934,0.0003800426,0.0002499514],"genre_scores_gemma":[0.9949758,0.000003666232,0.004338281,0.00005904821,0.000409277,0.0000139828,0.0001504778,0.00003715836,0.00001231844],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7289059,"threshold_uncertainty_score":0.7245542,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998489369","doi":"10.1007/s10586-015-0448-6","title":"Cloud-based rehabilitation and recovery prediction system for stroke patients","year":2015,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Stroke Rehabilitation and Recovery","field":"Medicine","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University; University of Ottawa","funders":"","keywords":"Rehabilitation; Stroke (engine); Physical medicine and rehabilitation; Physical therapy; Medicine; Hemiparesis; Kinematics; Computer science; Test (biology); Surgery","retraction":null,"screen_n_in":null,"score":{"opus":0.01608409982322355,"gpt":0.2568216504819465,"spread":0.2407375506587229,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004992757,0.0001092662,0.0002176503,0.0001415984,0.00008153604,0.00002689773,0.00002901737,0.00008982314,0.00000103058],"category_scores_gemma":[0.0008436503,0.00009713805,0.0001010537,0.00008360195,0.00004227022,0.00008205613,0.00002477498,0.00007864107,0.000005208009],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000254017,"about_ca_system_score_gemma":0.00008024748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004941821,"about_ca_topic_score_gemma":9.145299e-7,"domain_scores_codex":[0.9989779,0.00007765954,0.0003320841,0.0002526353,0.0001986193,0.0001611305],"domain_scores_gemma":[0.9984517,0.0007788521,0.000114607,0.0001489607,0.0003628343,0.0001431182],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002524291,0.0003491079,0.9250165,0.002766185,0.00009667537,0.000001164025,0.002057788,0.004822559,0.0002266393,0.0001458418,0.01167,0.05032326],"study_design_scores_gemma":[0.02417156,0.00958845,0.3873507,0.001715268,0.0002384948,0.00002356876,0.004571337,0.5627018,0.0003814453,0.0001259963,0.008753277,0.0003780801],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9526418,0.00007028111,0.04313192,0.0004327152,0.001997695,0.001046547,0.00003095114,0.0001352755,0.0005128308],"genre_scores_gemma":[0.979866,4.271661e-7,0.0192443,0.0002201482,0.000430566,0.00002077437,0.00006180679,0.00001958985,0.0001363623],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5578793,"threshold_uncertainty_score":0.3961175,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2343650655","doi":"10.1007/s10586-016-0565-x","title":"Incorporating service and user information and latent features to predict QoS for selecting and recommending cloud service compositions","year":2016,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Cloud computing; Quality of service; Mobile QoS; Software as a service; Service provider; Service (business); The Internet; Software; Computer network; World Wide Web; Software development; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.009644635896766519,"gpt":0.2320006413342444,"spread":0.2223560054374779,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004842973,0.000241856,0.0002270556,0.000206751,0.0007129449,0.0005119313,0.0003416124,0.00008621887,6.06353e-7],"category_scores_gemma":[0.00002407079,0.0001903431,0.00002347515,0.0005139739,0.00001602943,0.001084172,0.001087737,0.0001446769,0.000003093954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000035746,"about_ca_system_score_gemma":0.00002713387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001461928,"about_ca_topic_score_gemma":0.0003524186,"domain_scores_codex":[0.9985394,0.00008430833,0.0003939948,0.000437513,0.000163106,0.0003816902],"domain_scores_gemma":[0.9984626,0.0005967077,0.000227098,0.0002489539,0.0002619552,0.0002026454],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003543505,0.0001345735,0.09169829,0.003725122,0.0003708318,0.000006205208,0.1120398,0.005704397,0.02542237,0.02650206,0.002335478,0.7317066],"study_design_scores_gemma":[0.006647987,0.0007088896,0.06304612,0.003682994,0.000139827,0.000822236,0.002923292,0.8875982,0.004850093,0.004027111,0.0236095,0.0019438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5041806,0.00006792516,0.47817,0.01628736,0.0003952926,0.0005612068,0.00001134903,0.0002029598,0.0001233356],"genre_scores_gemma":[0.8321671,0.000006784606,0.1503148,0.01706821,0.0003769426,0.00002317329,0.00001554425,0.00001897444,0.000008428441],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8818938,"threshold_uncertainty_score":0.7761965,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4390112344","doi":"10.1007/s10586-023-04205-5","title":"An ensemble clustering approach for modeling hidden categorization perspectives for cloud workloads","year":2023,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Cluster analysis; Cloud computing; Data mining; Categorization; Workload; Conceptual clustering; Data stream clustering; Fuzzy clustering; Bottleneck; Machine learning; Artificial intelligence; CURE data clustering algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.03532039395177234,"gpt":0.2766147355894165,"spread":0.2412943416376442,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001209663,0.0002725809,0.0002946731,0.0002911561,0.0008257731,0.0005297765,0.001088209,0.0001025727,3.345574e-7],"category_scores_gemma":[0.0000645353,0.0002759293,0.0001761086,0.0007204512,0.00002552913,0.00009967565,0.0007564797,0.0001401879,0.000006099152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001154438,"about_ca_system_score_gemma":0.00003742881,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001548249,"about_ca_topic_score_gemma":0.000002283097,"domain_scores_codex":[0.9975246,0.00009487176,0.0004231111,0.0009700746,0.000260189,0.000727143],"domain_scores_gemma":[0.99861,0.0002488327,0.0001530877,0.0006621946,0.0002029713,0.0001229832],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001683594,0.00005679505,0.00003091086,0.0001265656,0.00003219532,0.000001017764,0.009396889,0.9207352,0.0001148505,0.003922028,0.0003942476,0.06517246],"study_design_scores_gemma":[0.0007930138,0.0001236497,0.00002670805,0.00005385943,0.00001746456,0.000006124505,0.003041129,0.9937474,0.00004457249,0.001624567,0.0001645083,0.0003569851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08746349,0.00008235098,0.9086878,0.0004390453,0.0007715728,0.0009515854,0.000001393246,0.001162394,0.0004403665],"genre_scores_gemma":[0.7250151,0.000001411433,0.2734384,0.0001336445,0.001076066,0.0000495513,0.00002472589,0.0000408076,0.0002203114],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6375516,"threshold_uncertainty_score":0.9999693,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2017811850","doi":"10.1007/s10586-009-0090-2","title":"Using ant-based agents for congestion control in ad-hoc wireless sensor networks","year":2009,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Canadian Centre for Applied Research in Cancer Control","keywords":"Computer science; ANT; Wireless ad hoc network; Computer network; Network congestion; Wireless sensor network; Wireless; Telecommunications; Network packet","retraction":null,"screen_n_in":null,"score":{"opus":0.02928262745674676,"gpt":0.2800714539968702,"spread":0.2507888265401234,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006928606,0.000321822,0.0004380016,0.0002350576,0.0002694804,0.0002442351,0.0006960144,0.0002073114,0.000001154736],"category_scores_gemma":[0.00004551687,0.0003445095,0.0001401274,0.000588301,0.00004950001,0.0002222679,0.0001073892,0.0003022804,0.000002719551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002087733,"about_ca_system_score_gemma":0.00006116461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006980544,"about_ca_topic_score_gemma":0.00001081896,"domain_scores_codex":[0.9972557,0.0002526921,0.0005992931,0.0007440399,0.0002849048,0.0008634118],"domain_scores_gemma":[0.9982057,0.0006445538,0.0003007384,0.0005460378,0.0001622965,0.0001406427],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005336544,0.00009047235,0.0006018435,0.00001226304,0.00000818633,0.00002384229,0.0001327395,0.9441686,0.0003144082,0.0005028861,0.00008242845,0.05400899],"study_design_scores_gemma":[0.003054945,0.0001299767,0.002162524,0.0002790826,0.0000123835,0.0000158307,0.00001515059,0.9935685,0.0001027095,0.00003594696,0.0002454823,0.0003774039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.249619,0.0001808714,0.7481883,0.0004875918,0.0007896779,0.000467165,0.000001106859,0.0002230237,0.00004334558],"genre_scores_gemma":[0.8917526,0.000003410345,0.1049736,0.002936343,0.0002767161,0.000004432655,0.000008448912,0.00002679508,0.00001764632],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6432146,"threshold_uncertainty_score":0.9999007,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2008903345","doi":"10.1007/s10586-007-0020-0","title":"An exact parallel algorithm to compare very long biological sequences in clusters of workstations","year":2007,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Workstation; Algorithm; Heuristic; Sequence (biology); Smith–Waterman algorithm; Computation; Dynamic programming; Cluster (spacecraft); Quadratic equation; Time complexity; Parallel computing; Parallel algorithm; Sequence alignment; Mathematics; Artificial intelligence; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.03297818096897284,"gpt":0.3145297221361031,"spread":0.2815515411671303,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001004553,0.0001907393,0.0003046901,0.0002829169,0.0001558632,0.0001276498,0.001142803,0.00006545431,0.000005228207],"category_scores_gemma":[0.00003644377,0.0001646819,0.00005789668,0.0007331612,0.00007250403,0.0005406827,0.0006830362,0.0002151513,0.00001105283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006973337,"about_ca_system_score_gemma":0.00004544457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001578083,"about_ca_topic_score_gemma":0.0001039979,"domain_scores_codex":[0.997947,0.0001501325,0.000582888,0.0005480282,0.0002778923,0.0004940073],"domain_scores_gemma":[0.9985819,0.0004162365,0.0001682299,0.0005381969,0.00009484438,0.0002005772],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005378092,0.0003952627,0.05198571,0.00003368004,0.00002179095,0.000158047,0.006284431,0.1522906,0.0003661817,0.001031022,0.0005280189,0.7868515],"study_design_scores_gemma":[0.0004387737,0.0001262293,0.1124724,0.0001670875,0.000002051971,0.00002218853,0.0004365084,0.8855183,0.0001295566,0.00029799,0.0001403397,0.0002486757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2187607,0.00006631918,0.7802433,0.0001270847,0.0003953012,0.0002013335,0.000004195323,0.00008800293,0.0001137485],"genre_scores_gemma":[0.6046113,0.00000205197,0.394974,0.0003052251,0.00007839792,0.000001671178,0.00001711314,0.000005393185,0.000004774106],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7866029,"threshold_uncertainty_score":0.6715532,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4381734648","doi":"10.1007/s10586-023-04088-6","title":"A BERT-based recommender system for secure blockchain-based cyber physical drug supply chain management","year":2023,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Brandon University; University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer security; Supply chain; Autoencoder; Blockchain; Artificial intelligence; Deep learning; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.01203725937070098,"gpt":0.2480337018784461,"spread":0.2359964425077451,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008865251,0.000315942,0.0003623188,0.0003788299,0.0005972551,0.0001287895,0.001330202,0.0001393905,0.000001773929],"category_scores_gemma":[0.00001536081,0.0003142071,0.0002211386,0.001220468,0.00007482682,0.00002982925,0.0006138,0.0002920267,0.00006933945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00014729,"about_ca_system_score_gemma":0.00005016914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001116274,"about_ca_topic_score_gemma":0.000008940454,"domain_scores_codex":[0.9975655,0.0001231436,0.000402507,0.0008954696,0.0002857105,0.000727679],"domain_scores_gemma":[0.997909,0.0005677241,0.0001870471,0.001100451,0.0001186531,0.0001171323],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009540145,0.001306061,0.001393025,0.002772707,0.0004208616,0.0001425959,0.00721692,0.1826728,0.0002685441,0.5075482,0.08055161,0.2156114],"study_design_scores_gemma":[0.001403633,0.00004265215,0.0001783786,0.0001397429,0.00002296133,0.000005234252,0.0002798705,0.989432,0.0008920261,0.001982726,0.005273979,0.0003468086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1477723,0.000031183,0.832996,0.01436346,0.0004553077,0.001394546,0.00001653291,0.002548499,0.0004222908],"genre_scores_gemma":[0.9459574,2.688694e-7,0.05194954,0.001370454,0.0001818135,0.0003290244,0.00002925714,0.00003797072,0.0001442452],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8067592,"threshold_uncertainty_score":0.999931,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4399047587","doi":"10.1007/s10586-024-04539-8","title":"Improvement in task allocation for VM and reduction of Makespan in IaaS model for cloud computing","year":2024,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"New York Institute of Technology","funders":"","keywords":"Computer science; Cloud computing; Reduction (mathematics); Task (project management); Job shop scheduling; Distributed computing; Operating system; Schedule","retraction":null,"screen_n_in":null,"score":{"opus":0.01944828629269905,"gpt":0.2646706656332221,"spread":0.245222379340523,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001328625,0.0001739239,0.0002523556,0.0003454072,0.0001033307,0.0001572963,0.0003357548,0.00006770293,1.00741e-7],"category_scores_gemma":[0.00003459314,0.000177089,0.00007927063,0.0003968852,0.0000329299,0.0000491239,0.0004774246,0.0001388356,4.452761e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001341834,"about_ca_system_score_gemma":0.00004620647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004061834,"about_ca_topic_score_gemma":0.00001660231,"domain_scores_codex":[0.9982107,0.00004489334,0.0005985084,0.0006198041,0.0001562899,0.0003698476],"domain_scores_gemma":[0.9992348,0.0002567807,0.0001364195,0.0002672316,0.00006292784,0.00004185938],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001819878,0.00006483791,0.0001010129,0.0007049327,0.00001921124,0.000001299431,0.007304853,0.6950262,0.001126248,0.008883929,0.0002065375,0.2865428],"study_design_scores_gemma":[0.0008092319,0.0001198601,0.000216877,0.0005207287,0.000009456906,0.000006269306,0.0002731101,0.9942017,0.0002903243,0.003205405,0.0001643511,0.0001827002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3933899,0.0001840142,0.604414,0.000769865,0.0004867857,0.000634932,0.000001012554,0.00007727815,0.00004211092],"genre_scores_gemma":[0.9335928,0.000001931005,0.06594042,0.0001048333,0.0002252356,0.00001754939,0.000004229896,0.00001830681,0.00009468095],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5402029,"threshold_uncertainty_score":0.7221478,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2589580626","doi":"10.1007/s10586-017-0749-z","title":"A user behavior prediction model based on parallel neural network and k-nearest neighbor algorithms","year":2017,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Human Mobility and Location-Based Analysis","field":"Social Sciences","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China; National Science Foundation","keywords":"Computer science; k-nearest neighbors algorithm; Artificial neural network; Machine learning; Data mining; Artificial intelligence; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.03270691804910043,"gpt":0.3126841976612784,"spread":0.279977279612178,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007293652,0.0001106101,0.0001472144,0.00004141916,0.002910011,0.000421896,0.0002611554,0.00009199875,0.00002486287],"category_scores_gemma":[0.000121201,0.0001101754,0.00007255448,0.00006684678,0.0002497836,0.0001726426,0.00007638626,0.0001662543,0.000006954344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005939521,"about_ca_system_score_gemma":0.00007813147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001352608,"about_ca_topic_score_gemma":0.001839095,"domain_scores_codex":[0.9987829,0.0001562496,0.0001964466,0.0003105826,0.0002590125,0.0002947743],"domain_scores_gemma":[0.999145,0.0001549731,0.0001441107,0.000355426,0.00007870931,0.0001218101],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001664158,0.00006952009,0.09328743,0.000008681805,0.000009041614,0.000002698406,0.001708335,0.8710356,0.00000145485,0.0003277892,0.0004498679,0.03308294],"study_design_scores_gemma":[0.0003181819,0.00002801232,0.08352236,0.00003225907,0.00004094528,1.730975e-7,0.0001473443,0.9153985,4.372084e-7,0.0001200985,0.0002904084,0.0001013324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6852631,0.00003674727,0.3067211,0.003300564,0.0004902587,0.0005774875,0.00001208793,0.0001707053,0.003427971],"genre_scores_gemma":[0.996021,0.000002255909,0.002293636,0.0005550701,0.0007013028,0.00001353197,0.00001187874,0.00001029863,0.000390976],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3107579,"threshold_uncertainty_score":0.9983881,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3012262040","doi":"10.1007/s10586-020-03086-2","title":"Energy-efficient offloading of real-time tasks using cloud computing","year":2020,"lang":"en","type":"article","venue":"Cluster Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Cloudlet; Cloud computing; Distributed computing; Computation offloading; Computation; Energy consumption; Power (physics); Efficient energy use; Embedded system; Real-time computing; Edge computing; Operating system; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.02841494371782515,"gpt":0.2512993307724237,"spread":0.2228843870545986,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008851644,0.0004477498,0.0007351005,0.0002284116,0.0005639642,0.0002711464,0.001627996,0.0001532301,0.000004255314],"category_scores_gemma":[0.0001067743,0.0004771891,0.0002768531,0.001286561,0.0001072542,0.0002249839,0.002695776,0.000352294,0.00004118793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001338874,"about_ca_system_score_gemma":0.0001561828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009893844,"about_ca_topic_score_gemma":2.043086e-7,"domain_scores_codex":[0.9960106,0.0002889467,0.001122556,0.001005364,0.0005948838,0.0009776589],"domain_scores_gemma":[0.9975322,0.0005215995,0.0006960809,0.0006634215,0.0002462726,0.0003403982],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007282012,0.00034356,0.00335969,0.0006258441,0.000284674,0.0001730244,0.03338208,0.7080988,0.1038766,0.005264731,0.009660094,0.1348581],"study_design_scores_gemma":[0.0005974114,0.00008823768,0.0001540144,0.0002825594,0.00002248812,0.00004953254,0.000063656,0.9930531,0.004428387,0.00008824484,0.0006774161,0.0004949464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.339372,0.0000895395,0.6543115,0.0002942528,0.00351825,0.0001294417,3.780898e-7,0.0004232315,0.001861353],"genre_scores_gemma":[0.865393,0.000001599212,0.1295263,0.0008441712,0.004162354,3.772442e-7,0.000004274611,0.00004912904,0.00001872597],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5260211,"threshold_uncertainty_score":0.999768,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4386988816","doi":"10.1007/s10586-023-04135-2","title":"Cost-optimized cloud resource management for video streaming: ARIMA predictive approach","year":2023,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Tech University","funders":"","keywords":"Autoregressive integrated moving average; Computer science; Cloud computing; Resource allocation; Resource (disambiguation); Real-time computing; Autoregressive model; Resource management (computing); Time series; Distributed computing; Machine learning; Computer network; Statistics; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.05677695136068529,"gpt":0.3212358580482851,"spread":0.2644589066875999,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001498002,0.0002641381,0.0003327664,0.0002338223,0.0004527942,0.0004224938,0.001125809,0.00006890586,0.000001706532],"category_scores_gemma":[0.00005387702,0.0002619918,0.0001759571,0.0007064483,0.00005299825,0.000306349,0.001578384,0.0001973105,0.00004316902],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001368768,"about_ca_system_score_gemma":0.00004234471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007455605,"about_ca_topic_score_gemma":3.62537e-7,"domain_scores_codex":[0.9972891,0.0002133195,0.0004954097,0.0008510053,0.0004268403,0.000724341],"domain_scores_gemma":[0.9981746,0.0005807701,0.0002117979,0.0007999655,0.0001028854,0.0001299999],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003464403,0.0007490463,0.0003067727,0.0013989,0.0007885969,0.0001483426,0.02331713,0.3544729,0.00007077315,0.05938606,0.1795272,0.3794878],"study_design_scores_gemma":[0.001963312,0.00009555443,0.0004045249,0.00008404818,0.00003152492,0.00001006566,0.001635808,0.9757252,0.0001236391,0.001071278,0.01855253,0.0003025483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001497649,0.00003154943,0.9848517,0.0009119793,0.000560147,0.001481431,0.000007063723,0.000843228,0.009815282],"genre_scores_gemma":[0.1930142,0.00000531878,0.8001879,0.003395583,0.0008177888,0.0002749978,0.0001137465,0.00006447023,0.002125979],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6212523,"threshold_uncertainty_score":0.9999833,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4379191672","doi":"10.1007/s10586-023-04035-5","title":"A deep learning approach for detecting covert timing channel attacks using sequential data","year":2023,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Convolutional neural network; Deep learning; Covert; Artificial intelligence; Byte; Machine learning; Identification (biology); Channel (broadcasting); Artificial neural network; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.09715234867049774,"gpt":0.316394932100715,"spread":0.2192425834302172,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002211154,0.000298959,0.0004116806,0.0003020535,0.0009832776,0.0006538033,0.001933522,0.0001283943,0.000002376819],"category_scores_gemma":[0.0003035527,0.0003086844,0.0001946562,0.0008929894,0.0000376556,0.0006046673,0.002979087,0.0004368677,0.00001924845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009659325,"about_ca_system_score_gemma":0.00005330437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001932084,"about_ca_topic_score_gemma":0.000009310084,"domain_scores_codex":[0.9968027,0.000186749,0.0006025748,0.001138652,0.0003778407,0.000891417],"domain_scores_gemma":[0.9983934,0.0004245843,0.0003448879,0.000577606,0.0001484687,0.0001110113],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006108643,0.00001732293,0.00007453312,0.00008325918,0.00008614826,0.00001020238,0.003315763,0.9737697,0.000116093,0.0006068229,0.0001250523,0.02178903],"study_design_scores_gemma":[0.0004424619,0.00003503517,0.00001223972,0.00009373986,0.00004520954,0.00005307288,0.0006464814,0.9980005,0.00006697355,0.000009600609,0.0002330482,0.0003616053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0475905,0.00006618394,0.9505169,0.00005526799,0.0006522473,0.0002804261,0.000001691306,0.0006475886,0.000189156],"genre_scores_gemma":[0.8449081,0.000001194363,0.1539928,0.0001599069,0.000718479,0.000004125374,0.00008969418,0.00004239118,0.00008325537],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7973176,"threshold_uncertainty_score":0.9999365,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2195171817","doi":"10.1007/s10586-015-0498-9","title":"An efficient approach to collaborative simulation of variable structure systems on multi-core machines","year":2015,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Computer science; Thread (computing); Speedup; Multi-core processor; Distributed computing; Core (optical fiber); Variable (mathematics); Parallel computing; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.04255906597139433,"gpt":0.300148674526515,"spread":0.2575896085551207,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007989575,0.0002616416,0.0004029621,0.0001786103,0.0001625592,0.0002562632,0.0008769978,0.0001104741,3.495927e-7],"category_scores_gemma":[0.0001127513,0.0002244878,0.00004070207,0.001072607,0.00003162049,0.0001365469,0.0002901808,0.0001600901,0.000009280611],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001029073,"about_ca_system_score_gemma":0.0001294111,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006775586,"about_ca_topic_score_gemma":8.537502e-7,"domain_scores_codex":[0.9976866,0.000321405,0.0005235905,0.0006200837,0.0004930803,0.0003552166],"domain_scores_gemma":[0.9978771,0.0001943191,0.0003187124,0.0007259184,0.0006266954,0.000257316],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000213343,0.000176298,0.0004752983,0.00006395934,0.00001809629,0.000001327168,0.006469752,0.9863014,0.00009826099,0.005613504,0.0002164817,0.0005442817],"study_design_scores_gemma":[0.0007803795,0.0002290441,0.0003405987,0.0001378715,0.00000593617,0.000009484302,0.0004182627,0.997453,0.00002387144,0.00005000274,0.0003029632,0.0002486407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.194801,0.00005183648,0.8024372,0.00001555405,0.001122037,0.0005602984,0.00002790764,0.000178266,0.0008059306],"genre_scores_gemma":[0.8966272,2.403702e-8,0.1029601,0.0001030587,0.0002228012,0.00000334628,0.00003636542,0.00001606894,0.00003101132],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7018263,"threshold_uncertainty_score":0.9154347,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2140520484","doi":"10.1023/b:clus.0000028000.94688.a1","title":"Performance of Fast Routing Algorithms in Large Optical Switches Built on the Vertical Stacking of Banyan Structures","year":2004,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa; University of Waterloo","funders":"Japan Science Society","keywords":"Computer science; Banyan; Stacking; Routing (electronic design automation); Routing algorithm; Algorithm; Optical switch; Parallel computing; Computer network; Optoelectronics; Materials science; Routing protocol; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01275333722278744,"gpt":0.2331464184767993,"spread":0.2203930812540118,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002365719,0.0001776419,0.0002870142,0.00008064255,0.00005946242,0.00001339938,0.0003127706,0.0001126459,0.000002833669],"category_scores_gemma":[0.000178567,0.0001315572,0.00005296122,0.0002891721,0.0001319768,0.00007084919,0.000240088,0.0004798652,0.000001928994],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008797086,"about_ca_system_score_gemma":0.00001122544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002787438,"about_ca_topic_score_gemma":0.000005361082,"domain_scores_codex":[0.9987361,0.0000135656,0.0004379821,0.0001780849,0.0001990725,0.0004352005],"domain_scores_gemma":[0.9992917,0.0003312884,0.00004207675,0.0002715139,0.00003293116,0.00003049807],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001616286,0.00003057144,0.006002194,0.00009590566,0.0000197011,0.000002719138,0.0005516687,0.96434,0.002595464,0.009780801,0.000002087249,0.01656278],"study_design_scores_gemma":[0.0005422759,0.00009533098,0.01729594,0.0004543335,0.000007542338,0.000004390145,0.0005323288,0.9469457,0.03288149,0.001062593,0.000003848426,0.0001742621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9065302,0.00005327827,0.09252001,0.00008678051,0.0001151003,0.0001290522,9.033916e-7,0.0001546104,0.000410056],"genre_scores_gemma":[0.9703749,0.000005638678,0.02950019,0.00003114476,0.00005879908,0.000001722772,9.416303e-7,0.00002611527,5.691636e-7],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06384466,"threshold_uncertainty_score":0.5364746,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3200962337","doi":"10.1007/s10586-021-03395-0","title":"Replication management in peer-to-peer cloud storage systems","year":2021,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Replication (statistics); Cloud computing; Cloud storage; Distributed computing; Load balancing (electrical power); Computer data storage; Peer-to-peer; Popularity; Computer network; Data management; Database; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.02324836695857902,"gpt":0.2641101334585464,"spread":0.2408617664999674,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001106066,0.0001226784,0.000165216,0.0001343161,0.0001141968,0.0003745626,0.0006103554,0.000041815,0.000001108234],"category_scores_gemma":[0.00008643689,0.0001338521,0.0000550291,0.0005200593,0.000007293643,0.0001442168,0.0008875723,0.000161566,0.00007477964],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001393021,"about_ca_system_score_gemma":0.00002486332,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004478264,"about_ca_topic_score_gemma":0.000007249351,"domain_scores_codex":[0.9981066,0.0001472238,0.0003186197,0.0006759833,0.0004622513,0.0002892997],"domain_scores_gemma":[0.9983932,0.00007681565,0.0000754793,0.001129636,0.0002442839,0.00008061039],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003308347,0.0004802941,0.005920847,0.000441783,0.0001701006,0.001440383,0.01203064,0.4900154,0.002211523,0.1085383,0.06658731,0.3121303],"study_design_scores_gemma":[0.0004195297,0.00001815778,0.00296463,0.0001694195,0.000005685188,0.00005882236,0.0003412508,0.973335,0.00006901964,0.0001321379,0.02226377,0.0002226057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1872272,0.0001763409,0.8014519,0.00440604,0.001934204,0.0002385391,6.785647e-7,0.0001910977,0.00437401],"genre_scores_gemma":[0.9838748,0.000001710837,0.008221623,0.001271628,0.0002196329,0.000009300126,0.00000819201,0.00001079052,0.006382324],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7966475,"threshold_uncertainty_score":0.5458331,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030619444","doi":"10.1007/s10586-012-0213-z","title":"Research trends in cloud, cluster and grid computing","year":2012,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Cloud computing; Cluster (spacecraft); Grid; Distributed computing; Grid computing; Computational science; Operating system; Geology","retraction":null,"screen_n_in":null,"score":{"opus":0.05719016452680532,"gpt":0.3430372837340717,"spread":0.2858471192072664,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005856371,0.0003287407,0.0004603347,0.0008409334,0.0005237101,0.0005023275,0.001192862,0.000181336,0.000006395563],"category_scores_gemma":[0.000084364,0.0003209076,0.0000957895,0.002017839,0.0001646709,0.0005829744,0.002402294,0.0008445231,0.000086764],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001532923,"about_ca_system_score_gemma":0.00004136167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001180601,"about_ca_topic_score_gemma":0.00001348649,"domain_scores_codex":[0.9951978,0.0009998708,0.0007446381,0.0007668186,0.0006361948,0.001654722],"domain_scores_gemma":[0.997601,0.0009790525,0.0001850257,0.0007391426,0.0001488803,0.0003468882],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008071763,0.0009223243,0.2579042,0.000501245,0.0001413663,0.0001105691,0.0669161,0.05113816,0.0001614104,0.03931689,0.07662947,0.5061776],"study_design_scores_gemma":[0.001502682,0.00009475987,0.05303765,0.0003401417,0.000005477724,0.0002730308,0.000511907,0.9244166,0.00002977381,0.0002717832,0.01891237,0.0006038506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5022164,0.001047048,0.4826868,0.001198538,0.003707378,0.0002866309,0.000002890842,0.0003582583,0.008496088],"genre_scores_gemma":[0.9853557,0.00000277007,0.01158746,0.0004375742,0.002340482,0.00000293326,0.00001400353,0.00002813525,0.0002309567],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8732784,"threshold_uncertainty_score":0.9999243,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3173206457","doi":"10.1007/s10586-021-03339-8","title":"A classification of hadoop job schedulers based on performance optimization approaches","year":2021,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Job scheduler; Scheduling (production processes); Job queue; Execution time; Task (project management); Distributed computing; Job performance; Cloud computing; Operating system; Mathematical optimization; Job satisfaction; Management","retraction":null,"screen_n_in":null,"score":{"opus":0.0444108137307679,"gpt":0.2311555227440832,"spread":0.1867447090133153,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004692485,0.0001465688,0.0001778978,0.0001392617,0.0001951146,0.0001190685,0.0005124653,0.00005772365,0.000003320648],"category_scores_gemma":[0.00005245738,0.0001426228,0.00008212151,0.0006234689,0.0000410643,0.00003574087,0.000367601,0.0001491521,0.000008564729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005749996,"about_ca_system_score_gemma":0.00006934442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001708566,"about_ca_topic_score_gemma":3.396897e-7,"domain_scores_codex":[0.9984881,0.000142062,0.000334182,0.0004673219,0.0003288665,0.0002394968],"domain_scores_gemma":[0.9988233,0.0001431774,0.0002033054,0.000654988,0.0001214559,0.00005378736],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004820701,0.00007887356,0.001700884,0.00007821142,0.00001086685,0.000002044785,0.0003046092,0.9534706,0.00002752971,0.001757774,0.00006160815,0.04250221],"study_design_scores_gemma":[0.0004255955,0.00005441238,0.009886841,0.0001741624,0.000007495688,0.000004411265,0.00009046625,0.9886599,0.0004205671,0.00001316175,0.0001124998,0.0001504705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2450437,0.00002738322,0.7462833,0.001080595,0.0002339731,0.0001061341,1.866554e-7,0.0001258939,0.007098845],"genre_scores_gemma":[0.8334902,6.059935e-7,0.1659505,0.0003608767,0.00007114393,0.00000226039,0.000004235927,0.0000100047,0.0001101492],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5884465,"threshold_uncertainty_score":0.5815988,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4396214135","doi":"10.1007/s10586-024-04504-5","title":"Forest fire monitoring system supported by unmanned aerial vehicles and edge computing: a performance evaluation using petri nets","year":2024,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Fire Detection and Safety Systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Petri net; Firefighting; Drone; Fire detection; Key (lock); Enhanced Data Rates for GSM Evolution; Edge computing; Variety (cybernetics); Systems engineering; Real-time computing; Distributed computing; Computer security; Artificial intelligence; Architectural engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02002648129740907,"gpt":0.2476591701216259,"spread":0.2276326888242168,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006992788,0.0002493722,0.0002676598,0.0001361399,0.0002948006,0.0002976811,0.0001112448,0.0001318105,0.000002641368],"category_scores_gemma":[0.00001816093,0.0002641246,0.00006120589,0.0003249757,0.00002635377,0.0002135217,0.00008839251,0.0002425601,0.00001651351],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003223035,"about_ca_system_score_gemma":0.00003201803,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003646795,"about_ca_topic_score_gemma":0.000002249785,"domain_scores_codex":[0.998409,0.00009046242,0.0004880918,0.0003346089,0.0003047274,0.0003730553],"domain_scores_gemma":[0.9994792,0.0001150533,0.00006226133,0.00016929,0.00007633912,0.00009786128],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004429969,0.00002039714,0.01428351,0.003910817,0.0002319695,0.00002991327,0.005183148,0.7423556,0.01758267,0.00001944206,0.001839939,0.2144983],"study_design_scores_gemma":[0.0004573807,0.00003289429,0.00350684,0.001283274,0.00004232799,0.0001466454,0.0003985327,0.9917002,0.001400318,8.868966e-7,0.0007657146,0.0002649806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9791772,0.001959631,0.01161208,0.00002213338,0.005588906,0.000404489,0.00000472897,0.0009959869,0.0002347969],"genre_scores_gemma":[0.9984357,0.000008966543,0.0003607444,0.00000747858,0.001077885,0.000004347346,0.00001756534,0.00006473037,0.00002262754],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2493446,"threshold_uncertainty_score":0.9999811,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2064570018","doi":"10.1007/s10586-012-0229-4","title":"The impact of heterogeneous multi-core clusters on graph partitioning: an empirical study","year":2012,"lang":"en","type":"article","venue":"Cluster Computing","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Graph partition; Graph; Core (optical fiber); Empirical research; Theoretical computer science; Statistics; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.06011409574486494,"gpt":0.3468705154706794,"spread":0.2867564197258145,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004166836,0.0001844466,0.0001892147,0.00007574465,0.0001838883,0.0000455476,0.0001930073,0.00006458216,0.000003987607],"category_scores_gemma":[0.00001893589,0.00012764,0.0001322139,0.0001435302,0.0000462936,0.00009765024,0.00006501603,0.0001918916,0.000007218301],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006680631,"about_ca_system_score_gemma":0.000006478128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001715705,"about_ca_topic_score_gemma":0.00000653226,"domain_scores_codex":[0.9989232,0.00009829136,0.0003012693,0.0001382931,0.0001390832,0.0003998945],"domain_scores_gemma":[0.9993031,0.0001489626,0.00005930453,0.0003358368,0.00003358815,0.0001192186],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006686934,0.001167036,0.4095727,0.00004545183,0.0003379998,0.00001044679,0.0148392,0.5474803,0.001114741,0.00001090857,0.001981974,0.02337228],"study_design_scores_gemma":[0.0007125075,0.0009228143,0.1042317,0.00005398793,0.00003039599,0.00003181934,0.0005191574,0.8913107,0.001758396,0.0000507337,0.00004495781,0.0003327756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9509177,0.0001351446,0.04789226,0.000005768612,0.0002106547,0.0003376357,0.000002041228,0.0003619745,0.0001368207],"genre_scores_gemma":[0.9988911,0.000003042074,0.0008597025,0.00003346919,0.0001568716,0.000009459426,0.000003433708,0.0000380759,0.000004811392],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3438303,"threshold_uncertainty_score":0.5205008,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1563694061","doi":"10.1023/a:1012705007864","title":"A Gracefully Degradable Declustered RAID Architecture","year":2002,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Computer science; RAID; Prime (order theory); Control reconfiguration; Parallel computing; Computer hardware; Combinatorics; Mathematics; Embedded system","retraction":null,"screen_n_in":null,"score":{"opus":0.02393951936800257,"gpt":0.2345795418091964,"spread":0.2106400224411938,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002248927,0.0002947778,0.0002923188,0.0002405599,0.0003467074,0.000263027,0.002224562,0.0001263139,0.00002200405],"category_scores_gemma":[0.0002153194,0.0002698371,0.00009688821,0.0007465508,0.0001178078,0.0005793208,0.002185269,0.0004462486,0.0002096153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008853542,"about_ca_system_score_gemma":0.00001439738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006478782,"about_ca_topic_score_gemma":0.000008502831,"domain_scores_codex":[0.997801,0.00008167946,0.0003619769,0.0007447867,0.0003187436,0.0006917948],"domain_scores_gemma":[0.9979573,0.0002627368,0.0001832628,0.00141826,0.00006804118,0.000110338],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007815286,0.0001146578,0.0003661584,0.00005837192,0.00003930603,0.0001748517,0.002146359,0.01278809,0.000634234,0.008106968,0.01908459,0.9564786],"study_design_scores_gemma":[0.0009715956,0.0001281925,0.0001842768,0.00009688392,0.00000867727,0.0004388781,0.00008025861,0.9416392,0.001503488,0.01258637,0.04169464,0.0006675627],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01144925,0.0007218991,0.9801447,0.002705233,0.0004460009,0.0002467447,0.000002766065,0.001911851,0.002371488],"genre_scores_gemma":[0.473895,0.000005533088,0.5244108,0.001037484,0.00009424892,0.000006135019,0.000002899614,0.00002267874,0.0005251586],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.955811,"threshold_uncertainty_score":0.9999754,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2059124748","doi":"10.1007/s10586-008-0065-8","title":"Efficient shared memory and RDMA based collectives on multi-rail QsNetII SMP clusters","year":2008,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Remote direct memory access; Computer science; Parallel computing; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.02921077623922019,"gpt":0.2404557084751162,"spread":0.211244932235896,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004609964,0.0002609623,0.0003143128,0.0002225206,0.0007452952,0.0002017804,0.0004770616,0.0001030258,0.000009560654],"category_scores_gemma":[0.0000591586,0.0002406385,0.0001103575,0.0004074262,0.00009549731,0.00008632087,0.0003485699,0.0002398378,0.00003477731],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001188535,"about_ca_system_score_gemma":0.00006500555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003657422,"about_ca_topic_score_gemma":0.00001229726,"domain_scores_codex":[0.9978673,0.0002730227,0.0004100722,0.0006985171,0.0003013008,0.0004497879],"domain_scores_gemma":[0.9986495,0.0004359341,0.0001749816,0.0004619287,0.0001251739,0.0001524286],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009554641,0.0003349679,0.001760883,0.00009333817,0.00006736177,0.0001299247,0.01597841,0.9603463,0.0002072157,0.000338746,0.008599712,0.01204757],"study_design_scores_gemma":[0.001584583,0.0001689424,0.00506025,0.0001673295,0.000003632299,0.0001025634,0.000150477,0.9918882,0.0001306863,0.000004829825,0.0004547391,0.0002837195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3397562,0.0001094313,0.6557298,0.0003835736,0.001435619,0.0003706985,0.0000015411,0.0002382201,0.001974924],"genre_scores_gemma":[0.9802104,0.000001098844,0.01726959,0.001642868,0.000230944,0.000009847329,0.000001790222,0.00002094321,0.0006125133],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6404542,"threshold_uncertainty_score":0.9812952,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W86735328","doi":"","title":"Overlap of computation and communication on shared-memory networks-of-workstations","year":2001,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Asynchronous communication; Parallel computing; Latency (audio); Computation; Distributed memory; Shared memory; Workstation; Multiprocessing; Compiler; Transformation (genetics); CAS latency; Uniform memory access; Data access; Distributed shared memory; Memory model; Memory management; Operating system; Algorithm; Computer network; Semiconductor memory; Memory controller","retraction":null,"screen_n_in":null,"score":{"opus":0.02014397322436733,"gpt":0.2807855264591947,"spread":0.2606415532348274,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004299172,0.0001247517,0.0002129326,0.0001787928,0.0001720922,0.00006815009,0.0004474458,0.00006677549,0.000001876789],"category_scores_gemma":[0.00004826623,0.0001316905,0.00004825867,0.0004689276,0.00007683855,0.0002170322,0.0003522135,0.0001440418,0.000001692791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002364428,"about_ca_system_score_gemma":0.00002344815,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001543667,"about_ca_topic_score_gemma":0.000001456764,"domain_scores_codex":[0.9988032,0.0001631902,0.0004465301,0.0002476811,0.0001748205,0.0001645515],"domain_scores_gemma":[0.9984392,0.0005252613,0.0003798349,0.0004129097,0.0001942362,0.00004856853],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001105107,0.00007051753,0.002031386,0.00002413434,0.00001376302,9.118725e-7,0.00118875,0.9232352,0.00002581642,0.006333562,0.0005804059,0.06648455],"study_design_scores_gemma":[0.0003210518,0.00007919273,0.006172685,0.0002078,0.000005057333,0.00001126098,0.00004865846,0.9917445,0.0001032804,0.001128623,0.00005946443,0.0001184347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05007029,0.0002422617,0.9467285,0.0002795305,0.0000938563,0.0001720174,7.749259e-7,0.0001941793,0.002218553],"genre_scores_gemma":[0.7495127,0.00004425916,0.2501719,0.0002070115,0.00002209488,0.000001557269,0.00001073722,0.000007525567,0.00002216315],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6994424,"threshold_uncertainty_score":0.5370184,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2085059901","doi":"10.1007/s10586-009-0076-0","title":"On GPU’s viability as a middleware accelerator","year":2009,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Nvidia","keywords":"Computer science; Implementation; Exploit; Middleware (distributed applications); Erasure code; Graphics; Embedded system; Distributed computing; Operating system; Decoding methods; Software engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01869700881954955,"gpt":0.2505568737334214,"spread":0.2318598649138718,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003467053,0.0001788778,0.0001900665,0.0000858488,0.0002575826,0.0003137379,0.0008258919,0.00006341653,0.000008610819],"category_scores_gemma":[0.00009835164,0.0001654387,0.0001211861,0.0002386371,0.00001956543,0.0002382845,0.0002602292,0.0002552603,0.0002048685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007726221,"about_ca_system_score_gemma":0.00004644325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001990864,"about_ca_topic_score_gemma":0.000001528264,"domain_scores_codex":[0.9984708,0.0001106128,0.0002521554,0.0005380817,0.000273571,0.0003548162],"domain_scores_gemma":[0.9988297,0.0001997477,0.00008155269,0.0006871404,0.00008053822,0.0001213134],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001390929,0.001013699,0.002763368,0.00007175808,0.00006813584,0.0002261307,0.006852194,0.01002105,0.003554774,0.08786842,0.01294694,0.8744744],"study_design_scores_gemma":[0.001178255,0.0006813978,0.009043603,0.0001951123,0.000009361437,0.00008304518,0.00007552551,0.9697045,0.0008390879,0.01621452,0.001322602,0.0006529688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8122978,0.00005493811,0.1785714,0.002129555,0.0006229144,0.0001710872,6.153373e-7,0.0004682733,0.005683431],"genre_scores_gemma":[0.9880981,5.124447e-7,0.002575126,0.008938945,0.0001745465,0.000001123949,0.000001376102,0.000006602721,0.0002036281],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9596835,"threshold_uncertainty_score":0.6746395,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4392348357","doi":"10.1007/s10586-024-04317-6","title":"Improving the quality of real-time data transmission service in VANETS by balancing the load on road side units","year":2024,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Computer network; Quality of service; Vehicular ad hoc network; Scalability; Network congestion; Network packet; Packet loss; Load balancing (electrical power); Wireless ad hoc network; Wireless; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.021932957093232,"gpt":0.2594499930540071,"spread":0.2375170359607751,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002192767,0.0002335242,0.0002715888,0.0000479562,0.0001132643,0.0001082958,0.0008272254,0.0001041563,0.000008947078],"category_scores_gemma":[0.00005760675,0.0001566581,0.00004219732,0.0006490395,0.00002757068,0.0001532573,0.0003325093,0.0005922088,0.00002453842],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001574716,"about_ca_system_score_gemma":0.00006900649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001057263,"about_ca_topic_score_gemma":0.0002506451,"domain_scores_codex":[0.9979907,0.0002796283,0.0005633302,0.0003820118,0.0003645958,0.0004197306],"domain_scores_gemma":[0.9980563,0.0008919816,0.00007197182,0.0008693989,0.00005263743,0.00005772424],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000154824,0.000009649769,0.00003238436,0.0003996202,0.00002973095,0.00000916717,0.001924512,0.9060194,0.01900236,0.00001300063,0.001920252,0.07062439],"study_design_scores_gemma":[0.0002483028,0.00001492369,0.0006135381,0.0007660441,0.00002073219,0.00001077653,0.0001706003,0.9954665,0.0005916457,0.00001361928,0.001904495,0.0001788753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9702392,0.00224057,0.02324768,0.0008247367,0.0004169965,0.0005144358,0.00003248533,0.0004280418,0.002055852],"genre_scores_gemma":[0.9988639,0.00003085266,0.00049839,0.0002413577,0.0001894935,0.00000237561,0.00007545867,0.00005883965,0.00003927722],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08944699,"threshold_uncertainty_score":0.6388331,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}