{"meta":{"query_hash":"f1b03580179b","filters":{"venue":"Cluster Computing"},"cohort_total":99,"direct_labels_cover":0,"predictions_cover":99,"exported":99,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/f1b03580179b","api":"https://metacan.xera.ac/api/v1/cohort?venue=Cluster+Computing"},"results":[{"id":"W1509547215","doi":"10.1023/a:1011454709330","title":"A Heuristic-Based Wormhole Routing Algorithm for Hypercube Multicomputer Networks","year":2001,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"King Fahd University of Petroleum and Minerals; University of Toronto; University of Saskatchewan","keywords":"Computer science; Hypercube; Node (physics); Routing (electronic design automation); Fault tolerance; Path (computing); Fault (geology); Routing algorithm; Adaptive routing; Algorithm; Parallel computing; Distributed computing; Computer network; Link-state routing protocol; Routing protocol","score_opus":0.018128057815828175,"score_gpt":0.2501036426428538,"score_spread":0.2319755848270256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509547215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034758598,0.00010267684,0.99076813,0.0004385712,0.003564209,0.0005369781,0.0000013065152,0.0004982708,0.0006139912],"genre_scores_gemma":[0.6938377,0.0000010362971,0.30212313,0.0020594567,0.0017355635,0.000019045041,0.000007888421,0.000031914537,0.00018425428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736565,0.00016146616,0.0006678608,0.0007419864,0.00023981553,0.00082322437],"domain_scores_gemma":[0.99797535,0.0007480803,0.00024459726,0.000616124,0.00024914954,0.00016667272],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009317493,0.0003146659,0.00039689118,0.00014498134,0.0005671788,0.00058337714,0.0008823774,0.00015516835,0.0000057807533],"category_scores_gemma":[0.000044263787,0.00029850422,0.00024734103,0.00044023324,0.0000366705,0.00028038328,0.00036841538,0.0002815187,0.000025792333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014295917,0.00009819967,0.00064958475,0.00002354946,0.000042161737,0.000035557037,0.00052579626,0.3872621,0.00001169828,0.001579364,0.0029457733,0.60681194],"study_design_scores_gemma":[0.0012209398,0.000097100776,0.00020473245,0.00016558557,0.000009794255,0.000119489414,0.000035831916,0.98964643,0.000017288676,0.00010518832,0.008002935,0.00037466217],"about_ca_topic_score_codex":0.000028194348,"about_ca_topic_score_gemma":0.000007054786,"teacher_disagreement_score":0.69036186,"about_ca_system_score_codex":0.000109205175,"about_ca_system_score_gemma":0.000043193246,"threshold_uncertainty_score":0.9999467},"labels":[],"label_agreement":null},{"id":"W1514196962","doi":"10.1023/a:1011808526481","title":"Exploiting Locality in Single Assignment Data Structures Updated Through Split-Phase Transactions","year":2001,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"International Social Science Council; Defense Advanced Research Projects Agency; Australian Centre for Advanced Photovoltaics; University of Delaware","keywords":"Computer science; Cache; Locality; Speedup; Porting; Exploit; Latency (audio); Parallel computing; Locality of reference; Software; Operating system","score_opus":0.0872778500453001,"score_gpt":0.3401463011643994,"score_spread":0.25286845111909934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514196962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032602467,0.00009336193,0.9640394,0.0006725936,0.00029585944,0.00024796237,0.0000076899505,0.00079010293,0.0012505667],"genre_scores_gemma":[0.68449986,0.0000065406193,0.3147934,0.0005336534,0.00007450964,0.0000023566438,0.000048079353,0.000013695962,0.000027917733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744505,0.0002527668,0.0006440491,0.00083633163,0.00030805534,0.00051374454],"domain_scores_gemma":[0.9982059,0.00016305053,0.00020953479,0.0012465874,0.00008486854,0.00009007283],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006715419,0.00024784874,0.00028922406,0.00014549318,0.00031393307,0.00033157153,0.0016816503,0.00010301212,0.000031427953],"category_scores_gemma":[0.000048913815,0.00025506516,0.000054120355,0.00076790224,0.000058896556,0.00091812806,0.0006240009,0.00032689841,0.000010643126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004939314,0.001065222,0.0010073673,0.000060348375,0.00006306549,0.00014158725,0.0044767885,0.58645946,0.00047812235,0.003480691,0.0028111022,0.39990684],"study_design_scores_gemma":[0.0009766928,0.00006325695,0.00023485237,0.00008130757,0.0000065909494,0.000062713334,0.0001266824,0.992202,0.0009245652,0.002486671,0.0025239198,0.00031074008],"about_ca_topic_score_codex":0.00006408403,"about_ca_topic_score_gemma":0.000016200487,"teacher_disagreement_score":0.6518974,"about_ca_system_score_codex":0.0001386101,"about_ca_system_score_gemma":0.000061547056,"threshold_uncertainty_score":0.99999017},"labels":[],"label_agreement":null},{"id":"W1549249462","doi":"10.1023/a:1025713926030","title":"Using System Emulation to Model Next-Generation Shared Virtual Memory Clusters","year":2003,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Emulation; Shared memory; Distributed shared memory; Cache coherence; Distributed computing; Abstraction; Software; Cache; Leverage (statistics); Abstraction layer; Scalability; Computer architecture; Embedded system; Operating system; CPU cache; Memory management; Uniform memory access; Overlay; Cache algorithms","score_opus":0.09454530633250477,"score_gpt":0.29453342677653127,"score_spread":0.1999881204440265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549249462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06586208,0.0000295469,0.9305348,0.000100352685,0.0006510934,0.00039437614,8.4153646e-7,0.0009301772,0.0014967574],"genre_scores_gemma":[0.5607671,2.4524778e-7,0.43854144,0.0004959867,0.000100922065,0.0000031386833,0.0000044671247,0.000016718086,0.000069983595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977325,0.000286293,0.00054406445,0.0006609561,0.0003505931,0.0004255683],"domain_scores_gemma":[0.99873257,0.000077290504,0.0002158183,0.0005881889,0.00021809392,0.00016806592],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078430335,0.000257462,0.00026439613,0.00029730765,0.00051693065,0.0005931914,0.00060149963,0.000117022064,0.0000020323248],"category_scores_gemma":[0.000087092536,0.00028131023,0.00008867725,0.00058026897,0.000017388871,0.00068946404,0.00036529696,0.00015441234,0.000028284283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026180746,0.000015880521,0.000028790464,0.00001565861,0.0000075955454,0.000002110992,0.0012698873,0.9877143,0.0015786698,0.005745646,0.0005270923,0.003091779],"study_design_scores_gemma":[0.00030954182,0.000040435836,0.000012957419,0.000102086575,0.0000074100103,0.000034449266,0.00008541554,0.9973329,0.0016344393,0.00007088108,0.000043217788,0.00032628115],"about_ca_topic_score_codex":0.000009229251,"about_ca_topic_score_gemma":0.0000014018331,"teacher_disagreement_score":0.49490502,"about_ca_system_score_codex":0.00029605546,"about_ca_system_score_gemma":0.00011054267,"threshold_uncertainty_score":0.9999639},"labels":[],"label_agreement":null},{"id":"W1563694061","doi":"10.1023/a:1012705007864","title":"A Gracefully Degradable Declustered RAID Architecture","year":2002,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Computer science; RAID; Prime (order theory); Control reconfiguration; Parallel computing; Computer hardware; Combinatorics; Mathematics; Embedded system","score_opus":0.02393951936800257,"score_gpt":0.23457954180919635,"score_spread":0.21064002244119379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563694061","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011449249,0.0007218991,0.98014474,0.0027052327,0.00044600092,0.0002467447,0.0000027660653,0.0019118511,0.0023714884],"genre_scores_gemma":[0.473895,0.0000055330884,0.52441084,0.0010374838,0.00009424892,0.000006135019,0.0000028996144,0.000022678736,0.0005251586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997801,0.00008167946,0.0003619769,0.0007447867,0.0003187436,0.00069179485],"domain_scores_gemma":[0.99795735,0.00026273684,0.00018326276,0.0014182598,0.000068041176,0.00011033798],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022489269,0.00029477777,0.00029231876,0.00024055986,0.00034670735,0.00026302697,0.0022245625,0.00012631388,0.000022004047],"category_scores_gemma":[0.00021531936,0.00026983712,0.00009688821,0.0007465508,0.00011780776,0.0005793208,0.0021852688,0.0004462486,0.00020961529],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007815286,0.00011465778,0.00036615838,0.00005837192,0.000039306025,0.00017485167,0.0021463588,0.012788085,0.00063423405,0.008106968,0.019084586,0.9564786],"study_design_scores_gemma":[0.00097159564,0.00012819246,0.00018427675,0.000096883916,0.00000867727,0.00043887814,0.000080258615,0.9416392,0.0015034877,0.012586375,0.041694645,0.00066756265],"about_ca_topic_score_codex":0.000006478782,"about_ca_topic_score_gemma":0.000008502831,"teacher_disagreement_score":0.955811,"about_ca_system_score_codex":0.00008853542,"about_ca_system_score_gemma":0.0000143973775,"threshold_uncertainty_score":0.9999754},"labels":[],"label_agreement":null},{"id":"W1573408443","doi":"10.1023/a:1025718026938","title":"Behavior and Performance of Interactive Multi-Player Game Servers","year":2003,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Server; Bottleneck; Benchmarking; Scalability; Online transaction processing; Class (philosophy); Architecture; The Internet; Software deployment; Transaction processing; Database transaction; World Wide Web; Software engineering; Database; Artificial intelligence; Embedded system","score_opus":0.016981213291262624,"score_gpt":0.24824137192620366,"score_spread":0.23126015863494104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573408443","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89010423,0.00006612354,0.10831481,0.00005204965,0.0003436408,0.00016192843,2.1439828e-7,0.000082825165,0.00087417715],"genre_scores_gemma":[0.9666782,0.0000014471408,0.03291655,0.00016299693,0.000025851909,0.000002348409,2.6656355e-7,0.000009525776,0.00020283212],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881226,0.00010203973,0.00028126183,0.0003666285,0.00016757971,0.00027020936],"domain_scores_gemma":[0.9992368,0.00011223286,0.0001658059,0.00034990438,0.00006568561,0.000069558446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036901736,0.00015260982,0.00019192629,0.00011048446,0.00011891211,0.00007787131,0.0003949666,0.000041160627,0.0000028796208],"category_scores_gemma":[0.000027984512,0.0001409518,0.0000554376,0.00021999978,0.000052291176,0.00005445074,0.00058252556,0.00016247427,0.000008272114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006781388,0.0011595421,0.3187069,0.00069660554,0.0002714428,0.000091440794,0.033250898,0.10775594,0.001558415,0.0068599833,0.0004831232,0.5290979],"study_design_scores_gemma":[0.00077847217,0.00012691124,0.041800573,0.000119622244,0.0000144458945,0.00004921179,0.00018068452,0.9549618,0.001225295,0.000012638798,0.000524111,0.00020624055],"about_ca_topic_score_codex":0.0000121168505,"about_ca_topic_score_gemma":0.0000013190797,"teacher_disagreement_score":0.8472059,"about_ca_system_score_codex":0.000032990094,"about_ca_system_score_gemma":0.000016136106,"threshold_uncertainty_score":0.57478476},"labels":[],"label_agreement":null},{"id":"W1599674946","doi":"10.1023/a:1013985610753","title":"Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks","year":2002,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":140,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Greedy algorithm; Node (physics); Hop (telecommunications); Packet forwarding; Computer network; Algorithm; Network packet; Geographic routing; Communication source; Routing protocol; Static routing","score_opus":0.010729929712024047,"score_gpt":0.2009819713228837,"score_spread":0.19025204161085965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599674946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32880747,0.00016654469,0.66964453,0.00012419582,0.00019010481,0.00017125445,1.8394765e-7,0.00013313323,0.00076259056],"genre_scores_gemma":[0.9738443,0.000005513596,0.024271615,0.0016208988,0.00020043377,0.000005519287,0.0000010783367,0.000026122318,0.000024505222],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978639,0.00014676886,0.0004358233,0.00066500896,0.0002501615,0.00063832256],"domain_scores_gemma":[0.99881643,0.00036931402,0.00016561769,0.00047842212,0.000055297136,0.00011491599],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004687774,0.00026843863,0.00031904838,0.00013751072,0.0001649495,0.00031892516,0.0007367602,0.00010283873,0.000008655714],"category_scores_gemma":[0.000011244796,0.00024777316,0.0000481476,0.00048426638,0.00007980908,0.0003000111,0.0006234138,0.000488687,0.0000063125517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049196653,0.000121399695,0.15432559,0.000044232293,0.00003669766,0.0003434867,0.0019263651,0.59596944,0.000044611443,0.00096465414,0.00042184663,0.24575248],"study_design_scores_gemma":[0.0011328111,0.00006671262,0.005226509,0.00047772485,0.0000059853137,0.000103663144,0.00003191039,0.9925586,0.00002357667,0.000012277712,0.000056397846,0.000303861],"about_ca_topic_score_codex":0.00007063863,"about_ca_topic_score_gemma":0.00008093825,"teacher_disagreement_score":0.64537287,"about_ca_system_score_codex":0.000077895995,"about_ca_system_score_gemma":0.000017660917,"threshold_uncertainty_score":0.99999744},"labels":[],"label_agreement":null},{"id":"W1963959738","doi":"10.1007/s10586-015-0446-8","title":"Congestion-aware TCP-friendly system for multimedia transmission based on UDP","year":2015,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer network; Transmission (telecommunications); Network congestion; Transmission Control Protocol; Multimedia; Telecommunications; Network packet","score_opus":0.019740784220199235,"score_gpt":0.24706646756602482,"score_spread":0.2273256833458256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963959738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018912635,0.000088542976,0.99229896,0.0018975021,0.0017777368,0.0006026124,0.0000034633822,0.00068791513,0.0007519791],"genre_scores_gemma":[0.9148888,2.716475e-7,0.08373655,0.000719515,0.00047278972,0.000029754878,0.00001314037,0.000021384085,0.00011782393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980888,0.00016370673,0.00037733794,0.00056359987,0.00037098545,0.00043558737],"domain_scores_gemma":[0.99804586,0.00072170293,0.0001508164,0.00046544726,0.00028607054,0.00033008374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073332415,0.00023914818,0.00028471428,0.00011407281,0.00024655208,0.00018195901,0.00065853505,0.000121926874,0.000002126119],"category_scores_gemma":[0.000061345156,0.00021400278,0.00012516056,0.00024141147,0.00003527624,0.00017073382,0.00007706554,0.00017729828,0.000049324924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010358351,0.00007266174,0.00009941304,0.000078612866,0.000015422307,0.000013674754,0.00057366485,0.24019583,0.000012556949,0.0023588315,0.006630516,0.74984527],"study_design_scores_gemma":[0.0031460782,0.00027371914,0.0000831644,0.000292874,0.000014927996,0.000011737745,0.00008846373,0.98829806,0.00006414333,0.000033018605,0.0074394606,0.00025436134],"about_ca_topic_score_codex":0.000004626288,"about_ca_topic_score_gemma":0.0000013015642,"teacher_disagreement_score":0.9129975,"about_ca_system_score_codex":0.0001280244,"about_ca_system_score_gemma":0.00018146016,"threshold_uncertainty_score":0.87267804},"labels":[],"label_agreement":null},{"id":"W1991774940","doi":"10.1007/s10586-011-0157-8","title":"A smart spaces architecture based on heterogeneous contexts, particularly social contexts","year":2011,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Ubiquitous computing; Smart environment; Architecture; Context (archaeology); Smart objects; Ambient intelligence; Wireless sensor network; Human–computer interaction; Context-aware pervasive systems; Data science; Context awareness; World Wide Web; Internet of Things; Computer network","score_opus":0.03434927812730705,"score_gpt":0.24872590352701995,"score_spread":0.21437662539971292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991774940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17159835,0.00008113209,0.82144016,0.0010253728,0.0009774216,0.0005718895,0.000006379567,0.00057269493,0.0037266116],"genre_scores_gemma":[0.9910911,1.8519555e-7,0.0052748984,0.0031754307,0.00028990034,0.000024599305,0.000004315253,0.00003512773,0.000104451465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697584,0.00057312136,0.0005001451,0.0008145406,0.0004802693,0.0006560778],"domain_scores_gemma":[0.998158,0.00046518727,0.00032585082,0.00065659074,0.00019719262,0.00019721386],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000596425,0.00038232733,0.0004813748,0.00022095456,0.00045696236,0.00043253877,0.00091021357,0.0001578001,0.00003399127],"category_scores_gemma":[0.000089469584,0.00036333583,0.00028182665,0.00033608568,0.00011213082,0.0002787187,0.00039839948,0.0003846297,0.00021180653],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039486567,0.001209952,0.010015058,0.00024798157,0.00039084017,0.00066750916,0.042646345,0.0021029203,0.0010430663,0.0023700336,0.0043506734,0.9345608],"study_design_scores_gemma":[0.0078003407,0.0015238484,0.022089692,0.00090981694,0.00009788023,0.0006435511,0.000353801,0.9332564,0.0099994475,0.002339797,0.01818373,0.0028017184],"about_ca_topic_score_codex":0.00007866038,"about_ca_topic_score_gemma":0.000064267275,"teacher_disagreement_score":0.93175906,"about_ca_system_score_codex":0.000088410314,"about_ca_system_score_gemma":0.00010660071,"threshold_uncertainty_score":0.99988186},"labels":[],"label_agreement":null},{"id":"W1993015214","doi":"10.1023/b:clus.0000028005.97093.ec","title":"Performance Evaluation of Shared Mesh Protection in WDM Networks","year":2004,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Exploit; Scalability; Path (computing); Selection (genetic algorithm); Node (physics); Distributed computing; Resource (disambiguation); Mathematical optimization; Computer network; Artificial intelligence","score_opus":0.02261660445200595,"score_gpt":0.24440444342156312,"score_spread":0.22178783896955717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993015214","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7225053,0.00013031355,0.27617767,0.000024928791,0.00014912352,0.00028910267,1.3061492e-7,0.00026086328,0.0004625833],"genre_scores_gemma":[0.976021,0.000010337983,0.023872051,0.000007120132,0.000055848577,0.000015108033,0.0000021433646,0.000015349535,0.0000010560167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992839,0.000015477706,0.00023543321,0.00011900444,0.00014994966,0.00019620216],"domain_scores_gemma":[0.9997286,0.00002294952,0.00003833558,0.00013952279,0.000056745183,0.0000138441255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033546216,0.00009018619,0.00012255085,0.000080794576,0.000028187851,0.000008587494,0.00010019962,0.00008910991,0.0000029744126],"category_scores_gemma":[0.00005375405,0.00009547812,0.000020095384,0.00032088088,0.000026940304,0.00012472719,0.00006122253,0.00021337382,0.0000032242083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031793072,0.000005762681,0.0003865168,0.000024553166,0.000003492041,2.302945e-7,0.000080677724,0.8664193,0.00013073522,0.000029545863,0.0000035718726,0.1329124],"study_design_scores_gemma":[0.0005295831,0.000025299898,0.009102452,0.00021287134,0.000005668482,0.0000024661388,0.00003132239,0.9891377,0.00044244042,0.00040912462,0.0000067573687,0.000094312614],"about_ca_topic_score_codex":0.0000027031879,"about_ca_topic_score_gemma":0.000008634785,"teacher_disagreement_score":0.25351572,"about_ca_system_score_codex":0.00019470083,"about_ca_system_score_gemma":0.00000839317,"threshold_uncertainty_score":0.38934848},"labels":[],"label_agreement":null},{"id":"W1996451519","doi":"10.1007/s10586-011-0188-1","title":"Energy cost evaluation of parallel algorithms for multiprocessor systems","year":2011,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Parallel computing; Scalability; Energy consumption; Multiprocessing; CUDA; Matrix multiplication; Computation; Scheduling (production processes); Algorithm; Operating system","score_opus":0.10519926558241342,"score_gpt":0.31863618000184163,"score_spread":0.2134369144194282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996451519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012249332,0.00043291823,0.9954,0.000029455163,0.0005218187,0.0005839752,0.0000019691379,0.00034030946,0.0014646003],"genre_scores_gemma":[0.59020853,0.0000032955045,0.4095311,0.00006166056,0.000073577794,0.000048881135,0.000005850514,0.000011404263,0.00005570626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819636,0.00018615801,0.00051565986,0.0004161196,0.0003904371,0.00029523656],"domain_scores_gemma":[0.998002,0.00017727425,0.00040062817,0.00043723715,0.0009136452,0.00006921976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015968049,0.00016789942,0.00026217362,0.00016084523,0.00015683306,0.000074493844,0.00077552494,0.000091175694,0.0000021468488],"category_scores_gemma":[0.000091694834,0.00016318046,0.00008781497,0.0002856155,0.000037594775,0.00022720738,0.0002586889,0.00006527538,0.0000026757828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004358674,0.00032549808,0.00055237196,0.00022099142,0.00010648037,0.0000017636187,0.0056030042,0.5012004,0.00009731082,0.045100052,0.0024843847,0.4442642],"study_design_scores_gemma":[0.00086287543,0.00007770937,0.00013471792,0.00008579824,0.000019016172,0.00000890889,0.000038805378,0.99553126,0.0009602969,0.0016736276,0.0004168811,0.00019011977],"about_ca_topic_score_codex":0.000059706195,"about_ca_topic_score_gemma":0.0000015072701,"teacher_disagreement_score":0.5889836,"about_ca_system_score_codex":0.00005650003,"about_ca_system_score_gemma":0.00009708768,"threshold_uncertainty_score":0.6654306},"labels":[],"label_agreement":null},{"id":"W1997051250","doi":"10.1007/s10586-011-0165-8","title":"Exploiting application buffer reuse to improve MPI small message transfer protocols over RDMA-enabled networks","year":2011,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Remote direct memory access; InfiniBand; Computer science; Communication source; Message passing; Computer network; Transfer (computing); Protocol (science); Latency (audio); Reuse; Message queue; Operating system; Distributed computing; Telecommunications","score_opus":0.033918410432737106,"score_gpt":0.2669658850689768,"score_spread":0.23304747463623968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997051250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013643004,0.000018234003,0.9745017,0.00016979754,0.00020090956,0.007009774,8.3320595e-7,0.001536243,0.002919466],"genre_scores_gemma":[0.5967961,0.0000013985581,0.39972863,0.0015806577,0.0002569723,0.0014407593,0.000004411291,0.00004817938,0.00014287891],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970495,0.00021580386,0.0007224066,0.0009981766,0.00027717304,0.000736912],"domain_scores_gemma":[0.9976344,0.00015445371,0.00017930426,0.0015651082,0.00022623906,0.00024050084],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010600555,0.00037329004,0.00038579266,0.00021189098,0.0003845766,0.000334773,0.002208202,0.00018571515,0.000012312875],"category_scores_gemma":[0.00008700582,0.00037142597,0.00013734815,0.00069402216,0.000036327903,0.0004042094,0.0012560559,0.00037603197,0.0000377967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039220008,0.0013679148,0.009384592,0.00061254384,0.00027228726,0.00008656366,0.044328798,0.43345225,0.0075438083,0.035425454,0.009883238,0.45725036],"study_design_scores_gemma":[0.00068119,0.00015971101,0.0010869992,0.0001961879,0.00000942513,0.000010471946,0.000024678904,0.990666,0.004707831,0.0008939435,0.0010376753,0.00052591343],"about_ca_topic_score_codex":0.000052643427,"about_ca_topic_score_gemma":0.0000048365937,"teacher_disagreement_score":0.5831531,"about_ca_system_score_codex":0.00009430362,"about_ca_system_score_gemma":0.00005313489,"threshold_uncertainty_score":0.99987376},"labels":[],"label_agreement":null},{"id":"W1998489369","doi":"10.1007/s10586-015-0448-6","title":"Cloud-based rehabilitation and recovery prediction system for stroke patients","year":2015,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Stroke Rehabilitation and Recovery","field":"Medicine","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Ottawa","funders":"","keywords":"Rehabilitation; Stroke (engine); Physical medicine and rehabilitation; Physical therapy; Medicine; Hemiparesis; Kinematics; Computer science; Test (biology); Surgery","score_opus":0.016084099823223553,"score_gpt":0.2568216504819465,"score_spread":0.24073755065872293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998489369","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9526418,0.00007028111,0.043131918,0.00043271517,0.0019976953,0.001046547,0.00003095114,0.00013527546,0.0005128308],"genre_scores_gemma":[0.979866,4.2716613e-7,0.019244296,0.00022014821,0.000430566,0.00002077437,0.00006180679,0.000019589854,0.00013636232],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989779,0.00007765954,0.0003320841,0.0002526353,0.00019861927,0.00016113055],"domain_scores_gemma":[0.99845165,0.0007788521,0.00011460698,0.00014896074,0.00036283434,0.00014311817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004992757,0.000109266155,0.00021765033,0.00014159842,0.00008153604,0.000026897727,0.000029017368,0.000089823145,0.0000010305796],"category_scores_gemma":[0.00084365025,0.00009713805,0.00010105367,0.000083601946,0.00004227022,0.00008205613,0.000024774985,0.000078641075,0.000005208009],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025242914,0.0003491079,0.9250165,0.0027661845,0.000096675365,0.0000011640251,0.0020577884,0.004822559,0.00022663934,0.00014584178,0.01167,0.050323255],"study_design_scores_gemma":[0.02417156,0.00958845,0.3873507,0.0017152679,0.00023849482,0.000023568758,0.0045713373,0.5627018,0.00038144528,0.00012599627,0.008753277,0.00037808012],"about_ca_topic_score_codex":0.000004941821,"about_ca_topic_score_gemma":9.145299e-7,"teacher_disagreement_score":0.55787927,"about_ca_system_score_codex":0.000254017,"about_ca_system_score_gemma":0.000080247475,"threshold_uncertainty_score":0.39611748},"labels":[],"label_agreement":null},{"id":"W1999004644","doi":"10.1007/s10586-009-0087-x","title":"Job co-allocation strategies for multiple high performance computing clusters","year":2009,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Scalability; Distributed computing; Cluster (spacecraft); USable; Bandwidth (computing); Bandwidth allocation; Computation; Process (computing); Control (management); Resource allocation; Set (abstract data type); Computer network; Algorithm; Operating system","score_opus":0.0211842272790483,"score_gpt":0.26592446903246025,"score_spread":0.24474024175341197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999004644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3460501,0.000051501112,0.6504956,0.0004980261,0.000868541,0.00047859186,0.0000036555266,0.00054040237,0.0010135894],"genre_scores_gemma":[0.9335427,0.0000016015173,0.06459936,0.0010587694,0.0006323483,0.000004817482,0.000058655263,0.000022089907,0.000079633275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697894,0.00015308759,0.0007849422,0.0008229096,0.00039645078,0.0008636595],"domain_scores_gemma":[0.99791074,0.0005370837,0.00041163445,0.00071165076,0.00027054566,0.00015835807],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010194945,0.0003999516,0.00045872066,0.00018575325,0.0008048638,0.000868453,0.0014521038,0.00015127572,0.0000012789999],"category_scores_gemma":[0.0000602526,0.00040533597,0.00015326671,0.00047891896,0.00006750073,0.00077157916,0.00024752435,0.00027029507,0.000041066025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064633445,0.00017107108,0.004031429,0.000335644,0.000073607705,0.000008827737,0.0070455214,0.80701095,0.0007279445,0.020423405,0.00602366,0.15408328],"study_design_scores_gemma":[0.0014199616,0.00028506335,0.013256666,0.00022892366,0.00000997534,0.00004518081,0.00025722873,0.9818299,0.00020873848,0.00068667834,0.0012742145,0.0004974979],"about_ca_topic_score_codex":0.000027444385,"about_ca_topic_score_gemma":0.000003215256,"teacher_disagreement_score":0.5874926,"about_ca_system_score_codex":0.0001278835,"about_ca_system_score_gemma":0.00015247446,"threshold_uncertainty_score":0.99983984},"labels":[],"label_agreement":null},{"id":"W2008903345","doi":"10.1007/s10586-007-0020-0","title":"An exact parallel algorithm to compare very long biological sequences in clusters of workstations","year":2007,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Workstation; Algorithm; Heuristic; Sequence (biology); Smith–Waterman algorithm; Computation; Dynamic programming; Cluster (spacecraft); Quadratic equation; Time complexity; Parallel computing; Parallel algorithm; Sequence alignment; Mathematics; Artificial intelligence; Biology","score_opus":0.03297818096897284,"score_gpt":0.31452972213610314,"score_spread":0.2815515411671303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008903345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21876065,0.00006631918,0.78024334,0.00012708471,0.00039530118,0.0002013335,0.0000041953226,0.00008800293,0.00011374846],"genre_scores_gemma":[0.60461134,0.0000020519703,0.39497402,0.00030522508,0.00007839792,0.0000016711781,0.00001711314,0.000005393185,0.0000047741064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794704,0.00015013253,0.00058288797,0.0005480282,0.00027789234,0.00049400725],"domain_scores_gemma":[0.9985819,0.00041623652,0.00016822989,0.0005381969,0.00009484438,0.00020057721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010045533,0.0001907393,0.00030469007,0.00028291694,0.00015586324,0.0001276498,0.0011428035,0.00006545431,0.000005228207],"category_scores_gemma":[0.000036443766,0.00016468189,0.000057896683,0.0007331612,0.00007250403,0.0005406827,0.0006830362,0.00021515127,0.000011052827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005378092,0.00039526273,0.051985715,0.000033680044,0.000021790946,0.00015804704,0.0062844306,0.15229057,0.00036618166,0.0010310224,0.0005280189,0.7868515],"study_design_scores_gemma":[0.0004387737,0.00012622934,0.11247237,0.00016708755,0.0000020519713,0.000022188528,0.0004365084,0.88551825,0.00012955659,0.00029799,0.00014033973,0.0002486757],"about_ca_topic_score_codex":0.0001578083,"about_ca_topic_score_gemma":0.00010399794,"teacher_disagreement_score":0.78660285,"about_ca_system_score_codex":0.000069733374,"about_ca_system_score_gemma":0.000045444573,"threshold_uncertainty_score":0.6715532},"labels":[],"label_agreement":null},{"id":"W2016191648","doi":"10.1007/s10586-010-0141-8","title":"Service control with the preemptive parallel job scheduler Scojo-PECT","year":2010,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Technische Universität Berlin","keywords":"Computer science; Predictability; Preemption; Scheduling (production processes); Quality of service; Distributed computing; Job scheduler; Job queue; Service quality; Service (business); Computer network; Mathematical optimization; Operating system","score_opus":0.009007964121247419,"score_gpt":0.2221063133733864,"score_spread":0.213098349252139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016191648","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2707124,0.000051817304,0.71925265,0.00499318,0.0008477241,0.00047117332,0.000003133267,0.00037023934,0.0032976803],"genre_scores_gemma":[0.97076833,2.4952016e-7,0.025108557,0.0033318822,0.0006131645,0.000013700927,0.000004356398,0.000025707757,0.00013403056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974725,0.00026470932,0.0003775781,0.00070521486,0.00047969335,0.00070025417],"domain_scores_gemma":[0.9974363,0.00058636785,0.00029241055,0.0011616321,0.0003537839,0.00016953693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010227065,0.00035488978,0.000357442,0.00007677561,0.0006522326,0.0006587754,0.0023046348,0.00012544612,0.0000087109465],"category_scores_gemma":[0.000041262283,0.00022648941,0.000105360006,0.0006845399,0.00013798192,0.0003318557,0.0005843569,0.0007958196,0.00018367905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061561074,0.0009094515,0.092118636,0.00071009446,0.0018844425,0.0003699126,0.059249125,0.54003495,0.005157921,0.18712813,0.05218994,0.05963178],"study_design_scores_gemma":[0.0019332666,0.000112424495,0.017091446,0.00011607915,0.000024133587,0.00023207888,0.00026663995,0.9730891,0.000026481308,0.00024281311,0.006401027,0.00046451387],"about_ca_topic_score_codex":0.00010273769,"about_ca_topic_score_gemma":0.000180065,"teacher_disagreement_score":0.70005596,"about_ca_system_score_codex":0.000028717837,"about_ca_system_score_gemma":0.00014056091,"threshold_uncertainty_score":0.923597},"labels":[],"label_agreement":null},{"id":"W2016399888","doi":"10.1007/s10586-011-0154-y","title":"An architecture for P2P bag-of-tasks execution with multiple task allocation policies in desktop grids","year":2011,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Overlay; Chord (peer-to-peer); Distributed computing; Task (project management); Architecture; Grid; FIFO (computing and electronics); Queue; Speedup; Computer network; Operating system","score_opus":0.02567746571945842,"score_gpt":0.25422284128571326,"score_spread":0.22854537556625484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016399888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34084857,0.000041035204,0.6582093,0.000065005486,0.00019565168,0.00034184186,0.0000046636037,0.0001089998,0.00018489969],"genre_scores_gemma":[0.9044807,5.9402976e-7,0.09521396,0.00010928097,0.00012733525,0.000012657049,0.000032105156,0.000014471994,0.000008885027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832225,0.00015773256,0.00045345523,0.0004642027,0.00019357626,0.00040880116],"domain_scores_gemma":[0.9987477,0.0001971558,0.0002670912,0.00054747966,0.0001551288,0.00008542984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060056505,0.00020545906,0.00027773887,0.00019588147,0.00013968076,0.00008374701,0.0008108914,0.0000920241,5.9438247e-7],"category_scores_gemma":[0.000042410888,0.00017879435,0.00006417792,0.0004381539,0.00007214473,0.00024014164,0.00015720117,0.00014611732,0.000002082512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005701352,0.0013842294,0.1337594,0.0010805315,0.00017589708,0.000026076674,0.15971331,0.5063074,0.008128934,0.036074866,0.0010126346,0.15176657],"study_design_scores_gemma":[0.0013253359,0.0004958785,0.033595804,0.00027756556,0.000009504543,0.000040798997,0.00030721686,0.96043974,0.0015696547,0.0011129502,0.0004886307,0.00033689835],"about_ca_topic_score_codex":0.0004061017,"about_ca_topic_score_gemma":0.00012878138,"teacher_disagreement_score":0.56363213,"about_ca_system_score_codex":0.000047780002,"about_ca_system_score_gemma":0.00007003475,"threshold_uncertainty_score":0.7291022},"labels":[],"label_agreement":null},{"id":"W2017300675","doi":"10.1007/s10586-007-0009-8","title":"Enabling ad-hoc collaboration between mobile users in the $\\mathcal{MESSENGER}$ project","year":2007,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; World Wide Web; Wireless ad hoc network; Web service; Telecommunications; Wireless","score_opus":0.022454425732741777,"score_gpt":0.29919943913432806,"score_spread":0.2767450134015863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017300675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4784115,0.00053066877,0.51815766,0.00037194096,0.00050331897,0.0010796313,8.070695e-7,0.00022261293,0.0007218918],"genre_scores_gemma":[0.9728789,0.00001133206,0.025772693,0.0007225094,0.00052786083,0.000026628955,0.000007281462,0.00002224698,0.000030562616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973005,0.00031879699,0.0006253243,0.0005893897,0.00046736104,0.000698621],"domain_scores_gemma":[0.99756736,0.0012324428,0.00023315244,0.000771954,0.00012741236,0.00006769619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003497607,0.00023298034,0.00026846168,0.00023571239,0.00028917115,0.00048363206,0.0013895606,0.0001409499,0.000002000831],"category_scores_gemma":[0.000070946546,0.00019029548,0.00006824698,0.002062195,0.000052119332,0.0005250222,0.0005123244,0.0004743624,0.00002366523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005126963,0.0002744468,0.021298328,0.00017545754,0.00007051873,0.00024817997,0.08684423,0.05488075,0.00064717693,0.004428931,0.004959954,0.82612073],"study_design_scores_gemma":[0.0017205663,0.0003664666,0.01896892,0.00033033284,0.00002358876,0.00006382597,0.0057539437,0.92415166,0.0006843163,0.0005524778,0.04646862,0.0009153004],"about_ca_topic_score_codex":0.000018571473,"about_ca_topic_score_gemma":0.0001028608,"teacher_disagreement_score":0.8692709,"about_ca_system_score_codex":0.00015227727,"about_ca_system_score_gemma":0.000120128825,"threshold_uncertainty_score":0.77600247},"labels":[],"label_agreement":null},{"id":"W2017811850","doi":"10.1007/s10586-009-0090-2","title":"Using ant-based agents for congestion control in ad-hoc wireless sensor networks","year":2009,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Canadian Centre for Applied Research in Cancer Control","keywords":"Computer science; ANT; Wireless ad hoc network; Computer network; Network congestion; Wireless sensor network; Wireless; Telecommunications; Network packet","score_opus":0.029282627456746757,"score_gpt":0.28007145399687017,"score_spread":0.2507888265401234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017811850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24961896,0.00018087144,0.74818826,0.00048759178,0.0007896779,0.000467165,0.0000011068595,0.00022302369,0.000043345575],"genre_scores_gemma":[0.8917526,0.0000034103448,0.10497363,0.002936343,0.00027671608,0.000004432655,0.000008448912,0.000026795084,0.000017646316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972557,0.00025269206,0.0005992931,0.0007440399,0.0002849048,0.0008634118],"domain_scores_gemma":[0.9982057,0.0006445538,0.0003007384,0.0005460378,0.00016229646,0.00014064275],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069286063,0.00032182198,0.00043800165,0.00023505758,0.0002694804,0.0002442351,0.00069601444,0.00020731136,0.0000011547362],"category_scores_gemma":[0.000045516867,0.00034450946,0.0001401274,0.000588301,0.000049500013,0.00022226787,0.00010738922,0.00030228036,0.0000027195506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005336544,0.00009047235,0.00060184347,0.000012263035,0.00000818633,0.000023842294,0.00013273949,0.94416857,0.0003144082,0.0005028861,0.00008242845,0.05400899],"study_design_scores_gemma":[0.0030549455,0.0001299767,0.0021625243,0.0002790826,0.000012383495,0.0000158307,0.000015150589,0.99356854,0.00010270951,0.00003594696,0.00024548234,0.0003774039],"about_ca_topic_score_codex":0.0000069805437,"about_ca_topic_score_gemma":0.000010818963,"teacher_disagreement_score":0.64321464,"about_ca_system_score_codex":0.00020877332,"about_ca_system_score_gemma":0.00006116461,"threshold_uncertainty_score":0.9999007},"labels":[],"label_agreement":null},{"id":"W2022402912","doi":"10.1023/b:clus.0000028003.65775.8d","title":"Combined Ring–Mesh Optical Transport Networks","year":2004,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Optical mesh network; Multiplexer; Synchronous optical networking; Mesh networking; Ring network; Computer network; Network architecture; Network planning and design; Optical Transport Network; Wavelength-division multiplexing; Ring (chemistry); Traffic grooming; Wireless mesh network; Telecommunications; Network topology; Multiplexing; Passive optical network; Optics; Wavelength; Physics","score_opus":0.007360152963897589,"score_gpt":0.2074705969096531,"score_spread":0.20011044394575553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022402912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25442111,0.00013560633,0.7389513,0.00013259088,0.00044032428,0.0001423587,3.7666464e-7,0.0021899242,0.0035863596],"genre_scores_gemma":[0.88438,0.000015838972,0.11522811,0.00011576689,0.0001870696,0.000003924255,0.0000055227697,0.000050987528,0.0000127884405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873376,0.0000056947865,0.00032002313,0.00024522687,0.0001273853,0.0005679204],"domain_scores_gemma":[0.9994705,0.00009487697,0.000022931801,0.0002912457,0.0000245393,0.00009594528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000984056,0.00022506011,0.00026113898,0.000056625177,0.00009379644,0.000025298237,0.000280041,0.00017984168,0.000006011084],"category_scores_gemma":[0.000021818443,0.0002321904,0.00007843887,0.00026523563,0.000108863875,0.000097330296,0.00009961009,0.0004999023,0.000031363572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068375894,0.000016424405,0.0003877524,0.00002255144,0.00001995604,0.000029258059,0.000052381303,0.9803523,0.0000467621,0.007197147,0.000042867166,0.011825788],"study_design_scores_gemma":[0.0010667465,0.00006323172,0.0024289049,0.00012962977,0.000016847003,0.00001953634,0.000042463475,0.99233574,0.00030437292,0.002948716,0.0002658613,0.0003779544],"about_ca_topic_score_codex":9.0771124e-7,"about_ca_topic_score_gemma":0.0000025973873,"teacher_disagreement_score":0.62995887,"about_ca_system_score_codex":0.00010722959,"about_ca_system_score_gemma":0.000006904918,"threshold_uncertainty_score":0.946845},"labels":[],"label_agreement":null},{"id":"W2025713912","doi":"10.1007/s10586-012-0243-6","title":"Special issue on energy-aware computing and communications","year":2013,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Energy (signal processing); Distributed computing; Telecommunications; Computer security","score_opus":0.01632456257095322,"score_gpt":0.24672398629097048,"score_spread":0.23039942372001726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025713912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1108156,0.00024586113,0.74390733,0.017873077,0.0031110386,0.0006794564,0.0000011586621,0.0012196163,0.12214684],"genre_scores_gemma":[0.95995903,0.000005080453,0.029270798,0.0040736734,0.0056040115,0.0000042513934,0.0000033116917,0.000025219,0.0010545996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799865,0.00020789859,0.0004135037,0.0005950638,0.00029315046,0.000491751],"domain_scores_gemma":[0.9977175,0.0004888821,0.00018415958,0.0013476693,0.000099695695,0.00016211273],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035527474,0.00026203963,0.00026413257,0.000179509,0.00079497125,0.0006128223,0.0017139623,0.00007600175,0.000021679823],"category_scores_gemma":[0.00002190803,0.00024664725,0.00008027927,0.00036855586,0.000118722724,0.0000595014,0.0039200997,0.00028718522,0.00019762777],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001676302,0.000093288545,0.00040197003,0.000025674855,0.00003201573,0.000005633585,0.0021075674,0.0050918995,0.0000073790256,0.011009628,0.041742392,0.9394809],"study_design_scores_gemma":[0.00036500927,0.000066953064,0.0017374529,0.000120400065,0.000005698568,0.000021109761,0.0001841357,0.91501737,0.00001796147,0.00061148294,0.08156812,0.00028429556],"about_ca_topic_score_codex":0.00011247296,"about_ca_topic_score_gemma":0.000006219466,"teacher_disagreement_score":0.9391966,"about_ca_system_score_codex":0.00006080489,"about_ca_system_score_gemma":0.000017513068,"threshold_uncertainty_score":0.99999857},"labels":[],"label_agreement":null},{"id":"W2030619444","doi":"10.1007/s10586-012-0213-z","title":"Research trends in cloud, cluster and grid computing","year":2012,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Cloud computing; Cluster (spacecraft); Grid; Distributed computing; Grid computing; Computational science; Operating system; Geology","score_opus":0.057190164526805316,"score_gpt":0.3430372837340717,"score_spread":0.2858471192072664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030619444","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5022164,0.0010470484,0.4826868,0.0011985379,0.0037073784,0.00028663088,0.0000028908423,0.00035825832,0.008496088],"genre_scores_gemma":[0.9853557,0.0000027700703,0.011587461,0.0004375742,0.002340482,0.0000029332602,0.000014003533,0.00002813525,0.00023095669],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951978,0.0009998708,0.00074463815,0.00076681864,0.00063619483,0.0016547221],"domain_scores_gemma":[0.99760103,0.0009790525,0.00018502572,0.0007391426,0.00014888031,0.0003468882],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0058563706,0.00032874072,0.00046033468,0.00084093335,0.0005237101,0.0005023275,0.0011928623,0.00018133601,0.0000063955627],"category_scores_gemma":[0.000084364,0.00032090762,0.000095789495,0.0020178389,0.0001646709,0.0005829744,0.002402294,0.00084452314,0.000086764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008071763,0.00092232425,0.25790417,0.00050124497,0.00014136625,0.000110569126,0.0669161,0.051138155,0.00016141037,0.03931689,0.076629475,0.5061776],"study_design_scores_gemma":[0.001502682,0.000094759875,0.053037647,0.0003401417,0.000005477724,0.0002730308,0.000511907,0.9244166,0.000029773806,0.0002717832,0.018912366,0.0006038506],"about_ca_topic_score_codex":0.00011806009,"about_ca_topic_score_gemma":0.000013486491,"teacher_disagreement_score":0.87327844,"about_ca_system_score_codex":0.00015329228,"about_ca_system_score_gemma":0.000041361665,"threshold_uncertainty_score":0.9999243},"labels":[],"label_agreement":null},{"id":"W2039244387","doi":"10.1007/s10586-013-0247-x","title":"Enabling richer statistical MANET simulations through cluster computing","year":2013,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Mobile ad hoc network; Quality of service; Computer network; Throughput; Ergodicity; Distributed computing; Cluster analysis; Vehicular ad hoc network; Wireless ad hoc network; Wireless; Network packet; Machine learning; Telecommunications","score_opus":0.020639056912619146,"score_gpt":0.2736194149382785,"score_spread":0.2529803580256594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039244387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03326894,0.0000922977,0.9603682,0.0011635406,0.0010613657,0.00074501615,0.0000029269324,0.00058283773,0.0027148698],"genre_scores_gemma":[0.70041174,0.000001388633,0.29558665,0.003082672,0.0006468801,0.0000062409713,0.000018927425,0.000039815863,0.00020569505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961539,0.00034826694,0.0008743874,0.0010021076,0.00052162533,0.0010997173],"domain_scores_gemma":[0.9962591,0.0019290603,0.0003015826,0.0010261926,0.00025398575,0.0002300584],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005182775,0.00041624246,0.0004484184,0.00012035179,0.00062233035,0.00096050755,0.0013155312,0.0001900919,0.00018026162],"category_scores_gemma":[0.00013440938,0.00036635713,0.0001088645,0.0006651451,0.00011431144,0.0010520953,0.0019118952,0.000623148,0.0006491401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063830944,0.00017604155,0.0027801734,0.00010380936,0.000097514654,0.000036397018,0.006406898,0.8051887,0.00014135404,0.019142443,0.022849768,0.14307052],"study_design_scores_gemma":[0.000713121,0.000047523044,0.0024174806,0.00009538051,0.000014463337,0.00004664148,0.0000867403,0.98797584,0.000032919714,0.004555234,0.0035319729,0.00048268735],"about_ca_topic_score_codex":0.00012783858,"about_ca_topic_score_gemma":0.000011118016,"teacher_disagreement_score":0.6671428,"about_ca_system_score_codex":0.00013569673,"about_ca_system_score_gemma":0.00006440505,"threshold_uncertainty_score":0.9998788},"labels":[],"label_agreement":null},{"id":"W2049096082","doi":"10.1007/s10586-008-0059-6","title":"Translating Service Level Objectives to lower level policies for multi-tier services","year":2008,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Service-level agreement; Service level objective; Service level; Service (business); Domain (mathematical analysis); Service provider; Quality (philosophy); Quality of service; Service design; Process management; Software engineering; Computer network","score_opus":0.09111181423032377,"score_gpt":0.2979178296390462,"score_spread":0.20680601540872245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049096082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35686758,0.00006445548,0.63870287,0.0024194028,0.000590548,0.0004900575,0.000006165263,0.00033974327,0.0005191975],"genre_scores_gemma":[0.6964886,3.9800412e-7,0.29721105,0.005180902,0.00037405244,0.000013516327,0.0000022427716,0.000033359516,0.00069585285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973451,0.00009612849,0.0005221704,0.00084488216,0.00037055468,0.0008211469],"domain_scores_gemma":[0.9984358,0.0002559691,0.00017898255,0.0006687747,0.00026376167,0.00019671374],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004946014,0.00037307234,0.00038173218,0.00025503885,0.001033355,0.00023855922,0.001506598,0.00009546828,0.0000018459573],"category_scores_gemma":[0.000029932351,0.0003552045,0.00018846581,0.00079077994,0.000040048024,0.00009165242,0.0011775321,0.0002001091,0.000046130128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009140414,0.0006523173,0.0043233344,0.0010181853,0.00032072864,0.000054071832,0.24850418,0.5250098,0.0015471904,0.0020250888,0.0015640844,0.2148896],"study_design_scores_gemma":[0.0011316476,0.00010909869,0.01664172,0.0002203302,0.000013102105,0.000047306672,0.0008624857,0.9771364,0.00022987666,0.00006793474,0.0030248198,0.0005153335],"about_ca_topic_score_codex":0.00030709617,"about_ca_topic_score_gemma":0.0001653537,"teacher_disagreement_score":0.45212653,"about_ca_system_score_codex":0.000082955936,"about_ca_system_score_gemma":0.000057290697,"threshold_uncertainty_score":0.99988997},"labels":[],"label_agreement":null},{"id":"W2055595274","doi":"10.1007/s10586-005-6185-5","title":"Walk-In Bridge Scheduling in Bluetooth Scatternets","year":2005,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Bluetooth and Wireless Communication Technologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Piconet; Computer science; Bluetooth; Scheduling (production processes); Queue; Scalability; Scatternet; Network packet; Computer network; Bridge (graph theory); Locality; Distributed computing; Queueing theory; Wireless; Telecommunications; Mathematical optimization; Operating system","score_opus":0.021749068211897947,"score_gpt":0.2676898813785566,"score_spread":0.24594081316665864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055595274","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7152586,0.00046928963,0.2758567,0.006223363,0.00013730966,0.00015556025,2.0712052e-7,0.00043162075,0.0014673736],"genre_scores_gemma":[0.8927579,0.00001962243,0.10595506,0.0011610697,0.00006043956,0.0000059335152,0.0000012099423,0.000011008559,0.000027797463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833727,0.00010043063,0.00047303588,0.00043250318,0.00017099045,0.00048579441],"domain_scores_gemma":[0.99867266,0.00018777345,0.00012261058,0.00093067664,0.00003364792,0.000052626747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005649087,0.00016845917,0.00022896775,0.0003990389,0.0000860689,0.00018118981,0.001962751,0.00011236205,0.0000029260902],"category_scores_gemma":[0.000069804126,0.00017822413,0.000048813465,0.000723954,0.000056442088,0.0005193022,0.0013325007,0.00044325323,0.00007990203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045263123,0.000144861,0.0631272,0.000028286613,0.000005496307,0.000014973629,0.0024443336,0.05486872,0.00016378904,0.0065291813,0.0003616791,0.87230694],"study_design_scores_gemma":[0.0006414871,0.000014189894,0.08888379,0.00014869272,7.2946773e-7,0.000011701802,0.000051014245,0.9072971,0.0010482426,0.000498639,0.001170502,0.00023391472],"about_ca_topic_score_codex":0.00007616803,"about_ca_topic_score_gemma":0.00016894987,"teacher_disagreement_score":0.87207305,"about_ca_system_score_codex":0.00012492527,"about_ca_system_score_gemma":0.00004418662,"threshold_uncertainty_score":0.7267769},"labels":[],"label_agreement":null},{"id":"W2059124748","doi":"10.1007/s10586-008-0065-8","title":"Efficient shared memory and RDMA based collectives on multi-rail QsNetII SMP clusters","year":2008,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Remote direct memory access; Computer science; Parallel computing; Operating system","score_opus":0.029210776239220186,"score_gpt":0.24045570847511624,"score_spread":0.21124493223589605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059124748","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3397562,0.000109431276,0.65572983,0.00038357364,0.0014356193,0.0003706985,0.0000015411003,0.00023822008,0.0019749235],"genre_scores_gemma":[0.9802104,0.0000010988438,0.017269589,0.0016428679,0.00023094399,0.000009847329,0.0000017902221,0.000020943215,0.00061251334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978673,0.00027302274,0.00041007224,0.00069851713,0.00030130078,0.0004497879],"domain_scores_gemma":[0.99864954,0.00043593414,0.00017498163,0.0004619287,0.00012517394,0.00015242858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004609964,0.00026096235,0.00031431284,0.00022252057,0.0007452952,0.00020178044,0.0004770616,0.00010302584,0.000009560654],"category_scores_gemma":[0.000059158596,0.00024063847,0.00011035755,0.0004074262,0.00009549731,0.00008632087,0.0003485699,0.00023983777,0.000034777313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095546406,0.0003349679,0.0017608834,0.000093338174,0.00006736177,0.00012992467,0.015978413,0.96034634,0.0002072157,0.00033874603,0.008599712,0.012047572],"study_design_scores_gemma":[0.0015845828,0.00016894238,0.0050602504,0.00016732953,0.0000036322986,0.00010256336,0.00015047702,0.9918882,0.00013068631,0.000004829825,0.00045473906,0.00028371954],"about_ca_topic_score_codex":0.000036574223,"about_ca_topic_score_gemma":0.000012297255,"teacher_disagreement_score":0.64045423,"about_ca_system_score_codex":0.000118853466,"about_ca_system_score_gemma":0.00006500555,"threshold_uncertainty_score":0.9812952},"labels":[],"label_agreement":null},{"id":"W2064570018","doi":"10.1007/s10586-012-0229-4","title":"The impact of heterogeneous multi-core clusters on graph partitioning: an empirical study","year":2012,"lang":"en","type":"article","venue":"Cluster Computing","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Graph partition; Graph; Core (optical fiber); Empirical research; Theoretical computer science; Statistics; Telecommunications","score_opus":0.06011409574486494,"score_gpt":0.34687051547067943,"score_spread":0.2867564197258145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064570018","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9509177,0.0001351446,0.047892258,0.0000057686125,0.00021065466,0.00033763575,0.0000020412276,0.00036197447,0.00013682067],"genre_scores_gemma":[0.9988911,0.0000030420742,0.0008597025,0.000033469194,0.00015687164,0.000009459426,0.0000034337081,0.000038075897,0.000004811392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989232,0.000098291355,0.0003012693,0.00013829314,0.00013908325,0.00039989446],"domain_scores_gemma":[0.9993031,0.00014896263,0.000059304533,0.0003358368,0.000033588152,0.00011921858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041668362,0.00018444663,0.00018921467,0.00007574465,0.00018388832,0.000045547604,0.00019300733,0.00006458216,0.0000039876068],"category_scores_gemma":[0.000018935893,0.00012764,0.0001322139,0.0001435302,0.000046293597,0.00009765024,0.00006501603,0.00019189162,0.0000072183007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006686934,0.001167036,0.40957272,0.000045451834,0.00033799975,0.000010446794,0.014839202,0.54748034,0.0011147414,0.0000109085695,0.0019819736,0.023372283],"study_design_scores_gemma":[0.00071250746,0.0009228143,0.104231745,0.000053987933,0.000030395991,0.00003181934,0.0005191574,0.8913107,0.0017583959,0.0000507337,0.000044957807,0.0003327756],"about_ca_topic_score_codex":0.000017157048,"about_ca_topic_score_gemma":0.0000065322597,"teacher_disagreement_score":0.34383035,"about_ca_system_score_codex":0.00006680631,"about_ca_system_score_gemma":0.0000064781284,"threshold_uncertainty_score":0.52050084},"labels":[],"label_agreement":null},{"id":"W2064808093","doi":"10.1007/s10586-009-0088-9","title":"Sensor scheduling for p-percent coverage in wireless sensor networks","year":2009,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University; University of Alberta","funders":"National Science Foundation","keywords":"Computer science; Wireless sensor network; Scheduling (production processes); Cover (algebra); Distributed algorithm; Computer network; Distributed computing; Set cover problem; Real-time computing; Algorithm; Set (abstract data type); Mathematical optimization; Mathematics","score_opus":0.013046304723211073,"score_gpt":0.24679719007164624,"score_spread":0.23375088534843516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064808093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34389386,0.00009375388,0.65354925,0.0006962812,0.0007523161,0.00036174324,6.5280426e-7,0.00027717173,0.00037499412],"genre_scores_gemma":[0.853701,0.000014190863,0.14336158,0.0022399272,0.00056656305,0.0000052641312,0.000008819802,0.000031683165,0.000070954724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99667513,0.00018297789,0.00071325595,0.0009634927,0.0003323886,0.0011327699],"domain_scores_gemma":[0.99806273,0.0006206757,0.00024032388,0.00075644295,0.00014070234,0.0001791035],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070959376,0.0003919277,0.00049570453,0.00023363155,0.0003051868,0.0003507011,0.00096022844,0.0002247137,0.0000017409461],"category_scores_gemma":[0.00005735058,0.00041125566,0.00018392557,0.00071918796,0.000046858673,0.00028205532,0.00032518167,0.000464072,0.000010153726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002359295,0.00010378047,0.00052041374,0.000015223202,0.000009138604,0.00004144997,0.0004968922,0.9459646,0.00028646208,0.0042919125,0.000085682295,0.04816086],"study_design_scores_gemma":[0.0013148477,0.00010117526,0.0018502563,0.00023093118,0.00000618242,0.000047495087,0.00005689396,0.99525833,0.00023426376,0.00012434974,0.00029245505,0.00048280024],"about_ca_topic_score_codex":0.000010501722,"about_ca_topic_score_gemma":0.000009154036,"teacher_disagreement_score":0.5101876,"about_ca_system_score_codex":0.00020961782,"about_ca_system_score_gemma":0.00004698259,"threshold_uncertainty_score":0.99983394},"labels":[],"label_agreement":null},{"id":"W2070292256","doi":"10.1007/s10586-006-9738-3","title":"Finding a suitable system scale to optimize program performance on software DSM systems","year":2006,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Overhead (engineering); Distributed computing; Software; Interface (matter); Embedded system; Parallel computing; Operating system","score_opus":0.013565794297711252,"score_gpt":0.24879841619857646,"score_spread":0.2352326219008652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070292256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08574707,0.00007122116,0.90416473,0.00009468727,0.0008100297,0.00089387374,0.0000014019887,0.004023197,0.0041938033],"genre_scores_gemma":[0.5811343,5.5248734e-7,0.4179293,0.00013099654,0.00022819953,0.00004021147,0.000005082777,0.00002385404,0.00050748605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972657,0.00015538419,0.00059706526,0.0007667105,0.00044941792,0.00076571153],"domain_scores_gemma":[0.99847054,0.00017641917,0.00024036222,0.0007616093,0.00019645884,0.00015462906],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082043925,0.00032618264,0.00039224586,0.00032055593,0.0006436259,0.00085167197,0.001179277,0.00013442288,9.2563715e-7],"category_scores_gemma":[0.000032738935,0.00031671516,0.00009741308,0.00083425426,0.000026541418,0.00030383686,0.000690651,0.00026707165,0.00012911319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008447523,0.000086016415,0.0017460667,0.0001739573,0.000008261884,0.000008586194,0.00027390086,0.9783294,0.000010354116,0.0016267967,0.004061279,0.013666886],"study_design_scores_gemma":[0.00034725064,0.00022317682,0.00086554035,0.00081835483,0.0000052034366,0.00006068665,0.00003420012,0.9954723,0.00033906344,0.000011085722,0.0014291765,0.0003939712],"about_ca_topic_score_codex":0.00005724876,"about_ca_topic_score_gemma":0.0000011488788,"teacher_disagreement_score":0.49538726,"about_ca_system_score_codex":0.00026662348,"about_ca_system_score_gemma":0.000054854023,"threshold_uncertainty_score":0.9999285},"labels":[],"label_agreement":null},{"id":"W2071880963","doi":"10.1023/b:clus.0000003942.73875.29","title":"A Synchronous Co-Allocation Mechanism for Grid Computing Systems","year":2003,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Victoria; Purdue University","keywords":"Computer science; Quality of service; Reservation; Resource allocation; Distributed computing; Grid; Queueing theory; Grid computing; Computer network; Scheme (mathematics); Service (business); Variety (cybernetics)","score_opus":0.020168566578802734,"score_gpt":0.26402301979823023,"score_spread":0.2438544532194275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071880963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021346645,0.00023245226,0.96864754,0.00018307066,0.0052664154,0.0010673496,0.0000098567625,0.00075565546,0.0024910045],"genre_scores_gemma":[0.94229805,0.0000013247297,0.056264218,0.0004592051,0.00074337557,0.000018466731,0.000041744785,0.000039827686,0.00013378177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964441,0.00040646052,0.000885557,0.00092760834,0.00042223118,0.0009140452],"domain_scores_gemma":[0.9973594,0.000672124,0.0005109408,0.0008317469,0.00042011242,0.00020570826],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017851976,0.00040532,0.0005332484,0.00018652524,0.00077829615,0.000787901,0.001180748,0.00017497777,0.0000014674769],"category_scores_gemma":[0.00020843967,0.0004174681,0.00019928168,0.00048501109,0.00004981965,0.0002897157,0.00023278453,0.0002403643,0.00008039582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011276048,0.00018410382,0.00040051658,0.0006164298,0.00014656101,0.000020123116,0.0038224643,0.17325407,0.0003821175,0.8049665,0.008958128,0.007237694],"study_design_scores_gemma":[0.0010828822,0.00013612612,0.00005215443,0.0002666471,0.000015971673,0.00024353148,0.00022316149,0.987538,0.00030817997,0.0016715098,0.00793014,0.00053173536],"about_ca_topic_score_codex":0.000034740682,"about_ca_topic_score_gemma":0.0000014885983,"teacher_disagreement_score":0.9209514,"about_ca_system_score_codex":0.00022464042,"about_ca_system_score_gemma":0.00017524837,"threshold_uncertainty_score":0.99982774},"labels":[],"label_agreement":null},{"id":"W2085059901","doi":"10.1007/s10586-009-0076-0","title":"On GPU’s viability as a middleware accelerator","year":2009,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Nvidia","keywords":"Computer science; Implementation; Exploit; Middleware (distributed applications); Erasure code; Graphics; Embedded system; Distributed computing; Operating system; Decoding methods; Software engineering","score_opus":0.018697008819549554,"score_gpt":0.2505568737334214,"score_spread":0.23185986491387184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085059901","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81229776,0.00005493811,0.1785714,0.002129555,0.0006229144,0.0001710872,6.1533734e-7,0.00046827333,0.005683431],"genre_scores_gemma":[0.98809814,5.124447e-7,0.0025751265,0.008938945,0.00017454647,0.0000011239486,0.0000013761017,0.0000066027214,0.00020362808],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984708,0.000110612775,0.0002521554,0.00053808175,0.00027357097,0.00035481623],"domain_scores_gemma":[0.9988297,0.00019974774,0.000081552695,0.0006871404,0.00008053822,0.00012131336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034670535,0.0001788778,0.0001900665,0.0000858488,0.00025758264,0.00031373787,0.0008258919,0.000063416526,0.000008610819],"category_scores_gemma":[0.00009835164,0.0001654387,0.00012118607,0.00023863715,0.000019565427,0.00023828453,0.00026022916,0.00025526033,0.0002048685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013909287,0.0010136985,0.002763368,0.00007175808,0.000068135836,0.00022613067,0.006852194,0.010021054,0.0035547744,0.08786842,0.01294694,0.8744744],"study_design_scores_gemma":[0.001178255,0.0006813978,0.009043603,0.00019511231,0.000009361437,0.00008304518,0.00007552551,0.9697045,0.0008390879,0.016214518,0.0013226024,0.00065296877],"about_ca_topic_score_codex":0.000019908643,"about_ca_topic_score_gemma":0.0000015282643,"teacher_disagreement_score":0.9596835,"about_ca_system_score_codex":0.00007726221,"about_ca_system_score_gemma":0.000046443252,"threshold_uncertainty_score":0.67463946},"labels":[],"label_agreement":null},{"id":"W2089800424","doi":"10.1007/s10586-005-6181-9","title":"Average Waiting Time of Clusterhead Controlled Token for Virtual Base Station On-Demand in MANETs","year":2005,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Polling; Computer science; Computer network; Mobile ad hoc network; Security token; Base station; Wireless ad hoc network; Network packet; Wireless; Telecommunications","score_opus":0.011011729859760656,"score_gpt":0.2436293415535245,"score_spread":0.23261761169376385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089800424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28982615,0.000045026376,0.7076535,0.00049019407,0.00022089799,0.0009300477,0.0000032616288,0.00008268505,0.0007482013],"genre_scores_gemma":[0.970004,0.0000013175281,0.028299881,0.0010815038,0.0003424659,0.00002567287,0.000012803044,0.000021632868,0.00021069135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977126,0.00022381006,0.00079949625,0.00049899553,0.0002835522,0.00048155762],"domain_scores_gemma":[0.9974072,0.0016225928,0.00036421634,0.0004203024,0.00010089332,0.000084814026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001298821,0.00022089845,0.00049840816,0.00019257369,0.00011751525,0.000104081526,0.0005692884,0.00009584508,0.000013037171],"category_scores_gemma":[0.00011726431,0.00021846453,0.00012131492,0.00023105876,0.000030718635,0.00033393718,0.0003068268,0.000196689,0.000033133943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023263691,0.00012388895,0.00014513901,0.00003958787,0.000025039311,0.000007728072,0.0023929717,0.89789003,0.00030817112,0.0025881175,0.0009638577,0.09528284],"study_design_scores_gemma":[0.007452804,0.00024254716,0.0002673465,0.00019132746,0.0000063649763,0.0000075399753,0.00002776516,0.9907735,0.00046716604,0.00016353773,0.0001897653,0.00021034954],"about_ca_topic_score_codex":0.000007507338,"about_ca_topic_score_gemma":0.000017113858,"teacher_disagreement_score":0.68017787,"about_ca_system_score_codex":0.00011145404,"about_ca_system_score_gemma":0.0000487468,"threshold_uncertainty_score":0.8908725},"labels":[],"label_agreement":null},{"id":"W2104464824","doi":"10.1007/s10586-014-0349-0","title":"Recent trends in interactive multimedia computing for industry","year":2014,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Multimedia Communication and Technology","field":"Social Sciences","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Multimedia; Interactive media; Human–computer interaction","score_opus":0.04951955399076109,"score_gpt":0.38102367480029126,"score_spread":0.3315041208095302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104464824","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8421619,0.00011929908,0.05454319,0.02487791,0.0022704545,0.00080748193,0.0000033756446,0.0006641696,0.07455222],"genre_scores_gemma":[0.9790814,0.000009072878,0.019656362,0.000692936,0.00031611926,0.0000067641954,0.0000134601805,0.000012944578,0.0002109548],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857605,0.00035885107,0.00031313888,0.0002458925,0.00012702521,0.00037903903],"domain_scores_gemma":[0.99803,0.0013598864,0.00017182837,0.00025260536,0.000104695384,0.000081005885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012874097,0.0001070547,0.00019710469,0.0002747004,0.0003322849,0.000048303133,0.00047261742,0.00029547667,0.00007280834],"category_scores_gemma":[0.00104953,0.00011621429,0.000049957147,0.00043663505,0.00015984724,0.00008134172,0.0002487387,0.0005754304,0.000014902782],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000105479985,0.000055824166,0.011041776,0.000003593043,0.000006926563,2.7396777e-7,0.015851298,0.00017610607,0.00002101966,0.0013953998,0.0006896224,0.9707476],"study_design_scores_gemma":[0.0015224034,0.000038641774,0.015184607,0.00009133069,0.0000064644746,0.0000012536241,0.0045510787,0.77768356,0.00009029765,0.00042022538,0.20016636,0.00024380161],"about_ca_topic_score_codex":0.00028233,"about_ca_topic_score_gemma":0.0012841452,"teacher_disagreement_score":0.9705038,"about_ca_system_score_codex":0.0001791319,"about_ca_system_score_gemma":0.00003881677,"threshold_uncertainty_score":0.4739081},"labels":[],"label_agreement":null},{"id":"W2120741525","doi":"10.1007/s10586-006-9746-3","title":"Finding Hamiltonian paths in tournaments on clusters","year":2006,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Scalability; Tournament; Computation; Parallel computing; Computer cluster; Cluster (spacecraft); Parallel algorithm; Graph; Running time; Hamiltonian (control theory); Reuse; Theoretical computer science; Algorithm; Distributed computing; Combinatorics; Mathematical optimization; Mathematics; Operating system","score_opus":0.018802860021966208,"score_gpt":0.25354114527614796,"score_spread":0.23473828525418175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120741525","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49643373,0.00006255676,0.48947307,0.0011102448,0.0014611698,0.00026107952,0.0000014675312,0.00025860313,0.010938072],"genre_scores_gemma":[0.9535709,0.0000010816756,0.04491569,0.0011019813,0.00022725333,0.0000029338498,0.0000029133162,0.000013870657,0.00016335749],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980162,0.000119051445,0.0004322919,0.0005336164,0.00033377437,0.00056510454],"domain_scores_gemma":[0.9990521,0.00022504888,0.00013654982,0.00048568242,0.000029662158,0.000070962604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048271983,0.00021657626,0.00022620201,0.00036431235,0.00027005502,0.00030094976,0.00093924033,0.00007142472,0.0000058741384],"category_scores_gemma":[0.000021486208,0.000222515,0.00010050529,0.0006265608,0.000045108198,0.00026981017,0.0006223468,0.0003373004,0.000050243518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005502335,0.0012235503,0.074721076,0.00014639688,0.00005899657,0.0007670443,0.0075199613,0.18205062,0.00045548563,0.09881777,0.007958728,0.62622535],"study_design_scores_gemma":[0.0010925136,0.00008756661,0.050689485,0.00026591457,0.000002329531,0.000035516237,0.00005451193,0.93691427,0.00016638394,0.008760185,0.001549109,0.00038219034],"about_ca_topic_score_codex":0.00010693172,"about_ca_topic_score_gemma":0.00006640604,"teacher_disagreement_score":0.7548637,"about_ca_system_score_codex":0.00015294152,"about_ca_system_score_gemma":0.000028719094,"threshold_uncertainty_score":0.9073898},"labels":[],"label_agreement":null},{"id":"W2140520484","doi":"10.1023/b:clus.0000028000.94688.a1","title":"Performance of Fast Routing Algorithms in Large Optical Switches Built on the Vertical Stacking of Banyan Structures","year":2004,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Waterloo","funders":"Japan Science Society","keywords":"Computer science; Banyan; Stacking; Routing (electronic design automation); Routing algorithm; Algorithm; Optical switch; Parallel computing; Computer network; Optoelectronics; Materials science; Routing protocol; Physics","score_opus":0.012753337222787445,"score_gpt":0.23314641847679926,"score_spread":0.2203930812540118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140520484","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9065302,0.00005327827,0.092520006,0.00008678051,0.000115100345,0.00012905216,9.033916e-7,0.00015461042,0.000410056],"genre_scores_gemma":[0.9703749,0.0000056386775,0.029500194,0.00003114476,0.000058799083,0.0000017227717,9.4163033e-7,0.000026115273,5.691636e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987361,0.0000135656,0.00043798215,0.00017808487,0.00019907247,0.00043520052],"domain_scores_gemma":[0.9992917,0.00033128838,0.00004207675,0.00027151385,0.000032931162,0.00003049807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023657194,0.00017764186,0.0002870142,0.000080642545,0.00005946242,0.000013399383,0.00031277063,0.00011264589,0.0000028336694],"category_scores_gemma":[0.00017856697,0.00013155717,0.000052961223,0.00028917214,0.00013197685,0.00007084919,0.00024008796,0.0004798652,0.000001928994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016162863,0.000030571442,0.0060021942,0.000095905656,0.000019701103,0.000002719138,0.0005516687,0.96434,0.0025954645,0.009780801,0.0000020872492,0.016562779],"study_design_scores_gemma":[0.0005422759,0.00009533098,0.017295942,0.00045433347,0.000007542338,0.0000043901446,0.00053232885,0.94694567,0.032881495,0.0010625933,0.0000038484263,0.00017426205],"about_ca_topic_score_codex":0.0000027874378,"about_ca_topic_score_gemma":0.000005361082,"teacher_disagreement_score":0.06384466,"about_ca_system_score_codex":0.00008797086,"about_ca_system_score_gemma":0.000011225444,"threshold_uncertainty_score":0.5364746},"labels":[],"label_agreement":null},{"id":"W2156080250","doi":"10.1007/s10586-014-0359-y","title":"Carbon-aware distributed cloud: multi-level grouping genetic algorithm","year":2014,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Carbon footprint; Cloud computing; Greenhouse gas; Genetic algorithm; Distributed computing; Bin packing problem; Algorithm; Reduction (mathematics); Bin; Machine learning","score_opus":0.02141251415636504,"score_gpt":0.2360213925604552,"score_spread":0.21460887840409015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156080250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075374216,0.00009647849,0.92109305,0.00051432895,0.0016471792,0.00024236277,0.000002757935,0.00070080964,0.00032885032],"genre_scores_gemma":[0.75906086,7.298424e-7,0.23917544,0.00070020393,0.0008643936,0.0000040474392,0.000007346759,0.00003098134,0.00015598457],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969968,0.00027701925,0.0005623209,0.0009111832,0.00043430057,0.00081833487],"domain_scores_gemma":[0.9981318,0.00026930426,0.00024801883,0.0010231474,0.00011784373,0.00020989397],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071305805,0.0003668154,0.00037399432,0.00016146354,0.00047401697,0.00036809902,0.0015918416,0.000111631714,0.000001742025],"category_scores_gemma":[0.00006448488,0.0003560126,0.00015873581,0.0005696538,0.00006577592,0.000028434375,0.0023470263,0.00033882255,0.00003854375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025854429,0.00014275483,0.0013633585,0.000086363594,0.00007383094,0.00004272831,0.0014339457,0.19655755,0.00001969543,0.00045604605,0.00066581846,0.7991553],"study_design_scores_gemma":[0.00092167035,0.000058717313,0.011241383,0.00013309834,0.000015263457,0.00004693403,0.00005858959,0.9845879,0.000039347982,0.00017114083,0.0022645583,0.00046137784],"about_ca_topic_score_codex":0.00008535807,"about_ca_topic_score_gemma":0.0000044777757,"teacher_disagreement_score":0.79869395,"about_ca_system_score_codex":0.000116255345,"about_ca_system_score_gemma":0.000027603217,"threshold_uncertainty_score":0.9998892},"labels":[],"label_agreement":null},{"id":"W2180880586","doi":"10.1007/s10586-015-0477-1","title":"A distributed frequent itemset mining algorithm using Spark for Big Data analytics","year":2015,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Natural Science Foundation of China","keywords":"Computer science; SPARK (programming language); Pruning; Scalability; Data mining; Association rule learning; Big data; Benchmark (surveying); GSP Algorithm; Computation; Process (computing); Algorithm; Apriori algorithm; Database","score_opus":0.256721916407233,"score_gpt":0.34482071353202187,"score_spread":0.08809879712478885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2180880586","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029171219,0.00008794206,0.99405634,0.0006621887,0.0011360053,0.00027977064,0.0006056078,0.0001900616,0.00006494976],"genre_scores_gemma":[0.023650581,0.0000012338237,0.97377694,0.00032651887,0.0011369521,0.0000067830815,0.0010480804,0.000022454373,0.000030457823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979699,0.00005252266,0.00044892603,0.0007716049,0.00028145924,0.00047556285],"domain_scores_gemma":[0.9973832,0.0002633619,0.00023982475,0.0016505901,0.00022538874,0.0002376395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010367322,0.00020333925,0.00026131512,0.00010628857,0.0002982788,0.00051877263,0.002141742,0.000067805464,3.4385852e-7],"category_scores_gemma":[0.00017723761,0.0002048026,0.000051278417,0.0006081271,0.00004886507,0.00043975128,0.0022394864,0.00012212517,0.00000877726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052442438,0.00017257068,0.00058136386,0.000046553116,0.00011420644,0.000018477178,0.0016422985,0.018470677,0.000078137666,0.00065215264,0.058625218,0.9195931],"study_design_scores_gemma":[0.00056119426,0.000035697372,0.000049884988,0.000060240873,0.00002810855,0.0000443178,0.00017868205,0.9652516,0.000034031542,0.0002981326,0.03320465,0.0002534656],"about_ca_topic_score_codex":0.00007003674,"about_ca_topic_score_gemma":0.0000067570927,"teacher_disagreement_score":0.9467809,"about_ca_system_score_codex":0.00011069667,"about_ca_system_score_gemma":0.00020187453,"threshold_uncertainty_score":0.8351608},"labels":[],"label_agreement":null},{"id":"W2195171817","doi":"10.1007/s10586-015-0498-9","title":"An efficient approach to collaborative simulation of variable structure systems on multi-core machines","year":2015,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Thread (computing); Speedup; Multi-core processor; Distributed computing; Core (optical fiber); Variable (mathematics); Parallel computing; Operating system","score_opus":0.042559065971394326,"score_gpt":0.300148674526515,"score_spread":0.2575896085551207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2195171817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19480097,0.000051836476,0.8024372,0.000015554046,0.0011220372,0.0005602984,0.00002790764,0.00017826601,0.0008059306],"genre_scores_gemma":[0.89662725,2.4037021e-8,0.10296005,0.00010305871,0.00022280123,0.0000033462795,0.00003636542,0.000016068941,0.00003101132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976866,0.00032140498,0.0005235905,0.0006200837,0.0004930803,0.00035521662],"domain_scores_gemma":[0.99787706,0.00019431909,0.0003187124,0.00072591845,0.0006266954,0.00025731602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079895754,0.00026164157,0.00040296212,0.00017861032,0.00016255917,0.0002562632,0.0008769978,0.00011047412,3.4959268e-7],"category_scores_gemma":[0.00011275133,0.0002244878,0.000040702067,0.001072607,0.000031620486,0.00013654686,0.00029018076,0.00016009015,0.000009280611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000213343,0.00017629801,0.00047529832,0.00006395934,0.000018096289,0.0000013271683,0.0064697517,0.9863014,0.000098260985,0.0056135035,0.00021648171,0.00054428173],"study_design_scores_gemma":[0.00078037946,0.00022904415,0.0003405987,0.00013787151,0.0000059361696,0.000009484302,0.00041826267,0.997453,0.000023871436,0.000050002738,0.00030296316,0.00024864072],"about_ca_topic_score_codex":0.000067755864,"about_ca_topic_score_gemma":8.5375024e-7,"teacher_disagreement_score":0.7018263,"about_ca_system_score_codex":0.000102907274,"about_ca_system_score_gemma":0.00012941114,"threshold_uncertainty_score":0.91543466},"labels":[],"label_agreement":null},{"id":"W2343650655","doi":"10.1007/s10586-016-0565-x","title":"Incorporating service and user information and latent features to predict QoS for selecting and recommending cloud service compositions","year":2016,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Cloud computing; Quality of service; Mobile QoS; Software as a service; Service provider; Service (business); The Internet; Software; Computer network; World Wide Web; Software development; Operating system","score_opus":0.009644635896766519,"score_gpt":0.23200064133424436,"score_spread":0.22235600543747785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2343650655","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5041806,0.00006792516,0.47816998,0.016287358,0.0003952926,0.0005612068,0.000011349028,0.0002029598,0.00012333562],"genre_scores_gemma":[0.83216715,0.0000067846063,0.15031481,0.017068205,0.00037694257,0.000023173287,0.000015544247,0.000018974437,0.000008428441],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985394,0.00008430833,0.0003939948,0.00043751296,0.00016310596,0.0003816902],"domain_scores_gemma":[0.9984626,0.0005967077,0.00022709796,0.00024895387,0.0002619552,0.00020264537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048429728,0.00024185602,0.0002270556,0.00020675096,0.0007129449,0.00051193126,0.00034161235,0.00008621887,6.06353e-7],"category_scores_gemma":[0.000024070789,0.00019034307,0.000023475146,0.0005139739,0.00001602943,0.0010841719,0.0010877366,0.00014467695,0.0000030939536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035435052,0.00013457346,0.09169829,0.0037251222,0.00037083184,0.000006205208,0.11203979,0.005704397,0.025422368,0.026502058,0.0023354783,0.73170656],"study_design_scores_gemma":[0.0066479873,0.00070888957,0.06304612,0.0036829938,0.00013982695,0.000822236,0.002923292,0.88759816,0.004850093,0.004027111,0.023609497,0.0019438005],"about_ca_topic_score_codex":0.00014619277,"about_ca_topic_score_gemma":0.00035241857,"teacher_disagreement_score":0.88189375,"about_ca_system_score_codex":0.000035746005,"about_ca_system_score_gemma":0.000027133867,"threshold_uncertainty_score":0.77619654},"labels":[],"label_agreement":null},{"id":"W2588816312","doi":"10.1007/s10586-017-0770-2","title":"Efficient and robust frame-synchronized blind audio watermarking by featuring multilevel DWT and DCT","year":2017,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Science and Technology, Taiwan; McGill University; University of Florida","keywords":"Digital watermarking; Computer science; Discrete cosine transform; Discrete wavelet transform; Watermark; Payload (computing); Frame (networking); Robustness (evolution); Artificial intelligence; Algorithm; Speech recognition; Wavelet; Wavelet transform; Image (mathematics); Telecommunications","score_opus":0.019899407363536747,"score_gpt":0.2601512023865371,"score_spread":0.24025179502300037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2588816312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4038874,0.00028276458,0.594633,0.00024857098,0.00024727744,0.00020523072,0.0000018503159,0.00025121926,0.00024272242],"genre_scores_gemma":[0.81778955,0.00001766163,0.18187356,0.00014363068,0.00009589274,0.0000054628645,0.000001980987,0.000019566696,0.000052675772],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803495,0.00008230463,0.00032150457,0.00076729537,0.00022389897,0.0005700633],"domain_scores_gemma":[0.99844974,0.00016457826,0.0003036451,0.00085189677,0.00007563656,0.00015448758],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00054463284,0.00031475184,0.0003318413,0.00014166886,0.0017132345,0.0011936311,0.00097042427,0.00013696899,7.4816677e-7],"category_scores_gemma":[0.000071612056,0.00028325056,0.000063231695,0.000082524435,0.00024059835,0.00038556015,0.0022354631,0.00036039166,0.000001459753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018958912,0.00026466095,0.0603545,0.0006274951,0.0002170002,0.00019085592,0.0113933105,0.013352044,0.01080785,0.0019578005,0.0011409179,0.89950395],"study_design_scores_gemma":[0.0016824304,0.000054345386,0.017303938,0.00040318992,0.000014058863,0.00009691382,0.000021448317,0.97399354,0.0047487374,0.000576049,0.00058997696,0.00051535934],"about_ca_topic_score_codex":0.00002830855,"about_ca_topic_score_gemma":0.0000022926517,"teacher_disagreement_score":0.9606415,"about_ca_system_score_codex":0.000037799986,"about_ca_system_score_gemma":0.000015802909,"threshold_uncertainty_score":0.999962},"labels":[],"label_agreement":null},{"id":"W2588845958","doi":"10.1007/s10586-017-0767-x","title":"Towards product customization and personalization in IoT-enabled cloud manufacturing","year":2017,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Digital Transformation in Industry","field":"Engineering","cited_by":130,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Cloud computing; Personalization; Product (mathematics); Production (economics); Internet of Things; World Wide Web","score_opus":0.015945802531172896,"score_gpt":0.23314995918181483,"score_spread":0.21720415665064194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2588845958","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9288973,0.000048801616,0.03647697,0.00016824993,0.00067500415,0.00022060814,0.0000016539434,0.00018935211,0.03332206],"genre_scores_gemma":[0.9987132,0.0000059775443,0.000887545,0.000029325283,0.00023405264,0.000002981387,0.000007759795,0.000022599665,0.000096574346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993409,0.000013319762,0.00021398437,0.00014613249,0.0001016782,0.00018398606],"domain_scores_gemma":[0.99968636,0.000017021395,0.000051564166,0.00018526975,0.000021615497,0.000038164795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001811265,0.00011527241,0.00011656641,0.00008442024,0.00018877005,0.00031122493,0.00013638492,0.00006054252,0.000008520309],"category_scores_gemma":[0.00003803125,0.00012604096,0.00001703003,0.000039588485,0.000032385957,0.0004233132,0.000060547867,0.00014702888,0.000009157546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015845682,0.000025336685,0.021721328,0.001047891,0.000031495885,0.000009253115,0.005823578,0.8001165,0.00022639072,0.00028562607,0.0013034872,0.1693933],"study_design_scores_gemma":[0.0008803007,0.000007389741,0.04974779,0.00028979257,0.0000073240794,0.00001759035,0.00025872985,0.94186836,0.0048105074,0.00012017416,0.0017078926,0.00028414108],"about_ca_topic_score_codex":0.000010256805,"about_ca_topic_score_gemma":0.000005516939,"teacher_disagreement_score":0.16910917,"about_ca_system_score_codex":0.000069016605,"about_ca_system_score_gemma":0.000009307297,"threshold_uncertainty_score":0.51398015},"labels":[],"label_agreement":null},{"id":"W2589580626","doi":"10.1007/s10586-017-0749-z","title":"A user behavior prediction model based on parallel neural network and k-nearest neighbor algorithms","year":2017,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Human Mobility and Location-Based Analysis","field":"Social Sciences","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China; National Science Foundation","keywords":"Computer science; k-nearest neighbors algorithm; Artificial neural network; Machine learning; Data mining; Artificial intelligence; Algorithm","score_opus":0.03270691804910043,"score_gpt":0.3126841976612784,"score_spread":0.279977279612178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2589580626","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6852631,0.000036747268,0.30672106,0.0033005637,0.00049025874,0.0005774875,0.000012087929,0.00017070533,0.003427971],"genre_scores_gemma":[0.99602103,0.0000022559086,0.0022936359,0.0005550701,0.00070130284,0.000013531973,0.000011878739,0.000010298628,0.00039097603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878293,0.0001562496,0.00019644664,0.00031058257,0.00025901254,0.00029477428],"domain_scores_gemma":[0.999145,0.00015497308,0.00014411067,0.000355426,0.00007870931,0.00012181009],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007293652,0.00011061013,0.0001472144,0.00004141916,0.0029100105,0.00042189602,0.0002611554,0.00009199875,0.000024862873],"category_scores_gemma":[0.00012120103,0.000110175366,0.00007255448,0.000066846784,0.0002497836,0.00017264263,0.00007638626,0.00016625426,0.000006954344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016641583,0.00006952009,0.09328743,0.0000086818045,0.000009041614,0.000002698406,0.0017083345,0.8710356,0.0000014548501,0.0003277892,0.00044986786,0.033082943],"study_design_scores_gemma":[0.00031818188,0.000028012322,0.08352236,0.00003225907,0.000040945284,1.7309753e-7,0.00014734425,0.9153985,4.3720837e-7,0.00012009853,0.00029040838,0.00010133242],"about_ca_topic_score_codex":0.0013526081,"about_ca_topic_score_gemma":0.0018390947,"teacher_disagreement_score":0.31075794,"about_ca_system_score_codex":0.000059395206,"about_ca_system_score_gemma":0.000078131474,"threshold_uncertainty_score":0.99838805},"labels":[],"label_agreement":null},{"id":"W2592666947","doi":"10.1007/s10586-017-0815-6","title":"Collision detection for virtual environment using particle swarm optimization with adaptive cauchy mutation","year":2017,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Particle swarm optimization; Computer science; Multi-swarm optimization; Collision detection; Algorithm; Mathematical optimization; Adaptive mutation; Cauchy distribution; Mutation; Collision; Swarm behaviour; Genetic algorithm; Mathematics; Artificial intelligence","score_opus":0.03538594963211208,"score_gpt":0.2655798658036606,"score_spread":0.23019391617154852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592666947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16519707,0.000008875511,0.83386904,0.00009785294,0.0003576219,0.00036415167,0.000001176643,0.00008451855,0.000019705683],"genre_scores_gemma":[0.55027133,2.78084e-7,0.44958755,0.00003167131,0.000079723395,0.000005582937,0.0000018281326,0.000009823576,0.0000121947805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987637,0.00006355497,0.00022448318,0.00042526002,0.00023980126,0.00028322605],"domain_scores_gemma":[0.9988735,0.00013543168,0.00035996342,0.00047739194,0.00008080173,0.00007293512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000375654,0.00014709307,0.00014682759,0.00004984688,0.0011653124,0.00038112883,0.00039609475,0.000059026603,5.3351965e-7],"category_scores_gemma":[0.000064775915,0.00013839264,0.00003614641,0.00006905945,0.000057196175,0.00066819414,0.00024478775,0.000086343425,0.000005152234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028760991,0.000023230003,0.00015080361,0.0000047840967,0.000012495946,0.000007173637,0.0008393507,0.9808712,0.0002661251,0.00006229272,0.0000036766378,0.017730087],"study_design_scores_gemma":[0.0009523168,0.0003573618,0.0011367566,0.000068559355,0.000018049039,0.00004297585,0.00009268906,0.99032015,0.00676529,0.00005375051,0.0000074329428,0.00018468253],"about_ca_topic_score_codex":0.000038099606,"about_ca_topic_score_gemma":0.0000018023705,"teacher_disagreement_score":0.38507426,"about_ca_system_score_codex":0.00016315655,"about_ca_system_score_gemma":0.00003646737,"threshold_uncertainty_score":0.8962759},"labels":[],"label_agreement":null},{"id":"W2782246985","doi":"10.1007/s10586-017-1672-z","title":"The simulation model on delay time of road accessibility based on intelligent traffic control system","year":2018,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Traffic Prediction and Management Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Computer science; Transport engineering; Traffic congestion; Residential area; Analytic hierarchy process; Operations research; Civil engineering; Mathematics; Engineering; Geography","score_opus":0.01252483556359828,"score_gpt":0.24751372783804063,"score_spread":0.23498889227444233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782246985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13512386,0.000009276715,0.85970217,0.000028531322,0.00022996364,0.00042881144,0.0000025596707,0.0017954098,0.0026794272],"genre_scores_gemma":[0.99915975,4.3215408e-7,0.00057617703,0.00012791737,0.000095075105,0.00000733086,0.0000024765088,0.000017434313,0.000013387358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917424,0.00005450687,0.00030589753,0.0001546456,0.00015800855,0.00015267485],"domain_scores_gemma":[0.9993731,0.00018882356,0.00006571526,0.00028575974,0.00005544884,0.00003118077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044174682,0.00011702137,0.00013132134,0.000070839684,0.00012015699,0.000036974026,0.00018077325,0.000051812,0.0000018702846],"category_scores_gemma":[0.00002007869,0.00008912972,0.000058924885,0.000088307,0.000038273716,0.00003907871,0.000026340633,0.00009818797,0.00002003094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038796035,0.000018115303,0.00000668763,0.00004129208,0.000013948674,1.945541e-7,0.00010581639,0.9045785,0.000024318188,0.00006561989,0.0005368827,0.09456983],"study_design_scores_gemma":[0.00030525867,0.00008297354,0.00021944357,0.00012418588,0.000012672348,1.7099772e-7,0.000021101108,0.9987323,0.00029210196,0.0000032034777,0.00012838772,0.00007818507],"about_ca_topic_score_codex":7.2210355e-7,"about_ca_topic_score_gemma":0.0000011594719,"teacher_disagreement_score":0.8640359,"about_ca_system_score_codex":0.00010636339,"about_ca_system_score_gemma":0.000006108085,"threshold_uncertainty_score":0.36346042},"labels":[],"label_agreement":null},{"id":"W2786800158","doi":"10.1007/s10586-018-1854-3","title":"Cost-sensitive large margin distribution machine for fault detection of wind turbines","year":2018,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Machine Fault Diagnosis Techniques","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Science Foundation of Hainan Province; National Natural Science Foundation of China","keywords":"Margin (machine learning); Wind power; Computer science; Support vector machine; Benchmark (surveying); Turbine; Sensitivity (control systems); Fault (geology); Fault detection and isolation; Machine learning; Artificial intelligence; Engineering; Geology","score_opus":0.012201347228585293,"score_gpt":0.2825349271661472,"score_spread":0.2703335799375619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786800158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3443356,0.00004619023,0.65397996,0.000034409855,0.00032421332,0.0005045409,0.00014509338,0.00038004262,0.0002499514],"genre_scores_gemma":[0.9949758,0.0000036662323,0.0043382808,0.000059048205,0.00040927698,0.000013982804,0.00015047778,0.000037158356,0.000012318443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907464,0.000034461325,0.0003025596,0.00019412427,0.00010472141,0.00028952237],"domain_scores_gemma":[0.9993272,0.0001805445,0.00008273024,0.00018018358,0.00018551185,0.000043847882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030454417,0.00017371083,0.00022380808,0.00007597609,0.00011147464,0.000023200331,0.00010647392,0.00009898111,0.0000055645983],"category_scores_gemma":[0.00012567655,0.00017767906,0.00008137583,0.0001663144,0.000041928208,0.00008734476,0.00008193474,0.00012841508,0.000006354087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005516304,0.00065859186,0.015729723,0.0027468798,0.00063815876,0.000014854362,0.006179413,0.041999023,0.24379528,0.0013773702,0.028550057,0.657759],"study_design_scores_gemma":[0.000517738,0.00009504872,0.0039523295,0.00009115547,0.00001934393,0.0000076247716,0.00002169328,0.7709049,0.2197608,0.00008297056,0.0043822625,0.00016411867],"about_ca_topic_score_codex":0.000023610495,"about_ca_topic_score_gemma":0.00006149642,"teacher_disagreement_score":0.7289059,"about_ca_system_score_codex":0.000089882866,"about_ca_system_score_gemma":0.0000051662832,"threshold_uncertainty_score":0.7245542},"labels":[],"label_agreement":null},{"id":"W2966314110","doi":"10.1007/s10586-019-02954-w","title":"Optimizing virtual machine placement in IaaS data centers: taxonomy, review and open issues","year":2019,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Virtual machine; Energy consumption; Virtualization; Data center; Distributed computing; Live migration; Process (computing); Cloud computing; Operating system","score_opus":0.049818494569923204,"score_gpt":0.2964128105983675,"score_spread":0.24659431602844428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966314110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1368544,0.06231213,0.728674,0.033452153,0.0029252998,0.01027387,0.00001864308,0.00082359585,0.024665901],"genre_scores_gemma":[0.76566523,0.0006480663,0.21515667,0.014811796,0.00029343658,0.000028683733,0.000058198963,0.000060999573,0.0032769097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764866,0.00020277088,0.000502965,0.0009825686,0.00022904297,0.00043399376],"domain_scores_gemma":[0.9980107,0.00014251337,0.00019802921,0.0015286851,0.000027002534,0.00009307783],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0016324806,0.00024303434,0.0004715744,0.000121497986,0.00013598926,0.0005714965,0.003681735,0.000038335882,0.000020099915],"category_scores_gemma":[0.000032109307,0.00022127898,0.000033971755,0.00031868953,0.000028060895,0.00018344642,0.020045841,0.00024268248,0.000054925666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071876835,0.0008093429,0.022910794,0.0041409414,0.00039596448,0.00015317048,0.0076302486,0.215642,0.00004462106,0.0067368676,0.062982604,0.6784816],"study_design_scores_gemma":[0.0010215039,0.00009151391,0.0003497128,0.0018456584,0.000016816686,0.000019464533,0.0001459777,0.9378815,0.0000042724323,0.0000157006,0.058307834,0.00030002743],"about_ca_topic_score_codex":0.00017159949,"about_ca_topic_score_gemma":0.000018073171,"teacher_disagreement_score":0.7222395,"about_ca_system_score_codex":0.00006781792,"about_ca_system_score_gemma":0.000025810306,"threshold_uncertainty_score":0.9878799},"labels":[],"label_agreement":null},{"id":"W3000966336","doi":"10.1007/s10586-020-03046-w","title":"A game theoretic analysis of resource mining in blockchain","year":2020,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University; University of Waterloo","funders":"Narodowym Centrum Nauki; University of Waterloo; Narodowe Centrum Nauki","keywords":"Blockchain; Computer science; Resource (disambiguation); Theoretical computer science; Data mining; Computer security; Computer network","score_opus":0.013451679883116265,"score_gpt":0.23824495205200588,"score_spread":0.2247932721688896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000966336","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55812764,0.000071975315,0.43885565,0.0023043856,0.0000106258885,0.00008201143,6.652446e-7,0.000109291825,0.00043776358],"genre_scores_gemma":[0.9748934,7.354185e-7,0.0240452,0.0010270854,0.000019344387,0.0000035429082,0.0000016401261,0.0000054503703,0.0000036127215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987585,0.00010455572,0.00037915446,0.00040152084,0.00013109983,0.00022518492],"domain_scores_gemma":[0.9990215,0.0002585471,0.00015807661,0.00046853392,0.00003582289,0.000057524194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045850597,0.00010599446,0.00031244033,0.00034433207,0.000049732917,0.000025437741,0.00092086033,0.00008692764,0.0000039021857],"category_scores_gemma":[0.00007127348,0.00010800217,0.0000974499,0.0030054245,0.000091988826,0.000023389795,0.00065042544,0.00018774976,0.0000028357385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036665482,0.00034394886,0.076211266,0.00019655285,0.00068819616,0.000054222768,0.10171411,0.25529116,0.00094362226,0.41941488,0.00035819205,0.14474718],"study_design_scores_gemma":[0.00021333084,0.00002840676,0.0026620915,0.000019536028,0.000036421334,0.0000020501545,0.00026112224,0.99503964,0.00024920687,0.0011816543,0.00020171491,0.00010480775],"about_ca_topic_score_codex":0.000008694593,"about_ca_topic_score_gemma":0.000007644463,"teacher_disagreement_score":0.7397485,"about_ca_system_score_codex":0.000017363129,"about_ca_system_score_gemma":0.00001795338,"threshold_uncertainty_score":0.44042006},"labels":[],"label_agreement":null},{"id":"W3003707605","doi":"10.1007/s10586-020-03064-8","title":"Securing the LoRaWAN join procedure using blockchains","year":2020,"lang":"en","type":"article","venue":"Cluster Computing","topic":"IoT Networks and Protocols","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Network packet; Computer security; Computer network; Authentication (law); Replay attack; Distributed computing","score_opus":0.026268906866458788,"score_gpt":0.2362873881786082,"score_spread":0.2100184813121494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003707605","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70609,0.00051823084,0.2803678,0.0020246306,0.0007379752,0.0048858626,0.0000025009776,0.0011405057,0.004232518],"genre_scores_gemma":[0.99525017,8.236326e-7,0.0017693242,0.0013020593,0.0015942337,0.000028193239,0.0000011630709,0.000045832014,0.000008187269],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999165,0.000030169827,0.0002115586,0.00016466506,0.00011120013,0.00031738958],"domain_scores_gemma":[0.9996725,0.000051491807,0.0000367253,0.0001397805,0.000020669286,0.000078882746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014254154,0.00015556566,0.00014641184,0.00001883105,0.0002055994,0.00010485198,0.0002144835,0.000059295566,0.0000123886],"category_scores_gemma":[0.000015003158,0.00012310313,0.00005832254,0.00021981624,0.000020444742,0.00004804223,0.00014496886,0.00031723725,0.000018023642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004660222,0.0000030220265,0.00039946035,0.0001895324,0.000022434926,0.0000065725253,0.0033105565,0.9896187,0.0004935691,0.0000484046,0.002414492,0.0034885828],"study_design_scores_gemma":[0.00021322802,0.0000141852015,0.00009302762,0.000119573924,0.00000840906,0.000016260605,0.00012418328,0.9940218,0.000498676,0.000040021936,0.0046870466,0.0001636145],"about_ca_topic_score_codex":0.0000023299442,"about_ca_topic_score_gemma":0.0000019368754,"teacher_disagreement_score":0.2891602,"about_ca_system_score_codex":0.000032080992,"about_ca_system_score_gemma":0.000015350965,"threshold_uncertainty_score":0.50200003},"labels":[],"label_agreement":null},{"id":"W3005560537","doi":"10.1007/s10586-020-03058-6","title":"A decentralized lightweight blockchain-based authentication mechanism for IoT systems","year":2020,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":296,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Blockchain; Internet of Things; Authentication (law); Computer security; Access control; Confidentiality; Smart objects; Mechanism (biology); The Internet; World Wide Web","score_opus":0.01976899737891828,"score_gpt":0.24507620672889213,"score_spread":0.22530720934997386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005560537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06674533,0.00013806112,0.91107064,0.020045213,0.00026770026,0.0008958818,0.000004176242,0.00079552847,0.000037434256],"genre_scores_gemma":[0.870456,4.9450693e-7,0.12678866,0.0025260719,0.00011724682,0.00008114544,0.0000040878167,0.000016089336,0.000010245312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983597,0.000071329436,0.0004012426,0.0005980024,0.00017614749,0.00039361548],"domain_scores_gemma":[0.9986587,0.00022160889,0.00020897975,0.0005593824,0.00020378281,0.00014750434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003029425,0.00018721061,0.00025471306,0.00008997995,0.00034625054,0.00013816569,0.0010466886,0.00016113951,0.0000019919412],"category_scores_gemma":[0.00008704821,0.00018445434,0.00010707153,0.00046021017,0.000040271676,0.000014443167,0.0002448651,0.00016363255,0.000025768852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012409782,0.0000832045,0.000049199025,0.00011902214,0.00003126636,0.000002195873,0.0014057343,0.004243146,0.0018900076,0.9867126,0.0007143124,0.0047369204],"study_design_scores_gemma":[0.00085948035,0.000066506174,0.000014354098,0.000029491413,0.000015664293,0.000005588513,0.00003559895,0.9808993,0.004943315,0.010506925,0.0024163474,0.00020747614],"about_ca_topic_score_codex":0.0000065399217,"about_ca_topic_score_gemma":0.0000011009928,"teacher_disagreement_score":0.9766561,"about_ca_system_score_codex":0.000046123394,"about_ca_system_score_gemma":0.00007762839,"threshold_uncertainty_score":0.75218296},"labels":[],"label_agreement":null},{"id":"W3012262040","doi":"10.1007/s10586-020-03086-2","title":"Energy-efficient offloading of real-time tasks using cloud computing","year":2020,"lang":"en","type":"article","venue":"Cluster Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Cloudlet; Cloud computing; Distributed computing; Computation offloading; Computation; Energy consumption; Power (physics); Efficient energy use; Embedded system; Real-time computing; Edge computing; Operating system; Algorithm","score_opus":0.02841494371782515,"score_gpt":0.2512993307724237,"score_spread":0.22288438705459857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012262040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.339372,0.0000895395,0.65431154,0.00029425276,0.00351825,0.00012944169,3.780898e-7,0.00042323148,0.0018613528],"genre_scores_gemma":[0.86539304,0.000001599212,0.1295263,0.00084417115,0.0041623544,3.7724422e-7,0.0000042746105,0.000049129038,0.000018725974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960106,0.00028894673,0.0011225564,0.0010053641,0.0005948838,0.0009776589],"domain_scores_gemma":[0.99753225,0.0005215995,0.00069608085,0.00066342147,0.0002462726,0.00034039823],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008851644,0.00044774983,0.0007351005,0.00022841156,0.00056396425,0.00027114636,0.0016279956,0.00015323011,0.000004255314],"category_scores_gemma":[0.000106774336,0.00047718914,0.00027685313,0.001286561,0.00010725423,0.0002249839,0.002695776,0.00035229398,0.000041187934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007282012,0.00034355998,0.0033596896,0.0006258441,0.00028467397,0.00017302437,0.03338208,0.70809877,0.10387658,0.0052647307,0.009660094,0.13485815],"study_design_scores_gemma":[0.00059741136,0.000088237684,0.00015401437,0.0002825594,0.000022488119,0.000049532537,0.000063656,0.9930531,0.0044283867,0.00008824484,0.0006774161,0.0004949464],"about_ca_topic_score_codex":0.000098938435,"about_ca_topic_score_gemma":2.0430862e-7,"teacher_disagreement_score":0.52602106,"about_ca_system_score_codex":0.00013388741,"about_ca_system_score_gemma":0.00015618278,"threshold_uncertainty_score":0.99976796},"labels":[],"label_agreement":null},{"id":"W3045595071","doi":"10.1007/s10586-020-03156-5","title":"Design and evaluation of a user authentication model for IoT networks based on app event patterns","year":2020,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Usability; Authentication (law); Computer security; Multi-factor authentication; Authentication protocol; Computer network; Human–computer interaction","score_opus":0.053350187115428174,"score_gpt":0.28743706252022055,"score_spread":0.2340868754047924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045595071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06832997,0.000018162295,0.9304065,0.0007228832,0.000060071412,0.0004108486,4.1550254e-7,0.000044979824,0.000006136811],"genre_scores_gemma":[0.91836375,2.0756477e-7,0.08063267,0.00090342795,0.00007284423,0.000008998914,0.000004775757,0.000008880374,0.000004439396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986969,0.00016481103,0.0003199372,0.00034701443,0.00030399425,0.00016731795],"domain_scores_gemma":[0.99916947,0.0002402723,0.00019516515,0.00013745052,0.00020125358,0.000056361154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001280288,0.00011188342,0.0001666383,0.000052220596,0.0000802609,0.000074153766,0.00026868473,0.000046809677,0.000001897373],"category_scores_gemma":[0.000053691736,0.000103605074,0.0000753666,0.00011963795,0.0000117626805,0.0000565193,0.00009440857,0.00008004689,9.081154e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012815945,0.000025614643,0.000042557618,0.000024815552,0.000015541234,1.1031761e-7,0.0022412427,0.9795517,0.000017457882,0.0028094961,0.00007196112,0.015186733],"study_design_scores_gemma":[0.00058469526,0.00009020156,0.0001413673,0.000080849575,0.000051843035,3.7538578e-7,0.000023073873,0.9988455,0.000046399822,0.000029394114,0.0000031081581,0.00010316791],"about_ca_topic_score_codex":8.785663e-7,"about_ca_topic_score_gemma":0.0000010876108,"teacher_disagreement_score":0.8500338,"about_ca_system_score_codex":0.000031015003,"about_ca_system_score_gemma":0.000048885027,"threshold_uncertainty_score":0.42248926},"labels":[],"label_agreement":null},{"id":"W3082025521","doi":"10.1007/s10586-020-03153-8","title":"TempoCode-IoT: temporal codebook-based encoding of flow features for intrusion detection in Internet of Things","year":2020,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Codebook; Discriminative model; Intrusion detection system; Internet of Things; Botnet; Feature (linguistics); Artificial intelligence; Encoding (memory); Data mining; State (computer science); Representation (politics); The Internet; Machine learning; Code (set theory); Pattern recognition (psychology); Computer security; Algorithm; World Wide Web","score_opus":0.018654792774376094,"score_gpt":0.24056577732456388,"score_spread":0.2219109845501878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082025521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17573026,0.000052780393,0.8228407,0.000430228,0.00039884564,0.00034695963,7.642408e-7,0.00008309803,0.000116347335],"genre_scores_gemma":[0.9191286,0.0000010237945,0.080079764,0.0006534862,0.00011221916,0.000004855428,0.0000028179707,0.000011131362,0.0000060915427],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985021,0.000116933785,0.00056653743,0.00037859415,0.000216952,0.00021889612],"domain_scores_gemma":[0.9989742,0.0002817518,0.0003592599,0.00020327097,0.00011812248,0.00006337898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005489374,0.00015471505,0.00031216352,0.00018290445,0.0000782517,0.000049707556,0.00048581933,0.00012177152,0.000003627571],"category_scores_gemma":[0.00014205475,0.00015317398,0.0001226261,0.00043324876,0.000043891025,0.00023910037,0.0003381969,0.00024892992,0.0000011954215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083122286,0.0001997738,0.002310774,0.0012605396,0.000045846926,0.000008533046,0.028957868,0.08125648,0.061461188,0.0016553318,0.0007522131,0.8212602],"study_design_scores_gemma":[0.0007717359,0.00032225632,0.00018881974,0.00025205288,0.0000044110716,0.0000036083345,0.000039408405,0.8813823,0.116247445,0.00035869243,0.00030170102,0.00012760136],"about_ca_topic_score_codex":0.000099291596,"about_ca_topic_score_gemma":0.000034536362,"teacher_disagreement_score":0.8211326,"about_ca_system_score_codex":0.00004728935,"about_ca_system_score_gemma":0.000039324113,"threshold_uncertainty_score":0.6246254},"labels":[],"label_agreement":null},{"id":"W3096318863","doi":"10.1007/s10586-020-03199-8","title":"MMHGE: detecting mild cognitive impairment based on multi-atlas multi-view hybrid graph convolutional networks and ensemble learning","year":2020,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Dementia and Cognitive Impairment Research","field":"Medicine","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Science Foundation of Hunan Province; National Natural Science Foundation of China","keywords":"Computer science; Discriminative model; Cognitive impairment; Graph; Artificial intelligence; Pattern recognition (psychology); Convolutional neural network; Cognition; Machine learning; Medicine; Theoretical computer science","score_opus":0.03560893031235769,"score_gpt":0.30679036735635823,"score_spread":0.27118143704400055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096318863","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59269595,0.0004779392,0.40449452,0.0007549791,0.00010382399,0.0009973714,0.0000035360895,0.000151143,0.0003207114],"genre_scores_gemma":[0.99125314,0.000024354506,0.0038670169,0.004316337,0.0002969708,0.000024044299,0.000068551235,0.000047627655,0.00010197248],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974186,0.00033290737,0.0004208462,0.000682533,0.00046426617,0.0006808546],"domain_scores_gemma":[0.99838537,0.0006361863,0.00015588525,0.00010918184,0.00027962687,0.00043375313],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006560714,0.00032057497,0.00042095914,0.00015550348,0.00050254585,0.00009737278,0.00009175818,0.00007818007,0.00005905475],"category_scores_gemma":[0.0003986164,0.00030240233,0.00016533017,0.00030770828,0.00013978514,0.00007559843,0.000249891,0.0008654807,0.000050219838],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002621871,0.0014707216,0.8446506,0.0012978209,0.00060566934,0.00060942356,0.001684753,0.030697653,0.0014298933,0.000010582565,0.0006948972,0.11422609],"study_design_scores_gemma":[0.009008058,0.001236501,0.14408359,0.0009532533,0.000119370176,0.000047057183,0.0005848553,0.84258425,0.0010121348,0.000001770257,0.00010791313,0.00026123287],"about_ca_topic_score_codex":0.000015196588,"about_ca_topic_score_gemma":0.0000036408865,"teacher_disagreement_score":0.8118866,"about_ca_system_score_codex":0.000075909644,"about_ca_system_score_gemma":0.00009387519,"threshold_uncertainty_score":0.9999428},"labels":[],"label_agreement":null},{"id":"W3123965728","doi":"10.1007/s10586-021-03231-5","title":"Towards the design of real-time autonomous IoT NIDS","year":2021,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Botnet; Internet of Things; Scalability; Intrusion detection system; Feature selection; Classifier (UML); Sliding window protocol; Data mining; Network packet; Computer network; Artificial intelligence; Real-time computing; Machine learning; Computer security; The Internet; Window (computing); Operating system","score_opus":0.02480977710524583,"score_gpt":0.24126189873652187,"score_spread":0.21645212163127603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123965728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037416313,0.00012998312,0.9567571,0.0010821045,0.0006887895,0.00012564886,3.3735802e-7,0.00015223016,0.003647451],"genre_scores_gemma":[0.8688511,0.000020099556,0.1296113,0.00074377004,0.0003589432,0.000002370193,0.000001147436,0.000012270145,0.000398963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863106,0.0003280103,0.00029914943,0.00029321463,0.00021268809,0.0002358974],"domain_scores_gemma":[0.9988417,0.00029393454,0.0001362941,0.0005364601,0.00014598893,0.000045648703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007079922,0.00011011765,0.00017421108,0.000042487987,0.00024099906,0.00012456009,0.00062570674,0.000063748645,0.000035543748],"category_scores_gemma":[0.000057539954,0.000086623164,0.00008090456,0.0004719009,0.000051272546,0.00009931073,0.000735235,0.00016460345,0.00004120693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029698,0.00018249248,0.00008289904,0.0000725321,0.00009455274,0.0000639795,0.009402837,0.16663289,0.017031396,0.017994434,0.009407821,0.77900445],"study_design_scores_gemma":[0.00017454826,0.00006400998,0.00036148095,0.00004421378,0.000006116776,0.000069706824,0.000025241097,0.98567176,0.010033969,0.0017564544,0.0016823674,0.00011015968],"about_ca_topic_score_codex":0.00002772743,"about_ca_topic_score_gemma":0.0000018417677,"teacher_disagreement_score":0.83143485,"about_ca_system_score_codex":0.000038232225,"about_ca_system_score_gemma":0.00013335921,"threshold_uncertainty_score":0.353239},"labels":[],"label_agreement":null},{"id":"W3173206457","doi":"10.1007/s10586-021-03339-8","title":"A classification of hadoop job schedulers based on performance optimization approaches","year":2021,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Job scheduler; Scheduling (production processes); Job queue; Execution time; Task (project management); Distributed computing; Job performance; Cloud computing; Operating system; Mathematical optimization; Job satisfaction; Management","score_opus":0.044410813730767905,"score_gpt":0.23115552274408324,"score_spread":0.18674470901331533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173206457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2450437,0.000027383221,0.7462833,0.0010805952,0.00023397311,0.000106134146,1.8665544e-7,0.00012589387,0.007098845],"genre_scores_gemma":[0.8334902,6.059935e-7,0.16595054,0.0003608767,0.00007114393,0.00000226039,0.0000042359275,0.000010004704,0.00011014918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848807,0.00014206195,0.000334182,0.00046732186,0.00032886653,0.00023949676],"domain_scores_gemma":[0.9988233,0.0001431774,0.00020330539,0.00065498805,0.00012145591,0.000053787357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046924845,0.00014656878,0.00017789776,0.00013926167,0.00019511455,0.00011906851,0.0005124653,0.000057723653,0.0000033206481],"category_scores_gemma":[0.000052457377,0.00014262277,0.00008212151,0.0006234689,0.000041064297,0.000035740868,0.00036760102,0.00014915205,0.000008564729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004820701,0.00007887356,0.001700884,0.00007821142,0.000010866852,0.0000020447849,0.0003046092,0.9534706,0.000027529706,0.0017577742,0.000061608145,0.04250221],"study_design_scores_gemma":[0.0004255955,0.000054412376,0.009886841,0.00017416239,0.0000074956884,0.000004411265,0.00009046625,0.9886599,0.00042056706,0.000013161751,0.00011249975,0.00015047051],"about_ca_topic_score_codex":0.0000017085661,"about_ca_topic_score_gemma":3.3968973e-7,"teacher_disagreement_score":0.5884465,"about_ca_system_score_codex":0.000057499965,"about_ca_system_score_gemma":0.000069344416,"threshold_uncertainty_score":0.5815988},"labels":[],"label_agreement":null},{"id":"W3192838559","doi":"10.1007/s10586-021-03361-w","title":"ProBlock: a novel approach for fake news detection","year":2021,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Misinformation and Its Impacts","field":"Social Sciences","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Computer science; Upload; Correctness; Voting; Social media; Fake news; Internet privacy; News media; Probabilistic logic; The Internet; World Wide Web; Computer security; Artificial intelligence; Algorithm; Advertising","score_opus":0.0530046895499609,"score_gpt":0.31844115176218396,"score_spread":0.26543646221222306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3192838559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036072206,0.000016471779,0.9014328,0.00061320973,0.00031127743,0.00032258205,0.0000015771077,0.0000930323,0.061136834],"genre_scores_gemma":[0.9533634,0.00000166551,0.043046013,0.0012446565,0.00047925665,0.0000023136727,0.000010196256,0.0000075621742,0.001844889],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992665,0.000041901665,0.00017145253,0.00012578216,0.00015734597,0.00023701554],"domain_scores_gemma":[0.9995371,0.00007487785,0.00007998523,0.000089767236,0.00013668466,0.00008156318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042197737,0.00006023967,0.00008586427,0.000035909903,0.0005331031,0.00017690429,0.00008649511,0.00006283442,0.000015396185],"category_scores_gemma":[0.00036110007,0.000060512386,0.000056031433,0.00021835101,0.000029039407,0.00017392436,0.000045943987,0.000068921785,0.000007908881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040095227,0.0003047425,0.00036157423,0.00033694954,0.00006128317,0.0000010261895,0.27014172,0.011342949,0.0029174332,0.013136697,0.006570279,0.69478524],"study_design_scores_gemma":[0.0019282692,0.000052626612,0.000905772,0.0000690097,0.000022606953,0.000019828365,0.056573547,0.7723804,0.0023117347,0.00030802572,0.16503087,0.0003972993],"about_ca_topic_score_codex":0.000055982502,"about_ca_topic_score_gemma":0.00016858302,"teacher_disagreement_score":0.9172912,"about_ca_system_score_codex":0.000058217993,"about_ca_system_score_gemma":0.00012724615,"threshold_uncertainty_score":0.4100252},"labels":[],"label_agreement":null},{"id":"W3198861897","doi":"10.1007/s10586-021-03402-4","title":"Toward integrating software defined networks with the Internet of Things: a review","year":2021,"lang":"en","type":"review","venue":"Cluster Computing","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Software deployment; The Internet; Orchestration; Software-defined networking; World Wide Web; Telecommunications; Computer network","score_opus":0.03871512774760118,"score_gpt":0.2824244045812103,"score_spread":0.24370927683360916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198861897","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.06160556e-7,0.5089407,0.48978686,0.00014911722,0.0003498441,0.000492487,7.598812e-7,0.00016555237,0.00011458577],"genre_scores_gemma":[0.000017771385,0.8778681,0.118986525,0.0025497258,0.00031444,0.000043931617,0.000050236038,0.00008163346,0.00008759085],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99551314,0.00078769523,0.0014098944,0.0010727593,0.0005216251,0.00069487945],"domain_scores_gemma":[0.9935249,0.0027822962,0.0016555001,0.0015638886,0.00034939128,0.0001240134],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015155989,0.00082053174,0.0029190886,0.00012571759,0.00019365837,0.0003941397,0.0031821956,0.00030093826,0.000013756911],"category_scores_gemma":[0.0004114132,0.0004657995,0.00085567805,0.0017219159,0.00012359885,0.00025793212,0.002673107,0.0014638122,0.000011050171],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010354593,0.00002021476,0.0000053414883,0.016025975,0.00018954951,0.000035902503,0.00050747884,0.00030208557,1.3534268e-9,0.0007221449,0.008799026,0.97339123],"study_design_scores_gemma":[0.00019640969,0.00010718094,7.751773e-7,0.33662468,0.0006090986,0.0006013413,0.000031995733,0.08000193,9.002485e-8,0.000025402103,0.581074,0.00072710804],"about_ca_topic_score_codex":0.000030084086,"about_ca_topic_score_gemma":0.000005030866,"teacher_disagreement_score":0.9726641,"about_ca_system_score_codex":0.000109748624,"about_ca_system_score_gemma":0.0003954132,"threshold_uncertainty_score":0.99977934},"labels":[],"label_agreement":null},{"id":"W3200962337","doi":"10.1007/s10586-021-03395-0","title":"Replication management in peer-to-peer cloud storage systems","year":2021,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Replication (statistics); Cloud computing; Cloud storage; Distributed computing; Load balancing (electrical power); Computer data storage; Peer-to-peer; Popularity; Computer network; Data management; Database; Operating system","score_opus":0.02324836695857902,"score_gpt":0.2641101334585464,"score_spread":0.24086176649996738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200962337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18722722,0.00017634087,0.80145186,0.0044060396,0.0019342036,0.00023853908,6.7856473e-7,0.00019109772,0.0043740096],"genre_scores_gemma":[0.9838748,0.0000017108374,0.008221623,0.0012716278,0.00021963292,0.000009300126,0.00000819201,0.000010790517,0.0063823243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981066,0.00014722382,0.00031861974,0.00067598326,0.0004622513,0.0002892997],"domain_scores_gemma":[0.9983932,0.000076815646,0.0000754793,0.0011296363,0.00024428393,0.000080610385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001106066,0.00012267844,0.00016521601,0.00013431611,0.00011419679,0.0003745626,0.0006103554,0.000041814998,0.000001108234],"category_scores_gemma":[0.00008643689,0.00013385211,0.000055029104,0.0005200593,0.0000072936427,0.00014421678,0.0008875723,0.00016156596,0.00007477964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003308347,0.00048029405,0.005920847,0.000441783,0.0001701006,0.0014403834,0.012030643,0.49001542,0.0022115232,0.10853831,0.06658731,0.3121303],"study_design_scores_gemma":[0.00041952968,0.000018157778,0.0029646298,0.00016941948,0.0000056851877,0.00005882236,0.00034125076,0.97333497,0.00006901964,0.00013213787,0.022263775,0.0002226057],"about_ca_topic_score_codex":0.00004478264,"about_ca_topic_score_gemma":0.0000072493513,"teacher_disagreement_score":0.79664755,"about_ca_system_score_codex":0.00013930205,"about_ca_system_score_gemma":0.000024863317,"threshold_uncertainty_score":0.54583305},"labels":[],"label_agreement":null},{"id":"W4292259733","doi":"10.1007/s10586-022-03659-3","title":"When explainable AI meets IoT applications for supervised learning","year":2022,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"Høgskulen på Vestlandet","keywords":"Computer science; Internet of Things; Field (mathematics); Artificial intelligence; Process (computing); Deep learning; Big data; Machine learning; Interpretation (philosophy); Computation; Data mining; Algorithm; Embedded system","score_opus":0.015019502098149678,"score_gpt":0.259273588772887,"score_spread":0.2442540866747373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292259733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018479316,0.00006341737,0.9914585,0.004072602,0.000087286,0.00087532174,0.0000024156957,0.0007394359,0.0008531246],"genre_scores_gemma":[0.7446465,0.0000010563253,0.2512808,0.0016035271,0.00013755863,0.0012428586,0.000013137517,0.000020637279,0.0010539254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998753,0.00007527363,0.00025514135,0.00044703783,0.0001683741,0.00030118937],"domain_scores_gemma":[0.99913186,0.00015507305,0.00011571645,0.0004375323,0.000093646915,0.00006615207],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00043710668,0.0001173839,0.00013409078,0.000117092684,0.0018944007,0.00019215888,0.00085078686,0.000031656928,0.000030338724],"category_scores_gemma":[0.000012248095,0.00013676354,0.00009762574,0.00038308586,0.000020348607,0.00014711283,0.0009387435,0.00025766462,0.0000126028435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018711973,0.0003173378,0.00047847256,0.00011714661,0.000051369865,0.0000030040078,0.004951387,0.09833608,0.003268702,0.22130218,0.02501378,0.6461418],"study_design_scores_gemma":[0.00019101323,0.00006748778,0.000022101289,0.0000028593718,0.0000037635866,0.000015452833,0.00019559907,0.6007734,0.0005360227,0.004366621,0.39369226,0.00013344573],"about_ca_topic_score_codex":0.000016396347,"about_ca_topic_score_gemma":9.369114e-7,"teacher_disagreement_score":0.74279857,"about_ca_system_score_codex":0.000103231716,"about_ca_system_score_gemma":0.000046344638,"threshold_uncertainty_score":0.999405},"labels":[],"label_agreement":null},{"id":"W4308791329","doi":"10.1007/s10586-022-03797-8","title":"Modeling and simulation of smart grid-aware edge computing federations","year":2022,"lang":"en","type":"article","venue":"Cluster Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Ministerio de Asuntos Económicos y Transformación Digital, Gobierno de España; Google","keywords":"Computer science; Edge computing; Smart grid; Distributed computing; Dimensioning; Enhanced Data Rates for GSM Evolution; Energy consumption; Grid; Computer network; Telecommunications","score_opus":0.030313186692413164,"score_gpt":0.26954846889463774,"score_spread":0.23923528220222456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308791329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30256388,0.00010360593,0.69288105,0.00022529236,0.0036209798,0.0001726584,5.499694e-7,0.00017915443,0.00025284302],"genre_scores_gemma":[0.9773012,6.1541226e-7,0.021221908,0.0003632389,0.0010562149,0.0000020398402,0.0000098407845,0.000021220754,0.000023742605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777156,0.00022743375,0.00063095364,0.00055439584,0.00038144627,0.00043419455],"domain_scores_gemma":[0.99868476,0.00043540128,0.00022820398,0.00039615278,0.00016319241,0.00009229733],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00091257243,0.00021413312,0.0003056196,0.00023045532,0.0018178357,0.0002559091,0.0005956067,0.00004910146,0.0000023608284],"category_scores_gemma":[0.000055437526,0.00024766353,0.000093655726,0.0005281912,0.000035578105,0.000316348,0.0024905936,0.00036051412,0.000003110853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005081897,0.00003598276,0.0009213549,0.000040224928,0.0000145225895,0.000003708905,0.0036152264,0.9739526,0.000052385716,0.00025420208,0.00024339359,0.020861296],"study_design_scores_gemma":[0.00044640238,0.000079212696,0.00025467138,0.000051307285,0.00000909381,0.00003651508,0.00019931741,0.99782217,0.00004204099,0.00034782846,0.0004539793,0.000257444],"about_ca_topic_score_codex":0.000042487616,"about_ca_topic_score_gemma":0.0000020952616,"teacher_disagreement_score":0.6747373,"about_ca_system_score_codex":0.00009285013,"about_ca_system_score_gemma":0.00008361939,"threshold_uncertainty_score":0.99999756},"labels":[],"label_agreement":null},{"id":"W4313463169","doi":"10.1007/s10586-022-03913-8","title":"A near-optimal & load balanced resilient system design for high-performance computing platform","year":2023,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Architecture; Component (thermodynamics); Distributed computing; Cluster (spacecraft); Systems architecture; Operating system","score_opus":0.02975731426517,"score_gpt":0.24914656247507452,"score_spread":0.21938924820990452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313463169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47593135,0.0000336454,0.52030206,0.00026111456,0.0010646748,0.00062194275,0.0000011691519,0.0015081608,0.0002758873],"genre_scores_gemma":[0.7972535,0.0000010246234,0.20140323,0.00027015782,0.00047741932,0.00001867743,0.000008899161,0.00004734534,0.0005197399],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957296,0.00014766285,0.0008623025,0.0011425578,0.000767904,0.0013499295],"domain_scores_gemma":[0.9971093,0.0009408601,0.00040664393,0.0010956498,0.00024733224,0.000200235],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0027803984,0.00046535966,0.00055705337,0.00024649457,0.001470587,0.0007115396,0.0017638411,0.00014324799,0.0000012529183],"category_scores_gemma":[0.00010063276,0.0004421338,0.00017567948,0.0013148246,0.00008612202,0.000093654024,0.002167078,0.00032871935,0.00031130848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004342253,0.00003552173,0.00020355536,0.0003832754,0.000057802496,0.00001567831,0.0025635727,0.9441483,0.000061187944,0.0014324537,0.004813341,0.046241887],"study_design_scores_gemma":[0.0014854704,0.00018239097,0.0018387389,0.00056760566,0.000019704297,0.000043968757,0.00019560977,0.9925692,0.00025180238,0.00005711134,0.002251433,0.0005369799],"about_ca_topic_score_codex":0.000030955995,"about_ca_topic_score_gemma":0.0000019269478,"teacher_disagreement_score":0.32132217,"about_ca_system_score_codex":0.00045186633,"about_ca_system_score_gemma":0.00015159535,"threshold_uncertainty_score":0.99982935},"labels":[],"label_agreement":null},{"id":"W4318699532","doi":"10.1007/s10586-023-03975-2","title":"Pricing the cloud based on multi-attribute auction mechanism","year":2023,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"New York Institute of Technology","funders":"","keywords":"Cloud computing; Computer science; Quality of service; Revenue; Service provider; Scalability; The Internet; Service (business); Computer network; Database; Business; World Wide Web; Marketing; Finance; Operating system","score_opus":0.027586872532665497,"score_gpt":0.25344511757744576,"score_spread":0.22585824504478025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318699532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09472147,0.000010855249,0.89616716,0.0048150797,0.002357325,0.00030606892,3.7669056e-7,0.0012493348,0.00037236244],"genre_scores_gemma":[0.9862753,8.439803e-7,0.009954229,0.0026264284,0.00057794194,0.0000063700695,0.0000028838767,0.000023003242,0.0005329597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997856,0.00023508098,0.00031518895,0.00058155553,0.00045491237,0.0005572565],"domain_scores_gemma":[0.99824184,0.00063124497,0.00015945008,0.00084538077,0.000046240595,0.00007584483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001570715,0.00021835876,0.00017581742,0.00022516503,0.0009000154,0.00031648146,0.0011790402,0.00006307332,0.0000021348585],"category_scores_gemma":[0.0000981059,0.00015912467,0.00013474473,0.0011856843,0.000033153952,0.00002347415,0.0011362606,0.00031202467,0.00025892592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032515165,0.000055027067,0.00015561668,0.000030361894,0.00002142108,0.00002568638,0.0014831539,0.9481413,0.00003850482,0.0033517845,0.0022732674,0.044420667],"study_design_scores_gemma":[0.0005220093,0.00006085519,0.001852433,0.00009456919,0.000007515143,0.000007217639,0.00013156509,0.99299,0.00018872907,0.00027105075,0.003670908,0.00020314091],"about_ca_topic_score_codex":0.000017795268,"about_ca_topic_score_gemma":0.0000017040273,"teacher_disagreement_score":0.8915539,"about_ca_system_score_codex":0.000092462134,"about_ca_system_score_gemma":0.000025609199,"threshold_uncertainty_score":0.69222814},"labels":[],"label_agreement":null},{"id":"W4366496383","doi":"10.1007/s10586-023-03991-2","title":"Task scheduling in the internet of things: challenges, solutions, and future trends","year":2023,"lang":"en","type":"article","venue":"Cluster Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Internet of Things; Scheduling (production processes); Task (project management); The Internet; Data science; World Wide Web; Systems engineering","score_opus":0.03479724700029281,"score_gpt":0.25837364196410856,"score_spread":0.22357639496381576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366496383","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60792446,0.010644676,0.31982204,0.0343717,0.015681224,0.00040779574,3.6274528e-7,0.00094385375,0.010203868],"genre_scores_gemma":[0.9829797,0.000105787985,0.014334808,0.0005603084,0.0019524568,0.0000024119477,0.0000037318118,0.000013312659,0.00004743986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838936,0.00019274458,0.0003620959,0.00038218137,0.00022942563,0.00044416825],"domain_scores_gemma":[0.9990666,0.00033742163,0.00013730617,0.0003771554,0.00004076346,0.000040765666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017601347,0.00015584359,0.00020980422,0.00034132926,0.00017695199,0.00013516558,0.0008863974,0.00008085224,4.4770567e-7],"category_scores_gemma":[0.00003514936,0.00012269989,0.000062297266,0.0009124315,0.000049813025,0.0002847439,0.0010935572,0.00032051562,0.000009963139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046467244,0.00004334193,0.0009355955,0.00011616981,0.000021969034,0.000026895872,0.07466459,0.0007435897,0.00004605596,0.0102019785,0.0031545537,0.9100406],"study_design_scores_gemma":[0.00034021056,0.000041161915,0.011786916,0.00015142836,0.00000447919,0.000043871198,0.001021274,0.9784134,0.000013376996,0.0008891735,0.0071310615,0.00016365926],"about_ca_topic_score_codex":0.000025600977,"about_ca_topic_score_gemma":0.0000028695163,"teacher_disagreement_score":0.9776698,"about_ca_system_score_codex":0.000023464612,"about_ca_system_score_gemma":0.000022239783,"threshold_uncertainty_score":0.50035566},"labels":[],"label_agreement":null},{"id":"W4376138134","doi":"10.1007/s10586-023-04000-2","title":"Secure itemset hiding in smart city sensor data","year":2023,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; USable; Private information retrieval; Information sensitivity; Internet of Things; Binary number; Data mining; Computer security; World Wide Web","score_opus":0.09783609782403217,"score_gpt":0.322279729449814,"score_spread":0.2244436316257818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376138134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37707347,0.00011693954,0.57478416,0.03949189,0.0019301372,0.0004383091,0.00007325506,0.0050642593,0.0010275638],"genre_scores_gemma":[0.7334589,0.000012192828,0.2656545,0.0005130478,0.00014674054,0.0000034287903,0.0001395883,0.000024072287,0.000047532758],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722725,0.00015606867,0.00043817388,0.001095247,0.00035707746,0.00072620035],"domain_scores_gemma":[0.987067,0.0006886303,0.00014423371,0.011987536,0.000043086216,0.00006951325],"candidate_categories":["metaresearch","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0018591017,0.00021642863,0.00026994036,0.00040745214,0.0002029829,0.0003189237,0.03646694,0.00015376166,0.0000047748435],"category_scores_gemma":[0.01124444,0.00022626635,0.00003652948,0.002006033,0.00006790013,0.00091482076,0.27606404,0.0005435809,0.0001748131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007698464,0.00007006302,0.07207179,0.00015375581,0.0000412984,0.0004570274,0.0009047295,0.0010630703,0.00047932778,0.00089146243,0.84289896,0.080960795],"study_design_scores_gemma":[0.00029934407,0.000012002945,0.006401077,0.00013537038,0.0000022615618,0.00003211428,0.00007108995,0.97667134,0.00016994672,0.011261458,0.0046842503,0.00025972904],"about_ca_topic_score_codex":0.000069917325,"about_ca_topic_score_gemma":0.000039026658,"teacher_disagreement_score":0.9756083,"about_ca_system_score_codex":0.00009695943,"about_ca_system_score_gemma":0.000052942618,"threshold_uncertainty_score":0.99708426},"labels":[],"label_agreement":null},{"id":"W4379191672","doi":"10.1007/s10586-023-04035-5","title":"A deep learning approach for detecting covert timing channel attacks using sequential data","year":2023,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Convolutional neural network; Deep learning; Covert; Artificial intelligence; Byte; Machine learning; Identification (biology); Channel (broadcasting); Artificial neural network; Computer network","score_opus":0.09715234867049774,"score_gpt":0.31639493210071495,"score_spread":0.2192425834302172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379191672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0475905,0.000066183944,0.95051694,0.000055267992,0.0006522473,0.00028042606,0.0000016913061,0.0006475886,0.00018915595],"genre_scores_gemma":[0.8449081,0.0000011943628,0.15399285,0.00015990694,0.00071847904,0.000004125374,0.00008969418,0.00004239118,0.00008325537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680275,0.00018674902,0.00060257484,0.0011386519,0.00037784065,0.00089141703],"domain_scores_gemma":[0.9983934,0.00042458426,0.00034488793,0.000577606,0.00014846874,0.000111011315],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022111535,0.00029895903,0.0004116806,0.0003020535,0.0009832776,0.0006538033,0.0019335222,0.00012839428,0.0000023768187],"category_scores_gemma":[0.00030355272,0.00030868436,0.0001946562,0.0008929894,0.0000376556,0.0006046673,0.0029790874,0.00043686767,0.000019248446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006108643,0.000017322931,0.00007453312,0.000083259176,0.00008614826,0.000010202384,0.003315763,0.97376966,0.00011609297,0.0006068229,0.00012505235,0.02178903],"study_design_scores_gemma":[0.00044246187,0.000035035173,0.000012239716,0.00009373986,0.00004520954,0.000053072876,0.0006464814,0.9980005,0.00006697355,0.000009600609,0.00023304817,0.00036160529],"about_ca_topic_score_codex":0.000019320836,"about_ca_topic_score_gemma":0.000009310084,"teacher_disagreement_score":0.7973176,"about_ca_system_score_codex":0.00009659325,"about_ca_system_score_gemma":0.00005330437,"threshold_uncertainty_score":0.9999365},"labels":[],"label_agreement":null},{"id":"W4381734648","doi":"10.1007/s10586-023-04088-6","title":"A BERT-based recommender system for secure blockchain-based cyber physical drug supply chain management","year":2023,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University; University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer security; Supply chain; Autoencoder; Blockchain; Artificial intelligence; Deep learning; Business","score_opus":0.012037259370700982,"score_gpt":0.2480337018784461,"score_spread":0.2359964425077451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381734648","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14777225,0.000031182997,0.83299595,0.014363463,0.00045530772,0.0013945457,0.000016532911,0.0025484993,0.00042229076],"genre_scores_gemma":[0.9459574,2.6886937e-7,0.051949542,0.0013704544,0.0001818135,0.00032902442,0.000029257137,0.00003797072,0.00014424516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975655,0.00012314365,0.00040250702,0.00089546957,0.00028571053,0.000727679],"domain_scores_gemma":[0.997909,0.00056772406,0.00018704715,0.0011004512,0.000118653064,0.00011713232],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088652514,0.000315942,0.0003623188,0.00037882986,0.00059725513,0.00012878953,0.001330202,0.00013939047,0.0000017739286],"category_scores_gemma":[0.000015360805,0.00031420708,0.00022113857,0.0012204684,0.00007482682,0.000029829249,0.00061379996,0.00029202673,0.000069339454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095401454,0.001306061,0.0013930253,0.002772707,0.00042086156,0.00014259586,0.00721692,0.18267275,0.00026854407,0.50754815,0.08055161,0.21561138],"study_design_scores_gemma":[0.0014036329,0.00004265215,0.00017837856,0.00013974289,0.000022961325,0.000005234252,0.0002798705,0.989432,0.0008920261,0.0019827264,0.0052739787,0.0003468086],"about_ca_topic_score_codex":0.000011162736,"about_ca_topic_score_gemma":0.000008940454,"teacher_disagreement_score":0.80675924,"about_ca_system_score_codex":0.00014729003,"about_ca_system_score_gemma":0.000050169143,"threshold_uncertainty_score":0.999931},"labels":[],"label_agreement":null},{"id":"W4384824314","doi":"10.1007/s10586-023-04107-6","title":"Correction: A BERT-based recommender system for secure blockchain-based cyber physical drug supply chain management","year":2023,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University; University of Guelph","funders":"","keywords":"Computer science; Blockchain; Recommender system; Supply chain; Cyber-physical system; Supply chain management; World Wide Web; Computer security; Operating system","score_opus":0.01113111552402549,"score_gpt":0.24493478397687024,"score_spread":0.23380366845284475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384824314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0695431,0.000028150327,0.9124106,0.011472058,0.0016682826,0.0013230733,0.000010707016,0.002853848,0.0006901557],"genre_scores_gemma":[0.96931475,3.0293901e-7,0.02845384,0.0011709665,0.0002660292,0.00034571043,0.000028877137,0.000036347625,0.000383169],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769545,0.00012466208,0.00039167932,0.00086939416,0.00027384583,0.0006449723],"domain_scores_gemma":[0.99791825,0.00066410744,0.00019270882,0.0009794153,0.00013626368,0.00010927535],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007969952,0.00030385866,0.00034275986,0.00037038355,0.0006960168,0.000131629,0.0010663082,0.00014086106,0.0000023153566],"category_scores_gemma":[0.000019110146,0.00030815712,0.00021320513,0.001347487,0.00007154521,0.000031983436,0.00048526746,0.00032401056,0.00006689428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010750342,0.001204807,0.001314536,0.0017579311,0.00037408096,0.00010917338,0.0066167456,0.2667128,0.00013885948,0.17231476,0.27091345,0.27843532],"study_design_scores_gemma":[0.0012195243,0.00005000452,0.00021255392,0.00016043415,0.00002345783,0.000010008425,0.00035001172,0.9883834,0.0008546297,0.0008928693,0.007510342,0.0003327446],"about_ca_topic_score_codex":0.0000137904035,"about_ca_topic_score_gemma":0.00001298089,"teacher_disagreement_score":0.89977163,"about_ca_system_score_codex":0.00017633651,"about_ca_system_score_gemma":0.000054042815,"threshold_uncertainty_score":0.99993706},"labels":[],"label_agreement":null},{"id":"W4386988816","doi":"10.1007/s10586-023-04135-2","title":"Cost-optimized cloud resource management for video streaming: ARIMA predictive approach","year":2023,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Autoregressive integrated moving average; Computer science; Cloud computing; Resource allocation; Resource (disambiguation); Real-time computing; Autoregressive model; Resource management (computing); Time series; Distributed computing; Machine learning; Computer network; Statistics; Operating system","score_opus":0.056776951360685286,"score_gpt":0.32123585804828514,"score_spread":0.26445890668759986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386988816","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001497649,0.00003154943,0.98485166,0.0009119793,0.00056014705,0.001481431,0.0000070637234,0.00084322796,0.009815282],"genre_scores_gemma":[0.19301425,0.0000053187796,0.8001879,0.0033955825,0.0008177888,0.00027499784,0.00011374646,0.00006447023,0.0021259792],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728906,0.00021331951,0.0004954097,0.00085100526,0.00042684027,0.00072434096],"domain_scores_gemma":[0.9981746,0.00058077014,0.00021179789,0.0007999655,0.00010288539,0.00012999988],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001498002,0.0002641381,0.00033276645,0.00023382233,0.0004527942,0.0004224938,0.001125809,0.00006890586,0.0000017065319],"category_scores_gemma":[0.000053877022,0.00026199184,0.00017595706,0.00070644834,0.000052998246,0.00030634901,0.0015783838,0.0001973105,0.000043169017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034644027,0.00074904633,0.00030677274,0.0013988997,0.0007885969,0.00014834256,0.023317127,0.3544729,0.00007077315,0.05938606,0.17952722,0.37948784],"study_design_scores_gemma":[0.0019633123,0.00009555443,0.00040452488,0.00008404818,0.000031524916,0.000010065658,0.0016358079,0.9757252,0.00012363907,0.0010712784,0.018552529,0.00030254835],"about_ca_topic_score_codex":0.0000074556046,"about_ca_topic_score_gemma":3.6253704e-7,"teacher_disagreement_score":0.6212523,"about_ca_system_score_codex":0.00013687683,"about_ca_system_score_gemma":0.00004234471,"threshold_uncertainty_score":0.99998325},"labels":[],"label_agreement":null},{"id":"W4390112344","doi":"10.1007/s10586-023-04205-5","title":"An ensemble clustering approach for modeling hidden categorization perspectives for cloud workloads","year":2023,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Cluster analysis; Cloud computing; Data mining; Categorization; Workload; Conceptual clustering; Data stream clustering; Fuzzy clustering; Bottleneck; Machine learning; Artificial intelligence; CURE data clustering algorithm","score_opus":0.03532039395177234,"score_gpt":0.2766147355894165,"score_spread":0.24129434163764418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390112344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08746349,0.00008235098,0.90868783,0.00043904525,0.0007715728,0.00095158536,0.0000013932463,0.0011623943,0.00044036654],"genre_scores_gemma":[0.7250151,0.0000014114331,0.2734384,0.00013364447,0.0010760658,0.000049551305,0.000024725889,0.000040807598,0.00022031135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975246,0.00009487176,0.0004231111,0.00097007456,0.000260189,0.00072714296],"domain_scores_gemma":[0.99860996,0.00024883274,0.00015308768,0.00066219456,0.0002029713,0.00012298321],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012096625,0.00027258095,0.00029467314,0.00029115615,0.00082577305,0.0005297765,0.001088209,0.00010257267,3.3455743e-7],"category_scores_gemma":[0.0000645353,0.00027592925,0.00017610859,0.00072045124,0.000025529132,0.00009967565,0.0007564797,0.00014018794,0.0000060991515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016835944,0.000056795052,0.00003091086,0.00012656563,0.00003219532,0.0000010177636,0.009396889,0.9207352,0.000114850525,0.0039220285,0.00039424762,0.06517246],"study_design_scores_gemma":[0.0007930138,0.00012364966,0.000026708054,0.00005385943,0.000017464563,0.0000061245046,0.0030411286,0.9937474,0.000044572487,0.001624567,0.0001645083,0.00035698505],"about_ca_topic_score_codex":0.000015482487,"about_ca_topic_score_gemma":0.0000022830973,"teacher_disagreement_score":0.6375516,"about_ca_system_score_codex":0.000115443756,"about_ca_system_score_gemma":0.000037428807,"threshold_uncertainty_score":0.9999693},"labels":[],"label_agreement":null},{"id":"W4390727139","doi":"10.1007/s10586-023-04225-1","title":"Convergence of the Harris hawks optimization algorithm and fuzzy system for cloud-based task scheduling enhancement","year":2024,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Fuzzy logic; CloudSim; Algorithm; Job shop scheduling; Mathematical optimization; Local optimum; Energy consumption; Scheduling (production processes); Cloud computing; Artificial intelligence; Schedule; Mathematics","score_opus":0.010101862025957404,"score_gpt":0.22877278919860108,"score_spread":0.2186709271726437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390727139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025539244,0.0006355427,0.9695329,0.00076536025,0.002641065,0.0004981917,0.0000024841447,0.00022193673,0.0001632666],"genre_scores_gemma":[0.7410638,0.0000011522997,0.25846833,0.0001550213,0.00021235162,0.000008820499,0.000001392283,0.0000131424995,0.00007601699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843556,0.00009575997,0.0004100645,0.00050488324,0.0002683609,0.00028537906],"domain_scores_gemma":[0.9989828,0.00026961768,0.00016256499,0.00042907565,0.000101291604,0.000054673947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074353773,0.00017354847,0.00019987744,0.00009575586,0.00032371463,0.000258933,0.00061885273,0.000053319865,8.5692403e-7],"category_scores_gemma":[0.000025039488,0.00013226371,0.00011733748,0.0004030306,0.00005951528,0.000031136995,0.0006972598,0.00012416058,0.0000023546954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028259722,0.000018113937,0.00003770923,0.00066142937,0.000039244766,0.0000021185201,0.00081294624,0.9465201,0.000082257895,0.0020845134,0.00015944373,0.04957933],"study_design_scores_gemma":[0.0003255809,0.000049561546,0.00002847345,0.00092435896,0.000027127162,0.0000073489696,0.00012196249,0.996361,0.0013734613,0.000057473255,0.0005697109,0.00015389734],"about_ca_topic_score_codex":0.000013238284,"about_ca_topic_score_gemma":3.3400673e-7,"teacher_disagreement_score":0.71552455,"about_ca_system_score_codex":0.00008362073,"about_ca_system_score_gemma":0.000059886956,"threshold_uncertainty_score":0.53935575},"labels":[],"label_agreement":null},{"id":"W4391538996","doi":"10.1007/s10586-023-04230-4","title":"Ovcosim: an open-source versatile computation offloading simulator for cloud and fog computing","year":2024,"lang":"en","type":"article","venue":"Cluster Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cloud computing; Open source; Computation; Fog computing; Computation offloading; Distributed computing; Operating system; Edge computing; Algorithm; Software","score_opus":0.030811059258252466,"score_gpt":0.31200434804295424,"score_spread":0.2811932887847018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391538996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21409005,0.0003744823,0.7731868,0.00041280885,0.00986804,0.00072498503,9.635222e-7,0.00094944786,0.00039242176],"genre_scores_gemma":[0.87094676,0.0000014386114,0.123787425,0.000780631,0.004288426,0.000004842513,0.000022999482,0.000079139325,0.00008833668],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965099,0.00020792542,0.00073382026,0.0013362961,0.00033086602,0.0008812019],"domain_scores_gemma":[0.9972,0.0016170654,0.00021328618,0.000506377,0.00018229583,0.00028097248],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017037411,0.0004411471,0.0005052123,0.00030627416,0.0011202508,0.0036399807,0.001447978,0.00015879942,0.0000012651955],"category_scores_gemma":[0.000105692656,0.0004628855,0.00011697613,0.00069008436,0.00007953449,0.0013986996,0.002655818,0.00038477796,0.000025148838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005125161,0.00015331083,0.001010644,0.0008138924,0.00017385268,0.00004313868,0.022780295,0.11813251,0.00087039213,0.0064697484,0.0146359755,0.834865],"study_design_scores_gemma":[0.00096786144,0.00024628296,0.00032557416,0.0004961408,0.000029107754,0.00007519032,0.00013671289,0.98115456,0.00019850273,0.0016989956,0.014097618,0.0005734316],"about_ca_topic_score_codex":0.00004456642,"about_ca_topic_score_gemma":0.0000025867562,"teacher_disagreement_score":0.8630221,"about_ca_system_score_codex":0.00012887361,"about_ca_system_score_gemma":0.0001369301,"threshold_uncertainty_score":0.99978226},"labels":[],"label_agreement":null},{"id":"W4392230051","doi":"10.1007/s10586-024-04318-5","title":"Improving resource utilization and fault tolerance in large simulations via actors","year":2024,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Fault tolerance; Distributed computing; Computation; Resource (disambiguation); Scale (ratio); Supercomputer; Load balancing (electrical power); Intervention (counseling); Parallel computing; Algorithm","score_opus":0.019779325445825984,"score_gpt":0.2717865230535286,"score_spread":0.25200719760770257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392230051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23334058,0.0007255478,0.76451755,0.00017993303,0.000485715,0.0001511367,0.0000038802787,0.00032102063,0.00027463044],"genre_scores_gemma":[0.995529,0.0000012997124,0.0039958307,0.00018441779,0.00018514702,0.000001386028,0.000017839813,0.00001442556,0.00007065305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843085,0.00012690648,0.00036945962,0.00052332523,0.0001795874,0.00036987662],"domain_scores_gemma":[0.99920994,0.00031874207,0.0000748479,0.0002868942,0.00004029204,0.00006930813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004962916,0.0001635203,0.00017805962,0.00018677537,0.00019343923,0.0005189345,0.00035752796,0.00007980545,0.0000016850693],"category_scores_gemma":[0.000047145637,0.00016373326,0.000040959792,0.00071831234,0.000024108715,0.00036165633,0.000419724,0.00022152878,0.000010976868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008675922,0.00009704591,0.008907169,0.00062951236,0.00003170415,0.000078771984,0.017627664,0.68625516,0.0007079291,0.010218358,0.0008204132,0.2746176],"study_design_scores_gemma":[0.00025320885,0.000016521264,0.0017673146,0.0002754814,0.0000028753886,0.000024122799,0.00005222441,0.9888655,0.000039272505,0.00019791834,0.008326029,0.00017954785],"about_ca_topic_score_codex":0.000030456084,"about_ca_topic_score_gemma":0.000018460893,"teacher_disagreement_score":0.76218843,"about_ca_system_score_codex":0.000058868565,"about_ca_system_score_gemma":0.000036988236,"threshold_uncertainty_score":0.66768485},"labels":[],"label_agreement":null},{"id":"W4392348357","doi":"10.1007/s10586-024-04317-6","title":"Improving the quality of real-time data transmission service in VANETS by balancing the load on road side units","year":2024,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Computer network; Quality of service; Vehicular ad hoc network; Scalability; Network congestion; Network packet; Packet loss; Load balancing (electrical power); Wireless ad hoc network; Wireless; Telecommunications","score_opus":0.021932957093232005,"score_gpt":0.25944999305400707,"score_spread":0.23751703596077506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392348357","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9702392,0.0022405698,0.023247676,0.00082473666,0.00041699648,0.0005144358,0.000032485328,0.00042804176,0.0020558517],"genre_scores_gemma":[0.99886394,0.000030852658,0.00049839,0.00024135775,0.00018949345,0.0000023756104,0.000075458665,0.000058839654,0.000039277224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979907,0.0002796283,0.00056333025,0.0003820118,0.00036459582,0.00041973064],"domain_scores_gemma":[0.9980563,0.00089198165,0.00007197182,0.00086939894,0.000052637428,0.000057724235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021927673,0.0002335242,0.00027158883,0.000047956204,0.00011326427,0.00010829575,0.0008272254,0.000104156345,0.000008947078],"category_scores_gemma":[0.00005760675,0.00015665809,0.000042197316,0.00064903946,0.000027570683,0.00015325731,0.00033250925,0.00059220876,0.000024538418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015482401,0.000009649769,0.00003238436,0.00039962016,0.000029730953,0.00000916717,0.0019245122,0.90601945,0.019002361,0.000013000627,0.001920252,0.07062439],"study_design_scores_gemma":[0.00024830282,0.000014923693,0.0006135381,0.0007660441,0.000020732194,0.000010776525,0.00017060028,0.9954665,0.00059164566,0.000013619284,0.0019044954,0.00017887527],"about_ca_topic_score_codex":0.0010572628,"about_ca_topic_score_gemma":0.0002506451,"teacher_disagreement_score":0.08944699,"about_ca_system_score_codex":0.00015747164,"about_ca_system_score_gemma":0.00006900649,"threshold_uncertainty_score":0.6388331},"labels":[],"label_agreement":null},{"id":"W4396214135","doi":"10.1007/s10586-024-04504-5","title":"Forest fire monitoring system supported by unmanned aerial vehicles and edge computing: a performance evaluation using petri nets","year":2024,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Fire Detection and Safety Systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Petri net; Firefighting; Drone; Fire detection; Key (lock); Enhanced Data Rates for GSM Evolution; Edge computing; Variety (cybernetics); Systems engineering; Real-time computing; Distributed computing; Computer security; Artificial intelligence; Architectural engineering","score_opus":0.02002648129740907,"score_gpt":0.2476591701216259,"score_spread":0.22763268882421683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396214135","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97917724,0.0019596305,0.011612082,0.000022133383,0.005588906,0.00040448902,0.00000472897,0.0009959869,0.00023479687],"genre_scores_gemma":[0.9984357,0.000008966543,0.00036074442,0.0000074785803,0.0010778852,0.0000043473465,0.000017565339,0.00006473037,0.000022627539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840903,0.00009046242,0.0004880918,0.0003346089,0.0003047274,0.00037305534],"domain_scores_gemma":[0.9994792,0.000115053284,0.00006226133,0.00016929003,0.00007633912,0.00009786128],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069927884,0.0002493722,0.00026765978,0.00013613989,0.00029480064,0.00029768105,0.00011124482,0.00013181048,0.0000026413677],"category_scores_gemma":[0.000018160932,0.00026412462,0.000061205894,0.00032497573,0.00002635377,0.00021352168,0.00008839251,0.00024256011,0.000016513506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044299693,0.000020397143,0.014283506,0.003910817,0.00023196946,0.000029913268,0.005183148,0.7423556,0.017582674,0.000019442065,0.0018399388,0.21449831],"study_design_scores_gemma":[0.00045738067,0.000032894288,0.0035068402,0.0012832743,0.000042327993,0.00014664538,0.00039853272,0.99170023,0.0014003178,8.868966e-7,0.0007657146,0.00026498057],"about_ca_topic_score_codex":0.00003646795,"about_ca_topic_score_gemma":0.0000022497848,"teacher_disagreement_score":0.24934462,"about_ca_system_score_codex":0.00032230353,"about_ca_system_score_gemma":0.000032018026,"threshold_uncertainty_score":0.9999811},"labels":[],"label_agreement":null},{"id":"W4399047587","doi":"10.1007/s10586-024-04539-8","title":"Improvement in task allocation for VM and reduction of Makespan in IaaS model for cloud computing","year":2024,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"New York Institute of Technology","funders":"","keywords":"Computer science; Cloud computing; Reduction (mathematics); Task (project management); Job shop scheduling; Distributed computing; Operating system; Schedule","score_opus":0.01944828629269905,"score_gpt":0.26467066563322206,"score_spread":0.24522237934052302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399047587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39338994,0.00018401416,0.60441405,0.000769865,0.0004867857,0.00063493196,0.0000010125541,0.00007727815,0.000042110918],"genre_scores_gemma":[0.9335928,0.0000019310046,0.065940425,0.0001048333,0.00022523559,0.000017549391,0.0000042298957,0.000018306808,0.00009468095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821067,0.000044893342,0.0005985084,0.00061980414,0.00015628985,0.00036984758],"domain_scores_gemma":[0.9992348,0.0002567807,0.00013641946,0.0002672316,0.00006292784,0.000041859385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013286253,0.00017392392,0.00025235565,0.0003454072,0.00010333067,0.00015729631,0.00033575483,0.00006770293,1.0074104e-7],"category_scores_gemma":[0.000034593137,0.00017708896,0.000079270634,0.0003968852,0.0000329299,0.0000491239,0.00047742462,0.0001388356,4.4527607e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018198776,0.00006483791,0.00010101287,0.00070493267,0.00001921124,0.0000012994306,0.007304853,0.69502616,0.001126248,0.008883929,0.00020653754,0.2865428],"study_design_scores_gemma":[0.00080923195,0.000119860066,0.00021687696,0.0005207287,0.000009456906,0.000006269306,0.00027311014,0.99420166,0.00029032427,0.0032054046,0.00016435114,0.00018270023],"about_ca_topic_score_codex":0.00004061834,"about_ca_topic_score_gemma":0.00001660231,"teacher_disagreement_score":0.54020286,"about_ca_system_score_codex":0.00013418338,"about_ca_system_score_gemma":0.000046206467,"threshold_uncertainty_score":0.7221478},"labels":[],"label_agreement":null},{"id":"W4399211318","doi":"10.1007/s10586-024-04575-4","title":"Correction: Improving the quality of real-time data transmission service in VANETS by balancing the load on road side units","year":2024,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Service quality; Quality of service; Transmission (telecommunications); Quality (philosophy); Service (business); Computer network; Telecommunications","score_opus":0.020301277570784423,"score_gpt":0.2571193320094003,"score_spread":0.23681805443861587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399211318","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9496015,0.0024975776,0.03872372,0.0009846131,0.0020847823,0.00067641767,0.00002741249,0.00067672954,0.0047272705],"genre_scores_gemma":[0.9990135,0.000030445543,0.00025463506,0.00020517875,0.0002699024,0.0000026855955,0.00006845728,0.00005274499,0.00010249276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981166,0.00027306547,0.0005336235,0.00037005698,0.00034065152,0.00036596708],"domain_scores_gemma":[0.9980599,0.0009950076,0.00007169408,0.0007595546,0.000060758462,0.000053035885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019070517,0.0002207012,0.00025257483,0.00004814575,0.00013682766,0.0001084774,0.00064856483,0.000103593826,0.000011364576],"category_scores_gemma":[0.00006392936,0.00015209007,0.00004113356,0.00072622503,0.00002634376,0.00015556587,0.00025593044,0.00063443294,0.000023740491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016961427,0.000009113456,0.00003553261,0.0002463715,0.000025641824,0.000006684093,0.0017253294,0.89966536,0.007980565,0.000005026989,0.0062227366,0.084060654],"study_design_scores_gemma":[0.00021816808,0.000018159804,0.0008279169,0.0008171613,0.000020774549,0.00002102929,0.00023031159,0.9942537,0.0005414968,0.000007321975,0.002873786,0.00017018944],"about_ca_topic_score_codex":0.0010429191,"about_ca_topic_score_gemma":0.00033083998,"teacher_disagreement_score":0.0945883,"about_ca_system_score_codex":0.0001878851,"about_ca_system_score_gemma":0.00007204794,"threshold_uncertainty_score":0.6202053},"labels":[],"label_agreement":null},{"id":"W4403536375","doi":"10.1007/s10586-024-04693-z","title":"A distributed algorithm with dynamic event-triggered mechanism for resource allocation problems","year":2024,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Computer science; Distributed computing; Mechanism (biology); Resource allocation; Algorithm; Event (particle physics); Resource (disambiguation); Computer network","score_opus":0.010314172859187436,"score_gpt":0.24470259354462703,"score_spread":0.2343884206854396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403536375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012054244,0.00029448647,0.9926643,0.002244234,0.0007860922,0.0015696667,0.000090207635,0.0010792778,0.00006633889],"genre_scores_gemma":[0.91175425,0.000001402201,0.086944446,0.000258391,0.00020512052,0.00014557743,0.0003248167,0.00005350134,0.00031247802],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972793,0.00014138703,0.00057311886,0.0009319901,0.00042761696,0.00064662285],"domain_scores_gemma":[0.9983916,0.0003394759,0.00019890453,0.00066420174,0.00025879545,0.00014701813],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075154094,0.0003332613,0.00034160784,0.00018069259,0.00028350996,0.0009042557,0.0009387831,0.00012194016,0.0000013224957],"category_scores_gemma":[0.000052663774,0.00028793997,0.00014887517,0.0007595229,0.000032706044,0.00042674897,0.0002957148,0.00021941146,0.000036867514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008751766,0.00045095925,0.00004960059,0.001972897,0.0010889729,0.00017563906,0.005683203,0.08597038,0.0047217365,0.1308351,0.007689914,0.7612741],"study_design_scores_gemma":[0.0011794525,0.00015646823,0.000032084674,0.00057666947,0.000040754112,0.000070786315,0.00007944812,0.9902081,0.00020579345,0.0023756614,0.004706357,0.0003684512],"about_ca_topic_score_codex":0.000020253077,"about_ca_topic_score_gemma":0.00001266176,"teacher_disagreement_score":0.91054887,"about_ca_system_score_codex":0.0003029663,"about_ca_system_score_gemma":0.0001391278,"threshold_uncertainty_score":0.99995726},"labels":[],"label_agreement":null},{"id":"W4403767616","doi":"10.1007/s10586-024-04687-x","title":"An auto-scaling multi-tiered node-organizing blockchain design model for the internet of things","year":2024,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Blockchain; Computer science; Node (physics); Internet of Things; The Internet; Scaling; Computer network; World Wide Web; Distributed computing; Theoretical computer science; Computer security","score_opus":0.03532494149082179,"score_gpt":0.27876315994559775,"score_spread":0.24343821845477595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403767616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01813114,0.0005471033,0.97851735,0.0013211715,0.00025293796,0.0005067922,0.0000016588963,0.0007090734,0.000012772683],"genre_scores_gemma":[0.5841502,0.0000013138128,0.41549507,0.00025264683,0.000034806224,0.000016214462,9.109647e-7,0.000015812482,0.000033014076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852777,0.0000689661,0.00040333936,0.0005375817,0.00013885774,0.0003234794],"domain_scores_gemma":[0.99835616,0.0006410351,0.00011787815,0.00072022434,0.000115636954,0.00004905442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013182028,0.00017789003,0.00020485674,0.00014016255,0.00027978246,0.00021393356,0.0015971354,0.0001485723,0.0000011209937],"category_scores_gemma":[0.000054227374,0.00013994313,0.0000964569,0.00042172772,0.00009860978,0.00014694581,0.0005502855,0.00032049557,0.0000038503945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015522677,0.00022221901,0.00006657123,0.00026659822,0.00017220691,0.0000054113066,0.06710651,0.4619885,0.0076627135,0.13007239,0.0007884849,0.33163288],"study_design_scores_gemma":[0.00021165144,0.00003050288,0.000015725102,0.00009138983,0.000019106326,0.000015844385,0.00016612817,0.9910207,0.002862861,0.0053211376,0.000085945634,0.00015904539],"about_ca_topic_score_codex":0.000022817852,"about_ca_topic_score_gemma":0.0000018118885,"teacher_disagreement_score":0.56601906,"about_ca_system_score_codex":0.00004460277,"about_ca_system_score_gemma":0.00007121871,"threshold_uncertainty_score":0.57067156},"labels":[],"label_agreement":null},{"id":"W4404024662","doi":"10.1007/s10586-024-04802-y","title":"Optimizing support vector regression using grey wolf optimizer for enhancing energy efficiency and building prototype architecture","year":2024,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Building Energy and Comfort Optimization","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Architecture; Regression; Efficient energy use; Support vector machine; Energy (signal processing); Artificial intelligence; Data mining; Statistics; Electrical engineering","score_opus":0.010450131055919467,"score_gpt":0.2430712678616497,"score_spread":0.23262113680573024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404024662","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06596217,0.001230553,0.93060565,0.000039405833,0.0010090587,0.00029920207,0.0000024974595,0.0006808095,0.0001706269],"genre_scores_gemma":[0.77737105,0.000016777785,0.22199553,0.000059571248,0.00038218612,0.0000240359,0.000013111566,0.00009150155,0.000046215697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986224,0.000028822627,0.00034778297,0.00041691738,0.00014081439,0.00044321612],"domain_scores_gemma":[0.9994682,0.00017203389,0.000048547063,0.00017669832,0.000045734494,0.00008877429],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028561056,0.00028555805,0.00025541638,0.00023214215,0.00028291496,0.00024960854,0.00014173579,0.00015394339,0.0000089659225],"category_scores_gemma":[0.00002749513,0.0002623181,0.000090583584,0.000294795,0.000031653577,0.00019676647,0.00012405886,0.00023036635,3.6004027e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019629791,0.000006239654,0.0000074185027,0.00035901176,0.00003431021,0.000006623002,0.0006566105,0.9737074,0.009549532,0.0005116052,0.00006070761,0.015080918],"study_design_scores_gemma":[0.00026639135,0.000055941906,0.0000020073307,0.0009034251,0.00003581721,0.00006837778,0.000030637148,0.985449,0.011595202,0.00014191354,0.001131834,0.0003194511],"about_ca_topic_score_codex":0.0000074686423,"about_ca_topic_score_gemma":0.0000044555886,"teacher_disagreement_score":0.7114089,"about_ca_system_score_codex":0.00009669291,"about_ca_system_score_gemma":0.00003877536,"threshold_uncertainty_score":0.9999829},"labels":[],"label_agreement":null},{"id":"W4405350980","doi":"10.1007/s10586-024-04878-6","title":"Metaheuristic-based task scheduling for latency-sensitive IoT applications in edge computing","year":2024,"lang":"en","type":"article","venue":"Cluster Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Cloud computing; Distributed computing; Scheduling (production processes); Job shop scheduling; Edge computing; Particle swarm optimization; Energy consumption; Metaheuristic; Latency (audio); Internet of Things; Real-time computing; Mathematical optimization; Computer network; Embedded system; Algorithm; Operating system","score_opus":0.020997561866417703,"score_gpt":0.2827724796412178,"score_spread":0.2617749177748001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405350980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04584899,0.0006824829,0.9448578,0.000788037,0.0055219526,0.0008984855,0.0000015661417,0.00085264567,0.000548083],"genre_scores_gemma":[0.72597283,9.0611974e-7,0.2712009,0.00048127744,0.0022282782,0.000017324308,0.000020089872,0.000046556455,0.0000318249],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99663556,0.00016124516,0.00081323925,0.00116077,0.00029391775,0.0009352782],"domain_scores_gemma":[0.9965213,0.0023486216,0.00017492044,0.00058171415,0.00021850294,0.00015494878],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014784816,0.00040761408,0.00048821914,0.00055681303,0.0005825639,0.00089870667,0.00094194885,0.00015215101,6.1400095e-7],"category_scores_gemma":[0.00015545265,0.00041328167,0.000257698,0.0014084375,0.00007676151,0.00027333188,0.0006859982,0.0005333644,0.00005425173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004341627,0.00045335415,0.0026728292,0.0021814043,0.0002805583,0.00021633957,0.0156122325,0.31109312,0.0028327764,0.033958223,0.0035627307,0.627093],"study_design_scores_gemma":[0.00052049663,0.000046681864,0.0006065156,0.0005348425,0.000027370072,0.000021327318,0.000079995596,0.98981893,0.00071874727,0.0014517134,0.0056970795,0.0004763218],"about_ca_topic_score_codex":0.000025835145,"about_ca_topic_score_gemma":0.000003271627,"teacher_disagreement_score":0.68012387,"about_ca_system_score_codex":0.00020554157,"about_ca_system_score_gemma":0.000257903,"threshold_uncertainty_score":0.9998319},"labels":[],"label_agreement":null},{"id":"W4405662613","doi":"10.1007/s10586-024-04831-7","title":"Time delay-based routing protocol using genetic algorithm in vehicular Ad Hoc networks","year":2024,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Computer network; Routing protocol; Node (physics); Scalability; Distributed computing; Wireless ad hoc network; Routing (electronic design automation)","score_opus":0.008539897106455684,"score_gpt":0.23615969378482013,"score_spread":0.22761979667836443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405662613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09197352,0.0020224901,0.8888642,0.000025833891,0.00061069865,0.0151474355,0.0000023886892,0.0011986198,0.00015481148],"genre_scores_gemma":[0.7612411,0.0000068850613,0.23239656,0.00033946068,0.001937867,0.003456218,0.000043728112,0.00052500673,0.000053204614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730706,0.000147866,0.0006942695,0.0005640711,0.00028947828,0.0009972582],"domain_scores_gemma":[0.99917215,0.0001868534,0.000059462967,0.00038855933,0.00004226296,0.00015069006],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062619447,0.0004385307,0.0004077766,0.00025536842,0.00012948975,0.00029017893,0.00030450837,0.00026124183,0.00003119142],"category_scores_gemma":[0.000014283098,0.0004782657,0.0001689971,0.00079070154,0.000051114166,0.0001460412,0.00018696694,0.00081003184,0.000083883504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047657986,0.000013264178,0.00007112446,0.00018043444,0.00004123817,0.0003857618,0.00015892938,0.89786583,0.000110243105,0.0000012026126,0.00017007822,0.10099715],"study_design_scores_gemma":[0.00070574926,0.000031169497,0.00015143605,0.0013579992,0.000032330812,0.00012502345,0.000014027129,0.99407166,0.000056115176,0.00001350834,0.0029253843,0.0005155821],"about_ca_topic_score_codex":0.000005751572,"about_ca_topic_score_gemma":0.000004945752,"teacher_disagreement_score":0.66926754,"about_ca_system_score_codex":0.00042972545,"about_ca_system_score_gemma":0.000076213444,"threshold_uncertainty_score":0.9997669},"labels":[],"label_agreement":null},{"id":"W4406629874","doi":"10.1007/s10586-024-04871-z","title":"Multilevel learning for enhanced traffic congestion prediction using anomaly detection and ensemble learning","year":2025,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Traffic Prediction and Management Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Ensemble learning; Anomaly detection; Machine learning; Artificial intelligence; Anomaly (physics); Learning network","score_opus":0.010644909819243454,"score_gpt":0.23596112725073531,"score_spread":0.22531621743149186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406629874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43049288,0.000056570057,0.5660228,0.000006719313,0.0003541838,0.00024213186,3.6226194e-7,0.002467442,0.00035688782],"genre_scores_gemma":[0.9928363,0.000021120122,0.006860517,0.00002344134,0.00009862788,0.000018239589,0.000008117681,0.000025152496,0.00010849605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992198,0.00004102945,0.00023881678,0.00022870419,0.00006458739,0.00020710725],"domain_scores_gemma":[0.9997033,0.0001000336,0.000049930368,0.00006735566,0.000048081467,0.00003132123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024940303,0.00014158126,0.00014265068,0.0002221804,0.00030890634,0.00007467054,0.00004766684,0.00010322648,7.2795945e-7],"category_scores_gemma":[0.000058797636,0.00017144953,0.000041477124,0.00013786629,0.00002074849,0.00014566805,0.00004490778,0.00023569919,8.27343e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012781862,0.0000057277807,0.00010720014,0.00013782838,0.000026919457,1.7510243e-7,0.0002519521,0.7111485,0.031055756,0.000019434161,0.000073862415,0.25715983],"study_design_scores_gemma":[0.0006142614,0.000052944786,0.0028561973,0.00017334912,0.00004216565,0.000003677002,0.00020159376,0.98616594,0.008668299,0.000008277352,0.0010869094,0.00012635726],"about_ca_topic_score_codex":0.0000032213643,"about_ca_topic_score_gemma":0.000006277636,"teacher_disagreement_score":0.5623434,"about_ca_system_score_codex":0.00009968122,"about_ca_system_score_gemma":0.0000067814617,"threshold_uncertainty_score":0.69915086},"labels":[],"label_agreement":null},{"id":"W4406679155","doi":"10.1007/s10586-024-04885-7","title":"Qaas: hybrid cryptocurrency wallet-as-a-service based on Quantum RNG","year":2025,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; École de Technologie Supérieure","funders":"","keywords":"Computer science; Cryptocurrency; Service (business); Quantum; Computer security; Computer network; Business","score_opus":0.009841690002237493,"score_gpt":0.2572373635055686,"score_spread":0.24739567350333108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406679155","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06612539,0.00011754267,0.9059936,0.019204976,0.0005597561,0.0003483228,0.0000015032172,0.0008034353,0.0068454817],"genre_scores_gemma":[0.96648437,0.000002263857,0.021662287,0.011696584,0.000055686076,0.000027687534,0.000004874307,0.00001014919,0.000056091623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982038,0.00008836577,0.00037025203,0.00070442236,0.00020678843,0.00042634082],"domain_scores_gemma":[0.9980512,0.00036214277,0.00012768254,0.0012357398,0.0001542035,0.00006903095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044001007,0.00022632729,0.00023723565,0.00029920012,0.00048558408,0.00014788345,0.0017472222,0.0001257226,0.000011826383],"category_scores_gemma":[0.000073345924,0.00022788545,0.00008640153,0.0009834995,0.00005734988,0.00009399472,0.00080209,0.00047016374,0.00017733309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017377863,0.00044927807,0.0007585356,0.0001472728,0.000036214988,0.000022116079,0.0005659314,0.0051235254,0.00013056895,0.8119589,0.0085404655,0.17224981],"study_design_scores_gemma":[0.0005011529,0.000050250277,0.0005940487,0.00013410875,0.0000060585708,0.0000071398827,0.00002456152,0.9572522,0.0007716846,0.030465802,0.009975666,0.00021730541],"about_ca_topic_score_codex":0.00004032255,"about_ca_topic_score_gemma":0.0000070200927,"teacher_disagreement_score":0.9521287,"about_ca_system_score_codex":0.0000727173,"about_ca_system_score_gemma":0.00013323067,"threshold_uncertainty_score":0.9292899},"labels":[],"label_agreement":null},{"id":"W4407910880","doi":"10.1007/s10586-024-05061-7","title":"A robust federated biased learning algorithm for time series forecasting","year":2025,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Traffic Prediction and Management Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Computer science; Series (stratigraphy); Algorithm; Time series; Artificial intelligence; Machine learning","score_opus":0.0170275305282568,"score_gpt":0.21454584863847265,"score_spread":0.19751831811021586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407910880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028154058,0.000052293213,0.98275733,0.00008903058,0.00038589298,0.00034581564,0.0000028635573,0.0071585416,0.006392836],"genre_scores_gemma":[0.8251513,0.0000036867866,0.17281812,0.00021545995,0.00016647928,0.00003349208,0.000055217606,0.00004479476,0.0015114199],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999272,0.000021555907,0.00022441766,0.00017263569,0.000057949954,0.00025144598],"domain_scores_gemma":[0.99971545,0.000099074954,0.0000314969,0.00007712485,0.00004799643,0.000028886614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021451096,0.00014002666,0.0001562019,0.00014959075,0.00023101583,0.00013204326,0.000094383955,0.00006363907,0.000004736473],"category_scores_gemma":[0.000040263636,0.0001565478,0.000057010835,0.00021495143,0.000016250999,0.00011237482,0.00008137219,0.00014952074,0.0000060380344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008033367,0.000012906013,0.000048088066,0.00019047438,0.00009592835,0.0000032360795,0.00018838941,0.21250743,0.00035832715,0.00009878899,0.052156154,0.73433226],"study_design_scores_gemma":[0.00040508065,0.00002660872,0.00002931773,0.0001624984,0.000017956843,0.0000037167865,0.0000677946,0.9883375,0.00084223674,0.000021393138,0.00994786,0.00013800226],"about_ca_topic_score_codex":0.000001733873,"about_ca_topic_score_gemma":0.0000011307934,"teacher_disagreement_score":0.8223359,"about_ca_system_score_codex":0.000055133423,"about_ca_system_score_gemma":0.0000093046265,"threshold_uncertainty_score":0.6383834},"labels":[],"label_agreement":null},{"id":"W4407937593","doi":"10.1007/s10586-024-04933-2","title":"Forecasting workload in cloud computing: towards uncertainty-aware predictions and transfer learning","year":2025,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Traffic Prediction and Management Techniques","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"Horizon 2020 Framework Programme; Science Foundation Ireland","keywords":"Computer science; Workload; Cloud computing; Transfer of learning; Transfer (computing); Distributed computing; Artificial intelligence; Operating system","score_opus":0.013282937208747455,"score_gpt":0.23042878469417238,"score_spread":0.21714584748542493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407937593","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15926927,0.00026586102,0.82798374,0.00016439885,0.00066441356,0.00026481043,0.0000012345286,0.003344565,0.008041688],"genre_scores_gemma":[0.998336,0.000046863835,0.0012232062,0.00015128052,0.0001303499,0.000006886637,0.000007089903,0.000023259281,0.000075072356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998893,0.000054077336,0.00036062422,0.00026119882,0.00010058228,0.0003305011],"domain_scores_gemma":[0.9996778,0.00010675426,0.000018365143,0.000118525306,0.000027003905,0.00005156875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033267576,0.00018761976,0.00021510232,0.00030843468,0.00018827077,0.000085299136,0.00013057358,0.000101723424,0.0000030126776],"category_scores_gemma":[0.00002598723,0.00021138176,0.000050265855,0.00043422775,0.000040963798,0.000088395675,0.00013395004,0.00046984034,0.0000012126511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062826543,0.000013747707,0.002340635,0.00016680916,0.00003450027,0.0000049669,0.0010548823,0.7696656,0.0000148939735,0.00021109404,0.0017637655,0.22472283],"study_design_scores_gemma":[0.0005715495,0.000020392863,0.002236652,0.00067906076,0.000018975617,0.0000065974446,0.00059227645,0.99229497,0.000033939592,0.000043616117,0.0033374962,0.00016445231],"about_ca_topic_score_codex":0.000024156749,"about_ca_topic_score_gemma":0.000034648212,"teacher_disagreement_score":0.83906674,"about_ca_system_score_codex":0.0001055466,"about_ca_system_score_gemma":0.000014534172,"threshold_uncertainty_score":0.8619898},"labels":[],"label_agreement":null},{"id":"W4409885889","doi":"10.1007/s10586-024-04981-8","title":"SPINEX-clustering: similarity-based predictions with explainable neighbors exploration for clustering problems","year":2025,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Clemson University","keywords":"Computer science; Cluster analysis; Similarity (geometry); Data mining; Artificial intelligence; Information retrieval; Image (mathematics)","score_opus":0.03347734993308603,"score_gpt":0.3032434677044574,"score_spread":0.2697661177713714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409885889","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008481216,0.00007454455,0.991018,0.0034598147,0.0007769466,0.0017871902,0.0000070245246,0.000914254,0.0011141287],"genre_scores_gemma":[0.305872,0.0000035688877,0.6916,0.0009096939,0.00024127541,0.00039778213,0.000032448825,0.000065420056,0.00087781803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655586,0.00013514685,0.0006497647,0.0011213378,0.00049817923,0.0010397155],"domain_scores_gemma":[0.99748474,0.0005128468,0.00022922586,0.0010825648,0.00050263695,0.00018799973],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078604656,0.00043540922,0.00043091417,0.00059062673,0.0011003774,0.0007116463,0.0013060534,0.00015403875,0.00000310399],"category_scores_gemma":[0.00016625291,0.00042330104,0.00013061802,0.0013901492,0.00011622209,0.0013686825,0.0011742845,0.00042919745,0.000007001765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007017176,0.00010330585,0.00015418621,0.0005872401,0.000049860715,0.000009529666,0.00070178224,0.97563213,0.00025691692,0.0012713331,0.00036057035,0.020802999],"study_design_scores_gemma":[0.0022548633,0.00036065132,0.00014348082,0.0006312245,0.000019007955,0.000016786964,0.00017565048,0.9890886,0.0007609709,0.0013884229,0.0047365567,0.0004237797],"about_ca_topic_score_codex":0.000029420467,"about_ca_topic_score_gemma":0.00007952616,"teacher_disagreement_score":0.30502385,"about_ca_system_score_codex":0.00039143531,"about_ca_system_score_gemma":0.00031233032,"threshold_uncertainty_score":0.9998219},"labels":[],"label_agreement":null},{"id":"W4411341629","doi":"10.1007/s10586-024-05088-w","title":"Aqua garbage collector: utilizing AI and IoT for efficient underwater garbage classification","year":2025,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Water Quality Monitoring Technologies","field":"Environmental Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Garbage; Internet of Things; Garbage collection; Underwater; Artificial intelligence; Embedded system; Real-time computing; Programming language; Geology","score_opus":0.03608731604708054,"score_gpt":0.2960237010436957,"score_spread":0.25993638499661514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411341629","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83657765,0.00003835546,0.1582936,0.0018378082,0.00038302006,0.00066676363,0.0000023572045,0.00031091235,0.0018895178],"genre_scores_gemma":[0.9844581,0.0000010216208,0.014434695,0.00036554591,0.000041378462,0.000023235674,0.0000031309467,0.000014655765,0.00065825565],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865323,0.000065296204,0.0002960716,0.00047278233,0.00015430264,0.00035831763],"domain_scores_gemma":[0.99930716,0.00022104415,0.00008042235,0.0003395633,0.000013026694,0.00003878151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005383727,0.00016221739,0.00017016155,0.00008644598,0.00037527713,0.0001253113,0.00026972446,0.00011189111,0.000010326306],"category_scores_gemma":[0.00010149864,0.0001513294,0.000046569454,0.00024240918,0.0001971193,0.000042154526,0.0007056871,0.00015326601,0.000022753324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039819462,0.0008193616,0.42865962,0.001525552,0.000261627,0.000016920134,0.013004958,0.078729466,0.23911609,0.0078127375,0.046846114,0.18280937],"study_design_scores_gemma":[0.0010548289,0.000076792734,0.05588095,0.0001908071,0.000036082267,0.0000043561054,0.0008426619,0.90155613,0.030498628,0.0022967092,0.0071682506,0.00039377165],"about_ca_topic_score_codex":0.000032705386,"about_ca_topic_score_gemma":0.000009781809,"teacher_disagreement_score":0.8228267,"about_ca_system_score_codex":0.00027672263,"about_ca_system_score_gemma":0.0000103109505,"threshold_uncertainty_score":0.6171034},"labels":[],"label_agreement":null},{"id":"W4411343010","doi":"10.1007/s10586-024-05093-z","title":"Seraph: a stochastic operational approach for the deployment of multi-antenna UAV-assisted networks","year":2025,"lang":"en","type":"article","venue":"Cluster Computing","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Software deployment; Antenna (radio); Telecommunications; Real-time computing; Computer network; Software engineering","score_opus":0.017658255415634073,"score_gpt":0.2440005425451968,"score_spread":0.22634228712956272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411343010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028887803,0.00037764048,0.9957272,0.00007769421,0.00019571598,0.00056656613,0.0000034452294,0.000082419574,0.00008056082],"genre_scores_gemma":[0.90776974,0.0000037075768,0.09189376,0.00010777113,0.00005823264,0.00007589085,0.00003447053,0.000013587106,0.000042818352],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948484,0.000011182854,0.00022028225,0.000113988484,0.00005026945,0.00011946028],"domain_scores_gemma":[0.9995683,0.00015791923,0.000031320782,0.00014817584,0.000079710444,0.000014565433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001327981,0.0000833736,0.00010066184,0.00004513499,0.00015911167,0.00003298117,0.00012447554,0.0000403762,0.0000015508382],"category_scores_gemma":[0.000008955824,0.00006670485,0.000046595913,0.00020171017,0.000020937792,0.000026620399,0.000044119686,0.00006851139,3.035346e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044543094,0.000027098687,0.00008921442,0.000037269223,0.000048271173,1.3178242e-8,0.00012817679,0.9927015,0.000091600916,0.00043355045,0.00028642785,0.0061524254],"study_design_scores_gemma":[0.00046085662,0.000005306347,0.0017714191,0.000028982146,0.0000291703,7.8007633e-7,0.00007427177,0.9974712,0.000019410803,0.000007882517,0.0000663351,0.00006435506],"about_ca_topic_score_codex":0.0000044825088,"about_ca_topic_score_gemma":0.000003348888,"teacher_disagreement_score":0.904881,"about_ca_system_score_codex":0.000029386409,"about_ca_system_score_gemma":0.000012847863,"threshold_uncertainty_score":0.2720145},"labels":[],"label_agreement":null},{"id":"W4413846978","doi":"10.1007/s10586-025-05213-3","title":"Energy service selection method based on blockchain smart contract and improved polar bear algorithm","year":2025,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Blockchain; Smart contract; Selection (genetic algorithm); Algorithm; Service (business); Polar; Energy (signal processing); Computer security; Artificial intelligence; Statistics","score_opus":0.005890502163549605,"score_gpt":0.24432712386969435,"score_spread":0.23843662170614474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413846978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070604156,0.00010572151,0.98521835,0.006440344,0.0001749439,0.00019700198,0.000002267863,0.00043310487,0.00036783432],"genre_scores_gemma":[0.5997179,0.0000015168515,0.39198038,0.00817078,0.0000480931,0.000016548127,0.000003053914,0.000009194652,0.0000525303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985313,0.00017178888,0.0002692504,0.00060039933,0.00010828275,0.00031897193],"domain_scores_gemma":[0.9988059,0.0003927074,0.000112643706,0.00048236936,0.00014308614,0.0000633144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065808627,0.0001895536,0.00022380597,0.00026647258,0.00042731126,0.000119479046,0.0005114235,0.00020556257,0.0000019209633],"category_scores_gemma":[0.000026358415,0.00019422788,0.00004755449,0.0009105102,0.00003364286,0.000049053124,0.0003408861,0.0003185121,0.0000023759524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013274961,0.00017045782,0.00045018707,0.000048640894,0.000050284023,0.0000030827516,0.00025931254,0.0024150922,0.0013468926,0.042020284,0.0002670404,0.9529554],"study_design_scores_gemma":[0.00063556957,0.00005866857,0.0005420532,0.00004385616,0.000011642785,0.000013110636,0.000014415406,0.98959774,0.0027987377,0.0028609375,0.0032518953,0.00017135942],"about_ca_topic_score_codex":0.00038340024,"about_ca_topic_score_gemma":0.00007644647,"teacher_disagreement_score":0.9871827,"about_ca_system_score_codex":0.00005896794,"about_ca_system_score_gemma":0.00007432125,"threshold_uncertainty_score":0.79203826},"labels":[],"label_agreement":null},{"id":"W4413943652","doi":"10.1007/s10586-025-05326-9","title":"L-xaids: A LIME-based eXplainable AI framework for intrusion detection systems","year":2025,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Mitacs","keywords":"Computer science; Intrusion detection system; Lime; Artificial intelligence; Geology","score_opus":0.010833975656361544,"score_gpt":0.28906552911999034,"score_spread":0.2782315534636288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413943652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050303317,0.00015451109,0.98818755,0.0012752248,0.003866702,0.0006546227,4.796039e-7,0.00055126223,0.00027931074],"genre_scores_gemma":[0.7335457,3.7127967e-7,0.26477167,0.0011828872,0.00032656812,0.000031800377,0.0000021319734,0.000016969325,0.000121872625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980122,0.00024080956,0.000420374,0.0006194664,0.0002250896,0.00048210233],"domain_scores_gemma":[0.9974971,0.0013940904,0.00021276367,0.0006279855,0.00020196332,0.0000661086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010009507,0.00022568104,0.0002974414,0.00032094438,0.0007755455,0.00050956366,0.00086197694,0.0001955931,0.0000015859516],"category_scores_gemma":[0.00079553557,0.0002311558,0.00011916035,0.0008312391,0.000034401448,0.0003453167,0.0006687455,0.00047956518,0.000010948176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051570623,0.000043546173,0.00047047716,0.00033537467,0.000031567703,0.0000047797143,0.000531217,0.8368844,0.00020060684,0.06689499,0.00031210098,0.09423937],"study_design_scores_gemma":[0.0006941518,0.00008080113,0.00009519674,0.00052132615,0.000015916832,0.000004340128,0.00009962087,0.98602843,0.0007600004,0.007891894,0.003583838,0.00022449142],"about_ca_topic_score_codex":0.000046175992,"about_ca_topic_score_gemma":0.0000025817073,"teacher_disagreement_score":0.7285154,"about_ca_system_score_codex":0.00022444561,"about_ca_system_score_gemma":0.000119508244,"threshold_uncertainty_score":0.942626},"labels":[],"label_agreement":null},{"id":"W4413953215","doi":"10.1007/s10586-025-05445-3","title":"A multi-strategy improved gazelle optimization algorithm for solving numerical optimization and engineering applications","year":2025,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Optimization algorithm; Engineering optimization; Mathematical optimization; Optimization problem; Algorithm; Mathematics","score_opus":0.01689102579222413,"score_gpt":0.2881112256679542,"score_spread":0.2712201998757301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413953215","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007208174,0.00019575996,0.99778736,0.00028839931,0.00022116768,0.0011323276,0.000004306975,0.00029210068,0.000071375194],"genre_scores_gemma":[0.003836881,0.000018105118,0.9954551,0.00015878933,0.00009181834,0.0001403929,0.000030043224,0.000023725477,0.00024517914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983004,0.0000531676,0.00045349984,0.0006216882,0.00016447275,0.0004067959],"domain_scores_gemma":[0.9985446,0.00044898666,0.00012839344,0.0003909026,0.00036520767,0.00012193083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050612254,0.00020508304,0.00024407922,0.00031260916,0.00039418408,0.0005087317,0.0005000636,0.000104193474,0.000005531015],"category_scores_gemma":[0.00020079291,0.00022517965,0.000057449146,0.000846486,0.000042547334,0.00033034774,0.0005036556,0.00017536043,0.000001801374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014351401,0.000042389456,0.000010899332,0.0000547418,0.000021028576,4.0169107e-7,0.00008152415,0.91813916,0.00006489536,0.00061451126,0.000045519108,0.080923505],"study_design_scores_gemma":[0.00092661066,0.000029211737,0.000023972729,0.000037409085,0.000013051719,0.0000067886153,0.000023650353,0.9983766,0.000088365174,0.000027368425,0.00024580225,0.00020116143],"about_ca_topic_score_codex":0.000005469046,"about_ca_topic_score_gemma":1.9815637e-7,"teacher_disagreement_score":0.08072234,"about_ca_system_score_codex":0.00008235326,"about_ca_system_score_gemma":0.00011462092,"threshold_uncertainty_score":0.918256},"labels":[],"label_agreement":null},{"id":"W4414114940","doi":"10.1007/s10586-025-05504-9","title":"Multiobjective pruning for sparse deep neural networks: leveraging $$L_0$$ regularization on batch normalization scaling factors","year":2025,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Rimouski","funders":"","keywords":"Normalization (sociology); Regularization (linguistics); Pruning; Convolutional neural network; Deep neural networks; Computational complexity theory; Benchmark (surveying); Scaling","score_opus":0.018154779156090133,"score_gpt":0.26386150018222976,"score_spread":0.24570672102613964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414114940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06413412,0.000046085646,0.9332278,0.00055535004,0.00082252914,0.00067384867,7.112706e-7,0.00027748052,0.0002621161],"genre_scores_gemma":[0.9710936,0.0000017091769,0.02740709,0.0010757768,0.00024389333,0.000024863031,0.00003763113,0.000019112877,0.00009630791],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983379,0.00009796349,0.00040051757,0.0005901136,0.0001543148,0.0004191556],"domain_scores_gemma":[0.99862796,0.0005336101,0.00020715018,0.00039368274,0.00017422262,0.00006335273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029712514,0.0002231349,0.0002087632,0.00016792753,0.0008618657,0.0004015533,0.0005207002,0.00008938826,8.624849e-7],"category_scores_gemma":[0.000066517634,0.00022139458,0.00009826906,0.0008332661,0.00002793806,0.0003961363,0.00032948793,0.00020112953,0.0000012506912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007810394,0.000027763179,0.0018003926,0.000018553179,0.000014658032,4.614817e-7,0.00076072087,0.9382427,0.00006799518,0.010863683,0.00011128199,0.048084006],"study_design_scores_gemma":[0.00045693122,0.000026345926,0.0034063736,0.00011847778,0.000013649653,0.0000017499359,0.00010129819,0.9940394,0.0004583053,0.0009880179,0.00017839593,0.00021105564],"about_ca_topic_score_codex":0.000011408068,"about_ca_topic_score_gemma":0.0000055218934,"teacher_disagreement_score":0.9069595,"about_ca_system_score_codex":0.000105464984,"about_ca_system_score_gemma":0.000022066964,"threshold_uncertainty_score":0.9028209},"labels":[],"label_agreement":null},{"id":"W4414126261","doi":"10.1007/s10586-025-05417-7","title":"Deep fuzzy clustering neural network (DFC-NN): fast convergence and enhanced clustering performance","year":2025,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Cluster analysis; Adaptability; Robustness (evolution); Artificial neural network; Fuzzy clustering; Benchmark (surveying); Convergence (economics)","score_opus":0.01054450954194845,"score_gpt":0.23587270439286945,"score_spread":0.225328194850921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414126261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28417557,0.00021038251,0.71035194,0.00024875597,0.0016945167,0.00020328182,2.89808e-7,0.00018210275,0.0029331164],"genre_scores_gemma":[0.9546338,0.00004520295,0.04342956,0.0014254136,0.00022464312,0.000009690077,0.000003583708,0.000014601242,0.00021355669],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978305,0.00010772037,0.00048524837,0.0007010294,0.00021257941,0.00066292257],"domain_scores_gemma":[0.9989612,0.00018958675,0.0001642774,0.00046113605,0.00009944104,0.00012436789],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036705317,0.00028962223,0.00030766634,0.00014279493,0.0006168422,0.00036306932,0.00067907886,0.00011326471,0.000012250309],"category_scores_gemma":[0.000028808117,0.00029065693,0.000070573,0.00053180254,0.00007169393,0.0006898554,0.0018617283,0.00031421674,0.000038521444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003875576,0.00002485889,0.0027377193,0.00025718185,0.000029241372,0.000008864242,0.0017742381,0.32513183,0.0016515274,0.000091098475,0.00038309096,0.6678716],"study_design_scores_gemma":[0.00057893764,0.000047919,0.0046116044,0.0005413327,0.000009513416,0.000026956846,0.00010658852,0.99187315,0.0015378767,0.00012558223,0.00023246353,0.00030805587],"about_ca_topic_score_codex":0.0000082576125,"about_ca_topic_score_gemma":0.000017447866,"teacher_disagreement_score":0.67045814,"about_ca_system_score_codex":0.0000503792,"about_ca_system_score_gemma":0.000033904053,"threshold_uncertainty_score":0.9999546},"labels":[],"label_agreement":null},{"id":"W4414349631","doi":"10.1007/s10586-025-05320-1","title":"Anomaly-free federated access control policy enforcement framework for ethereum","year":2025,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Access Control and Trust","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"XACML; Access control; Scalability; Middleware (distributed applications); Markup language; Mandatory access control; Architecture; Enforcement; XML","score_opus":0.026534328698210045,"score_gpt":0.38971164329150854,"score_spread":0.3631773145932985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414349631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013356528,0.00020124603,0.8711722,0.02143624,0.0010306055,0.0011089194,0.000011126276,0.0002212083,0.09146196],"genre_scores_gemma":[0.9863758,0.000004760501,0.002426468,0.0083605815,0.0012525303,0.00003753268,0.000004055767,0.000014320239,0.0015239276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836344,0.00017495417,0.0003419721,0.00031524492,0.0002170395,0.00058737857],"domain_scores_gemma":[0.9981643,0.0011085541,0.00016169935,0.0002612972,0.00020473436,0.000099408186],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007192835,0.00016346619,0.00028540706,0.00014642025,0.0014876373,0.0007766052,0.0009117068,0.00018504156,0.0000674907],"category_scores_gemma":[0.0013160916,0.0001553319,0.00012599476,0.00048820957,0.00012827768,0.00023196885,0.00033141146,0.00019161309,0.000008800192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001713347,0.000075777396,0.013050599,0.00007617663,0.00020778368,0.000002246888,0.003345245,0.0017619625,0.0000115453295,0.88452554,0.0047887787,0.09198303],"study_design_scores_gemma":[0.014319755,0.00017201703,0.015447149,0.00076008536,0.00024807503,0.0000012196405,0.0051797912,0.27431002,0.00018472745,0.4526767,0.23544736,0.0012530703],"about_ca_topic_score_codex":0.0031192761,"about_ca_topic_score_gemma":0.0008337233,"teacher_disagreement_score":0.9730193,"about_ca_system_score_codex":0.0001741342,"about_ca_system_score_gemma":0.00038797187,"threshold_uncertainty_score":0.9998123},"labels":[],"label_agreement":null},{"id":"W4414597492","doi":"10.1007/s10586-025-05629-x","title":"Time-and-Traffic-aware collaborative task offloading with service caching-replacement in cloud-assisted mobile edge computing","year":2025,"lang":"en","type":"article","venue":"Cluster Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Mobile edge computing; Scalability; Edge computing; Computation offloading; Adaptability; Cloud computing; Cloudlet; Service (business); Knapsack problem; Reinforcement learning","score_opus":0.0070809388047821786,"score_gpt":0.24427559248083067,"score_spread":0.2371946536760485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414597492","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7308286,0.00033597747,0.26244196,0.00076874736,0.0029880053,0.00085293007,0.0000010265634,0.000507864,0.0012749027],"genre_scores_gemma":[0.97902447,0.0000022884994,0.018257398,0.0017623821,0.000697947,0.000012755776,0.000016285436,0.00003922964,0.00018726509],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99604815,0.00041345356,0.00087889796,0.0012631186,0.00040018384,0.0009962062],"domain_scores_gemma":[0.9975289,0.00082713907,0.00038071585,0.0007143704,0.00037719726,0.00017167248],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013202619,0.00054983835,0.0007119656,0.000529023,0.000851505,0.00061826827,0.0010843269,0.00016893209,0.0000018056211],"category_scores_gemma":[0.000051150666,0.00052923773,0.00007458509,0.0028459334,0.00010195201,0.0004128683,0.0020167858,0.0006456399,0.000032517935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003018729,0.00062541466,0.012679687,0.0009621926,0.0004416044,0.00018538926,0.052328996,0.6939164,0.0010399624,0.00047703087,0.008761506,0.22827996],"study_design_scores_gemma":[0.0021005422,0.0001754236,0.0023837348,0.001271292,0.00002854319,0.0000506858,0.0006158305,0.9902351,0.00018752765,0.000024002202,0.002331826,0.00059552904],"about_ca_topic_score_codex":0.00010326781,"about_ca_topic_score_gemma":0.00007594045,"teacher_disagreement_score":0.29631868,"about_ca_system_score_codex":0.0003612645,"about_ca_system_score_gemma":0.00035216636,"threshold_uncertainty_score":0.9997159},"labels":[],"label_agreement":null},{"id":"W4414601380","doi":"10.1007/s10586-025-05346-5","title":"Improving traffic flow forecasting with variational mode decomposition and deep learning-based prediction models","year":2025,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Traffic Prediction and Management Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Mode (computer interface); Traffic flow (computer networking); Convolutional neural network; Reliability (semiconductor); Nonlinear system; Decomposition; Artificial neural network; Deep learning","score_opus":0.0064795339482189174,"score_gpt":0.21306880498074066,"score_spread":0.20658927103252173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414601380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055965193,0.00006633395,0.93903023,0.000043626125,0.00017271351,0.00022861749,0.0000022512247,0.003448114,0.001042903],"genre_scores_gemma":[0.9336145,0.0000036363747,0.066151015,0.0000818644,0.000060921655,0.000014939933,0.00004262576,0.000020517838,0.000009989304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925905,0.000028936187,0.00020783265,0.0002099354,0.00011034423,0.0001839125],"domain_scores_gemma":[0.99972534,0.00007094708,0.000041627914,0.00008342546,0.00004200931,0.000036644546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015848677,0.00014168602,0.00011693197,0.00019703293,0.00022966444,0.0000906101,0.000062588486,0.00006601952,0.0000011197907],"category_scores_gemma":[0.000008578874,0.00014802866,0.000026417074,0.00016354944,0.000019520907,0.00020259617,0.000041053274,0.0001958438,4.1750988e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013020488,0.000010025166,0.00008129712,0.000091023,0.000025104158,9.077439e-7,0.00016518318,0.8435448,0.000047554502,0.00013225371,0.00011059197,0.15577829],"study_design_scores_gemma":[0.00063509523,0.00004189149,0.0003771204,0.00016532093,0.000036087138,0.0000056302306,0.000044609147,0.9984104,0.000056593897,0.00004568581,0.00006029249,0.00012126506],"about_ca_topic_score_codex":0.000003983729,"about_ca_topic_score_gemma":0.000010692909,"teacher_disagreement_score":0.8776493,"about_ca_system_score_codex":0.0000868955,"about_ca_system_score_gemma":0.000012674465,"threshold_uncertainty_score":0.60364336},"labels":[],"label_agreement":null},{"id":"W4414633451","doi":"10.1007/s10586-025-05507-6","title":"Lattice-based cryptographic technique to preserve data confidentiality in edge computing","year":2025,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; Digital signature; Cryptography; Edge device; Scheme (mathematics); Confidentiality; Edge computing; Public-key cryptography; Signature (topology)","score_opus":0.032135735017686275,"score_gpt":0.3170454700273678,"score_spread":0.28490973500968153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414633451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045478653,0.00015762859,0.94993144,0.0013267125,0.00069698686,0.00093654246,0.000026896534,0.0004194061,0.0010257576],"genre_scores_gemma":[0.7683515,0.0000012915074,0.22941653,0.0020707732,0.00008248409,0.000010195423,0.00005338333,0.000011047242,0.0000028173379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964112,0.00045514287,0.0007764734,0.0013206018,0.00035157372,0.00068500615],"domain_scores_gemma":[0.995813,0.00074875605,0.00017523485,0.0029502911,0.00015051616,0.0001621761],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027271,0.00030998964,0.00042448545,0.0009071252,0.0003210693,0.00060602895,0.004695394,0.00015919791,0.00000606768],"category_scores_gemma":[0.00025135608,0.00034101063,0.00011863156,0.0032153623,0.00010217616,0.0007891757,0.006168526,0.00054173806,0.000012143784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031245657,0.0028145355,0.2089551,0.0028362763,0.0003819044,0.00025459955,0.008647328,0.026088947,0.0035771057,0.535731,0.030192174,0.18020855],"study_design_scores_gemma":[0.0012105834,0.00005535186,0.026948733,0.00082053506,0.000019980927,0.0000072989865,0.000082571794,0.953775,0.00093080266,0.0097996965,0.0057820166,0.0005674668],"about_ca_topic_score_codex":0.000450746,"about_ca_topic_score_gemma":0.0004339789,"teacher_disagreement_score":0.92768604,"about_ca_system_score_codex":0.00005413013,"about_ca_system_score_gemma":0.00018038564,"threshold_uncertainty_score":0.9999042},"labels":[],"label_agreement":null},{"id":"W4415219996","doi":"10.1007/s10586-025-05652-y","title":"Mitigating insider threats: a trust-based security framework for energy grid plants with dynamic authentication and role-based training","year":2025,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Sherbrooke O.E.M (Canada); Université de Sherbrooke","funders":"","keywords":"Bridging (networking); Robustness (evolution); Insider threat; Vulnerability (computing); Authentication (law); Grid; Competence (human resources); Data integrity; Computer security model","score_opus":0.007805518327385761,"score_gpt":0.23519782674197715,"score_spread":0.22739230841459138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415219996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47729674,0.00043698392,0.52131146,0.00017063181,0.00028025408,0.00016853667,0.0000099506,0.00019677985,0.00012864401],"genre_scores_gemma":[0.97358793,0.000003798554,0.025728183,0.00047602542,0.00011315158,0.000025209549,0.00003362533,0.000026805856,0.0000052419236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894357,0.00003691435,0.0002569807,0.00030512718,0.0001178006,0.00033959292],"domain_scores_gemma":[0.99897355,0.00066897186,0.000060592025,0.0001925271,0.000038358994,0.00006600012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017887104,0.00020364598,0.00023081993,0.00013152549,0.00026071083,0.000093084906,0.00012986001,0.00013780981,0.0000017462422],"category_scores_gemma":[0.0000558732,0.00019259685,0.000047904516,0.00017877485,0.000080680154,0.00007359423,0.00003322666,0.00022037457,4.2458595e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002807122,0.0001355749,0.010518669,0.002124331,0.0002697533,0.000017403596,0.020705016,0.8622798,0.0016944461,0.008667489,0.00015206393,0.09315476],"study_design_scores_gemma":[0.0008634049,0.000038829305,0.0010912017,0.0010619886,0.000029888863,0.000005824388,0.00081064325,0.990051,0.0013773923,0.0042941677,0.00015313138,0.0002225704],"about_ca_topic_score_codex":0.000009194125,"about_ca_topic_score_gemma":0.00005149889,"teacher_disagreement_score":0.49629122,"about_ca_system_score_codex":0.000059431568,"about_ca_system_score_gemma":0.00006158732,"threshold_uncertainty_score":0.78538716},"labels":[],"label_agreement":null},{"id":"W7083674219","doi":"10.1007/s10586-025-05335-8","title":"Privacy preserved api access control policy- based ransomware attack detection in cloud vms using sl2stm","year":2025,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Biofuel production and bioconversion","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hatch (Canada)","funders":"","keywords":"Cloud computing; Upload; Access control; Data access; Feature selection; Gateway (web page); Encryption; Feature (linguistics)","score_opus":0.026678553876173804,"score_gpt":0.28852872785955475,"score_spread":0.26185017398338095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7083674219","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6878434,0.00015339589,0.3086158,0.00073794654,0.0015144299,0.00044841072,0.0000023507182,0.00034313792,0.00034115778],"genre_scores_gemma":[0.99832803,0.0000031497602,0.0005534568,0.0005723183,0.0004635243,0.0000036690592,0.0000048873044,0.00002303271,0.000047958285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885523,0.000099244826,0.00032405986,0.00028825362,0.00011307887,0.00032009982],"domain_scores_gemma":[0.9995048,0.00007245742,0.00005039599,0.00026829317,0.000053545107,0.00005052364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026852987,0.00018209514,0.00021484465,0.00036141343,0.00012808717,0.00011767756,0.0002775789,0.00014513146,0.0000136217905],"category_scores_gemma":[0.00006379269,0.00019090589,0.000076833676,0.00063141366,0.000028352244,0.00020336159,0.00013455929,0.00028179758,0.0000074958566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001585347,0.000060888262,0.013670996,0.0013999434,0.00006118435,0.000004936959,0.00033934225,0.9470847,0.018611908,0.0000065423806,0.00080613507,0.017794847],"study_design_scores_gemma":[0.0022980715,0.000010344631,0.0044350736,0.00018683758,0.000014377787,0.000002283005,0.000036873873,0.97274435,0.016613271,0.000022545468,0.003449799,0.00018616952],"about_ca_topic_score_codex":0.000120591976,"about_ca_topic_score_gemma":0.000015709073,"teacher_disagreement_score":0.31048465,"about_ca_system_score_codex":0.00025576676,"about_ca_system_score_gemma":0.000044672888,"threshold_uncertainty_score":0.7784916},"labels":[],"label_agreement":null},{"id":"W86735328","doi":"","title":"Overlap of computation and communication on shared-memory networks-of-workstations","year":2001,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Asynchronous communication; Parallel computing; Latency (audio); Computation; Distributed memory; Shared memory; Workstation; Multiprocessing; Compiler; Transformation (genetics); CAS latency; Uniform memory access; Data access; Distributed shared memory; Memory model; Memory management; Operating system; Algorithm; Computer network; Semiconductor memory; Memory controller","score_opus":0.020143973224367326,"score_gpt":0.28078552645919475,"score_spread":0.2606415532348274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W86735328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05007029,0.0002422617,0.9467285,0.00027953048,0.000093856295,0.00017201739,7.749259e-7,0.00019417935,0.0022185529],"genre_scores_gemma":[0.74951273,0.000044259163,0.25017193,0.00020701153,0.000022094879,0.0000015572693,0.000010737221,0.0000075255666,0.000022163154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988032,0.00016319023,0.00044653015,0.00024768114,0.00017482052,0.00016455149],"domain_scores_gemma":[0.9984392,0.0005252613,0.00037983494,0.00041290972,0.00019423624,0.00004856853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042991719,0.0001247517,0.00021293265,0.0001787928,0.00017209223,0.00006815009,0.00044744575,0.00006677549,0.0000018767888],"category_scores_gemma":[0.00004826623,0.00013169051,0.000048258673,0.0004689276,0.00007683855,0.00021703215,0.00035221348,0.0001440418,0.0000016927906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001105107,0.00007051753,0.0020313864,0.00002413434,0.0000137630195,9.118725e-7,0.0011887503,0.9232352,0.000025816424,0.006333562,0.00058040593,0.06648455],"study_design_scores_gemma":[0.0003210518,0.00007919273,0.0061726854,0.0002078,0.000005057333,0.00001126098,0.000048658465,0.9917445,0.00010328037,0.0011286227,0.000059464426,0.00011843474],"about_ca_topic_score_codex":0.000015436672,"about_ca_topic_score_gemma":0.0000014567645,"teacher_disagreement_score":0.69944245,"about_ca_system_score_codex":0.00002364428,"about_ca_system_score_gemma":0.000023448149,"threshold_uncertainty_score":0.53701836},"labels":[],"label_agreement":null}]}