{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":162,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":162,"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":"bd4564b564ce","filters":{"venue":"The Journal of Supercomputing"}},"results":[{"id":"W1564285798","doi":"10.1007/11227.1573-0484","title":"The Journal of Supercomputing","year":2013,"lang":"en","type":"paratext","venue":"The Journal of Supercomputing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":276,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Supercomputer; Parallel computing; Computational science; Data science","retraction":null,"screen_n_in":null,"score":{"opus":0.01591653813637924,"gpt":0.2432204475907962,"spread":0.227303909454417,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.01309368,0.0007340678,0.001520839,0.0004234329,0.001377619,0.001133253,0.01004626,0.0003878066,0.00006330404],"category_scores_gemma":[0.0004502977,0.0003878295,0.0008377261,0.0009273758,0.000287096,0.0008443232,0.001318108,0.003263072,0.0005137379],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002500229,"about_ca_system_score_gemma":0.00104857,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001607867,"about_ca_topic_score_gemma":0.000003971403,"domain_scores_codex":[0.9904114,0.002464501,0.003804294,0.0002993185,0.001902525,0.001117935],"domain_scores_gemma":[0.986713,0.004919653,0.004302537,0.001216184,0.002510188,0.0003384741],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006688407,0.0001391513,0.00009729395,0.0002291644,0.0009293443,0.00008248377,0.008608923,0.08079856,0.0006201854,0.0006096518,0.8596569,0.04816147],"study_design_scores_gemma":[0.003167234,0.002213501,0.0005635361,0.008024362,0.0007040785,0.03167526,0.005099204,0.1630813,0.0007073249,0.001354142,0.7812705,0.002139559],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0823569,0.04122835,0.8309072,0.002651751,0.03393295,0.0005855279,0.00001735446,0.00006189909,0.00825802],"genre_scores_gemma":[0.9687243,0.002538488,0.01028504,0.0004525107,0.0124621,9.172934e-7,0.00001071294,0.0001329273,0.00539306],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8863673,"threshold_uncertainty_score":0.9999225,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2003224378","doi":"10.1007/s11227-014-1161-6","title":"UAV-assisted data gathering in wireless sensor networks","year":2014,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":166,"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; Wireless sensor network; Key distribution in wireless sensor networks; Process (computing); Data collection; Real-time computing; Visual sensor network; Computer network; Mobile wireless sensor network; Wireless; Wireless network; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01877998752770289,"gpt":0.2197781669417545,"spread":0.2009981794140516,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000970651,0.00007179234,0.0001288905,0.00005373771,0.00005803997,0.00002812165,0.0003714555,0.00003542426,0.000006940168],"category_scores_gemma":[0.0000187169,0.00005301287,0.00001906741,0.0001908515,0.000014252,0.000141452,0.00006306419,0.0002336491,0.000002194941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002437774,"about_ca_system_score_gemma":0.000005733307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001826296,"about_ca_topic_score_gemma":0.00001677402,"domain_scores_codex":[0.9993516,0.0000542274,0.0003160614,0.00005338438,0.00008860644,0.0001361577],"domain_scores_gemma":[0.9994576,0.000160066,0.00005413276,0.0002631565,0.0000356257,0.00002940251],"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.000002784188,0.000008022203,0.0009590411,0.000007997482,0.0000107558,8.361527e-7,0.0002549183,0.9668787,0.001574919,0.00003496111,0.0001038557,0.03016326],"study_design_scores_gemma":[0.0001735983,0.000007787268,0.005440147,0.00006865212,0.00001250526,0.00005886977,0.000216012,0.9935855,0.00007829476,0.00001302524,0.0002840694,0.00006156694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5854636,0.0001134248,0.4138925,0.0000601354,0.0001074273,0.0000343729,4.555335e-7,0.00002385289,0.0003042575],"genre_scores_gemma":[0.9912224,0.00009561414,0.008387437,0.00002467224,0.0002442826,2.22298e-7,0.000003566484,0.00001881387,0.00000297054],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4057588,"threshold_uncertainty_score":0.2161802,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4380714981","doi":"10.1007/s11227-023-05439-1","title":"DialogueINAB: an interaction neural network based on attitudes and behaviors of interlocutors for dialogue emotion recognition","year":2023,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"National Natural Science Foundation of China","keywords":"Conversation; Computer science; Emotion recognition; Focus (optics); Perception; Comprehension; Classifier (UML); Cognitive psychology; Human–computer interaction; Artificial intelligence; Psychology; Communication","retraction":null,"screen_n_in":null,"score":{"opus":0.05491289198521056,"gpt":0.3106297191072561,"spread":0.2557168271220456,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001658801,0.00008848726,0.0001821453,0.0002207547,0.0001643444,0.00007641965,0.0002607543,0.00003176234,0.000002519938],"category_scores_gemma":[0.00005935209,0.00006345784,0.0001039093,0.0003315923,0.00002829689,0.0004670798,0.00005856077,0.0001345334,9.736807e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002108488,"about_ca_system_score_gemma":0.00001456962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002686704,"about_ca_topic_score_gemma":0.00000796394,"domain_scores_codex":[0.9989398,0.0002009678,0.0004090997,0.00011288,0.000187389,0.0001498348],"domain_scores_gemma":[0.9989584,0.0004789027,0.0002535467,0.0001270223,0.0001385049,0.00004358884],"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.0002700072,0.0003154745,0.06238332,0.00009639076,0.0001486252,0.00001431969,0.008242145,0.4764617,0.009139224,0.0003319043,0.0007676782,0.4418292],"study_design_scores_gemma":[0.0003810762,0.0006480718,0.0400351,0.0002347058,0.00005184078,0.00001611375,0.0004379475,0.9570333,0.0008178758,0.0002463586,0.0000110205,0.00008660072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9355336,0.0000217158,0.06335282,0.0002636488,0.0007233137,0.00007729496,0.000001274397,0.00002204405,0.000004263386],"genre_scores_gemma":[0.9950114,0.00001363963,0.004505657,0.00007070803,0.0003722351,7.620716e-7,0.00001704922,0.000007199289,0.000001362142],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4805716,"threshold_uncertainty_score":0.2587736,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4386422441","doi":"10.1007/s11227-023-05592-7","title":"SiMaLSTM-SNP: novel semantic relatedness learning model preserving both Siamese networks and membrane computing","year":2023,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Topic Modeling","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Artificial intelligence; Natural language processing; Sentence; Task (project management); Semantic similarity; Deep learning; State (computer science); Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.03696003122406642,"gpt":0.2623467247583791,"spread":0.2253866935343126,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004728584,0.0002437661,0.0004235855,0.0002575364,0.0007227937,0.0002761266,0.001441514,0.0001113227,0.000002147636],"category_scores_gemma":[0.0002770131,0.000184816,0.0001129284,0.0007613846,0.00008056672,0.0007825022,0.001416292,0.001162351,0.000004676752],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005117515,"about_ca_system_score_gemma":0.00007500863,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004721564,"about_ca_topic_score_gemma":0.000002330622,"domain_scores_codex":[0.9974139,0.0002531563,0.0008374227,0.0003023386,0.0005425703,0.000650593],"domain_scores_gemma":[0.9978361,0.0009998793,0.0004080101,0.000416797,0.0001847109,0.0001545077],"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.000007239992,0.00001719735,0.0007097754,0.00004156823,0.00004200554,0.00002695746,0.005704857,0.9793321,0.003167468,0.0006161719,0.00002742562,0.01030718],"study_design_scores_gemma":[0.000476514,0.00005288468,0.00036761,0.0004748918,0.00003779191,0.0004917119,0.001282615,0.9960704,0.00009382282,0.0004285818,0.00002140047,0.0002017841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4700805,0.0003959757,0.5285379,0.0004913604,0.0002245303,0.00006230988,9.462737e-8,0.0001087995,0.00009858944],"genre_scores_gemma":[0.9707901,0.0001570997,0.02845108,0.0001421414,0.0003382064,2.103164e-7,4.934074e-7,0.00003524851,0.00008537154],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5007097,"threshold_uncertainty_score":0.7536578,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2058513528","doi":"10.1007/s11227-009-0321-6","title":"Context-aware cross-layer optimized video streaming in wireless multimedia sensor networks","year":2009,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Energy Efficient Wireless Sensor Networks","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":"St. Francis Xavier University","funders":"","keywords":"Computer science; Computer network; Routing (electronic design automation); Geographic routing; Real-time computing; Path (computing); Node (physics); Transmission (telecommunications); Context (archaeology); Routing protocol; Distributed computing; Dynamic Source Routing; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01528655477426986,"gpt":0.2585850917082789,"spread":0.243298536934009,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00245746,0.0003337994,0.000617512,0.0002629656,0.000306236,0.0002959185,0.001823829,0.000178579,0.000007543345],"category_scores_gemma":[0.0001106019,0.0002410536,0.0002097094,0.0007595717,0.0001220914,0.0007070163,0.0002464276,0.001113219,0.000005078461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001516144,"about_ca_system_score_gemma":0.00007977524,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006565321,"about_ca_topic_score_gemma":0.00001664152,"domain_scores_codex":[0.996581,0.0005307369,0.001188849,0.0003179667,0.0006042097,0.0007772387],"domain_scores_gemma":[0.9969488,0.001436483,0.0005247738,0.0005582531,0.0003432033,0.0001884816],"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.00006487898,0.0000946958,0.001986614,0.000003464538,0.00002383476,0.0001537813,0.001607256,0.9279501,0.0009169515,0.0001960557,0.00007224945,0.06693008],"study_design_scores_gemma":[0.001759278,0.0001264248,0.008069121,0.0003502344,0.0000157874,0.0004002589,0.0003828278,0.9876407,0.0009245299,0.00003418608,0.00002868256,0.0002679581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5844101,0.0004191514,0.4138274,0.0005311559,0.0005809071,0.00009727175,2.973076e-7,0.00005619438,0.0000775447],"genre_scores_gemma":[0.9670561,0.00009736997,0.03152179,0.0006598196,0.0006149912,4.417663e-7,0.000001027616,0.00002367648,0.00002477052],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.382646,"threshold_uncertainty_score":0.9829879,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2981340892","doi":"10.1007/s11227-019-03028-9","title":"Threats on the horizon: understanding security threats in the era of cyber-physical systems","year":2019,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Information and Cyber Security","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Computer security; Computer science; Vulnerability (computing); Asset (computer security); Cyber-physical system; Physical security; Usability; Hacker; Internet privacy","retraction":null,"screen_n_in":null,"score":{"opus":0.03878453997431759,"gpt":0.2648093566481098,"spread":0.2260248166737923,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003739066,0.0001428181,0.0002760968,0.00007415315,0.0002258407,0.0001722096,0.001606134,0.00004485359,0.000004611776],"category_scores_gemma":[0.00003113082,0.00006268665,0.0001368357,0.0004434118,0.00007091147,0.0005378749,0.0001662051,0.0008518888,0.00001875839],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001090724,"about_ca_system_score_gemma":0.00007428011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003886477,"about_ca_topic_score_gemma":0.000006380114,"domain_scores_codex":[0.9978853,0.0005182313,0.0005242023,0.00009793367,0.0007213842,0.0002529853],"domain_scores_gemma":[0.9977352,0.001287746,0.0003313965,0.0005020179,0.0001083438,0.00003532054],"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.00003747865,0.0001411337,0.001144885,0.00004381024,0.00005203019,0.00001039575,0.1095441,0.004759813,0.0001857258,0.8803535,0.000257787,0.00346935],"study_design_scores_gemma":[0.002603199,0.002032116,0.009425593,0.002050169,0.0000849915,0.001343677,0.1040322,0.6821175,0.001776649,0.1935757,0.0002696401,0.0006885754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9786111,0.0002648854,0.01079245,0.003302241,0.0005685023,0.0002517839,9.103032e-7,0.00001341643,0.006194682],"genre_scores_gemma":[0.9993712,0.0000349561,0.00006579757,0.0003201771,0.0001955639,5.516973e-7,2.144891e-7,0.000005311706,0.000006184358],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6867778,"threshold_uncertainty_score":0.370108,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2464411218","doi":"10.1007/s11227-016-1806-8","title":"A novel fruit fly framework for multi-objective shape design of tubular linear synchronous motor","year":2016,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":64,"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":"Initialization; Benchmark (surveying); Computer science; Convergence (economics); Point (geometry); Feature (linguistics); Mathematical optimization; Population; Optimization algorithm; Interior point method; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04898033443481277,"gpt":0.3018930977565338,"spread":0.2529127633217211,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001719433,0.0002427463,0.0004539652,0.0002082144,0.0002421037,0.00003781103,0.001332772,0.0001149682,0.00001040449],"category_scores_gemma":[0.001464691,0.0001441875,0.0001986084,0.0003899175,0.0001441447,0.0007259633,0.0002634382,0.0002951444,0.000005551768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001856938,"about_ca_system_score_gemma":0.0002188741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006339093,"about_ca_topic_score_gemma":4.428448e-7,"domain_scores_codex":[0.997936,0.000206938,0.000781727,0.0002663667,0.000410327,0.0003986356],"domain_scores_gemma":[0.9948607,0.002809072,0.0006756342,0.0004225713,0.001111768,0.0001202182],"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.000497024,0.0009556719,0.0002405414,0.00008024469,0.00059778,0.00002965865,0.01648599,0.4235523,0.3622454,0.006244125,0.00004823098,0.189023],"study_design_scores_gemma":[0.001926346,0.0006166734,0.0004255126,0.0004141668,0.0000407217,0.0002492337,0.000255387,0.9773001,0.01702105,0.00149567,0.00002944346,0.0002256727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007462626,0.0002854308,0.9908703,0.0003174536,0.0004961596,0.0005071944,0.000009811409,0.0000464453,0.000004590976],"genre_scores_gemma":[0.2191131,0.00003793911,0.7804195,0.0001012311,0.0002804667,0.000003775767,1.491882e-7,0.00002905681,0.00001482902],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5537478,"threshold_uncertainty_score":0.5879796,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4388565318","doi":"10.1007/s11227-023-05764-5","title":"ICS-IDS: application of big data analysis in AI-based intrusion detection systems to identify cyberattacks in ICS networks","year":2023,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Moncton","funders":"","keywords":"Computer science; Intrusion detection system; Data mining; Component (thermodynamics); Industrial control system; Artificial intelligence; Machine learning; Normalization (sociology); Curse of dimensionality; Control (management)","retraction":null,"screen_n_in":null,"score":{"opus":0.03874495637911218,"gpt":0.3072545786417354,"spread":0.2685096222626232,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005932076,0.0001281282,0.0003617636,0.001268654,0.0001439575,0.0001257112,0.001216618,0.0001072794,0.000001044203],"category_scores_gemma":[0.00008894195,0.0001038694,0.00008233204,0.006743835,0.00002656721,0.0005014188,0.000531576,0.0005303229,0.00000464545],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000128172,"about_ca_system_score_gemma":0.00005333006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008529919,"about_ca_topic_score_gemma":0.001125657,"domain_scores_codex":[0.9974986,0.0005037183,0.001010457,0.0002589784,0.000463155,0.000265121],"domain_scores_gemma":[0.9983146,0.0004333707,0.0003797274,0.0005994494,0.0002062016,0.00006669301],"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.00003461098,0.00003667424,0.004603089,0.00001779061,0.00003213799,0.000005518888,0.0006303829,0.8830893,0.004051,0.00003188448,0.00005742309,0.1074102],"study_design_scores_gemma":[0.0002649282,0.00008104349,0.01758395,0.0001550067,0.00004327334,0.00001647656,0.0002006665,0.9805353,0.0008074324,0.0001160019,0.00009706903,0.00009887307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4405906,0.0001106689,0.5583785,0.0002240384,0.0005537547,0.0001175735,8.036745e-7,0.00001975374,0.000004286591],"genre_scores_gemma":[0.9987369,0.00006787748,0.0006581463,0.0001100225,0.0004083746,0.000001986698,0.000006516116,0.000008837585,0.00000137153],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5581462,"threshold_uncertainty_score":0.4235671,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2241877823","doi":"10.1007/s11227-015-1541-6","title":"Improving the classification performance of biological imbalanced datasets by swarm optimization algorithms","year":2015,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University","funders":"Universidade de Macau","keywords":"Computer science; Machine learning; Artificial intelligence; Class (philosophy); Data mining; Swarm behaviour; Particle swarm optimization; Population; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.05449515389303571,"gpt":0.2758229984584579,"spread":0.2213278445654222,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00339906,0.0001240642,0.0001984412,0.0000738469,0.0001744598,0.0000792083,0.001990456,0.00006271142,0.000001495679],"category_scores_gemma":[0.0002863323,0.00006636471,0.00004432718,0.0004084021,0.0001454266,0.0008291897,0.0003031202,0.0002997823,0.000002554921],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007914764,"about_ca_system_score_gemma":0.0001097974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001750879,"about_ca_topic_score_gemma":1.711429e-7,"domain_scores_codex":[0.9982619,0.0002950112,0.0006634051,0.0001528246,0.0004269679,0.0001998858],"domain_scores_gemma":[0.9979271,0.0002748324,0.0007399307,0.0006177272,0.0003734821,0.00006687917],"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.0002743443,0.0006352463,0.01013491,0.0001036742,0.0001642202,0.000007118439,0.007931906,0.109802,0.3921455,0.004684436,0.04302894,0.4310877],"study_design_scores_gemma":[0.0003063572,0.0002406945,0.001987632,0.00004199712,0.00001229121,0.0001188498,0.0003727971,0.9635275,0.0327244,0.00008184827,0.0004775185,0.0001080907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1553313,0.0002286433,0.8432104,0.0008124494,0.0001932039,0.000126517,0.00001617204,0.00004722911,0.00003410719],"genre_scores_gemma":[0.8659882,0.0001330672,0.1335939,0.0001361442,0.0001029732,0.000001641956,0.00003402034,0.000006866027,0.000003259123],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8537256,"threshold_uncertainty_score":0.3698796,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006741433","doi":"10.1007/s11227-014-1195-9","title":"GAER: genetic algorithm-based energy-efficient routing protocol for infrastructure-less opportunistic networks","year":2014,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Routing protocol; Hop (telecommunications); Latency (audio); Zone Routing Protocol; Distance-vector routing protocol; Distributed computing; Routing (electronic design automation); Wireless Routing Protocol; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02180578335023805,"gpt":0.2538559763131712,"spread":0.2320501929629331,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002846123,0.0003236406,0.0004914238,0.0001389103,0.0005876235,0.0002548706,0.001623925,0.0001322025,0.000008526328],"category_scores_gemma":[0.0000451271,0.0002177058,0.0002346017,0.0003359416,0.0001214758,0.0001360834,0.0002614208,0.0004485004,9.32352e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008019556,"about_ca_system_score_gemma":0.0003173568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000144521,"about_ca_topic_score_gemma":8.550426e-7,"domain_scores_codex":[0.9969296,0.0003912542,0.001141593,0.0002915704,0.0005646626,0.0006813378],"domain_scores_gemma":[0.9966648,0.001269626,0.0007729343,0.0005552227,0.0004501798,0.0002873028],"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.00003575273,0.00005407216,0.000113269,0.00002248408,0.00002672506,0.00001757275,0.0001717166,0.4634582,0.00002114609,0.00241135,0.0008203133,0.5328474],"study_design_scores_gemma":[0.001346457,0.0003290854,0.0001970816,0.0002353187,0.00004584382,0.0003289177,0.0000743385,0.9936157,0.000031548,0.00121139,0.002319273,0.0002650335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008361831,0.00002458154,0.9916993,0.0002347885,0.0006769443,0.006250269,0.000001722156,0.00006235491,0.0002138693],"genre_scores_gemma":[0.77593,0.000001883669,0.2206524,0.00095429,0.001684318,0.0007193293,0.000002618195,0.00003886822,0.00001623432],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7750939,"threshold_uncertainty_score":0.8877784,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1990025926","doi":"10.1023/b:supe.0000014804.20789.21","title":"Run-Time Support for the Automatic Parallelization of Java Programs","year":2004,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"University of Toronto","keywords":"Computer science; Thread (computing); Parallel computing; Java; Speedup; Compiler; Multiprocessing; Asynchronous communication; Pointer (user interface); Just-in-time compilation; Runtime system; Automatic parallelization; Java concurrency; Operating system; Real time Java","retraction":null,"screen_n_in":null,"score":{"opus":0.02124895608210092,"gpt":0.2636631251575013,"spread":0.2424141690754004,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002338636,0.000122809,0.0002324752,0.00009259226,0.0002760722,0.00009066599,0.001337275,0.00004526969,0.000003967652],"category_scores_gemma":[0.0001217668,0.00006806388,0.0001488537,0.0003451078,0.00007793333,0.0002887203,0.000152248,0.0001563593,0.000003405963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004146849,"about_ca_system_score_gemma":0.0001547597,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001483195,"about_ca_topic_score_gemma":6.779708e-7,"domain_scores_codex":[0.9985493,0.0001074561,0.0006831255,0.0001005141,0.000337185,0.0002223823],"domain_scores_gemma":[0.998306,0.000434419,0.0004986867,0.0003287963,0.0003875778,0.00004454332],"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.00003131797,0.000286688,0.0005130859,0.00009974925,0.0001834441,0.000004912315,0.01062465,0.7946919,0.001491181,0.01147061,0.001497906,0.1791045],"study_design_scores_gemma":[0.0007599987,0.0005633341,0.0007920889,0.0002208197,0.00005759881,0.0002519956,0.0001504798,0.9880169,0.002625545,0.00597729,0.0004363994,0.0001475612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04054628,0.0002122957,0.9572188,0.001361503,0.0001674738,0.0002882771,3.346509e-7,0.0001033535,0.0001016993],"genre_scores_gemma":[0.7061565,0.00003512456,0.2935136,0.0001431119,0.0001145282,0.000001747989,0.000001071683,0.0000100783,0.00002427376],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6656102,"threshold_uncertainty_score":0.2775565,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068300465","doi":"10.1007/s11227-008-0184-2","title":"Scalable and efficient key management for heterogeneous sensor networks","year":2008,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University; Acadia University","funders":"Higher Education Commision, Pakistan; Higher Education Commission, Pakistan; Acadia University","keywords":"Computer science; Scalability; Wireless sensor network; Key management; Key (lock); Distributed computing; Hash function; Computer network; Overhead (engineering); Key generation; Hash chain; Encryption; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.01707679819292564,"gpt":0.2226535227446218,"spread":0.2055767245516962,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001073019,0.0001573155,0.0002565137,0.00009575712,0.0004950369,0.00008348759,0.0007756442,0.00005519899,0.000001656281],"category_scores_gemma":[0.00002055105,0.0001111597,0.00010869,0.0002244978,0.0001004044,0.0001199039,0.0003158404,0.0002554103,0.000002053743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004498906,"about_ca_system_score_gemma":0.00001536097,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005739269,"about_ca_topic_score_gemma":6.48242e-7,"domain_scores_codex":[0.9985085,0.0001316685,0.0004657821,0.0001713443,0.0003151389,0.0004075481],"domain_scores_gemma":[0.9986712,0.0005460198,0.0001943677,0.0003195259,0.0001584711,0.0001104365],"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.0000297459,0.00005298977,0.0002568489,0.0000209847,0.0000774627,0.0001110729,0.002395219,0.9841201,0.00008439453,0.0008226084,0.0005250557,0.01150353],"study_design_scores_gemma":[0.0005680451,0.0001253249,0.0004798078,0.00008526416,0.00003036263,0.003944315,0.0001584264,0.9935218,0.000271744,0.0001309571,0.0005430987,0.0001408391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5221676,0.001102354,0.4757806,0.0003058934,0.0004112354,0.0001425451,2.440606e-7,0.00002593016,0.00006352606],"genre_scores_gemma":[0.9380743,0.000313853,0.0608721,0.0003057262,0.0003992665,8.381701e-7,2.217047e-7,0.00001468241,0.00001905258],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4159066,"threshold_uncertainty_score":0.4532962,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4390262813","doi":"10.1007/s11227-023-05846-4","title":"Exploring privacy measurement in federated learning","year":2023,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Confidentiality; Information privacy; Privacy by Design; Field (mathematics); Data science; Computer security; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.215619421984535,"gpt":0.2934067596087868,"spread":0.0777873376242518,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.007300109,0.000133098,0.0002240565,0.0004252024,0.0002819769,0.0001747514,0.01352752,0.00004045516,0.000002055542],"category_scores_gemma":[0.0178188,0.00009601672,0.00005682505,0.001577677,0.00003889934,0.001255276,0.02597179,0.0008800083,0.00002819094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001944731,"about_ca_system_score_gemma":0.0000903392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003793753,"about_ca_topic_score_gemma":0.000004745213,"domain_scores_codex":[0.9977434,0.0003282697,0.000577721,0.0001706994,0.0007503893,0.0004295239],"domain_scores_gemma":[0.9976974,0.0004352344,0.0002079073,0.001408836,0.0002027667,0.00004788816],"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.00007891381,0.0002239467,0.03738287,0.0001546421,0.0002641969,0.0009601366,0.01909828,0.068315,0.07857175,0.001028669,0.03487683,0.7590448],"study_design_scores_gemma":[0.001001886,0.0002262605,0.03576725,0.0009410234,0.00001480213,0.0003732127,0.002951166,0.9235286,0.01407631,0.019211,0.001514786,0.000393673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8863657,0.000183716,0.0986413,0.01378002,0.0004891492,0.00007598717,1.187114e-7,0.0003732302,0.00009080915],"genre_scores_gemma":[0.9759048,0.0002280459,0.02371596,0.00004273713,0.00009149993,0.000001328785,2.851302e-7,0.00001267972,0.000002666528],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8552136,"threshold_uncertainty_score":0.9918098,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4205740225","doi":"10.1007/s11227-021-04231-3","title":"LBTM: A lightweight blockchain-based trust management system for social internet of things","year":2022,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Blockchain; Computer science; Internet of Things; Trust management (information system); The Internet; Trustworthiness; Computer security; Metric (unit); Order (exchange); Information sharing; Social network (sociolinguistics); World Wide Web; Data science; Distributed computing; Social media","retraction":null,"screen_n_in":null,"score":{"opus":0.01320288119483558,"gpt":0.2287466323625298,"spread":0.2155437511676943,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002326254,0.0001053979,0.0002481784,0.0001629451,0.0005190999,0.00002402274,0.001867122,0.00004117604,0.000005287495],"category_scores_gemma":[0.000008642509,0.00007923756,0.000159738,0.0003989179,0.00006412339,0.00003648634,0.000504889,0.000340631,5.993524e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001182859,"about_ca_system_score_gemma":0.00004479061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001469777,"about_ca_topic_score_gemma":3.414455e-7,"domain_scores_codex":[0.9986529,0.0001455143,0.0005402351,0.0001342109,0.0003230299,0.0002040593],"domain_scores_gemma":[0.998925,0.0002057119,0.0004278941,0.0002760701,0.0001371762,0.00002809757],"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.000221064,0.0007701993,0.0006088081,0.0006293755,0.0005890955,0.00005593638,0.04306343,0.009644009,0.00314655,0.8245422,0.004677547,0.1120517],"study_design_scores_gemma":[0.001409403,0.0004145756,0.0001838769,0.00009474058,0.0001097824,0.0003001301,0.004074411,0.9747267,0.006926969,0.005190205,0.006362177,0.000207052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.453638,0.0001896955,0.5430123,0.002520862,0.0002187496,0.0002193082,0.000001866211,0.00005451575,0.0001447279],"genre_scores_gemma":[0.9682423,7.971025e-7,0.03143531,0.000202509,0.00007522923,0.00001199336,4.15006e-7,0.000008578747,0.00002281836],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9650826,"threshold_uncertainty_score":0.3992549,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4390590962","doi":"10.1007/s11227-023-05790-3","title":"Prism refraction search: a novel physics-based metaheuristic algorithm","year":2024,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Metaheuristic; Computer science; Algorithm; Test suite; Robustness (evolution); Suite; Benchmark (surveying); Heuristics; Prism; Test case; Machine learning; Optics","retraction":null,"screen_n_in":null,"score":{"opus":0.03378277130869906,"gpt":0.2937976566970732,"spread":0.2600148853883741,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001661658,0.0001703083,0.0002251502,0.0001988185,0.0002467661,0.0002534628,0.0007543879,0.00004401233,0.000005817411],"category_scores_gemma":[0.00014618,0.0001168446,0.0001449238,0.000853963,0.00007107369,0.001042874,0.0001554053,0.0006786301,0.00002401596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001815369,"about_ca_system_score_gemma":0.0002396448,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001539117,"about_ca_topic_score_gemma":2.011324e-7,"domain_scores_codex":[0.9982686,0.0001961542,0.0004649063,0.0002109561,0.0005789047,0.0002804512],"domain_scores_gemma":[0.9980882,0.001030925,0.0001545774,0.0003031835,0.000327918,0.00009517166],"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.00001046219,0.0001277835,0.000007450554,0.00002987958,0.0001121199,0.00007925999,0.002422035,0.3982857,0.007349136,0.001004041,0.00009583958,0.5904763],"study_design_scores_gemma":[0.0003477062,0.00009706645,0.0001102767,0.0001430769,0.00003661925,0.0004233301,0.0001171304,0.9938705,0.00325489,0.0008818295,0.0005856684,0.0001318838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00150985,0.0005197536,0.9956387,0.0009485997,0.001062236,0.000117426,0.000001631878,0.0001209218,0.00008090573],"genre_scores_gemma":[0.1909287,0.00002835461,0.8082018,0.0001839147,0.0005844607,7.851073e-7,7.935958e-7,0.0000248478,0.00004630391],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5955848,"threshold_uncertainty_score":0.4764784,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007692703","doi":"10.1007/s11227-010-0434-y","title":"A note on the alternating group network","year":2010,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Interconnection; Group (periodic table); Class (philosophy); Alternating group; Network topology; Star (game theory); Topology (electrical circuits); Discrete mathematics; Computer network; Combinatorics; Mathematics; Physics; Astrophysics; Artificial intelligence; Symmetric group","retraction":null,"screen_n_in":null,"score":{"opus":0.01507437455092888,"gpt":0.2389119893499687,"spread":0.2238376147990398,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005072027,0.0001135546,0.0001635427,0.00004400009,0.0005441566,0.0002282242,0.001535912,0.00004463362,0.00001404735],"category_scores_gemma":[0.0001260014,0.00005325785,0.0001287025,0.0002406741,0.00004013212,0.0002358253,0.0001934137,0.0009872145,0.00001791056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002089598,"about_ca_system_score_gemma":0.00002407861,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003722649,"about_ca_topic_score_gemma":0.00002822295,"domain_scores_codex":[0.998482,0.0003038457,0.0004744843,0.0001003069,0.0003573389,0.0002820331],"domain_scores_gemma":[0.9976681,0.00144897,0.0003097904,0.0003811231,0.0001372924,0.00005468223],"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.00008064714,0.0001566164,0.002947342,0.00002171646,0.0002363166,0.0001105674,0.02128683,0.2003109,0.02196263,0.5639356,0.02515669,0.1637942],"study_design_scores_gemma":[0.0003468231,0.0002919357,0.001450233,0.0003002045,0.00001574087,0.001843121,0.0003812824,0.9783885,0.0004622311,0.005729654,0.01058982,0.0002004807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6247039,0.00006063456,0.3649272,0.003400977,0.005139065,0.00007603072,8.730935e-8,0.00002735745,0.00166472],"genre_scores_gemma":[0.9894088,0.00000534737,0.005220638,0.001232772,0.004097503,4.252387e-7,4.467282e-8,0.000009029388,0.00002546658],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7780775,"threshold_uncertainty_score":0.428901,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4386995867","doi":"10.1007/s11227-023-05657-7","title":"Data protection in internet of medical things using blockchain and secret sharing method","year":2023,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Blockchain Technology Applications and Security","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":"Carleton University","funders":"","keywords":"Computer science; Blockchain; Computer security; The Internet; Internet of Things; Secret sharing; Data sharing; Privacy protection; Internet privacy; World Wide Web; Cryptography","retraction":null,"screen_n_in":null,"score":{"opus":0.074025589283162,"gpt":0.3339816888096673,"spread":0.2599560995265053,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009468931,0.00007192632,0.000190218,0.0002673708,0.00007945923,0.0000302018,0.002083405,0.0001014762,0.000002294906],"category_scores_gemma":[0.0002486732,0.00005197017,0.00002177617,0.0007189958,0.00006835777,0.0002337349,0.001925974,0.0005808534,4.628866e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002116583,"about_ca_system_score_gemma":0.00004985163,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003731217,"about_ca_topic_score_gemma":0.00001588626,"domain_scores_codex":[0.9987174,0.0001564467,0.0004713174,0.000164858,0.0003341119,0.0001558302],"domain_scores_gemma":[0.999021,0.0002562632,0.0002027566,0.0004226319,0.00005790651,0.00003942676],"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.00005766652,0.0002630876,0.01108099,0.0003358595,0.0002422535,0.0001612193,0.06713998,0.009786034,0.03385584,0.08400464,0.0002756201,0.7927968],"study_design_scores_gemma":[0.0001796554,0.00002755056,0.0005389098,0.0001722517,0.000007075821,0.0005292533,0.0003657442,0.9896511,0.0008535993,0.007566752,0.00005962922,0.00004841001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5249652,0.0001118569,0.4730783,0.001724143,0.00004271738,0.00005092636,2.793067e-7,0.00002300404,0.000003574202],"genre_scores_gemma":[0.9424466,0.00002502478,0.05741908,0.00005803082,0.00004364132,4.359072e-7,3.546276e-7,0.000005011382,0.000001761325],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9798651,"threshold_uncertainty_score":0.3871519,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2031282765","doi":"10.1007/s11227-009-0371-9","title":"Adaptive popularity-driven replica placement in hierarchical data grids","year":2009,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Replica; Latency (audio); Distributed computing; Scalability; Data access; Data grid; Grid; Replication (statistics); Popularity; Computer network; Database","retraction":null,"screen_n_in":null,"score":{"opus":0.05649258628647368,"gpt":0.2941479790441187,"spread":0.237655392757645,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003684183,0.0001691927,0.0003548749,0.0001502708,0.0001906014,0.0001405222,0.003758401,0.00006183721,0.000002602488],"category_scores_gemma":[0.000124258,0.0001158887,0.00007697512,0.0004898772,0.00004064578,0.000503447,0.0007223611,0.0007328395,0.000007321827],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008336327,"about_ca_system_score_gemma":0.0001275224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005966397,"about_ca_topic_score_gemma":0.000007468164,"domain_scores_codex":[0.9974117,0.0005342027,0.0008336143,0.0002814734,0.0005438387,0.0003951956],"domain_scores_gemma":[0.9981053,0.0003497282,0.0002860205,0.001030069,0.0001116579,0.0001171879],"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.000636119,0.001963108,0.01678749,0.00008161894,0.0004047281,0.001410567,0.03743446,0.554997,0.003159448,0.06410065,0.03383587,0.2851889],"study_design_scores_gemma":[0.00113803,0.0007241269,0.02182181,0.000452678,0.00002348719,0.001351423,0.000380212,0.9675673,0.00004344655,0.003691402,0.002500908,0.0003051399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2714253,0.00042128,0.7227743,0.003982971,0.0005298491,0.0001639264,0.000005222022,0.0000519877,0.0006451975],"genre_scores_gemma":[0.9729872,0.00001391291,0.02618776,0.000377279,0.0004090927,1.385307e-7,0.000005409911,0.000005759034,0.00001348715],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7015619,"threshold_uncertainty_score":0.6984107,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3211602915","doi":"10.1007/s11227-021-04177-6","title":"A binary PSO-based ensemble under-sampling model for rebalancing imbalanced training data","year":2021,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Artificial intelligence; Ensemble learning; Machine learning; Sampling (signal processing); Selection (genetic algorithm); Binary number; Binary classification; Data mining; Pattern recognition (psychology); Support vector machine; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.2111408925881917,"gpt":0.3510560927424298,"spread":0.1399152001542381,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00340501,0.0001843621,0.0003605657,0.0001334576,0.0004010186,0.00021197,0.002778367,0.00007336003,0.000001680997],"category_scores_gemma":[0.0005045829,0.000146259,0.00010721,0.0004548247,0.00005036182,0.001021084,0.0006305681,0.0004044227,0.000001407492],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001069594,"about_ca_system_score_gemma":0.0007650533,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000437432,"about_ca_topic_score_gemma":0.000004728076,"domain_scores_codex":[0.9978592,0.0001853615,0.0007639088,0.0003517713,0.0004140462,0.0004256907],"domain_scores_gemma":[0.9963803,0.001146134,0.0004444549,0.001447301,0.0004884768,0.00009328985],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007593414,0.0001745305,0.0001496452,0.0001334915,0.0001182357,0.0000382554,0.005360699,0.3882485,0.4825023,0.01168326,0.003157313,0.1083579],"study_design_scores_gemma":[0.000516972,0.00005446681,0.0001471423,0.0002538899,0.00002843721,0.0002253729,0.000610971,0.9814115,0.01154358,0.004729029,0.0003047159,0.000173966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03204818,0.0003533516,0.9637471,0.003258025,0.0002567651,0.0001349411,0.00001951769,0.0001292684,0.00005287614],"genre_scores_gemma":[0.5338466,0.00002022673,0.465314,0.0006352442,0.0001352646,0.00000128429,0.00002124669,0.00001507535,0.00001106555],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.593163,"threshold_uncertainty_score":0.5964267,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020884679","doi":"10.1007/s11227-013-1056-y","title":"Integrating the enriched feature with machine learning algorithms for human movement and fall detection","year":2013,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Wearable computer; Artificial intelligence; Accelerometer; Wireless sensor network; Feature (linguistics); Wireless; Machine learning; Algorithm; Artificial neural network; Computer vision; Embedded system; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.020646474950314,"gpt":0.2444353180351217,"spread":0.2237888430848077,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001762722,0.0001369643,0.0001971453,0.00007871517,0.0006777676,0.0003306183,0.0004503765,0.00003743308,0.000002045262],"category_scores_gemma":[0.00008731128,0.00006609423,0.00006223834,0.0001817036,0.0000409202,0.0005741409,0.0001404131,0.0005444789,0.000001363756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005104791,"about_ca_system_score_gemma":0.00002223247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004873156,"about_ca_topic_score_gemma":0.0001854787,"domain_scores_codex":[0.9988263,0.0002808902,0.000302259,0.0001281068,0.0002652072,0.0001972228],"domain_scores_gemma":[0.9983997,0.0007361885,0.0003338539,0.0001567567,0.0003216288,0.00005187888],"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.00002291344,0.00004749536,0.004621262,0.00004025582,0.0001837922,0.000003923327,0.01713571,0.0007177784,0.08589154,0.0002780858,0.00008451707,0.8909727],"study_design_scores_gemma":[0.002122528,0.001669721,0.01417185,0.0004179057,0.00009700338,0.001657254,0.01353199,0.9541346,0.008294295,0.002642717,0.000823711,0.0004364417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4610828,0.0001833239,0.5372553,0.001107053,0.00009723059,0.0002233801,2.054045e-7,0.0000218742,0.0000287805],"genre_scores_gemma":[0.9893591,0.00000613046,0.01009703,0.0002190947,0.000248871,0.00000620689,3.762853e-7,0.00001161068,0.00005154206],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9534168,"threshold_uncertainty_score":0.5212909,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1576210310","doi":"10.1023/a:1024464001273","title":"Performance Evaluation of a Multithreaded Fast Fourier Transform Algorithm for Derivative Pricing","year":2003,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Fast Fourier transform; Parallel computing; Speedup; Algorithm; Parallel algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.04097960310350324,"gpt":0.280259419547827,"spread":0.2392798164443237,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007255958,0.0001439104,0.0003041957,0.0001110494,0.0002369853,0.00004756997,0.0006632925,0.00004736851,0.000002480644],"category_scores_gemma":[0.0001609119,0.00009721502,0.0001361813,0.0003763165,0.00004467498,0.0004181869,0.0000353306,0.0001896168,0.000001015756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007967096,"about_ca_system_score_gemma":0.0002270184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009334692,"about_ca_topic_score_gemma":8.364819e-7,"domain_scores_codex":[0.9978501,0.0003551801,0.0007152218,0.0001261367,0.0006802917,0.0002730239],"domain_scores_gemma":[0.9977692,0.0004707095,0.0004544653,0.0002266384,0.001023552,0.00005543848],"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.00001638332,0.00009238523,0.0005707419,0.00005831709,0.000134266,0.000001105384,0.01613957,0.09789933,0.001339633,0.0006281178,0.00007831948,0.8830419],"study_design_scores_gemma":[0.001262454,0.0002383784,0.0007948024,0.000251791,0.00006308412,0.0001818513,0.0007775989,0.9900543,0.005646298,0.0004023208,0.0002090845,0.0001180009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3561478,0.000174475,0.6427756,0.00006764132,0.0003115996,0.0002363766,0.000001400304,0.00001075631,0.0002743602],"genre_scores_gemma":[0.8597481,0.000007227104,0.1400883,0.00002319738,0.0001145746,0.000001779515,8.390859e-7,0.000008221731,0.000007772788],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.892155,"threshold_uncertainty_score":0.3964314,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1757801143","doi":"10.1023/a:1011134903609","title":"Simulation and Analysis of Packet Loss in User Datagram Protocol Transfers","year":2001,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Packet loss; Computer network; Datagram; Network packet; User Datagram Protocol; Quality of service; Internet Protocol; Packet analyzer; End-to-end delay; Internet protocol suite; The Internet; Real-time computing; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.02206584046538757,"gpt":0.292350554373519,"spread":0.2702847139081315,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001308731,0.00007486682,0.0002406675,0.0002248635,0.00005789584,0.00003633761,0.0003920225,0.00002949311,0.000006072769],"category_scores_gemma":[0.00003137351,0.00004945485,0.00007028223,0.0008624833,0.00004160309,0.0003541921,0.00004064052,0.0001589888,2.998814e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001498585,"about_ca_system_score_gemma":0.00002897295,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001539499,"about_ca_topic_score_gemma":0.00002158098,"domain_scores_codex":[0.9989242,0.0001827081,0.000457694,0.00008667319,0.0002145535,0.0001341711],"domain_scores_gemma":[0.9990293,0.0005249963,0.0001329274,0.0001658041,0.0001050069,0.00004197089],"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.00005475287,0.00003919303,0.03906344,0.000005721027,0.0001109108,0.00001114327,0.001214216,0.7758409,0.00005827139,0.0003947479,0.00000639807,0.1832003],"study_design_scores_gemma":[0.0006688011,0.000085878,0.0357503,0.00004040291,0.00009380163,0.00002214623,0.00008298134,0.9629111,0.00001288744,0.00009766479,0.0001804047,0.00005368409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5432721,0.00001810993,0.4550524,0.0003333096,0.00002534595,0.001274661,4.397202e-7,0.000006463847,0.00001713831],"genre_scores_gemma":[0.9980748,0.000007130722,0.001775552,0.00006720227,0.00004844245,0.00002012867,3.475974e-7,0.000002973979,0.00000341856],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4548027,"threshold_uncertainty_score":0.201671,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2057440614","doi":"10.1007/s11227-014-1243-5","title":"Efficient routing based on past information to predict the future location for message passing in infrastructure-less opportunistic networks","year":2014,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Opportunistic and Delay-Tolerant Networks","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Routing protocol; Geographic routing; Latency (audio); Wireless Routing Protocol; Dynamic Source Routing; Probabilistic logic; Distributed computing; Routing (electronic design automation); Link-state routing protocol; Zone Routing Protocol; Telecommunications; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.009991258978234632,"gpt":0.2177091045419444,"spread":0.2077178455637098,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004657858,0.000186207,0.0002564909,0.000170726,0.000470374,0.0002751248,0.0009289486,0.00008709538,0.000001276686],"category_scores_gemma":[0.00008023473,0.0001075849,0.00007956008,0.000525947,0.00004256986,0.0002411041,0.0001308257,0.0004945539,0.000001043054],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001067457,"about_ca_system_score_gemma":0.0001441208,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005926046,"about_ca_topic_score_gemma":0.000002371805,"domain_scores_codex":[0.9979025,0.0003075791,0.0008152243,0.0001331362,0.0004640214,0.0003775251],"domain_scores_gemma":[0.9975475,0.001185439,0.0004667371,0.0003756679,0.0002980144,0.0001266048],"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.00003759717,0.00001328964,0.0004809615,0.00001092578,0.000004961292,0.000001049774,0.0009450692,0.7518777,0.000002482682,0.002095804,0.0003671974,0.244163],"study_design_scores_gemma":[0.0005189533,0.0001715686,0.006414172,0.000365215,0.00002058216,0.00004387227,0.0007243664,0.991045,0.000002664501,0.0001473546,0.0004221151,0.0001241574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04899405,0.00003650582,0.9471698,0.002345908,0.0009354692,0.00030534,0.000001135042,0.0000255742,0.0001861978],"genre_scores_gemma":[0.9885285,0.000003091983,0.008135655,0.002071039,0.001242093,0.000002908126,0.000004718257,0.00001061426,0.000001366823],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9395345,"threshold_uncertainty_score":0.4387184,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4205867922","doi":"10.1007/s11227-021-04222-4","title":"A framework of genetic algorithm-based CNN on multi-access edge computing for automated detection of COVID-19","year":2022,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"COVID-19 diagnosis using AI","field":"Medicine","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"March of Dimes Canada","funders":"King Saud University","keywords":"Computer science; Convolutional neural network; Staffing; Enhanced Data Rates for GSM Evolution; Computational intelligence; Cloud computing; Artificial intelligence; Edge computing; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.06620902740773783,"gpt":0.3829997209550136,"spread":0.3167906935472758,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002550702,0.0001858144,0.0005986217,0.0004513462,0.0004146449,0.00001917317,0.0004600955,0.00007757149,0.00002844906],"category_scores_gemma":[0.001777691,0.0001498578,0.0002825834,0.0006633695,0.0001093485,0.00005178541,0.0001830385,0.000623436,4.903978e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004824992,"about_ca_system_score_gemma":0.0006216438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002251209,"about_ca_topic_score_gemma":0.000002551576,"domain_scores_codex":[0.9974471,0.00042393,0.001055468,0.0001805021,0.0006100076,0.0002830481],"domain_scores_gemma":[0.9942047,0.004047409,0.0009106714,0.0003038263,0.000381273,0.0001521238],"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.0008193783,0.0009075584,0.007169289,0.0008484122,0.000226345,0.00003977503,0.003809373,0.9271488,0.02869773,0.000006568001,0.0005448487,0.02978194],"study_design_scores_gemma":[0.003538521,0.001761126,0.01577683,0.000739537,0.0003279732,0.0002190996,0.000865025,0.9589244,0.01709976,0.00005768281,0.0005439288,0.0001461045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5871534,0.0002334127,0.4095805,0.002201795,0.0003870895,0.0003729474,0.00001077527,0.00005919958,8.849058e-7],"genre_scores_gemma":[0.9326427,0.000007989842,0.06252949,0.004493867,0.0002766238,0.000003637337,0.000002982413,0.00004113486,0.000001574476],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.347051,"threshold_uncertainty_score":0.6111022,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2399372960","doi":"10.1007/s11227-016-1739-2","title":"Finding approximate solutions of NP-hard optimization and TSP problems using elephant search algorithm","year":2016,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Metaheuristic Optimization Algorithms Research","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":"Lakehead University","funders":"Universidade de Macau","keywords":"Travelling salesman problem; Computer science; Metaheuristic; Mathematical optimization; Firefly algorithm; Search algorithm; Beam search; Algorithm; Combinatorial optimization; Guided Local Search; Local search (optimization); Best-first search; Optimization problem; Benchmark (surveying); Mathematics; Particle swarm optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.08004275425044745,"gpt":0.2965008824944893,"spread":0.2164581282440419,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004889206,0.000136245,0.0002854909,0.0003584544,0.0003601066,0.0001197382,0.0008060564,0.00005147639,0.00002133733],"category_scores_gemma":[0.0003095896,0.00007913387,0.00006685445,0.0006109239,0.0001658827,0.0007214014,0.0005426958,0.0002341267,0.000001606845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008625007,"about_ca_system_score_gemma":0.0001833851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002292021,"about_ca_topic_score_gemma":2.68282e-7,"domain_scores_codex":[0.9974689,0.0004874206,0.0007218345,0.000179012,0.0007253661,0.0004174202],"domain_scores_gemma":[0.9978116,0.0007315922,0.0003274412,0.0002961444,0.0007016502,0.0001316378],"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.00001333047,0.0001192082,0.0005073774,0.00008915023,0.0001071708,0.00001359583,0.003272945,0.8408728,0.03252698,0.001144612,0.00006621051,0.1212666],"study_design_scores_gemma":[0.0005283261,0.00009407658,0.0001011969,0.0001917427,0.00002057265,0.0004859327,0.0001273749,0.9959474,0.002087598,0.000306293,0.000009741715,0.00009976368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02665401,0.0003247024,0.9719294,0.0007049124,0.0001650254,0.0001715348,0.000003326062,0.00001989053,0.00002725916],"genre_scores_gemma":[0.2017383,0.0002228285,0.7978581,0.00001910327,0.0001205522,5.108622e-7,2.933712e-7,0.00001503266,0.00002522134],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1750843,"threshold_uncertainty_score":0.3226985,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006246786","doi":"10.1007/s11227-009-0298-1","title":"High performance computing and communications","year":2009,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":24,"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; Supercomputer; Grid computing; Snapshot (computer storage); Fault tolerance; Distributed computing; Mainstream; Task (project management); Grid; Telecommunications; Computer architecture; Parallel computing; Operating system; Systems engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02033985465590372,"gpt":0.254766099473941,"spread":0.2344262448180373,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002093858,0.0001247091,0.0002386556,0.00008635204,0.0005117353,0.0001646094,0.002016541,0.00003639651,6.394431e-7],"category_scores_gemma":[0.00004237048,0.00008418264,0.00004990593,0.0003227717,0.00007158639,0.0003830961,0.0003596905,0.0003767937,0.000004456344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002533589,"about_ca_system_score_gemma":0.00004490892,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001391032,"about_ca_topic_score_gemma":3.404705e-7,"domain_scores_codex":[0.9986109,0.0002426129,0.0005448462,0.000102188,0.0002573125,0.0002421617],"domain_scores_gemma":[0.9984123,0.000433353,0.0003083514,0.0005812605,0.0001867272,0.00007803052],"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.00003094662,0.000238018,0.007914998,0.00006140578,0.000126462,0.00002593776,0.01862321,0.06605156,0.003061819,0.05713832,0.001777475,0.8449498],"study_design_scores_gemma":[0.000777135,0.0005289446,0.07177577,0.0004540004,0.00003383099,0.002565539,0.0003844019,0.9190683,0.0003057418,0.002099771,0.001703956,0.0003026199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6992192,0.0008109318,0.2969938,0.002345365,0.0002501466,0.00004973622,2.969659e-7,0.00004419594,0.0002863356],"genre_scores_gemma":[0.962005,0.00009176642,0.03731524,0.0003611839,0.000213835,4.161286e-8,6.039282e-7,0.000004223312,0.00000805692],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8530167,"threshold_uncertainty_score":0.3935906,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4403659146","doi":"10.1007/s11227-024-06499-7","title":"Enhancing Chinese comprehension and reasoning for large language models: an efficient LoRA fine-tuning and tree of thoughts framework","year":2024,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Topic Modeling","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Sichuan Province Science and Technology Support Program","keywords":"Computer science; Comprehension; Tree (set theory); Artificial intelligence; Natural language processing; Theoretical computer science; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01750393598384367,"gpt":0.2834888811719226,"spread":0.2659849451880789,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001736249,0.0001409129,0.0002780214,0.0001405508,0.0002113457,0.0001470463,0.0003733229,0.00005696576,5.981859e-7],"category_scores_gemma":[0.0001219713,0.00009032185,0.0000644232,0.0002110245,0.00002669409,0.0004481744,0.0002863803,0.0003380343,1.299983e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002065967,"about_ca_system_score_gemma":0.00003891844,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001565,"about_ca_topic_score_gemma":0.00001168662,"domain_scores_codex":[0.9987444,0.00012522,0.0004516931,0.0001959986,0.0002457985,0.0002368489],"domain_scores_gemma":[0.9985091,0.0009358753,0.0001327754,0.0002430278,0.00009919679,0.00008002515],"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.00009985616,0.0001460773,0.001075024,0.0008983092,0.0001615628,0.0001027979,0.2755671,0.4022655,0.09213939,0.05460772,0.00001914168,0.1729175],"study_design_scores_gemma":[0.0002299696,0.00009540049,0.0002247654,0.001223577,0.00002496643,0.0002303483,0.00149306,0.9914195,0.001029173,0.003924894,0.000007274419,0.00009707325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4965181,0.003802624,0.49933,0.00009883708,0.0001672418,0.00005224146,6.45122e-7,0.00002145722,0.000008950868],"genre_scores_gemma":[0.7797329,0.00003194686,0.2198766,0.00003395174,0.00030998,2.848094e-7,3.008394e-7,0.00001171011,0.000002347326],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.589154,"threshold_uncertainty_score":0.3683218,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4220684352","doi":"10.1007/s11227-022-04416-4","title":"Emotion recognition models for companion robots","year":2022,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Emotion and Mood Recognition","field":"Psychology","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Tech University","funders":"Mitacs","keywords":"Computer science; Facial expression; Leverage (statistics); Artificial intelligence; Machine learning; Humanoid robot; Deep learning; Robot; Human–computer interaction; Multimodal learning; Speech recognition","retraction":null,"screen_n_in":null,"score":{"opus":0.1047504089468876,"gpt":0.3185870187351316,"spread":0.213836609788244,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002001163,0.00008021926,0.0001460962,0.0001338403,0.0004746002,0.00001562166,0.0001699381,0.00003228238,0.0004320775],"category_scores_gemma":[0.00002389169,0.00006315585,0.0001301249,0.0001353974,0.00002082648,0.0001512347,0.00004500643,0.0003283141,0.00001550585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006961293,"about_ca_system_score_gemma":0.00002086806,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001976591,"about_ca_topic_score_gemma":0.000001255234,"domain_scores_codex":[0.9986652,0.00046256,0.0004109625,0.00008392947,0.0002067578,0.0001706383],"domain_scores_gemma":[0.9991592,0.0002488718,0.0002692335,0.00009091436,0.0001911854,0.00004059862],"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.001123739,0.00114862,0.0003451214,0.00006614711,0.0003792003,0.00001832106,0.04265836,0.1986099,0.008093857,0.004143859,0.02869056,0.7147223],"study_design_scores_gemma":[0.02354044,0.00805157,0.01753917,0.000683961,0.001494729,0.01732231,0.1951833,0.4803492,0.002748446,0.2391608,0.01216505,0.001761071],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8021652,0.0002094326,0.1921424,0.0008972272,0.002225902,0.0002382075,0.0000130942,0.0000262989,0.002082262],"genre_scores_gemma":[0.9970661,0.00001123883,0.001794152,0.0004339886,0.0005321703,0.000004824755,0.0000297539,0.00001768593,0.000110118],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7129613,"threshold_uncertainty_score":0.4730946,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4384927041","doi":"10.1007/s11227-023-05535-2","title":"Using a privacy-enhanced authentication process to secure IoT-based smart grid infrastructures","year":2023,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Physical Unclonable Functions (PUFs) and Hardware Security","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":"Université du Québec à Montréal; Vanier College","funders":"Shahid Rajaee Teacher Training University; Kharazmi University; Universidad Carlos III de Madrid; Comunidad de Madrid","keywords":"Computer science; Mutual authentication; Smart grid; Computer security; Elliptic curve cryptography; Authentication (law); Cryptography; Electricity; Process (computing); Physical unclonable function; Computer network; Embedded system; Public-key cryptography; Encryption; Electrical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02942587520550176,"gpt":0.3001802971726391,"spread":0.2707544219671373,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000993637,0.0001611629,0.0002379911,0.0002688886,0.0004502138,0.0001542967,0.001211645,0.00004833124,0.000009343672],"category_scores_gemma":[0.0002462977,0.0001121535,0.0001152861,0.001567641,0.00004285847,0.0003697205,0.0002678646,0.0003887515,0.00002450282],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008143065,"about_ca_system_score_gemma":0.0002429571,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002199998,"about_ca_topic_score_gemma":0.000003136884,"domain_scores_codex":[0.9983248,0.0001593089,0.0004359585,0.0001923206,0.0005319922,0.0003555786],"domain_scores_gemma":[0.9985906,0.0002653988,0.0002062458,0.0003824765,0.0004110669,0.0001442044],"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.0001918745,0.0003121489,0.00149077,0.0002791435,0.0002029559,0.00004550455,0.06055935,0.6636879,0.2269421,0.005372505,0.003908745,0.03700699],"study_design_scores_gemma":[0.0007595904,0.0003123696,0.0169047,0.0004357983,0.00007951268,0.0001251078,0.0008772514,0.9194662,0.03588935,0.02382217,0.000906395,0.0004215778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5975841,0.00001818666,0.4007625,0.0008947974,0.0005299383,0.00009783484,0.000001768098,0.00007563577,0.00003517553],"genre_scores_gemma":[0.9827687,0.000001871527,0.01626089,0.0003628149,0.0005834624,0.00000124211,0.000001750961,0.00001321799,0.000006038579],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3851846,"threshold_uncertainty_score":0.4573486,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2181058803","doi":"10.1007/s11227-015-1433-9","title":"Incomplete high-dimensional data imputation algorithm using feature selection and clustering analysis on cloud","year":2015,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Face and Expression Recognition","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":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Imputation (statistics); Cluster analysis; Data mining; Missing data; Feature selection; Data set; Algorithm; Cloud computing; Hierarchical clustering; Pattern recognition (psychology); Artificial intelligence; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.05964736565991257,"gpt":0.2945540920085865,"spread":0.2349067263486739,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001774898,0.0001139855,0.0002101356,0.0002675358,0.0002557345,0.000142701,0.0005028236,0.00005162481,0.000001863714],"category_scores_gemma":[0.0000602121,0.00007664831,0.00004445072,0.0006186288,0.0000205035,0.0008042677,0.0004526781,0.000297048,0.000002358942],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006132117,"about_ca_system_score_gemma":0.00006383786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000119646,"about_ca_topic_score_gemma":0.00001148429,"domain_scores_codex":[0.9986712,0.0002554139,0.0002968129,0.0001813267,0.000432661,0.0001626135],"domain_scores_gemma":[0.9989806,0.0001876364,0.0002362358,0.0002401482,0.0002530055,0.0001023888],"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.00008157443,0.00006890298,0.0007284996,0.0000130746,0.0003983147,0.00002450003,0.00233348,0.7820047,0.005902999,0.00007473724,0.001710596,0.2066587],"study_design_scores_gemma":[0.0003752346,0.0001100241,0.001140345,0.00007330607,0.0001386947,0.0003849224,0.000169934,0.9965911,0.000445254,0.0004332002,0.00004583034,0.00009217441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4457632,0.00009514417,0.5533561,0.0004332281,0.0002998187,0.00003158623,0.000002334364,0.00001423631,0.000004360391],"genre_scores_gemma":[0.7710712,0.000006665091,0.2283307,0.0001913828,0.0003821161,7.513912e-8,0.000009067357,0.000005872261,0.000002937108],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.325308,"threshold_uncertainty_score":0.3125627,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2049920528","doi":"10.1007/s11227-012-0826-2","title":"Enhancing performance of failure-prone clusters by adaptive provisioning of cloud resources","year":2012,"lang":"en","type":"article","venue":"The Journal of Supercomputing","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":"University of Manitoba","funders":"","keywords":"Provisioning; Computer science; Cloud computing; Distributed computing; Scheduling (production processes); Virtual machine; Probabilistic logic; Resource (disambiguation); Fault tolerance; Computer network; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01040836603852283,"gpt":0.2120975063611327,"spread":0.2016891403226099,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004109581,0.0001761718,0.0003957387,0.0001696589,0.0002398062,0.0000332783,0.001308798,0.00004992108,0.000002695703],"category_scores_gemma":[0.00007141749,0.0001150104,0.0001402718,0.0004270229,0.0001190083,0.000167452,0.000713422,0.000379766,0.000002046594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005329602,"about_ca_system_score_gemma":0.00003655379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004204635,"about_ca_topic_score_gemma":8.551354e-7,"domain_scores_codex":[0.9975753,0.0003016031,0.0009199935,0.0001314075,0.0006487333,0.0004229688],"domain_scores_gemma":[0.9979474,0.0004992341,0.0008813496,0.0003644208,0.0002066599,0.0001009468],"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.0005171568,0.001121825,0.0252077,0.001063042,0.0009918147,0.00001271692,0.2695948,0.3075387,0.1371943,0.002540369,0.003917599,0.2503],"study_design_scores_gemma":[0.002212327,0.002606747,0.008102684,0.004061901,0.0002494519,0.0005544993,0.02346904,0.78539,0.1697598,0.00011645,0.002642722,0.0008344902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9062852,0.001101023,0.09154863,0.000305277,0.0003773222,0.0001079357,3.542808e-7,0.0000208801,0.0002533419],"genre_scores_gemma":[0.9783478,0.00001147531,0.02115689,0.00005653496,0.0003768565,2.653069e-7,1.184687e-7,0.00001286468,0.0000371696],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4778512,"threshold_uncertainty_score":0.4689988,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2015457254","doi":"10.1007/s11227-007-0144-2","title":"A multiprocessor based heuristic for multi-dimensional multiple-choice knapsack problem","year":2007,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Knapsack problem; Computer science; Heuristic; Multiprocessing; Parallel computing; Overhead (engineering); Change-making problem; Mathematical optimization; Algorithm; Continuous knapsack problem; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03654757383663416,"gpt":0.2712778168740724,"spread":0.2347302430374382,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001765914,0.0001742467,0.0002289241,0.0001442911,0.0001885253,0.00003700117,0.0002517913,0.00007411065,0.00001566751],"category_scores_gemma":[0.0004808489,0.0001258095,0.0001151359,0.0002065406,0.00003824161,0.0001359721,0.00002156867,0.0003210536,0.00000535208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005879111,"about_ca_system_score_gemma":0.00003930897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009757843,"about_ca_topic_score_gemma":0.00002232053,"domain_scores_codex":[0.9986551,0.00003967544,0.0006384781,0.00008898877,0.000235121,0.0003426307],"domain_scores_gemma":[0.9971699,0.002127553,0.0001419095,0.0001168961,0.0003325796,0.0001112352],"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.00005542033,0.0000556723,0.002649561,0.0001531561,0.00004524494,0.000003482088,0.0007749472,0.9886652,0.004447985,0.000009299385,0.0003730942,0.002766955],"study_design_scores_gemma":[0.00204622,0.00007113505,0.001805694,0.0002325121,0.0000448241,0.00006595229,0.0001317574,0.9916015,0.002664852,0.00001827356,0.001146505,0.0001707436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.236809,0.0004150068,0.7617663,0.0001015507,0.0004447015,0.0002807245,0.000005614899,0.00009872428,0.00007830686],"genre_scores_gemma":[0.8163989,0.000005414893,0.1831199,0.000151352,0.0002540875,0.000001105778,0.000004020972,0.00004253067,0.00002272088],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5795898,"threshold_uncertainty_score":0.5130363,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4388522269","doi":"10.1007/s11227-023-05753-8","title":"PCP–ACO: a hybrid deadline-constrained workflow scheduling algorithm for cloud environment","year":2023,"lang":"en","type":"article","venue":"The Journal of Supercomputing","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":"Concordia University; University of Alberta","funders":"","keywords":"Computer science; Workflow; Cloud computing; Ant colony optimization algorithms; Distributed computing; Scheduling (production processes); Algorithm; Workflow management system; Job shop scheduling; Mathematical optimization; Operating system; Database; Computer network; Routing (electronic design automation)","retraction":null,"screen_n_in":null,"score":{"opus":0.01936236161578111,"gpt":0.23588851900962,"spread":0.2165261573938389,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004085127,0.0002314186,0.0003434519,0.0002406555,0.0005521846,0.00017644,0.001597809,0.00004460567,0.000003884473],"category_scores_gemma":[0.00008353557,0.0001623054,0.0002865797,0.0004493581,0.00008316369,0.00006276701,0.000703815,0.0003910076,0.00003656346],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008663614,"about_ca_system_score_gemma":0.00006205941,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007246311,"about_ca_topic_score_gemma":1.621104e-7,"domain_scores_codex":[0.9976595,0.0001861397,0.0007485598,0.0002629422,0.00054735,0.0005954957],"domain_scores_gemma":[0.9980754,0.0009114606,0.0003247983,0.0004508452,0.00009796906,0.0001395023],"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.000009558199,0.00005243318,0.00004597717,0.00002317455,0.0001176504,0.00006380153,0.001410831,0.3711155,0.0003199353,0.0004308471,0.0008561915,0.6255541],"study_design_scores_gemma":[0.0007691787,0.000168587,0.0001594832,0.0001784638,0.00003970481,0.0003223947,0.0005052241,0.9919509,0.0003771104,0.001941712,0.003384109,0.0002031242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3163323,0.000257958,0.6798995,0.002334512,0.0008373749,0.0001749429,0.000001334085,0.0001151771,0.00004696438],"genre_scores_gemma":[0.6739225,0.00004094049,0.3237245,0.0003502402,0.001793832,0.000002534463,0.000001543929,0.00002964238,0.0001342878],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.625351,"threshold_uncertainty_score":0.6618621,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2074688378","doi":"10.1007/s11227-009-0294-5","title":"Analyzing and enhancing the parallel sort operation on multithreaded architectures","year":2009,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Parallel Computing and Optimization Techniques","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":"University of Calgary","funders":"","keywords":"Computer science; Multithreading; Parallel computing; Quicksort; sort; Simultaneous multithreading; Parallelism (grammar); Sorting algorithm; Computer architecture; Thread (computing); Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01582151918779278,"gpt":0.2631792472619862,"spread":0.2473577280741934,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001888663,0.0001282907,0.0001767041,0.0001193601,0.0005178781,0.0002016436,0.0007361689,0.00003468032,0.000001075829],"category_scores_gemma":[0.0001068931,0.00006646084,0.00006250413,0.0001982449,0.00004341165,0.0001623955,0.00009336206,0.0003830954,0.000001222227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002344845,"about_ca_system_score_gemma":0.00003709776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001178907,"about_ca_topic_score_gemma":0.000002726436,"domain_scores_codex":[0.9987582,0.0002617472,0.0004203518,0.0001253087,0.0002412492,0.0001931444],"domain_scores_gemma":[0.9989628,0.0004370929,0.000197444,0.0002538431,0.00009982006,0.00004906589],"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.00003632923,0.00005639275,0.0004533467,0.000005956921,0.0000395265,0.00001045989,0.009849861,0.8472196,0.006309079,0.004515783,0.0003090195,0.1311947],"study_design_scores_gemma":[0.0005064513,0.0005059135,0.01214373,0.0002160378,0.00002752094,0.0005245126,0.0002615167,0.9714425,0.009015399,0.005014994,0.0001107479,0.0002307153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2980964,0.0003308027,0.6983079,0.002965369,0.00006924264,0.0000677748,6.621535e-8,0.00005121309,0.0001113244],"genre_scores_gemma":[0.9034892,0.0000565753,0.09541252,0.0008475059,0.0001808432,2.046464e-7,1.751885e-7,0.000004597505,0.000008369735],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6053929,"threshold_uncertainty_score":0.3983152,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1968014753","doi":"10.1023/b:supe.0000020178.66165.f3","title":"Optimization of DTM Interpolation Using SFS with Single Satellite Imagery","year":2004,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Remote Sensing and LiDAR Applications","field":"Environmental 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":"University of Calgary","funders":"","keywords":"Computer science; Interpolation (computer graphics); Terrain; Remote sensing; Computation; Digital elevation model; Satellite; Context (archaeology); Computer vision; Artificial intelligence; Field (mathematics); Elevation (ballistics); Computer graphics (images); Algorithm; Geology; Image (mathematics); Geography; Cartography","retraction":null,"screen_n_in":null,"score":{"opus":0.0159004112065297,"gpt":0.2238392353639511,"spread":0.2079388241574213,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004213988,0.00006052116,0.0000977087,0.00003586544,0.0001075552,0.00001754768,0.0001115653,0.00001997609,0.00001880786],"category_scores_gemma":[0.00001727371,0.00003861049,0.00003346627,0.000205229,0.0001105407,0.000189931,0.000035181,0.0001041618,0.000003209651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009438134,"about_ca_system_score_gemma":0.00001509875,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001759285,"about_ca_topic_score_gemma":0.000007228477,"domain_scores_codex":[0.9993463,0.00004610061,0.0002734204,0.00005462567,0.0001866977,0.00009289356],"domain_scores_gemma":[0.9995562,0.00005413292,0.0002237817,0.0001034709,0.00003367093,0.00002870773],"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.00001464156,0.00002957624,0.001202859,0.000002286726,0.000006776352,9.027843e-7,0.001506355,0.8649669,0.1269114,0.000006213857,0.000002805937,0.00534933],"study_design_scores_gemma":[0.001668493,0.0006547268,0.02706835,0.0009501924,0.0002751935,0.002223271,0.005158202,0.85799,0.102227,0.001096446,0.0002310999,0.0004569291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6545385,0.00003315625,0.3445921,0.0001086666,0.00002518284,0.00003417792,1.389039e-7,0.00000426715,0.0006638526],"genre_scores_gemma":[0.8626996,0.000009407901,0.1372039,0.00002849933,0.00004734523,1.095513e-8,4.513967e-7,0.000007536145,0.000003302497],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2081611,"threshold_uncertainty_score":0.157449,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2025586852","doi":"10.1007/s11227-013-0893-z","title":"Normalized particle swarm optimization for complex chooser option pricing on graphics processing unit","year":2013,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Manitoba","keywords":"Computer science; Valuation of options; Particle swarm optimization; Exotic option; Mathematical optimization; Black–Scholes model; Binomial options pricing model; Profit (economics); Finance; Algorithm; Economics; Microeconomics; Volatility (finance); Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.06439300136935261,"gpt":0.2568065548535011,"spread":0.1924135534841485,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007319363,0.0000951306,0.0002193474,0.00009863642,0.0003632382,0.00008751988,0.000218726,0.00004267645,0.0000239568],"category_scores_gemma":[0.0001371822,0.00007755565,0.0000732578,0.0003151335,0.00003642639,0.000309251,0.00002666324,0.0001437483,0.00002011549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003509206,"about_ca_system_score_gemma":0.00002043982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006332896,"about_ca_topic_score_gemma":0.000001220761,"domain_scores_codex":[0.999003,0.000007621247,0.0006364274,0.0001029185,0.00005082892,0.0001992096],"domain_scores_gemma":[0.9989735,0.0001457652,0.0004892888,0.0001081162,0.0002341316,0.00004919717],"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.0001233717,0.0003149506,0.003324959,0.000159204,0.00007482902,5.284924e-7,0.003896552,0.4522343,0.001349714,0.5122352,0.0002137861,0.02607263],"study_design_scores_gemma":[0.0007274981,0.0001436856,0.009392613,0.00006928899,0.00001882335,0.00001649654,0.0003425669,0.9393218,0.0002046457,0.04919223,0.0004315275,0.0001388787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2827179,0.0002431738,0.7157826,0.0008287561,0.0000671374,0.0002124209,0.000003379582,0.00001129593,0.0001332829],"genre_scores_gemma":[0.97179,0.00003517813,0.02754391,0.0003579878,0.0002329557,0.00001083733,0.000003828812,0.00001683325,0.000008465073],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6890721,"threshold_uncertainty_score":0.3162628,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3119935873","doi":"10.1007/s11227-020-03582-7","title":"SS-ITS: secure scalable intelligent transportation systems","year":2021,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Anomaly Detection Techniques and Applications","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":"Brandon University","funders":"","keywords":"Computer science; Scalability; Intelligent transportation system; Reinforcement learning; Merge (version control); Distributed computing; Anomaly detection; Baseline (sea); Process (computing); Artificial intelligence; Database; Parallel computing; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01773233525814767,"gpt":0.2445898494599457,"spread":0.2268575142017981,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006669927,0.00007300499,0.0001314115,0.00005103636,0.0001944749,0.0001050004,0.0004841181,0.00003689542,0.00001098971],"category_scores_gemma":[0.00001555459,0.00005132342,0.00008020258,0.0004069841,0.00001575495,0.0002910589,0.00003383979,0.0002238823,0.000009570731],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003896234,"about_ca_system_score_gemma":0.00007532317,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001627019,"about_ca_topic_score_gemma":0.000002789069,"domain_scores_codex":[0.9990528,0.00008728116,0.0004183536,0.00009268986,0.0002188234,0.0001300137],"domain_scores_gemma":[0.999095,0.00009795466,0.0001710035,0.0002114046,0.0003722252,0.00005245922],"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.00004636403,0.0007882986,0.002666663,0.0003970037,0.0004610751,0.0002904794,0.02848085,0.1603226,0.1773108,0.4232335,0.01755198,0.1884504],"study_design_scores_gemma":[0.0006895924,0.0004431766,0.003929068,0.0007701902,0.0001586255,0.004033305,0.00776403,0.5568135,0.334453,0.006627698,0.08363149,0.0006862372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1143598,0.001291932,0.8828028,0.000846229,0.0003779474,0.00006384661,0.000001025045,0.00004949171,0.0002068889],"genre_scores_gemma":[0.9876114,0.0001719385,0.01176428,0.0001181927,0.0001719971,0.000001156323,7.685463e-7,0.00000610564,0.0001542321],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8732515,"threshold_uncertainty_score":0.2092908,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2033647326","doi":"10.1007/s11227-014-1086-0","title":"An analytical study of resource division and its impact on power and performance of multi-core processors","year":2014,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Parallel Computing and Optimization Techniques","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":"Toronto Metropolitan University","funders":"","keywords":"Benchmark (surveying); Computer science; Division (mathematics); Power consumption; Resource (disambiguation); Power (physics); Core (optical fiber); Multi-core processor; Chip; Architecture; Microarchitecture; Parallel computing; Distributed computing; Computer architecture; Embedded system; Computer engineering; Telecommunications; Computer network; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.02853709042077261,"gpt":0.3203201213855511,"spread":0.2917830309647785,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002064098,0.0001141662,0.0002765122,0.0001646559,0.0001243452,0.00003349268,0.0004761049,0.00003414635,6.263386e-7],"category_scores_gemma":[0.0001030956,0.00006650804,0.00003413102,0.0002258945,0.00004491107,0.000249918,0.0001644686,0.0002031062,1.142784e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001046145,"about_ca_system_score_gemma":0.00001930223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007172452,"about_ca_topic_score_gemma":2.772728e-7,"domain_scores_codex":[0.9987919,0.000212114,0.0004379915,0.0001267815,0.0002971848,0.0001340186],"domain_scores_gemma":[0.9989136,0.0002795767,0.0003038481,0.0002139156,0.0002129262,0.00007615732],"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.0004181004,0.001910606,0.2958013,0.0001550743,0.0001465113,0.0000059762,0.05218531,0.5913647,0.002920514,0.0005387088,0.0000596109,0.05449365],"study_design_scores_gemma":[0.0004455605,0.003593453,0.1231748,0.0001426816,0.00001197161,0.00003619206,0.0002566476,0.871499,0.0007542005,0.00001910456,0.000001216315,0.00006512306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9347932,0.00008926353,0.0649398,0.00003212088,0.00001812222,0.00008297402,1.848538e-7,0.00001890103,0.00002540719],"genre_scores_gemma":[0.9935634,0.00001384964,0.006373143,0.00002350305,0.00001771679,9.467673e-8,8.251559e-8,0.000006265196,0.000001934523],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2801344,"threshold_uncertainty_score":0.271212,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2036738287","doi":"10.1007/s11227-008-0215-z","title":"Prediction of dynamical, nonlinear, and unstable process behavior","year":2008,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":16,"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":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Computer science; Scheduling (production processes); Nonlinear system; Process (computing); Distributed computing; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.03187427107375176,"gpt":0.2506422405370324,"spread":0.2187679694632807,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003013519,0.00005301141,0.0001114634,0.00003618802,0.0001804817,0.00001590134,0.0003484233,0.00002045211,0.000001257398],"category_scores_gemma":[0.000009444268,0.00003376565,0.0000297255,0.0002068204,0.00007152676,0.0002567689,0.00007447383,0.0001575643,3.762241e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007982287,"about_ca_system_score_gemma":0.0000349023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008783265,"about_ca_topic_score_gemma":6.018064e-7,"domain_scores_codex":[0.9993462,0.00003122623,0.0002851895,0.00006277655,0.0001743417,0.000100298],"domain_scores_gemma":[0.9994614,0.00009213966,0.0001396478,0.0001232716,0.0001414541,0.00004208617],"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.0001430308,0.002812325,0.2691908,0.0003336215,0.0002734788,0.0001900455,0.03387698,0.1428039,0.2134166,0.01013198,0.003660697,0.3231666],"study_design_scores_gemma":[0.0005448343,0.0002980178,0.05116598,0.0001260565,0.00005251554,0.003207522,0.0002965611,0.9387239,0.004571185,0.0006489653,0.0002416363,0.0001227853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9100042,0.000168124,0.08937218,0.0002815841,0.00006801783,0.00005794474,0.000001177118,0.0000111482,0.00003561738],"genre_scores_gemma":[0.9884856,0.00009658727,0.01126903,0.00003391601,0.0001031368,4.929789e-7,2.85813e-7,0.000003473732,0.00000743591],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7959201,"threshold_uncertainty_score":0.1388137,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2888814465","doi":"10.1007/s11227-018-2572-6","title":"Multi-tenant intrusion detection system for public cloud (MTIDS)","year":2018,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; École de Technologie Supérieure","funders":"","keywords":"Computer science; Cloud computing; Intrusion detection system; Intrusion prevention system; Computer security; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.0311845848803633,"gpt":0.2480687843489743,"spread":0.216884199468611,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003207769,0.0001310963,0.0002089121,0.0001768945,0.0008780457,0.0001908965,0.0008890317,0.00008256162,0.000003879825],"category_scores_gemma":[0.0001488686,0.00007299955,0.0001357388,0.0004540596,0.00007418812,0.000700268,0.0002543972,0.0002988543,0.00001637597],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001366745,"about_ca_system_score_gemma":0.00005673737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002315468,"about_ca_topic_score_gemma":0.00003206414,"domain_scores_codex":[0.9983719,0.0002658872,0.0005725609,0.0001546067,0.0003107897,0.0003242836],"domain_scores_gemma":[0.9983274,0.0002783163,0.0003609578,0.0002941521,0.0006392766,0.00009991619],"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.0002751102,0.00016481,0.0001161554,0.0001153216,0.0001139377,0.00001082691,0.007326072,0.0007577091,0.1559259,0.003484176,0.0008780885,0.8308319],"study_design_scores_gemma":[0.001003366,0.001250128,0.0003236399,0.000248759,0.00003118066,0.001397078,0.0007490046,0.917905,0.06643518,0.0004460511,0.01001677,0.0001937966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3062075,0.0001032444,0.6892878,0.0005921542,0.003596026,0.0001267049,2.806628e-7,0.00006300414,0.00002333144],"genre_scores_gemma":[0.9697461,0.0000215738,0.02705685,0.0001226248,0.003029545,0.00000115906,1.681432e-7,0.00001134275,0.00001061704],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9171473,"threshold_uncertainty_score":0.6753307,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2896383989","doi":"10.1007/s11227-018-2653-6","title":"GPU parallelization of multigrid RANS solver for three-dimensional aerodynamic simulations on multiblock grids","year":2018,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Computational Fluid Dynamics and Aerodynamics","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Bombardier (Canada); Polytechnique Montréal","funders":"","keywords":"Multigrid method; Computer science; Parallel computing; Solver; Computational science; CUDA; Reynolds-averaged Navier–Stokes equations; Smoothing; Finite volume method; Context (archaeology); Computational fluid dynamics; Nonlinear system","retraction":null,"screen_n_in":null,"score":{"opus":0.01270840066271381,"gpt":0.2379001118671519,"spread":0.2251917112044381,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004423196,0.0001501076,0.0002281633,0.0001453482,0.0001792538,0.00001679485,0.0002129535,0.00005684621,0.00001149646],"category_scores_gemma":[0.00007478429,0.0001136192,0.0001338402,0.0001848691,0.00006788532,0.0001099085,0.00003022137,0.0001732284,0.000002808441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006637462,"about_ca_system_score_gemma":0.00003581921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001323709,"about_ca_topic_score_gemma":0.0001417077,"domain_scores_codex":[0.9988343,0.0000331272,0.0005849258,0.00008547661,0.0002734054,0.0001888001],"domain_scores_gemma":[0.99846,0.0007490853,0.0001228088,0.0001327826,0.0004874089,0.00004789374],"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.00005415445,0.00003783945,0.0006978918,0.00002142727,0.00006991925,4.844507e-7,0.0003025301,0.9857821,0.01021284,0.0004090607,0.0001007558,0.002311018],"study_design_scores_gemma":[0.0007920593,0.0001754352,0.01222581,0.0001169567,0.00004618623,0.00001861468,0.0000245855,0.9855195,0.0002103206,0.0007129098,0.00004048982,0.0001171734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7063381,0.00006097935,0.2928365,0.00007412586,0.0004903668,0.0001350207,0.00002213955,0.0000211709,0.00002164131],"genre_scores_gemma":[0.9889084,0.000007332145,0.01052102,0.0000388663,0.0004649086,5.286387e-7,0.00002111247,0.00003199342,0.000005819657],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2825703,"threshold_uncertainty_score":0.4633258,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2000511619","doi":"10.1007/s11227-013-1027-3","title":"Advanced technologies and applications for Highly-Reliable Cyber Physical System (HRCPS)","year":2013,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":15,"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, Okanagan Campus; University of British Columbia","funders":"","keywords":"Computer science; Cyber-physical system; Computer security; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.004769148502051667,"gpt":0.197990679478497,"spread":0.1932215309764453,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001786288,0.0000761439,0.0001451548,0.00004296725,0.0001439104,0.00002910465,0.0002023273,0.00003619976,5.938678e-7],"category_scores_gemma":[0.00001589717,0.00004749684,0.00004000778,0.0001007952,0.00005735704,0.0001743665,0.00003634448,0.0001732481,0.000006023745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002585284,"about_ca_system_score_gemma":0.000006286726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000496765,"about_ca_topic_score_gemma":5.697096e-7,"domain_scores_codex":[0.9995201,0.00000884885,0.000186671,0.00004979483,0.00008368313,0.000150896],"domain_scores_gemma":[0.9995416,0.0002107972,0.00004031596,0.0001048416,0.00007640455,0.00002608174],"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.00002864386,0.0001107311,0.0007340692,0.001207995,0.0002286721,0.000003752744,0.005360778,0.4564407,0.1907329,0.01155746,0.003685139,0.3299092],"study_design_scores_gemma":[0.001261917,0.0002665092,0.001753882,0.000748925,0.0001605098,0.0006171698,0.03535298,0.8784184,0.05773468,0.00483948,0.01829401,0.0005515074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9623508,0.00116083,0.03545979,0.0001747977,0.0001682293,0.0002779187,0.000001102432,0.0001530341,0.0002535254],"genre_scores_gemma":[0.9959277,0.00007606688,0.003711331,0.000007699397,0.0002485893,0.00001212726,2.005276e-7,0.00001051801,0.000005763876],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4219778,"threshold_uncertainty_score":0.1936865,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2034014585","doi":"10.1007/s11227-011-0718-x","title":"Green computing and communications","year":2011,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Green IT and Sustainability","field":"Engineering","cited_by":15,"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; Distributed computing; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.03232018699916013,"gpt":0.233890973435665,"spread":0.2015707864365049,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009311474,0.00006824833,0.0001232397,0.00004602746,0.0001485563,0.00001156334,0.0003687271,0.00002513819,0.000006753358],"category_scores_gemma":[0.0000255564,0.00004730927,0.00003549875,0.00009021942,0.00009512441,0.0001090366,0.0001292602,0.0002754218,0.00000145617],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002452445,"about_ca_system_score_gemma":0.00001027377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009225756,"about_ca_topic_score_gemma":0.00001246124,"domain_scores_codex":[0.9994085,0.00007598017,0.000276715,0.00002937329,0.00007767327,0.0001317388],"domain_scores_gemma":[0.9994131,0.0001791679,0.00004292721,0.0002286195,0.00008987753,0.0000462714],"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.00005878694,0.0001680452,0.2931713,0.0004308188,0.0004630656,0.00004364588,0.2171474,0.006306105,0.003961256,0.004338135,0.0008619116,0.4730496],"study_design_scores_gemma":[0.001118686,0.0002539705,0.4399057,0.0002725889,0.0002214162,0.001572555,0.02895349,0.5138158,0.001149503,0.01013877,0.002046116,0.0005514165],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9893293,0.001075813,0.00728524,0.0001239883,0.00009045714,0.0000413425,2.699266e-7,0.00003365155,0.002019882],"genre_scores_gemma":[0.9945287,0.00005511393,0.005304403,0.00002504557,0.00007264059,5.439023e-8,1.316394e-7,0.000009662887,0.000004256613],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5075097,"threshold_uncertainty_score":0.1929216,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4378533280","doi":"10.1007/s11227-023-05378-x","title":"Local differentially private federated learning with homomorphic encryption","year":2023,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"National Natural Science Foundation of China","keywords":"Homomorphic encryption; Computer science; Differential privacy; Shuffling; MNIST database; Inference; Encryption; Reduction (mathematics); Federated learning; Data mining; Machine learning; Artificial intelligence; Theoretical computer science; Computer security; Deep learning","retraction":null,"screen_n_in":null,"score":{"opus":0.0252148229056052,"gpt":0.2452658358440073,"spread":0.2200510129384021,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001936598,0.0001647014,0.0002405127,0.0002485276,0.0004970119,0.0002596345,0.01060473,0.00007434759,0.000005683754],"category_scores_gemma":[0.002269601,0.0001006775,0.00005582286,0.001101829,0.0001487174,0.0006703485,0.01574372,0.0008828319,0.00004483859],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000714061,"about_ca_system_score_gemma":0.00007817319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001886633,"about_ca_topic_score_gemma":0.000004572308,"domain_scores_codex":[0.9981326,0.0002935884,0.0004332727,0.0001884037,0.0005511008,0.000400985],"domain_scores_gemma":[0.9977019,0.0004431546,0.0002903623,0.001318931,0.0001843936,0.00006127479],"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.0003697723,0.0003230237,0.0252403,0.0002223961,0.0008727091,0.001625696,0.005812512,0.1145479,0.1534037,0.005469959,0.03884384,0.6532682],"study_design_scores_gemma":[0.0006684234,0.0004356711,0.01026068,0.0003304077,0.00003041679,0.0009534056,0.000548006,0.9627783,0.007987841,0.01545117,0.000307697,0.0002479712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4905981,0.00004134428,0.5043477,0.004369326,0.0001445775,0.00004489127,2.144616e-7,0.0004338151,0.00002011236],"genre_scores_gemma":[0.9634251,0.00007891872,0.03632979,0.00005204071,0.00008195704,5.475426e-7,0.000001659202,0.0000213828,0.000008608551],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8482304,"threshold_uncertainty_score":0.9947484,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1488661425","doi":"10.1023/a:1011179823237","title":"Improving A Solution's Quality Through Parallel Processing","year":2001,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":15,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04406715998923561,"gpt":0.3002528029644518,"spread":0.2561856429752162,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003441414,0.0001667784,0.0002591505,0.00009124228,0.000495201,0.0002296428,0.001168911,0.00005170662,0.000008512716],"category_scores_gemma":[0.000212078,0.0001154439,0.0001378125,0.00051297,0.00008568644,0.002063053,0.0002806471,0.0004897232,0.00001287595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001480698,"about_ca_system_score_gemma":0.0002081811,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002630587,"about_ca_topic_score_gemma":0.00000945987,"domain_scores_codex":[0.9977341,0.0003634083,0.0007387482,0.000180141,0.0005884044,0.0003951923],"domain_scores_gemma":[0.998341,0.0003349835,0.0005511823,0.0003254638,0.0003659165,0.00008145803],"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.0002528437,0.0004159962,0.004704145,0.0001950957,0.0001040957,0.0001582147,0.02747042,0.03843651,0.2040211,0.006203537,0.0009157134,0.7171223],"study_design_scores_gemma":[0.002108349,0.0003788832,0.01243281,0.0004818131,0.00007272758,0.004140248,0.001646705,0.96183,0.003569946,0.01158458,0.001117479,0.0006364348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2669844,0.0006211739,0.7299286,0.001913036,0.0002227616,0.00006527469,1.512416e-7,0.00005928196,0.0002053291],"genre_scores_gemma":[0.8609496,0.00003270405,0.1381152,0.0004237689,0.000449009,4.389821e-7,2.654894e-7,0.00001111843,0.00001785678],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9233935,"threshold_uncertainty_score":0.4707664,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4380590100","doi":"10.1007/s11227-023-05474-y","title":"A network anomaly detection algorithm based on semi-supervised learning and adaptive multiclass balancing","year":2023,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"China Scholarship Council; Natural Science Foundation of Fujian Province; National Natural Science Foundation of China","keywords":"Computer science; Anomaly detection; Machine learning; Artificial intelligence; Data mining; Internet traffic; The Internet; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01359575752609415,"gpt":0.2234610984885088,"spread":0.2098653409624146,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002662891,0.0001482692,0.000213885,0.0001932763,0.0007010373,0.0001274269,0.0003437432,0.000071698,0.000004700645],"category_scores_gemma":[0.0001042757,0.000109403,0.00007983966,0.0009310932,0.00004123709,0.0003498717,0.0001745536,0.0006993733,0.00001087589],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006466372,"about_ca_system_score_gemma":0.00003702662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002978544,"about_ca_topic_score_gemma":0.000008339252,"domain_scores_codex":[0.9982216,0.0005009693,0.0003811106,0.0001757845,0.0003774464,0.0003430283],"domain_scores_gemma":[0.99845,0.0009630852,0.0002022436,0.0001499361,0.0001449923,0.00008977703],"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.00009423139,0.00002799013,0.0008501237,0.00001315322,0.00003532002,0.00004786054,0.002695061,0.4717647,0.004234134,0.00009078801,0.0001471152,0.5199996],"study_design_scores_gemma":[0.0004767178,0.0005605611,0.002065011,0.0001830951,0.00001534511,0.0001483268,0.0003725292,0.9944935,0.0008929892,0.0004304766,0.0002398863,0.0001215875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4293046,0.0001294225,0.5694222,0.0002820166,0.0005910816,0.00007962235,1.681609e-7,0.0001113993,0.00007950634],"genre_scores_gemma":[0.9850063,0.00004338695,0.01395431,0.0002537784,0.0007170792,7.54485e-7,2.848539e-7,0.00001332525,0.00001081389],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5557017,"threshold_uncertainty_score":0.5391883,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2790511610","doi":"10.1007/s11227-018-2313-x","title":"The influence of textual and verbal word-of-mouth on website usability and visual appeal","year":2018,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Digital Marketing and Social Media","field":"Social Sciences","cited_by":15,"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":"Usability; Appeal; Word of mouth; Computer science; Perception; Web usability; World Wide Web; Human–computer interaction; Advertising; Psychology; Political science","retraction":null,"screen_n_in":null,"score":{"opus":0.01247080338777228,"gpt":0.3010013188395673,"spread":0.288530515451795,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050109,0.00006668421,0.0001709036,0.00002664951,0.000565038,0.00005327774,0.0002106996,0.00004275966,0.000002214248],"category_scores_gemma":[0.001746328,0.00003847521,0.00003995698,0.0001516285,0.001782276,0.000147004,0.00008373913,0.0001816423,7.709294e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002255318,"about_ca_system_score_gemma":0.00009921107,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00033899,"about_ca_topic_score_gemma":0.0001261905,"domain_scores_codex":[0.9985919,0.0004397774,0.0003393948,0.00006571723,0.0003813026,0.0001818828],"domain_scores_gemma":[0.9972321,0.0022033,0.0002142265,0.00006073376,0.0002138611,0.00007574834],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0007624176,0.0001480905,0.09992449,0.00005104466,0.00009423626,0.000002887224,0.2195974,0.00006824061,0.001923964,0.002793069,0.0001278807,0.6745062],"study_design_scores_gemma":[0.0006936533,0.0006868721,0.873468,0.0005858776,0.00006557273,0.00001873538,0.1195509,0.0002487746,0.0003265916,0.002832026,0.001333977,0.0001890647],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9971944,0.0001319479,0.000005574058,0.0004121872,0.000139969,0.00005751086,0.000001179541,0.000004817955,0.002052415],"genre_scores_gemma":[0.9994239,0.00007164417,0.00003784864,0.00003424302,0.000411657,7.546187e-8,3.896206e-8,0.000003740236,0.00001686445],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7735435,"threshold_uncertainty_score":0.6566869,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4297962057","doi":"10.1007/s11227-022-04834-4","title":"A Bayesian-based classification framework for financial time series trend prediction","year":2022,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Stock Market Forecasting Methods","field":"Decision Sciences","cited_by":14,"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; Hyperparameter; Artificial intelligence; Machine learning; Sharpe ratio; Bayesian optimization; Metric (unit); Preprocessor; Bayesian probability; Time series; Performance metric; Deep learning; Finance; Portfolio","retraction":null,"screen_n_in":null,"score":{"opus":0.09994368813030834,"gpt":0.3707152048949446,"spread":0.2707715167646362,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.02137829,0.0001172883,0.0002847515,0.0003061208,0.0010352,0.0001069219,0.0008882972,0.00005392004,0.0003126457],"category_scores_gemma":[0.01339993,0.00007836014,0.0002140126,0.000863309,0.00008022512,0.0002343838,0.0001213001,0.000502323,0.000004178447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000124159,"about_ca_system_score_gemma":0.000228588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001987113,"about_ca_topic_score_gemma":9.944293e-7,"domain_scores_codex":[0.9959549,0.00144277,0.0009807386,0.0001757381,0.001215679,0.0002301602],"domain_scores_gemma":[0.9875759,0.01097658,0.0007538991,0.00032357,0.0003053523,0.00006467103],"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.003507294,0.0002787515,0.01379503,0.00002403624,0.00007823308,0.00001319512,0.009536085,0.1663886,0.009751132,0.003890736,0.03896227,0.7537746],"study_design_scores_gemma":[0.001074748,0.001533423,0.03851398,0.0001040914,0.0001255203,0.0005432732,0.003950012,0.7663686,0.0007256969,0.1668127,0.01999136,0.0002565282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2346443,0.00007955144,0.7616605,0.002078036,0.001111387,0.0001670553,0.00002687657,0.00002265407,0.0002096611],"genre_scores_gemma":[0.8322929,9.814328e-7,0.16655,0.0002166786,0.0007663968,0.000006420241,0.000002572559,0.00001692791,0.0001471204],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7535181,"threshold_uncertainty_score":0.9949106,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2578574048","doi":"10.1007/s11227-017-1960-7","title":"Implementing fuzzy rank function model for a new supply chain risk management","year":2017,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Supply Chain Resilience and Risk Management","field":"Business, Management and Accounting","cited_by":14,"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":"Supply chain risk management; Supply chain; Computer science; Risk analysis (engineering); Risk management; Supply chain management; Fuzzy logic; Outsourcing; Financial risk; Fuzzy set; Vulnerability (computing); Function (biology); Service management; Operations research; Business; Finance; Marketing; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.02397773957261045,"gpt":0.2582877369231619,"spread":0.2343099973505514,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.004399414,0.0002492894,0.0003168754,0.000302243,0.002511222,0.0007683866,0.001217905,0.00004839138,0.00004105964],"category_scores_gemma":[0.0001489548,0.0001689238,0.000274803,0.000138358,0.00006719178,0.00149999,0.0007226622,0.0002690189,0.00002599067],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000491449,"about_ca_system_score_gemma":0.00002969988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006033918,"about_ca_topic_score_gemma":0.0001397968,"domain_scores_codex":[0.9978966,0.00002549583,0.000712697,0.0002191675,0.0004905598,0.0006554607],"domain_scores_gemma":[0.9978733,0.0001154443,0.001231843,0.0005363432,0.0002103459,0.0000326879],"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.0009734302,0.0002042952,0.05882879,0.0005804617,0.0008984442,0.00003304734,0.001885108,0.1315743,0.0003848707,0.04301096,0.06368238,0.6979439],"study_design_scores_gemma":[0.004886285,0.00008688197,0.02272266,0.0003733228,0.001425406,0.00001818221,0.00689552,0.8522455,0.00004042488,0.05402061,0.05673717,0.0005480511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5149264,0.000494735,0.468632,0.00440318,0.001621113,0.001130438,0.000003886892,0.00007511285,0.008713095],"genre_scores_gemma":[0.9893442,0.0002057272,0.005243154,0.0008343874,0.0036208,0.000005345617,0.00000461029,0.00004034135,0.0007014745],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7206712,"threshold_uncertainty_score":0.9987873,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2019020869","doi":"10.1007/s11227-011-0674-5","title":"Secure communication mechanism for ubiquitous Smart grid infrastructure","year":2011,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":14,"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; Authentication (law); Computer security; Mobile device; Computer network; Smart grid; Trusted Platform Module; Default gateway; Scalability; Digital signature; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.02786160850852305,"gpt":0.2621968361261642,"spread":0.2343352276176411,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001281411,0.0001230585,0.0001792044,0.00007576529,0.0003239907,0.00005391473,0.00198713,0.00005796001,0.00001063413],"category_scores_gemma":[0.0001355361,0.00008466963,0.00009664666,0.0001897499,0.00005612843,0.0006513313,0.000332732,0.0003507992,0.000003721397],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004920495,"about_ca_system_score_gemma":0.00006863225,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000754584,"about_ca_topic_score_gemma":0.000002825702,"domain_scores_codex":[0.9987521,0.0001895979,0.0004945282,0.0001103317,0.0002395439,0.0002139661],"domain_scores_gemma":[0.9981213,0.0002702417,0.0004368585,0.0005842826,0.0005198183,0.00006753064],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005182917,0.000100595,0.0002563098,0.00004889036,0.00006274047,0.000003357248,0.03982281,0.0003447666,0.004413801,0.9334077,0.0004164572,0.02107078],"study_design_scores_gemma":[0.0006543767,0.000241024,0.001397578,0.0001169674,0.00003280837,0.0004026831,0.0008084449,0.03978674,0.01648661,0.939237,0.0006544378,0.0001813507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0376882,0.0000801112,0.9601517,0.000548195,0.0003694645,0.0009567749,0.000001662437,0.00004245508,0.0001614515],"genre_scores_gemma":[0.7342146,0.00001257531,0.2653242,0.0002872557,0.0001285403,0.0000168017,6.466457e-7,0.000009721997,0.000005693747],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6965264,"threshold_uncertainty_score":0.3692615,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}