{"meta":{"query_hash":"cadf0284ab08","filters":{"venue":"Concurrency and Computation Practice and Experience"},"cohort_total":162,"direct_labels_cover":0,"predictions_cover":162,"exported":162,"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/cadf0284ab08","api":"https://metacan.xera.ac/api/v1/cohort?venue=Concurrency+and+Computation+Practice+and+Experience"},"results":[{"id":"W1480044444","doi":"10.1002/cpe.3153","title":"A lightweight key management scheme based on an Adelson‐Velskii and Landis tree and elliptic curve cryptography for wireless sensor networks","year":2013,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Elliptic curve cryptography; Encryption; Wireless sensor network; Key management; Computer network; Distributed computing; Key (lock); Scalability; Cryptography; Key distribution in wireless sensor networks; Public-key cryptography; Wireless; Wireless network; Algorithm; Computer security; Telecommunications; Database","score_opus":0.015197273118442937,"score_gpt":0.27788860801431553,"score_spread":0.2626913348958726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480044444","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.33146483,0.0019857434,0.6637341,0.0013067903,0.00028301714,0.0007319507,0.0000032687353,0.00011126481,0.000379063],"genre_scores_gemma":[0.9459474,0.0014166025,0.051277857,0.0010596634,0.000080763224,0.00018259122,0.000013412305,0.000013501647,0.000008177572],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981583,0.00016559806,0.00031265346,0.0007721607,0.00023519827,0.00035612733],"domain_scores_gemma":[0.99822044,0.00087733637,0.00020977693,0.000269449,0.00017014606,0.00025286493],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024989413,0.00028091128,0.00025464423,0.00014487791,0.0004331113,0.0007233813,0.00020857541,0.0001137893,0.0000047329595],"category_scores_gemma":[0.000043193555,0.00026210005,0.000031744526,0.00030424754,0.00022274515,0.0017499984,0.00014887162,0.00019792464,0.000002114794],"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.00020907394,0.0004887156,0.003422054,0.00028851145,0.00010124339,0.000038656617,0.023582712,0.002260912,0.000102483435,0.106353596,0.0006341566,0.8625179],"study_design_scores_gemma":[0.0011145803,0.00044577805,0.0026275415,0.000103970975,0.000030079775,0.00003629203,0.0018859969,0.9895931,0.000039763614,0.0017129807,0.00202403,0.00038590963],"about_ca_topic_score_codex":0.000023259086,"about_ca_topic_score_gemma":0.0000031358134,"teacher_disagreement_score":0.98733217,"about_ca_system_score_codex":0.000010417829,"about_ca_system_score_gemma":0.000015019847,"threshold_uncertainty_score":0.99998313},"labels":[],"label_agreement":null},{"id":"W150141253","doi":"10.1002/cpe.1188","title":"Gossip‐based search selection in hybrid peer‐to‐peer networks","year":2007,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Gossip; Peer-to-peer; Distributed hash table; Flooding (psychology); Popularity; Bandwidth (computing); Distributed computing; Computer network","score_opus":0.027226153535240907,"score_gpt":0.3487067222338325,"score_spread":0.3214805686985916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W150141253","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.21283357,0.00032835334,0.77911675,0.0066525815,0.00027015505,0.00023574513,6.761825e-7,0.0001811395,0.0003810049],"genre_scores_gemma":[0.9530225,0.000043491433,0.04518657,0.0016018135,0.00005410396,0.000035373727,0.0000035278103,0.0000069052717,0.000045706325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997985,0.0000983667,0.00032818178,0.00061707397,0.0005108245,0.0004605226],"domain_scores_gemma":[0.998404,0.0006667016,0.00009328387,0.0001793335,0.0004630366,0.00019362303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014219403,0.00017798743,0.00017204956,0.00031340064,0.00024018408,0.00035799725,0.00038352303,0.00008015129,0.0000028861089],"category_scores_gemma":[0.0007960972,0.00018634766,0.000018275588,0.0013257208,0.00009356579,0.0012311783,0.00025442024,0.00034436642,0.00001291533],"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.00009233526,0.000116287476,0.0030876324,0.000014429061,0.000007585499,0.000067807065,0.010018822,0.02701268,0.0002884572,0.008078804,0.0016709968,0.9495442],"study_design_scores_gemma":[0.00075611443,0.00055658724,0.017490594,0.00008654938,0.000008055584,0.00016608444,0.0031973503,0.93679106,0.0020042507,0.000898305,0.037449546,0.0005955246],"about_ca_topic_score_codex":0.00007881269,"about_ca_topic_score_gemma":0.000024240655,"teacher_disagreement_score":0.9489486,"about_ca_system_score_codex":0.000057598012,"about_ca_system_score_gemma":0.00007656048,"threshold_uncertainty_score":0.7599037},"labels":[],"label_agreement":null},{"id":"W1536395336","doi":"10.1002/cpe.1892","title":"A performance evaluation framework for packet scheduling algorithms in wireless system","year":2011,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Maximum throughput scheduling; Network packet; Scheduling (production processes); Round-robin scheduling; Algorithm; Wireless; Fair-share scheduling; Distributed computing; Computer network; Mathematical optimization; Quality of service; Mathematics; Telecommunications","score_opus":0.04465426547914656,"score_gpt":0.31715499168889066,"score_spread":0.2725007262097441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536395336","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.4235855,0.00068619003,0.5749781,0.0000068418162,0.00022658582,0.00022766858,9.919413e-7,0.000059797538,0.0002282981],"genre_scores_gemma":[0.90680885,0.00059262465,0.09231745,0.000017667575,0.0000394419,0.00020235626,0.000009920237,0.000011125889,5.862484e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992795,0.000040351526,0.00022170739,0.00019940983,0.00011152902,0.00014750549],"domain_scores_gemma":[0.99945915,0.00022543142,0.00008113369,0.00006602495,0.00012551014,0.00004275143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002681782,0.000109183784,0.00011730863,0.000056257544,0.00010240409,0.000033957207,0.000043022184,0.0000675386,0.0000027466135],"category_scores_gemma":[0.000105767846,0.00011959503,0.000009328587,0.0001812596,0.00004031327,0.00097178627,0.000013363399,0.000110247136,0.0000011164399],"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.000072263625,0.000036254314,0.0020130237,0.00027416967,0.000014772909,0.0000021126532,0.028211655,0.2026118,0.000052832725,0.009941904,0.000004371277,0.7567648],"study_design_scores_gemma":[0.00034964102,0.00004657004,0.0009700646,0.00020292337,0.000014767359,0.000012201658,0.00572003,0.9919393,0.00021577443,0.00035155614,0.000029921073,0.00014722152],"about_ca_topic_score_codex":0.0000041304274,"about_ca_topic_score_gemma":7.679957e-7,"teacher_disagreement_score":0.7893275,"about_ca_system_score_codex":0.000037313457,"about_ca_system_score_gemma":0.000016997237,"threshold_uncertainty_score":0.48769438},"labels":[],"label_agreement":null},{"id":"W1644445135","doi":"10.1002/cpe.3330","title":"Capturing the sensitivity of optical network quality metrics to its network interface parameters","year":2014,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Regional Development Fund; FP7 Information and Communication Technologies; Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"Computer science; SystemC; Scalability; Serialization; Network on a chip; Distributed computing; Network interface; Computer network; Interface (matter); Network architecture; Computer architecture; Architecture; Embedded system; Parallel computing","score_opus":0.04617414862232739,"score_gpt":0.3412086375550242,"score_spread":0.2950344889326968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1644445135","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.16087005,0.00063513673,0.83580303,0.0010572876,0.0009149934,0.00015571923,4.193302e-7,0.000032321015,0.00053103815],"genre_scores_gemma":[0.9879782,0.000052596624,0.010982148,0.0008199732,0.00013641738,0.000014692378,4.7025995e-7,0.000003906978,0.000011569175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798465,0.0007685742,0.00040010965,0.00036611877,0.00023054951,0.00025000784],"domain_scores_gemma":[0.9957001,0.0034811778,0.00025465133,0.00021463164,0.00023464291,0.000114780785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024735478,0.00013369966,0.00022991713,0.000035930232,0.00029186578,0.00023230989,0.00019141249,0.00005383236,0.0000010979112],"category_scores_gemma":[0.0011574909,0.00010343825,0.000034392364,0.0005053392,0.0000921157,0.0006937756,0.00023006788,0.00017754488,0.000003997057],"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.00010378385,0.00008844761,0.0016239857,0.00008463544,0.000067497946,0.0000063703583,0.033990167,0.25084418,0.00022228702,0.3626599,0.0013275068,0.34898123],"study_design_scores_gemma":[0.0002355192,0.00023492263,0.0023280594,0.0001053846,0.00001698572,0.000093188144,0.0022076436,0.9855281,0.00034933322,0.0013457382,0.007285312,0.0002698091],"about_ca_topic_score_codex":0.000075505064,"about_ca_topic_score_gemma":0.000011853734,"teacher_disagreement_score":0.8271082,"about_ca_system_score_codex":0.000012328731,"about_ca_system_score_gemma":0.000020521758,"threshold_uncertainty_score":0.42180893},"labels":[],"label_agreement":null},{"id":"W1695361088","doi":"10.1002/cpe.2976","title":"Special issue on parallel architectures and bioinspired algorithm: guest editors message","year":2012,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Dependability; Heuristics; Architecture; Fault tolerance; Set (abstract data type); Distributed computing; Parallel computing; Software engineering; Programming language","score_opus":0.017421624073587008,"score_gpt":0.3081765115453007,"score_spread":0.2907548874717137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1695361088","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.057851322,0.0046955906,0.9087139,0.00830436,0.010307758,0.0006574463,0.000021126376,0.000259766,0.009188733],"genre_scores_gemma":[0.8001873,0.0013059862,0.16113682,0.0017916372,0.035197128,0.00017322275,0.000023227489,0.000016864138,0.00016784068],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99895394,0.000080578946,0.00019027207,0.00035164965,0.00019707473,0.00022647822],"domain_scores_gemma":[0.9991277,0.00036265844,0.00012000587,0.00014395693,0.000063946914,0.00018172039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001773846,0.00015146252,0.00012370618,0.00006505494,0.00043236287,0.00016512995,0.00014590033,0.00005377805,0.000008791895],"category_scores_gemma":[0.00008361877,0.00013822418,0.000016468324,0.00018897586,0.00018390638,0.0010776395,0.00012520266,0.00014810158,0.000014544109],"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.000013182918,0.00031931332,0.0005708365,0.000016809385,0.000014411389,0.00000542535,0.019890616,0.000058357575,0.000037253376,0.0223723,0.010177358,0.94652414],"study_design_scores_gemma":[0.0008245286,0.00033973335,0.016437644,0.000044826553,0.000024869276,0.00023659412,0.0027783765,0.05352275,0.00016067325,0.002174252,0.9228872,0.0005685709],"about_ca_topic_score_codex":0.000016689926,"about_ca_topic_score_gemma":4.042493e-7,"teacher_disagreement_score":0.9459556,"about_ca_system_score_codex":0.0000093553,"about_ca_system_score_gemma":0.000025141035,"threshold_uncertainty_score":0.5636618},"labels":[],"label_agreement":null},{"id":"W1734166017","doi":"10.1002/cpe.3160","title":"Supporting multidimensional range queries in Hierarchically Distributed Tree","year":2013,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Overlay; Distributed computing; Overlay network; Range query (database); Routing (electronic design automation); Tree (set theory); Load balancing (electrical power); Network topology; Range (aeronautics); Set (abstract data type); Process (computing); Computer network; Information retrieval; Mathematics; Grid","score_opus":0.016875113048608354,"score_gpt":0.3178772061085061,"score_spread":0.3010020930598978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1734166017","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.5651796,0.00049911684,0.4266657,0.0069023203,0.00015351437,0.00024944634,0.0000022234158,0.00016308647,0.00018499912],"genre_scores_gemma":[0.932727,0.00006828216,0.066309005,0.0007565997,0.0000143283805,0.00010059665,0.000006337358,0.0000037027364,0.000014158077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986278,0.00009222093,0.00032446184,0.00044282211,0.00021002021,0.0003027106],"domain_scores_gemma":[0.9987988,0.0006286608,0.00013614455,0.00016953402,0.00015049265,0.00011635953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025683705,0.00014349994,0.0001643145,0.00010897941,0.0001665251,0.0002229297,0.00024995356,0.00006235002,0.0000065853187],"category_scores_gemma":[0.00089629507,0.00013481593,0.000015148579,0.0004496589,0.00015556205,0.001980823,0.0003479856,0.00019959283,0.000015419531],"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.00003657107,0.00013346106,0.010824117,0.000023696066,0.000010935785,0.000055452838,0.020366115,0.00029677185,0.0010245271,0.04058238,0.0013037728,0.9253422],"study_design_scores_gemma":[0.0024857104,0.00079475675,0.28309327,0.0002544251,0.000018276418,0.0004160691,0.015000122,0.64060634,0.0012508553,0.02600429,0.028572824,0.0015030588],"about_ca_topic_score_codex":0.00009795043,"about_ca_topic_score_gemma":0.000012125706,"teacher_disagreement_score":0.92383915,"about_ca_system_score_codex":0.000017302866,"about_ca_system_score_gemma":0.00004660729,"threshold_uncertainty_score":0.5497634},"labels":[],"label_agreement":null},{"id":"W1734673682","doi":"10.1002/cpe.3360","title":"Nature‐inspired soft computing for financial option pricing using high‐performance analytics","year":2014,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Stock Market Forecasting Methods","field":"Decision Sciences","cited_by":11,"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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Computer science; Particle swarm optimization; Speedup; Valuation of options; Volatility (finance); Soft computing; Supercomputer; Financial engineering; Finance; Mathematical optimization; Algorithm; Parallel computing; Economics; Artificial neural network; Artificial intelligence; Mathematics","score_opus":0.10091215526542896,"score_gpt":0.4402179227642692,"score_spread":0.3393057674988402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1734673682","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.49960583,0.000137981,0.49938914,0.000093101386,0.00050978886,0.00011635827,0.0000011034863,0.000020676547,0.00012604188],"genre_scores_gemma":[0.89036125,0.00001948192,0.108994275,0.00042023556,0.0001721829,0.000007105468,0.0000030751407,0.0000075031207,0.00001491608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785924,0.00030882598,0.0005637525,0.0005466605,0.00047384048,0.0002476752],"domain_scores_gemma":[0.9921911,0.006391836,0.0005792411,0.00016625437,0.000576966,0.00009464272],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0034150085,0.00016481038,0.00026770975,0.00016260712,0.0007097286,0.00035080904,0.00019202702,0.00012353822,0.0000036980348],"category_scores_gemma":[0.020205474,0.00014687378,0.0000344283,0.00052215275,0.00015313443,0.0011663049,0.00011590397,0.00022780953,0.0000018235768],"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.00010763791,0.000028842034,0.0057980344,0.000032271833,0.000006213135,7.7865366e-7,0.0036206045,0.0079242475,0.00042696326,0.0051143575,0.00006271364,0.97687733],"study_design_scores_gemma":[0.00048226805,0.00018515691,0.01796806,0.00006345402,0.000027893288,0.00004409936,0.000939413,0.97156227,0.00035286244,0.005021027,0.0031430786,0.00021041735],"about_ca_topic_score_codex":0.00001234691,"about_ca_topic_score_gemma":7.9894346e-7,"teacher_disagreement_score":0.9766669,"about_ca_system_score_codex":0.000023171671,"about_ca_system_score_gemma":0.0000761586,"threshold_uncertainty_score":0.9880478},"labels":[],"label_agreement":null},{"id":"W1736267949","doi":"10.1002/cpe.3303","title":"Controlling fairness and task granularity in distributed, online, non‐clairvoyant workflow executions","year":2014,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Montreal Neurological Institute and Hospital","funders":"CHIST-ERA; Agence Nationale de la Recherche; LabEx PRIMES; European Commission","keywords":"Granularity; Computer science; Workflow; Task (project management); Distributed computing; Control (management); Middleware (distributed applications); Grid; Database; Operating system; Artificial intelligence","score_opus":0.014670849042167351,"score_gpt":0.2913119196751143,"score_spread":0.2766410706329469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1736267949","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.25172123,0.0009891373,0.7460097,0.00063216116,0.00028378982,0.00015527739,0.000013393599,0.000059270504,0.0001360392],"genre_scores_gemma":[0.9932453,0.00020006837,0.006154437,0.0002705674,0.000053987842,0.000023031818,0.00004277083,0.000004571477,0.0000052788155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983476,0.00023581769,0.000394278,0.00054642995,0.00019436458,0.00028152976],"domain_scores_gemma":[0.9986007,0.0007124121,0.00020003562,0.00019036948,0.00014499623,0.00015148119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052081625,0.00019403416,0.00027816108,0.00008394066,0.000343179,0.00043781774,0.0002278544,0.000083234074,7.346219e-7],"category_scores_gemma":[0.00032343404,0.00018815126,0.000024636109,0.0003908376,0.00015013904,0.0011538673,0.00016124401,0.00023291963,0.0000021790781],"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.00017589369,0.0010361497,0.03938847,0.00035171013,0.000081612554,0.00011475914,0.06663756,0.014362424,0.0005268551,0.19004022,0.0004371008,0.68684727],"study_design_scores_gemma":[0.001430192,0.00013967331,0.0148978885,0.0001726996,0.000016409474,0.00014346237,0.0019660834,0.96845937,0.000014070244,0.0036214115,0.008765621,0.00037311183],"about_ca_topic_score_codex":0.00013808325,"about_ca_topic_score_gemma":0.000015936148,"teacher_disagreement_score":0.954097,"about_ca_system_score_codex":0.000015826816,"about_ca_system_score_gemma":0.000046336827,"threshold_uncertainty_score":0.7672586},"labels":[],"label_agreement":null},{"id":"W1841239429","doi":"10.1002/cpe.1807","title":"Distributed re‐arrangement scheme for balancing computational load and minimizing communication delays in HLA‐based simulations","year":2011,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Distributed computing; Computer science; High-level architecture; Single point of failure; Load balancing (electrical power); Scheme (mathematics); Synchronization (alternating current); Computer network; Grid","score_opus":0.20206284961077667,"score_gpt":0.45062351224795655,"score_spread":0.24856066263717988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1841239429","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.30354732,0.00060207787,0.6939809,0.000960692,0.000037475358,0.00045552515,0.000038149985,0.000039330127,0.00033854324],"genre_scores_gemma":[0.9187035,0.000048125068,0.08070609,0.00035048043,0.000008873933,0.00010822341,0.000063512845,0.0000051153843,0.0000060668094],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848235,0.00012780906,0.00055076764,0.0003861753,0.00031489413,0.00013798544],"domain_scores_gemma":[0.99597025,0.0029120378,0.0003078205,0.0001818788,0.00054856524,0.000079455756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085506536,0.00011940585,0.00016230039,0.00012561506,0.00040852604,0.00018189546,0.00014047272,0.000057994068,0.000028746426],"category_scores_gemma":[0.0013033232,0.00011552567,0.000021940812,0.0003907822,0.00015682801,0.00086332305,0.000071894865,0.00009688074,0.0000017299892],"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.00074711407,0.0013621348,0.12434344,0.00014694838,0.00007384716,0.0000071482223,0.14238138,0.06153128,0.0015868368,0.1378257,0.0022778695,0.5277163],"study_design_scores_gemma":[0.0009792867,0.00007958653,0.021185575,0.000046089295,0.000015168033,0.000004874044,0.008114847,0.93659574,0.00012887953,0.026956577,0.0056928555,0.00020053016],"about_ca_topic_score_codex":0.000058984817,"about_ca_topic_score_gemma":0.000020561967,"teacher_disagreement_score":0.87506443,"about_ca_system_score_codex":0.000030163726,"about_ca_system_score_gemma":0.00006836523,"threshold_uncertainty_score":0.4711},"labels":[],"label_agreement":null},{"id":"W1848498137","doi":"10.1002/cpe.1826","title":"Tsunami: massively parallel homomorphic hashing on many‐core GPUs","year":2011,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Alberta","funders":"Hong Kong Baptist University; Nvidia","keywords":"Computer science; Homomorphic encryption; Massively parallel; Parallel computing; Multi-core processor; Hash function; Core (optical fiber); Computer security; Encryption; Telecommunications","score_opus":0.07882458477301257,"score_gpt":0.3203773420037976,"score_spread":0.241552757230785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1848498137","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.08582632,0.0011782526,0.90868944,0.0004911428,0.00058533996,0.00018194468,0.0000036591657,0.00018079668,0.0028631054],"genre_scores_gemma":[0.9461587,0.00042787715,0.052500088,0.0007928303,0.000042068732,0.000031493844,0.0000049495297,0.000008378006,0.000033598655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986337,0.00008734836,0.00025166516,0.0005475318,0.00024732834,0.0002324526],"domain_scores_gemma":[0.99897045,0.00028506565,0.000214406,0.00026189102,0.000116563424,0.00015159923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020603476,0.00018356803,0.00015983233,0.000077652614,0.00042236812,0.00026942947,0.00034966617,0.000065442655,0.000015922502],"category_scores_gemma":[0.00014561125,0.00016142668,0.000023871466,0.00019396229,0.00013149645,0.0025307904,0.00027000986,0.00021405058,0.000030414334],"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.00010874656,0.00031448842,0.000987927,0.000040148938,0.000025688125,0.00017982027,0.047085535,0.00007424238,0.00019633019,0.29429844,0.00087973225,0.6558089],"study_design_scores_gemma":[0.0031388327,0.0019775422,0.030673526,0.00048205542,0.000067545625,0.00095953344,0.012369052,0.862791,0.0008480441,0.043760713,0.041079037,0.0018531169],"about_ca_topic_score_codex":0.0000610665,"about_ca_topic_score_gemma":7.4075194e-7,"teacher_disagreement_score":0.86271673,"about_ca_system_score_codex":0.000011023609,"about_ca_system_score_gemma":0.000041489504,"threshold_uncertainty_score":0.65827894},"labels":[],"label_agreement":null},{"id":"W1848954124","doi":"10.1002/cpe.3239","title":"Characterizing the scalability of a Web application on a multi‒core server","year":2014,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Cloud Computing and Resource Management","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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Workload; Scalability; Server; Web server; Server farm; Application server; Operating system; Computer network; Web application; The Internet; Client–server model","score_opus":0.0280257403961546,"score_gpt":0.30849375334404155,"score_spread":0.280468012947887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1848954124","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.7733742,0.00013350355,0.22388187,0.001819794,0.00012465053,0.00016621222,3.845848e-7,0.000047054305,0.00045235432],"genre_scores_gemma":[0.99639976,0.000019363724,0.0026983453,0.00081122515,0.000030644227,0.000025942183,8.812261e-7,0.000002814628,0.00001101873],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990135,0.00013851203,0.00021948449,0.0003357933,0.00017943868,0.00011328465],"domain_scores_gemma":[0.9988173,0.0005534926,0.00021635254,0.00027093638,0.000094553674,0.000047327576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055934134,0.00010049812,0.00011189745,0.000035799858,0.00024253548,0.00010156192,0.00022884956,0.000028821021,6.913311e-7],"category_scores_gemma":[0.00022135995,0.00007269036,0.000022176851,0.00020421245,0.00012607287,0.00013608662,0.00019067107,0.00010973151,0.000003596635],"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.000029257342,0.00023616423,0.0022402052,0.00008854987,0.000017060584,0.0000010276997,0.022434236,0.00083163957,0.0013384974,0.09495789,0.00003390418,0.8777916],"study_design_scores_gemma":[0.000371311,0.00014778238,0.015475787,0.000046513498,0.000009636786,0.000013158683,0.0011864065,0.9748564,0.00022832386,0.00080506445,0.006724925,0.00013473023],"about_ca_topic_score_codex":0.000021829432,"about_ca_topic_score_gemma":0.000001040812,"teacher_disagreement_score":0.9740247,"about_ca_system_score_codex":0.0000073982496,"about_ca_system_score_gemma":0.000014866363,"threshold_uncertainty_score":0.29642266},"labels":[],"label_agreement":null},{"id":"W1857811639","doi":"10.1002/cpe.3106","title":"A performance evaluation of mobility management and multihop supplying partner strategies for 3D streaming systems over thin mobile devices","year":2013,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"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 Ottawa; Natural Sciences and Engineering Research Council of Canada","funders":"Canada Research Chairs","keywords":"Computer science; Computer network; Scalability; Network packet; Mobile device; Wireless network; Protocol (science); Packet loss; Bandwidth (computing); Wireless; Telecommunications; World Wide Web","score_opus":0.04198130908628272,"score_gpt":0.349121365128016,"score_spread":0.3071400560417333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1857811639","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.833623,0.0018736513,0.16292092,0.00008155275,0.00014099617,0.0011120453,0.0000017844728,0.00006327208,0.00018276568],"genre_scores_gemma":[0.9663825,0.00018978598,0.03236207,0.00005162546,0.0000110815035,0.0009892539,0.0000028608965,0.0000034911957,0.000007349271],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987456,0.00008975218,0.00028748316,0.0004039795,0.0002950779,0.0001780855],"domain_scores_gemma":[0.99881524,0.0003862401,0.00020709791,0.00018527509,0.00035441507,0.000051720108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066279323,0.0001321799,0.0001561851,0.000080228696,0.00019937767,0.00036710015,0.00018000208,0.000046779627,0.0000020267153],"category_scores_gemma":[0.00009680315,0.00011948382,0.000011595965,0.00019939317,0.00010667167,0.0029238274,0.00019334836,0.00006698032,9.719579e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015923597,0.0000833785,0.0040617273,0.00033490444,0.00003007561,6.5242546e-7,0.01878307,0.013887503,0.00016027664,0.007357037,0.000092010625,0.95519346],"study_design_scores_gemma":[0.00037610112,0.00018075539,0.013193643,0.000097790726,0.000026934473,0.000008058222,0.018384922,0.9662297,0.00007447279,0.000603987,0.00067006395,0.00015360571],"about_ca_topic_score_codex":0.00008541642,"about_ca_topic_score_gemma":0.000003460567,"teacher_disagreement_score":0.95503986,"about_ca_system_score_codex":0.00001919066,"about_ca_system_score_gemma":0.00003721403,"threshold_uncertainty_score":0.48724088},"labels":[],"label_agreement":null},{"id":"W1864524337","doi":"10.1002/cpe.3215","title":"Exudates and optic disk detection in retinal images of diabetic patients","year":2014,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Retinal Imaging and Analysis","field":"Medicine","cited_by":10,"is_retracted":false,"has_abstract":true,"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":"Fundus (uterus); Retinal; Diabetic retinopathy; Computer science; Optic disc; Artificial intelligence; Optic disk; Ophthalmology; Computer vision; Blindness; Optometry; Medicine; Diabetes mellitus","score_opus":0.00914793945874287,"score_gpt":0.3079026110818377,"score_spread":0.2987546716230948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1864524337","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.99472904,0.0005688721,0.004005415,0.00013662317,0.00003211581,0.000060945174,5.8461495e-7,0.000007594248,0.0004588251],"genre_scores_gemma":[0.998553,0.0002781541,0.0010816078,0.000056271958,0.000010001263,0.0000066311727,0.0000039737465,0.0000024309313,0.000007959799],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9994213,0.000068092726,0.00017400621,0.00016805,0.000093936505,0.000074590316],"domain_scores_gemma":[0.9995015,0.00020076064,0.00010774013,0.000046087116,0.000094641655,0.000049243106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001480523,0.000066320434,0.00013867783,0.00006632322,0.000050705472,0.000023730121,0.000015748286,0.000020310046,0.0000033243145],"category_scores_gemma":[0.0005367987,0.000057745427,0.000010899935,0.000116085146,0.00014405088,0.00029711224,0.000019008885,0.000074080286,5.2632134e-7],"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.0001871283,0.00022669941,0.44243023,0.00024202006,0.000019633315,0.0000065771064,0.011752705,0.0000068011714,0.0031335873,0.00020293136,0.0000073457404,0.54178435],"study_design_scores_gemma":[0.0022146609,0.001253653,0.91387814,0.0004070947,0.00024375792,0.00008979921,0.011127065,0.061442032,0.008258247,0.0005344963,0.00028410924,0.0002669602],"about_ca_topic_score_codex":0.00005694328,"about_ca_topic_score_gemma":7.058037e-7,"teacher_disagreement_score":0.5415174,"about_ca_system_score_codex":0.000004113686,"about_ca_system_score_gemma":0.0000068280738,"threshold_uncertainty_score":0.23547901},"labels":[],"label_agreement":null},{"id":"W1866240378","doi":"10.1002/cpe.3272","title":"Cube data model for multilevel statistics computation of live execution traces","year":2014,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Time Series Analysis and Forecasting","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"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; TRACE (psycholinguistics); Tracing; Process (computing); Data stream mining; Data mining; Range (aeronautics); Architecture; Data cube; Programming language","score_opus":0.08330911937275667,"score_gpt":0.3600327261437425,"score_spread":0.27672360677098584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1866240378","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.015841307,0.00044127903,0.9831403,0.00018291979,0.00010904676,0.00014184942,0.00003932088,0.000027542692,0.00007641709],"genre_scores_gemma":[0.7369493,0.00010495019,0.26277214,0.00007975244,0.000019444798,0.000009926269,0.000051093422,0.0000034677498,0.000009896438],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988475,0.000072835486,0.00035040136,0.0004177093,0.0001713831,0.00014018295],"domain_scores_gemma":[0.9983371,0.0007066692,0.0003792049,0.0001965017,0.00031536337,0.000065160384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042850364,0.000117080504,0.00018464137,0.000054229266,0.00023616219,0.00015553909,0.00025258245,0.00004052296,0.0000011627427],"category_scores_gemma":[0.00056083844,0.000113385795,0.000017129696,0.0001169412,0.00011459216,0.0019513756,0.00017610534,0.00006618241,9.275719e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003334086,0.000081310325,0.00007820889,0.00009455628,0.000022270866,5.1806444e-7,0.021632219,0.016644534,0.00016567796,0.06409222,0.0002228211,0.8969323],"study_design_scores_gemma":[0.00033878442,0.00012948691,0.0002172726,0.00003069759,0.000032413467,0.000009969874,0.0015541405,0.99231684,0.00004808783,0.0046793283,0.00050580554,0.00013716733],"about_ca_topic_score_codex":0.00003547317,"about_ca_topic_score_gemma":0.0000040920904,"teacher_disagreement_score":0.9756723,"about_ca_system_score_codex":0.0000059132244,"about_ca_system_score_gemma":0.000041944168,"threshold_uncertainty_score":0.46237385},"labels":[],"label_agreement":null},{"id":"W1877880043","doi":"10.1002/cpe.3121","title":"On the distributed orchestration of stochastic discrete event simulations","year":2013,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":5,"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 Guelph","funders":"","keywords":"Discrete event simulation; Event (particle physics); Computer science; Orchestration; Discrete event dynamic system; Stochastic simulation; Distributed computing; Stochastic process; Probability distribution; Mathematical optimization; Theoretical computer science; Algorithm; Simulation; Mathematics; Discrete system; Statistics","score_opus":0.09420576302729669,"score_gpt":0.44233888036605745,"score_spread":0.34813311733876073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1877880043","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.40948334,0.00004999545,0.5870534,0.0028172878,0.000034650784,0.00029521255,0.0000141578685,0.000016114329,0.00023582063],"genre_scores_gemma":[0.99913806,0.000008913689,0.0004976465,0.00023187057,0.000012156896,0.00007041877,0.0000135542905,0.0000025553516,0.000024801171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881905,0.0001260532,0.00039264924,0.00022898249,0.00035207163,0.00008120949],"domain_scores_gemma":[0.9941989,0.0048870197,0.00028935625,0.00017830144,0.00039392436,0.000052465435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003159705,0.00007992961,0.00009908444,0.00005227572,0.0002788819,0.00018437846,0.00012698348,0.000031693846,0.00012859039],"category_scores_gemma":[0.0027075107,0.00005115597,0.000021485084,0.00035022924,0.00017262586,0.0006581126,0.000040634146,0.00008296802,0.000015709853],"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.000057314224,0.00027097826,0.0010843545,0.000010775123,0.000024521943,5.039335e-7,0.01650232,0.06730036,0.0017786275,0.6732073,0.0026696133,0.23709337],"study_design_scores_gemma":[0.0002544401,0.00016747204,0.01019714,0.0000281087,0.0000173981,0.00000679615,0.008857879,0.75858057,0.00042884098,0.21991086,0.0013850421,0.00016548579],"about_ca_topic_score_codex":0.000030804167,"about_ca_topic_score_gemma":9.4714585e-7,"teacher_disagreement_score":0.6912802,"about_ca_system_score_codex":0.0000065231507,"about_ca_system_score_gemma":0.000025232928,"threshold_uncertainty_score":0.32413387},"labels":[],"label_agreement":null},{"id":"W1885757723","doi":"10.1002/cpe.2824","title":"Graphics processing unit pricing of exotic cross‐currency interest rate derivatives with a foreign exchange volatility skew model","year":2012,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":19,"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 Toronto; University of Waterloo","funders":"","keywords":"Discretization; Computer science; Skew; Graphics processing unit; Parallel computing; Interest rate derivative; Swap (finance); Graphics; Local volatility; Volatility (finance); Computational science; Stochastic volatility; Econometrics; Interest rate; Mathematics; Economics; Computer graphics (images); Finance","score_opus":0.12135542150946166,"score_gpt":0.33009971055984977,"score_spread":0.2087442890503881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1885757723","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.38574448,0.005255414,0.6081065,0.000051020554,0.00003124793,0.00013218695,0.000013296603,0.000013171479,0.0006526682],"genre_scores_gemma":[0.994055,0.00029976355,0.0054381937,0.00008530828,0.000027274895,0.0000710124,0.000007894299,0.000008344671,0.0000072409257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906236,0.000011599786,0.00040374874,0.00028144242,0.000038584963,0.00020228676],"domain_scores_gemma":[0.99894226,0.00018013212,0.00052317034,0.000099425204,0.00016961459,0.00008540141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033021663,0.00013730655,0.00022499997,0.00008986721,0.00024993427,0.000079397614,0.000085609936,0.000051089908,0.0000049826017],"category_scores_gemma":[0.00030852755,0.00013510819,0.000018726329,0.00035015336,0.00026290413,0.0012696892,0.000053772415,0.00012455591,0.000001659648],"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.00006523757,0.00019404662,0.028180612,0.0003480239,0.000015397121,6.179144e-7,0.027178766,0.00005518581,0.000028994325,0.91933006,0.0000022081792,0.024600843],"study_design_scores_gemma":[0.0016507722,0.0004625117,0.11227955,0.00039544338,0.00006903935,0.00009268279,0.008658651,0.49053612,0.00020099114,0.38321462,0.0014572806,0.0009823493],"about_ca_topic_score_codex":0.000037606973,"about_ca_topic_score_gemma":0.0000028235395,"teacher_disagreement_score":0.60831046,"about_ca_system_score_codex":0.000009644894,"about_ca_system_score_gemma":0.000037980164,"threshold_uncertainty_score":0.55095524},"labels":[],"label_agreement":null},{"id":"W1894778686","doi":"10.1002/cpe.1814","title":"Energy management control for supplying partner selection protocol in mobile peer‐to‐peer three‐dimensional streaming","year":2011,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"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 Ottawa","funders":"","keywords":"Computer science; Bottleneck; Computer network; Protocol (science); Peer-to-peer; Energy (signal processing); Efficient energy use; Distributed computing; Mobile device; Latency (audio); Energy management; Control (management); Selection (genetic algorithm); Telecommunications; Engineering; Operating system; Embedded system","score_opus":0.03509517992922094,"score_gpt":0.3335421077200209,"score_spread":0.29844692779079995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1894778686","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.022740254,0.000055219585,0.96599805,0.0010299617,0.00017277135,0.009548196,0.0000022821835,0.00014902586,0.0003042463],"genre_scores_gemma":[0.8609613,0.0000029818311,0.08847645,0.0006616197,0.000024153787,0.049790323,0.0000029920866,0.0000071854406,0.000072951276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984872,0.000055640397,0.00029172454,0.00054967287,0.0003144747,0.00030131373],"domain_scores_gemma":[0.9990416,0.0002550021,0.00012544221,0.0001551268,0.0003241142,0.00009868738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043060665,0.00016587671,0.00016287567,0.00018657377,0.00021289935,0.00015498196,0.00025601676,0.000061611994,0.000004484678],"category_scores_gemma":[0.00014867367,0.0001616261,0.000019765857,0.00044625968,0.00005078852,0.001074083,0.00020365197,0.0001022589,0.0000031447858],"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.00020844261,0.00020435292,0.002063497,0.000042589392,0.0000264683,0.000018958723,0.011363194,0.0026797198,0.00018031451,0.042612124,0.0011614821,0.9394389],"study_design_scores_gemma":[0.003943169,0.0020036234,0.0085587455,0.00021082288,0.000038385588,0.00011803785,0.003768146,0.76312816,0.002133368,0.015565084,0.19947408,0.0010583891],"about_ca_topic_score_codex":0.00006817078,"about_ca_topic_score_gemma":0.00003194633,"teacher_disagreement_score":0.9383805,"about_ca_system_score_codex":0.00003122957,"about_ca_system_score_gemma":0.00003258386,"threshold_uncertainty_score":0.65909207},"labels":[],"label_agreement":null},{"id":"W1901179229","doi":"10.1002/cpe.3234","title":"Batchsubmit: a high‐volume batch submission system for earthquake engineering simulation","year":2014,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed and Parallel Computing Systems","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":"Advanced Micro Devices (Canada)","funders":"Division of Civil, Mechanical and Manufacturing Innovation; Lawrence Livermore National Laboratory; U.S. Department of Energy; National Science Foundation","keywords":"Cyberinfrastructure; Science and engineering; Gateway (web page); Computer science; Server; Volume (thermodynamics); Grid; World Wide Web; Operating system; Engineering; Geology","score_opus":0.015361885062783449,"score_gpt":0.2819736982768888,"score_spread":0.2666118132141053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1901179229","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.13366711,0.0002783236,0.86450076,0.0002904785,0.0007032343,0.00022634113,0.0000030100973,0.00018622386,0.0001445061],"genre_scores_gemma":[0.98652816,0.000011414239,0.013159278,0.00008839209,0.00012328988,0.000040754283,0.000014782773,0.000007630043,0.00002628366],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986718,0.00011150883,0.00032525565,0.00045765322,0.00019809313,0.00023566082],"domain_scores_gemma":[0.9983436,0.000918675,0.0002074712,0.00018150819,0.00021360272,0.00013514968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048101312,0.0001684411,0.00020092487,0.0000648843,0.00030904223,0.00039755457,0.00019477641,0.00007348781,0.000001016942],"category_scores_gemma":[0.00037899087,0.0001659068,0.000030637002,0.00021334918,0.000030795894,0.0010911775,0.0000859969,0.00009733452,0.0000068728377],"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.000090458176,0.000113873866,0.0008336226,0.0007006474,0.000042671196,0.000008702142,0.020135371,0.24166779,0.00039890254,0.14638002,0.0003686184,0.5892593],"study_design_scores_gemma":[0.00056349055,0.0001481239,0.0018051335,0.00010636452,0.000010631834,0.00003923883,0.00042007104,0.97031635,0.00004694066,0.00018602086,0.026139082,0.00021853289],"about_ca_topic_score_codex":0.000024777593,"about_ca_topic_score_gemma":2.7247367e-7,"teacher_disagreement_score":0.85286105,"about_ca_system_score_codex":0.000018158114,"about_ca_system_score_gemma":0.000029990917,"threshold_uncertainty_score":0.67654824},"labels":[],"label_agreement":null},{"id":"W1902521824","doi":"10.1002/cpe.1872","title":"Experiences in building and scaling an enterprise application on multicore systems","year":2011,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); IBI Group (Canada)","funders":"","keywords":"Computer science; Scalability; Multi-core processor; Java; Benchmark (surveying); Operating system; Software; Rendering (computer graphics); Parallel computing; Distributed computing","score_opus":0.03543385766454156,"score_gpt":0.32385591362574234,"score_spread":0.2884220559612008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1902521824","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.78031677,0.00083871046,0.2181819,0.000034996978,0.00025529333,0.00020198131,3.0162363e-7,0.00005392236,0.000116113086],"genre_scores_gemma":[0.99361306,0.0001997539,0.005906065,0.00010459946,0.00002340728,0.00014725236,9.212283e-7,0.0000035633914,0.0000013611351],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875647,0.00012515068,0.0002917382,0.00050512765,0.00015728817,0.00016424007],"domain_scores_gemma":[0.99925303,0.0002294789,0.00015331722,0.0001842791,0.000075639124,0.00010425087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039949353,0.00013103239,0.00014740425,0.00009033016,0.0002058896,0.00018413409,0.00017001746,0.00005876349,8.932542e-7],"category_scores_gemma":[0.000114672854,0.000113605965,0.000009898792,0.00019296883,0.00012964834,0.0022418401,0.0000852349,0.00011206638,0.0000017380456],"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.00008122809,0.00026857096,0.035697952,0.00013179923,0.00000725361,0.000013479918,0.53241163,0.00019697513,0.00029311943,0.015948812,0.000003847386,0.4149453],"study_design_scores_gemma":[0.0008717422,0.0005359983,0.03298229,0.00027414385,0.000009912484,0.00016648191,0.09913723,0.8635143,0.000640156,0.0008500624,0.00050709635,0.0005105654],"about_ca_topic_score_codex":0.00020582831,"about_ca_topic_score_gemma":0.0000016821853,"teacher_disagreement_score":0.8633174,"about_ca_system_score_codex":0.0000144898195,"about_ca_system_score_gemma":0.000022672042,"threshold_uncertainty_score":0.46327168},"labels":[],"label_agreement":null},{"id":"W1918106294","doi":"10.1002/cpe.3503","title":"Hyper‐star graphs: Some topological properties and an optimal neighbourhood broadcasting algorithm","year":2015,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Neighbourhood (mathematics); Combinatorics; Star (game theory); Mathematics; Graph; A* search algorithm; Discrete mathematics; Hypercube; Algorithm; Computer science","score_opus":0.08408094310322434,"score_gpt":0.32253054664030634,"score_spread":0.238449603537082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1918106294","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.6227013,0.0053470563,0.3699312,0.00056246994,0.0007518468,0.0001616175,0.0000010627298,0.00011173379,0.0004317185],"genre_scores_gemma":[0.9789729,0.00021587936,0.02011971,0.0005042125,0.00013901213,0.000024856809,0.0000017711351,0.000004630469,0.000017003365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865335,0.00020883902,0.00026819963,0.0004601865,0.00019238939,0.00021700855],"domain_scores_gemma":[0.9991545,0.00015232747,0.00014082382,0.00012516542,0.00020422728,0.00022295192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040767618,0.0001551132,0.0001765739,0.000059449518,0.00032945146,0.00055073644,0.00015501874,0.00006941189,0.000002984576],"category_scores_gemma":[0.00017925788,0.00012623885,0.000016705451,0.00014743452,0.00018053038,0.0035922446,0.00015443507,0.00015750836,0.0000024463857],"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.00006716091,0.00016299533,0.0005032439,0.000031658044,0.000023601122,0.000040193718,0.076931275,0.00043641686,0.00016153228,0.075011,0.000112324735,0.8465186],"study_design_scores_gemma":[0.0006420843,0.0008753854,0.00031848915,0.0000533243,0.000011783079,0.00080577336,0.027235035,0.96366024,0.00010489305,0.0030247115,0.002929022,0.0003392431],"about_ca_topic_score_codex":0.00006265031,"about_ca_topic_score_gemma":0.0000010262405,"teacher_disagreement_score":0.9632238,"about_ca_system_score_codex":0.000010883118,"about_ca_system_score_gemma":0.000047397323,"threshold_uncertainty_score":0.53107643},"labels":[],"label_agreement":null},{"id":"W1934208600","doi":"10.1002/cpe.3695","title":"Computing probable maximum loss in catastrophe reinsurance portfolios on multi‐core and many‐core architectures","year":2015,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Reinsurance; Portfolio; Computer science; Multi-core processor; Petascale computing; Natural disaster; Natural hazard; Storm; Supercomputer; Actuarial science; Meteorology; Parallel computing; Finance; Economics","score_opus":0.13009492035308984,"score_gpt":0.4146381363978724,"score_spread":0.28454321604478255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1934208600","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.95271844,0.001735602,0.04383571,0.00043584107,0.00028072912,0.00028217683,0.0000065200907,0.00003034931,0.00067460333],"genre_scores_gemma":[0.9907684,0.00049119245,0.008247241,0.00036648865,0.000044719218,0.0000140927905,0.0000108774575,0.000007809794,0.000049230024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793667,0.00015430112,0.00053433294,0.0006126985,0.000518987,0.00024299357],"domain_scores_gemma":[0.9982575,0.00069730106,0.00037999236,0.00018968905,0.00028005108,0.00019544212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010188698,0.00019081576,0.00025275178,0.00019838735,0.00023104333,0.00027839534,0.00015559164,0.000072636685,0.000005277152],"category_scores_gemma":[0.0017598298,0.00015486074,0.000018793638,0.0005081864,0.00023959516,0.0007065159,0.000110357185,0.00022748523,0.000008839081],"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.0004505431,0.00023022889,0.18478815,0.00002316839,0.0000122504425,0.00014997227,0.05304559,0.048618793,0.000056623558,0.004271607,0.0007118516,0.70764124],"study_design_scores_gemma":[0.0047149113,0.00094916736,0.18222821,0.00028125878,0.000035536494,0.0009056015,0.036487326,0.72882074,0.00016323809,0.028115204,0.016254788,0.001044009],"about_ca_topic_score_codex":0.00009617676,"about_ca_topic_score_gemma":0.000016800484,"teacher_disagreement_score":0.7065972,"about_ca_system_score_codex":0.000015361558,"about_ca_system_score_gemma":0.00007930709,"threshold_uncertainty_score":0.63150376},"labels":[],"label_agreement":null},{"id":"W1943450596","doi":"10.1002/cpe.1785","title":"Real‐time helpfulness prediction based on voter opinions","year":2011,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":8,"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 Ottawa","funders":"","keywords":"Helpfulness; Computer science; Machine learning; Data mining; Convergence (economics); Artificial intelligence; Algorithm","score_opus":0.040745024782646744,"score_gpt":0.31074389322423623,"score_spread":0.2699988684415895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1943450596","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.10261724,0.0001857524,0.88193154,0.0012057744,0.000859682,0.00022501581,0.000006136064,0.00021768207,0.012751146],"genre_scores_gemma":[0.98610723,0.00008779361,0.013251497,0.0004166765,0.000042076423,0.000027816104,0.000017350056,0.0000044541684,0.0000451226],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988908,0.0001152549,0.00023093754,0.00040585175,0.0002063698,0.00015077376],"domain_scores_gemma":[0.99920094,0.0002593554,0.00015195784,0.00018345726,0.00010555837,0.000098710705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023423266,0.00012570848,0.0001244578,0.00011000276,0.0002828582,0.00016420598,0.0001604614,0.00004537663,0.00004157707],"category_scores_gemma":[0.00008014596,0.00011575084,0.000029124089,0.00026090365,0.00007444496,0.00132879,0.00006902861,0.00009118853,0.000024967063],"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.00027330467,0.0012451909,0.011957915,0.00008425783,0.00013483544,0.000058652833,0.11230138,0.0009681669,0.0011127983,0.14304008,0.0030197972,0.7258036],"study_design_scores_gemma":[0.0006658658,0.0004179542,0.011292698,0.00007470031,0.00002874335,0.00002351748,0.0017518094,0.9804335,0.0008680507,0.0009892021,0.0031526026,0.00030131402],"about_ca_topic_score_codex":0.000028530303,"about_ca_topic_score_gemma":2.4040236e-7,"teacher_disagreement_score":0.97946537,"about_ca_system_score_codex":0.000009125158,"about_ca_system_score_gemma":0.00003461564,"threshold_uncertainty_score":0.4720182},"labels":[],"label_agreement":null},{"id":"W1944708231","doi":"10.1002/cpe.1784","title":"An efficient graphics processing unit‐based parallel algorithm for pricing multi‐asset American options","year":2011,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":27,"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 Toronto","funders":"","keywords":"Computer science; Graphics processing unit; Graphics; Complementarity (molecular biology); Parallel computing; Mathematical optimization; Linear complementarity problem; Valuation of options; Algorithm; Mathematics; Computer graphics (images)","score_opus":0.08426280087602969,"score_gpt":0.3369720426031249,"score_spread":0.2527092417270952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1944708231","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.021067051,0.0014594883,0.97676283,0.00012637631,0.000079432095,0.00028173046,0.000047132085,0.00004010963,0.00013583375],"genre_scores_gemma":[0.77270186,0.000098267854,0.2266558,0.00027781766,0.000023611798,0.00021025087,0.000021941334,0.000008255606,0.000002189455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990638,0.0000085309675,0.0003245907,0.00039013274,0.000033767123,0.0001791903],"domain_scores_gemma":[0.9991479,0.00012279472,0.00038130555,0.00010278398,0.00014769021,0.000097511554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021733425,0.00012012954,0.00017825239,0.000107298336,0.00045261523,0.00009753012,0.000098172146,0.000039373474,0.0000028746542],"category_scores_gemma":[0.0001313414,0.00013557053,0.000023885721,0.0003387472,0.0002119197,0.0004413592,0.000019005785,0.00008787206,0.0000031522763],"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.00004722527,0.0007003323,0.0016779341,0.00006971384,0.000015285448,0.0000015292532,0.020633372,0.0006228148,0.000015848507,0.6498613,0.000006513479,0.32634816],"study_design_scores_gemma":[0.0005550489,0.00023998356,0.0076313904,0.00001945543,0.000016075168,0.000007949911,0.0037265404,0.9736021,0.000014117659,0.012490403,0.0014359226,0.00026098525],"about_ca_topic_score_codex":0.00017566553,"about_ca_topic_score_gemma":0.000004109888,"teacher_disagreement_score":0.9729793,"about_ca_system_score_codex":0.000009609733,"about_ca_system_score_gemma":0.00004062758,"threshold_uncertainty_score":0.5528406},"labels":[],"label_agreement":null},{"id":"W1946135105","doi":"10.1002/cpe.3420","title":"P2Pedia: a peer‐to‐peer wiki for decentralized collaboration","year":2014,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Wikis in Education and Collaboration","field":"Social Sciences","cited_by":4,"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":"","keywords":"Computer science; Synchronizing; World Wide Web; Peer-to-peer; Selection (genetic algorithm); Process (computing); Collaborative editing; Social network (sociolinguistics); File sharing; Information retrieval; Social media; The Internet","score_opus":0.027472966193683414,"score_gpt":0.42676001253430085,"score_spread":0.39928704634061746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1946135105","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.5163067,0.0008419219,0.32987055,0.13077103,0.0050434526,0.0018138307,0.000020775733,0.00018451612,0.01514722],"genre_scores_gemma":[0.99023855,0.00021796308,0.0065450785,0.0017058577,0.0002620932,0.00018748129,0.000025949004,0.0000057044026,0.0008113143],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987832,0.00021511845,0.00020249299,0.00026283858,0.00035815945,0.00017819101],"domain_scores_gemma":[0.99748605,0.0006620021,0.0001358592,0.0000690298,0.0014788706,0.00016817135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093086244,0.00008962063,0.00010659544,0.000056853154,0.000748539,0.00040610018,0.00007330568,0.00006654609,0.000023966708],"category_scores_gemma":[0.0059086354,0.0000956952,0.000012969213,0.0004127457,0.00013275305,0.0010927476,0.000015862046,0.0000563438,0.00000914195],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015769117,0.00014365836,0.0010006756,0.000026711154,0.000012501581,3.708902e-7,0.3750562,0.00009176411,0.00019988653,0.33677056,0.022214375,0.2643256],"study_design_scores_gemma":[0.00044918462,0.00011466865,0.00049271097,0.000011811645,0.000018317585,0.0000013726996,0.08617373,0.0021877266,0.00006775327,0.0025527722,0.9077776,0.00015237422],"about_ca_topic_score_codex":0.00010615409,"about_ca_topic_score_gemma":0.00012782248,"teacher_disagreement_score":0.8855632,"about_ca_system_score_codex":0.000032616575,"about_ca_system_score_gemma":0.00023070814,"threshold_uncertainty_score":0.7073615},"labels":[],"label_agreement":null},{"id":"W1947115020","doi":"10.1002/cpe.2907","title":"Parallel computing strategies in the analysis of the inhibiting effect of price limits on futures prices","year":2012,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Complex Systems and Time Series Analysis","field":"Economics, Econometrics and Finance","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; McMaster University","funders":"","keywords":"Futures contract; Limit (mathematics); Currency; Cluster (spacecraft); Computer science; Series (stratigraphy); Economics; Econometrics; Financial economics; Mathematics; Monetary economics","score_opus":0.03227067445693936,"score_gpt":0.3031117327399566,"score_spread":0.27084105828301724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1947115020","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.98732316,0.005374154,0.003698639,0.00015474242,0.00008939276,0.00013186572,0.0000053001654,0.0000037671252,0.0032190017],"genre_scores_gemma":[0.9995949,0.00011233591,0.00018266504,0.00006707118,0.000026884325,0.00000765756,0.000002421249,0.0000024692079,0.0000035542696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9990703,0.0001151333,0.000454661,0.0001658034,0.000065840315,0.00012826126],"domain_scores_gemma":[0.9981982,0.0009605573,0.0006694547,0.00011592459,0.000034204888,0.000021666387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088138244,0.000094254465,0.0003116309,0.00013736433,0.00015776967,0.000066543755,0.000113879534,0.000030772004,0.0000102935655],"category_scores_gemma":[0.00024578214,0.00006266006,0.00007017068,0.0007753664,0.00009183163,0.000482404,0.00003901625,0.00009743305,8.0576166e-7],"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.000099702964,0.00022709646,0.28968012,0.00024741096,0.00044814404,0.0000010037764,0.1539016,0.010502342,0.00007536373,0.52192754,0.0000326637,0.022857012],"study_design_scores_gemma":[0.00074487115,0.00033441215,0.84322745,0.00012252426,0.0003092575,0.000011590794,0.07998113,0.07119962,0.0001566646,0.0013781054,0.0022042529,0.00033012067],"about_ca_topic_score_codex":0.00037016542,"about_ca_topic_score_gemma":0.000017167502,"teacher_disagreement_score":0.5535473,"about_ca_system_score_codex":0.000006697812,"about_ca_system_score_gemma":0.0000070650262,"threshold_uncertainty_score":0.2555203},"labels":[],"label_agreement":null},{"id":"W1952234003","doi":"10.1002/cpe.3065","title":"RSEL: revocable secure efficient lightweight RFID authentication scheme","year":2013,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"RFID technology advancements","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Fundamental Research Funds for the Central Universities; Ministry of Education of the People's Republic of China; National Natural Science Foundation of China; National Science and Technology Major Project; Strong","keywords":"Computer science; Authentication (law); Hash function; Correctness; Radio-frequency identification; Computer security; Key (lock); Scheme (mathematics); Database; Computer network","score_opus":0.00849781266219176,"score_gpt":0.264465261212887,"score_spread":0.25596744855069525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1952234003","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.926435,0.0034247253,0.06707824,0.0005071073,0.00035031798,0.00027377522,0.0000013700209,0.00027038818,0.0016591034],"genre_scores_gemma":[0.992932,0.00051258714,0.0062862984,0.00009523178,0.000018778908,0.00010317205,0.0000067791657,0.000008775595,0.000036370664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993178,0.000021068665,0.00018596266,0.0002109329,0.000104753126,0.00015947693],"domain_scores_gemma":[0.9995768,0.00009329033,0.000062181265,0.000112299895,0.00009550169,0.000059920443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006971754,0.00011439835,0.00009649884,0.000055415403,0.00013700202,0.000071346876,0.00006975726,0.00006478822,0.0000484011],"category_scores_gemma":[0.000098503246,0.00011407076,0.000009493366,0.00016389374,0.000095851974,0.00075186446,0.00003526592,0.0001337236,0.000065490276],"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.000065041684,0.0006996067,0.0070439577,0.0008382578,0.00027381274,0.00003355396,0.097087204,0.013967551,0.08226681,0.11549239,0.008829451,0.67340237],"study_design_scores_gemma":[0.0009710382,0.00013510081,0.00438711,0.00012911363,0.000043253272,0.00010187423,0.0077242185,0.9253235,0.009627267,0.0039664796,0.046939995,0.00065105734],"about_ca_topic_score_codex":0.0000054525326,"about_ca_topic_score_gemma":2.049353e-7,"teacher_disagreement_score":0.9113559,"about_ca_system_score_codex":0.000015961727,"about_ca_system_score_gemma":0.000008556171,"threshold_uncertainty_score":0.46516705},"labels":[],"label_agreement":null},{"id":"W1955581029","doi":"10.1002/cpe.1827","title":"Dual cryptography authentication protocol and its security analysis for radio frequency identification systems","year":2011,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"RFID technology advancements","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Authentication protocol; Radio-frequency identification; Computer network; Replay attack; Authentication (law); Hash function; Encryption; Cryptography; Hash-based message authentication code; Correctness; Cryptographic protocol; Session key; Computer security; Otway–Rees protocol; Challenge-Handshake Authentication Protocol; Message authentication code","score_opus":0.03220921316326355,"score_gpt":0.3195195573886396,"score_spread":0.28731034422537605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1955581029","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.5860055,0.001846351,0.40079686,0.0000391216,0.00026772323,0.010562477,0.000013069247,0.00021897635,0.0002499471],"genre_scores_gemma":[0.98305297,0.00015639927,0.0019394106,0.000008440313,0.000012591021,0.014807144,0.000013883819,0.0000064169644,0.0000027707415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992431,0.000035966343,0.00026809186,0.00025080147,0.00008363134,0.00011844218],"domain_scores_gemma":[0.9994982,0.00009045941,0.00013455674,0.000094833915,0.00013306085,0.000048881007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017389137,0.00010919379,0.00012692304,0.00016094868,0.00014895161,0.00006601544,0.00004996822,0.00006650373,0.0000039595484],"category_scores_gemma":[0.00010260317,0.000116357885,0.000018230698,0.0003283616,0.000078237856,0.0010018202,0.000015901202,0.00007581823,0.000001389433],"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.00039323486,0.0010641975,0.05236774,0.0029421304,0.0027834296,0.000023926325,0.33645457,0.0017830199,0.02579351,0.43663818,0.00021402717,0.13954206],"study_design_scores_gemma":[0.0030453403,0.00044342023,0.04466607,0.00010605827,0.0010278265,0.00009933664,0.01674557,0.9004902,0.008255579,0.020111343,0.0039248136,0.00108441],"about_ca_topic_score_codex":0.000009335399,"about_ca_topic_score_gemma":0.0000012385508,"teacher_disagreement_score":0.8987072,"about_ca_system_score_codex":0.000009804334,"about_ca_system_score_gemma":0.0000069617986,"threshold_uncertainty_score":0.47449368},"labels":[],"label_agreement":null},{"id":"W1981341755","doi":"10.1002/cpe.1679","title":"Secure SCADA framework for the protection of energy control systems","year":2010,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"British Columbia Institute of Technology","keywords":"SCADA; Computer security; The Internet; Computer science; Control (management); Task (project management); Emerging technologies; Wireless sensor network; Risk analysis (engineering); Engineering; Systems engineering; Computer network; Business; World Wide Web; Electrical engineering","score_opus":0.011038655803051132,"score_gpt":0.2665108632302977,"score_spread":0.2554722074272466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981341755","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.14749673,0.0043830904,0.8459201,0.00023416957,0.0015737283,0.00024940242,0.00000557338,0.00003950647,0.00009774507],"genre_scores_gemma":[0.9985652,0.0004996467,0.00061063975,0.000055906687,0.00012783219,0.00013161312,0.0000011246694,0.0000047165345,0.0000033048163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995348,0.000024488041,0.00014766624,0.000114145696,0.000086814485,0.00009210734],"domain_scores_gemma":[0.9989893,0.00074122596,0.00006986059,0.00007133886,0.00009331741,0.000034957062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013526318,0.00007496688,0.000091156464,0.000020990443,0.00017030834,0.000053240557,0.000060230577,0.000073142626,0.0000021494402],"category_scores_gemma":[0.00024760322,0.0000558812,0.000015496766,0.00008727324,0.00014850576,0.00031331278,0.000008995039,0.00016231756,3.0066488e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030385022,0.00014832523,0.000564274,0.0008981975,0.00017617854,0.000004249388,0.05524402,0.056152213,0.015751097,0.5903542,0.0006102561,0.2797931],"study_design_scores_gemma":[0.00045182786,0.0001221396,0.00040278316,0.00006951785,0.00003908122,0.000071207425,0.0075670527,0.9444527,0.0013536107,0.0022061523,0.04308419,0.00017974681],"about_ca_topic_score_codex":0.000035771955,"about_ca_topic_score_gemma":0.000004390536,"teacher_disagreement_score":0.8883005,"about_ca_system_score_codex":0.0000025254421,"about_ca_system_score_gemma":0.0000129760865,"threshold_uncertainty_score":0.22787692},"labels":[],"label_agreement":null},{"id":"W1995571756","doi":"10.1002/cpe.3484","title":"SDIVIP<sup>2</sup>: shared data integrity verification with identity privacy preserving in mobile clouds","year":2015,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Cloud Data Security Solutions","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Correctness; Cloud computing; Data integrity; Mobile device; Mobile computing; Computer security; Mobile cloud computing; Cloud storage; Computer network; Operating system","score_opus":0.10292230525331082,"score_gpt":0.3762520229677956,"score_spread":0.2733297177144848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995571756","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.47413847,0.0020020977,0.5218867,0.0010063536,0.0001536504,0.00037973002,0.00003605696,0.000098741,0.0002982258],"genre_scores_gemma":[0.9741068,0.00023354117,0.025245257,0.00016426604,0.000034683217,0.000070906266,0.0001325713,0.0000053981153,0.000006605813],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811804,0.00023758522,0.0003199066,0.00072730565,0.00037078175,0.00022640392],"domain_scores_gemma":[0.998213,0.00036265783,0.00019021679,0.00079365476,0.00026760364,0.00017290171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083029905,0.00015492676,0.0001667757,0.000086438624,0.0002058188,0.00064798206,0.0010369449,0.00006416074,0.0000054778743],"category_scores_gemma":[0.0012182469,0.00015148336,0.000009526459,0.00062630756,0.00015398284,0.011899457,0.0012019736,0.00031014407,0.000010508342],"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.00034101336,0.0017913625,0.035447367,0.00029468897,0.00008671313,0.00013126798,0.61705905,0.0044642277,0.00019013045,0.11737838,0.0069447504,0.21587102],"study_design_scores_gemma":[0.0011491011,0.00024614984,0.0057255332,0.00011214869,0.00002094572,0.00014811753,0.015784413,0.94655246,0.000033750843,0.003578321,0.026248613,0.000400452],"about_ca_topic_score_codex":0.0004105486,"about_ca_topic_score_gemma":0.000045215358,"teacher_disagreement_score":0.94208825,"about_ca_system_score_codex":0.000044135726,"about_ca_system_score_gemma":0.00020983221,"threshold_uncertainty_score":0.8626819},"labels":[],"label_agreement":null},{"id":"W2016265567","doi":"10.1002/cpe.1154","title":"Towards building a conflict‐free mobile distributed file system","year":2007,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Operating system; Cache; Self-certifying File System; File system fragmentation; Computer network; File system; Mobile database; Virtual file system; File server; Mobile computing; Distributed File System; Network File System; Distributed computing; Device file; Computer file; Mobile station; SSH File Transfer Protocol; Base station","score_opus":0.022824646860885416,"score_gpt":0.3300688373834963,"score_spread":0.30724419052261087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016265567","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.024117108,0.0018760826,0.9722486,0.00017439612,0.00026808132,0.00019527387,0.00010151632,0.00048443998,0.00053449214],"genre_scores_gemma":[0.90696526,0.00012356987,0.09263831,0.00014320224,0.000024853707,0.0000610924,0.00003312945,0.000004916961,0.0000056767904],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99866074,0.000042912194,0.00029178086,0.00047812375,0.00022313246,0.00030329192],"domain_scores_gemma":[0.9984801,0.0006501595,0.0002235713,0.00037723433,0.00016333358,0.00010562836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003715136,0.0001587125,0.00017337393,0.000086636195,0.00032902273,0.00022645849,0.000494254,0.00007528172,0.000007830768],"category_scores_gemma":[0.0008139586,0.00015377357,0.000018002127,0.0004157657,0.00016832366,0.0023623921,0.0006108211,0.00017465874,0.000005069343],"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.00003540912,0.00009273381,0.00008537757,0.00008995389,0.000019907466,0.00015665864,0.012304077,0.00011367299,0.00054984406,0.34451964,0.0018929945,0.64013976],"study_design_scores_gemma":[0.003379162,0.001258613,0.00291565,0.0004842405,0.000065380795,0.0022214768,0.119688265,0.3020712,0.009656941,0.010159414,0.54607004,0.0020295675],"about_ca_topic_score_codex":0.000023401852,"about_ca_topic_score_gemma":0.0000012940029,"teacher_disagreement_score":0.88284814,"about_ca_system_score_codex":0.000042446016,"about_ca_system_score_gemma":0.000041008458,"threshold_uncertainty_score":0.6270704},"labels":[],"label_agreement":null},{"id":"W2022585781","doi":"10.1002/cpe.3225","title":"A special issue from the international conference on performance engineering 2013","year":2014,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":0,"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 Alberta","funders":"","keywords":"Presentation (obstetrics); Computer science; Track (disk drive); Scalability; Engineering management; Work (physics); Cloud computing; Operations research; Engineering","score_opus":0.01944731550503047,"score_gpt":0.2803042293035841,"score_spread":0.26085691379855364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022585781","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.7250019,0.0003709889,0.24368738,0.013740184,0.006850147,0.00031630226,0.000004610659,0.00018810508,0.009840409],"genre_scores_gemma":[0.9945217,0.00049964985,0.0026577378,0.00095030107,0.001313105,0.00002348442,0.0000035537596,0.0000031692155,0.000027302774],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990578,0.000057209778,0.00019309853,0.00032602187,0.00023468393,0.00013112885],"domain_scores_gemma":[0.99895304,0.000565239,0.00010856092,0.00019501527,0.00011990258,0.000058267196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002929502,0.00011868547,0.00010503849,0.000026763555,0.00021781083,0.00030151184,0.00035966933,0.000041245705,0.000030485087],"category_scores_gemma":[0.00022911048,0.00008528298,0.000016149274,0.00010540908,0.000076757875,0.0012159812,0.00013490612,0.00015585155,0.000046454807],"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.0000531441,0.00008256532,0.004876489,0.000031426225,0.000027378599,0.0000028059355,0.031901766,0.00087582413,0.00011284687,0.037491377,0.007029444,0.9175149],"study_design_scores_gemma":[0.00039078874,0.0001571693,0.010147025,0.000089228466,0.0000065820072,0.000026983735,0.0011010715,0.7570816,0.00014403799,0.0003896291,0.2302485,0.00021733758],"about_ca_topic_score_codex":0.000052006802,"about_ca_topic_score_gemma":0.0000015709987,"teacher_disagreement_score":0.9172976,"about_ca_system_score_codex":0.000012056456,"about_ca_system_score_gemma":0.000027960292,"threshold_uncertainty_score":0.3477739},"labels":[],"label_agreement":null},{"id":"W2025491049","doi":"10.1002/cpe.1730","title":"Towards automated HPC scheduler configuration tuning","year":2011,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":5,"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 Calgary","funders":"","keywords":"Computer science; Workload; Exploit; Scheduling (production processes); Distributed computing; System administrator; Job scheduler; Supercomputer; Operating system; Cloud computing; Computer security","score_opus":0.05162810296010164,"score_gpt":0.3232079087232329,"score_spread":0.2715798057631313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025491049","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.06458748,0.00075592275,0.923357,0.00029045445,0.0005593053,0.00013685846,0.0000014476678,0.00047191858,0.009839619],"genre_scores_gemma":[0.9771813,0.00006788409,0.0223631,0.0003056865,0.000032553813,0.000016763508,0.000008365139,0.0000043492523,0.000019983903],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987657,0.00015284846,0.00029106453,0.00040311576,0.00018639975,0.00020087579],"domain_scores_gemma":[0.9991486,0.00014998441,0.00021092808,0.00016451377,0.0002074724,0.00011849286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031347363,0.00014903382,0.00014971173,0.000064423264,0.00028993434,0.00031121727,0.00022800444,0.000062880514,0.000010614601],"category_scores_gemma":[0.0001769578,0.0001424606,0.000019799605,0.00026892783,0.0000963479,0.0018307242,0.000114015456,0.00012348598,0.000019693336],"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.00006346427,0.00026801229,0.001281976,0.00011544105,0.00007381166,0.00008055188,0.18312238,0.00037597225,0.0008169918,0.3615543,0.0010841136,0.451163],"study_design_scores_gemma":[0.0006993408,0.0002663405,0.0068650357,0.00010613718,0.000019604084,0.00031443354,0.004684762,0.9735807,0.00057023624,0.0021940828,0.010217269,0.00048203854],"about_ca_topic_score_codex":0.000080577236,"about_ca_topic_score_gemma":4.2144978e-7,"teacher_disagreement_score":0.97320473,"about_ca_system_score_codex":0.000010185962,"about_ca_system_score_gemma":0.000071070994,"threshold_uncertainty_score":0.5809375},"labels":[],"label_agreement":null},{"id":"W2035038509","doi":"10.1002/cpe.858","title":"Experience in integrating Java with C# and .NET","year":2005,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":6,"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 Victoria","funders":"National Research Foundation","keywords":"Java applet; Computer science; Java; Java API for XML-based RPC; Real time Java; Java annotation; Java Card; Interfacing; Generics in Java; World Wide Web; strictfp; Operating system","score_opus":0.026930992396828255,"score_gpt":0.3260201638268849,"score_spread":0.29908917143005664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035038509","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.6366381,0.001826869,0.35920104,0.0008682866,0.000107810265,0.00012993066,8.6934693e-7,0.000062554005,0.0011645382],"genre_scores_gemma":[0.98159647,0.00013765374,0.017798353,0.00038165328,0.000037711783,0.000025712692,0.000002150101,0.000003938018,0.00001634801],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987308,0.00011047428,0.00028410013,0.00047614763,0.00017702839,0.00022144914],"domain_scores_gemma":[0.99917644,0.00033168518,0.00015679303,0.00013893985,0.000088452725,0.000107694505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002611524,0.00016061128,0.00016872678,0.000058816997,0.000200823,0.00040210222,0.00018403756,0.000044624045,0.0000020076204],"category_scores_gemma":[0.00013164754,0.00013631753,0.000008988215,0.00031158706,0.00014656705,0.0019961311,0.0001275508,0.0001645117,0.0000027705075],"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.000058864774,0.0001561709,0.028564105,0.00006459906,0.000015412461,0.000047358342,0.20914632,0.001213021,0.00021721215,0.06857141,0.00014024523,0.6918053],"study_design_scores_gemma":[0.0022286018,0.00063435215,0.021935182,0.0004956206,0.0000146928705,0.0013386378,0.03317079,0.89656985,0.00021565858,0.0009010988,0.041474212,0.0010212862],"about_ca_topic_score_codex":0.0000819835,"about_ca_topic_score_gemma":0.000017086917,"teacher_disagreement_score":0.89535683,"about_ca_system_score_codex":0.000015092654,"about_ca_system_score_gemma":0.00004588127,"threshold_uncertainty_score":0.5558867},"labels":[],"label_agreement":null},{"id":"W2051427249","doi":"10.1002/cpe.729","title":"Implementation of the EARTH programming model on SMP clusters: a multi‐threaded language and runtime system","year":2003,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"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 Alberta; Université du Québec à Montréal","funders":"Defense Advanced Research Projects Agency","keywords":"Computer science; POSIX Threads; Software portability; Runtime system; Parallel computing; Programming paradigm; Scheduling (production processes); Synchronization (alternating current); Distributed computing; Operating system; Programming language; Thread (computing); Computer network","score_opus":0.027611399581877184,"score_gpt":0.34294523777026137,"score_spread":0.3153338381883842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051427249","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.19633548,0.0004724855,0.80245614,0.00012538744,0.0000737512,0.0002358648,9.622995e-7,0.000075897115,0.0002240486],"genre_scores_gemma":[0.9126905,0.00004641256,0.08708436,0.0001370227,0.000004548608,0.000021233065,9.283099e-7,0.0000032671107,0.000011693376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910307,0.00015360425,0.00021476661,0.0002634469,0.0001458018,0.0001192905],"domain_scores_gemma":[0.9993735,0.00013913785,0.00021634129,0.00013745323,0.00008816809,0.000045374836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025867904,0.0001025882,0.0001088333,0.000047568294,0.00022790863,0.00014101868,0.000118424534,0.00003262709,5.166416e-7],"category_scores_gemma":[0.000076548815,0.000081621285,0.00001637353,0.00017483914,0.000078742414,0.00056083966,0.00007831807,0.00008151509,3.8229484e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040123014,0.00024930362,0.0027038218,0.00029029493,0.0000481444,0.000008678455,0.20537649,0.013148611,0.0008412478,0.16367616,0.00007367114,0.61354345],"study_design_scores_gemma":[0.00067069003,0.0001393181,0.0006489112,0.000096166754,0.000014051402,0.000058913396,0.01717138,0.9775326,0.003158931,0.00012908647,0.00021049228,0.00016946197],"about_ca_topic_score_codex":0.000036355737,"about_ca_topic_score_gemma":0.0000022110078,"teacher_disagreement_score":0.96438396,"about_ca_system_score_codex":0.000008102099,"about_ca_system_score_gemma":0.000041506053,"threshold_uncertainty_score":0.33284193},"labels":[],"label_agreement":null},{"id":"W2064889600","doi":"10.1002/cpe.1604","title":"Evolvable hardware design based on a novel simulated annealing in an embedded system","year":2010,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Fundamental Research Funds for the Central Universities","keywords":"Computer science; Evolvable hardware; Field-programmable gate array; Scalability; Simulated annealing; Digital electronics; Computer architecture; Electronic circuit; Embedded system; Circuit design; Gate array; Computer engineering; Algorithm; Electrical engineering","score_opus":0.03562519764943902,"score_gpt":0.3304635492285391,"score_spread":0.2948383515791001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064889600","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.10792071,0.000090905276,0.89089245,0.0003591435,0.00018855125,0.00022830287,0.0000027396172,0.000102922495,0.00021427986],"genre_scores_gemma":[0.89418983,0.000005480068,0.105473705,0.00024191925,0.000027204132,0.000045513185,0.000007282792,0.0000045690826,0.000004490376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887234,0.000089518246,0.00023520445,0.00045367336,0.00017323818,0.00017605441],"domain_scores_gemma":[0.9988274,0.00053078,0.00012635774,0.00022671075,0.00017247039,0.000116275485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003430254,0.00012819938,0.000120766505,0.00009819085,0.00031189187,0.00023957326,0.00020993402,0.00006581852,0.0000030973424],"category_scores_gemma":[0.00013088218,0.00012700005,0.000013197028,0.00037663092,0.00006727111,0.0016483602,0.00004577959,0.00021821284,0.000004273011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021528236,0.001753051,0.0020068223,0.00016319494,0.000020457699,0.00007507003,0.04205471,0.5395292,0.01698975,0.23323289,0.00015346281,0.16380614],"study_design_scores_gemma":[0.00053164037,0.00013886705,0.0010606145,0.000040889245,0.0000038712396,0.00002898332,0.0015040315,0.99567723,0.0002167217,0.00022057873,0.00041264814,0.00016390446],"about_ca_topic_score_codex":0.000036617814,"about_ca_topic_score_gemma":0.000002013421,"teacher_disagreement_score":0.7862691,"about_ca_system_score_codex":0.000016067472,"about_ca_system_score_gemma":0.00009065047,"threshold_uncertainty_score":0.5178912},"labels":[],"label_agreement":null},{"id":"W2064935713","doi":"10.1002/cpe.1490","title":"Finding order in chaos: a behavior model of the whole grid","year":2009,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Computer science; Grid computing; Grid; Distributed computing; Abstraction; Semantic grid; Set (abstract data type); Resource (disambiguation); DRMAA; Scale (ratio); Resource management (computing); Task (project management); Resource allocation; Key (lock); Data science; Artificial intelligence; Systems engineering; Computer security","score_opus":0.03670460165765702,"score_gpt":0.32736384905893895,"score_spread":0.2906592474012819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064935713","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.5168803,0.00066887354,0.4801752,0.0011346724,0.00032939576,0.00018691143,0.0000035768053,0.00003072462,0.0005903475],"genre_scores_gemma":[0.996105,0.000033908003,0.0035331892,0.00027826158,0.000017215161,0.00001102598,0.000001828411,0.0000016334487,0.000017933407],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991076,0.00008423258,0.00025407935,0.00024942632,0.00016378325,0.00014085331],"domain_scores_gemma":[0.9993991,0.00013103744,0.00017980806,0.00015096167,0.000098364704,0.000040683015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022548427,0.00009382025,0.0001242473,0.00004543672,0.00013639631,0.00011055085,0.00025911588,0.00003783292,5.449423e-7],"category_scores_gemma":[0.00012443832,0.000074839925,0.000018010485,0.00037564992,0.000058666057,0.00076467334,0.00008956891,0.00011824703,9.652839e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005183519,0.00084565463,0.011082744,0.000105773535,0.000018196159,0.000027816272,0.1895846,0.06270227,0.0038752833,0.1317539,0.0006626003,0.59928936],"study_design_scores_gemma":[0.00046292582,0.00010279678,0.009022194,0.000106900785,0.000008350576,0.000056276047,0.001566684,0.9857239,0.00014781315,0.001553803,0.0010659642,0.0001823855],"about_ca_topic_score_codex":0.000019210049,"about_ca_topic_score_gemma":0.0000011729976,"teacher_disagreement_score":0.9230216,"about_ca_system_score_codex":0.000008456381,"about_ca_system_score_gemma":0.00005988785,"threshold_uncertainty_score":0.30518836},"labels":[],"label_agreement":null},{"id":"W2065784804","doi":"10.1002/cpe.1155","title":"Mobility management in hybrid<i>ad‐hoc</i>networks and the Internet environment","year":2007,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"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 Guelph","funders":"","keywords":"Computer network; Handover; Mobility management; Computer science; Mobile IP; Mobile ad hoc network; Mobility model; Wireless ad hoc network; Packet loss; Network packet; Vehicular ad hoc network; The Internet; Distributed computing; Wireless; Telecommunications","score_opus":0.012117737677220743,"score_gpt":0.274452473220774,"score_spread":0.26233473554355324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065784804","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.12194382,0.0109102465,0.86497605,0.0005421969,0.00022253947,0.00040405308,2.5652747e-7,0.000029800765,0.0009710319],"genre_scores_gemma":[0.9883854,0.005657089,0.0050724526,0.0007675188,0.0000206778,0.00006301818,0.0000015910151,0.0000038169173,0.000028483975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985852,0.00016244611,0.00033249604,0.0004899408,0.00018583152,0.00024408256],"domain_scores_gemma":[0.9986987,0.000809012,0.00014965571,0.00022688205,0.000026212943,0.00008951504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012324755,0.0001457164,0.00015171318,0.00004441266,0.0001348953,0.00022617905,0.00023599785,0.000035965215,0.0000048197494],"category_scores_gemma":[0.000046025852,0.00011576091,0.000016730688,0.00015182163,0.0003484926,0.0009675087,0.00040241942,0.00021041982,0.0000026440252],"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.00012222723,0.00009085096,0.0005291881,0.000017013379,0.000015672753,0.00004878427,0.010773006,0.0010210003,0.0000017768308,0.0401068,0.00007833568,0.94719535],"study_design_scores_gemma":[0.0026238873,0.0001706836,0.012444854,0.00006233679,0.000026897444,0.00020445275,0.0045406446,0.94363636,0.00003330397,0.0054150806,0.030454569,0.00038692137],"about_ca_topic_score_codex":0.000017087603,"about_ca_topic_score_gemma":0.000005068292,"teacher_disagreement_score":0.9468084,"about_ca_system_score_codex":0.00002342816,"about_ca_system_score_gemma":0.000007671518,"threshold_uncertainty_score":0.47205928},"labels":[],"label_agreement":null},{"id":"W2071906280","doi":"10.1002/cpe.663","title":"Providing soft real‐time quality of service guarantees for Java threads","year":2003,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"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 Victoria","funders":"","keywords":"Computer science; Java; Operating system; Thread (computing); Quality of service; Scheduling (production processes); Virtual machine; Java concurrency; Overhead (engineering); Java applet; Distributed computing; Computer network","score_opus":0.051123579222311144,"score_gpt":0.35901710646179386,"score_spread":0.3078935272394827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071906280","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.15868396,0.00080532493,0.83703524,0.0005431043,0.00047348806,0.00030691593,0.0000026585096,0.000059086375,0.0020902562],"genre_scores_gemma":[0.9896017,0.00010556907,0.009809035,0.00034907856,0.000031685926,0.000046791938,0.0000023840748,0.000004471573,0.00004934057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987011,0.00021651707,0.00041472306,0.00034542667,0.00015841797,0.00016382274],"domain_scores_gemma":[0.9980177,0.0010244576,0.0003371065,0.00015236044,0.00041001203,0.000058345835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080772117,0.00011900184,0.00021092774,0.000046379788,0.00023130486,0.00015100665,0.0001494537,0.000054855147,0.000004385141],"category_scores_gemma":[0.00041446884,0.00010974315,0.0000314292,0.00023450148,0.00005661374,0.0013237577,0.00004427162,0.00006625401,0.0000024941178],"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.00012371327,0.00021144749,0.0009815509,0.00045530096,0.00005939197,0.000002898927,0.06987177,0.00057868165,0.0070761107,0.80795085,0.000497112,0.11219114],"study_design_scores_gemma":[0.003328629,0.0011562814,0.0015487109,0.000438852,0.00006252612,0.00031726348,0.026980886,0.90037405,0.0067354566,0.024712674,0.033067778,0.0012768605],"about_ca_topic_score_codex":0.000108524015,"about_ca_topic_score_gemma":0.0000057108964,"teacher_disagreement_score":0.8997954,"about_ca_system_score_codex":0.000009488811,"about_ca_system_score_gemma":0.00006205549,"threshold_uncertainty_score":0.44751957},"labels":[],"label_agreement":null},{"id":"W2083801760","doi":"10.1002/cpe.1708","title":"Dataflow detection and applications to workflow scheduling","year":2011,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":15,"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 Alberta","funders":"","keywords":"Computer science; Dataflow; Workflow; Distributed computing; Correctness; Workflow technology; Workflow management system; Concurrency; Scheduling (production processes); Parallel computing; Database; Algorithm","score_opus":0.0492769611559476,"score_gpt":0.31917012780069354,"score_spread":0.26989316664474594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083801760","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.047308497,0.00092065503,0.95019835,0.00015257586,0.00021286635,0.00021362801,0.0000019057859,0.00009599083,0.00089552265],"genre_scores_gemma":[0.9521849,0.00010138273,0.047296837,0.0002840304,0.00005224023,0.00006449765,0.0000030555577,0.0000036260187,0.0000094246625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999006,0.0000729823,0.00020605883,0.0004355313,0.00011834357,0.00016108832],"domain_scores_gemma":[0.99926734,0.00018363811,0.00010925366,0.00017538841,0.000109983055,0.00015438026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024016609,0.00011720855,0.00011235358,0.0000663833,0.0003327436,0.00026848476,0.00018209856,0.00004199261,0.0000018315263],"category_scores_gemma":[0.00009612427,0.00011819585,0.000010701709,0.00031842059,0.000061082064,0.0011496759,0.00017507374,0.00010123045,0.000011497405],"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.00001817575,0.000059779257,0.000561194,0.00003428746,0.000012295799,0.0000049973073,0.020952033,0.00019527842,0.00025339032,0.023183787,0.000026015527,0.95469874],"study_design_scores_gemma":[0.0017993181,0.0010178363,0.017266717,0.00034870082,0.00008379383,0.0011255491,0.012584683,0.8002613,0.0014522888,0.015936626,0.14626291,0.0018602876],"about_ca_topic_score_codex":0.000040569474,"about_ca_topic_score_gemma":0.0000021040407,"teacher_disagreement_score":0.9528385,"about_ca_system_score_codex":0.0000070252763,"about_ca_system_score_gemma":0.000022936629,"threshold_uncertainty_score":0.4819887},"labels":[],"label_agreement":null},{"id":"W2096253463","doi":"10.1002/cpe.2805","title":"Automatic configuration generation for service high availability with load balancing","year":2012,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; High availability; Redundancy (engineering); Workload; Distributed computing; Task (project management); Service (business); Load balancing (electrical power); IT service continuity; Computer network; Operating system; Systems engineering; Engineering","score_opus":0.021792679424277307,"score_gpt":0.2919101270302058,"score_spread":0.2701174476059285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096253463","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.53300065,0.0006851643,0.46420977,0.0011769002,0.00030664218,0.00027820226,0.0000023397465,0.00008275861,0.0002575957],"genre_scores_gemma":[0.96292794,0.000032085078,0.03440288,0.0023784388,0.0001303994,0.000096403426,0.00002134668,0.000005685036,0.00000479666],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879795,0.00010403535,0.00024860652,0.0003713119,0.00023728563,0.0002407786],"domain_scores_gemma":[0.99862236,0.00044205284,0.0002094997,0.00018920237,0.0004103085,0.00012655018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039071622,0.00015967393,0.00014626932,0.000042849428,0.00036137237,0.00024937664,0.00014948602,0.000051097173,0.0000069831094],"category_scores_gemma":[0.00006758785,0.00013314711,0.000013413816,0.000284897,0.000042312313,0.0030960029,0.000061248254,0.00008909302,0.0000051171914],"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.00013860018,0.00042446863,0.004851779,0.0007457312,0.000084606865,0.000003838612,0.21766992,0.00054040074,0.010492499,0.13712874,0.00020648478,0.6277129],"study_design_scores_gemma":[0.0020185732,0.0005656945,0.013187682,0.00013898949,0.00010052645,0.00021833152,0.008634365,0.95390016,0.0066155614,0.0018449662,0.011976121,0.0007990317],"about_ca_topic_score_codex":0.0001703262,"about_ca_topic_score_gemma":0.00004673156,"teacher_disagreement_score":0.9533598,"about_ca_system_score_codex":0.000023190223,"about_ca_system_score_gemma":0.0000870552,"threshold_uncertainty_score":0.5429582},"labels":[],"label_agreement":null},{"id":"W2102472666","doi":"10.1002/cpe.697","title":"Efficient communication using message prediction for clusters of multiprocessors","year":2002,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":14,"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 Victoria; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; University of Victoria","keywords":"Uniprocessor system; Computer science; Message passing; Overhead (engineering); Cache; User space; Multiprocessing; Message broker; Computer network; Locality; Copying; Parallel computing; Distributed computing; Operating system","score_opus":0.046672020603157484,"score_gpt":0.33415638955241295,"score_spread":0.28748436894925544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102472666","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.07896263,0.0017001071,0.9184812,0.00023701138,0.000084010644,0.00019462712,0.000002235405,0.00008661901,0.0002516134],"genre_scores_gemma":[0.8191488,0.0002875715,0.18043458,0.000090767135,0.0000072245844,0.00001889154,0.0000023957102,0.0000030696056,0.000006704934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917823,0.00008690997,0.0002649768,0.000239235,0.00012494516,0.000105706684],"domain_scores_gemma":[0.99892116,0.00038738814,0.00026366912,0.00014937957,0.00023329411,0.00004510821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002609999,0.0000890241,0.00011363695,0.000075418466,0.0002647847,0.00008566549,0.00016781535,0.000042727486,0.0000013518536],"category_scores_gemma":[0.00021609971,0.0000904993,0.000018833523,0.00020368352,0.00010319456,0.00052570435,0.00009118761,0.00006327682,2.9256324e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008939429,0.00068809616,0.0008917374,0.0003524569,0.000059544236,0.0000022711145,0.1411818,0.35697773,0.0013532896,0.037025634,0.00060033373,0.46077773],"study_design_scores_gemma":[0.0003354551,0.00007825545,0.00007804922,0.000050678365,0.000009849524,0.000017816197,0.0008098665,0.9974717,0.00041172653,0.00027405575,0.00036976414,0.0000927849],"about_ca_topic_score_codex":0.0000111835125,"about_ca_topic_score_gemma":1.4194984e-7,"teacher_disagreement_score":0.74018615,"about_ca_system_score_codex":0.000011134186,"about_ca_system_score_gemma":0.000012773352,"threshold_uncertainty_score":0.36904544},"labels":[],"label_agreement":null},{"id":"W2105487310","doi":"10.1002/cpe.700","title":"Parallel computation on interval graphs: algorithms and experiments","year":2002,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Myrinet; Clique; Parallel computing; Interval (graph theory); Algorithm; Parallel algorithm; Interval graph; Interconnection; Computation; Graph; Implementation; Theoretical computer science; Mathematics; Chordal graph; Message passing; Combinatorics","score_opus":0.06738285749543127,"score_gpt":0.34179044454621843,"score_spread":0.27440758705078716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105487310","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.14873485,0.005485139,0.8402853,0.0019885325,0.0008314738,0.00031897475,0.000003990982,0.0001960703,0.0021556464],"genre_scores_gemma":[0.95015216,0.0012437124,0.04745019,0.0010388066,0.000037027963,0.00003842831,0.000004075331,0.000006865053,0.00002875015],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842525,0.00014531592,0.00030279465,0.0006081272,0.00028081535,0.00023773106],"domain_scores_gemma":[0.99886787,0.00053311966,0.00017238273,0.00015963442,0.00010570202,0.0001612739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018514684,0.00021677295,0.00019642465,0.00013524794,0.00044884236,0.00043821777,0.00020424511,0.00006088245,0.000011548515],"category_scores_gemma":[0.000117880816,0.00021318652,0.00003124753,0.00029111476,0.00026006336,0.0017822206,0.00019927682,0.0001956031,0.000010751079],"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.000023972962,0.00024423323,0.00019691298,0.000025395144,0.000026726455,0.000027243977,0.030072138,0.000100470985,0.00004912364,0.069569014,0.0004333836,0.8992314],"study_design_scores_gemma":[0.0015136432,0.0008458076,0.0019274197,0.00011113193,0.000018921435,0.0003109009,0.0045299404,0.96345985,0.00015693376,0.019870749,0.006653933,0.00060078886],"about_ca_topic_score_codex":0.000022603508,"about_ca_topic_score_gemma":6.340219e-7,"teacher_disagreement_score":0.96335936,"about_ca_system_score_codex":0.000011461247,"about_ca_system_score_gemma":0.000009869441,"threshold_uncertainty_score":0.8693494},"labels":[],"label_agreement":null},{"id":"W2110536119","doi":"10.1002/cpe.555","title":"Algorithmic support for model transformation in object‐oriented software development","year":2001,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"National Research Council Canada; Bell Canada Enterprises; Austrian Science Fund","keywords":"Computer science; Unified Modeling Language; Notation; Scope (computer science); Software development; Model transformation; Software engineering; Programming language; Class diagram; Development (topology); Software development process; Process (computing); Software; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.05038449588205751,"score_gpt":0.3549345415986086,"score_spread":0.3045500457165511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110536119","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.024620118,0.00032693264,0.97426635,0.000168346,0.0001838904,0.0002440351,0.0000011416485,0.00014090246,0.00004828663],"genre_scores_gemma":[0.27756575,0.0002033615,0.72193146,0.00014208972,0.000008380994,0.000121917634,0.00000780072,0.000004322891,0.000014949051],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990582,0.000045158667,0.00027332196,0.00029976203,0.00012739684,0.0001961888],"domain_scores_gemma":[0.9990083,0.0006439689,0.00008937359,0.0000896857,0.00011245899,0.000056210993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035401122,0.00012234383,0.00013058881,0.000097128155,0.0001450504,0.00006948478,0.0001260762,0.000046950092,6.998974e-7],"category_scores_gemma":[0.000585869,0.0001261647,0.00001317022,0.00023095724,0.000041256335,0.0021215947,0.000047461326,0.00009561409,0.000001004469],"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.00003575877,0.000049556576,0.00015278654,0.0000500624,0.000005829183,0.0000070405763,0.057299703,0.047837995,0.00008401355,0.0078602275,0.000011199303,0.8866058],"study_design_scores_gemma":[0.0010850211,0.00016070917,0.000844548,0.000050512946,0.0000065033164,0.00012579306,0.0029332102,0.9778753,0.00072244793,0.007932152,0.007863419,0.00040039877],"about_ca_topic_score_codex":0.0000028243862,"about_ca_topic_score_gemma":0.0000011995324,"teacher_disagreement_score":0.9300373,"about_ca_system_score_codex":0.00002876908,"about_ca_system_score_gemma":0.00008623946,"threshold_uncertainty_score":0.5144847},"labels":[],"label_agreement":null},{"id":"W2113863982","doi":"10.1002/cpe.3659","title":"Dekker's mutual exclusion algorithm made RW‐safe","year":2015,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":16,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Thread (computing); Mutual exclusion; Correctness; Algorithm; Computer science; Tournament; Parallel computing; Mathematics; Theoretical computer science; Operating system; Combinatorics","score_opus":0.03383703133070081,"score_gpt":0.32511015342923744,"score_spread":0.2912731220985366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113863982","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.030853331,0.0032292847,0.96145386,0.0011580809,0.0008327618,0.00015290627,0.000005099396,0.000097668424,0.002217021],"genre_scores_gemma":[0.9630232,0.0002228956,0.03584772,0.0006434556,0.00009758475,0.0000305018,0.0000114415825,0.0000056353574,0.00011756052],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985445,0.00013557161,0.00029398449,0.00046667628,0.00032901755,0.00023021585],"domain_scores_gemma":[0.998915,0.00019456718,0.00018283352,0.0001918483,0.00026065935,0.0002550755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038087947,0.00016188488,0.0001743548,0.00004155966,0.000256801,0.00036312817,0.00025063116,0.000068819914,0.00000344156],"category_scores_gemma":[0.00020597268,0.00015064789,0.00002089583,0.00029212053,0.000113936265,0.0024255945,0.00022893728,0.00014416514,0.000030763287],"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.000020323612,0.00009763657,0.00017988251,0.000017953891,0.000010882306,0.000053342963,0.028560989,0.00008906497,0.000108133456,0.018309271,0.0022258582,0.9503267],"study_design_scores_gemma":[0.0015983811,0.0004159447,0.0010393678,0.000096063806,0.00001781045,0.00076890975,0.012851105,0.80975765,0.0002438145,0.003301573,0.16929916,0.00061020686],"about_ca_topic_score_codex":0.000054586468,"about_ca_topic_score_gemma":8.968929e-7,"teacher_disagreement_score":0.94971645,"about_ca_system_score_codex":0.00002131275,"about_ca_system_score_gemma":0.00009779773,"threshold_uncertainty_score":0.6143243},"labels":[],"label_agreement":null},{"id":"W2115933156","doi":"10.1002/cpe.3344","title":"Exploration/exploitation of a hybrid‐enhanced MPSO‐GA algorithm on a fused CPU‐GPU architecture","year":2014,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":6,"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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Crossover; Computer science; Metaheuristic; Algorithm; Central processing unit; Particle swarm optimization; Genetic algorithm; Parallel computing; Population; Local search (optimization); Artificial intelligence; Machine learning","score_opus":0.0282447798811836,"score_gpt":0.3269880132541699,"score_spread":0.29874323337298625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115933156","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.010892856,0.00017682521,0.98630387,0.0010017224,0.00026729726,0.00026563875,0.000003856666,0.000072785435,0.0010151451],"genre_scores_gemma":[0.79029465,0.00024665537,0.20883986,0.00042269335,0.000050001767,0.0000763909,0.00001376996,0.000008901457,0.000047084694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794227,0.0003845314,0.00041200308,0.00053333555,0.00051426055,0.00021362024],"domain_scores_gemma":[0.99764216,0.0011500597,0.00031670867,0.00027502852,0.00046886955,0.0001471797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005254256,0.00017911136,0.000226802,0.00020106349,0.00023176685,0.00023934954,0.00026996952,0.000040471856,0.000012974412],"category_scores_gemma":[0.0011274595,0.00017037232,0.000029123848,0.00045855483,0.00016781,0.0016473593,0.000116759766,0.00019352381,0.000011520783],"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.000033716056,0.00013032855,0.0000061512787,0.00003803891,0.00001447092,0.00000431422,0.0135567235,0.004704726,0.00037205016,0.014458585,0.0000921899,0.96658874],"study_design_scores_gemma":[0.00092058734,0.0005722646,0.00010380046,0.000058730348,0.000011966686,0.000039120558,0.0015608693,0.98340535,0.003584304,0.0065636863,0.0029166774,0.00026267002],"about_ca_topic_score_codex":0.0000135795735,"about_ca_topic_score_gemma":6.0385844e-7,"teacher_disagreement_score":0.9787006,"about_ca_system_score_codex":0.000013990949,"about_ca_system_score_gemma":0.00007415744,"threshold_uncertainty_score":0.6947582},"labels":[],"label_agreement":null},{"id":"W2123122082","doi":"10.1002/cpe.753","title":"A performance study of job management systems","year":2004,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Connaught Fund; University of Toronto","keywords":"Schedule; Job scheduler; Computer science; Grid; Grid computing; Strengths and weaknesses; Distributed computing; Supercomputer; Software; Domain (mathematical analysis); Component (thermodynamics); Empirical research; Operating system; Cloud computing","score_opus":0.024575815141549013,"score_gpt":0.30426573919789773,"score_spread":0.27968992405634874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123122082","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.7577743,0.0006679915,0.23925675,0.000061892424,0.0003687987,0.00026373556,5.8144866e-7,0.000050535662,0.0015554131],"genre_scores_gemma":[0.99786174,0.00014218783,0.0018867673,0.000038306276,0.000018366625,0.000031695738,0.0000011610782,0.0000028542272,0.000016890857],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887514,0.000085405525,0.00031671574,0.00033278373,0.00024330457,0.0001466695],"domain_scores_gemma":[0.99931693,0.000102293045,0.00020770953,0.00018513962,0.00012160585,0.00006633616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002657076,0.000117678486,0.00016258143,0.000067780114,0.0001888806,0.00017878825,0.00023944861,0.000026146927,3.6282654e-7],"category_scores_gemma":[0.000023888198,0.00010912514,0.000012225253,0.0002930926,0.000051886986,0.0009324318,0.0001560706,0.000075326825,0.0000035272205],"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.00012682691,0.002289463,0.023739234,0.001138878,0.0002656888,0.00017105545,0.3236467,0.09922885,0.0001206428,0.23481034,0.00018470698,0.31427762],"study_design_scores_gemma":[0.011626574,0.005976787,0.092058584,0.0012740351,0.0001737965,0.0012036623,0.16044703,0.7119689,0.00012689696,0.0015955708,0.011736794,0.0018113747],"about_ca_topic_score_codex":0.00008324063,"about_ca_topic_score_gemma":5.83683e-7,"teacher_disagreement_score":0.61274004,"about_ca_system_score_codex":0.000012079657,"about_ca_system_score_gemma":0.000024725807,"threshold_uncertainty_score":0.4449994},"labels":[],"label_agreement":null},{"id":"W2125132187","doi":"10.1002/cpe.1543","title":"In search of simplicity: a self‐organizing group communication overlay","year":2009,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Peer-to-Peer Network Technologies","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 British Columbia","funders":"","keywords":"PlanetLab; Computer science; Testbed; Distributed computing; Overlay network; Node (physics); Overlay; Communication in small groups; Overhead (engineering); Simplicity; Computer network; Simple (philosophy); The Internet; World Wide Web","score_opus":0.02199167398356057,"score_gpt":0.33153495658569965,"score_spread":0.3095432826021391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125132187","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.6804656,0.0015495772,0.30879092,0.008187375,0.00007630862,0.0002165092,6.3525454e-7,0.00015401372,0.0005591051],"genre_scores_gemma":[0.9420387,0.00041525156,0.056615677,0.0009083212,0.0000072024936,0.000008947717,0.0000011126205,0.000002285938,0.0000024752935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899995,0.000110121866,0.00024600534,0.00028836704,0.0001852621,0.00017027339],"domain_scores_gemma":[0.99904394,0.00040777418,0.00011105731,0.00026274094,0.00011985834,0.00005459855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036824401,0.00009727652,0.0001422566,0.00013455856,0.00011678441,0.00011622142,0.00038887255,0.000052376705,0.0000010034363],"category_scores_gemma":[0.00023211013,0.000101549915,0.000010217804,0.00069190597,0.000067236164,0.0016934978,0.000248722,0.00016861549,0.0000021791889],"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.000034404187,0.0003420493,0.0017110218,0.000034694007,0.000011753083,0.000017605487,0.09286869,0.00044771947,0.0058965613,0.23003016,0.00040148446,0.66820383],"study_design_scores_gemma":[0.0042730016,0.003763175,0.18621364,0.00077317806,0.00005519955,0.0006483088,0.03924603,0.6213671,0.019135598,0.093810506,0.028376585,0.0023376846],"about_ca_topic_score_codex":0.000048144946,"about_ca_topic_score_gemma":0.0000035205558,"teacher_disagreement_score":0.6658662,"about_ca_system_score_codex":0.000020827332,"about_ca_system_score_gemma":0.000029060064,"threshold_uncertainty_score":0.41410854},"labels":[],"label_agreement":null},{"id":"W2127110276","doi":"10.1002/cpe.3026","title":"Accelerating R‐based analytics on the cloud","year":2013,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cloud computing; Programmer; Scalability; Analytics; Workstation; Set (abstract data type); Software","score_opus":0.0458330124625139,"score_gpt":0.3056046564191353,"score_spread":0.2597716439566214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127110276","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.6363166,0.0003890188,0.33944044,0.016943702,0.00042993182,0.00030654456,2.9113244e-7,0.0001279239,0.006045554],"genre_scores_gemma":[0.9909262,0.000017546618,0.0046054535,0.004299492,0.00006543362,0.000031392097,5.49026e-7,0.000003631119,0.000050286708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894184,0.00013728069,0.00019628165,0.00033003648,0.00021697569,0.0001775571],"domain_scores_gemma":[0.9984038,0.0010539407,0.00014267664,0.00021656454,0.00010962179,0.00007339042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002852981,0.00012445486,0.00009513307,0.000046454115,0.00051116024,0.00065681303,0.000280865,0.000028445751,0.000011289342],"category_scores_gemma":[0.00025290097,0.000085951804,0.000021318314,0.00025342143,0.00009797248,0.00019989161,0.00017385671,0.00015880915,0.000025012954],"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.000009984821,0.00016830812,0.0005009527,0.000033903438,0.000031504256,0.000012550728,0.01778178,0.010234503,0.00009621975,0.22387177,0.002989151,0.7442694],"study_design_scores_gemma":[0.00019498232,0.00012005084,0.0009763091,0.000034395416,0.0000069412818,0.0000117856935,0.0026798688,0.9871146,0.00009137195,0.0014742855,0.007138714,0.0001567161],"about_ca_topic_score_codex":0.00003627932,"about_ca_topic_score_gemma":3.144203e-7,"teacher_disagreement_score":0.9768801,"about_ca_system_score_codex":0.00000932535,"about_ca_system_score_gemma":0.000022737171,"threshold_uncertainty_score":0.63336635},"labels":[],"label_agreement":null},{"id":"W2128276860","doi":"10.1002/cpe.3492","title":"Sparse support vector machine for pattern recognition","year":2015,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Support vector machine; Pattern recognition (psychology); Outlier; Artificial intelligence; Computer science; Sparse approximation; Norm (philosophy); Ranking SVM; Structured support vector machine; Representation (politics); Machine learning","score_opus":0.07136342235487081,"score_gpt":0.32623165268705695,"score_spread":0.25486823033218614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128276860","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.30983827,0.0021161004,0.6837015,0.00032806743,0.00073707156,0.0003409054,0.000023755269,0.0004302637,0.002484027],"genre_scores_gemma":[0.99545187,0.00024956826,0.003914089,0.00023436687,0.000056504447,0.00004114717,0.00003708284,0.0000092107375,0.0000061369665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995259,0.000021741755,0.00013202832,0.00014367646,0.00007193903,0.000104718856],"domain_scores_gemma":[0.9995827,0.00012357498,0.000043760778,0.00005486686,0.00011750045,0.00007761368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009764642,0.00009254124,0.00009229239,0.00003271454,0.000058577654,0.00006356701,0.000032882795,0.00003659972,0.0000056231006],"category_scores_gemma":[0.00010448759,0.00009413952,0.0000121196435,0.000051062463,0.000038335747,0.00046510473,0.000016631286,0.000064884516,0.0000052777605],"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.00004806287,0.000038685746,0.00026567196,0.00003745007,0.000020183807,0.0000108493705,0.008680633,0.00022107305,0.0005784737,0.00017244508,0.0044213952,0.9855051],"study_design_scores_gemma":[0.002572983,0.0010861041,0.0009812593,0.00019118204,0.00013581016,0.0004663888,0.007166935,0.84028995,0.015695607,0.008717528,0.121578574,0.0011176739],"about_ca_topic_score_codex":0.000016958786,"about_ca_topic_score_gemma":0.0000017112039,"teacher_disagreement_score":0.9843874,"about_ca_system_score_codex":0.00000862875,"about_ca_system_score_gemma":0.0000129368955,"threshold_uncertainty_score":0.38388982},"labels":[],"label_agreement":null},{"id":"W2128754884","doi":"10.1002/cpe.1065","title":"A methodology for early validation of cache coherence protocols based on relational databases","year":2006,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Correctness; Cache coherence; Protocol (science); Relational database; Table (database); Database; Cache; Relational algebra; Multiprocessing; Programming language; Theoretical computer science; Cache algorithms; CPU cache; Parallel computing","score_opus":0.22308943891776134,"score_gpt":0.45130836044949973,"score_spread":0.2282189215317384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128754884","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.04084495,0.00006176952,0.9566296,0.000223349,0.00010708411,0.0017239935,0.000009153342,0.0000346026,0.0003655383],"genre_scores_gemma":[0.4403218,0.0000024811752,0.55844724,0.00009129631,0.000018214054,0.0010929989,0.000016634494,0.000002664199,0.000006644306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986404,0.00036973393,0.00032897107,0.00034343847,0.00019923606,0.000118186035],"domain_scores_gemma":[0.99695295,0.0021735665,0.00037731003,0.00018453374,0.00027623627,0.000035409463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009109499,0.000103696846,0.0001372597,0.000083769875,0.00015679146,0.000065916596,0.00014755198,0.000044219953,0.0000029587407],"category_scores_gemma":[0.0012818954,0.00010078928,0.000019828803,0.00021827486,0.00013242019,0.0014167391,0.0000414045,0.00008201096,0.0000010871947],"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.00029454453,0.00029606948,0.0040299133,0.00015274207,0.0000098815835,0.0000015525227,0.0044329925,0.0042154845,0.0042012664,0.86068577,0.00013062004,0.1215492],"study_design_scores_gemma":[0.0020466796,0.0014370248,0.026452713,0.00019561622,0.000035175613,0.00003760963,0.00060272205,0.8757226,0.06807456,0.016684199,0.008202026,0.00050906517],"about_ca_topic_score_codex":0.00005345553,"about_ca_topic_score_gemma":5.3854797e-7,"teacher_disagreement_score":0.8715071,"about_ca_system_score_codex":0.000011662474,"about_ca_system_score_gemma":0.00007864485,"threshold_uncertainty_score":0.41100675},"labels":[],"label_agreement":null},{"id":"W2129533806","doi":"10.1002/cpe.3167","title":"Fine‐grained filtering to provide access control for data providing services within collaborative environments","year":2013,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Access Control and Trust","field":"Social Sciences","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Lawson Health Research Institute; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Ontology; Access control; Markup language; World Wide Web; Data access; Service (business); Domain (mathematical analysis); Database; XML; Computer security","score_opus":0.04904822203669841,"score_gpt":0.3922229103901211,"score_spread":0.3431746883534227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129533806","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.65168774,0.0015740906,0.3218816,0.016111668,0.0008128518,0.0053199916,0.000114895425,0.00012418388,0.0023729831],"genre_scores_gemma":[0.9956231,0.00006245136,0.002585839,0.0010661102,0.00010140527,0.00046237354,0.00002439357,0.0000063724806,0.000067954046],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99878746,0.00013773359,0.000240134,0.00041635943,0.00019585268,0.00022246195],"domain_scores_gemma":[0.9986509,0.00068728515,0.00022872991,0.00013071073,0.00014500412,0.00015736201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003863025,0.00012359858,0.00015592793,0.000041447624,0.00075678964,0.0008506863,0.0003487534,0.00004577239,0.000019985622],"category_scores_gemma":[0.0007240409,0.00011352513,0.000009903996,0.0001727733,0.0001395354,0.005377182,0.00017318124,0.00006758214,0.0000064442074],"study_design_candidate":"qualitative","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.00051255,0.0002513009,0.012198639,0.0002592682,0.00014376189,0.000007601295,0.3876016,0.000553445,0.0026284575,0.020386843,0.0010791003,0.5743774],"study_design_scores_gemma":[0.007147351,0.0008825544,0.009601381,0.0003795189,0.00027264017,0.000012770898,0.28646088,0.29348013,0.0008461097,0.0073027066,0.39189103,0.0017229258],"about_ca_topic_score_codex":0.0011355026,"about_ca_topic_score_gemma":0.00020831714,"teacher_disagreement_score":0.5726545,"about_ca_system_score_codex":0.000016693817,"about_ca_system_score_gemma":0.00009151691,"threshold_uncertainty_score":0.82031876},"labels":[],"label_agreement":null},{"id":"W2134014163","doi":"10.1002/cpe.3336","title":"Optical crossbars on chip, a comparative study based on worst‐case losses","year":2014,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Photonic and Optical Devices","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":"Concordia University; Polytechnique Montréal","funders":"","keywords":"Crossbar switch; Computer science; Scalability; Implementation; Bandwidth (computing); Multiplexing; Interconnection; Computer network; Key (lock); Computer architecture; Chip; Optical interconnect; Routing (electronic design automation); Parallel computing; Telecommunications; Operating system","score_opus":0.03157281593020538,"score_gpt":0.34099855574960986,"score_spread":0.30942573981940447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134014163","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.9721123,0.00017605504,0.014997689,0.00010221249,0.00018774584,0.00019526845,0.0000022692554,0.00008432605,0.012142162],"genre_scores_gemma":[0.998984,0.000021931226,0.0005580832,0.00035362324,0.000029270994,0.000039569495,0.0000026264627,0.000006437958,0.0000044511557],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919003,0.00007771793,0.00017877459,0.0002514148,0.00014914613,0.0001529372],"domain_scores_gemma":[0.9985831,0.0011165591,0.00003873105,0.000098106924,0.00004727582,0.00011623587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001522834,0.00015139542,0.00016917774,0.000044260785,0.00018837629,0.00014824445,0.00005228654,0.000038009446,0.000014143144],"category_scores_gemma":[0.00017081003,0.00013223723,0.000015600774,0.00011749629,0.00012897479,0.0003442645,0.000017277893,0.00018211255,0.000018636414],"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.0020771672,0.005243133,0.003659182,0.0005353919,0.0002811217,0.0014391381,0.20318574,0.23731083,0.00048999384,0.1138028,0.00068885565,0.43128666],"study_design_scores_gemma":[0.0009866067,0.0011387488,0.0023163545,0.00005918715,0.000030372545,0.00009087812,0.012020458,0.98042405,0.00039636067,0.0001905764,0.0020663757,0.0002800066],"about_ca_topic_score_codex":0.0000068984805,"about_ca_topic_score_gemma":0.0000028539168,"teacher_disagreement_score":0.7431133,"about_ca_system_score_codex":0.000010393144,"about_ca_system_score_gemma":0.00001129498,"threshold_uncertainty_score":0.53924775},"labels":[],"label_agreement":null},{"id":"W2134167127","doi":"10.1002/cpe.756","title":"RF‐MVTC: an efficient risk‐free multiversion concurrency control algorithm","year":2004,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"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 Ottawa","funders":"","keywords":"Computer science; Optimistic concurrency control; Concurrency control; Database transaction; Concurrency; Focus (optics); Distributed computing; Workstation; Serializability; Transaction processing; Transaction data; Algorithm; Distributed transaction; Distributed concurrency control; Database; Operating system","score_opus":0.011562038446103748,"score_gpt":0.2916600820033734,"score_spread":0.28009804355726964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134167127","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.12875788,0.0020133173,0.8672697,0.00045216145,0.00074068835,0.00028724948,0.00004791556,0.00012908867,0.00030201586],"genre_scores_gemma":[0.98206896,0.00028944833,0.017196061,0.0003123355,0.00006980202,0.0000363522,0.000013043536,0.0000067195247,0.000007283939],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801105,0.00016765934,0.00039233122,0.0007278832,0.00037541933,0.0003256578],"domain_scores_gemma":[0.9983532,0.0003225123,0.0003666354,0.000371405,0.00032128196,0.00026499902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043901868,0.00024524436,0.0002589154,0.000078215664,0.0006036941,0.00040051507,0.00045712825,0.00009150695,0.000004225006],"category_scores_gemma":[0.00033664444,0.00023073345,0.000041016592,0.00033072566,0.0002260046,0.0022103596,0.00015969013,0.0002518424,0.000015810465],"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.000061538456,0.0006170451,0.0004823038,0.00004207315,0.000040728024,0.00007962418,0.035352573,0.006691658,0.00036562938,0.035685502,0.000149257,0.9204321],"study_design_scores_gemma":[0.007943664,0.00089511444,0.0045112534,0.00017270588,0.00005999828,0.00032479386,0.008668326,0.9614691,0.00043805595,0.0032062747,0.011398577,0.0009121032],"about_ca_topic_score_codex":0.00023555341,"about_ca_topic_score_gemma":0.0000030232054,"teacher_disagreement_score":0.9547775,"about_ca_system_score_codex":0.000041569365,"about_ca_system_score_gemma":0.00010679238,"threshold_uncertainty_score":0.9409037},"labels":[],"label_agreement":null},{"id":"W2136664366","doi":"10.1002/cpe.3439","title":"Distributed wikis: a survey","year":2014,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"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":"","keywords":"Viewpoints; Computer science; World Wide Web; Context (archaeology); Data science; Peer-to-peer; Collaborative editing; Scheme (mathematics); Knowledge management","score_opus":0.026882371793692638,"score_gpt":0.3181151629785834,"score_spread":0.29123279118489076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136664366","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.1208723,0.00044210436,0.8751243,0.0026042445,0.0002603652,0.00010701271,0.00000428936,0.00023516222,0.00035025566],"genre_scores_gemma":[0.979163,0.00008937708,0.019745426,0.0009261635,0.000021546371,0.000029025758,0.000010273185,0.0000036259648,0.0000116005585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987533,0.00018503654,0.00020308103,0.00044758333,0.00018855413,0.00022241913],"domain_scores_gemma":[0.99845946,0.00087623036,0.000115476876,0.00024662257,0.00018268012,0.00011955566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054158585,0.000133424,0.00014650884,0.00006736926,0.0002178379,0.0003164544,0.00036346028,0.000055794135,0.0000014188288],"category_scores_gemma":[0.0015903249,0.00012806014,0.000012052574,0.00050822925,0.00011754308,0.0012158205,0.0003223783,0.00013080677,0.000015070008],"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.000028589237,0.0000791645,0.0048912163,0.000016668788,0.000014957411,0.00000906718,0.008095721,0.00028555043,0.00011424755,0.06670015,0.0032438878,0.9165208],"study_design_scores_gemma":[0.0015716851,0.0012282892,0.15969783,0.0001433639,0.00003098948,0.0003268961,0.0037150087,0.59794855,0.0008656779,0.021285111,0.21163969,0.0015469119],"about_ca_topic_score_codex":0.00006170869,"about_ca_topic_score_gemma":0.000008304257,"teacher_disagreement_score":0.91497386,"about_ca_system_score_codex":0.000010778186,"about_ca_system_score_gemma":0.000027399217,"threshold_uncertainty_score":0.5222141},"labels":[],"label_agreement":null},{"id":"W2138797883","doi":"10.1002/cpe.1803","title":"Evaluating frame structure design in WiMAX relay networks","year":2011,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"WiMAX; Frame (networking); Computer science; Frame Relay; Quality of service; Exploit; Throughput; Computer network; Relay; Telecommunications; Computer security; Wireless","score_opus":0.15174550562033925,"score_gpt":0.3940731619490897,"score_spread":0.24232765632875045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138797883","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.07165692,0.004518674,0.92246896,0.00025823052,0.00022331954,0.00021313758,2.3550609e-7,0.000053151787,0.0006073702],"genre_scores_gemma":[0.90854204,0.0014641824,0.08936442,0.000562313,0.000019237934,0.000034636796,0.0000013381007,0.000004040719,0.000007823681],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858457,0.000456105,0.00026762593,0.00035934983,0.00013613551,0.00019619594],"domain_scores_gemma":[0.9988123,0.0005965483,0.00015603572,0.00021743115,0.00013658659,0.00008105082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058082776,0.0001289731,0.00013030815,0.00007048857,0.0002577498,0.00016664961,0.00029053335,0.000060870465,0.000015090067],"category_scores_gemma":[0.00037339138,0.0001243365,0.000011957008,0.0003941143,0.00009788927,0.0015946827,0.00022484512,0.00027102977,0.0000016984078],"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.000034677378,0.000058184592,0.0012128198,0.0000073040264,0.000008547845,0.000009601497,0.057313558,0.004208001,0.00015050558,0.03470153,0.000048528105,0.9022467],"study_design_scores_gemma":[0.00041922068,0.00015570437,0.0071834936,0.00005076099,0.0000064468977,0.0000543416,0.0012102558,0.9879243,0.000109145396,0.0021224613,0.00053458626,0.00022930403],"about_ca_topic_score_codex":0.000011615302,"about_ca_topic_score_gemma":0.00000397078,"teacher_disagreement_score":0.98371625,"about_ca_system_score_codex":0.000015764996,"about_ca_system_score_gemma":0.00004524759,"threshold_uncertainty_score":0.50702953},"labels":[],"label_agreement":null},{"id":"W2139846963","doi":"10.1002/cpe.1660","title":"Special issue on Computational Science and Its Applications","year":2010,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"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 Calgary","funders":"","keywords":"Computer science; Grid computing; Context (archaeology); Data science; Grid; Cloud computing; Semantic grid; Scalability; Distributed computing; Visualization; Middleware (distributed applications); Graphics; World Wide Web; Database; Artificial intelligence","score_opus":0.019275132998766518,"score_gpt":0.328533067666696,"score_spread":0.30925793466792945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139846963","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.23576397,0.0009624814,0.7096149,0.006363329,0.004381589,0.0011585115,0.000022480752,0.00037820524,0.041354552],"genre_scores_gemma":[0.99149793,0.000051038147,0.006779514,0.0006370069,0.00094812637,0.00004015379,0.0000053005842,0.000004051529,0.000036902606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99847424,0.000053654854,0.00024184296,0.00058783597,0.00042283745,0.000219603],"domain_scores_gemma":[0.9984107,0.0006067606,0.0001637084,0.00016254338,0.000461441,0.0001948586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053678604,0.00014914377,0.00013305483,0.00011647709,0.0007722336,0.00063827407,0.00033419568,0.00005139585,0.000009174118],"category_scores_gemma":[0.00041051887,0.0001453876,0.000012166402,0.00050988887,0.00034543537,0.0014705124,0.00019358391,0.00023749977,0.000031281368],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015339223,0.00012809277,0.0001674532,0.00003591488,0.000008504354,0.0000074373093,0.009744981,0.0005270198,0.0004306924,0.504756,0.0014473547,0.48273122],"study_design_scores_gemma":[0.0007482882,0.0002557554,0.003403148,0.00004556582,0.000012453889,0.00044384308,0.0012049265,0.4041871,0.0002033272,0.0058203987,0.5831419,0.0005332194],"about_ca_topic_score_codex":0.000006739983,"about_ca_topic_score_gemma":7.4012814e-7,"teacher_disagreement_score":0.7557339,"about_ca_system_score_codex":0.00001137816,"about_ca_system_score_gemma":0.00015449958,"threshold_uncertainty_score":0.6154891},"labels":[],"label_agreement":null},{"id":"W2141587158","doi":"10.1002/cpe.1101","title":"Job completion prediction using case‐based reasoning for Grid computing environments","year":2006,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; University of Ottawa","funders":"Universidade Federal de Minas Gerais; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Computer science; Grid computing; Grid; Relevance (law); Task (project management); Resource (disambiguation); Similarity (geometry); Distributed computing; Case-based reasoning; Machine learning; Data mining; Artificial intelligence; Image (mathematics)","score_opus":0.03333774499421042,"score_gpt":0.3171633814593046,"score_spread":0.2838256364650942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141587158","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.22416481,0.0004804693,0.7742779,0.00009980952,0.0005149257,0.00023111133,0.000013515259,0.00008098827,0.00013642551],"genre_scores_gemma":[0.94012594,0.000008778991,0.059476957,0.00013004176,0.00018014955,0.000014909596,0.000049521634,0.000007003787,0.0000066866064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984973,0.00015165983,0.00039022986,0.0005009223,0.00020604121,0.0002538129],"domain_scores_gemma":[0.9988644,0.0004984337,0.00031732657,0.00014569731,0.00009593617,0.00007818023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043211726,0.00017586962,0.00018209577,0.00007272593,0.00075113017,0.00037766312,0.00013440436,0.00006435623,9.201881e-7],"category_scores_gemma":[0.000091435686,0.00018766536,0.000034276003,0.0001946365,0.00008868179,0.0010132148,0.00008353141,0.00010667034,0.0000013970453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027738392,0.0010721228,0.03961466,0.0007875329,0.00016213082,0.0006759109,0.031243512,0.54359996,0.0065232306,0.12461189,0.0030570393,0.24837461],"study_design_scores_gemma":[0.0006774729,0.00011317041,0.0018870971,0.00008188886,0.000020108455,0.0010433055,0.00058212376,0.98854154,0.00008035704,0.00026380926,0.0064991657,0.00020996548],"about_ca_topic_score_codex":0.00017396647,"about_ca_topic_score_gemma":0.0000016318688,"teacher_disagreement_score":0.71596116,"about_ca_system_score_codex":0.000037191385,"about_ca_system_score_gemma":0.000040333693,"threshold_uncertainty_score":0.7652771},"labels":[],"label_agreement":null},{"id":"W2143849473","doi":"10.1002/cpe.759","title":"On the scalability of many‐to‐many reliable multicast sessions","year":2004,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"SAIT Polytechnic","funders":"Fonds National de la Recherche Luxembourg","keywords":"Multicast; Computer science; Reliable multicast; Protocol Independent Multicast; Computer network; Scalability; Session (web analytics); Pragmatic General Multicast; Protocol (science); IP multicast; Distance Vector Multicast Routing Protocol; Tree (set theory); Network packet; Source-specific multicast; Distributed computing; Throughput; Xcast; Wireless; Medicine; World Wide Web; Telecommunications","score_opus":0.0203997158021895,"score_gpt":0.30834407848617246,"score_spread":0.28794436268398294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143849473","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.34615934,0.00028846736,0.6437912,0.008503998,0.0002551133,0.00022677291,0.000001281229,0.000047556572,0.00072626426],"genre_scores_gemma":[0.99202657,0.00007059436,0.0062828846,0.001538076,0.000020793728,0.000040012685,5.7856613e-7,0.0000029127586,0.000017607514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989793,0.000089093955,0.00023584593,0.0003374055,0.00020195715,0.00015645236],"domain_scores_gemma":[0.9984373,0.0009282992,0.00012358151,0.00023347842,0.00016672784,0.00011061599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031559172,0.00011030277,0.00012697045,0.000038036083,0.00030277736,0.0001141663,0.00023455328,0.000036360943,0.000007910856],"category_scores_gemma":[0.00047061936,0.000079626334,0.000022150665,0.00029091764,0.0001524499,0.0005939379,0.00010997733,0.00014248853,0.00001379571],"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.000045443085,0.00019381692,0.00012587222,0.0000130503495,0.000010853638,0.000005087031,0.012430233,0.0051945024,0.00014268547,0.69653296,0.00024129092,0.2850642],"study_design_scores_gemma":[0.0041678105,0.0019728553,0.011218782,0.0006953807,0.00008377817,0.00019355514,0.014307383,0.8829436,0.0019088896,0.06248296,0.018849123,0.0011758807],"about_ca_topic_score_codex":0.000022735778,"about_ca_topic_score_gemma":0.0000010248211,"teacher_disagreement_score":0.8777491,"about_ca_system_score_codex":0.000012501993,"about_ca_system_score_gemma":0.00006632386,"threshold_uncertainty_score":0.32470676},"labels":[],"label_agreement":null},{"id":"W2146234960","doi":"10.1002/cpe.1791","title":"A MapReduce‐supported network structure for data centers","year":2011,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Data structure; Tree (set theory); Network structure; Tree structure; Big data; Data center; Distributed computing; Data mining; Computer network; Operating system","score_opus":0.06795627963350627,"score_gpt":0.3241512469748351,"score_spread":0.25619496734132885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146234960","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.15916559,0.0011691231,0.8366468,0.00073004724,0.0008709571,0.00033259048,0.000007940253,0.00012790586,0.00094904157],"genre_scores_gemma":[0.925172,0.000046957917,0.07391659,0.0007137016,0.00008581445,0.000012796995,0.000017013097,0.0000053231274,0.000029828392],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875945,0.00006963337,0.00022420808,0.0005679622,0.00013484884,0.0002438958],"domain_scores_gemma":[0.9990376,0.00021861575,0.00017561442,0.000381919,0.00008591626,0.00010033946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025227867,0.0001369031,0.0001285077,0.00003883683,0.00031605695,0.0001824882,0.0005398771,0.000040575094,0.000005417317],"category_scores_gemma":[0.000115683135,0.00012468209,0.000016747113,0.00018366822,0.00008812555,0.00037350366,0.0005773384,0.0000964695,0.0000013702863],"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.00010136287,0.000170947,0.0018693887,0.00010696523,0.00010012396,0.00002723956,0.053316012,0.0006190275,0.00007782411,0.049329825,0.0062923958,0.88798887],"study_design_scores_gemma":[0.00087440625,0.0002730628,0.0024860855,0.000069125956,0.00005309243,0.00012662272,0.0035236278,0.94176173,0.00008687831,0.006416909,0.043900296,0.0004281423],"about_ca_topic_score_codex":0.00003417619,"about_ca_topic_score_gemma":0.0000014364805,"teacher_disagreement_score":0.94114274,"about_ca_system_score_codex":0.0000060759053,"about_ca_system_score_gemma":0.000030211819,"threshold_uncertainty_score":0.5084388},"labels":[],"label_agreement":null},{"id":"W2149573515","doi":"10.1002/cpe.872","title":"Performance evaluation of Data Distribution Management strategies","year":2004,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":15,"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 Ottawa","funders":"","keywords":"Computer science; Benchmark (surveying); Scalability; High-level architecture; Distribution management system; Distributed computing; Grid; Variety (cybernetics); Scheme (mathematics); Service (business); Scale (ratio); Data management; Distribution (mathematics); Service level; Data mining; Database; Interoperability; Artificial intelligence; Engineering","score_opus":0.27351746608546035,"score_gpt":0.5206736811834997,"score_spread":0.2471562150980393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149573515","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.70132005,0.00040048943,0.29459956,0.00042612298,0.00005582063,0.00025117493,0.000018409275,0.00002212694,0.002906223],"genre_scores_gemma":[0.99534863,0.0003331654,0.004160981,0.000041974497,0.000011598331,0.000030216399,0.00006475481,0.0000017696906,0.000006901639],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985096,0.00007974438,0.00034939602,0.00032424415,0.00066463044,0.00007240097],"domain_scores_gemma":[0.9986451,0.00028068753,0.00024622338,0.00028700056,0.0005048352,0.00003614994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016179049,0.00006677005,0.00008864209,0.000049418875,0.00017655976,0.0001525413,0.00021913231,0.000026354452,0.000017305878],"category_scores_gemma":[0.00035795316,0.000056768607,0.000008985262,0.00033639075,0.00012906773,0.0024769232,0.0001321358,0.00004669776,0.0000050520275],"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.0000142073895,0.000057855297,0.0004753081,0.000008280703,0.000005737167,2.5868883e-7,0.0021566069,0.0036343185,0.000046863064,0.051438782,0.00008767958,0.9420741],"study_design_scores_gemma":[0.002074119,0.0002505033,0.07781751,0.000112345166,0.00016986609,0.000042338703,0.058888577,0.70534706,0.000920482,0.12699561,0.026958961,0.00042260613],"about_ca_topic_score_codex":0.000015654881,"about_ca_topic_score_gemma":0.0000010120982,"teacher_disagreement_score":0.9416515,"about_ca_system_score_codex":0.000013838559,"about_ca_system_score_gemma":0.000061726176,"threshold_uncertainty_score":0.23149566},"labels":[],"label_agreement":null},{"id":"W2152555261","doi":"10.1002/cpe.876","title":"HLA real‐time extension","year":2004,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":12,"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 Ottawa","funders":"","keywords":"Common Object Request Broker Architecture; Computer science; High-level architecture; Quality of service; Jitter; Distributed computing; Embedded system; Operating system; Computer network; Interoperability; Telecommunications","score_opus":0.020370849220070392,"score_gpt":0.3145459142218544,"score_spread":0.29417506500178403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152555261","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.48266402,0.0012029051,0.5096775,0.0015400628,0.00043192302,0.0002137309,5.6520395e-7,0.00020279022,0.0040664845],"genre_scores_gemma":[0.9583088,0.00041459766,0.04088637,0.0002848429,0.000047401543,0.000017157156,0.0000022407062,0.0000057325024,0.000032837714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986744,0.00010312183,0.00027937564,0.0005005664,0.00023858137,0.0002039839],"domain_scores_gemma":[0.9989842,0.00029368754,0.00019134217,0.00022371736,0.00017134128,0.00013571212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003401796,0.0001441778,0.0001600653,0.00006649718,0.0002903751,0.00037557495,0.00019950498,0.00005789311,0.0000040587643],"category_scores_gemma":[0.00024638601,0.00013633289,0.000021010208,0.0002612424,0.00009817642,0.0031176105,0.00015395806,0.000115812356,0.00005596634],"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.00007023561,0.00034425932,0.00039490778,0.00012786854,0.000048233982,0.00024016087,0.11092104,0.004244913,0.034348797,0.22239734,0.0003283356,0.6265339],"study_design_scores_gemma":[0.008136687,0.0021656388,0.017406894,0.001243484,0.0001288367,0.006205243,0.026379079,0.8467806,0.012628243,0.05123089,0.024016768,0.0036776457],"about_ca_topic_score_codex":0.00012323832,"about_ca_topic_score_gemma":6.036123e-7,"teacher_disagreement_score":0.8425357,"about_ca_system_score_codex":0.000021445003,"about_ca_system_score_gemma":0.00008135674,"threshold_uncertainty_score":0.5559494},"labels":[],"label_agreement":null},{"id":"W2156088178","doi":"10.1002/cpe.885","title":"Concurrent urban legends","year":2005,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Concurrency; Mutual exclusion; Computer science; Spurious relationship; Construct (python library); Inheritance (genetic algorithm); Concurrent object-oriented programming; Field (mathematics); Programming language; Mathematics; Programming paradigm","score_opus":0.021903332450199632,"score_gpt":0.32136893135190914,"score_spread":0.2994655989017095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156088178","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.062795326,0.0054433774,0.9229658,0.0040968433,0.00026851107,0.00016355613,0.0000025026698,0.00018216736,0.004081877],"genre_scores_gemma":[0.9901923,0.0003732339,0.008521632,0.0007186086,0.00007221404,0.000039887967,0.00000592975,0.000003673057,0.0000725306],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99904513,0.000051106854,0.00021079343,0.0003726707,0.00015570616,0.00016461614],"domain_scores_gemma":[0.99931085,0.00019577934,0.00011337594,0.00017215368,0.00008701895,0.00012079142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013840855,0.000116980766,0.00010324365,0.00004781148,0.0002708796,0.0002644617,0.00020740872,0.000035038232,0.000011287963],"category_scores_gemma":[0.000054514832,0.00011473604,0.00001916848,0.0002074075,0.00010637573,0.0017719176,0.00014020708,0.00010693656,0.000035222623],"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.0000013080978,0.00007142915,0.00014400431,0.000007979372,0.000005695151,0.0000026773569,0.010214869,0.000021503301,0.0003515972,0.184419,0.0009860342,0.8037739],"study_design_scores_gemma":[0.00067135267,0.00011719936,0.0020286173,0.000025231817,0.00002048903,0.00024162668,0.0018133661,0.327515,0.0014744026,0.00086039444,0.6647886,0.00044372372],"about_ca_topic_score_codex":0.000008339023,"about_ca_topic_score_gemma":6.407476e-7,"teacher_disagreement_score":0.92739695,"about_ca_system_score_codex":0.000011237635,"about_ca_system_score_gemma":0.000039059654,"threshold_uncertainty_score":0.46787998},"labels":[],"label_agreement":null},{"id":"W2156498190","doi":"10.1002/cpe.3573","title":"Provable multiple replication data possession with full dynamics for secure cloud storage","year":2015,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Cloud Data Security Solutions","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Computer science; Merkle tree; Data integrity; Cloud storage; Hash function; Replication (statistics); Server; Reliability (semiconductor); Cloud computing; Overhead (engineering); Computer network; Computer security; Distributed computing; Hash chain; Encryption; Operating system","score_opus":0.07417905640899732,"score_gpt":0.3620698924480471,"score_spread":0.2878908360390498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156498190","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.053644884,0.0008069997,0.9423351,0.0021478743,0.00030855116,0.0004601373,0.00008287868,0.00010044288,0.00011312843],"genre_scores_gemma":[0.8997489,0.00006668198,0.099301726,0.00023300099,0.00006511932,0.00008319634,0.00047612193,0.0000075156854,0.000017713566],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854034,0.00008375917,0.00021929944,0.0007451297,0.00022418382,0.0001872918],"domain_scores_gemma":[0.9979194,0.00046449216,0.00023226683,0.0008491626,0.0003784506,0.00015623936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005294178,0.00013381483,0.00012765125,0.00004554381,0.00032705042,0.00034480426,0.0005032029,0.00005527185,6.1357656e-7],"category_scores_gemma":[0.0011708216,0.00012090464,0.0000090848425,0.0002832319,0.00011166759,0.003861865,0.00041724136,0.00012586176,0.0000025267125],"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.0009248619,0.0012305713,0.0028713997,0.0003637342,0.00010778042,0.00003870412,0.107813835,0.0015886487,0.00058589655,0.35736686,0.023802945,0.5033048],"study_design_scores_gemma":[0.00083906413,0.00032929814,0.0001286697,0.000037215552,0.000022054424,0.00015929711,0.004469206,0.9574574,0.000035441237,0.0014898314,0.034817707,0.00021481815],"about_ca_topic_score_codex":0.00006940065,"about_ca_topic_score_gemma":0.000057700174,"teacher_disagreement_score":0.9558687,"about_ca_system_score_codex":0.00003404467,"about_ca_system_score_gemma":0.00018054905,"threshold_uncertainty_score":0.4930348},"labels":[],"label_agreement":null},{"id":"W2165637133","doi":"10.1002/cpe.3409","title":"Improving the user experience of the rCUDA remote GPU virtualization framework","year":2014,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Science; Generalitat Valenciana; Queen's University; Queen's University Belfast; U.S. Department of Energy","keywords":"CUDA; Computer science; Overhead (engineering); Node (physics); Virtualization; GPU cluster; Usability; General-purpose computing on graphics processing units; Parallel computing; Operating system; Graphics; Embedded system; Cloud computing","score_opus":0.01676471276957835,"score_gpt":0.30663671325132347,"score_spread":0.2898720004817451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165637133","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.04683725,0.0004341497,0.9508728,0.00091503456,0.00033840814,0.00015225097,3.341737e-7,0.000087075554,0.00036269854],"genre_scores_gemma":[0.9323193,0.00015648743,0.066393726,0.0010564512,0.000034726785,0.000010016812,6.250586e-7,0.000004691268,0.000024008283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986425,0.0003038137,0.0003041697,0.00034055166,0.00025763028,0.00015135745],"domain_scores_gemma":[0.998131,0.0008633053,0.00038295143,0.00036564987,0.00020796627,0.000049132635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004494498,0.00012858001,0.00012519489,0.00003754943,0.0005128939,0.00023621648,0.00051958096,0.00006278381,0.0000020560074],"category_scores_gemma":[0.0012990802,0.00008509921,0.000028372993,0.00042120973,0.0002560011,0.000972571,0.000313575,0.00017277584,0.0000010477816],"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.000020603973,0.000067126886,0.0014802591,0.000049275488,0.000013420858,9.841486e-7,0.08811238,0.0044003697,0.00069229555,0.3095382,0.00023343682,0.5953917],"study_design_scores_gemma":[0.00018229279,0.00009559966,0.0014388663,0.00009896745,0.00001106588,0.000038933114,0.0020401608,0.98121876,0.0023683198,0.0066884225,0.005610121,0.0002084766],"about_ca_topic_score_codex":0.00006370658,"about_ca_topic_score_gemma":7.766278e-7,"teacher_disagreement_score":0.9768184,"about_ca_system_score_codex":0.000008352511,"about_ca_system_score_gemma":0.000039290484,"threshold_uncertainty_score":0.39448172},"labels":[],"label_agreement":null},{"id":"W2165821496","doi":"10.1002/cpe.3263","title":"High‐performance<i>N</i>‐thread software solutions for mutual exclusion","year":2014,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":19,"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 Waterloo","funders":"National Research Council Canada; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mutual exclusion; Correctness; Thread (computing); Intuition; Algorithm; Software; Implementation; Critical section; Parallel computing; Programming language","score_opus":0.025177903421765332,"score_gpt":0.2955406178304535,"score_spread":0.27036271440868814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165821496","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.091066375,0.00072101137,0.90643615,0.0006487423,0.0006420357,0.0001981979,0.000008316441,0.00010475244,0.00017441524],"genre_scores_gemma":[0.9680474,0.00020125772,0.03104943,0.00046517054,0.00008975574,0.000088736946,0.00001881105,0.0000051392512,0.000034331293],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877596,0.00007323791,0.00027336503,0.0004172954,0.00017778412,0.00028238815],"domain_scores_gemma":[0.9988157,0.0005002021,0.00017469589,0.00018076017,0.0002199481,0.00010868694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040897782,0.00014400351,0.00016968105,0.000045258697,0.00072546967,0.00024864674,0.00020759623,0.000061644336,0.0000019501326],"category_scores_gemma":[0.00031320428,0.00013493455,0.000023359715,0.00019030366,0.00010191271,0.0019291156,0.00016518541,0.000095205556,0.000008421293],"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.000033341243,0.00008783022,0.00029169294,0.000087657776,0.0000112500475,0.0000014882248,0.006318867,0.00056592136,0.00015606829,0.15013196,0.0010581472,0.8412558],"study_design_scores_gemma":[0.0021400377,0.0008507814,0.0034034017,0.00019516838,0.000032670745,0.00018502295,0.0015543012,0.831328,0.00043360653,0.008248956,0.15088674,0.00074135454],"about_ca_topic_score_codex":0.000021012704,"about_ca_topic_score_gemma":0.0000013000182,"teacher_disagreement_score":0.87698096,"about_ca_system_score_codex":0.000012156111,"about_ca_system_score_gemma":0.000041025596,"threshold_uncertainty_score":0.55797994},"labels":[],"label_agreement":null},{"id":"W2170048895","doi":"10.1002/cpe.3553","title":"A novel technique for detecting suspicious lesions in breast ultrasound images","year":2015,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"AI in cancer detection","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Utah State University","keywords":"Computer science; Artificial intelligence; Thread (computing); Breast ultrasound; Pattern recognition (psychology); Segmentation; Computer vision; Feature selection; Support vector machine; Mammography; Breast cancer","score_opus":0.04326917197220428,"score_gpt":0.3473463849342993,"score_spread":0.30407721296209506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170048895","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.026448386,0.0005392189,0.9713776,0.0007401997,0.00027998787,0.00033127167,0.0000033543704,0.00006977253,0.00021021353],"genre_scores_gemma":[0.9206528,0.00007591097,0.07881901,0.00018640769,0.000038260918,0.00021453935,0.0000013000497,0.0000053659146,0.0000064138144],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901766,0.000060276165,0.00022154406,0.0003788662,0.0001401859,0.00018144249],"domain_scores_gemma":[0.9986756,0.00074209477,0.0001493453,0.00012546775,0.00021145963,0.00009602064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047007998,0.000115227616,0.000117186486,0.000098352044,0.0001857879,0.00019742691,0.0001551812,0.000055959226,5.441338e-7],"category_scores_gemma":[0.00057824544,0.00011825654,0.00001524729,0.0003152411,0.00008725933,0.0017925726,0.00008588857,0.00013883619,9.309579e-7],"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.00019301396,0.00033166795,0.002250945,0.000116458454,0.000020721407,0.000020302728,0.06201275,0.0009727212,0.07439685,0.012902996,0.00037940973,0.84640217],"study_design_scores_gemma":[0.017918402,0.0048795533,0.028698944,0.0013064893,0.00016568444,0.02737727,0.13134812,0.52851343,0.15587932,0.074682854,0.023837667,0.005392248],"about_ca_topic_score_codex":0.00012859936,"about_ca_topic_score_gemma":0.000008772423,"teacher_disagreement_score":0.89420444,"about_ca_system_score_codex":0.000047167567,"about_ca_system_score_gemma":0.00010193552,"threshold_uncertainty_score":0.48223618},"labels":[],"label_agreement":null},{"id":"W2171692358","doi":"10.1002/cpe.3236","title":"A genome‐wide association study platform built on iPlant cyber‐infrastructure","year":2014,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"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 Toronto; Ontario Institute for Cancer Research","funders":"National Science Foundation","keywords":"Workflow; Computer science; World Wide Web; Big data; Data sharing; Data science; Database; Operating system","score_opus":0.01550803087783823,"score_gpt":0.310285277526103,"score_spread":0.29477724664826477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171692358","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.9888492,0.00028363298,0.008573195,0.0003979867,0.00020871265,0.00018005841,0.0000027135736,0.000013142841,0.0014913516],"genre_scores_gemma":[0.99834025,0.0002656754,0.0001668696,0.0009340025,0.00009892036,0.000040658604,0.000036344278,0.0000059947783,0.00011129393],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9991356,0.0000919996,0.00016465952,0.00032745954,0.00016035017,0.000119915625],"domain_scores_gemma":[0.99939954,0.00012211413,0.00018649576,0.00012224536,0.00010042536,0.00006916761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002159193,0.000112393805,0.00009322167,0.000034593686,0.0001809511,0.00007673434,0.00006672538,0.00007761611,0.000007785077],"category_scores_gemma":[0.0005263836,0.00010158471,0.00001572139,0.00007107605,0.000028845288,0.000032271913,0.000043691427,0.00009622234,0.0000040225145],"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.0015549852,0.0013415668,0.2840028,0.00010952556,0.00028229237,0.0000099722065,0.049229234,0.0017041666,0.19434378,0.0030374578,0.010829663,0.45355454],"study_design_scores_gemma":[0.003118784,0.0026283455,0.53449196,0.000044002092,0.000081629536,0.000029624536,0.022039108,0.0027470854,0.008017768,0.0007401777,0.4253179,0.00074361684],"about_ca_topic_score_codex":0.0000070149645,"about_ca_topic_score_gemma":0.000002594891,"teacher_disagreement_score":0.45281094,"about_ca_system_score_codex":0.00001549969,"about_ca_system_score_gemma":0.000028590513,"threshold_uncertainty_score":0.41425043},"labels":[],"label_agreement":null},{"id":"W2173057405","doi":"10.1002/cpe.848","title":"Run‐time evaluation of opportunities for object inlining in Java","year":2005,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Java; Just-in-time compilation; Compiler; Programming language; Object (grammar); Pointer (user interface); Object code; Speedup; Benchmark (surveying); Parallel computing; Operating system; Key (lock)","score_opus":0.1108328471571171,"score_gpt":0.3907268302496824,"score_spread":0.2798939830925653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2173057405","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.117904656,0.001327149,0.8777024,0.0009798124,0.0000820605,0.00027458408,0.0000013725943,0.00007234263,0.0016555787],"genre_scores_gemma":[0.89819956,0.0002376898,0.10124896,0.00022305395,0.00002101357,0.000045681656,0.000004748405,0.00000293718,0.000016359432],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989738,0.00015590996,0.00030612448,0.00024301762,0.00020688544,0.000114281465],"domain_scores_gemma":[0.9988164,0.00048242207,0.0002133589,0.00009825761,0.0003499627,0.00003964023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011014873,0.00008858331,0.00013284717,0.00012185934,0.000103662685,0.000085784945,0.00013207375,0.000040568855,0.000002970341],"category_scores_gemma":[0.000450109,0.00009202302,0.00001586201,0.00016505306,0.000065537715,0.001336834,0.00006573534,0.000061070205,6.2537697e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017272589,0.000068154186,0.00014399446,0.000020609034,0.0000059768304,6.1045876e-7,0.016318938,0.00872726,0.000095874755,0.010509713,0.00014584747,0.96394575],"study_design_scores_gemma":[0.00049223634,0.00010585683,0.00030838375,0.000048950853,0.0000099023255,0.000010972172,0.001496112,0.993881,0.0005751143,0.0013872106,0.0015641525,0.00012010107],"about_ca_topic_score_codex":0.000008863289,"about_ca_topic_score_gemma":9.502831e-7,"teacher_disagreement_score":0.98515373,"about_ca_system_score_codex":0.000016480888,"about_ca_system_score_gemma":0.00011002968,"threshold_uncertainty_score":0.37525898},"labels":[],"label_agreement":null},{"id":"W2189138427","doi":"10.1002/cpe.3724","title":"VMBackup: an efficient framework for online virtual machine image backup and recovery","year":2015,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Crandall University; University of New Brunswick","funders":"","keywords":"Backup; Data deduplication; Computer science; Throughput; Volume (thermodynamics); Partition (number theory); Operating system; Locality; Backup software; File system; Parallel computing","score_opus":0.04548490342768,"score_gpt":0.36892786904675084,"score_spread":0.3234429656190708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2189138427","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.1543995,0.0019285838,0.8420461,0.00089517643,0.00031695963,0.00019131228,0.000029157263,0.00015877436,0.000034442466],"genre_scores_gemma":[0.43365404,0.00032386725,0.56549305,0.00042373507,0.000034870533,0.000029632041,0.000027623832,0.0000064938363,0.0000066657985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874735,0.00007106852,0.00023330495,0.00056418957,0.00017488425,0.0002092254],"domain_scores_gemma":[0.9984352,0.00073275395,0.00018514231,0.00028113788,0.00020257123,0.00016319541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028894327,0.00016925344,0.0001729999,0.00007562407,0.00021288292,0.0002942733,0.00027687193,0.000080529244,0.000001197948],"category_scores_gemma":[0.0016756091,0.00015909987,0.000013795155,0.00021341808,0.00026962036,0.0028147704,0.00033368863,0.00018429598,0.0000023799437],"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.00011267746,0.00021200281,0.000055436954,0.000025549463,0.00001106764,0.000016838703,0.010246908,0.0006417164,0.00018437789,0.1605614,0.00016621554,0.8277658],"study_design_scores_gemma":[0.0018238049,0.0025699488,0.00041856157,0.00009847508,0.00003310058,0.00033394742,0.02033252,0.86857104,0.00042693157,0.08864411,0.015936457,0.00081109774],"about_ca_topic_score_codex":0.000012832747,"about_ca_topic_score_gemma":0.0000019589806,"teacher_disagreement_score":0.86792934,"about_ca_system_score_codex":0.00001899741,"about_ca_system_score_gemma":0.00005524183,"threshold_uncertainty_score":0.6487905},"labels":[],"label_agreement":null},{"id":"W2244262005","doi":"","title":"Concurrent urban legends: Research Articles","year":2005,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Urban Design and Spatial Analysis","field":"Engineering","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 Waterloo","funders":"","keywords":"Concurrency; Mutual exclusion; Computer science; Spurious relationship; Construct (python library); Field (mathematics); Concurrent object-oriented programming; Inheritance (genetic algorithm); Synchronization (alternating current); Programming language; Mathematics","score_opus":0.06348001023194325,"score_gpt":0.3522484638941308,"score_spread":0.2887684536621875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2244262005","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.897284,0.021579001,0.074094474,0.0010561772,0.00029523202,0.00019020334,0.000004175766,0.00020532473,0.005291455],"genre_scores_gemma":[0.99815387,0.001049897,0.0004919088,0.00009904973,0.000110758425,0.00002391173,0.0000035713088,0.0000068508375,0.00006016593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912786,0.000086805536,0.00019308922,0.00019486403,0.00020000977,0.00019739267],"domain_scores_gemma":[0.9993756,0.00028934705,0.000028611179,0.00007328263,0.00012016603,0.0001130398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002619452,0.0000979882,0.000109431276,0.00008976955,0.00019127148,0.00013194613,0.00006263182,0.00003811313,0.00004455926],"category_scores_gemma":[0.00010865256,0.000094284456,0.00001705018,0.0002512057,0.0001433929,0.0007238131,0.00002987353,0.00017659258,0.00003524832],"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.000009327275,0.00006342341,0.00088312087,0.000033202243,0.000034117988,0.000006786669,0.027673094,0.0010750701,0.0015089295,0.0050134114,0.005226809,0.9584727],"study_design_scores_gemma":[0.0006409884,0.00017158782,0.0018509781,0.0000494406,0.000051316125,0.00004826363,0.012365563,0.7643629,0.002803769,0.00038621773,0.21682742,0.0004415642],"about_ca_topic_score_codex":0.000021487383,"about_ca_topic_score_gemma":0.000005121655,"teacher_disagreement_score":0.9580311,"about_ca_system_score_codex":0.000018255105,"about_ca_system_score_gemma":0.000014248153,"threshold_uncertainty_score":0.38448083},"labels":[],"label_agreement":null},{"id":"W2276717191","doi":"10.1002/cpe.3773","title":"Parallel social network mining for interesting ‘following’ patterns","year":2016,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":66,"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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Manitoba","keywords":"Interdependence; Computer science; Friendship; Social network (sociolinguistics); Social network analysis; Data science; Data mining; World Wide Web; Social media; Sociology","score_opus":0.0467482113840547,"score_gpt":0.3547713504565648,"score_spread":0.3080231390725101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2276717191","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.074576974,0.00022674704,0.92269146,0.0019316024,0.00025970154,0.000114377486,0.0000060374477,0.00006246186,0.00013063548],"genre_scores_gemma":[0.8651753,0.000052503292,0.1341514,0.00036079998,0.00012607279,0.00009847501,0.0000053094186,0.0000045865563,0.000025568868],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911803,0.000039067283,0.00019529274,0.0003561612,0.00009536089,0.00019608586],"domain_scores_gemma":[0.998857,0.0007715048,0.00014291109,0.00009857662,0.0000673223,0.000062644576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022936273,0.00009951494,0.00010704502,0.000023214072,0.00045239477,0.00022830864,0.00018966566,0.00003294626,0.0000013991602],"category_scores_gemma":[0.00020971935,0.00007933738,0.000025920548,0.00011064822,0.000052858533,0.0013593496,0.00014388961,0.000042647283,0.0000020689115],"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.0000065916297,0.000021400225,0.0008367224,0.000009475156,0.000011324913,0.0000025069473,0.008457304,0.000006302376,0.000060433456,0.02405465,0.0005750544,0.96595824],"study_design_scores_gemma":[0.0073851794,0.0012381267,0.024388423,0.001139737,0.00017658542,0.00036781593,0.027774526,0.71218526,0.00030488044,0.034328964,0.18797737,0.0027331396],"about_ca_topic_score_codex":0.000007277884,"about_ca_topic_score_gemma":9.927331e-7,"teacher_disagreement_score":0.96322507,"about_ca_system_score_codex":0.000007487795,"about_ca_system_score_gemma":0.000025628899,"threshold_uncertainty_score":0.34795004},"labels":[],"label_agreement":null},{"id":"W2278576996","doi":"10.1002/cpe.3751","title":"A novel parallel deblocking filtering strategy for HEVC/H.265 based on GPU","year":2016,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Video Coding and Compression Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Deblocking filter; Computer science; Graphics processing unit; Parallel computing; Coding (social sciences); Graphics; Massively parallel; Normalization (sociology); Computation; Algorithm; Computer graphics (images)","score_opus":0.07503884798216896,"score_gpt":0.3491729264287559,"score_spread":0.27413407844658694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2278576996","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.0151415635,0.00034472247,0.9810041,0.00260512,0.00020302096,0.00015290562,0.0000027397225,0.00020992677,0.00033585826],"genre_scores_gemma":[0.9481744,0.000102017264,0.05106955,0.00049980934,0.000022324924,0.000102181926,7.536052e-7,0.0000050931094,0.000023828203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891365,0.00003818391,0.00020989693,0.00046161943,0.00015949266,0.00021714799],"domain_scores_gemma":[0.99841535,0.0010507915,0.00015626881,0.00019659061,0.00011097718,0.000070046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018079775,0.00014871103,0.00013567143,0.00008518944,0.00031198226,0.00023830461,0.00028136032,0.000060078815,0.0000031421216],"category_scores_gemma":[0.000422887,0.00010776863,0.000027207325,0.00014029925,0.000094152754,0.0010058928,0.00012159371,0.000081774764,0.0000024748117],"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.00005152965,0.000073434785,0.000060393628,0.000022879898,0.000006178466,0.000003960816,0.001113023,0.00080281723,0.0043243,0.033881124,0.00013125093,0.9595291],"study_design_scores_gemma":[0.003183656,0.0012982317,0.0011819596,0.0005044714,0.000019042582,0.000108854656,0.0021711234,0.95528495,0.009850081,0.011246075,0.014357323,0.0007942155],"about_ca_topic_score_codex":0.0000068315276,"about_ca_topic_score_gemma":4.5667701e-7,"teacher_disagreement_score":0.95873487,"about_ca_system_score_codex":0.000012294571,"about_ca_system_score_gemma":0.000046867855,"threshold_uncertainty_score":0.43946773},"labels":[],"label_agreement":null},{"id":"W2301455101","doi":"","title":"RF-MVTC: an efficient risk-free multiversion concurrency control algorithm: Research Articles","year":2004,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"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 Ottawa","funders":"","keywords":"Computer science; Optimistic concurrency control; Concurrency control; Concurrency; Database transaction; Workstation; Distributed computing; Focus (optics); Serializability; Transaction data; Transactional leadership; Distributed transaction; Transaction processing; Algorithm; Distributed concurrency control; Database; Operating system","score_opus":0.03735774805963148,"score_gpt":0.3623460408416172,"score_spread":0.3249882927819857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2301455101","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.2939174,0.0018192483,0.702538,0.0006464357,0.0004180415,0.0003014671,0.00002820362,0.00009545119,0.00023575529],"genre_scores_gemma":[0.9875392,0.00028977945,0.011871025,0.00015856823,0.00007084337,0.000049352973,0.0000074085497,0.000006681993,0.00000717559],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974468,0.00036275096,0.0003907931,0.00075871893,0.0006070421,0.00043390653],"domain_scores_gemma":[0.997765,0.00064887886,0.00025465805,0.0004243131,0.0006130615,0.0002940851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011800921,0.00020525862,0.00023105348,0.0001288343,0.00090703723,0.0005366998,0.0005381806,0.00009023588,0.0000044197727],"category_scores_gemma":[0.0007425745,0.0001898604,0.00003400587,0.0005777206,0.00038468288,0.002166943,0.00023492615,0.0003818063,0.000023108396],"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.000086495354,0.000765281,0.00068053795,0.00004469861,0.000034026863,0.00008482301,0.053199887,0.0043789595,0.0008477554,0.047863543,0.0002176836,0.8917963],"study_design_scores_gemma":[0.0073261987,0.0011863357,0.006615203,0.00020876157,0.000036651778,0.00021792809,0.02189077,0.94446766,0.00097304926,0.0082434425,0.008063271,0.000770739],"about_ca_topic_score_codex":0.00033114137,"about_ca_topic_score_gemma":0.0000054394345,"teacher_disagreement_score":0.9400887,"about_ca_system_score_codex":0.000052862117,"about_ca_system_score_gemma":0.00013358524,"threshold_uncertainty_score":0.7742282},"labels":[],"label_agreement":null},{"id":"W2395261749","doi":"10.1002/cpe.3869","title":"Towards traffic minimization for data placement in online social networks","year":2016,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Novelis (Canada)","funders":"National Natural Science Foundation of China","keywords":"Computer science; Server; Locality; Network topology; Data center; Social graph; Hash function; Distributed computing; Partition (number theory); Graph partition; Pairwise comparison; Graph; Theoretical computer science; Computer network; Computer security; Social media; World Wide Web; Artificial intelligence; Mathematics","score_opus":0.07111025820182253,"score_gpt":0.3561732568124616,"score_spread":0.28506299861063905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395261749","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.12032878,0.00069665565,0.87547433,0.0029771978,0.00028497545,0.00014986705,0.000010334003,0.00003798183,0.00003985283],"genre_scores_gemma":[0.99399006,0.00043091184,0.005000836,0.0004299355,0.00007032618,0.000023090373,0.000032555887,0.000003266792,0.000018988101],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999068,0.00007384684,0.00021049447,0.0003875878,0.00011351315,0.00014651794],"domain_scores_gemma":[0.9992451,0.0003806641,0.00011196572,0.00013880913,0.00008033528,0.000043090353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024560056,0.000090993664,0.00010555035,0.000048885504,0.00015505591,0.00012466729,0.00024348235,0.000040344632,0.0000016853653],"category_scores_gemma":[0.00020620518,0.000073116986,0.000011977294,0.00012906415,0.00005449769,0.0015847856,0.0001651761,0.000055253357,5.2859366e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053226486,0.000093625255,0.0001214863,0.000009960831,0.0000064538203,0.000002638751,0.0044392482,0.00047731356,0.000044468605,0.004046253,0.0005161382,0.9901892],"study_design_scores_gemma":[0.0010765393,0.000108260574,0.00066535035,0.00004243851,0.00000904131,0.000014467835,0.001530694,0.9913875,0.000006139037,0.00017366391,0.0048283455,0.00015754992],"about_ca_topic_score_codex":0.000014268294,"about_ca_topic_score_gemma":0.000006879258,"teacher_disagreement_score":0.9909102,"about_ca_system_score_codex":0.000014682803,"about_ca_system_score_gemma":0.000048500024,"threshold_uncertainty_score":0.29816243},"labels":[],"label_agreement":null},{"id":"W2408335752","doi":"10.1002/cpe.3801","title":"A modular distributed simulation‐based architecture for intelligent transportation systems","year":2016,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":6,"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 Ottawa","funders":"","keywords":"Computer science; Visualization; Modular design; Merge (version control); Distributed computing; Network simulation; Simulation; Artificial intelligence","score_opus":0.017651207777337502,"score_gpt":0.2822819340177304,"score_spread":0.26463072624039286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408335752","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.17365393,0.0013299314,0.8242767,0.0001275464,0.00020306472,0.00027036175,0.00004102736,0.000087907494,0.000009529704],"genre_scores_gemma":[0.9980737,0.00010932055,0.0015464128,0.000043106396,0.000045429973,0.0000938015,0.00007403257,0.000010815026,0.0000033859178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932736,0.000032933338,0.00020667116,0.00018599993,0.00010148139,0.00014557336],"domain_scores_gemma":[0.99900913,0.0006885554,0.000060870298,0.00006991478,0.00009797844,0.000073564246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009858902,0.0001165848,0.000112460795,0.000036680685,0.000089893336,0.000057879595,0.000040687297,0.000052890777,0.0000032577243],"category_scores_gemma":[0.00011832325,0.00009395139,0.000021630369,0.00009396141,0.000046396864,0.0003572776,0.0000032101127,0.000056058176,0.0000014031668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025830006,0.000010477847,0.000057451565,0.00005863544,0.000012023087,0.0000016544632,0.00146146,0.9521195,0.00030510136,0.0005375855,0.000024226509,0.045386046],"study_design_scores_gemma":[0.0004321649,0.00005503578,0.00033558172,0.00008042066,0.000024425975,0.0000040929176,0.0005403263,0.9820057,0.00019369557,0.0001795703,0.015999185,0.00014977816],"about_ca_topic_score_codex":0.0000049912596,"about_ca_topic_score_gemma":0.0000022759732,"teacher_disagreement_score":0.82441974,"about_ca_system_score_codex":0.000018712568,"about_ca_system_score_gemma":0.000013307074,"threshold_uncertainty_score":0.38312265},"labels":[],"label_agreement":null},{"id":"W2408990623","doi":"10.1002/cpe.3807","title":"Power‐aware server consolidation for federated clouds","year":2016,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":7,"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 Ottawa","funders":"","keywords":"Cloud computing; Computer science; Data center; Provisioning; Cloudlet; Service-level agreement; Energy consumption; Computer network; Carbon footprint; Server farm; Server; Distributed computing; Computer security; Operating system; Greenhouse gas; Client–server model; Engineering","score_opus":0.02282015756792564,"score_gpt":0.3103958121775638,"score_spread":0.28757565460963813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408990623","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.26946747,0.00033981854,0.7247839,0.004177836,0.0003497856,0.00020478695,0.0000017383041,0.00011124924,0.000563446],"genre_scores_gemma":[0.9955621,0.00005782381,0.0034324839,0.00071410096,0.00003848497,0.000036834186,0.0000018883026,0.00000513386,0.00015117704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989067,0.00008789539,0.00022644555,0.00042847104,0.0001543884,0.00019610696],"domain_scores_gemma":[0.9987475,0.0006551599,0.00016180665,0.00013924204,0.00020717176,0.000089069654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028250634,0.00013069615,0.00012183893,0.000049723243,0.00038917505,0.00029447442,0.00016322543,0.00004514926,0.000005695773],"category_scores_gemma":[0.00022369338,0.00009711274,0.000024334795,0.00015725968,0.00008900594,0.0003641528,0.00016223293,0.000051587038,0.0000072440444],"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.00007748788,0.00013646229,0.0005421938,0.00006444833,0.000048553185,0.000012025556,0.014353872,0.00016270806,0.00062773685,0.1095193,0.0016576551,0.87279755],"study_design_scores_gemma":[0.0077370913,0.0018804081,0.0061950223,0.0005859075,0.0000824557,0.00038078803,0.012226996,0.70168424,0.0034040303,0.0182875,0.24556318,0.0019723538],"about_ca_topic_score_codex":0.000007094476,"about_ca_topic_score_gemma":5.006214e-7,"teacher_disagreement_score":0.8708252,"about_ca_system_score_codex":0.000015501619,"about_ca_system_score_gemma":0.00003451198,"threshold_uncertainty_score":0.39601424},"labels":[],"label_agreement":null},{"id":"W2440504827","doi":"","title":"Loosely coordinated coscheduling in the context of other approaches for dynamic job scheduling: a survey: Research Articles","year":2005,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":8,"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 Windsor","funders":"","keywords":"Computer science; Preemption; Distributed computing; Scheduling (production processes); Job scheduler; Scalability; Gang scheduling; Shared resource; Response time; Resource allocation; Workstation; Dynamic priority scheduling; Operating system; Computer network; Schedule; Rate-monotonic scheduling; Cloud computing","score_opus":0.16703243736376103,"score_gpt":0.4008863283049055,"score_spread":0.23385389094114448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2440504827","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.54223305,0.0019279096,0.4542382,0.0011157453,0.00006835816,0.000289079,0.000005726005,0.000018679159,0.00010324178],"genre_scores_gemma":[0.99179506,0.00003530459,0.007888645,0.0001884442,0.000021189073,0.000052870786,0.0000070531396,0.0000044769117,0.0000069780135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981581,0.00065123226,0.00035895634,0.00034926986,0.00023727484,0.00024519613],"domain_scores_gemma":[0.9967794,0.0025271622,0.00017437906,0.0001722512,0.00029776417,0.00004905794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030788223,0.00011097156,0.0001741223,0.0000967747,0.00023707017,0.0002574153,0.00036709092,0.00005387686,6.683723e-7],"category_scores_gemma":[0.00080762524,0.00008883068,0.000021860162,0.00056767213,0.0001927783,0.00072111137,0.00008515129,0.00018640226,0.0000019369895],"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.00021666697,0.0005520354,0.011232462,0.00018164115,0.000046320187,0.0000055698824,0.18866356,0.007853208,0.0003699711,0.118143715,0.00016498005,0.6725699],"study_design_scores_gemma":[0.00074120914,0.00017146008,0.0051312675,0.000071993825,0.000004976876,0.000029553981,0.01654423,0.9740392,0.00010744467,0.0009646551,0.002043496,0.00015051808],"about_ca_topic_score_codex":0.00013120499,"about_ca_topic_score_gemma":0.00003362637,"teacher_disagreement_score":0.966186,"about_ca_system_score_codex":0.0000148832305,"about_ca_system_score_gemma":0.00007492665,"threshold_uncertainty_score":0.362241},"labels":[],"label_agreement":null},{"id":"W2518178976","doi":"10.1002/cpe.3896","title":"BRGP: a balanced RDF graph partitioning algorithm for cloud storage","year":2016,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"RDF; Computer science; Graph partition; Partition (number theory); Algorithm; Graph; Cluster analysis; Theoretical computer science; Mathematics; Semantic Web; Information retrieval; Artificial intelligence; Combinatorics","score_opus":0.01815302016986699,"score_gpt":0.2989604839171414,"score_spread":0.28080746374727444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2518178976","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.024035532,0.0008261797,0.9730537,0.00096652843,0.0006727459,0.00018172771,0.000008854569,0.00009695725,0.00015779013],"genre_scores_gemma":[0.92596877,0.00032253313,0.072851,0.00057730696,0.00010380801,0.00011491012,0.0000037051889,0.0000062150048,0.0000517382],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884117,0.000109691224,0.00022288573,0.00044525656,0.00014361957,0.00023736124],"domain_scores_gemma":[0.99858564,0.0008176459,0.0001641921,0.00015199507,0.0001611825,0.00011932705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035131563,0.00014130623,0.00014326657,0.00006676937,0.00041181035,0.00020729408,0.00018860115,0.000046916954,0.000005704808],"category_scores_gemma":[0.00019530361,0.000110040106,0.000036398593,0.00022178868,0.00017086428,0.0021153633,0.000082194325,0.00006954812,0.000005210788],"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.000014564786,0.000046253488,0.00006810619,0.000011330993,0.00001255234,0.0000065388263,0.005281419,0.000009434844,0.00039317977,0.09385214,0.00013658199,0.9001679],"study_design_scores_gemma":[0.008097011,0.0019411923,0.002824674,0.00057457114,0.00010373989,0.00067964545,0.009652026,0.5106973,0.005666957,0.3873683,0.07016824,0.0022263317],"about_ca_topic_score_codex":0.0000039507463,"about_ca_topic_score_gemma":2.9489058e-7,"teacher_disagreement_score":0.90193325,"about_ca_system_score_codex":0.000008462003,"about_ca_system_score_gemma":0.000033034743,"threshold_uncertainty_score":0.44873053},"labels":[],"label_agreement":null},{"id":"W2519402035","doi":"10.1002/cpe.3948","title":"Characteristics analysis and optimization design of entities collaboration for cloud manufacturing","year":2016,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Digital Transformation in Industry","field":"Engineering","cited_by":7,"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 British Columbia","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Cloud manufacturing; Computer science; Cloud computing; Cluster analysis; Selection (genetic algorithm); Node (physics); Cluster (spacecraft); Process (computing); Preference; Production (economics); Industrial engineering; Artificial intelligence; Computer network","score_opus":0.021603656280081412,"score_gpt":0.27541811114900516,"score_spread":0.25381445486892373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2519402035","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.14396617,0.00014980973,0.8554005,0.000053161046,0.0001222054,0.0001162058,0.00002281204,0.00002661637,0.00014254866],"genre_scores_gemma":[0.99017096,0.0009356258,0.00880825,0.000013418917,0.000017622604,0.00002817124,0.000013064844,0.00000417052,0.000008714916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957,0.000017856086,0.00019686467,0.00009121548,0.000061611936,0.00006242433],"domain_scores_gemma":[0.9994165,0.00034384945,0.000078332036,0.000034708704,0.00009661651,0.000030024534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008608285,0.00006712017,0.00009941631,0.000073508774,0.000057787372,0.00007956827,0.000021149952,0.000036914786,0.000005361093],"category_scores_gemma":[0.000081398495,0.000058818707,0.000009037737,0.00010495828,0.000060974045,0.0012352483,0.0000063088237,0.000022744356,2.154834e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028577237,0.00009979793,0.002264191,0.00097629544,0.0006025568,0.0000022769968,0.05436001,0.3859461,0.0025706775,0.014600183,0.00021538143,0.53807676],"study_design_scores_gemma":[0.0013897324,0.0002487781,0.002550266,0.00017460238,0.0004472958,0.00001862123,0.016567854,0.94815564,0.02657603,0.0010920638,0.0022491803,0.0005299221],"about_ca_topic_score_codex":7.62672e-7,"about_ca_topic_score_gemma":1.3425912e-7,"teacher_disagreement_score":0.84659225,"about_ca_system_score_codex":0.000007641028,"about_ca_system_score_gemma":0.000009368473,"threshold_uncertainty_score":0.23985572},"labels":[],"label_agreement":null},{"id":"W2528141713","doi":"10.1002/cpe.3966","title":"Increasing secret key capacity of OFDM systems: a geometric program approach","year":2016,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":5,"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 British Columbia","funders":"","keywords":"Key (lock); Computer science; Orthogonal frequency-division multiplexing; Randomness; Key generation; Computer network; Channel (broadcasting); Mathematics; Computer security; Encryption","score_opus":0.03330636539040255,"score_gpt":0.2998832872455095,"score_spread":0.26657692185510695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528141713","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.79076165,0.0031583973,0.20356996,0.000036876667,0.00006443243,0.00025960058,0.0000060671,0.00026459273,0.0018784413],"genre_scores_gemma":[0.9824642,0.0014301065,0.015966002,0.000011728341,0.000012697899,0.00010111526,0.00000391583,0.0000080279315,0.0000021839335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992001,0.00013111402,0.00026274042,0.00015342602,0.00013722572,0.00011536565],"domain_scores_gemma":[0.9989837,0.00053063204,0.00012378284,0.00015295691,0.00014873374,0.000060220715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031142688,0.000104305065,0.00015836318,0.000119206,0.000072077826,0.00006052864,0.000105911124,0.000059436567,0.000002097523],"category_scores_gemma":[0.0003439839,0.00008635234,0.000014221886,0.00030200527,0.00015915706,0.0008039421,0.000049689752,0.00009316657,8.966949e-7],"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.00006777846,0.0003889804,0.0046721627,0.0010193574,0.0000942802,0.0000029032315,0.035920583,0.00038710254,0.012115596,0.028411526,0.00022463338,0.9166951],"study_design_scores_gemma":[0.0046279947,0.001451962,0.021717088,0.002500618,0.00025991333,0.0015966372,0.0467511,0.79261804,0.022479136,0.002434912,0.1004737,0.0030888796],"about_ca_topic_score_codex":0.0000638544,"about_ca_topic_score_gemma":3.750841e-7,"teacher_disagreement_score":0.9136062,"about_ca_system_score_codex":0.000018083454,"about_ca_system_score_gemma":0.000013035042,"threshold_uncertainty_score":0.35213462},"labels":[],"label_agreement":null},{"id":"W2561635212","doi":"10.1002/cpe.4066","title":"Providing differentiated services, congestion management, and deadlock freedom in dragonfly networks with adaptive routing","year":2016,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"FPInnovations","keywords":"Computer science; Distributed computing; Computer network; Network topology; Bottleneck; Static routing; Hierarchical routing; Policy-based routing; Network congestion; Deadlock; Dynamic Source Routing; Queueing theory; Routing domain; Routing (electronic design automation); Routing protocol; Network packet; Embedded system","score_opus":0.013776457186735088,"score_gpt":0.2517179663363386,"score_spread":0.2379415091496035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561635212","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.23277532,0.0007348676,0.7653613,0.00024210391,0.00023798982,0.00021843519,5.1329926e-7,0.00006829756,0.0003611954],"genre_scores_gemma":[0.9966232,0.00033784247,0.0028091224,0.00011951577,0.00003625928,0.00004124279,0.0000014390241,0.00000520176,0.000026157399],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882305,0.00014822818,0.0002481687,0.00044783147,0.00012820154,0.0002045042],"domain_scores_gemma":[0.9991975,0.0003154252,0.00020423112,0.00010395157,0.0001051352,0.00007374576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023171821,0.00014719566,0.00014937611,0.00007744114,0.00020971808,0.0002866951,0.00011362221,0.000053256965,0.0000010608984],"category_scores_gemma":[0.000019688685,0.00010477084,0.000009201009,0.00022073228,0.000080380734,0.0018137277,0.00012403553,0.000099617515,8.855614e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043059862,0.00018765956,0.04365064,0.00019923081,0.00012618118,0.00012344346,0.044110186,0.004899519,0.00017936433,0.22920874,0.000077156976,0.6768073],"study_design_scores_gemma":[0.0013999442,0.00027013174,0.015806941,0.00071409816,0.000017950008,0.00015654314,0.005230175,0.975334,0.000017750048,0.00029956986,0.0004602733,0.00029260834],"about_ca_topic_score_codex":0.0000904024,"about_ca_topic_score_gemma":0.00003562113,"teacher_disagreement_score":0.9704345,"about_ca_system_score_codex":0.000019543495,"about_ca_system_score_gemma":0.000011863554,"threshold_uncertainty_score":0.42724308},"labels":[],"label_agreement":null},{"id":"W2563968022","doi":"10.1002/cpe.4038","title":"A resource allocation game with restriction mechanism in VANET cloud","year":2016,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":8,"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 Victoria","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Cloud computing; Computer science; Resource allocation; Vehicular ad hoc network; Game theory; Resource (disambiguation); Distributed computing; Resource management (computing); Computer network; Selfishness; Wireless ad hoc network; Telecommunications","score_opus":0.009035782838287496,"score_gpt":0.23979900242788002,"score_spread":0.23076321958959253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563968022","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.75906324,0.00091380323,0.23859149,0.0004131323,0.00015833732,0.00016157703,0.0000012919905,0.00010453122,0.0005925928],"genre_scores_gemma":[0.99811655,0.0009790635,0.00070957176,0.00008159631,0.000050267045,0.00003449395,0.000005323418,0.0000097648,0.000013393617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993036,0.000060509738,0.00016069924,0.00020263898,0.00011891769,0.00015366435],"domain_scores_gemma":[0.9995496,0.00021518035,0.000054556596,0.0000796784,0.0000392058,0.00006173378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014396949,0.00010549409,0.0000925547,0.00005854066,0.00004958327,0.0000462429,0.000041688312,0.000051904448,0.000005136943],"category_scores_gemma":[0.00006621843,0.0000827492,0.000006472756,0.00017463826,0.0000482424,0.000681766,0.000015586835,0.00009698838,0.000004800318],"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.00047497163,0.0001925439,0.0022105116,0.0001964197,0.00008742703,0.00015281443,0.040224407,0.23239315,0.01111837,0.06358186,0.0013830749,0.64798445],"study_design_scores_gemma":[0.0030229804,0.00056190457,0.004745981,0.000541244,0.000056580455,0.0004406892,0.0072343326,0.92133313,0.0019026004,0.0036631427,0.055626832,0.00087059155],"about_ca_topic_score_codex":0.000013902245,"about_ca_topic_score_gemma":0.000008669602,"teacher_disagreement_score":0.68894,"about_ca_system_score_codex":0.00002800336,"about_ca_system_score_gemma":0.0000146222255,"threshold_uncertainty_score":0.33744144},"labels":[],"label_agreement":null},{"id":"W2593000752","doi":"10.1002/cpe.4084","title":"Investigating device‐specific visual feedback for cross‐device transfer in table‐centric multisurface environments","year":2017,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Interactive and Immersive Displays","field":"Computer Science","cited_by":1,"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 Guelph; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Human–computer interaction; Usability; Transfer (computing); Workspace; Visual feedback; Table (database); Haptic technology; Bridge (graph theory); Multimedia; Interface (matter); Operating system; Artificial intelligence; Database","score_opus":0.045903951561012825,"score_gpt":0.37333092638983856,"score_spread":0.3274269748288257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593000752","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.7031284,0.0010228816,0.29438606,0.0004085555,0.00037974797,0.00031481782,0.000005256352,0.00000897691,0.00034530126],"genre_scores_gemma":[0.9945734,0.00039769858,0.0043672645,0.0005157515,0.000033641445,0.00005706059,0.000007867336,0.0000076019637,0.00003967642],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853647,0.000087900764,0.00031497196,0.0005774584,0.00018313392,0.0003000392],"domain_scores_gemma":[0.9988529,0.0005064327,0.00021015527,0.0002057858,0.000112048394,0.00011264652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027306698,0.00018648726,0.00018457402,0.00006329577,0.00080322276,0.0007916786,0.00036204504,0.000065644716,0.0000059809754],"category_scores_gemma":[0.00037503938,0.00019237064,0.000028451943,0.00011681,0.00021965738,0.0048383977,0.00014746196,0.00017389431,0.000011293816],"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.000425592,0.0014736047,0.1333035,0.00046997608,0.00015244554,0.00009494495,0.20101003,0.0015940248,0.14423527,0.045796372,0.0005547343,0.4708895],"study_design_scores_gemma":[0.008675028,0.000765708,0.42259407,0.00050242024,0.000054255925,0.00013256934,0.019059105,0.44028828,0.048834175,0.0012079207,0.056077003,0.0018094778],"about_ca_topic_score_codex":0.00006845836,"about_ca_topic_score_gemma":0.0000039790148,"teacher_disagreement_score":0.46908003,"about_ca_system_score_codex":0.000030344505,"about_ca_system_score_gemma":0.00004379072,"threshold_uncertainty_score":0.7844647},"labels":[],"label_agreement":null},{"id":"W2594266659","doi":"10.1002/cpe.4069","title":"Hardware‐assisted software event tracing","year":2017,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Tracing; Computer science; x86; Debugging; Embedded system; Software; Overhead (engineering); Memory footprint; Operating system; Computer hardware","score_opus":0.03195901466201988,"score_gpt":0.3455792680153101,"score_spread":0.3136202533532902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594266659","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.27569458,0.0013866503,0.71963453,0.0013426597,0.0009625464,0.00018532782,0.000001656154,0.00015058521,0.0006414738],"genre_scores_gemma":[0.9858147,0.00025694357,0.0135451695,0.0002491879,0.000051988503,0.000032992448,0.0000017905174,0.0000042886772,0.00004293291],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9987438,0.000080918486,0.00027889144,0.00046678408,0.0002263629,0.000203253],"domain_scores_gemma":[0.99860924,0.0003022223,0.00032971596,0.00044845347,0.00018748014,0.00012289466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003903795,0.00014682597,0.00017243974,0.00004171562,0.0012497852,0.0007630503,0.0004036469,0.00006520033,0.0000043260757],"category_scores_gemma":[0.0008563952,0.0001283221,0.0000324802,0.00007675504,0.00019093111,0.0037524444,0.00025646354,0.00014576945,0.000012356888],"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.000018240813,0.00007634925,0.012542963,0.00009383819,0.000015785574,0.000021412761,0.014541888,0.000039819115,0.000057895068,0.00286998,0.00015532963,0.9695665],"study_design_scores_gemma":[0.004741979,0.0010803007,0.6863036,0.0010893336,0.00012491774,0.0019975484,0.011916079,0.21305679,0.0018710096,0.00886381,0.066373475,0.0025811233],"about_ca_topic_score_codex":0.00006163032,"about_ca_topic_score_gemma":0.0000022519564,"teacher_disagreement_score":0.9669854,"about_ca_system_score_codex":0.000016566626,"about_ca_system_score_gemma":0.000068014786,"threshold_uncertainty_score":0.9612464},"labels":[],"label_agreement":null},{"id":"W2603399189","doi":"10.1002/cpe.4068","title":"Multi‐scale navigation of large trace data: A survey","year":2017,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"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; TRACE (psycholinguistics); Visualization; Tracing; Correctness; Software visualization; Data science; Scale (ratio); Data visualization; Heuristics; Data structure; Field (mathematics); Data mining; Software; Software system; Programming language; Component-based software engineering","score_opus":0.0727773124512009,"score_gpt":0.40216154067841786,"score_spread":0.32938422822721697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603399189","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.5732477,0.0009137781,0.4249278,0.00023466456,0.0004169572,0.00013029402,0.00001971817,0.000030932344,0.000078188605],"genre_scores_gemma":[0.9852035,0.0002383734,0.014445995,0.00004826473,0.00002023855,0.000009010452,0.000019948067,0.0000026530784,0.0000120171],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9988427,0.00014455838,0.00027273057,0.00041989665,0.00018099725,0.00013908089],"domain_scores_gemma":[0.9982372,0.00036871067,0.0004004334,0.0006913324,0.00023557486,0.000066746936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010863328,0.000098656965,0.00015854706,0.000026093172,0.00052767526,0.00026187257,0.00059547456,0.00005363374,0.0000014136164],"category_scores_gemma":[0.00074503117,0.000086980646,0.000013025037,0.00008554732,0.0001772489,0.004491949,0.00042126328,0.00010107264,0.000003628471],"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.00010977218,0.0007215639,0.3776825,0.00045605525,0.000048938124,0.000015049723,0.073830225,0.00005042725,0.00087690627,0.0026066382,0.00043285,0.543169],"study_design_scores_gemma":[0.001235013,0.00014846683,0.5933052,0.00014133875,0.000016923217,0.0000702691,0.0023877316,0.3977025,0.000498091,0.00020250806,0.003979922,0.00031207668],"about_ca_topic_score_codex":0.00025741648,"about_ca_topic_score_gemma":0.000021414673,"teacher_disagreement_score":0.542857,"about_ca_system_score_codex":0.0000055751407,"about_ca_system_score_gemma":0.000058416408,"threshold_uncertainty_score":0.4058505},"labels":[],"label_agreement":null},{"id":"W2611615090","doi":"10.1002/cpe.4136","title":"A reflection on the origins, evolution, and future of PRAGMA","year":2017,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Centro Nacional de Investigaciones Cardiovasculares; Global Lake Ecological Observatory Network; National Institute of Advanced Industrial Science and Technology; National Science Foundation","keywords":"Reflection (computer programming); Context (archaeology); Set (abstract data type); Engineering ethics; Critical reflection; Computer science; Sociology; Political science; Data science; Epistemology; Engineering; History; Pedagogy; Philosophy; Archaeology","score_opus":0.047920238820822685,"score_gpt":0.352661256295408,"score_spread":0.3047410174745853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611615090","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.64548033,0.0028799346,0.32751688,0.017676448,0.0014832659,0.00048133082,0.0000048221987,0.0000822423,0.0043947403],"genre_scores_gemma":[0.998587,0.0004018072,0.00062832434,0.00023449876,0.0000978821,0.000028373452,6.3691806e-7,0.0000026640523,0.00001877472],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99908614,0.0001532023,0.00018113885,0.0002997389,0.00017982727,0.000099948826],"domain_scores_gemma":[0.9985668,0.00050587114,0.0003890798,0.0002718412,0.00021345168,0.000052959094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036377975,0.00010044856,0.000119006065,0.00004648586,0.0007521141,0.0003878712,0.00019908184,0.000045308352,0.0000027948556],"category_scores_gemma":[0.00035101763,0.00007662642,0.000015344958,0.00009562007,0.00018967513,0.0020607684,0.00011441192,0.00012623888,0.0000029861585],"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.000043016746,0.000072057235,0.0016192856,0.00003553129,0.000020740825,0.0000040276655,0.015531184,0.0000021081755,0.00041816733,0.27101666,0.0002745386,0.71096265],"study_design_scores_gemma":[0.0050585736,0.0028455278,0.17415135,0.0008987645,0.0001508901,0.0020319454,0.057076074,0.13417849,0.004882633,0.04632433,0.57036066,0.0020407913],"about_ca_topic_score_codex":0.00009842263,"about_ca_topic_score_gemma":0.000007096172,"teacher_disagreement_score":0.7089219,"about_ca_system_score_codex":0.000016522374,"about_ca_system_score_gemma":0.000051624662,"threshold_uncertainty_score":0.578473},"labels":[],"label_agreement":null},{"id":"W2611943955","doi":"10.1002/cpe.4149","title":"Semi‐asynchronous approximate parallel DEVS simulation of web search engines","year":2017,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Universidad de Santiago de Chile","keywords":"DEVS; Computer science; Asynchronous communication; Discrete event simulation; Distributed computing; Formalism (music); Parallel computing; Modeling and simulation; Simulation","score_opus":0.13975653021478618,"score_gpt":0.47950619188193294,"score_spread":0.33974966166714676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611943955","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.49082953,0.00038541926,0.5058314,0.0006231221,0.00008327568,0.00021994919,0.0000070478245,0.000034610424,0.0019856037],"genre_scores_gemma":[0.99410164,0.00020193186,0.0055020596,0.00007271171,0.000031205374,0.000027068956,0.000004182073,0.0000044618764,0.00005476016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998614,0.00008398554,0.0004281859,0.0003410986,0.00040974506,0.00012299912],"domain_scores_gemma":[0.9971448,0.0014768024,0.0004432324,0.00034319996,0.0005147361,0.00007721749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007339615,0.00010225947,0.00017102157,0.000088897745,0.00060394057,0.00040094438,0.00027442817,0.0000559766,0.00003398038],"category_scores_gemma":[0.0018105045,0.000086612024,0.000026972466,0.00014725931,0.00027994916,0.0014246313,0.0001330153,0.000089209345,0.000008193485],"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.00009666657,0.0001655394,0.012888419,0.000039497816,0.00001826762,0.0000033735162,0.015176389,0.06254699,0.001277642,0.03342217,0.00019675176,0.8741683],"study_design_scores_gemma":[0.00037703008,0.00006977625,0.0077070817,0.000021115198,0.0000110754945,0.0000102898175,0.0032525423,0.9746071,0.00052926905,0.0072498755,0.0060180994,0.00014675499],"about_ca_topic_score_codex":0.00003058669,"about_ca_topic_score_gemma":0.0000015097429,"teacher_disagreement_score":0.9120601,"about_ca_system_score_codex":0.0000067528085,"about_ca_system_score_gemma":0.00005359063,"threshold_uncertainty_score":0.46450835},"labels":[],"label_agreement":null},{"id":"W2625551154","doi":"10.1002/cpe.4215","title":"Special issue on Big Data Security and Intelligent Data in Clouds (<scp>BDS‐IDC</scp>)","year":2017,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Big Data and Digital Economy","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":"St. Francis Xavier University","funders":"","keywords":"Big data; Cloud computing; Computer science; Cloud computing security; Computer security; Implementation; Data security; Data science; Encryption; Data mining; Software engineering; Operating system","score_opus":0.14002493384737225,"score_gpt":0.37323813842310266,"score_spread":0.23321320457573042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625551154","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.62473476,0.009987504,0.21830027,0.011073932,0.013252475,0.0014682396,0.0007141746,0.00023818172,0.120230496],"genre_scores_gemma":[0.9937744,0.0024089683,0.0016683688,0.0007511258,0.0012178941,0.0000091412785,0.00013062177,0.000005749634,0.000033689415],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998314,0.00007376295,0.00028827472,0.00092565175,0.00017549777,0.0002227676],"domain_scores_gemma":[0.997497,0.00060857076,0.00026195004,0.0014254692,0.000053549364,0.0001534655],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00049389736,0.00017044827,0.00018959372,0.00006435294,0.0004017754,0.001563857,0.0015433903,0.00006513902,0.0000031417464],"category_scores_gemma":[0.0013380611,0.00016742274,0.000007939912,0.00009491138,0.00027502235,0.00752524,0.0027049961,0.00020701459,0.000021999092],"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.000011130662,0.00010340234,0.0013982905,0.000024043931,0.000007296881,0.000029078963,0.008351291,0.0000020718828,0.000002058099,0.009270493,0.0035910765,0.97720975],"study_design_scores_gemma":[0.00079157035,0.00021816265,0.006588169,0.00010746129,0.000014211191,0.0000873443,0.0046964404,0.08031197,0.00009025333,0.0056609632,0.9011704,0.0002630901],"about_ca_topic_score_codex":0.00013347506,"about_ca_topic_score_gemma":0.000045855257,"teacher_disagreement_score":0.97694665,"about_ca_system_score_codex":0.000009534926,"about_ca_system_score_gemma":0.00007766828,"threshold_uncertainty_score":0.9994726},"labels":[],"label_agreement":null},{"id":"W2734326530","doi":"10.1002/cpe.4222","title":"Accelerating Apache Spark with FPGAs","year":2017,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":17,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Software portability; SPARK (programming language); Computer science; Field-programmable gate array; Java; Big data; Embedded system; Operating system; Programming language","score_opus":0.04357597152681141,"score_gpt":0.32581465557173206,"score_spread":0.28223868404492064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734326530","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.6767718,0.00064665644,0.3071714,0.00356135,0.00027604462,0.00015163282,2.9645065e-7,0.000109148365,0.011311626],"genre_scores_gemma":[0.9804976,0.000048324117,0.018855369,0.000434569,0.000060278355,0.00001354785,4.871625e-7,0.0000043665395,0.000085489126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895537,0.00006081109,0.0001612101,0.0004273501,0.00020268398,0.00019254818],"domain_scores_gemma":[0.9989767,0.00020887797,0.00027421233,0.00034774604,0.00009596817,0.00009651513],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00026562763,0.00013493608,0.00012464623,0.000037371097,0.0012954681,0.001301803,0.00040623418,0.00003053222,0.0000020012767],"category_scores_gemma":[0.00019788949,0.00010908958,0.000014073163,0.000075366646,0.00017879676,0.00057377043,0.00039764776,0.00013646993,0.0000046903306],"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.000019033223,0.0000794046,0.0037223895,0.00003969743,0.00003075009,0.000058237358,0.023552852,0.0010041572,0.000056974874,0.04671197,0.0001934932,0.92453104],"study_design_scores_gemma":[0.0016179511,0.00049186195,0.02375255,0.00022747499,0.000043937387,0.00040950373,0.008259206,0.9325023,0.00031853502,0.0021233186,0.029456742,0.00079659343],"about_ca_topic_score_codex":0.00005583904,"about_ca_topic_score_gemma":0.000001946703,"teacher_disagreement_score":0.93149817,"about_ca_system_score_codex":0.000007539358,"about_ca_system_score_gemma":0.000027157079,"threshold_uncertainty_score":0.99973494},"labels":[],"label_agreement":null},{"id":"W2735305329","doi":"10.1002/cpe.4207","title":"Targeted content dissemination in mobile social networks taking account of resource limitation","year":2017,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Computer science; Exploit; Relay; Computer network; Mobile social network; Scheduling (production processes); Overhead (engineering); Limiting; Mobile computing; Computer security","score_opus":0.05854052715219711,"score_gpt":0.3522446911425863,"score_spread":0.2937041639903892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735305329","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.28344318,0.0012042489,0.71354514,0.00041760452,0.00021272084,0.00018359325,0.0000014364084,0.000023241944,0.0009688063],"genre_scores_gemma":[0.99767566,0.0003097635,0.0017804811,0.00012171815,0.00004720663,0.00003419962,0.000011143036,0.0000036845968,0.000016167733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989607,0.000090922105,0.00031913246,0.00029196215,0.00018199201,0.00015530766],"domain_scores_gemma":[0.99851155,0.0004448624,0.0006714543,0.00015372092,0.00016687135,0.00005156557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039321353,0.00010745008,0.00016597011,0.00005663675,0.00044538153,0.0003027016,0.0002265072,0.00007116701,0.000002292347],"category_scores_gemma":[0.00014450934,0.000107999,0.000019748082,0.00010300182,0.0001688436,0.0017728931,0.0001362127,0.00013575572,5.547973e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004013998,0.0000821987,0.0025693744,0.000021247293,0.000007659195,0.000012977717,0.023940204,0.00031685227,0.0001282321,0.010084118,0.00013488413,0.9626621],"study_design_scores_gemma":[0.00049067935,0.00011285014,0.025760692,0.00010174856,0.000011758338,0.000019562704,0.006664349,0.9649005,0.000050087256,0.00041382198,0.0012817682,0.00019220846],"about_ca_topic_score_codex":0.000031100695,"about_ca_topic_score_gemma":0.0000029234477,"teacher_disagreement_score":0.96458364,"about_ca_system_score_codex":0.000013585145,"about_ca_system_score_gemma":0.000031969415,"threshold_uncertainty_score":0.44040716},"labels":[],"label_agreement":null},{"id":"W2758674126","doi":"10.1002/cpe.4183","title":"Fast mutual exclusion by the Triangle algorithm","year":2017,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed systems and fault tolerance","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mutual exclusion; Thread (computing); Computer science; Critical section; Software; Algorithm; Lock (firearm); Parallel computing; Linux kernel; Theoretical computer science; Operating system","score_opus":0.021763926036587677,"score_gpt":0.326384382161828,"score_spread":0.30462045612524036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758674126","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.0201359,0.0031707003,0.96913403,0.0038809257,0.00079431094,0.00018828968,0.000013946784,0.000052044463,0.002629875],"genre_scores_gemma":[0.9953845,0.0003172406,0.0035385885,0.00045732703,0.000070009904,0.000030699666,0.0000060457396,0.0000035129817,0.00019207502],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894553,0.00010020523,0.000212073,0.00035440468,0.00021564803,0.00017211276],"domain_scores_gemma":[0.9989001,0.0002498773,0.00029773914,0.00034795882,0.00011688128,0.00008743251],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003508824,0.000121642086,0.00013756045,0.00001726343,0.0014578113,0.0011045187,0.000513589,0.000045691093,0.0000034579034],"category_scores_gemma":[0.00024583982,0.00008882799,0.000022463188,0.00007624146,0.0002142791,0.0023595053,0.00028200334,0.00012828707,0.000010906968],"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.000006641858,0.000036628775,0.00006651634,0.0000058531564,0.000006178409,0.0000079661295,0.007592412,0.000004226408,0.000087356,0.0066169733,0.002509504,0.98305976],"study_design_scores_gemma":[0.002093468,0.0003168814,0.0031995003,0.00011149697,0.000024897734,0.00045333864,0.008676841,0.5794738,0.00045803815,0.001976276,0.40258467,0.0006307636],"about_ca_topic_score_codex":0.000089591515,"about_ca_topic_score_gemma":0.000001468881,"teacher_disagreement_score":0.98242897,"about_ca_system_score_codex":0.000007999383,"about_ca_system_score_gemma":0.000033678185,"threshold_uncertainty_score":0.9999324},"labels":[],"label_agreement":null},{"id":"W2760976117","doi":"10.1002/cpe.4338","title":"Dynamic formation of service communities in the cloud under distribution and incomplete information settings","year":2017,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cégep Marie-Victorin; Concordia University; Maple Leaf Foods","funders":"","keywords":"Cloud computing; Computer science; Visibility; Set (abstract data type); Service (business); Process (computing); Complete information; Data science; Data mining; Operations research; Engineering; Business; Geography; Mathematics","score_opus":0.023142043318403985,"score_gpt":0.3021808909044797,"score_spread":0.2790388475860757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760976117","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.7235958,0.00023487024,0.268728,0.0068899756,0.00010454684,0.000144239,0.0000034809061,0.000017694942,0.00028143375],"genre_scores_gemma":[0.9978121,0.00011488614,0.0010414587,0.0009908872,0.0000073661786,0.000010848087,0.000019879271,0.0000012259158,0.0000013528706],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922645,0.00014376221,0.0002552116,0.000104394596,0.00016238177,0.0001078128],"domain_scores_gemma":[0.9989024,0.00034793367,0.00037580403,0.0002343829,0.000114751296,0.000024743722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005934395,0.000086566986,0.00009634282,0.00004425777,0.00064678886,0.00050755043,0.00032745863,0.000029600407,3.7048326e-7],"category_scores_gemma":[0.00010538919,0.000069687696,0.000009640768,0.000108006345,0.00014016248,0.0012519283,0.00031888456,0.00011987077,8.169615e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004028728,0.00009252266,0.0010651232,0.00037603636,0.000014874281,0.0000027408819,0.3105613,0.0027804072,0.000028039363,0.11649578,0.00014314234,0.5683997],"study_design_scores_gemma":[0.00048909604,0.00007641109,0.02110705,0.00011362258,0.0000100316165,0.000059726044,0.046885196,0.92270094,0.000012390734,0.0032131877,0.0051996405,0.00013269014],"about_ca_topic_score_codex":0.00036677322,"about_ca_topic_score_gemma":0.00003390242,"teacher_disagreement_score":0.91992056,"about_ca_system_score_codex":0.000011584588,"about_ca_system_score_gemma":0.000012563313,"threshold_uncertainty_score":0.49746424},"labels":[],"label_agreement":null},{"id":"W2777032998","doi":"10.1002/cpe.4397","title":"Improving performance of transactional memory through machine learning","year":2017,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Transactional memory; Software transactional memory; Benchmark (surveying); Exploit; Overhead (engineering); Parallel computing; Database transaction; Software; Embedded system; Distributed computing; Operating system; Database","score_opus":0.023908557378091763,"score_gpt":0.30670713754821877,"score_spread":0.282798580170127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2777032998","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.35621506,0.0017299033,0.6391692,0.00038295335,0.00038219002,0.00009216888,0.0000036532242,0.00003727416,0.0019875474],"genre_scores_gemma":[0.9934565,0.0003698076,0.006016431,0.00006677115,0.000025104262,0.000011308392,0.0000025967076,0.0000029116002,0.000048585876],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991268,0.00005153305,0.00023056926,0.00028132004,0.00018016009,0.00012961241],"domain_scores_gemma":[0.99910164,0.0001357723,0.0003905715,0.00018429043,0.000139315,0.000048407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022586063,0.000102378566,0.00014354945,0.000021605607,0.0007013955,0.00025923926,0.00025973452,0.000037995804,0.0000036332863],"category_scores_gemma":[0.00015645586,0.000096511896,0.000020143012,0.000058803358,0.00016022172,0.0035869027,0.00008126891,0.0001485858,0.0000017711263],"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.000056885416,0.00008798417,0.0035380092,0.00018764829,0.000022490422,0.000010056098,0.023087367,0.00066490157,0.0015375204,0.014585323,0.000020894871,0.9562009],"study_design_scores_gemma":[0.0009806551,0.0003171789,0.0076878937,0.00012689033,0.00001668907,0.00018469988,0.0022961956,0.979193,0.0019084557,0.0002646295,0.0066948924,0.0003288243],"about_ca_topic_score_codex":0.00019224553,"about_ca_topic_score_gemma":0.0000015268015,"teacher_disagreement_score":0.9785281,"about_ca_system_score_codex":0.0000060491934,"about_ca_system_score_gemma":0.000039765055,"threshold_uncertainty_score":0.5394638},"labels":[],"label_agreement":null},{"id":"W2783627778","doi":"10.1002/cpe.4414","title":"Special issue on social network security and privacy","year":2018,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Digital and Cyber Forensics","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":"St. Francis Xavier University","funders":"","keywords":"Computer science; Internet privacy; Computer security; Animation; World Wide Web; Computer graphics (images)","score_opus":0.02356987452473387,"score_gpt":0.31510290985490697,"score_spread":0.2915330353301731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783627778","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.79046756,0.0011308265,0.059324007,0.008160421,0.005371198,0.00047542216,0.00000811866,0.0002734794,0.13478896],"genre_scores_gemma":[0.99267316,0.0001291875,0.0018168336,0.0015187075,0.0038000257,0.000007126335,0.000002318516,0.000003888772,0.000048760947],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99904835,0.00005627319,0.00016069126,0.00036860912,0.00017184389,0.00019425657],"domain_scores_gemma":[0.99940884,0.00018083163,0.00010680165,0.0000951002,0.00011478278,0.00009362122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013966835,0.00012538735,0.000121071615,0.000025363246,0.00045943356,0.00042951826,0.00014344609,0.00004647158,0.000010047464],"category_scores_gemma":[0.00009398897,0.00011701648,0.000014155599,0.00019145412,0.00034872539,0.0015752724,0.0002124964,0.00010975212,0.000020918502],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003311215,0.00005238168,0.00016164171,0.000009359779,0.0000075362627,0.000007960001,0.039698217,0.0000016020468,0.0000028789857,0.12184578,0.011051097,0.8271284],"study_design_scores_gemma":[0.0008099995,0.0007910851,0.004539037,0.00005321814,0.000018171982,0.00014155556,0.003273454,0.013737183,0.00013132843,0.059941053,0.9160238,0.00054013764],"about_ca_topic_score_codex":0.000007383386,"about_ca_topic_score_gemma":0.0000014025615,"teacher_disagreement_score":0.9049727,"about_ca_system_score_codex":0.0000062864615,"about_ca_system_score_gemma":0.000028026288,"threshold_uncertainty_score":0.47717935},"labels":[],"label_agreement":null},{"id":"W2786902291","doi":"10.1002/cpe.4475","title":"High‐contention mutual exclusion by elevator algorithms","year":2018,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mutual exclusion; Thread (computing); Critical section; Algorithm; Software; Parallel computing; Concurrency; Operating system; Theoretical computer science","score_opus":0.016763403937617015,"score_gpt":0.30754542772180704,"score_spread":0.29078202378419005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786902291","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.15014303,0.0014442499,0.8459554,0.0008056207,0.0009253421,0.00013981713,0.000009981447,0.000091638554,0.00048493984],"genre_scores_gemma":[0.99182886,0.00019183656,0.0071981023,0.000525147,0.00011778891,0.000023836965,0.000016333002,0.000004380366,0.000093698094],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870324,0.00010121062,0.00028102216,0.00046988303,0.00024102633,0.00020363776],"domain_scores_gemma":[0.9990924,0.00014635842,0.00019610973,0.00016292476,0.00027963752,0.0001225688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025680722,0.00014314159,0.00014912097,0.000039674786,0.0004144218,0.0003357235,0.0002022535,0.0000634245,0.000009265088],"category_scores_gemma":[0.00013123802,0.00013340214,0.00001889056,0.00025046457,0.00017560186,0.002205939,0.00014171703,0.00010187564,0.000027297012],"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.0000442013,0.00016668154,0.00024643328,0.000030844007,0.000021327913,0.000014732861,0.014643589,0.000004785849,0.0037467277,0.053497642,0.007132148,0.92045087],"study_design_scores_gemma":[0.0038933589,0.0019138737,0.0037983942,0.00028571664,0.000049063146,0.0005760054,0.009797693,0.54886156,0.00613768,0.0052800616,0.41786802,0.0015385675],"about_ca_topic_score_codex":0.00007630607,"about_ca_topic_score_gemma":0.0000013609742,"teacher_disagreement_score":0.9189123,"about_ca_system_score_codex":0.0000138482455,"about_ca_system_score_gemma":0.000031978132,"threshold_uncertainty_score":0.5439981},"labels":[],"label_agreement":null},{"id":"W2792569903","doi":"10.1002/cpe.4441","title":"Head‐of‐line blocking avoidance in Slim Fly networks using deadlock‐free non‐minimal and adaptive routing","year":2018,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"FPInnovations","keywords":"Computer science; Computer network; Network topology; Distributed computing; Deadlock; Network performance; Network traffic control; Blocking (statistics); Network packet; Queueing theory","score_opus":0.042297635630294955,"score_gpt":0.33971773757415974,"score_spread":0.2974201019438648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792569903","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.44217002,0.00088681356,0.5561785,0.00008781435,0.00036070464,0.00009627046,5.0982965e-7,0.000016499347,0.00020282518],"genre_scores_gemma":[0.987684,0.00009844541,0.0118331695,0.00019382147,0.00017057874,0.000008584248,6.7844826e-7,0.0000055012247,0.000005208479],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858004,0.00015248533,0.00043105285,0.0004410755,0.00015205774,0.00024330307],"domain_scores_gemma":[0.9987805,0.0004206591,0.0003237759,0.00016039549,0.00023747739,0.00007722995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005250817,0.00015396107,0.00022859736,0.000087903994,0.0002992766,0.00017726014,0.000186147,0.00007396328,0.0000017968059],"category_scores_gemma":[0.00016021715,0.000152912,0.000018503075,0.00035767953,0.00020302832,0.0013897128,0.0002323321,0.00018408906,4.9407697e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058799563,0.00035967716,0.023648918,0.00016449636,0.000100896366,0.000100278034,0.24898669,0.026408246,0.00237703,0.07877268,0.00018399501,0.6183091],"study_design_scores_gemma":[0.00051704573,0.0003409561,0.0015028672,0.00022134143,0.000007430488,0.00016278443,0.0045515723,0.9918765,0.00014987642,0.00032751035,0.00016090617,0.00018121598],"about_ca_topic_score_codex":0.00020725385,"about_ca_topic_score_gemma":0.000039642273,"teacher_disagreement_score":0.9654682,"about_ca_system_score_codex":0.000018901537,"about_ca_system_score_gemma":0.000045744062,"threshold_uncertainty_score":0.62355703},"labels":[],"label_agreement":null},{"id":"W2799867926","doi":"10.1002/cpe.4473","title":"Distributed geometric nonnegative matrix factorization and hierarchical alternating least squares–based nonnegative tensor factorization with the MapReduce paradigm","year":2018,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Wroclawskie Centrum Sieciowo-Superkomputerowe, Politechnika Wroclawska; Canadian Institute for Advanced Research","keywords":"Matrix decomposition; Non-negative matrix factorization; Multilinear map; Computer science; Factorization; Dimensionality reduction; Computation; Curse of dimensionality; Tensor (intrinsic definition); Matrix (chemical analysis); Algorithm; Mathematics; Artificial intelligence","score_opus":0.037413872453637066,"score_gpt":0.3647767161157716,"score_spread":0.32736284366213453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799867926","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.38323736,0.000082108745,0.61341417,0.00265365,0.00005433289,0.00033243484,0.000050243772,0.00005340413,0.00012230431],"genre_scores_gemma":[0.9931118,0.00004233161,0.0063200756,0.00025468538,0.00008710824,0.000082244034,0.00007296096,0.000012653562,0.000016165044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987316,0.00017532715,0.00027016108,0.00038255707,0.0002612377,0.0001790871],"domain_scores_gemma":[0.9972512,0.0018105285,0.00034695098,0.000131086,0.00034924387,0.00011096342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016363959,0.0001898961,0.00017107521,0.000097952645,0.0007348228,0.00025024868,0.000093188755,0.000058674013,0.000017526772],"category_scores_gemma":[0.00058891065,0.0001381094,0.00001729567,0.00056781626,0.0004526348,0.00067197194,0.000042133484,0.00018423237,0.0000025292206],"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.0014011404,0.0016249955,0.015410712,0.00048155035,0.00039015556,0.000027570959,0.20295104,0.0008861322,0.005609689,0.6501807,0.0018231765,0.11921313],"study_design_scores_gemma":[0.012613313,0.0045171077,0.110342294,0.000919166,0.001006492,0.0006821945,0.12508589,0.6125291,0.017679997,0.0811662,0.029622275,0.0038359442],"about_ca_topic_score_codex":0.00002318026,"about_ca_topic_score_gemma":0.0000040860914,"teacher_disagreement_score":0.611643,"about_ca_system_score_codex":0.000019981988,"about_ca_system_score_gemma":0.000043681324,"threshold_uncertainty_score":0.56517375},"labels":[],"label_agreement":null},{"id":"W2885921739","doi":"10.1002/cpe.4776","title":"A hierarchical key pre‐distribution scheme for fog networks","year":2018,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":16,"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 Guelph","funders":"University of Salford Manchester","keywords":"Computer science; Scalability; Key (lock); Overhead (engineering); Key management; Scheme (mathematics); Computer network; Distributed computing; Node (physics); Key distribution; Secure communication; Computer security; Public-key cryptography; Engineering; Encryption","score_opus":0.021204020065435494,"score_gpt":0.32660812199244355,"score_spread":0.30540410192700806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885921739","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.091103785,0.0010358818,0.9055137,0.0011466198,0.0006151995,0.00025824248,0.000003860997,0.00010405698,0.00021867831],"genre_scores_gemma":[0.9656753,0.00023686323,0.032966737,0.00072062446,0.00029417625,0.000065893306,0.000023533588,0.0000058106666,0.000011068775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865454,0.00010656085,0.00026372788,0.00050210056,0.00017766797,0.00029537047],"domain_scores_gemma":[0.99834085,0.0008404321,0.00016494727,0.00019438646,0.00032043655,0.00013895363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029466877,0.00015227823,0.00015140067,0.000033882097,0.00047338885,0.00034152318,0.00024482363,0.000102651255,0.000003514929],"category_scores_gemma":[0.000405609,0.00015412013,0.000028393139,0.00026472736,0.00031881974,0.0014045954,0.0001620859,0.00018392011,0.0000035116616],"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.00024264374,0.00021421426,0.00064619805,0.00005527244,0.000043432283,0.000010394565,0.035204243,0.00046472342,0.00016213192,0.37001505,0.003452918,0.5894888],"study_design_scores_gemma":[0.0005181701,0.00034757835,0.0007278338,0.00003706194,0.000010607498,0.000091987,0.0004723465,0.9686098,0.00012326663,0.0033751063,0.025453068,0.00023313619],"about_ca_topic_score_codex":0.000010179207,"about_ca_topic_score_gemma":0.000001455637,"teacher_disagreement_score":0.96814513,"about_ca_system_score_codex":0.000016411472,"about_ca_system_score_gemma":0.000043029162,"threshold_uncertainty_score":0.62848365},"labels":[],"label_agreement":null},{"id":"W2888980102","doi":"10.1002/cpe.4667","title":"Design considerations for GPU‐aware collective communications in MPI","year":2018,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Computer science; CUDA; Parallel computing; Message passing; Efficient energy use; Process (computing); Distributed computing; Operating system","score_opus":0.12639618549631798,"score_gpt":0.37804482261956185,"score_spread":0.25164863712324387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888980102","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.012149154,0.0008583129,0.9829208,0.0028342484,0.0002113167,0.00035102462,0.000003002802,0.000055866207,0.00061623706],"genre_scores_gemma":[0.9589602,0.00018139079,0.039737143,0.00092447014,0.000024375593,0.00013454333,0.0000025014333,0.0000033074973,0.00003210558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990621,0.00019327571,0.00021061207,0.00030376657,0.00008891586,0.00014133689],"domain_scores_gemma":[0.9970387,0.0022438902,0.00010739727,0.00022919863,0.00032395744,0.000056830202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003202314,0.000095482545,0.00011302977,0.000087470864,0.0005985652,0.00026218372,0.00018396309,0.0000389234,0.0000025814304],"category_scores_gemma":[0.000572432,0.000099321886,0.000014992848,0.00023284368,0.0002166768,0.0012290028,0.00012990125,0.000100709505,0.000003439702],"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.0002674704,0.0007492087,0.0016308026,0.00006326465,0.000089954556,0.000024013818,0.3332175,0.00071181374,0.0021264488,0.3715732,0.005422654,0.28412366],"study_design_scores_gemma":[0.0010082305,0.00044758318,0.00063579436,0.00005370166,0.000015634358,0.00010234093,0.0058544367,0.96449864,0.00027847782,0.024562547,0.0022645544,0.0002780388],"about_ca_topic_score_codex":0.00005082198,"about_ca_topic_score_gemma":0.000021062544,"teacher_disagreement_score":0.96378684,"about_ca_system_score_codex":0.000024302788,"about_ca_system_score_gemma":0.00016152099,"threshold_uncertainty_score":0.46037403},"labels":[],"label_agreement":null},{"id":"W2893723147","doi":"10.1002/cpe.4862","title":"Communication‐aware message matching in MPI","year":2018,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Computer science; Message queue; Message passing; Message Passing Interface; Speedup; Asynchronous communication; Scalability; Parallel computing; Queue; Matching (statistics); Distributed computing; Computer network; Operating system","score_opus":0.024626881156139355,"score_gpt":0.3474426032332346,"score_spread":0.32281572207709525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2893723147","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.049035262,0.0010388062,0.9448367,0.0012134735,0.00010858998,0.000104698476,4.2951723e-7,0.00016799576,0.003494048],"genre_scores_gemma":[0.9124656,0.0005128775,0.08628633,0.0006721709,0.00001849323,0.000016461374,0.0000024508224,0.0000035481924,0.000022100003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989963,0.00017796627,0.00024099853,0.00030773884,0.0001286402,0.00014831666],"domain_scores_gemma":[0.9990749,0.00034959323,0.00014239407,0.00022150288,0.00015178147,0.000059872946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037053466,0.000105459985,0.00011484995,0.00009444348,0.00031912889,0.0002616895,0.00030282594,0.00004519691,0.0000047416706],"category_scores_gemma":[0.00012949079,0.00010749772,0.000011025525,0.00031960034,0.00016083171,0.0015962386,0.00025278097,0.00013876233,0.0000060950747],"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.000047066867,0.0002960853,0.002913997,0.000060853898,0.00002061726,0.000024771136,0.17271787,0.0011805048,0.00019269386,0.2507152,0.0012547754,0.57057554],"study_design_scores_gemma":[0.0010005877,0.00029439773,0.0054618036,0.00025744713,0.000010095094,0.00018689294,0.0066068587,0.93836856,0.0007919394,0.03435651,0.011987975,0.0006769445],"about_ca_topic_score_codex":0.000065089036,"about_ca_topic_score_gemma":0.000005149377,"teacher_disagreement_score":0.937188,"about_ca_system_score_codex":0.000012298771,"about_ca_system_score_gemma":0.000036295027,"threshold_uncertainty_score":0.438363},"labels":[],"label_agreement":null},{"id":"W2894493142","doi":"10.1002/cpe.4719","title":"RIN: A dynamic pseudonym change system for privacy in VANET","year":2018,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pseudonym; Computer science; Vehicular ad hoc network; Anonymity; Computer security; Protocol (science); Computer network; Credibility; Intelligent transportation system; Wireless ad hoc network; Confidentiality; Telecommunications; Wireless","score_opus":0.023530763349734203,"score_gpt":0.30562076843279307,"score_spread":0.28209000508305887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894493142","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.89429253,0.004196977,0.09925228,0.0001651222,0.0007681846,0.0005663839,0.0000064571955,0.0001713935,0.0005806584],"genre_scores_gemma":[0.9974687,0.0002904981,0.0018418838,0.0000912759,0.00011212858,0.00016666467,0.00001131674,0.000012201146,0.000005343922],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926925,0.00003527776,0.00019206107,0.00021634198,0.000080641,0.0002064102],"domain_scores_gemma":[0.9995468,0.00018224538,0.00005379121,0.00008735996,0.00006384436,0.0000659374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015833118,0.00012001738,0.00013365332,0.000055507724,0.00009370542,0.00006835191,0.00006644622,0.0000560251,0.000003292886],"category_scores_gemma":[0.000061899314,0.00012643705,0.000012906393,0.00014395698,0.00006977455,0.00069338485,0.000030107512,0.0000926844,0.000006508026],"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.00028042987,0.00017092621,0.0021937008,0.0017311526,0.0001028645,0.000085608284,0.15333354,0.029730909,0.0013875186,0.00866696,0.0010095685,0.80130684],"study_design_scores_gemma":[0.0005161593,0.0001115124,0.0011189817,0.00011385202,0.000013149056,0.00009444313,0.0026461766,0.98449194,0.00006741465,0.000085998174,0.010560127,0.00018024688],"about_ca_topic_score_codex":0.0000167767,"about_ca_topic_score_gemma":0.0000127071135,"teacher_disagreement_score":0.954761,"about_ca_system_score_codex":0.000031922664,"about_ca_system_score_gemma":0.000011153146,"threshold_uncertainty_score":0.5155953},"labels":[],"label_agreement":null},{"id":"W2895792075","doi":"10.1002/cpe.5035","title":"Optimal matching between energy saving and traffic load for mobile multimedia communication","year":2018,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"National Natural Science Foundation of China","keywords":"Cellular network; Computer science; Operating expense; Cellular traffic; Maximization; Energy consumption; Computer network; Base station; Capital expenditure; Matching (statistics); Minification; Mobile telephony; Energy (signal processing); Efficient energy use; Telecommunications; Mobile radio; Engineering; Mathematical optimization","score_opus":0.016490010716010785,"score_gpt":0.3060330158584909,"score_spread":0.2895430051424801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895792075","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.36323556,0.00294139,0.63336533,0.00002277208,0.000101710066,0.00014550173,0.000003890777,0.000078172074,0.000105676394],"genre_scores_gemma":[0.94822264,0.00069453684,0.050852574,0.000026120028,0.00007242239,0.00009244982,0.000020696918,0.00001169223,0.0000068971112],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994118,0.0000359555,0.00019854012,0.00017305752,0.00006384419,0.00011676108],"domain_scores_gemma":[0.999169,0.00048342787,0.00008148156,0.00007961985,0.00012917469,0.000057290577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013864292,0.00010450234,0.00011780198,0.00003379646,0.00025097432,0.00008263953,0.0000482488,0.000050577954,0.0000020561413],"category_scores_gemma":[0.000089289635,0.00011458006,0.000008757698,0.00007445113,0.00011780178,0.0009519846,0.000029848683,0.00006220633,7.994545e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003624652,0.000025882915,0.0001457523,0.00013192485,0.000032495147,7.090546e-7,0.07778286,0.11140596,0.0011396831,0.0006342575,0.00008862004,0.80857563],"study_design_scores_gemma":[0.0006389416,0.00014416198,0.00017420763,0.00009285595,0.00003095413,0.000024311094,0.010419626,0.9819675,0.00052026514,0.00016153586,0.005569026,0.00025661557],"about_ca_topic_score_codex":0.000015411202,"about_ca_topic_score_gemma":0.000004598486,"teacher_disagreement_score":0.87056154,"about_ca_system_score_codex":0.00001950869,"about_ca_system_score_gemma":0.00001286234,"threshold_uncertainty_score":0.46724394},"labels":[],"label_agreement":null},{"id":"W2896055537","doi":"10.1002/cpe.5024","title":"A multi‐granularity locking scheme for java packedobjects based on a concurrent multiway tree","year":2018,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); University of New Brunswick","funders":"Atlantic Canada Opportunities Agency; Center for Advanced Study, University of Illinois at Urbana-Champaign; New Brunswick Innovation Foundation; International Business Machines Corporation","keywords":"Computer science; Java; Granularity; Concurrent data structure; Tree (set theory); Java concurrency; Parallel computing; Synchronization (alternating current); Consistency (knowledge bases); Distributed computing; Data structure; Workload; Object (grammar); Operating system; Real time Java; Artificial intelligence","score_opus":0.04154552241589729,"score_gpt":0.3547900129040608,"score_spread":0.3132444904881635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896055537","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.03058196,0.00069361884,0.96634406,0.00075674755,0.00068358774,0.0004514934,0.000017129183,0.000104989274,0.0003664262],"genre_scores_gemma":[0.95299006,0.000030182238,0.045944657,0.00080006366,0.000081095925,0.00011490342,0.000014324986,0.000007287059,0.000017440983],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830425,0.00012533556,0.00033598547,0.0006703108,0.0002572368,0.00030685807],"domain_scores_gemma":[0.99830997,0.0005986291,0.00025457234,0.00024398572,0.00043204374,0.00016081598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040615865,0.00022141763,0.00022981426,0.00007520768,0.00053102075,0.00040907465,0.00025123704,0.00008151253,0.0000037581144],"category_scores_gemma":[0.00052113674,0.00020591024,0.000046592817,0.00027534494,0.00023389043,0.0011517722,0.00007987686,0.00014542423,0.000008627149],"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.00024289178,0.0008842883,0.0017682905,0.00026327537,0.00005162141,0.000030138071,0.034823444,0.00019404538,0.0014933172,0.0515571,0.0017604413,0.90693116],"study_design_scores_gemma":[0.0020444237,0.00047637566,0.001172571,0.0001770864,0.000011198281,0.000024725123,0.0010162216,0.9726981,0.0005928398,0.00023316576,0.02121936,0.00033395799],"about_ca_topic_score_codex":0.00003166282,"about_ca_topic_score_gemma":0.000008625891,"teacher_disagreement_score":0.972504,"about_ca_system_score_codex":0.000021414216,"about_ca_system_score_gemma":0.000087997876,"threshold_uncertainty_score":0.83967763},"labels":[],"label_agreement":null},{"id":"W2896435355","doi":"10.1002/cpe.5021","title":"Real‐time multiuser scheduling based on end‐user requirement using big data analytics","year":2018,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"National Natural Science Foundation of China","keywords":"Computer science; Maximum throughput scheduling; Scheduling (production processes); Quality of service; Computer network; Wireless network; Wireless; Throughput; Fading; Distributed computing; Channel (broadcasting); Round-robin scheduling; Fair-share scheduling; Telecommunications; Engineering","score_opus":0.08366151756304095,"score_gpt":0.3472004218482463,"score_spread":0.2635389042852053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896435355","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.14952624,0.00022736317,0.8489337,0.00005621289,0.00042147277,0.000125044,0.000006636985,0.00011999542,0.00058334204],"genre_scores_gemma":[0.92780495,0.00038950486,0.07141007,0.00012742044,0.00019194104,0.000005443666,0.00004779835,0.000016991422,0.000005907186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909097,0.00004460176,0.00022546948,0.00031091596,0.00016023983,0.00016779355],"domain_scores_gemma":[0.99922854,0.00024667333,0.00009591319,0.00023658789,0.00012076962,0.00007149754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016539212,0.00014048221,0.000120812794,0.000065892105,0.00019685092,0.0000903819,0.00010383783,0.00005044674,0.000013829901],"category_scores_gemma":[0.00016215771,0.00014844596,0.000008399787,0.00022172258,0.00011391101,0.0009630315,0.000060858223,0.00009818942,0.0000068784457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003753983,0.000034120803,0.00017369288,0.000027674136,0.000015274369,0.0000040142595,0.0016614888,0.9159245,0.0016788737,0.00015534031,0.000057699526,0.08022981],"study_design_scores_gemma":[0.00032044607,0.000060012833,0.00008156231,0.00007823348,0.000025369474,0.000004679522,0.0004878833,0.9967578,0.00045428722,0.000022572429,0.001528453,0.00017871422],"about_ca_topic_score_codex":0.000010502021,"about_ca_topic_score_gemma":0.0000013967806,"teacher_disagreement_score":0.7782787,"about_ca_system_score_codex":0.000029967441,"about_ca_system_score_gemma":0.000028772381,"threshold_uncertainty_score":0.6053451},"labels":[],"label_agreement":null},{"id":"W2900103250","doi":"10.1002/cpe.5074","title":"Pansharpening multispectral remote‐sensing images with guided filter for monitoring impact of human behavior on environment","year":2018,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Advanced Image Fusion Techniques","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; Department of Science and Technology of Sichuan Province; Alberta Innovates - Health Solutions","keywords":"Panchromatic film; Multispectral image; Computer science; Artificial intelligence; Image fusion; Computer vision; Image resolution; Remote sensing; Redundancy (engineering); Hyperspectral imaging; Composite image filter; Filter (signal processing); Image (mathematics)","score_opus":0.035723690027471125,"score_gpt":0.3739108459302976,"score_spread":0.3381871559028265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900103250","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.61536723,0.0001772592,0.38405028,0.0000073933,0.000045295372,0.00017648615,0.000003888112,0.000060261602,0.00011193752],"genre_scores_gemma":[0.90706325,0.00008910877,0.09277298,0.000007007801,0.00003802071,0.000008550568,0.000003575523,0.000012129019,0.0000053517465],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99942696,0.000015980437,0.00016966661,0.00017434459,0.00008642207,0.00012664734],"domain_scores_gemma":[0.9995968,0.00012735755,0.000085760425,0.00008300412,0.00007064355,0.000036478326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000607335,0.000119136006,0.00011554121,0.00004451788,0.00013776928,0.00003942028,0.00003659205,0.000027375108,0.000007835218],"category_scores_gemma":[0.000052020998,0.00010509476,0.0000186211,0.000043565913,0.00011699986,0.00049655646,0.000017567754,0.00007461364,5.977653e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084573294,0.000036575984,0.00074155047,0.00004921208,0.00002443343,0.00000948377,0.0090413075,0.00089108583,0.25427198,0.000029636436,0.00007051141,0.7347496],"study_design_scores_gemma":[0.0014480557,0.002941968,0.013017118,0.00044832478,0.00008745634,0.00013996768,0.0035980302,0.1058118,0.87112015,0.00038477322,0.0003470847,0.0006552841],"about_ca_topic_score_codex":0.00002304856,"about_ca_topic_score_gemma":1.9218598e-7,"teacher_disagreement_score":0.7340943,"about_ca_system_score_codex":0.0000252442,"about_ca_system_score_gemma":0.000005700784,"threshold_uncertainty_score":0.42856398},"labels":[],"label_agreement":null},{"id":"W2913493033","doi":"10.1002/cpe.5173","title":"An opcode‐based technique for polymorphic Internet of Things malware detection","year":2019,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":101,"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 Guelph","funders":"","keywords":"Opcode; Computer science; Malware; Internet of Things; The Internet; Computer security; World Wide Web; Operating system","score_opus":0.0161056960932537,"score_gpt":0.32302480902261166,"score_spread":0.306919112929358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913493033","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.045444697,0.00019976817,0.9532573,0.000120955745,0.00018785485,0.00051588187,0.000001579356,0.0001724335,0.00009948799],"genre_scores_gemma":[0.85225785,0.000023678687,0.14723565,0.0002944606,0.00000970284,0.00015893948,0.0000029820894,0.000006544753,0.000010177178],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989641,0.000079425205,0.00025877156,0.00041971687,0.0001412339,0.00013678634],"domain_scores_gemma":[0.99885505,0.00032820867,0.00028416904,0.0002148737,0.00025316273,0.00006453128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027485366,0.00013005437,0.00015403381,0.0001274086,0.000091796086,0.00009823908,0.0002246621,0.00007659329,0.0000045007737],"category_scores_gemma":[0.00014637086,0.00013272281,0.000026662186,0.00021837273,0.00007789561,0.0030616198,0.00006601611,0.00011885764,0.0000011881269],"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.00025038992,0.00021054053,0.0005979636,0.00028457816,0.000017173998,0.0000041003086,0.013076963,0.00019370225,0.19680108,0.02435879,0.000020901314,0.7641838],"study_design_scores_gemma":[0.00060156337,0.0016340222,0.00027567768,0.000102725586,0.000012565938,0.000102336824,0.0011852675,0.4219364,0.5661807,0.0057810578,0.0018405768,0.00034710552],"about_ca_topic_score_codex":0.000036606518,"about_ca_topic_score_gemma":6.967884e-7,"teacher_disagreement_score":0.8068132,"about_ca_system_score_codex":0.000016294453,"about_ca_system_score_gemma":0.000039746225,"threshold_uncertainty_score":0.54122794},"labels":[],"label_agreement":null},{"id":"W2921252202","doi":"10.1002/cpe.5237","title":"An efficient virtual machine allocation algorithm for parallel and distributed simulation applications","year":2019,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Computer science; Virtual machine; Latency (audio); Distributed computing; Execution time; Scheduling (production processes); Cloud computing; Synchronization (alternating current); Algorithm; Parallel computing; Operating system; Computer network","score_opus":0.013674758637341819,"score_gpt":0.31486774461260847,"score_spread":0.30119298597526667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921252202","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.11462835,0.0004886081,0.8837422,0.0003870247,0.0001124086,0.0005145198,0.0000058556584,0.00007792244,0.00004312256],"genre_scores_gemma":[0.9602376,0.00003208419,0.0393362,0.0002142949,0.000035181074,0.00008623152,0.000037036105,0.00000464966,0.000016698654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989493,0.0000736742,0.0002109703,0.00046827007,0.00015048099,0.00014732881],"domain_scores_gemma":[0.998981,0.00045554028,0.00015258782,0.00018050695,0.00013726078,0.00009308518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027278307,0.00012321424,0.00011602429,0.000055108198,0.00030913024,0.00025572404,0.00014557813,0.000040367042,0.000001140312],"category_scores_gemma":[0.000039294697,0.000118082586,0.00001532029,0.0001748754,0.00006025064,0.0002345777,0.00010624482,0.00007199179,0.000002890563],"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.000010960202,0.00009736517,0.00011410503,0.000018851924,0.000008748756,4.1627317e-7,0.0037045905,0.25892177,0.000032136388,0.018197041,0.00000643238,0.71888757],"study_design_scores_gemma":[0.0005483818,0.00023047751,0.0008201119,0.00001273076,0.00001237975,0.0000102932145,0.0013927526,0.9915296,0.000009301434,0.00045193575,0.0048220064,0.00016006138],"about_ca_topic_score_codex":0.00001350459,"about_ca_topic_score_gemma":3.4006013e-7,"teacher_disagreement_score":0.84560925,"about_ca_system_score_codex":0.0000126450595,"about_ca_system_score_gemma":0.000018146446,"threshold_uncertainty_score":0.48152682},"labels":[],"label_agreement":null},{"id":"W2927467691","doi":"10.1002/cpe.5252","title":"Deep learning models for diagnosing spleen and stomach diseases in smart Chinese medicine with cloud computing","year":2019,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"AI in cancer detection","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Cloud computing; Computer science; Spleen; Stomach; Deep learning; Modern medicine; Traditional Chinese medicine; Artificial intelligence; Medicine; Pathology; Internal medicine; Intensive care medicine","score_opus":0.019429412356215373,"score_gpt":0.31814882606554995,"score_spread":0.2987194137093346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2927467691","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.42152235,0.0023580918,0.5751727,0.00038324617,0.00022094912,0.00021165902,2.5163348e-7,0.000039842216,0.000090887166],"genre_scores_gemma":[0.9918812,0.0003528623,0.0074246274,0.00022902706,0.000065236185,0.00003120789,0.0000033960084,0.0000070377273,0.0000054104776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988734,0.00010047024,0.00021481264,0.00046290812,0.00016754578,0.00018085414],"domain_scores_gemma":[0.99812084,0.0014047727,0.00018443736,0.00010062044,0.00010664791,0.00008267381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025076856,0.0001447757,0.00019993617,0.00008840271,0.00022924782,0.00014536017,0.00010732486,0.000035483987,0.0000014113934],"category_scores_gemma":[0.00021417302,0.000120903096,0.000009936682,0.00027798067,0.00011399029,0.0019231215,0.0001023582,0.0001489514,4.9136565e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022379422,0.00009553066,0.12975961,0.0002773359,0.000028155355,0.000015448757,0.089011446,0.054331176,0.00011082988,0.010486149,0.000022968628,0.71563756],"study_design_scores_gemma":[0.0010278933,0.00044836284,0.012608715,0.00014199383,0.0000122386755,0.000062777064,0.003307363,0.98009527,0.000010055477,0.0018193389,0.00028528762,0.00018068371],"about_ca_topic_score_codex":0.000079941325,"about_ca_topic_score_gemma":0.000009156762,"teacher_disagreement_score":0.92576414,"about_ca_system_score_codex":0.000021731432,"about_ca_system_score_gemma":0.000029713134,"threshold_uncertainty_score":0.49302852},"labels":[],"label_agreement":null},{"id":"W2928103424","doi":"10.1002/cpe.5231","title":"LTTng‐HSA: Bringing LTTng tracing to HSA‐based GPU runtimes","year":2019,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Tracing; TRACE (psycholinguistics); Profiling (computer programming); Kernel (algebra); Software; Operating system; Parallel computing","score_opus":0.01656622417478217,"score_gpt":0.3033139268613858,"score_spread":0.28674770268660366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2928103424","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.27916026,0.0006821351,0.71584624,0.00081339997,0.000728371,0.00024337183,0.0000019910765,0.00014788589,0.0023763028],"genre_scores_gemma":[0.988014,0.000020693002,0.010948249,0.0008425981,0.000060674254,0.00001570085,0.0000070166066,0.000007970752,0.000083108855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982488,0.00013570553,0.0003523872,0.0006446327,0.0002821939,0.000336241],"domain_scores_gemma":[0.9985654,0.00061615254,0.00020625781,0.0002610309,0.00016711479,0.00018406805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042534576,0.00020958969,0.00024109465,0.00012269095,0.0003173191,0.00066185906,0.0003443417,0.00005969708,0.0000112203315],"category_scores_gemma":[0.00017445422,0.00021142283,0.000039590344,0.00046725958,0.000046082634,0.0015220839,0.00018548874,0.00017310286,0.000070635135],"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.00016988513,0.0005421322,0.018623127,0.0006589378,0.00014880089,0.00014487395,0.122806355,0.060037885,0.0028048283,0.07647985,0.0025118312,0.7150715],"study_design_scores_gemma":[0.0008758718,0.0003136054,0.0038441771,0.0003455836,0.000019926854,0.000144576,0.0030773839,0.9712793,0.0003704841,0.00029818586,0.01880656,0.00062431477],"about_ca_topic_score_codex":0.00006984541,"about_ca_topic_score_gemma":9.4922655e-7,"teacher_disagreement_score":0.9112415,"about_ca_system_score_codex":0.000023034447,"about_ca_system_score_gemma":0.00007622666,"threshold_uncertainty_score":0.8621573},"labels":[],"label_agreement":null},{"id":"W2936740280","doi":"10.1002/cpe.5205","title":"Model checking ontology‐driven reasoning agents using strategy and abstraction","year":2019,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Abstraction; Model checking; Linear temporal logic; Ontology; Programming language; Temporal logic; Encoding (memory); Exploit; Theoretical computer science; Artificial intelligence","score_opus":0.07800741567634234,"score_gpt":0.36752603295872555,"score_spread":0.2895186172823832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2936740280","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.75438875,0.00089663453,0.24331364,0.00015462651,0.00020496683,0.000098616794,2.9267824e-7,0.00006484626,0.00087760546],"genre_scores_gemma":[0.9754693,0.00029839965,0.023976011,0.00021306826,0.000015625716,0.0000049994283,8.605723e-7,0.000004373883,0.00001739364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990305,0.00005862208,0.00019406862,0.00040488705,0.00013298019,0.0001789797],"domain_scores_gemma":[0.9993449,0.0002044555,0.00018222447,0.000119772056,0.00008165285,0.00006703906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016877515,0.00012394092,0.00014837421,0.00005499645,0.00021694154,0.00027047814,0.000116753006,0.00006674953,0.0000027787225],"category_scores_gemma":[0.00010509929,0.000120555334,0.000013288426,0.00010178703,0.0000844612,0.0023577907,0.000115536866,0.00013361602,0.0000037025113],"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.000116882686,0.00022200322,0.06838013,0.00025400333,0.00009458902,0.00008268138,0.09047747,0.044694044,0.008401649,0.17132194,0.00007352637,0.6158811],"study_design_scores_gemma":[0.00029389435,0.00006883458,0.010357082,0.00004563823,0.000012069721,0.00018731353,0.0043606088,0.9830197,0.00008319602,0.0012661916,0.00014281704,0.00016263821],"about_ca_topic_score_codex":0.00010424728,"about_ca_topic_score_gemma":0.000004895002,"teacher_disagreement_score":0.9383257,"about_ca_system_score_codex":0.000013166762,"about_ca_system_score_gemma":0.000052640196,"threshold_uncertainty_score":0.4916104},"labels":[],"label_agreement":null},{"id":"W2944543431","doi":"10.1002/cpe.5311","title":"Identification of Android malware using refined system calls","year":2019,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"European Commission; Intel Corporation; Silicon Valley Community Foundation","keywords":"Malware; System call; Opcode; Feature selection; Computer science; Android malware; Android (operating system); Data mining; Artificial intelligence; Machine learning; Computer security; Operating system","score_opus":0.016725939229347706,"score_gpt":0.32137278620779663,"score_spread":0.3046468469784489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944543431","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.27564302,0.00040815165,0.7232617,0.000065014516,0.00022203648,0.0001558884,0.000001553923,0.00010677973,0.00013587106],"genre_scores_gemma":[0.9761035,0.000059974114,0.023728158,0.000060838913,0.000010307489,0.000013889845,0.0000019936356,0.0000041392027,0.000017188804],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998969,0.00007969475,0.00033631694,0.0003356724,0.00017234989,0.00010696541],"domain_scores_gemma":[0.998939,0.00018697957,0.0003794174,0.00020108496,0.00024603153,0.0000474988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002330482,0.000097279546,0.00014264027,0.00008630849,0.00010742088,0.000095878335,0.00015216261,0.000046221372,0.0000016004325],"category_scores_gemma":[0.00011911868,0.00009952564,0.000016676197,0.00026321894,0.000060502258,0.0019421687,0.00010221017,0.00007974463,0.00000272313],"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.00014745016,0.00020798479,0.0023089126,0.001073333,0.00005271147,0.00003605787,0.028954592,0.0020099704,0.21810853,0.20517333,0.000063820735,0.5418633],"study_design_scores_gemma":[0.00095441384,0.00047444727,0.0017681577,0.00031673643,0.000034574667,0.0010531222,0.010477022,0.88153666,0.09820611,0.0021734734,0.0023762663,0.00062899094],"about_ca_topic_score_codex":0.000014419344,"about_ca_topic_score_gemma":2.1692222e-7,"teacher_disagreement_score":0.87952673,"about_ca_system_score_codex":0.000024011313,"about_ca_system_score_gemma":0.000034421504,"threshold_uncertainty_score":0.4058538},"labels":[],"label_agreement":null},{"id":"W2965627370","doi":"10.1002/cpe.5454","title":"Internet of Things ‐ integrated IR‐UWB technology for healthcare applications","year":2019,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Wireless Body Area Networks","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Université du Québec à Chicoutimi","funders":"","keywords":"Body area network; Computer science; Wireless; Node (physics); Computer network; Wireless sensor network; Ultra-wideband; Channel (broadcasting); Physical layer; Telecommunications; Electronic engineering; Engineering","score_opus":0.014713538262144091,"score_gpt":0.29036538337381906,"score_spread":0.27565184511167495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965627370","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.39749286,0.0038049454,0.59683394,0.00043891073,0.00023383193,0.0005182849,0.000005411712,0.00014937174,0.0005224139],"genre_scores_gemma":[0.9948497,0.00029121482,0.004581372,0.00008408739,0.000012689579,0.00014210578,0.000017483642,0.0000075318358,0.000013825064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950415,0.000013005835,0.00018038297,0.00015350625,0.000048409034,0.000100517704],"domain_scores_gemma":[0.9994877,0.00020163384,0.000074480915,0.00007630242,0.00012793038,0.000031947882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006985945,0.000079588826,0.00012084924,0.00006287264,0.000037078724,0.000021870017,0.000067116875,0.000070293936,0.0000047228623],"category_scores_gemma":[0.000038838334,0.00008047554,0.000010936138,0.00017837474,0.00007042204,0.00040449263,0.000023396993,0.00011500516,0.000002762179],"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.00005759696,0.000054402302,0.0030555034,0.0005976503,0.000046830486,9.2766345e-7,0.021961814,0.001667602,0.0019238753,0.07074662,0.0003628469,0.89952433],"study_design_scores_gemma":[0.0008813028,0.00033169042,0.0003944421,0.00024352,0.000032550637,0.000056057055,0.019535089,0.9171902,0.0036706855,0.0037491368,0.053529266,0.00038607072],"about_ca_topic_score_codex":0.000016155811,"about_ca_topic_score_gemma":9.307817e-7,"teacher_disagreement_score":0.9155226,"about_ca_system_score_codex":0.000010280647,"about_ca_system_score_gemma":0.000015948164,"threshold_uncertainty_score":0.32816973},"labels":[],"label_agreement":null},{"id":"W2981614872","doi":"10.1002/cpe.5530","title":"The modeling of urban rail transit emergency delay propagation scope under network operation mode","year":2019,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ministry of Education and Child Care","funders":"National Key Research and Development Program of China; Science and Technology Commission of Shanghai Municipality; National Natural Science Foundation of China","keywords":"Urban rail transit; Reliability (semiconductor); Scope (computer science); Computer science; Mode (computer interface); Transit (satellite); Transport engineering; Public transport; Simulation; Engineering; Power (physics)","score_opus":0.024750118871127637,"score_gpt":0.3350850981481921,"score_spread":0.31033497927706444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981614872","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.3734072,0.0029917145,0.6187195,0.0008791289,0.0005043329,0.00035164144,0.0000019544761,0.000035981502,0.0031085196],"genre_scores_gemma":[0.99568486,0.0030815601,0.00097232615,0.000068415764,0.000052081494,0.000015953307,0.00001956197,0.000004316465,0.00010089923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999026,0.00016354646,0.0002819333,0.00018035785,0.00021676396,0.00013140106],"domain_scores_gemma":[0.9993295,0.00017513074,0.00015680572,0.000057795478,0.00023391441,0.00004686615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043482744,0.000074002855,0.000085536645,0.000022075255,0.0006995288,0.00008570438,0.00006222383,0.00005115086,0.000018858434],"category_scores_gemma":[0.00007833444,0.00006302443,0.000016185488,0.00018244518,0.00009123173,0.0012642527,0.0000055423375,0.00007943229,0.0000026147075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007583478,0.000027797716,0.0022338023,0.000021455575,0.000013537183,3.2924675e-7,0.08509056,0.7923373,0.000104398634,0.10816849,0.000070095826,0.011856404],"study_design_scores_gemma":[0.00039659304,0.00008616116,0.0007955655,0.000057341225,0.000034077613,0.0000020991013,0.031602334,0.96196705,0.000036721016,0.0020892115,0.002750057,0.00018279965],"about_ca_topic_score_codex":0.00026326644,"about_ca_topic_score_gemma":0.00009680028,"teacher_disagreement_score":0.6222777,"about_ca_system_score_codex":0.000009449626,"about_ca_system_score_gemma":0.000090848174,"threshold_uncertainty_score":0.53802806},"labels":[],"label_agreement":null},{"id":"W2985159807","doi":"10.1002/cpe.6304","title":"Efficient computation of positional population counts using SIMD instructions","year":2021,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ","funders":"National Research Council Canada","keywords":"SIMD; Byte; Computation; Population; Categorical variable; Generalization; Code (set theory)","score_opus":0.028173393668598026,"score_gpt":0.3417117682646383,"score_spread":0.3135383745960403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2985159807","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.22869503,0.000744536,0.76962054,0.00008586724,0.00036943937,0.00004273479,0.000004958139,0.000019593606,0.0004172808],"genre_scores_gemma":[0.9488093,0.000044419845,0.051019173,0.000074266085,0.000022508822,0.0000020059813,0.000022131166,0.000001925779,0.0000042531474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935114,0.000056253928,0.000168321,0.00019785004,0.00016034633,0.00006610892],"domain_scores_gemma":[0.9994631,0.000100805744,0.00012655614,0.000070835275,0.00020075831,0.000037991962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007261815,0.00005990005,0.000076530705,0.000041413747,0.0001709717,0.00007938264,0.000050274033,0.000027935737,0.0000057013067],"category_scores_gemma":[0.00006009448,0.000061362734,0.000012254051,0.00019431453,0.0000443352,0.0004944036,0.0000802151,0.000053864787,0.0000018351158],"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.000030041318,0.00037827197,0.0015790102,0.0001181983,0.000038619968,0.000023206749,0.009650886,0.044668853,0.003956962,0.1658521,0.00030916987,0.7733947],"study_design_scores_gemma":[0.00019420366,0.000028727865,0.0043481924,0.000048149763,0.000009187054,0.00015947492,0.0004906061,0.9922983,0.00016268478,0.0016192682,0.00054574973,0.000095457006],"about_ca_topic_score_codex":0.000025463312,"about_ca_topic_score_gemma":2.705784e-7,"teacher_disagreement_score":0.94762945,"about_ca_system_score_codex":0.000010293997,"about_ca_system_score_gemma":0.000049665086,"threshold_uncertainty_score":0.25022998},"labels":[],"label_agreement":null},{"id":"W3016583051","doi":"10.1002/cpe.1531","title":"Pattern informatics approach to earthquake forecasting in 3D","year":2009,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"earthquake and tectonic studies","field":"Earth and Planetary Sciences","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"U.S. Geological Survey; Natural Sciences and Engineering Research Council of Canada; Southern California Earthquake Center; Institute for Catastrophic Loss Reduction; National Science Foundation","keywords":"Induced seismicity; Seismology; Geology; Unobservable; Tectonics; Microseism; Scale (ratio); Geography; Cartography; Econometrics; Mathematics","score_opus":0.040343145715003234,"score_gpt":0.28039744706104325,"score_spread":0.24005430134604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016583051","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.96732944,0.001104722,0.014475789,0.0002718403,0.00009039378,0.00015184065,0.00000336308,0.000022874538,0.016549753],"genre_scores_gemma":[0.99408734,0.00019996805,0.0044213664,0.0012456094,0.000024714012,0.0000024273857,0.0000100122425,9.328195e-7,0.000007653803],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992421,0.000039862,0.00023873617,0.00016117284,0.00013108482,0.00018704266],"domain_scores_gemma":[0.99950534,0.00023776386,0.000080382204,0.000053803837,0.000039676524,0.00008301296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020308113,0.000100879006,0.00012336062,0.00006954652,0.00016453711,0.00010081208,0.00005502736,0.000030319687,0.000017004191],"category_scores_gemma":[0.0001717848,0.00008854198,0.0000099623985,0.00021173795,0.00004583134,0.00071452645,0.000011858217,0.00010985548,0.000012788602],"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.00001149166,0.00001615062,0.038269106,0.000010309806,0.000002263643,0.0000033634046,0.023637613,0.00082473026,4.9547765e-7,0.00006619218,0.00002127917,0.937137],"study_design_scores_gemma":[0.0004994343,0.00039324342,0.7740648,0.000056873643,0.00000979755,0.00012037227,0.02182062,0.1984797,0.0000067375377,0.0003260355,0.0039343187,0.0002881046],"about_ca_topic_score_codex":0.00016353648,"about_ca_topic_score_gemma":0.000052561798,"teacher_disagreement_score":0.9368489,"about_ca_system_score_codex":0.0000014919157,"about_ca_system_score_gemma":0.000016737082,"threshold_uncertainty_score":0.36106372},"labels":[],"label_agreement":null},{"id":"W3018597471","doi":"10.1002/cpe.6270","title":"High‐performance SIMD modular arithmetic for polynomial evaluation","year":2021,"lang":"en","type":"preprint","venue":"Concurrency and Computation Practice and Experience","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"SIMD; Computer science; Parallel computing; Polynomial; Modular design; Computation; Modular arithmetic; Matrix polynomial; Compiler; Arithmetic; Mathematics; Algorithm; Programming language","score_opus":0.05114997092760116,"score_gpt":0.37793689660265356,"score_spread":0.3267869256750524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3018597471","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.17089416,0.0037084057,0.8220611,0.00081491796,0.0018545624,0.00052179466,0.0000056368076,0.00005668676,0.00008269764],"genre_scores_gemma":[0.6629412,0.00074804964,0.33550736,0.00035580515,0.00014260982,0.00025938833,0.000028851688,0.000008020696,0.000008719035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763656,0.0003328887,0.00042889387,0.00092825125,0.00041141882,0.00026196128],"domain_scores_gemma":[0.9977783,0.0007619643,0.00039231626,0.00032357563,0.0006071344,0.0001367001],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009344204,0.00027251954,0.00035695703,0.00008518305,0.00031982493,0.000778186,0.00033082155,0.00016112613,0.0000044494095],"category_scores_gemma":[0.00078497437,0.00027144706,0.00005489838,0.00021979884,0.00012296347,0.0014247074,0.00057872175,0.00034457294,0.000001311025],"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.00001708479,0.00007444562,0.00002364261,0.0001225266,0.000026583648,0.0000028123309,0.0040613525,0.0027253581,0.00017681193,0.0013040829,0.000047930793,0.99141735],"study_design_scores_gemma":[0.00061910163,0.00023326972,0.00070072943,0.00012908605,0.00007274297,0.000039478353,0.000786549,0.9909185,0.00073874777,0.0036022598,0.0017502517,0.0004092609],"about_ca_topic_score_codex":0.00005445719,"about_ca_topic_score_gemma":4.614547e-7,"teacher_disagreement_score":0.9910081,"about_ca_system_score_codex":0.000036740243,"about_ca_system_score_gemma":0.0002625035,"threshold_uncertainty_score":0.9999738},"labels":[],"label_agreement":null},{"id":"W3023807074","doi":"10.1002/cpe.5746","title":"Data linking over RDF knowledge graphs: A survey","year":2020,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Data Quality and Management","field":"Decision Sciences","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi; Université du Québec à Montréal","funders":"","keywords":"Computer science; Matching (statistics); Relation (database); Context (archaeology); Process (computing); Task (project management); RDF; Data science; Asset (computer security); Information retrieval; Object (grammar); Data mining; Semantic Web; Artificial intelligence; Mathematics; Programming language","score_opus":0.48924196060170927,"score_gpt":0.5236692874574922,"score_spread":0.034427326855782925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023807074","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.54419494,0.015092778,0.4179058,0.011459027,0.0017209745,0.00068648317,0.0005104198,0.0001796581,0.008249918],"genre_scores_gemma":[0.99481225,0.0007012231,0.0009686161,0.0032759698,0.000050298295,0.000006697563,0.00013715147,0.000004119412,0.000043700584],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99763507,0.0005720825,0.00045154185,0.00072433625,0.00046495564,0.00015202476],"domain_scores_gemma":[0.9959857,0.0030152346,0.00025599072,0.0003675308,0.00021129669,0.0001642744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026599877,0.00012024601,0.00018546713,0.00006487325,0.00027209258,0.0006907744,0.00061538996,0.000038606944,0.00006426466],"category_scores_gemma":[0.0070973956,0.00010183647,0.000015925794,0.00061495224,0.00017536373,0.0031298525,0.00088126166,0.000139744,0.00007519533],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018365636,0.000202034,0.0134543395,0.00006857319,0.00004636435,0.000021380516,0.074735574,0.000033964316,0.000045469675,0.044468615,0.048823185,0.81791687],"study_design_scores_gemma":[0.0008323353,0.00020239098,0.034524303,0.000045430348,0.000039928986,0.000013588803,0.026141822,0.115000986,0.000013583182,0.008601109,0.81415105,0.00043349786],"about_ca_topic_score_codex":0.00007491941,"about_ca_topic_score_gemma":0.000034249762,"teacher_disagreement_score":0.81748337,"about_ca_system_score_codex":0.0000036391364,"about_ca_system_score_gemma":0.00004937831,"threshold_uncertainty_score":0.8496758},"labels":[],"label_agreement":null},{"id":"W3027455131","doi":"10.1002/cpe.5823","title":"Mary, Hugo, and Hugo*: Learning to schedule distributed data‐parallel processing jobs on shared clusters","year":2020,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banting and Best Diabetes Centre, University of Toronto; Bundesministerium für Bildung und Forschung","keywords":"Computer science; SPARK (programming language); Yarn; Scheduling (production processes); Distributed computing; Schedule; Resource (disambiguation); Throughput; Cluster (spacecraft); Computer cluster; Job scheduler; Operating system; Computer network; Wireless","score_opus":0.0516348108275705,"score_gpt":0.3270838313335077,"score_spread":0.2754490205059372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3027455131","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.23291464,0.0011858535,0.7492255,0.015491041,0.00015564183,0.00027762118,0.0000054688103,0.00020091819,0.0005433155],"genre_scores_gemma":[0.9801219,0.000053552107,0.016712895,0.0029806953,0.00006746671,0.000013430671,0.000023173427,0.0000073025276,0.000019585295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983183,0.00013159569,0.00025356235,0.000798363,0.00025803118,0.00024011063],"domain_scores_gemma":[0.9990231,0.0002690004,0.00016687946,0.00020794317,0.00008339594,0.00024970554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002662889,0.00018211789,0.00017779584,0.000054829467,0.0005270461,0.00071511726,0.00041917196,0.00004132338,0.0000025206477],"category_scores_gemma":[0.00046123864,0.00017400354,0.000013320017,0.0003715503,0.00007929531,0.0005256501,0.0010135861,0.00023802502,0.000008766805],"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.00014322717,0.00012096753,0.0010540899,0.00020177176,0.000036028086,0.00005475313,0.06486453,0.028487025,0.000113646805,0.0032523298,0.001757737,0.8999139],"study_design_scores_gemma":[0.00052100443,0.00033267235,0.0014517474,0.00010329996,0.000015574391,0.000028646302,0.005698121,0.96296984,0.000016034212,0.00006326706,0.02852528,0.00027451245],"about_ca_topic_score_codex":0.000015729644,"about_ca_topic_score_gemma":6.502243e-7,"teacher_disagreement_score":0.9344828,"about_ca_system_score_codex":0.000011508459,"about_ca_system_score_gemma":0.000034882265,"threshold_uncertainty_score":0.7095658},"labels":[],"label_agreement":null},{"id":"W3046162336","doi":"10.1002/cpe.5919","title":"Deep and reinforcement learning for automated task scheduling in large‐scale cloud computing systems","year":2020,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":152,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Defence Research and Development Canada","keywords":"Computer science; Cloud computing; Reinforcement learning; Scheduling (production processes); Distributed computing; Artificial intelligence; Deep learning; Machine learning; Operating system","score_opus":0.020746677400473625,"score_gpt":0.3010087496171185,"score_spread":0.28026207221664484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046162336","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.30392903,0.0016495588,0.69262046,0.0010163743,0.00020943495,0.0002595823,1.8633735e-7,0.00019646512,0.00011888209],"genre_scores_gemma":[0.9878298,0.000081899445,0.011300956,0.00066551793,0.00008329763,0.000020105967,0.0000037069865,0.000006829027,0.000007882668],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849415,0.0001370643,0.00037835218,0.0005251629,0.00017801205,0.00028727937],"domain_scores_gemma":[0.998954,0.00049314596,0.00023173299,0.0000899889,0.000092716735,0.00013840589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004833941,0.00016237199,0.00021475814,0.0000676562,0.00042647502,0.0004160325,0.00016648513,0.000050443858,4.1758213e-7],"category_scores_gemma":[0.0002820805,0.00016301619,0.000020123629,0.00028880493,0.00005597912,0.00024523787,0.000348037,0.00019061813,0.0000015206382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034583347,0.000045722165,0.0013792905,0.00025680935,0.00002067233,0.000013942901,0.11160588,0.8238109,0.00006486393,0.006206473,0.000049161474,0.056511708],"study_design_scores_gemma":[0.00083846383,0.0001911705,0.000378109,0.000097244985,0.000010270415,0.000024444378,0.015482357,0.9799092,0.000010532672,0.000038579168,0.0028173584,0.00020228332],"about_ca_topic_score_codex":0.000022744178,"about_ca_topic_score_gemma":8.1562035e-7,"teacher_disagreement_score":0.6839008,"about_ca_system_score_codex":0.000017387452,"about_ca_system_score_gemma":0.000022434082,"threshold_uncertainty_score":0.6647607},"labels":[],"label_agreement":null},{"id":"W3086164996","doi":"10.1002/cpe.5957","title":"Evaluating intrusion sensitivity allocation with supervised learning in collaborative intrusion detection","year":2020,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":5,"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":"National Natural Science Foundation of China","keywords":"Intrusion detection system; Computer science; Sensitivity (control systems); Machine learning; Insider; Artificial intelligence; Intrusion; Classifier (UML); Data mining; Network security; Anomaly-based intrusion detection system; Computer security; Engineering","score_opus":0.031121300256024914,"score_gpt":0.32028999285789317,"score_spread":0.2891686926018683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3086164996","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.6007045,0.0002681582,0.39708734,0.0014878783,0.00009822459,0.00019255297,2.3472586e-7,0.000079673766,0.00008144073],"genre_scores_gemma":[0.9903653,0.0003853714,0.008552472,0.00060368195,0.000053479846,0.00002786696,0.0000040988552,0.0000055948676,0.0000021046678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981677,0.00059195276,0.00027006553,0.0005212987,0.0002804483,0.00016854068],"domain_scores_gemma":[0.99881667,0.0004864383,0.0002119093,0.00008517397,0.0002896526,0.00011018311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005828167,0.00015330054,0.00016368553,0.00008491319,0.00042122055,0.0002491626,0.00007772179,0.00007213853,0.0000041765397],"category_scores_gemma":[0.0006887861,0.0001452534,0.00001157543,0.0008993227,0.000083624924,0.0025995418,0.00014299173,0.00033391183,0.000003906261],"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.0002578916,0.000045620032,0.00042442317,0.000031643805,0.0000063076395,0.000015942016,0.05306633,0.006360384,0.015668599,0.0014034744,0.000004521663,0.9227149],"study_design_scores_gemma":[0.0007553053,0.0009303433,0.0013489941,0.000065789594,0.000008814901,0.00005990867,0.006273029,0.9853054,0.0042229723,0.00019144516,0.00062348164,0.00021448176],"about_ca_topic_score_codex":0.000062260944,"about_ca_topic_score_gemma":0.000031925596,"teacher_disagreement_score":0.9789451,"about_ca_system_score_codex":0.000029248953,"about_ca_system_score_gemma":0.000073721545,"threshold_uncertainty_score":0.59232616},"labels":[],"label_agreement":null},{"id":"W3094055078","doi":"10.1002/cpe.6047","title":"5G NB‐IoT: Efficient network call admission control in cellular networks","year":2020,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"IoT Networks and Protocols","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Computer network; Mobile broadband; Quality of service; Service (business); Energy consumption; Data as a service; Cellular network; Throughput; Latency (audio); Low latency (capital markets); Broadband; Telecommunications; Wireless; Business; Engineering","score_opus":0.013907252166426671,"score_gpt":0.26963912322132716,"score_spread":0.2557318710549005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094055078","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.10726435,0.012997257,0.87437147,0.000871906,0.0006500306,0.00211327,0.0000022318372,0.00018405842,0.0015454235],"genre_scores_gemma":[0.99790466,0.00026836217,0.00042733923,0.00091722154,0.00024262606,0.00022057405,0.000004856882,0.000011305449,0.0000030570245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904984,0.0000884367,0.00026836578,0.00023921345,0.00010910165,0.00024504936],"domain_scores_gemma":[0.9993705,0.0002946197,0.00006397743,0.00006111406,0.00003805639,0.0001717109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017950438,0.00014896857,0.00018215981,0.000019777852,0.000113293325,0.00008707531,0.00006632584,0.00008298849,0.000016036622],"category_scores_gemma":[0.0000712128,0.00014561362,0.00001896616,0.00022589447,0.000046823614,0.00018670088,0.000023166132,0.00025542095,0.0000044154735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008466886,0.000018604458,0.00052600435,0.000045793284,0.000007883291,0.000023238754,0.0043658908,0.94592494,0.00011918914,0.00033819303,0.0009227744,0.047622815],"study_design_scores_gemma":[0.00075585995,0.000091232294,0.0003061957,0.00007231025,0.0000102556605,0.000007549072,0.0003760134,0.97745466,0.000034418565,0.00004419927,0.020664088,0.0001832338],"about_ca_topic_score_codex":0.000006823773,"about_ca_topic_score_gemma":7.409329e-7,"teacher_disagreement_score":0.8906403,"about_ca_system_score_codex":0.000010893118,"about_ca_system_score_gemma":0.000016108059,"threshold_uncertainty_score":0.5937951},"labels":[],"label_agreement":null},{"id":"W3104964829","doi":"10.1002/cpe.6052","title":"Distributed Application Global States Monitoring in PEGASUS DA Applied to Parallel Graph Partitioning","year":2020,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Graph partition; Asynchronous communication; Distributed computing; Graph; Benchmark (surveying); Parallel computing; Theoretical computer science","score_opus":0.02998049227623267,"score_gpt":0.31634306788024974,"score_spread":0.28636257560401707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104964829","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.10430798,0.0003187726,0.892747,0.0019239524,0.00020024422,0.00020458769,0.000002439874,0.000068553454,0.00022647742],"genre_scores_gemma":[0.9942222,0.00007390856,0.00496481,0.00054206135,0.000066069806,0.00011722626,0.000010175744,0.0000026692683,8.48477e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989286,0.00006541618,0.00027735982,0.00040704483,0.00014831814,0.00017324807],"domain_scores_gemma":[0.9994144,0.00014069241,0.000118981356,0.000090645575,0.000089441986,0.00014585577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015115205,0.000111713416,0.00013317629,0.00002919792,0.0001766308,0.0003295831,0.00014539849,0.00003711639,9.598263e-7],"category_scores_gemma":[0.00007728308,0.000115794086,0.0000134825705,0.0005315084,0.000033772663,0.00081653014,0.000092883354,0.00009808633,0.00000690423],"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.00028985814,0.0002155491,0.0355817,0.00013940723,0.00004514255,0.000038923823,0.11296146,0.16548404,0.00065195817,0.28735262,0.0008253676,0.39641395],"study_design_scores_gemma":[0.0011478292,0.00030125317,0.015296848,0.000097943004,0.000012288561,0.00005837402,0.019347483,0.9487547,0.000181981,0.005506581,0.008722337,0.00057236734],"about_ca_topic_score_codex":0.00006756894,"about_ca_topic_score_gemma":0.0000036728543,"teacher_disagreement_score":0.8899143,"about_ca_system_score_codex":0.000023246443,"about_ca_system_score_gemma":0.000020311225,"threshold_uncertainty_score":0.47219458},"labels":[],"label_agreement":null},{"id":"W3112004248","doi":"10.1002/cpe.6124","title":"An efficient shortest path routing on the hypercube with blocking/faulty nodes","year":2020,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Interconnection Networks and Systems","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":"Brock University","funders":"","keywords":"Hypercube; Shortest path problem; K shortest path routing; Constrained Shortest Path First; Computer science; Node (physics); Path (computing); Routing (electronic design automation); Shortest Path Faster Algorithm; Blocking (statistics); Yen's algorithm; Equal-cost multi-path routing; Fault tolerance; Longest path problem; Floyd–Warshall algorithm; Algorithm; Mathematics; Mathematical optimization; Link-state routing protocol; Theoretical computer science; Distributed computing; Parallel computing; Dijkstra's algorithm; Computer network; Routing protocol; Graph","score_opus":0.03460719488136469,"score_gpt":0.29395456044820983,"score_spread":0.2593473655668451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112004248","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.5139677,0.00021880033,0.48197737,0.0027168293,0.0001935394,0.00014882823,8.568903e-7,0.000079472455,0.00069662725],"genre_scores_gemma":[0.9958741,0.000030105632,0.0011855437,0.0027842375,0.00009509326,0.000021636555,0.0000013821058,0.000004971458,0.0000028971706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988147,0.00017087016,0.00020014134,0.00042576462,0.00022279708,0.00016573959],"domain_scores_gemma":[0.99894154,0.0005029561,0.00014195779,0.00015839368,0.00013720227,0.00011797453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028105464,0.00013600549,0.00012207535,0.000020095209,0.00045861455,0.00043173967,0.00022178555,0.000032984924,0.0000040126647],"category_scores_gemma":[0.00014568886,0.00008754537,0.000015840493,0.00023869118,0.0000871379,0.000646436,0.00006078755,0.00017658283,0.00000516283],"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.0002135586,0.00041780758,0.0032581722,0.00003777392,0.000064105974,0.00010191926,0.29508832,0.09207137,0.0008915562,0.35521647,0.00049247657,0.25214645],"study_design_scores_gemma":[0.00019137494,0.00045164523,0.0006314924,0.00005171722,0.0000071502786,0.000095392534,0.010442647,0.9864402,0.00010630612,0.00004115383,0.0013775371,0.0001634279],"about_ca_topic_score_codex":0.000022191998,"about_ca_topic_score_gemma":9.4119287e-7,"teacher_disagreement_score":0.89436877,"about_ca_system_score_codex":0.000008062011,"about_ca_system_score_gemma":0.00003116088,"threshold_uncertainty_score":0.41632754},"labels":[],"label_agreement":null},{"id":"W3112200194","doi":"10.1002/cpe.6144","title":"Efficient and secure routing protocol based on Blockchain approach for wireless sensor networks","year":2020,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"Université du Québec à Chicoutimi","keywords":"Blockchain; Wireless sensor network; Computer science; Protocol (science); Routing protocol; Routing (electronic design automation); Computer security; Computer network","score_opus":0.022499905913287297,"score_gpt":0.3008806597473093,"score_spread":0.278380753834022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112200194","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.023225553,0.00007985044,0.9661851,0.0029535077,0.000029865647,0.007263765,0.0000023928746,0.00013055366,0.00012941762],"genre_scores_gemma":[0.9421812,0.0000046197324,0.04741713,0.0015186266,0.000036984045,0.008831482,0.0000028952277,0.0000057334933,0.0000013035141],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987967,0.00008069779,0.00022115059,0.0005827736,0.00012404524,0.00019464653],"domain_scores_gemma":[0.99900496,0.00044168963,0.00017423255,0.00014863422,0.00011067892,0.00011983205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026317677,0.00015470372,0.00015798888,0.00004013158,0.00042763073,0.00015301906,0.00017193354,0.000100655336,6.4088164e-7],"category_scores_gemma":[0.00015213092,0.00014442328,0.000019480873,0.0002757276,0.00014802182,0.00010273903,0.0001117676,0.00020927053,3.5225577e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003412286,0.00069403456,0.0006464883,0.0004050493,0.00003466278,0.000012208432,0.038418654,0.12896092,0.00026544236,0.29944825,0.00025120593,0.53052187],"study_design_scores_gemma":[0.0007246796,0.00024347448,0.00005451373,0.000017579507,0.000007181134,0.000016051246,0.0014538729,0.9958575,0.00010169371,0.00017482933,0.0011741793,0.00017444773],"about_ca_topic_score_codex":0.0000033306042,"about_ca_topic_score_gemma":1.12646525e-7,"teacher_disagreement_score":0.9189557,"about_ca_system_score_codex":0.0000070637043,"about_ca_system_score_gemma":0.000032365428,"threshold_uncertainty_score":0.58894104},"labels":[],"label_agreement":null},{"id":"W3115903506","doi":"10.1002/cpe.6153","title":"Taming <scp>next‐generation HPC</scp> systems: <scp>Run‐time</scp> system and algorithmic advancements","year":2020,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Concurrency; Informatics; Operations research; Distributed computing; Engineering","score_opus":0.041874892505479835,"score_gpt":0.28903558814437313,"score_spread":0.2471606956388933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115903506","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.21222651,0.00970174,0.77506715,0.00020265869,0.0010031343,0.00048532756,0.000013628853,0.00028585008,0.0010139969],"genre_scores_gemma":[0.99383837,0.00035210632,0.0049410407,0.00037258537,0.00030627786,0.0000642561,0.00004098944,0.000013974308,0.00007042122],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972901,0.00035925413,0.00060718093,0.0009041397,0.00044301766,0.0003963447],"domain_scores_gemma":[0.99761796,0.0010278211,0.0005247069,0.00022205163,0.00027971598,0.0003277249],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00044778534,0.00032625074,0.0003946156,0.00008390243,0.00061272364,0.0013554614,0.00034645447,0.00011126871,5.3246873e-7],"category_scores_gemma":[0.0006020272,0.00032946846,0.00003618329,0.0005022972,0.00010869912,0.0028259766,0.00027630248,0.00022077291,0.000030460831],"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.000029247623,0.0004979669,0.0028461327,0.0032378808,0.00047138988,0.0003706802,0.4021888,0.023660691,0.014440614,0.091231614,0.0136306835,0.44739428],"study_design_scores_gemma":[0.00067820743,0.00025271485,0.00011838519,0.0001999083,0.00003114026,0.00022304394,0.01692456,0.947206,0.0001703227,0.000030237832,0.034039944,0.0001255089],"about_ca_topic_score_codex":0.00003603658,"about_ca_topic_score_gemma":2.4054725e-7,"teacher_disagreement_score":0.92354536,"about_ca_system_score_codex":0.000037345482,"about_ca_system_score_gemma":0.00008162951,"threshold_uncertainty_score":0.9999157},"labels":[],"label_agreement":null},{"id":"W3172401710","doi":"10.1002/cpe.6297","title":"Ship‐iceberg discrimination from Sentinel‐1 synthetic aperture radar data using parallel convolutional neural network","year":2021,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Synthetic Aperture Radar (SAR) Applications and Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre For Cold Ocean Resources Engineering; Government of Newfoundland and Labrador; Memorial University of Newfoundland","funders":"Jiangxi Provincial Department of Science and Technology; Education Department of Jiangxi Province; National Natural Science Foundation of China","keywords":"Convolutional neural network; Computer science; Artificial intelligence; Iceberg; Synthetic aperture radar; Constant false alarm rate; Pattern recognition (psychology); Support vector machine; Artificial neural network; Deep learning; Computer vision; Geology","score_opus":0.041114091045074616,"score_gpt":0.3108569003007611,"score_spread":0.26974280925568644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3172401710","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.077146545,0.01237173,0.9079746,0.0010629974,0.0003513803,0.00015229474,0.000044166434,0.00017410624,0.0007222099],"genre_scores_gemma":[0.8603049,0.0010251016,0.13781917,0.00034477137,0.00014653636,0.000015157874,0.00032211334,0.000014255228,0.000008029232],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897575,0.00007499249,0.00024197306,0.00038071847,0.00015917263,0.00016739989],"domain_scores_gemma":[0.99881285,0.0006867096,0.0000795385,0.00025364876,0.00009463164,0.00007260063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000112879774,0.00015846503,0.00015476497,0.000023260427,0.00023842789,0.00012558424,0.00012585935,0.00007718332,0.000035740708],"category_scores_gemma":[0.00018857673,0.00015931885,0.000018854891,0.00015712835,0.000108799315,0.0007681749,0.000110514025,0.00015945696,0.0000025624925],"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.000067127185,0.00026245695,0.001693057,0.00018418604,0.00020556654,0.00007013942,0.009154454,0.0022774676,0.003985218,0.030958446,0.0045288377,0.9466131],"study_design_scores_gemma":[0.00022835757,0.000009640324,0.0010832828,0.00007240644,0.000079792226,0.00016249683,0.0019841616,0.885354,0.00014967204,0.0015933537,0.10900965,0.00027321026],"about_ca_topic_score_codex":0.000029610143,"about_ca_topic_score_gemma":0.0000037303982,"teacher_disagreement_score":0.94633985,"about_ca_system_score_codex":0.00001722554,"about_ca_system_score_gemma":0.00003550355,"threshold_uncertainty_score":0.6496834},"labels":[],"label_agreement":null},{"id":"W4200361452","doi":"10.1002/cpe.6772","title":"Multi‐step wind speed and wind power forecasting using variational momentum factor and deep learning based intelligent neural network models","year":2021,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Energy Load and Power Forecasting","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Artificial neural network; Wind speed; Wind power; Wind power forecasting; Heuristic; Computer science; Renewable energy; Process (computing); Power (physics); Artificial intelligence; Deep learning; Machine learning; Simulation; Electric power system; Engineering; Meteorology","score_opus":0.05216643408450233,"score_gpt":0.2863138410012601,"score_spread":0.23414740691675778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200361452","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.77062416,0.0048512146,0.22385399,0.00003176396,0.00039420606,0.00006889929,0.0000026146872,0.00004323252,0.00012995131],"genre_scores_gemma":[0.9859936,0.00024695392,0.013571297,0.00008201282,0.000065830165,0.00000130265,0.000015384945,0.000014863072,0.000008716414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990291,0.0000767024,0.000251988,0.00028948183,0.00012918845,0.0002235609],"domain_scores_gemma":[0.99919355,0.00044417568,0.00009871611,0.00004888675,0.000099285775,0.00011541284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011832251,0.00017598404,0.00016050073,0.000042521773,0.0003226278,0.00017840351,0.000030105937,0.00006324547,0.00001620325],"category_scores_gemma":[0.00014006093,0.00018920071,0.000016850317,0.00014275787,0.0000649928,0.00090400456,0.000057257093,0.00021219505,2.4905862e-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.000014128798,0.00001452052,0.0016520112,0.000042967764,0.00002100265,0.00001561934,0.009512956,0.962973,0.0004205842,0.00016501866,0.0000017389074,0.025166458],"study_design_scores_gemma":[0.00038076533,0.00004207411,0.00073810865,0.0000852646,0.000022218486,0.00011672916,0.0031010818,0.9947672,0.00008686753,0.00007302439,0.00037019255,0.00021645818],"about_ca_topic_score_codex":0.000013355868,"about_ca_topic_score_gemma":0.0000021002093,"teacher_disagreement_score":0.21536951,"about_ca_system_score_codex":0.000015732614,"about_ca_system_score_gemma":0.000023479224,"threshold_uncertainty_score":0.77153814},"labels":[],"label_agreement":null},{"id":"W4200372371","doi":"10.1002/cpe.6743","title":"Scalable grid‐based approximation algorithms for partially observable Markov decision processes","year":2021,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Partially observable Markov decision process; Computer science; Markov decision process; Scalability; Observable; Mathematical optimization; Implementation; Grid; Markov process; Process (computing); Focus (optics); Algorithm; Markov chain; Markov model; Machine learning; Mathematics","score_opus":0.04756454524991755,"score_gpt":0.3385360643285482,"score_spread":0.29097151907863067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200372371","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.0054582534,0.0010551214,0.9915822,0.0008321505,0.0004602975,0.00023536551,0.0000018769776,0.00007701764,0.0002976732],"genre_scores_gemma":[0.41121665,0.00037087285,0.58718264,0.0008865413,0.00007063757,0.0001275946,0.000041197687,0.000009041389,0.00009482712],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986756,0.00007455219,0.0003043898,0.00045778957,0.00027340947,0.00021424888],"domain_scores_gemma":[0.9975835,0.0012630391,0.00021332684,0.00018107636,0.00066727074,0.000091793394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032504907,0.00013574515,0.00014746278,0.000044996676,0.00037815186,0.00060245773,0.00017980993,0.000056550947,0.000006658689],"category_scores_gemma":[0.0016789072,0.00013581193,0.000021414045,0.00041018196,0.00006368129,0.0023594422,0.00011202411,0.00009448268,0.0000038052494],"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.00013526845,0.00027856816,0.0012044423,0.0007223407,0.00003778428,0.000030191502,0.011956088,0.22956462,0.0005983859,0.01707579,0.001282313,0.7371142],"study_design_scores_gemma":[0.00063439587,0.00014839495,0.00022416761,0.000087281085,0.00001526248,0.000031660027,0.0007981002,0.98070127,0.0021002686,0.0009266083,0.014136112,0.00019645109],"about_ca_topic_score_codex":0.000005264318,"about_ca_topic_score_gemma":0.000001136805,"teacher_disagreement_score":0.75113666,"about_ca_system_score_codex":0.00001571822,"about_ca_system_score_gemma":0.0002794247,"threshold_uncertainty_score":0.5809514},"labels":[],"label_agreement":null},{"id":"W4206668287","doi":"10.1002/cpe.6778","title":"A new model for trustworthy web service <scp>QoS</scp> prediction","year":2021,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Recommender Systems and Techniques","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":"Toronto Metropolitan University; Ontario Tech University","funders":"","keywords":"Computer science; Quality of service; Web service; Task (project management); The Internet; Service (business); Trustworthiness; Data mining; World Wide Web; Computer network; Computer security; Engineering","score_opus":0.039025527139702365,"score_gpt":0.31809250374726705,"score_spread":0.2790669766075647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206668287","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.011375334,0.0018897769,0.9824643,0.0017620072,0.0005427755,0.0002311673,0.0000068741556,0.00017370451,0.0015540273],"genre_scores_gemma":[0.8179283,0.00084510015,0.17837033,0.0021069045,0.0001688137,0.0001439883,0.000019546085,0.0000111104055,0.00040587253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877936,0.00007663187,0.00028616743,0.00049075467,0.00016966854,0.0001974108],"domain_scores_gemma":[0.9986755,0.00047521133,0.00017731641,0.00019607424,0.00033111495,0.00014477372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022966303,0.00014610411,0.00016731507,0.000051953826,0.00026185764,0.0004010835,0.00017321845,0.00007630026,0.00000139621],"category_scores_gemma":[0.00021588642,0.00014750008,0.000031569238,0.00030377504,0.000023650608,0.001983696,0.00013837029,0.00011172228,0.0000019215556],"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.000016792274,0.0001854091,0.0005857183,0.00024246052,0.00006562306,0.000020936272,0.07791188,0.0008273474,0.0013526552,0.15060706,0.027005063,0.74117905],"study_design_scores_gemma":[0.0004936334,0.00008754573,0.00010992238,0.00004704815,0.000016276648,0.00015638596,0.0021349739,0.91632986,0.00071136723,0.0053942422,0.07442893,0.00008980754],"about_ca_topic_score_codex":0.000027814258,"about_ca_topic_score_gemma":0.000008920531,"teacher_disagreement_score":0.91550255,"about_ca_system_score_codex":0.000013294114,"about_ca_system_score_gemma":0.00023269572,"threshold_uncertainty_score":0.6014878},"labels":[],"label_agreement":null},{"id":"W4225385632","doi":"10.1002/cpe.6974","title":"Execution trace‐based model verification to analyze multicore and real‐time systems","year":2022,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Telefonaktiebolaget LM Ericsson","keywords":"Computer science; Debugging; TRACE (psycholinguistics); Tracing; Multi-core processor; Workflow; Key (lock); Distributed computing; Real-time computing; Embedded system; Programming language; Operating system; Database","score_opus":0.05049310498795191,"score_gpt":0.3517176971639413,"score_spread":0.3012245921759894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225385632","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.09700712,0.0008147504,0.90115833,0.00039244507,0.00022992509,0.00019734856,0.000004234893,0.00015814322,0.000037709488],"genre_scores_gemma":[0.7970245,0.00011218679,0.20257385,0.00011920208,0.0000125320485,0.00012847153,0.0000053376866,0.000005120582,0.000018807497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988058,0.00020944932,0.00020421405,0.00043386917,0.00019931843,0.00014732395],"domain_scores_gemma":[0.99874395,0.00076317467,0.00012999568,0.00017441777,0.00009465876,0.000093784016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045465984,0.00011972572,0.00013992592,0.0000997651,0.0003758646,0.00014958729,0.00015804703,0.00002853711,0.0000010883016],"category_scores_gemma":[0.00049177156,0.00013028405,0.000011547757,0.00029651448,0.000053695338,0.0010067847,0.00015194988,0.00011964172,0.0000012192434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038261463,0.000045682515,0.000064245076,0.000034794277,0.000006641026,0.000006316593,0.015491408,0.9016596,0.0040032007,0.009051172,0.000068600566,0.06953005],"study_design_scores_gemma":[0.00020990834,0.00012655121,0.000430548,0.000011544441,0.000008443649,0.000035530564,0.0018558116,0.9957174,0.00010764384,0.00053683465,0.0007876169,0.0001721587],"about_ca_topic_score_codex":0.000026186974,"about_ca_topic_score_gemma":2.0648551e-7,"teacher_disagreement_score":0.7000174,"about_ca_system_score_codex":0.000035888475,"about_ca_system_score_gemma":0.000044851786,"threshold_uncertainty_score":0.53128296},"labels":[],"label_agreement":null},{"id":"W4229577914","doi":"10.1002/cpe.1578","title":"A scheduling and load balancing scheme for dynamic P2P‐based system","year":2010,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Distributed computing; Load balancing (electrical power); Scheduling (production processes); Dynamic priority scheduling; Round-robin scheduling; Fair-share scheduling; Peer-to-peer; Computer network; Quality of service; Engineering","score_opus":0.014057672959052782,"score_gpt":0.31389667397781656,"score_spread":0.29983900101876376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229577914","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.36487788,0.0006320067,0.6321662,0.0014751072,0.00035596677,0.00020954495,0.0000016014855,0.00020222095,0.000079492944],"genre_scores_gemma":[0.7458274,0.000020696365,0.2537517,0.00029668317,0.000020364241,0.00007242053,0.0000014670258,0.00000461588,0.000004677342],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880886,0.00003204729,0.00022209367,0.0005094488,0.00018515305,0.00024241288],"domain_scores_gemma":[0.99869305,0.0005977979,0.0001477981,0.00021292179,0.00023426583,0.000114164046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004148624,0.00015231401,0.00016471601,0.000084386396,0.00033070322,0.00037116755,0.00025307765,0.00008546908,4.6191636e-7],"category_scores_gemma":[0.00069188,0.0001507496,0.000016769443,0.0002661372,0.00011638131,0.0010961032,0.00018778822,0.0002061695,0.0000024126516],"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.00009263829,0.000102449194,0.002026216,0.00042728378,0.000034535242,0.00003047868,0.01658688,0.0007785709,0.02007206,0.12563874,0.00017589272,0.83403426],"study_design_scores_gemma":[0.000509233,0.00013654263,0.0005618337,0.00009719137,0.00001014433,0.00010781778,0.0025357474,0.99128,0.00057570054,0.00061912765,0.0033115859,0.0002550274],"about_ca_topic_score_codex":0.0000143178395,"about_ca_topic_score_gemma":0.000006729581,"teacher_disagreement_score":0.99050146,"about_ca_system_score_codex":0.000023148992,"about_ca_system_score_gemma":0.000098434735,"threshold_uncertainty_score":0.61473906},"labels":[],"label_agreement":null},{"id":"W4229616670","doi":"10.1002/cpe.1364","title":"Trading off logging overhead and coordinating overhead to achieve efficient rollback recovery","year":2008,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"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 Victoria","funders":"Natural Science Foundation of Hunan Province; National Natural Science Foundation of China","keywords":"Computer science; Scalability; Overhead (engineering); Rollback; Logging; Fault tolerance; Partition (number theory); Heuristics; Distributed computing; Embedded system; Operating system; Database transaction; Database","score_opus":0.025876742472895526,"score_gpt":0.30326741972070514,"score_spread":0.27739067724780964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229616670","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.5963607,0.0023843427,0.3989664,0.0007446792,0.0003533257,0.0001818543,0.000005005317,0.00006239627,0.0009413032],"genre_scores_gemma":[0.9927738,0.00034777052,0.006125135,0.000640119,0.000045612782,0.000025428548,0.000003040793,0.0000063424504,0.000032752414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983817,0.00011734488,0.0003543235,0.0005980052,0.0002576258,0.00029100486],"domain_scores_gemma":[0.9987909,0.0005121502,0.00020015085,0.00016872211,0.00012097627,0.000207051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035415284,0.0001936059,0.00024073536,0.00008592555,0.0006098719,0.00030682934,0.00017288578,0.000057948393,0.0000023689447],"category_scores_gemma":[0.0002786084,0.00019314256,0.000025682892,0.00033539187,0.00011222935,0.0014519013,0.000165674,0.00016675795,0.000005341206],"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.00018243221,0.00028380755,0.0022383924,0.00016336195,0.000047509828,0.00016847365,0.12754297,0.004956338,0.0013936822,0.020739395,0.00147955,0.8408041],"study_design_scores_gemma":[0.0014807956,0.00073339953,0.007132021,0.00035007796,0.00001928594,0.0013841435,0.008760869,0.96219575,0.00026257552,0.00056600256,0.016292341,0.0008227079],"about_ca_topic_score_codex":0.000048506095,"about_ca_topic_score_gemma":0.0000011501496,"teacher_disagreement_score":0.95723945,"about_ca_system_score_codex":0.000026613365,"about_ca_system_score_gemma":0.000055891272,"threshold_uncertainty_score":0.7876125},"labels":[],"label_agreement":null},{"id":"W4229946712","doi":"10.1002/cpe.1520","title":"Large‐scale numerical simulations of earthquake fault systems: illuminating the role of dilatational gravity in earthquake nucleation","year":2009,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"earthquake and tectonic studies","field":"Earth and Planetary Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; TD Bank Group","funders":"Basic Energy Sciences; Natural Sciences and Engineering Research Council of Canada; Institute for Catastrophic Loss Reduction; National Aeronautics and Space Administration","keywords":"Seismology; Geology; Foreshock; Shear (geology); Nucleation; Earthquake simulation; Slip (aerodynamics); Tectonics; Earthquake prediction; Physics; Aftershock; Petrology","score_opus":0.014360412734274002,"score_gpt":0.27918148626289824,"score_spread":0.2648210735286242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229946712","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.99373734,0.003076193,0.0017521988,0.0001924818,0.00006838038,0.0001497588,0.000032610664,0.00000951116,0.0009815092],"genre_scores_gemma":[0.9993991,0.00015385565,0.00033443133,0.00006015288,0.000018662698,0.0000016226421,0.00002688874,0.0000011646498,0.0000040786554],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9990171,0.00013774648,0.0003299025,0.000176313,0.00020878727,0.000130107],"domain_scores_gemma":[0.99867505,0.00086335326,0.00022695697,0.00006825948,0.00013077442,0.00003560852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002660104,0.00008703734,0.00015824854,0.000054692915,0.00020593757,0.00003520765,0.00005926174,0.000035987487,0.000028812763],"category_scores_gemma":[0.00027909715,0.00006831624,0.00001985309,0.00026133368,0.00013204731,0.00050947815,0.000009815566,0.00010372088,0.0000019501433],"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.00009710515,0.00017209796,0.3131627,0.000044612887,0.000021503442,0.0000029252385,0.07939091,0.028659198,0.00010596131,0.006495902,0.000009420114,0.57183766],"study_design_scores_gemma":[0.00030991688,0.00016281281,0.75135356,0.00003981921,0.000013189984,0.000011668368,0.02999587,0.21618135,0.00004555753,0.0011049199,0.00069019006,0.000091145004],"about_ca_topic_score_codex":0.00029129462,"about_ca_topic_score_gemma":0.00012043606,"teacher_disagreement_score":0.5717465,"about_ca_system_score_codex":0.0000015938065,"about_ca_system_score_gemma":0.000027620084,"threshold_uncertainty_score":0.27858555},"labels":[],"label_agreement":null},{"id":"W4231667303","doi":"10.1002/cpe.1640","title":"Proceedings of the 6th ACES Symposium, May 11–16, 2008, Cairns, Australia: Introduction to the Special Issue","year":2010,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"earthquake and tectonic studies","field":"Earth and Planetary Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"China; Government (linguistics); Natural disaster; History; Political science; Geography; Economic growth; Economic history; Meteorology; Law; Economics","score_opus":0.01648935469475344,"score_gpt":0.28082067041236053,"score_spread":0.2643313157176071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231667303","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.9759592,0.000292399,0.00003515631,0.018581225,0.0016598494,0.00021947599,0.000009878678,0.000012187521,0.0032306358],"genre_scores_gemma":[0.9974637,0.00021114147,0.0001486889,0.0002980351,0.0015813779,0.000004600202,0.0000030607614,0.0000013571231,0.0002880114],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992474,0.000026496997,0.00017076645,0.00023026418,0.00018469703,0.0001404245],"domain_scores_gemma":[0.9994339,0.00017355944,0.00013685798,0.00007031859,0.00013250178,0.000052886855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002405615,0.000098432756,0.00010248293,0.0000262796,0.00041144656,0.000105852894,0.00013002047,0.000038266357,0.0003266806],"category_scores_gemma":[0.00024576415,0.00005811795,0.000018864253,0.00022643355,0.00024888318,0.0005369408,0.000029596877,0.00017482834,0.000018047633],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019176026,0.00009803998,0.3621517,0.000107426196,0.00006660494,0.0000029132045,0.10747941,0.0003832664,0.00095519953,0.005492166,0.12045216,0.40261936],"study_design_scores_gemma":[0.00020817123,0.00018541429,0.21932949,0.00001999919,0.00004105378,0.00009736887,0.016023643,0.00032121717,0.0011868365,0.00024389316,0.76216525,0.00017767397],"about_ca_topic_score_codex":0.00093647966,"about_ca_topic_score_gemma":0.0009221501,"teacher_disagreement_score":0.6417131,"about_ca_system_score_codex":0.0000014737781,"about_ca_system_score_gemma":0.00002173906,"threshold_uncertainty_score":0.35769233},"labels":[],"label_agreement":null},{"id":"W4234190264","doi":"10.1002/cpe.1561","title":"Special Issue: Advances in High‐Performance Computing and Communications","year":2010,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed and Parallel Computing Systems","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":"St. Francis Xavier University","funders":"","keywords":"Computer science; Scalability; Server; Supercomputer; Set (abstract data type); Data science; Distributed computing; World Wide Web; Operating system","score_opus":0.016929418867322677,"score_gpt":0.3305510189059781,"score_spread":0.3136216000386554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234190264","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.88090956,0.0027355507,0.10618595,0.0015961714,0.0018793526,0.00023419378,0.0000028960962,0.000105765524,0.006350535],"genre_scores_gemma":[0.9837036,0.0014444143,0.014250315,0.00020086528,0.00036945936,0.0000087416465,0.000005951588,0.0000036193221,0.0000130199915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988708,0.00011043324,0.00030635123,0.00036886623,0.00014545448,0.00019811303],"domain_scores_gemma":[0.998785,0.00056999497,0.00018380275,0.0002706084,0.000100410856,0.000090170004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003873837,0.00013714404,0.0001684612,0.00007588244,0.0003693871,0.00031595305,0.00037036306,0.0000578498,0.000003556205],"category_scores_gemma":[0.00015098801,0.00013768833,0.000009505664,0.00029689362,0.00023544008,0.002088315,0.00033545785,0.00030815657,0.000005952504],"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.000012026345,0.000079383884,0.009963727,0.000055942608,0.000004758097,0.0000060250427,0.018201051,0.00021405808,0.00008992862,0.049642414,0.00019883989,0.92153186],"study_design_scores_gemma":[0.0012955734,0.00022557663,0.03948632,0.00018237036,0.000011445361,0.00031886378,0.0033000694,0.63395643,0.000081709724,0.0017929855,0.31871447,0.0006341743],"about_ca_topic_score_codex":0.000035431454,"about_ca_topic_score_gemma":0.000010119033,"teacher_disagreement_score":0.92089766,"about_ca_system_score_codex":0.0000063099005,"about_ca_system_score_gemma":0.000036859583,"threshold_uncertainty_score":0.5614767},"labels":[],"label_agreement":null},{"id":"W4236073229","doi":"10.1002/cpe.1454","title":"Improving energy efficiency of asymmetric chip multithreaded multiprocessors through reduced OS noise scheduling","year":2009,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Multiprocessing; Multithreading; Embedded system; Scheduling (production processes); Context switch; Thread (computing); Multi-core processor; Efficient energy use; Xeon; Chip; Operating system; Parallel computing","score_opus":0.02347586358554719,"score_gpt":0.31696521371199193,"score_spread":0.2934893501264447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236073229","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.09213051,0.0025750934,0.90387106,0.00030097106,0.00013616082,0.00010871039,5.66604e-7,0.0001823853,0.00069454534],"genre_scores_gemma":[0.79023266,0.00043810584,0.20894058,0.0003451515,0.000021553733,0.000008824978,0.0000022633205,0.0000040407203,0.0000068096733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984659,0.00010915513,0.0004245343,0.00051699195,0.00025159484,0.00023181443],"domain_scores_gemma":[0.99858683,0.00037869718,0.00044365658,0.00019941991,0.00030351305,0.000087891174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027112395,0.00018559096,0.0002248439,0.00016690163,0.0002918825,0.00017504467,0.0003169649,0.000077978366,8.7432653e-7],"category_scores_gemma":[0.000698194,0.0001805919,0.00003284809,0.00082203245,0.00011075193,0.0017722076,0.000108513574,0.00014179264,7.3862554e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005007502,0.00036984924,0.00012626965,0.00006397142,0.000014471305,0.000008994756,0.025956431,0.011196813,0.0057954816,0.034413885,0.00003060243,0.92197317],"study_design_scores_gemma":[0.0005972771,0.00031150432,0.0002968111,0.0000742658,0.000012646855,0.000046463512,0.00086722954,0.97241426,0.023409177,0.0014925993,0.0001778323,0.00029996573],"about_ca_topic_score_codex":0.00006817332,"about_ca_topic_score_gemma":2.6593202e-7,"teacher_disagreement_score":0.9612174,"about_ca_system_score_codex":0.000013365462,"about_ca_system_score_gemma":0.00007559378,"threshold_uncertainty_score":0.7364324},"labels":[],"label_agreement":null},{"id":"W4236588838","doi":"10.1002/cpe.1360","title":"Special Issue: The Best of CCGrid'2007: A Snapshot of an ‘Adolescent’ Area","year":2008,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Snapshot (computer storage); Geography; Computer science; Database","score_opus":0.042477762646939116,"score_gpt":0.31688728249144965,"score_spread":0.27440951984451056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236588838","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.76672053,0.0018436506,0.21928756,0.00063540036,0.0020688102,0.00035031824,0.000013051243,0.000045594625,0.009035069],"genre_scores_gemma":[0.99720585,0.00022383698,0.0019342625,0.0001475765,0.0004528534,0.000005892012,0.000008669303,0.0000028650231,0.000018201654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987464,0.00016943169,0.0003717803,0.0002930655,0.0002673485,0.00015200846],"domain_scores_gemma":[0.9987758,0.00032993697,0.00035474924,0.000230673,0.00022870665,0.00008017089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027873585,0.00012481793,0.00020011755,0.000044232787,0.00024742447,0.00006998847,0.00035601496,0.00004376939,0.000012285153],"category_scores_gemma":[0.00014556294,0.00009776734,0.000030281613,0.00027307408,0.0002971893,0.0008861029,0.00011402318,0.00011975852,0.0000031181464],"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.0004543891,0.0025756941,0.01376052,0.00048093506,0.00014411086,0.00015091711,0.2845682,0.0043124226,0.0007414191,0.049204465,0.025785357,0.6178216],"study_design_scores_gemma":[0.0046541733,0.004191754,0.028939191,0.00073319103,0.00011364318,0.0032485977,0.04489566,0.5052224,0.0019673654,0.002012361,0.40235624,0.0016654587],"about_ca_topic_score_codex":0.00004943223,"about_ca_topic_score_gemma":0.0000011475818,"teacher_disagreement_score":0.6161561,"about_ca_system_score_codex":0.0000054841043,"about_ca_system_score_gemma":0.00006896007,"threshold_uncertainty_score":0.39868364},"labels":[],"label_agreement":null},{"id":"W4237253841","doi":"10.1002/cpe.1611","title":"e‐Science Central for CARMEN: science as a service","year":2010,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University","keywords":"Workflow; Cloud computing; Computer science; World Wide Web; Scalability; Exploit; Software versioning; Software; Software engineering; Data science; Database; Operating system; Computer security","score_opus":0.09206965903151014,"score_gpt":0.4668605025260619,"score_spread":0.3747908434945518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237253841","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.95162934,0.00010728585,0.036685973,0.0027760945,0.0029658773,0.00032598968,0.000007735041,0.00004942807,0.0054522706],"genre_scores_gemma":[0.9911793,0.000014997063,0.007258098,0.0013163487,0.000078111625,0.00002160728,0.0000028403178,0.0000037239208,0.00012498265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965456,0.00004764676,0.0004252264,0.0011973649,0.0013124883,0.00047167408],"domain_scores_gemma":[0.9959647,0.0015462292,0.00028039134,0.00050091423,0.0013628821,0.00034486075],"candidate_categories":["metaresearch","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.005463195,0.00014230843,0.00015398307,0.0004080057,0.0016148698,0.002793352,0.00095854176,0.000032606797,0.000035343433],"category_scores_gemma":[0.012117288,0.00011703275,0.00002330445,0.0026308466,0.0015240151,0.004410258,0.00055998395,0.00016471905,0.00003306815],"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.00006340248,0.00015950129,0.0013953599,0.000021021131,0.0000058931223,0.000006484926,0.040168576,0.00014172457,0.017996116,0.14714763,0.001469294,0.791425],"study_design_scores_gemma":[0.0017430672,0.0005066613,0.026407793,0.000050264116,0.000054252625,0.00035243024,0.10459223,0.41391227,0.0043134964,0.038648862,0.40841514,0.0010035374],"about_ca_topic_score_codex":0.00007555615,"about_ca_topic_score_gemma":0.000010677359,"teacher_disagreement_score":0.7904215,"about_ca_system_score_codex":0.000017366732,"about_ca_system_score_gemma":0.0005785779,"threshold_uncertainty_score":0.9996849},"labels":[],"label_agreement":null},{"id":"W4238657552","doi":"10.1002/cpe.1405","title":"Distributed parallel compilation of MSBNs","year":2009,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Tree traversal; Asynchronous communication; Compiler; Set (abstract data type); Inference; Simple (philosophy); Distributed computing; Theoretical computer science; Parallel computing; Programming language; Artificial intelligence; Computer network","score_opus":0.0319058293536043,"score_gpt":0.33328489136371864,"score_spread":0.30137906201011433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238657552","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.047616884,0.0008198966,0.94935817,0.0013922122,0.00009060774,0.000068850466,0.0000034856039,0.000052674837,0.0005972228],"genre_scores_gemma":[0.9724824,0.00024943307,0.026857182,0.00037787802,0.000012554604,0.000004063286,0.000010298271,0.0000014423815,0.000004738747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915606,0.00006592977,0.00024417663,0.00026072125,0.00014966395,0.00012343357],"domain_scores_gemma":[0.9992823,0.00018286359,0.00017059452,0.00012216183,0.00016602575,0.00007605355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001550924,0.00009733044,0.0001285412,0.000041980285,0.00013183702,0.0001108839,0.00014869541,0.000041170464,0.0000018937501],"category_scores_gemma":[0.00011982976,0.00009364872,0.000015854883,0.00021118502,0.000079395526,0.0012215638,0.000044324406,0.000092557006,0.0000019235297],"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.00003881548,0.00017463975,0.0006172465,0.000023120207,0.0000106956795,0.0000070076935,0.014504672,0.0013231222,0.0009882555,0.3961815,0.00021069794,0.5859202],"study_design_scores_gemma":[0.0008339496,0.0006138916,0.019803805,0.00009229181,0.00002237602,0.00011848751,0.0017148064,0.9291644,0.00068388693,0.044375584,0.0021536164,0.0004228935],"about_ca_topic_score_codex":0.000009132755,"about_ca_topic_score_gemma":2.4302312e-7,"teacher_disagreement_score":0.9278413,"about_ca_system_score_codex":0.000005457059,"about_ca_system_score_gemma":0.000034997098,"threshold_uncertainty_score":0.3818884},"labels":[],"label_agreement":null},{"id":"W4239287583","doi":"10.1002/cpe.1349","title":"Optimizing process allocation of parallel programs for heterogeneous clusters","year":2008,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nexen (Canada)","funders":"Japan Society for the Promotion of Science","keywords":"Benchmark (surveying); Fast Fourier transform; Computer science; Process (computing); Predictability; Finite element method; Parallel computing; Computational fluid dynamics; Listing (finance); Algorithm; Computational science; Mathematical optimization; Mathematics; Statistics","score_opus":0.04248969868934799,"score_gpt":0.33678858178336796,"score_spread":0.29429888309401997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239287583","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.04820951,0.0009797841,0.9498263,0.0002815017,0.000089638124,0.00031757887,5.2326527e-7,0.0001265876,0.00016859244],"genre_scores_gemma":[0.7604092,0.0003415859,0.23900071,0.00014391787,0.000012106045,0.00007571712,0.000005803627,0.0000040312275,0.0000069467587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990255,0.000056534038,0.0002866129,0.00033184167,0.00014870925,0.00015077704],"domain_scores_gemma":[0.999015,0.00021354355,0.00026360506,0.00012285278,0.00031860502,0.000066418324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017262636,0.000117540505,0.00014927029,0.00006406879,0.00026950962,0.00007598227,0.00018987195,0.000047699268,4.0515414e-7],"category_scores_gemma":[0.00012752255,0.00011684928,0.000025672403,0.00019134485,0.00013722539,0.00097341323,0.00006542442,0.00006027689,3.3485196e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019188962,0.0005298302,0.00092475326,0.00032168307,0.00006555093,0.000015199792,0.13824184,0.0839323,0.0002377926,0.016272541,0.00024274542,0.75902385],"study_design_scores_gemma":[0.0005290185,0.00033217785,0.000065805,0.000057206104,0.000009939378,0.00018947184,0.000862126,0.99533296,0.00095988734,0.000795921,0.0006493446,0.00021612154],"about_ca_topic_score_codex":0.0000078914645,"about_ca_topic_score_gemma":2.6397763e-7,"teacher_disagreement_score":0.9114007,"about_ca_system_score_codex":0.00000734614,"about_ca_system_score_gemma":0.000057959074,"threshold_uncertainty_score":0.47649753},"labels":[],"label_agreement":null},{"id":"W4239575612","doi":"10.1002/cpe.1293","title":"Towards an integrated GIS‐based coastal forecast workflow","year":2008,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Bedford Institute of Oceanography; Fisheries and Oceans Canada","funders":"National Oceanic and Atmospheric Administration","keywords":"Geospatial analysis; Workflow; Context (archaeology); Computer science; Grid; SCOOP; Geographic information system; Storm surge; Variety (cybernetics); Meteorology; Storm; Database; Remote sensing; Geography","score_opus":0.04360194105333639,"score_gpt":0.3155570917525859,"score_spread":0.2719551506992495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239575612","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.15107666,0.0004851971,0.84627944,0.0004236368,0.00044990837,0.00013139051,0.0000072373055,0.00016850539,0.0009779986],"genre_scores_gemma":[0.96916753,0.00006662863,0.030146569,0.00047262525,0.000055315326,0.000019909572,0.00003953641,0.000006037174,0.000025850255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845654,0.00020701182,0.00030651724,0.0005072215,0.00026684083,0.00025584345],"domain_scores_gemma":[0.9988854,0.00024993398,0.00018814442,0.00021882236,0.00025757126,0.00020011462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026823164,0.00019516879,0.00019765123,0.0000761093,0.0004789519,0.00032074377,0.00031116625,0.00006961081,0.0000058035157],"category_scores_gemma":[0.00016683381,0.00017996004,0.000029240398,0.0004178636,0.00019482517,0.0018859251,0.0001062466,0.00017661377,0.000007975615],"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.00012248268,0.0004737388,0.0035319147,0.00006622559,0.000036278365,0.0002302551,0.0492998,0.0042326734,0.00012513803,0.022629086,0.0012445201,0.9180079],"study_design_scores_gemma":[0.0009862069,0.0005223197,0.0033482993,0.00008850571,0.000011422153,0.00075844507,0.0021034852,0.9525409,0.00012502675,0.00068870274,0.038335938,0.00049079093],"about_ca_topic_score_codex":0.0001245383,"about_ca_topic_score_gemma":0.0000051180714,"teacher_disagreement_score":0.94830817,"about_ca_system_score_codex":0.000012068767,"about_ca_system_score_gemma":0.00018611977,"threshold_uncertainty_score":0.7338558},"labels":[],"label_agreement":null},{"id":"W4240841027","doi":"10.1002/cpe.1577","title":"A formalized approach for designing a P2P‐based dynamic load balancing scheme","year":2010,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":1,"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 Ottawa","funders":"Canada Research Chairs","keywords":"Computer science; Quality of service; Load balancing (electrical power); Distributed computing; Emulation; Scheduling (production processes); Computer network; Engineering; Grid","score_opus":0.02011401221474497,"score_gpt":0.3180770782938474,"score_spread":0.29796306607910245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240841027","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.053386305,0.00045307746,0.944453,0.0002392707,0.00041142906,0.00031582205,0.0000032801452,0.00012844632,0.00060936663],"genre_scores_gemma":[0.72369665,0.000008825078,0.27590454,0.00026207534,0.000027711169,0.00007176811,0.000013911783,0.0000048342827,0.0000096859885],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986458,0.000081982034,0.0002946877,0.00047953936,0.00021969923,0.00027830809],"domain_scores_gemma":[0.998571,0.000612867,0.0002362377,0.00019083831,0.00026599577,0.00012310476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067318557,0.00017106232,0.0001915584,0.00005654188,0.0004174822,0.00046639674,0.00027439257,0.00007818958,0.0000013165798],"category_scores_gemma":[0.000413998,0.00016451777,0.000037751633,0.00023600999,0.00008559132,0.0012491277,0.000087739,0.00020136063,0.0000017746345],"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.0005342436,0.001056499,0.0037505464,0.001401615,0.00017568414,0.000046420613,0.10893606,0.009040297,0.04734931,0.16964428,0.0013981842,0.6566669],"study_design_scores_gemma":[0.000980532,0.00010656006,0.00015868987,0.000030258512,0.000009562097,0.0000925265,0.0008673131,0.99142724,0.00015671364,0.0003883342,0.0055408375,0.00024144897],"about_ca_topic_score_codex":0.000017527349,"about_ca_topic_score_gemma":0.000001072894,"teacher_disagreement_score":0.98238695,"about_ca_system_score_codex":0.000015285328,"about_ca_system_score_gemma":0.00016713107,"threshold_uncertainty_score":0.670884},"labels":[],"label_agreement":null},{"id":"W4240874170","doi":"10.1002/cpe.1398","title":"Design of a virtual environment aided by a model‐based formal approach using DEVS","year":2009,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","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 Ottawa","funders":"","keywords":"DEVS; Computer science; Human–computer interaction; Software engineering; Virtual machine; X3D; Event (particle physics); Virtual reality; Modeling and simulation; Simulation; Programming language","score_opus":0.045107300504691916,"score_gpt":0.28277629577075164,"score_spread":0.23766899526605972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240874170","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.12511449,0.0005511445,0.8738791,0.00016299608,0.000018352783,0.00008895877,8.393787e-7,0.000022217428,0.00016193425],"genre_scores_gemma":[0.9838242,0.0000650433,0.015188226,0.0008541853,0.000032392185,0.000009356918,0.000016473223,0.000005367837,0.000004745079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911225,0.000019044122,0.00025968073,0.00025891833,0.0001931886,0.00015693564],"domain_scores_gemma":[0.999458,0.00006428722,0.00028186844,0.000071417206,0.0001074901,0.000016909098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027569404,0.000136735,0.00017107985,0.00009482718,0.00022468588,0.00014422591,0.00007491275,0.00004544794,0.0000044547573],"category_scores_gemma":[0.00007522357,0.00012889449,0.000022064125,0.00019768061,0.00008135989,0.0025058973,0.00003471172,0.000075297205,0.000001096377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016153249,0.0002992632,0.00010359956,0.00009263082,0.000017683642,0.0000015327828,0.0016562124,0.85297644,0.002876287,0.0029440029,0.00005572509,0.1388151],"study_design_scores_gemma":[0.0004244447,0.000027276612,0.000014612159,0.000025229014,0.00007715865,0.0000030384724,0.0013874491,0.99704915,0.00010520905,0.0005895923,0.00013500276,0.00016186165],"about_ca_topic_score_codex":0.000039245668,"about_ca_topic_score_gemma":5.186916e-8,"teacher_disagreement_score":0.8587097,"about_ca_system_score_codex":0.0000071518352,"about_ca_system_score_gemma":0.000027365579,"threshold_uncertainty_score":0.5256165},"labels":[],"label_agreement":null},{"id":"W4247258147","doi":"10.1002/cpe.1264","title":"Babylon: middleware for distributed, parallel, and mobile Java applications","year":2008,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Hospital for Sick Children","funders":"","keywords":"Java; Computer science; Middleware (distributed applications); Operating system; Workstation; Asynchronous communication; Interface (matter); Class (philosophy); Distributed object; Distributed computing; Common Object Request Broker Architecture; Computer network","score_opus":0.033092069753377695,"score_gpt":0.3156579772345361,"score_spread":0.2825659074811584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247258147","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.035841435,0.0052185063,0.95746094,0.00042250036,0.00017305315,0.00053367834,0.000030443998,0.000112988724,0.00020645544],"genre_scores_gemma":[0.97912806,0.00072812306,0.019324124,0.00023224585,0.00006648714,0.00042040925,0.000059338814,0.000005552287,0.000035639594],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99873203,0.000072910276,0.0002937715,0.000519556,0.00015385455,0.0002278601],"domain_scores_gemma":[0.9986575,0.00060538214,0.00018697357,0.00019121444,0.00020575477,0.0001531444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018656542,0.0001679388,0.00019237072,0.000043725973,0.0006897203,0.00022315589,0.00021386865,0.00006438632,0.000001482418],"category_scores_gemma":[0.000092052316,0.00016436857,0.00002725056,0.00022948548,0.00018337533,0.0009810453,0.00013402375,0.00010060343,0.0000043023533],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001748653,0.00076580944,0.0076233223,0.00067569915,0.00015154305,0.000075039454,0.09788074,0.0059436453,0.00022911339,0.20454885,0.008025099,0.67390627],"study_design_scores_gemma":[0.0020834582,0.00064880465,0.0026942962,0.00009745316,0.000040344883,0.0015586189,0.004762015,0.3125375,0.000053859912,0.004094324,0.67055726,0.00087207527],"about_ca_topic_score_codex":0.000018258806,"about_ca_topic_score_gemma":5.163134e-7,"teacher_disagreement_score":0.94328666,"about_ca_system_score_codex":0.000010321993,"about_ca_system_score_gemma":0.000063222615,"threshold_uncertainty_score":0.67027557},"labels":[],"label_agreement":null},{"id":"W4250704650","doi":"10.1002/cpe.1450","title":"Guest Editorial: Distributed Simulation, Virtual Environments and Real‐time Applications","year":2009,"lang":"en","type":"editorial","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Avatar; Field (mathematics); Process (computing); Human–computer interaction; Virtual reality; Multimedia; Virtual machine; Representation (politics); Concurrency; Virtual representation; Affordance; World Wide Web; Programming language","score_opus":0.009576899784547682,"score_gpt":0.3067561795413589,"score_spread":0.29717927975681124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250704650","genre_codex":"methods","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018060749,0.0012112638,0.5464367,0.00016591113,0.4510044,0.0004725413,0.00013981352,0.00017637189,0.00021236342],"genre_scores_gemma":[0.07943762,0.00309222,0.0022217163,0.00010975386,0.9127035,0.00017632925,0.0019448407,0.00003408472,0.00027994276],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970678,0.00026171323,0.0006067914,0.0010165876,0.00072488445,0.00032223662],"domain_scores_gemma":[0.99588984,0.0025783048,0.00063880114,0.00036998736,0.00028251248,0.00024057338],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004848433,0.0004044915,0.00043199715,0.00009220043,0.00056914496,0.0008436874,0.0004379385,0.0004635736,0.0000015990083],"category_scores_gemma":[0.0006302795,0.00042264198,0.00003827621,0.00028850327,0.00020074625,0.0014230877,0.00028780117,0.0004544612,0.00002329357],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004771106,0.00024453382,0.000034326826,0.000093950046,0.00007336179,0.000014670067,0.005791017,0.0028093113,0.000051288895,0.002935758,0.9422084,0.04569565],"study_design_scores_gemma":[0.00051463285,0.00022617617,0.00006115003,0.00008279767,0.00004368477,0.000012066785,0.00018947912,0.028308362,0.0000026787745,0.00032973543,0.9697686,0.0004606689],"about_ca_topic_score_codex":0.000050630926,"about_ca_topic_score_gemma":5.076327e-7,"teacher_disagreement_score":0.544215,"about_ca_system_score_codex":0.000047811536,"about_ca_system_score_gemma":0.00015489584,"threshold_uncertainty_score":0.99982256},"labels":[],"label_agreement":null},{"id":"W4252223772","doi":"10.1002/cpe.1508","title":"StgDomain—scalable parallel domain software components for particle‐in‐cell finite element methods","year":2009,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Australian Government; National Cancer Research Institute; University of Canterbury; Monash University; Ontario Ministry of Natural Resources and Forestry","keywords":"Computer science; Finite element method; Scalability; Computational science; Domain (mathematical analysis); Parallel computing; Software; Programming language; Mathematics; Engineering; Structural engineering; Operating system; Mathematical analysis","score_opus":0.04844471670493381,"score_gpt":0.3930652425231359,"score_spread":0.3446205258182021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252223772","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.043178827,0.0015438875,0.9543902,0.00019333353,0.00015325622,0.00029874893,0.000003740225,0.000083394385,0.00015459253],"genre_scores_gemma":[0.33568287,0.00015995059,0.6638471,0.00021592315,0.000016591977,0.0000595182,0.000005619709,0.000007537933,0.0000048999746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989212,0.00012340854,0.00036183494,0.00023964509,0.00012750886,0.00022636366],"domain_scores_gemma":[0.99685836,0.0028039443,0.00009484949,0.00008405582,0.000069348964,0.000089471294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003932951,0.00015389237,0.00020531572,0.000041469902,0.0001140509,0.000057403133,0.000073474264,0.000044558303,0.000004522587],"category_scores_gemma":[0.0005055264,0.00015781273,0.000022620483,0.00017081058,0.000056382327,0.00049024035,0.000023354229,0.00012001182,0.0000019539189],"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.0001175669,0.00029078973,0.0002637982,0.00024295754,0.000020758758,0.000009259411,0.012548514,0.24711458,0.0020092926,0.013814102,0.000090130605,0.72347826],"study_design_scores_gemma":[0.0011343403,0.00021129164,0.00061738637,0.000055703917,0.000017084823,0.00001371176,0.001976383,0.85165584,0.00073067244,0.13730133,0.0059789782,0.00030727993],"about_ca_topic_score_codex":0.0000011992904,"about_ca_topic_score_gemma":1.3035508e-7,"teacher_disagreement_score":0.72317094,"about_ca_system_score_codex":0.000025779917,"about_ca_system_score_gemma":0.000010428792,"threshold_uncertainty_score":0.64354163},"labels":[],"label_agreement":null},{"id":"W4255149814","doi":"10.1002/cpe.1400","title":"A biologically inspired framework for multimedia service management in a ubiquitous environment","year":2009,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":19,"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 Ottawa","funders":"","keywords":"Transcoding; Computer science; Scalability; Mobile QoS; Quality of service; Multimedia; Service (business); Process (computing); Key (lock); Service composition; Distributed computing; Computer network; Service provider; Database; Computer security; Operating system","score_opus":0.02133997700991505,"score_gpt":0.3119779216447664,"score_spread":0.2906379446348514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255149814","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.15597063,0.0009817814,0.83491755,0.006552718,0.00020916932,0.00055338617,0.0000022236763,0.00008756343,0.000724976],"genre_scores_gemma":[0.77695006,0.0007314185,0.2142807,0.007898322,0.000034352302,0.00009328217,0.000006784304,0.0000032296746,0.0000018478679],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987055,0.00007634801,0.00027306448,0.00053625077,0.00015702039,0.0002517813],"domain_scores_gemma":[0.9990262,0.0004846171,0.00014161102,0.00018856977,0.000058479018,0.000100528465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018842901,0.00016964017,0.00016134593,0.000092412774,0.00016222379,0.00015895764,0.00030858742,0.00007728424,0.000002783587],"category_scores_gemma":[0.0000390868,0.00015099863,0.000020745421,0.00031405658,0.000037709782,0.0008054535,0.0001419956,0.0001354538,0.0000049095393],"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.00008443371,0.00020524813,0.00017343854,0.000049163446,0.000013482115,0.000021362444,0.03287787,0.0002164325,0.00018472614,0.052279696,0.0000076121783,0.91388655],"study_design_scores_gemma":[0.0060078953,0.0025176238,0.06928103,0.0005127867,0.00010216939,0.0001988178,0.0264114,0.609648,0.00091691606,0.20079666,0.08161698,0.0019897206],"about_ca_topic_score_codex":0.000026215088,"about_ca_topic_score_gemma":0.000004348916,"teacher_disagreement_score":0.9118968,"about_ca_system_score_codex":0.000013245786,"about_ca_system_score_gemma":0.000015262276,"threshold_uncertainty_score":0.61575454},"labels":[],"label_agreement":null},{"id":"W4286220023","doi":"10.1002/cpe.7188","title":"Visualization of profiling and tracing in CPU‐GPU programs","year":2022,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Debugging; Tracing; Profiling (computer programming); Parallel computing; Visualization; SIMD; Symmetric multiprocessor system; Kernel (algebra); Central processing unit; Queue; Operating system; Programming language; Artificial intelligence","score_opus":0.03139827628702556,"score_gpt":0.3462476522100001,"score_spread":0.3148493759229745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286220023","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.21879925,0.00148949,0.77883387,0.00013677962,0.00008179672,0.00018740931,4.5835353e-7,0.00007747927,0.0003934878],"genre_scores_gemma":[0.96180266,0.0002077592,0.03782079,0.0001049624,0.000005893294,0.00004511048,0.000004945017,0.0000031524214,0.0000047187254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990184,0.00016767606,0.00025764402,0.00028473127,0.00016121932,0.00011033105],"domain_scores_gemma":[0.9994459,0.00016971555,0.0001921249,0.000077556804,0.00007690828,0.00003779125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040586173,0.00008145509,0.00011677272,0.00011312653,0.00021823538,0.00009713152,0.0001129477,0.000021960363,0.0000011912348],"category_scores_gemma":[0.00008614525,0.00008887705,0.000008995035,0.000400353,0.00006513164,0.000814809,0.00019763316,0.00010347905,8.7313225e-8],"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.00006030398,0.0004005058,0.019928798,0.00016504468,0.000013536158,0.000018283672,0.08263587,0.0110520115,0.00068784755,0.18543541,0.00003149116,0.6995709],"study_design_scores_gemma":[0.0004442404,0.00032518237,0.0010695169,0.000047105998,0.000005396893,0.00009531851,0.0050399657,0.9886629,0.00060451863,0.0029107651,0.00059784844,0.0001972469],"about_ca_topic_score_codex":0.000030687093,"about_ca_topic_score_gemma":7.046163e-7,"teacher_disagreement_score":0.9776109,"about_ca_system_score_codex":0.000010966993,"about_ca_system_score_gemma":0.000036701596,"threshold_uncertainty_score":0.3624301},"labels":[],"label_agreement":null},{"id":"W4289520941","doi":"10.1002/cpe.7219","title":"Machine learning and IoT‐based model for patient monitoring and early prediction of diabetes","year":2022,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Artificial Intelligence in Healthcare","field":"Health Professions","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pan Am Clinic","funders":"","keywords":"Machine learning; Computer science; Naive Bayes classifier; Artificial intelligence; Random forest; Support vector machine; Decision tree; Receiver operating characteristic; Logistic regression; Python (programming language)","score_opus":0.1283474163911486,"score_gpt":0.45726478509937785,"score_spread":0.32891736870822924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289520941","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.98571706,0.0030918666,0.010054136,0.00033151364,0.00027124648,0.00044066441,0.000027395836,0.000024257464,0.000041842013],"genre_scores_gemma":[0.9981899,0.00022845597,0.001154595,0.00008530837,0.000028484437,0.00029086255,0.0000060658763,0.0000066927746,0.000009589694],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888486,0.00025970314,0.00033393997,0.00021767085,0.00015031802,0.00015349023],"domain_scores_gemma":[0.9980745,0.0013302417,0.00027141406,0.000041208565,0.00021167698,0.00007101599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043158865,0.0000774358,0.00012553783,0.000052081803,0.001227665,0.00001386834,0.000025892768,0.000040458788,0.000005819085],"category_scores_gemma":[0.0006337882,0.00008010177,0.000009191101,0.00007753096,0.00008196225,0.00024732828,0.000083087354,0.00028371965,1.3920885e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013125878,0.0000465753,0.75233227,0.00037442142,0.000008285699,4.070352e-7,0.13250513,0.0038645824,0.00065911637,0.0007062125,0.000010701841,0.109361015],"study_design_scores_gemma":[0.00023027562,0.0005409864,0.0060119,0.00008307172,0.000016792754,0.0000010479972,0.044902347,0.9464245,0.00017966506,0.0005591099,0.000967887,0.00008244779],"about_ca_topic_score_codex":0.00019039678,"about_ca_topic_score_gemma":0.0000036235933,"teacher_disagreement_score":0.9425599,"about_ca_system_score_codex":0.00002341269,"about_ca_system_score_gemma":0.000081984435,"threshold_uncertainty_score":0.9442331},"labels":[],"label_agreement":null},{"id":"W4292770508","doi":"10.1002/cpe.7303","title":"Enabling power measurement and control on Astra: The first petascale Arm supercomputer","year":2022,"lang":"en","type":"paratext","venue":"Concurrency and Computation Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"National Nuclear Security Administration","keywords":"Petascale computing; Supercomputer; ASTRA; Computer science; Parallel computing; Computational science; Operating system; Physics","score_opus":0.028778159703394906,"score_gpt":0.29736654502218235,"score_spread":0.2685883853187874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292770508","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.0010077606,0.014110105,0.9696736,0.0049785725,0.0017119336,0.0006061057,0.000013654891,0.00015710806,0.0077411938],"genre_scores_gemma":[0.98370034,0.0030319316,0.0071493736,0.005309687,0.00016085942,0.00019479632,0.000019400615,0.000024748128,0.0004088747],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973899,0.0003486979,0.00044201984,0.0008745084,0.00063036184,0.00031452836],"domain_scores_gemma":[0.99805874,0.0008239416,0.00035764437,0.0003528651,0.00028300233,0.00012378472],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008553299,0.000372801,0.00035145812,0.00014158635,0.00120162,0.00083085307,0.00052234135,0.00011893223,0.00008828682],"category_scores_gemma":[0.00016903754,0.00030231345,0.00005301267,0.00026558578,0.00020256672,0.0008010068,0.00041004448,0.0006171763,0.000029661998],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004720924,0.0017313899,0.00022735583,0.0007588491,0.0005931702,0.0001473074,0.12670971,0.048981078,0.00007574488,0.042637285,0.23609571,0.5415703],"study_design_scores_gemma":[0.0013035553,0.0010929655,0.00022653813,0.00023272973,0.00006678778,0.00027973615,0.001723456,0.15169376,0.00006701053,0.00041362367,0.8419673,0.00093257055],"about_ca_topic_score_codex":0.000032029886,"about_ca_topic_score_gemma":9.176782e-7,"teacher_disagreement_score":0.98269254,"about_ca_system_score_codex":0.00005136101,"about_ca_system_score_gemma":0.00012450342,"threshold_uncertainty_score":0.9999429},"labels":[],"label_agreement":null},{"id":"W4307918986","doi":"10.1002/cpe.7348","title":"Breast lesion identification and categorization using mammography screening based on combined convolutional recursive neural network framework with parameters optimized using multi‐objective seagull optimization algorithm","year":2022,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"AI in cancer detection","field":"Computer Science","cited_by":11,"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":"","keywords":"Computer science; Mammography; Convolutional neural network; Artificial intelligence; Artificial neural network; Pattern recognition (psychology); Algorithm; Identification (biology); Machine learning; Breast cancer; Cancer; Medicine","score_opus":0.033870215734192376,"score_gpt":0.30506608446506084,"score_spread":0.2711958687308685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307918986","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.057633024,0.00030013247,0.94079274,0.00024320478,0.00047797096,0.0004582752,0.000011439138,0.00007921656,0.0000040123437],"genre_scores_gemma":[0.55404353,0.000030215915,0.44563198,0.00017807329,0.000025387164,0.00005138357,0.000029187444,0.00000946676,7.5673654e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977802,0.00051702344,0.00032885454,0.0007003983,0.00043559476,0.00023791133],"domain_scores_gemma":[0.9982602,0.0005880434,0.0005612193,0.00017099018,0.00031628113,0.000103247025],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004188662,0.00022051219,0.00019317158,0.00020287604,0.0014651577,0.0003559387,0.00014398951,0.000069112284,0.000003732336],"category_scores_gemma":[0.00007763497,0.00023782827,0.000027722248,0.00095550355,0.00019865221,0.0018734294,0.00013121223,0.0003153025,1.2122536e-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.00031237476,0.00006307165,0.00077474216,0.000010008163,0.000018402436,0.0000045486754,0.0023393715,0.9687722,0.000035647656,0.0005896642,0.000002446419,0.027077531],"study_design_scores_gemma":[0.0012462233,0.00037109,0.0014469066,0.00006917188,0.000049210335,0.00021015145,0.002306103,0.99359435,0.000044063185,0.00037194067,0.000006171007,0.00028464393],"about_ca_topic_score_codex":0.00009995328,"about_ca_topic_score_gemma":4.7882355e-7,"teacher_disagreement_score":0.49641052,"about_ca_system_score_codex":0.00010910147,"about_ca_system_score_gemma":0.00010000172,"threshold_uncertainty_score":0.9998348},"labels":[],"label_agreement":null},{"id":"W4317717687","doi":"10.1002/cpe.7635","title":"Performance comparison of Dask and Apache Spark on HPC systems for neuroimaging","year":2023,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Canada Foundation for Innovation","keywords":"Computer science; SPARK (programming language); Big data; Python (programming language); File system; Neuroimaging; Pipeline (software); Database; Operating system; Programming language","score_opus":0.07232339667677312,"score_gpt":0.3845238603157263,"score_spread":0.31220046363895315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317717687","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.632308,0.001286616,0.3645159,0.0008802982,0.00027810963,0.00036664633,0.000003104274,0.0001058134,0.00025549042],"genre_scores_gemma":[0.995157,0.00081265223,0.0037625278,0.000125797,0.00002719225,0.000091063965,0.0000046014397,0.0000049435603,0.000014236728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990755,0.000047332713,0.00023931758,0.00035166854,0.0001329184,0.0001533131],"domain_scores_gemma":[0.9984833,0.0009999652,0.00020825493,0.00014647027,0.000098067874,0.00006396743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001702957,0.00010415822,0.00015172495,0.00006676205,0.00027243537,0.000104782586,0.00013886899,0.000024782774,1.8863778e-7],"category_scores_gemma":[0.0001294705,0.00010085702,0.000011075779,0.00034032614,0.00011180007,0.0009238669,0.00009907918,0.000091067675,0.0000021566495],"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.000085966094,0.00012607109,0.006854047,0.0003287408,0.000018005085,0.0000032207552,0.02648223,0.020700349,0.0016057193,0.07950528,0.0009336874,0.8633567],"study_design_scores_gemma":[0.00027188365,0.00019828568,0.0025251545,0.00004825156,0.000007671129,0.000021004484,0.0017058492,0.9888098,0.00031570857,0.0003778998,0.0055919,0.00012658497],"about_ca_topic_score_codex":0.0000040706027,"about_ca_topic_score_gemma":1.423595e-7,"teacher_disagreement_score":0.9681094,"about_ca_system_score_codex":0.000005058054,"about_ca_system_score_gemma":0.000015635907,"threshold_uncertainty_score":0.411283},"labels":[],"label_agreement":null},{"id":"W4321480070","doi":"10.1002/cpe.7655","title":"Design of a portable implementation of partitioned point‐to‐point communication primitives","year":2023,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Parallel Computing and Optimization Techniques","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":"Queen's University","funders":"National Science Foundation of Sri Lanka; Office of Science; University of Alabama at Birmingham; Sandia National Laboratories; U.S. Department of Energy; National Nuclear Security Administration; National Science Foundation","keywords":"Computer science; Thread (computing); Message passing; Message Passing Interface; Parallel computing; Point-to-point; Multithreading; Initialization; Serialization; Interface (matter); Inter-process communication; Concurrency; Distributed computing; Operating system; Computer network; Programming language","score_opus":0.046346348883302496,"score_gpt":0.37714700333144846,"score_spread":0.330800654448146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321480070","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.037030153,0.00025117418,0.96126634,0.0008732674,0.00004335106,0.00025237986,0.0000018843299,0.00011444141,0.00016703448],"genre_scores_gemma":[0.87415034,0.0005462136,0.12510182,0.00013675558,0.0000037282916,0.000041779134,0.000009990679,0.000003111189,0.0000062589284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895424,0.00019524481,0.00035776774,0.00022014393,0.0001575979,0.00011502496],"domain_scores_gemma":[0.9986907,0.00048504848,0.000317871,0.00017506849,0.00027881045,0.000052499458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056234794,0.00008354779,0.00013933542,0.00014523884,0.00014280989,0.000059764985,0.00017325749,0.000027419934,0.000004498609],"category_scores_gemma":[0.00017202979,0.000086994834,0.0000144731985,0.0005414683,0.0000772041,0.0010723267,0.00015174884,0.000050954543,0.0000021876758],"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.00016058183,0.00041881556,0.00303508,0.00028821122,0.00010343449,0.000009243556,0.31442162,0.07713796,0.011526874,0.14449702,0.0042397045,0.44416147],"study_design_scores_gemma":[0.0015526323,0.0012929298,0.011887506,0.00032335086,0.000046829227,0.0000553512,0.033698354,0.8633161,0.06647066,0.019722698,0.00097033696,0.0006632041],"about_ca_topic_score_codex":0.000045690726,"about_ca_topic_score_gemma":6.559632e-7,"teacher_disagreement_score":0.8371202,"about_ca_system_score_codex":0.0000071097816,"about_ca_system_score_gemma":0.000055757755,"threshold_uncertainty_score":0.35475463},"labels":[],"label_agreement":null},{"id":"W4367053587","doi":"10.1002/cpe.7712","title":"Multiscale aggregation and illumination‐aware attention network for infrared and visible image fusion","year":2023,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Advanced Image Fusion Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Computer science; Discriminative model; Artificial intelligence; Image fusion; Computer vision; Salient; Channel (broadcasting); Feature (linguistics); Fusion; Image (mathematics); Feature extraction; Focus (optics); Pattern recognition (psychology); Fusion rules; Optics","score_opus":0.014053380304732473,"score_gpt":0.31230037967996427,"score_spread":0.2982469993752318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367053587","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.40677512,0.0015393287,0.5903866,0.00018475018,0.00019050566,0.00038904644,0.000010554907,0.00034727875,0.0001767705],"genre_scores_gemma":[0.9670672,0.004614389,0.02790186,0.00006404814,0.000053797685,0.00013744991,0.000074177005,0.000015064053,0.00007200448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937725,0.000026343685,0.00017353141,0.00021163006,0.000080991835,0.00013025015],"domain_scores_gemma":[0.99940735,0.00030218042,0.00007129923,0.0000543389,0.0001109355,0.000053888507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014739536,0.0001059115,0.0001009082,0.000067474524,0.00025631706,0.00010332261,0.000025837002,0.00005020841,0.000003441689],"category_scores_gemma":[0.00019214443,0.0001135342,0.000009597181,0.00019081026,0.0000903597,0.0013015418,0.000048408427,0.0000694133,0.0000014460362],"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.000036439556,0.000016879743,0.00069273927,0.00025675911,0.000010301669,0.000004396618,0.007264114,0.0006364223,0.008677393,0.000637345,0.0020689324,0.9796983],"study_design_scores_gemma":[0.00090854755,0.0001624608,0.010654063,0.00019407294,0.00002978103,0.000045454875,0.0059366915,0.96488035,0.002659541,0.005296788,0.0088679865,0.00036427262],"about_ca_topic_score_codex":0.0000040738605,"about_ca_topic_score_gemma":0.0000011562574,"teacher_disagreement_score":0.979334,"about_ca_system_score_codex":0.000008551999,"about_ca_system_score_gemma":0.0000055103187,"threshold_uncertainty_score":0.46297905},"labels":[],"label_agreement":null},{"id":"W4382894810","doi":"10.1002/cpe.7858","title":"A fairness‐aware task offloading method in edge‐enabled IIoT with multi‐constraints using AGE‐MOEA and weighted MMF","year":2023,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":4,"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 British Columbia","funders":"Quanzhou City Science and Technology Program; China Postdoctoral Science Foundation; National Natural Science Foundation of China; Fundamental Research Funds for the Central Universities; National Science Foundation","keywords":"Computer science; Task (project management); Quality of service; Latency (audio); Industrial Internet; Distributed computing; Interconnection; Pareto principle; Resource constraints; Mathematical optimization; Computer network; Internet of Things; Computer security; Mathematics","score_opus":0.05004743630308772,"score_gpt":0.3647906888879399,"score_spread":0.3147432525848522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382894810","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.3835799,0.00039264624,0.6146193,0.00023663823,0.00072403083,0.00018560722,4.422754e-7,0.00012089598,0.0001405158],"genre_scores_gemma":[0.92226785,0.00011697669,0.07724978,0.00020357578,0.000108889646,0.00001947367,0.000005340664,0.000010972074,0.00001711391],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980794,0.00024074942,0.00035200585,0.0006985599,0.00022185878,0.00040738698],"domain_scores_gemma":[0.9985669,0.00076224294,0.00021377964,0.00016497553,0.0001431802,0.00014891637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006389201,0.00023816967,0.00028457897,0.00026347305,0.00046390356,0.00046846023,0.0002054912,0.00008304963,0.0000013493113],"category_scores_gemma":[0.00018515164,0.00021953174,0.000019913528,0.0010347309,0.00021844574,0.0019188344,0.0002853991,0.00025554374,0.000003819576],"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.00008380542,0.00015468698,0.007190776,0.00023198253,0.000056851197,0.0006440118,0.13186231,0.00084482756,0.0025375942,0.0036774082,0.00014333117,0.85257244],"study_design_scores_gemma":[0.0012624502,0.00010952889,0.004835918,0.00025367906,0.000020661308,0.00036593483,0.005819737,0.9849892,0.00025102886,0.00065494154,0.0010129351,0.00042393827],"about_ca_topic_score_codex":0.00009031232,"about_ca_topic_score_gemma":0.0000040301634,"teacher_disagreement_score":0.9841444,"about_ca_system_score_codex":0.000026072688,"about_ca_system_score_gemma":0.00011522627,"threshold_uncertainty_score":0.8952244},"labels":[],"label_agreement":null},{"id":"W4386988327","doi":"10.1002/cpe.7917","title":"<scp>DeepMUI</scp>: A novel method to identify malicious users on online social network platforms","year":2023,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Spam and Phishing Detection","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Tellabs (Canada)","funders":"","keywords":"Computer science; Malware; Pooling; Metadata; Identification (biology); Dissemination; Social network (sociolinguistics); World Wide Web; Phishing; Computer security; Social media; Task (project management); Internet privacy; Data science; The Internet; Artificial intelligence; Engineering","score_opus":0.05974817568560483,"score_gpt":0.39912975763397524,"score_spread":0.3393815819483704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386988327","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.36999947,0.00010258641,0.62754637,0.0009115102,0.0008246807,0.00015553534,0.000004452772,0.000212476,0.00024293343],"genre_scores_gemma":[0.9632845,0.00009528245,0.03304679,0.003057201,0.00034593092,0.000051610557,0.000017844079,0.000013155842,0.00008769176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984854,0.00007620647,0.00026654638,0.00053245015,0.00031449192,0.0003249346],"domain_scores_gemma":[0.9982796,0.0011318455,0.00017531228,0.0001447168,0.00012208716,0.00014648434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059715664,0.00017332802,0.00017639744,0.00014044189,0.0005935662,0.0004320032,0.00026158016,0.00008773067,0.0000012913671],"category_scores_gemma":[0.00047145245,0.00016906895,0.000035388017,0.0010299402,0.000050402217,0.0013637027,0.00019808972,0.000222823,0.00003657688],"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.00008679938,0.00032677833,0.00076569605,0.000077765646,0.00008705895,0.00006531415,0.1757918,0.013633674,0.0032095695,0.08262619,0.013999119,0.70933026],"study_design_scores_gemma":[0.0029204425,0.0018939252,0.07062513,0.0002531843,0.00009734354,0.0004975437,0.030870577,0.7175232,0.0012714099,0.02546765,0.14759262,0.0009869842],"about_ca_topic_score_codex":0.00004732537,"about_ca_topic_score_gemma":0.000004992122,"teacher_disagreement_score":0.70834327,"about_ca_system_score_codex":0.000020562946,"about_ca_system_score_gemma":0.000039779166,"threshold_uncertainty_score":0.6894432},"labels":[],"label_agreement":null},{"id":"W4392353220","doi":"10.1002/cpe.8059","title":"A recurrence for the surface area of the (n,k)$$ \\left(n,k\\right) $$‐star graph","year":2024,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Star (game theory); Computer science; Graph; Star network; A* search algorithm; Surface (topology); Combinatorics; Mathematics; Discrete mathematics; Theoretical computer science; Algorithm; Network topology; Geometry; Computer network","score_opus":0.028157599498894282,"score_gpt":0.3089877351882812,"score_spread":0.2808301356893869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392353220","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.05508335,0.0150632365,0.92152494,0.00406338,0.003199492,0.00046193274,0.000006640831,0.000062356856,0.00053466205],"genre_scores_gemma":[0.99752086,0.00060696667,0.0014201707,0.00027670513,0.00005250202,0.000030553656,8.2335845e-7,0.0000041704343,0.00008723846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892324,0.00012431518,0.00027972148,0.00033730967,0.00018387634,0.00015153733],"domain_scores_gemma":[0.997591,0.0018174442,0.00013934584,0.00021895685,0.00019161392,0.000041615956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050274126,0.000118920165,0.00012259858,0.00003062624,0.00040186528,0.00035352408,0.00034476692,0.000042440268,0.000005140626],"category_scores_gemma":[0.00017814673,0.00006789653,0.00005936025,0.00033429536,0.00018810984,0.00095840986,0.0001140467,0.00014716625,0.0000014419234],"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.000060676262,0.00009932727,0.00047289458,0.00036178707,0.00012962299,0.0000085315705,0.09468284,0.0024396563,0.0004923598,0.6412616,0.00839188,0.25159883],"study_design_scores_gemma":[0.0002291349,0.00016392686,0.00044063304,0.00029858647,0.000034915192,0.00020588675,0.0042516007,0.89018583,0.0004944577,0.008145772,0.095334396,0.00021486217],"about_ca_topic_score_codex":0.000030747397,"about_ca_topic_score_gemma":0.0000059779463,"teacher_disagreement_score":0.9424375,"about_ca_system_score_codex":0.0000089001505,"about_ca_system_score_gemma":0.00007182293,"threshold_uncertainty_score":0.3409041},"labels":[],"label_agreement":null},{"id":"W4413458719","doi":"10.1002/cpe.70238","title":"Cloudhive: A Cloud‐Based Framework for Smart Grid Co‐Simulation, Data, and Communication","year":2025,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":1,"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 Fredericton; University of New Brunswick","funders":"Atlantic Canada Opportunities Agency; Chinese Academy of Sciences","keywords":"Computer science; Cloud computing; Smart grid; Distributed computing; Grid; Operating system; Electrical engineering; Geology","score_opus":0.03150845662676002,"score_gpt":0.3795792603001423,"score_spread":0.3480708036733823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413458719","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.1286082,0.009052092,0.86000574,0.0007585391,0.0006805613,0.00032844147,0.000039852097,0.00010178047,0.00042477003],"genre_scores_gemma":[0.98735774,0.001264001,0.010744725,0.00043287646,0.000057316127,0.000042777076,0.000088862405,0.0000056635267,0.0000060703737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992944,0.000058567366,0.00020452111,0.00024289699,0.00007937062,0.0001202154],"domain_scores_gemma":[0.9977248,0.0018492404,0.000059735918,0.0002245324,0.000088783985,0.000052950825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021934437,0.000110202236,0.000121604135,0.00005126649,0.00033237244,0.00013226893,0.00013887371,0.00007538655,0.000003305801],"category_scores_gemma":[0.0005081443,0.00011461675,0.00001015631,0.00014730668,0.00017316773,0.00065179355,0.00006198227,0.00015037367,0.0000010370626],"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.0008022311,0.00049189123,0.016059002,0.0025074906,0.0002760152,0.000010014505,0.089141086,0.12879877,0.0005061707,0.2156212,0.01522971,0.53055644],"study_design_scores_gemma":[0.0004666151,0.000040327115,0.0013606852,0.00013671181,0.000034287987,0.000004949935,0.0027308182,0.9176627,0.00013070782,0.0042077075,0.073054686,0.00016980083],"about_ca_topic_score_codex":0.0000094089955,"about_ca_topic_score_gemma":0.0000026060904,"teacher_disagreement_score":0.8587495,"about_ca_system_score_codex":0.000008212889,"about_ca_system_score_gemma":0.00003110336,"threshold_uncertainty_score":0.46739352},"labels":[],"label_agreement":null},{"id":"W4414986814","doi":"10.1002/cpe.70337","title":"A Systematic Overview of Caching Mechanisms to Improve Hadoop Performance","year":2025,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Caching and Content Delivery","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":"McMaster University","funders":"","keywords":"Cache; Key (lock); Data access; Resource (disambiguation); Relational database; Distributed database; Cache algorithms","score_opus":0.02576432047012451,"score_gpt":0.3240513279266728,"score_spread":0.2982870074565483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414986814","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.21640849,0.004193468,0.7773837,0.00062176434,0.00049276644,0.00031083048,0.0000010490461,0.00005063681,0.00053729466],"genre_scores_gemma":[0.9950472,0.0003600115,0.003514273,0.000959151,0.000006386684,0.000048725648,5.477508e-7,0.0000023328264,0.00006134096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893963,0.00011210597,0.00033151763,0.00031690448,0.00016609108,0.00013373536],"domain_scores_gemma":[0.9990254,0.00038863657,0.00017272313,0.00019520432,0.00015461812,0.00006340806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000399554,0.000114828865,0.00022559766,0.000107263564,0.00018623601,0.0001431007,0.00022684938,0.000031908505,7.397173e-7],"category_scores_gemma":[0.00031771138,0.00010443453,0.000025875663,0.00031806788,0.000034261677,0.0010597431,0.00019861768,0.00009770491,0.0000027665421],"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.000084783,0.00023441501,0.00034394805,0.013976411,0.00013161413,0.000015714693,0.04011538,0.0008439653,0.016504532,0.6040257,0.0001222261,0.32360128],"study_design_scores_gemma":[0.0013583637,0.0008705233,0.0012036506,0.0108823925,0.00016566894,0.00014073125,0.011640049,0.9605255,0.0058361175,0.0059439153,0.0006401187,0.00079295516],"about_ca_topic_score_codex":0.000055585882,"about_ca_topic_score_gemma":9.3514166e-7,"teacher_disagreement_score":0.9596816,"about_ca_system_score_codex":0.000012927508,"about_ca_system_score_gemma":0.00005569168,"threshold_uncertainty_score":0.42587167},"labels":[],"label_agreement":null},{"id":"W4416301706","doi":"10.1002/cpe.70435","title":"Faster Positional‐Population Counts for AVX2, AVX‐512, and ASIMD","year":2025,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","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":"Université TÉLUQ; Université du Québec à Montréal","funders":"","keywords":"SIMD; Set (abstract data type); Population; Adaptation (eye); Implementation; Instruction set","score_opus":0.01288505849856828,"score_gpt":0.3266617003134753,"score_spread":0.313776641814907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416301706","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.9708973,0.0075212447,0.018400315,0.0004888514,0.00023282126,0.00015273616,0.000013122771,0.0000027328313,0.0022908438],"genre_scores_gemma":[0.99766016,0.00074011,0.000907174,0.00046392923,0.000033169585,0.000020524327,0.000025445901,0.0000019560357,0.00014752393],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996967,0.000013090773,0.0000733954,0.00014078761,0.000025842153,0.00005022335],"domain_scores_gemma":[0.9998162,0.000043381075,0.00003357138,0.000032132106,0.00005823476,0.00001652866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000045755238,0.00004918165,0.000046414894,0.000013360969,0.000108595385,0.000029250417,0.00001669497,0.000029649691,0.0000016346717],"category_scores_gemma":[0.000051662286,0.00004818082,0.000008002775,0.00002100588,0.00004124873,0.0000048876836,0.000027380278,0.000017871133,4.6517366e-7],"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.00052022166,0.00020865155,0.038461354,0.0003296843,0.00028190893,0.0000023707883,0.0068772547,0.00013675884,0.07842073,0.056764938,0.008688815,0.80930734],"study_design_scores_gemma":[0.003300445,0.00089218374,0.19967194,0.00012536818,0.0002105235,0.00008969986,0.006540138,0.00986687,0.006378575,0.014391547,0.7576343,0.0008984276],"about_ca_topic_score_codex":0.0000043957807,"about_ca_topic_score_gemma":9.0926704e-7,"teacher_disagreement_score":0.80840886,"about_ca_system_score_codex":0.0000016948555,"about_ca_system_score_gemma":0.000012242086,"threshold_uncertainty_score":0.19647568},"labels":[],"label_agreement":null},{"id":"W7111141754","doi":"10.1002/cpe.70477","title":"QTTARNN: A Highly‐Efficient Attention Driven Quantized Tensor Train Recursive Neural Network for Cyber‐Physical‐Social Intelligence","year":2025,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Natural Science Foundation of China","keywords":"Tensor (intrinsic definition); Artificial neural network; Lossless compression; Quantization (signal processing); Action (physics); Feature (linguistics); Recurrent neural network; Pattern recognition (psychology)","score_opus":0.0520028463967384,"score_gpt":0.4057809311656086,"score_spread":0.3537780847688702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7111141754","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.6194683,0.00016619191,0.37557825,0.0035135183,0.00023390533,0.0005816727,0.000015521278,0.000074148695,0.00036853357],"genre_scores_gemma":[0.98641294,0.00004189102,0.012668287,0.00041783054,0.000105381696,0.000246455,0.000025038085,0.000007636099,0.0000745208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998901,0.00011621352,0.00031344543,0.00035222556,0.00012306766,0.00019406588],"domain_scores_gemma":[0.9980212,0.0013460482,0.00023052157,0.00009220257,0.00025209447,0.000057974714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016533157,0.00014752815,0.00021745801,0.000052325355,0.0005713615,0.0001108005,0.00009117688,0.00005531338,0.000004032623],"category_scores_gemma":[0.000320893,0.0001437505,0.00006347449,0.0002872284,0.0001621327,0.00023205209,0.00003942345,0.00012848337,0.0000029138039],"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.0002126701,0.00047144658,0.00010947146,0.00010961518,0.000054365388,0.0000022338431,0.022521485,0.0008726775,0.00081118493,0.89634866,0.0025016218,0.07598456],"study_design_scores_gemma":[0.0025337755,0.00046201138,0.0047072032,0.00029457026,0.0004704607,0.00005268613,0.03939137,0.6743277,0.0005266649,0.2587032,0.017614134,0.00091628585],"about_ca_topic_score_codex":0.000006344769,"about_ca_topic_score_gemma":0.0000015020487,"teacher_disagreement_score":0.673455,"about_ca_system_score_codex":0.00001845882,"about_ca_system_score_gemma":0.000028644043,"threshold_uncertainty_score":0.5861975},"labels":[],"label_agreement":null},{"id":"W7117456447","doi":"10.1002/cpe.70496","title":"Predictive Modelling of Tick Distribution: A Machine Learning Approach to <i>Ixodes ricinus</i> Abundance","year":2025,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Vector-borne infectious diseases","field":"Immunology and Microbiology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institute of Infection and Immunity","funders":"","keywords":"Random forest; Support vector machine; Hyperparameter optimization; Hyperparameter; Sampling (signal processing); Grid; Pipeline (software); Categorical variable; Feature selection; Feature (linguistics)","score_opus":0.01803323360797663,"score_gpt":0.2849989267748795,"score_spread":0.26696569316690283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117456447","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.3294512,0.010638297,0.6575576,0.00012120405,0.00019225517,0.000190431,0.000030215971,0.000049074428,0.0017697251],"genre_scores_gemma":[0.9988111,0.00040278072,0.00040260825,0.00016497687,0.000008215657,0.000044171196,0.00007609948,0.000003473165,0.000086570886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991697,0.00015288986,0.00022016092,0.00028395685,0.000035715893,0.0001375481],"domain_scores_gemma":[0.9992242,0.00037355602,0.00012861607,0.00007258544,0.00017426301,0.000026789763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012823963,0.00011418213,0.00017298135,0.000051117306,0.0002691875,0.000028680313,0.000063159736,0.00006247786,0.000006167473],"category_scores_gemma":[0.00032521645,0.00011099609,0.000021686068,0.00023542557,0.0001959917,0.00030644023,0.00006584236,0.0001720958,0.0000041204785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0044179796,0.004228046,0.07689874,0.001378526,0.0014425208,0.00001652809,0.14159395,0.3568738,0.024175067,0.13818914,0.003825368,0.24696036],"study_design_scores_gemma":[0.009291099,0.0037107058,0.025483247,0.0012535804,0.0012593037,0.0006127404,0.05539395,0.71513176,0.02885468,0.0046642623,0.15214165,0.0022030394],"about_ca_topic_score_codex":0.000103481296,"about_ca_topic_score_gemma":8.494914e-7,"teacher_disagreement_score":0.6693599,"about_ca_system_score_codex":0.000016167633,"about_ca_system_score_gemma":0.000051344992,"threshold_uncertainty_score":0.4526289},"labels":[],"label_agreement":null}]}