{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":162,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":162,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"cadf0284ab08","filters":{"venue":"Concurrency and Computation Practice and Experience"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02074667740047362,"gpt":0.3010087496171185,"spread":0.2802620722166448,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004833941,0.000162372,0.0002147581,0.0000676562,0.000426475,0.0004160325,0.0001664851,0.00005044386,4.175821e-7],"category_scores_gemma":[0.0002820805,0.0001630162,0.00002012363,0.0002888049,0.00005597912,0.0002452379,0.000348037,0.0001906181,0.000001520638],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001738745,"about_ca_system_score_gemma":0.00002243408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002274418,"about_ca_topic_score_gemma":8.156204e-7,"domain_scores_codex":[0.9984941,0.0001370643,0.0003783522,0.0005251629,0.0001780121,0.0002872794],"domain_scores_gemma":[0.998954,0.000493146,0.000231733,0.0000899889,0.00009271673,0.0001384059],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003458335,0.00004572216,0.00137929,0.0002568093,0.00002067233,0.0000139429,0.1116059,0.8238109,0.00006486393,0.006206473,0.00004916147,0.05651171],"study_design_scores_gemma":[0.0008384638,0.0001911705,0.000378109,0.00009724499,0.00001027042,0.00002444438,0.01548236,0.9799092,0.00001053267,0.00003857917,0.002817358,0.0002022833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.303929,0.001649559,0.6926205,0.001016374,0.0002094349,0.0002595823,1.863373e-7,0.0001964651,0.0001188821],"genre_scores_gemma":[0.9878298,0.00008189944,0.01130096,0.0006655179,0.00008329763,0.00002010597,0.000003706986,0.000006829027,0.000007882668],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6839008,"threshold_uncertainty_score":0.6647607,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0161056960932537,"gpt":0.3230248090226117,"spread":0.306919112929358,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002748537,0.0001300544,0.0001540338,0.0001274086,0.00009179609,0.00009823908,0.0002246621,0.00007659329,0.000004500774],"category_scores_gemma":[0.0001463709,0.0001327228,0.00002666219,0.0002183727,0.00007789561,0.00306162,0.00006601611,0.0001188576,0.000001188127],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001629445,"about_ca_system_score_gemma":0.00003974622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003660652,"about_ca_topic_score_gemma":6.967884e-7,"domain_scores_codex":[0.9989641,0.0000794252,0.0002587716,0.0004197169,0.0001412339,0.0001367863],"domain_scores_gemma":[0.9988551,0.0003282087,0.000284169,0.0002148737,0.0002531627,0.00006453128],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002503899,0.0002105405,0.0005979636,0.0002845782,0.000017174,0.000004100309,0.01307696,0.0001937022,0.1968011,0.02435879,0.00002090131,0.7641838],"study_design_scores_gemma":[0.0006015634,0.001634022,0.0002756777,0.0001027256,0.00001256594,0.0001023368,0.001185267,0.4219364,0.5661807,0.005781058,0.001840577,0.0003471055],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0454447,0.0001997682,0.9532573,0.0001209557,0.0001878549,0.0005158819,0.000001579356,0.0001724335,0.00009948799],"genre_scores_gemma":[0.8522578,0.00002367869,0.1472356,0.0002944606,0.00000970284,0.0001589395,0.000002982089,0.000006544753,0.00001017718],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8068132,"threshold_uncertainty_score":0.5412279,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Manitoba","keywords":"Interdependence; Computer science; Friendship; Social network (sociolinguistics); Social network analysis; Data science; Data mining; World Wide Web; Social media; Sociology","retraction":null,"screen_n_in":null,"score":{"opus":0.0467482113840547,"gpt":0.3547713504565648,"spread":0.3080231390725101,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002293627,0.00009951494,0.000107045,0.00002321407,0.0004523948,0.0002283086,0.0001896657,0.00003294626,0.00000139916],"category_scores_gemma":[0.0002097194,0.00007933738,0.00002592055,0.0001106482,0.00005285853,0.00135935,0.0001438896,0.00004264728,0.000002068911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007487795,"about_ca_system_score_gemma":0.0000256289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007277884,"about_ca_topic_score_gemma":9.927331e-7,"domain_scores_codex":[0.999118,0.00003906728,0.0001952927,0.0003561612,0.00009536089,0.0001960859],"domain_scores_gemma":[0.998857,0.0007715048,0.0001429111,0.00009857662,0.0000673223,0.00006264458],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000659163,0.00002140022,0.0008367224,0.000009475156,0.00001132491,0.000002506947,0.008457304,0.000006302376,0.00006043346,0.02405465,0.0005750544,0.9659582],"study_design_scores_gemma":[0.007385179,0.001238127,0.02438842,0.001139737,0.0001765854,0.0003678159,0.02777453,0.7121853,0.0003048804,0.03432896,0.1879774,0.00273314],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07457697,0.000226747,0.9226915,0.001931602,0.0002597015,0.0001143775,0.000006037448,0.00006246186,0.0001306355],"genre_scores_gemma":[0.8651753,0.00005250329,0.1341514,0.0003608,0.0001260728,0.00009847501,0.000005309419,0.000004586556,0.00002556887],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9632251,"threshold_uncertainty_score":0.34795,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","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","retraction":null,"screen_n_in":null,"score":{"opus":0.07417905640899732,"gpt":0.3620698924480471,"spread":0.2878908360390498,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005294178,0.0001338148,0.0001276512,0.00004554381,0.0003270504,0.0003448043,0.0005032029,0.00005527185,6.135766e-7],"category_scores_gemma":[0.001170822,0.0001209046,0.000009084843,0.0002832319,0.0001116676,0.003861865,0.0004172414,0.0001258618,0.000002526712],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003404467,"about_ca_system_score_gemma":0.000180549,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006940065,"about_ca_topic_score_gemma":0.00005770017,"domain_scores_codex":[0.9985403,0.00008375917,0.0002192994,0.0007451297,0.0002241838,0.0001872918],"domain_scores_gemma":[0.9979194,0.0004644922,0.0002322668,0.0008491626,0.0003784506,0.0001562394],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009248619,0.001230571,0.0028714,0.0003637342,0.0001077804,0.00003870412,0.1078138,0.001588649,0.0005858965,0.3573669,0.02380295,0.5033048],"study_design_scores_gemma":[0.0008390641,0.0003292981,0.0001286697,0.00003721555,0.00002205442,0.0001592971,0.004469206,0.9574574,0.00003544124,0.001489831,0.03481771,0.0002148182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05364488,0.0008069997,0.9423351,0.002147874,0.0003085512,0.0004601373,0.00008287868,0.0001004429,0.0001131284],"genre_scores_gemma":[0.8997489,0.00006668198,0.09930173,0.000233001,0.00006511932,0.00008319634,0.0004761219,0.000007515685,0.00001771357],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9558687,"threshold_uncertainty_score":0.4930348,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01942941235621537,"gpt":0.31814882606555,"spread":0.2987194137093346,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002507686,0.0001447757,0.0001999362,0.00008840271,0.0002292478,0.0001453602,0.0001073249,0.00003548399,0.000001411393],"category_scores_gemma":[0.000214173,0.0001209031,0.000009936682,0.0002779807,0.0001139903,0.001923122,0.0001023582,0.0001489514,4.913657e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002173143,"about_ca_system_score_gemma":0.00002971313,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007994132,"about_ca_topic_score_gemma":0.000009156762,"domain_scores_codex":[0.9988734,0.0001004702,0.0002148126,0.0004629081,0.0001675458,0.0001808541],"domain_scores_gemma":[0.9981208,0.001404773,0.0001844374,0.0001006204,0.0001066479,0.00008267381],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002237942,0.00009553066,0.1297596,0.0002773359,0.00002815535,0.00001544876,0.08901145,0.05433118,0.0001108299,0.01048615,0.00002296863,0.7156376],"study_design_scores_gemma":[0.001027893,0.0004483628,0.01260872,0.0001419938,0.00001223868,0.00006277706,0.003307363,0.9800953,0.00001005548,0.001819339,0.0002852876,0.0001806837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4215223,0.002358092,0.5751727,0.0003832462,0.0002209491,0.000211659,2.516335e-7,0.00003984222,0.00009088717],"genre_scores_gemma":[0.9918812,0.0003528623,0.007424627,0.0002290271,0.00006523619,0.00003120789,0.000003396008,0.000007037727,0.000005410478],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9257641,"threshold_uncertainty_score":0.4930285,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0224999059132873,"gpt":0.3008806597473093,"spread":0.278380753834022,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002631768,0.0001547037,0.0001579889,0.00004013158,0.0004276307,0.0001530191,0.0001719335,0.0001006553,6.408816e-7],"category_scores_gemma":[0.0001521309,0.0001444233,0.00001948087,0.0002757276,0.0001480218,0.000102739,0.0001117676,0.0002092705,3.522558e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007063704,"about_ca_system_score_gemma":0.00003236543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003330604,"about_ca_topic_score_gemma":1.126465e-7,"domain_scores_codex":[0.9987967,0.00008069779,0.0002211506,0.0005827736,0.0001240452,0.0001946465],"domain_scores_gemma":[0.999005,0.0004416896,0.0001742326,0.0001486342,0.0001106789,0.0001198321],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003412286,0.0006940346,0.0006464883,0.0004050493,0.00003466278,0.00001220843,0.03841865,0.1289609,0.0002654424,0.2994483,0.0002512059,0.5305219],"study_design_scores_gemma":[0.0007246796,0.0002434745,0.00005451373,0.00001757951,0.000007181134,0.00001605125,0.001453873,0.9958575,0.0001016937,0.0001748293,0.001174179,0.0001744477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02322555,0.00007985044,0.9661851,0.002953508,0.00002986565,0.007263765,0.000002392875,0.0001305537,0.0001294176],"genre_scores_gemma":[0.9421812,0.000004619732,0.04741713,0.001518627,0.00003698405,0.008831482,0.000002895228,0.000005733493,0.000001303514],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9189557,"threshold_uncertainty_score":0.588941,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01471353826214409,"gpt":0.2903653833738191,"spread":0.275651845111675,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006985945,0.00007958883,0.0001208492,0.00006287264,0.00003707872,0.00002187002,0.00006711687,0.00007029394,0.000004722862],"category_scores_gemma":[0.00003883833,0.00008047554,0.00001093614,0.0001783747,0.00007042204,0.0004044926,0.00002339699,0.0001150052,0.000002762179],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001028065,"about_ca_system_score_gemma":0.00001594816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001615581,"about_ca_topic_score_gemma":9.307817e-7,"domain_scores_codex":[0.9995041,0.00001300584,0.000180383,0.0001535062,0.00004840903,0.0001005177],"domain_scores_gemma":[0.9994877,0.0002016338,0.00007448091,0.00007630242,0.0001279304,0.00003194788],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005759696,0.0000544023,0.003055503,0.0005976503,0.00004683049,9.276635e-7,0.02196181,0.001667602,0.001923875,0.07074662,0.0003628469,0.8995243],"study_design_scores_gemma":[0.0008813028,0.0003316904,0.0003944421,0.00024352,0.00003255064,0.00005605706,0.01953509,0.9171902,0.003670685,0.003749137,0.05352927,0.0003860707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3974929,0.003804945,0.5968339,0.0004389107,0.0002338319,0.0005182849,0.000005411712,0.0001493717,0.0005224139],"genre_scores_gemma":[0.9948497,0.0002912148,0.004581372,0.00008408739,0.00001268958,0.0001421058,0.00001748364,0.000007531836,0.00001382506],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9155226,"threshold_uncertainty_score":0.3281697,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02722615353524091,"gpt":0.3487067222338325,"spread":0.3214805686985916,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00142194,0.0001779874,0.0001720496,0.0003134006,0.0002401841,0.0003579973,0.000383523,0.00008015129,0.000002886109],"category_scores_gemma":[0.0007960972,0.0001863477,0.00001827559,0.001325721,0.00009356579,0.001231178,0.0002544202,0.0003443664,0.00001291533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005759801,"about_ca_system_score_gemma":0.00007656048,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007881269,"about_ca_topic_score_gemma":0.00002424065,"domain_scores_codex":[0.997985,0.0000983667,0.0003281818,0.000617074,0.0005108245,0.0004605226],"domain_scores_gemma":[0.998404,0.0006667016,0.00009328387,0.0001793335,0.0004630366,0.000193623],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009233526,0.0001162875,0.003087632,0.00001442906,0.000007585499,0.00006780706,0.01001882,0.02701268,0.0002884572,0.008078804,0.001670997,0.9495442],"study_design_scores_gemma":[0.0007561144,0.0005565872,0.01749059,0.00008654938,0.000008055584,0.0001660844,0.00319735,0.9367911,0.002004251,0.000898305,0.03744955,0.0005955246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2128336,0.0003283533,0.7791167,0.006652582,0.0002701551,0.0002357451,6.761825e-7,0.0001811395,0.0003810049],"genre_scores_gemma":[0.9530225,0.00004349143,0.04518657,0.001601813,0.00005410396,0.00003537373,0.00000352781,0.000006905272,0.00004570633],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9489486,"threshold_uncertainty_score":0.7599037,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01390725216642667,"gpt":0.2696391232213272,"spread":0.2557318710549005,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001795044,0.0001489686,0.0001821598,0.00001977785,0.0001132933,0.00008707531,0.00006632584,0.00008298849,0.00001603662],"category_scores_gemma":[0.0000712128,0.0001456136,0.00001896616,0.0002258945,0.00004682361,0.0001867009,0.00002316613,0.0002554209,0.000004415474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001089312,"about_ca_system_score_gemma":0.00001610806,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006823773,"about_ca_topic_score_gemma":7.409329e-7,"domain_scores_codex":[0.9990498,0.0000884367,0.0002683658,0.0002392134,0.0001091017,0.0002450494],"domain_scores_gemma":[0.9993705,0.0002946197,0.00006397743,0.00006111406,0.00003805639,0.0001717109],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008466886,0.00001860446,0.0005260044,0.00004579328,0.000007883291,0.00002323875,0.004365891,0.9459249,0.0001191891,0.000338193,0.0009227744,0.04762281],"study_design_scores_gemma":[0.0007558599,0.00009123229,0.0003061957,0.00007231025,0.00001025566,0.000007549072,0.0003760134,0.9774547,0.00003441856,0.00004419927,0.02066409,0.0001832338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1072643,0.01299726,0.8743715,0.000871906,0.0006500306,0.00211327,0.000002231837,0.0001840584,0.001545424],"genre_scores_gemma":[0.9979047,0.0002683622,0.0004273392,0.0009172215,0.0002426261,0.000220574,0.000004856882,0.00001130545,0.000003057025],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8906403,"threshold_uncertainty_score":0.5937951,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01103865580305113,"gpt":0.2665108632302977,"spread":0.2554722074272466,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001352632,0.00007496688,0.00009115646,0.00002099044,0.0001703083,0.00005324056,0.00006023058,0.00007314263,0.00000214944],"category_scores_gemma":[0.0002476032,0.0000558812,0.00001549677,0.00008727324,0.0001485058,0.0003133128,0.000008995039,0.0001623176,3.006649e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002525442,"about_ca_system_score_gemma":0.00001297609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003577195,"about_ca_topic_score_gemma":0.000004390536,"domain_scores_codex":[0.9995348,0.00002448804,0.0001476662,0.0001141457,0.00008681449,0.00009210734],"domain_scores_gemma":[0.9989893,0.000741226,0.00006986059,0.00007133886,0.00009331741,0.00003495706],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003038502,0.0001483252,0.000564274,0.0008981975,0.0001761785,0.000004249388,0.05524402,0.05615221,0.0157511,0.5903542,0.0006102561,0.2797931],"study_design_scores_gemma":[0.0004518279,0.0001221396,0.0004027832,0.00006951785,0.00003908122,0.00007120743,0.007567053,0.9444527,0.001353611,0.002206152,0.04308419,0.0001797468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1474967,0.00438309,0.8459201,0.0002341696,0.001573728,0.0002494024,0.00000557338,0.00003950647,0.00009774507],"genre_scores_gemma":[0.9985652,0.0004996467,0.0006106397,0.00005590669,0.0001278322,0.0001316131,0.000001124669,0.000004716534,0.000003304816],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8883005,"threshold_uncertainty_score":0.2278769,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03157281593020538,"gpt":0.3409985557496099,"spread":0.3094257398194045,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001522834,0.0001513954,0.0001691777,0.00004426079,0.0001883763,0.0001482444,0.00005228654,0.00003800945,0.00001414314],"category_scores_gemma":[0.00017081,0.0001322372,0.00001560077,0.0001174963,0.0001289748,0.0003442645,0.00001727789,0.0001821125,0.00001863641],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001039314,"about_ca_system_score_gemma":0.00001129498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000689848,"about_ca_topic_score_gemma":0.000002853917,"domain_scores_codex":[0.99919,0.00007771793,0.0001787746,0.0002514148,0.0001491461,0.0001529372],"domain_scores_gemma":[0.9985831,0.001116559,0.00003873105,0.00009810692,0.00004727582,0.0001162359],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002077167,0.005243133,0.003659182,0.0005353919,0.0002811217,0.001439138,0.2031857,0.2373108,0.0004899938,0.1138028,0.0006888557,0.4312867],"study_design_scores_gemma":[0.0009866067,0.001138749,0.002316355,0.00005918715,0.00003037254,0.00009087812,0.01202046,0.980424,0.0003963607,0.0001905764,0.002066376,0.0002800066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9721123,0.000176055,0.01499769,0.0001022125,0.0001877458,0.0001952685,0.000002269255,0.00008432605,0.01214216],"genre_scores_gemma":[0.998984,0.00002193123,0.0005580832,0.0003536232,0.00002927099,0.0000395695,0.000002626463,0.000006437958,0.000004451156],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7431133,"threshold_uncertainty_score":0.5392478,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.08426280087602969,"gpt":0.3369720426031249,"spread":0.2527092417270952,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002173343,0.0001201295,0.0001782524,0.0001072983,0.0004526152,0.00009753012,0.00009817215,0.00003937347,0.000002874654],"category_scores_gemma":[0.0001313414,0.0001355705,0.00002388572,0.0003387472,0.0002119197,0.0004413592,0.00001900579,0.00008787206,0.000003152276],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009609733,"about_ca_system_score_gemma":0.00004062758,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001756655,"about_ca_topic_score_gemma":0.000004109888,"domain_scores_codex":[0.9990638,0.000008530968,0.0003245907,0.0003901327,0.00003376712,0.0001791903],"domain_scores_gemma":[0.9991479,0.0001227947,0.0003813056,0.000102784,0.0001476902,0.00009751155],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004722527,0.0007003323,0.001677934,0.00006971384,0.00001528545,0.000001529253,0.02063337,0.0006228148,0.00001584851,0.6498613,0.000006513479,0.3263482],"study_design_scores_gemma":[0.0005550489,0.0002399836,0.00763139,0.00001945543,0.00001607517,0.000007949911,0.00372654,0.9736021,0.00001411766,0.0124904,0.001435923,0.0002609853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02106705,0.001459488,0.9767628,0.0001263763,0.00007943209,0.0002817305,0.00004713209,0.00004010963,0.0001358337],"genre_scores_gemma":[0.7727019,0.00009826785,0.2266558,0.0002778177,0.0000236118,0.0002102509,0.00002194133,0.000008255606,0.000002189455],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9729793,"threshold_uncertainty_score":0.5528406,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.09206965903151014,"gpt":0.4668605025260619,"spread":0.3747908434945518,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.005463195,0.0001423084,0.0001539831,0.0004080057,0.00161487,0.002793352,0.0009585418,0.0000326068,0.00003534343],"category_scores_gemma":[0.01211729,0.0001170328,0.00002330445,0.002630847,0.001524015,0.004410258,0.0005599839,0.0001647191,0.00003306815],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001736673,"about_ca_system_score_gemma":0.0005785779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007555615,"about_ca_topic_score_gemma":0.00001067736,"domain_scores_codex":[0.9965456,0.00004764676,0.0004252264,0.001197365,0.001312488,0.0004716741],"domain_scores_gemma":[0.9959647,0.001546229,0.0002803913,0.0005009142,0.001362882,0.0003448607],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006340248,0.0001595013,0.00139536,0.00002102113,0.000005893122,0.000006484926,0.04016858,0.0001417246,0.01799612,0.1471476,0.001469294,0.791425],"study_design_scores_gemma":[0.001743067,0.0005066613,0.02640779,0.00005026412,0.00005425262,0.0003524302,0.1045922,0.4139123,0.004313496,0.03864886,0.4084151,0.001003537],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9516293,0.0001072859,0.03668597,0.002776094,0.002965877,0.0003259897,0.000007735041,0.00004942807,0.005452271],"genre_scores_gemma":[0.9911793,0.00001499706,0.007258098,0.001316349,0.00007811163,0.00002160728,0.000002840318,0.000003723921,0.0001249826],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7904215,"threshold_uncertainty_score":0.9996849,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05038449588205751,"gpt":0.3549345415986086,"spread":0.3045500457165511,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003540112,0.0001223438,0.0001305888,0.00009712816,0.0001450504,0.00006948478,0.0001260762,0.00004695009,6.998974e-7],"category_scores_gemma":[0.000585869,0.0001261647,0.00001317022,0.0002309572,0.00004125633,0.002121595,0.00004746133,0.00009561409,0.000001004469],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002876908,"about_ca_system_score_gemma":0.00008623946,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002824386,"about_ca_topic_score_gemma":0.000001199532,"domain_scores_codex":[0.9990582,0.00004515867,0.000273322,0.000299762,0.0001273968,0.0001961888],"domain_scores_gemma":[0.9990083,0.0006439689,0.00008937359,0.0000896857,0.000112459,0.00005621099],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003575877,0.00004955658,0.0001527865,0.0000500624,0.000005829183,0.000007040576,0.0572997,0.04783799,0.00008401355,0.007860227,0.0000111993,0.8866058],"study_design_scores_gemma":[0.001085021,0.0001607092,0.000844548,0.00005051295,0.000006503316,0.0001257931,0.00293321,0.9778753,0.0007224479,0.007932152,0.007863419,0.0004003988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02462012,0.0003269326,0.9742664,0.000168346,0.0001838904,0.0002440351,0.000001141648,0.0001409025,0.00004828663],"genre_scores_gemma":[0.2775657,0.0002033615,0.7219315,0.0001420897,0.000008380994,0.0001219176,0.00000780072,0.000004322891,0.00001494905],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9300373,"threshold_uncertainty_score":0.5144847,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0727773124512009,"gpt":0.4021615406784179,"spread":0.329384228227217,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001086333,0.00009865696,0.0001585471,0.00002609317,0.0005276753,0.0002618726,0.0005954746,0.00005363374,0.000001413616],"category_scores_gemma":[0.0007450312,0.00008698065,0.00001302504,0.00008554732,0.0001772489,0.004491949,0.0004212633,0.0001010726,0.000003628471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005575141,"about_ca_system_score_gemma":0.00005841641,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002574165,"about_ca_topic_score_gemma":0.00002141467,"domain_scores_codex":[0.9988427,0.0001445584,0.0002727306,0.0004198966,0.0001809972,0.0001390809],"domain_scores_gemma":[0.9982372,0.0003687107,0.0004004334,0.0006913324,0.0002355749,0.00006674694],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0001097722,0.0007215639,0.3776825,0.0004560552,0.00004893812,0.00001504972,0.07383022,0.00005042725,0.0008769063,0.002606638,0.00043285,0.543169],"study_design_scores_gemma":[0.001235013,0.0001484668,0.5933052,0.0001413388,0.00001692322,0.0000702691,0.002387732,0.3977025,0.000498091,0.0002025081,0.003979922,0.0003120767],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5732477,0.0009137781,0.4249278,0.0002346646,0.0004169572,0.000130294,0.00001971817,0.00003093234,0.0000781886],"genre_scores_gemma":[0.9852035,0.0002383734,0.01444599,0.00004826473,0.00002023855,0.000009010452,0.00001994807,0.000002653078,0.0000120171],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.542857,"threshold_uncertainty_score":0.4058505,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.03572369002747112,"gpt":0.3739108459302976,"spread":0.3381871559028265,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000607335,0.000119136,0.0001155412,0.00004451788,0.0001377693,0.00003942028,0.00003659205,0.00002737511,0.000007835218],"category_scores_gemma":[0.000052021,0.0001050948,0.0000186211,0.00004356591,0.0001169999,0.0004965565,0.00001756775,0.00007461364,5.977653e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000252442,"about_ca_system_score_gemma":0.000005700784,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002304856,"about_ca_topic_score_gemma":1.92186e-7,"domain_scores_codex":[0.999427,0.00001598044,0.0001696666,0.0001743446,0.00008642207,0.0001266473],"domain_scores_gemma":[0.9995968,0.0001273575,0.00008576042,0.00008300412,0.00007064355,0.00003647833],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00008457329,0.00003657598,0.0007415505,0.00004921208,0.00002443343,0.00000948377,0.009041307,0.0008910858,0.254272,0.00002963644,0.00007051141,0.7347496],"study_design_scores_gemma":[0.001448056,0.002941968,0.01301712,0.0004483248,0.00008745634,0.0001399677,0.00359803,0.1058118,0.8711202,0.0003847732,0.0003470847,0.0006552841],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6153672,0.0001772592,0.3840503,0.0000073933,0.00004529537,0.0001764862,0.000003888112,0.0000602616,0.0001119375],"genre_scores_gemma":[0.9070632,0.00008910877,0.09277298,0.000007007801,0.00003802071,0.000008550568,0.000003575523,0.00001212902,0.000005351746],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7340943,"threshold_uncertainty_score":0.428564,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.1108328471571171,"gpt":0.3907268302496824,"spread":0.2798939830925653,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001101487,0.00008858331,0.0001328472,0.0001218593,0.0001036627,0.00008578494,0.0001320738,0.00004056886,0.000002970341],"category_scores_gemma":[0.000450109,0.00009202302,0.00001586201,0.0001650531,0.00006553772,0.001336834,0.00006573534,0.0000610702,6.25377e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001648089,"about_ca_system_score_gemma":0.0001100297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008863289,"about_ca_topic_score_gemma":9.502831e-7,"domain_scores_codex":[0.9989738,0.00015591,0.0003061245,0.0002430176,0.0002068854,0.0001142815],"domain_scores_gemma":[0.9988164,0.0004824221,0.0002133589,0.00009825761,0.0003499627,0.00003964023],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001727259,0.00006815419,0.0001439945,0.00002060903,0.00000597683,6.104588e-7,0.01631894,0.00872726,0.00009587476,0.01050971,0.0001458475,0.9639457],"study_design_scores_gemma":[0.0004922363,0.0001058568,0.0003083838,0.00004895085,0.000009902325,0.00001097217,0.001496112,0.993881,0.0005751143,0.001387211,0.001564153,0.0001201011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1179047,0.001327149,0.8777024,0.0009798124,0.0000820605,0.0002745841,0.000001372594,0.00007234263,0.001655579],"genre_scores_gemma":[0.8981996,0.0002376898,0.101249,0.000223054,0.00002101357,0.00004568166,0.000004748405,0.00000293718,0.00001635943],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9851537,"threshold_uncertainty_score":0.375259,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06795627963350627,"gpt":0.3241512469748351,"spread":0.2561949673413288,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002522787,0.0001369031,0.0001285077,0.00003883683,0.0003160569,0.0001824882,0.0005398771,0.00004057509,0.000005417317],"category_scores_gemma":[0.0001156831,0.0001246821,0.00001674711,0.0001836682,0.00008812555,0.0003735037,0.0005773384,0.0000964695,0.000001370286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006075905,"about_ca_system_score_gemma":0.00003021182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003417619,"about_ca_topic_score_gemma":0.00000143648,"domain_scores_codex":[0.9987594,0.00006963337,0.0002242081,0.0005679622,0.0001348488,0.0002438958],"domain_scores_gemma":[0.9990376,0.0002186158,0.0001756144,0.000381919,0.00008591626,0.0001003395],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001013629,0.000170947,0.001869389,0.0001069652,0.000100124,0.00002723956,0.05331601,0.0006190275,0.00007782411,0.04932982,0.006292396,0.8879889],"study_design_scores_gemma":[0.0008744063,0.0002730628,0.002486086,0.00006912596,0.00005309243,0.0001266227,0.003523628,0.9417617,0.00008687831,0.006416909,0.0439003,0.0004281423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1591656,0.001169123,0.8366468,0.0007300472,0.0008709571,0.0003325905,0.000007940253,0.0001279059,0.0009490416],"genre_scores_gemma":[0.925172,0.00004695792,0.07391659,0.0007137016,0.00008581445,0.000012797,0.0000170131,0.000005323127,0.00002982839],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9411427,"threshold_uncertainty_score":0.5084388,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1213554215094617,"gpt":0.3300997105598498,"spread":0.2087442890503881,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003302166,0.0001373065,0.000225,0.00008986721,0.0002499343,0.00007939761,0.00008560994,0.00005108991,0.000004982602],"category_scores_gemma":[0.0003085276,0.0001351082,0.00001872633,0.0003501534,0.0002629041,0.001269689,0.00005377242,0.0001245559,0.000001659648],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009644894,"about_ca_system_score_gemma":0.00003798016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003760697,"about_ca_topic_score_gemma":0.000002823539,"domain_scores_codex":[0.9990624,0.00001159979,0.0004037487,0.0002814424,0.00003858496,0.0002022868],"domain_scores_gemma":[0.9989423,0.0001801321,0.0005231703,0.0000994252,0.0001696146,0.00008540141],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006523757,0.0001940466,0.02818061,0.0003480239,0.00001539712,6.179144e-7,0.02717877,0.00005518581,0.00002899433,0.9193301,0.000002208179,0.02460084],"study_design_scores_gemma":[0.001650772,0.0004625117,0.1122795,0.0003954434,0.00006903935,0.00009268279,0.008658651,0.4905361,0.0002009911,0.3832146,0.001457281,0.0009823493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3857445,0.005255414,0.6081065,0.00005102055,0.00003124793,0.0001321869,0.0000132966,0.00001317148,0.0006526682],"genre_scores_gemma":[0.994055,0.0002997635,0.005438194,0.00008530828,0.00002727489,0.0000710124,0.000007894299,0.000008344671,0.000007240926],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6083105,"threshold_uncertainty_score":0.5509552,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02133997700991505,"gpt":0.3119779216447664,"spread":0.2906379446348514,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000188429,0.0001696402,0.0001613459,0.00009241277,0.0001622238,0.0001589576,0.0003085874,0.00007728424,0.000002783587],"category_scores_gemma":[0.0000390868,0.0001509986,0.00002074542,0.0003140566,0.00003770978,0.0008054535,0.0001419956,0.0001354538,0.000004909539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001324579,"about_ca_system_score_gemma":0.00001526228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002621509,"about_ca_topic_score_gemma":0.000004348916,"domain_scores_codex":[0.9987055,0.00007634801,0.0002730645,0.0005362508,0.0001570204,0.0002517813],"domain_scores_gemma":[0.9990262,0.0004846171,0.000141611,0.0001885698,0.00005847902,0.0001005285],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008443371,0.0002052481,0.0001734385,0.00004916345,0.00001348211,0.00002136244,0.03287787,0.0002164325,0.0001847261,0.0522797,0.000007612178,0.9138865],"study_design_scores_gemma":[0.006007895,0.002517624,0.06928103,0.0005127867,0.0001021694,0.0001988178,0.0264114,0.609648,0.0009169161,0.2007967,0.08161698,0.001989721],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1559706,0.0009817814,0.8349175,0.006552718,0.0002091693,0.0005533862,0.000002223676,0.00008756343,0.000724976],"genre_scores_gemma":[0.7769501,0.0007314185,0.2142807,0.007898322,0.0000343523,0.00009328217,0.000006784304,0.000003229675,0.000001847868],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9118968,"threshold_uncertainty_score":0.6157545,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02517790342176533,"gpt":0.2955406178304535,"spread":0.2703627144086881,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004089778,0.0001440035,0.0001696811,0.0000452587,0.0007254697,0.0002486467,0.0002075962,0.00006164434,0.000001950133],"category_scores_gemma":[0.0003132043,0.0001349346,0.00002335971,0.0001903037,0.0001019127,0.001929116,0.0001651854,0.00009520556,0.000008421293],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001215611,"about_ca_system_score_gemma":0.0000410256,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000210127,"about_ca_topic_score_gemma":0.000001300018,"domain_scores_codex":[0.998776,0.00007323791,0.000273365,0.0004172954,0.0001777841,0.0002823882],"domain_scores_gemma":[0.9988157,0.0005002021,0.0001746959,0.0001807602,0.0002199481,0.0001086869],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003334124,0.00008783022,0.0002916929,0.00008765778,0.00001125005,0.000001488225,0.006318867,0.0005659214,0.0001560683,0.150132,0.001058147,0.8412558],"study_design_scores_gemma":[0.002140038,0.0008507814,0.003403402,0.0001951684,0.00003267074,0.0001850229,0.001554301,0.831328,0.0004336065,0.008248956,0.1508867,0.0007413545],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09106638,0.0007210114,0.9064361,0.0006487423,0.0006420357,0.0001981979,0.000008316441,0.0001047524,0.0001744152],"genre_scores_gemma":[0.9680474,0.0002012577,0.03104943,0.0004651705,0.00008975574,0.00008873695,0.00001881105,0.000005139251,0.00003433129],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.876981,"threshold_uncertainty_score":0.5579799,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01676471276957835,"gpt":0.3066367132513235,"spread":0.2898720004817451,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004494498,0.00012858,0.0001251949,0.00003754943,0.0005128939,0.0002362165,0.000519581,0.00006278381,0.000002056007],"category_scores_gemma":[0.00129908,0.00008509921,0.00002837299,0.0004212097,0.0002560011,0.000972571,0.000313575,0.0001727758,0.000001047782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008352511,"about_ca_system_score_gemma":0.00003929048,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006370658,"about_ca_topic_score_gemma":7.766278e-7,"domain_scores_codex":[0.9986425,0.0003038137,0.0003041697,0.0003405517,0.0002576303,0.0001513575],"domain_scores_gemma":[0.998131,0.0008633053,0.0003829514,0.0003656499,0.0002079663,0.00004913264],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002060397,0.00006712689,0.001480259,0.00004927549,0.00001342086,9.841486e-7,0.08811238,0.00440037,0.0006922956,0.3095382,0.0002334368,0.5953917],"study_design_scores_gemma":[0.0001822928,0.00009559966,0.001438866,0.00009896745,0.00001106588,0.00003893311,0.002040161,0.9812188,0.00236832,0.006688423,0.005610121,0.0002084766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04683725,0.0004341497,0.9508728,0.0009150346,0.0003384081,0.000152251,3.341737e-7,0.00008707555,0.0003626985],"genre_scores_gemma":[0.9323193,0.0001564874,0.06639373,0.001056451,0.00003472679,0.00001001681,6.250586e-7,0.000004691268,0.00002400828],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9768184,"threshold_uncertainty_score":0.3944817,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02457581514154901,"gpt":0.3042657391978977,"spread":0.2796899240563487,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002657076,0.0001176785,0.0001625814,0.00006778011,0.0001888806,0.0001787883,0.0002394486,0.00002614693,3.628265e-7],"category_scores_gemma":[0.0000238882,0.0001091251,0.00001222525,0.0002930926,0.00005188699,0.0009324318,0.0001560706,0.00007532683,0.000003527221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001207966,"about_ca_system_score_gemma":0.00002472581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008324063,"about_ca_topic_score_gemma":5.83683e-7,"domain_scores_codex":[0.9988751,0.00008540553,0.0003167157,0.0003327837,0.0002433046,0.0001466695],"domain_scores_gemma":[0.9993169,0.000102293,0.0002077095,0.0001851396,0.0001216059,0.00006633616],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001268269,0.002289463,0.02373923,0.001138878,0.0002656888,0.0001710554,0.3236467,0.09922885,0.0001206428,0.2348103,0.000184707,0.3142776],"study_design_scores_gemma":[0.01162657,0.005976787,0.09205858,0.001274035,0.0001737965,0.001203662,0.160447,0.7119689,0.000126897,0.001595571,0.01173679,0.001811375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7577743,0.0006679915,0.2392568,0.00006189242,0.0003687987,0.0002637356,5.814487e-7,0.00005053566,0.001555413],"genre_scores_gemma":[0.9978617,0.0001421878,0.001886767,0.00003830628,0.00001836663,0.00003169574,0.000001161078,0.000002854227,0.00001689086],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.61274,"threshold_uncertainty_score":0.4449994,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04357597152681141,"gpt":0.3258146555717321,"spread":0.2822386840449206,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002656276,0.0001349361,0.0001246462,0.0000373711,0.001295468,0.001301803,0.0004062342,0.00003053222,0.000002001277],"category_scores_gemma":[0.0001978895,0.0001090896,0.00001407316,0.00007536665,0.0001787968,0.0005737704,0.0003976478,0.0001364699,0.000004690331],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007539358,"about_ca_system_score_gemma":0.00002715708,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005583904,"about_ca_topic_score_gemma":0.000001946703,"domain_scores_codex":[0.9989554,0.00006081109,0.0001612101,0.0004273501,0.000202684,0.0001925482],"domain_scores_gemma":[0.9989767,0.000208878,0.0002742123,0.000347746,0.00009596817,0.00009651513],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001903322,0.0000794046,0.003722389,0.00003969743,0.00003075009,0.00005823736,0.02355285,0.001004157,0.00005697487,0.04671197,0.0001934932,0.924531],"study_design_scores_gemma":[0.001617951,0.000491862,0.02375255,0.000227475,0.00004393739,0.0004095037,0.008259206,0.9325023,0.000318535,0.002123319,0.02945674,0.0007965934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6767718,0.0006466564,0.3071714,0.00356135,0.0002760446,0.0001516328,2.964507e-7,0.0001091484,0.01131163],"genre_scores_gemma":[0.9804976,0.00004832412,0.01885537,0.000434569,0.00006027835,0.00001354785,4.871625e-7,0.00000436654,0.00008548913],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9314982,"threshold_uncertainty_score":0.9997349,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03195901466201988,"gpt":0.3455792680153101,"spread":0.3136202533532902,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003903795,0.000146826,0.0001724397,0.00004171562,0.001249785,0.0007630503,0.0004036469,0.00006520033,0.000004326076],"category_scores_gemma":[0.0008563952,0.0001283221,0.0000324802,0.00007675504,0.0001909311,0.003752444,0.0002564635,0.0001457694,0.00001235689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001656663,"about_ca_system_score_gemma":0.00006801479,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006163032,"about_ca_topic_score_gemma":0.000002251956,"domain_scores_codex":[0.9987438,0.00008091849,0.0002788914,0.0004667841,0.0002263629,0.000203253],"domain_scores_gemma":[0.9986092,0.0003022223,0.000329716,0.0004484535,0.0001874801,0.0001228947],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00001824081,0.00007634925,0.01254296,0.00009383819,0.00001578557,0.00002141276,0.01454189,0.00003981912,0.00005789507,0.00286998,0.0001553296,0.9695665],"study_design_scores_gemma":[0.004741979,0.001080301,0.6863036,0.001089334,0.0001249177,0.001997548,0.01191608,0.2130568,0.00187101,0.00886381,0.06637347,0.002581123],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2756946,0.00138665,0.7196345,0.00134266,0.0009625464,0.0001853278,0.000001656154,0.0001505852,0.0006414738],"genre_scores_gemma":[0.9858147,0.0002569436,0.01354517,0.0002491879,0.0000519885,0.00003299245,0.000001790517,0.000004288677,0.00004293291],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9669854,"threshold_uncertainty_score":0.9612464,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02120402006543549,"gpt":0.3266081219924435,"spread":0.3054041019270081,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002946688,0.0001522782,0.0001514007,0.0000338821,0.0004733888,0.0003415232,0.0002448236,0.0001026513,0.000003514929],"category_scores_gemma":[0.000405609,0.0001541201,0.00002839314,0.0002647274,0.0003188197,0.001404595,0.0001620859,0.0001839201,0.000003511662],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001641147,"about_ca_system_score_gemma":0.00004302916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001017921,"about_ca_topic_score_gemma":0.000001455637,"domain_scores_codex":[0.9986545,0.0001065609,0.0002637279,0.0005021006,0.000177668,0.0002953705],"domain_scores_gemma":[0.9983408,0.0008404321,0.0001649473,0.0001943865,0.0003204365,0.0001389536],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002426437,0.0002142143,0.0006461981,0.00005527244,0.00004343228,0.00001039456,0.03520424,0.0004647234,0.0001621319,0.3700151,0.003452918,0.5894888],"study_design_scores_gemma":[0.0005181701,0.0003475783,0.0007278338,0.00003706194,0.0000106075,0.000091987,0.0004723465,0.9686098,0.0001232666,0.003375106,0.02545307,0.0002331362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09110378,0.001035882,0.9055137,0.00114662,0.0006151995,0.0002582425,0.000003860997,0.000104057,0.0002186783],"genre_scores_gemma":[0.9656753,0.0002368632,0.03296674,0.0007206245,0.0002941763,0.00006589331,0.00002353359,0.000005810667,0.00001106878],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9681451,"threshold_uncertainty_score":0.6284837,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03383703133070081,"gpt":0.3251101534292374,"spread":0.2912731220985366,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003808795,0.0001618849,0.0001743548,0.00004155966,0.000256801,0.0003631282,0.0002506312,0.00006881991,0.00000344156],"category_scores_gemma":[0.0002059727,0.0001506479,0.00002089583,0.0002921205,0.0001139363,0.002425594,0.0002289373,0.0001441651,0.00003076329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002131275,"about_ca_system_score_gemma":0.00009779773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005458647,"about_ca_topic_score_gemma":8.968929e-7,"domain_scores_codex":[0.9985445,0.0001355716,0.0002939845,0.0004666763,0.0003290176,0.0002302159],"domain_scores_gemma":[0.998915,0.0001945672,0.0001828335,0.0001918483,0.0002606593,0.0002550755],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002032361,0.00009763657,0.0001798825,0.00001795389,0.00001088231,0.00005334296,0.02856099,0.00008906497,0.0001081335,0.01830927,0.002225858,0.9503267],"study_design_scores_gemma":[0.001598381,0.0004159447,0.001039368,0.00009606381,0.00001781045,0.0007689098,0.01285111,0.8097576,0.0002438145,0.003301573,0.1692992,0.0006102069],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03085333,0.003229285,0.9614539,0.001158081,0.0008327618,0.0001529063,0.000005099396,0.00009766842,0.002217021],"genre_scores_gemma":[0.9630232,0.0002228956,0.03584772,0.0006434556,0.00009758475,0.0000305018,0.00001144158,0.000005635357,0.0001175605],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9497164,"threshold_uncertainty_score":0.6143243,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.00849781266219176,"gpt":0.264465261212887,"spread":0.2559674485506953,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006971754,0.0001143984,0.00009649884,0.0000554154,0.000137002,0.00007134688,0.00006975726,0.00006478822,0.0000484011],"category_scores_gemma":[0.00009850325,0.0001140708,0.000009493366,0.0001638937,0.00009585197,0.0007518645,0.00003526592,0.0001337236,0.00006549028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001596173,"about_ca_system_score_gemma":0.000008556171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005452533,"about_ca_topic_score_gemma":2.049353e-7,"domain_scores_codex":[0.9993178,0.00002106866,0.0001859627,0.0002109329,0.0001047531,0.0001594769],"domain_scores_gemma":[0.9995768,0.00009329033,0.00006218127,0.0001122999,0.00009550169,0.00005992044],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006504168,0.0006996067,0.007043958,0.0008382578,0.0002738127,0.00003355396,0.0970872,0.01396755,0.08226681,0.1154924,0.008829451,0.6734024],"study_design_scores_gemma":[0.0009710382,0.0001351008,0.00438711,0.0001291136,0.00004325327,0.0001018742,0.007724219,0.9253235,0.009627267,0.00396648,0.04694,0.0006510573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.926435,0.003424725,0.06707824,0.0005071073,0.000350318,0.0002737752,0.000001370021,0.0002703882,0.001659103],"genre_scores_gemma":[0.992932,0.0005125871,0.006286298,0.00009523178,0.00001877891,0.0001031721,0.000006779166,0.000008775595,0.00003637066],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9113559,"threshold_uncertainty_score":0.465167,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0492769611559476,"gpt":0.3191701278006935,"spread":0.2698931666447459,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002401661,0.0001172085,0.0001123536,0.0000663833,0.0003327436,0.0002684848,0.0001820986,0.00004199261,0.000001831526],"category_scores_gemma":[0.00009612427,0.0001181959,0.00001070171,0.0003184206,0.00006108206,0.001149676,0.0001750737,0.0001012304,0.0000114974],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007025276,"about_ca_system_score_gemma":0.00002293663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004056947,"about_ca_topic_score_gemma":0.000002104041,"domain_scores_codex":[0.999006,0.0000729823,0.0002060588,0.0004355313,0.0001183436,0.0001610883],"domain_scores_gemma":[0.9992673,0.0001836381,0.0001092537,0.0001753884,0.0001099831,0.0001543803],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001817575,0.00005977926,0.000561194,0.00003428746,0.0000122958,0.000004997307,0.02095203,0.0001952784,0.0002533903,0.02318379,0.00002601553,0.9546987],"study_design_scores_gemma":[0.001799318,0.001017836,0.01726672,0.0003487008,0.00008379383,0.001125549,0.01258468,0.8002613,0.001452289,0.01593663,0.1462629,0.001860288],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0473085,0.000920655,0.9501984,0.0001525759,0.0002128663,0.000213628,0.000001905786,0.00009599083,0.0008955227],"genre_scores_gemma":[0.9521849,0.0001013827,0.04729684,0.0002840304,0.00005224023,0.00006449765,0.000003055558,0.000003626019,0.000009424662],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9528385,"threshold_uncertainty_score":0.4819887,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.2735174660854603,"gpt":0.5206736811834997,"spread":0.2471562150980393,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001617905,0.00006677005,0.00008864209,0.00004941888,0.0001765598,0.0001525413,0.0002191323,0.00002635445,0.00001730588],"category_scores_gemma":[0.0003579532,0.00005676861,0.000008985262,0.0003363907,0.0001290677,0.002476923,0.0001321358,0.00004669776,0.000005052028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001383856,"about_ca_system_score_gemma":0.00006172618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001565488,"about_ca_topic_score_gemma":0.000001012098,"domain_scores_codex":[0.9985096,0.00007974438,0.000349396,0.0003242441,0.0006646304,0.00007240097],"domain_scores_gemma":[0.9986451,0.0002806875,0.0002462234,0.0002870006,0.0005048352,0.00003614994],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001420739,0.0000578553,0.0004753081,0.000008280703,0.000005737167,2.586888e-7,0.002156607,0.003634318,0.00004686306,0.05143878,0.00008767958,0.9420741],"study_design_scores_gemma":[0.002074119,0.0002505033,0.07781751,0.0001123452,0.0001698661,0.0000423387,0.05888858,0.7053471,0.000920482,0.1269956,0.02695896,0.0004226061],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7013201,0.0004004894,0.2945996,0.000426123,0.00005582063,0.0002511749,0.00001840928,0.00002212694,0.002906223],"genre_scores_gemma":[0.9953486,0.0003331654,0.004160981,0.0000419745,0.00001159833,0.0000302164,0.00006475481,0.000001769691,0.000006901639],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9416515,"threshold_uncertainty_score":0.2314957,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01405338030473247,"gpt":0.3123003796799643,"spread":0.2982469993752318,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001473954,0.0001059115,0.0001009082,0.00006747452,0.0002563171,0.0001033226,0.000025837,0.00005020841,0.000003441689],"category_scores_gemma":[0.0001921444,0.0001135342,0.000009597181,0.0001908103,0.0000903597,0.001301542,0.00004840843,0.0000694133,0.000001446036],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008551999,"about_ca_system_score_gemma":0.000005510319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004073861,"about_ca_topic_score_gemma":0.000001156257,"domain_scores_codex":[0.9993773,0.00002634369,0.0001735314,0.0002116301,0.00008099183,0.0001302501],"domain_scores_gemma":[0.9994074,0.0003021804,0.00007129923,0.0000543389,0.0001109355,0.00005388851],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003643956,0.00001687974,0.0006927393,0.0002567591,0.00001030167,0.000004396618,0.007264114,0.0006364223,0.008677393,0.000637345,0.002068932,0.9796983],"study_design_scores_gemma":[0.0009085475,0.0001624608,0.01065406,0.0001940729,0.00002978103,0.00004545488,0.005936692,0.9648803,0.002659541,0.005296788,0.008867987,0.0003642726],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4067751,0.001539329,0.5903866,0.0001847502,0.0001905057,0.0003890464,0.00001055491,0.0003472788,0.0001767705],"genre_scores_gemma":[0.9670672,0.004614389,0.02790186,0.00006404814,0.00005379768,0.0001374499,0.00007417701,0.00001506405,0.00007200448],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.979334,"threshold_uncertainty_score":0.462979,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01467084904216735,"gpt":0.2913119196751143,"spread":0.2766410706329469,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005208162,0.0001940342,0.0002781611,0.00008394066,0.000343179,0.0004378177,0.0002278544,0.00008323407,7.346219e-7],"category_scores_gemma":[0.000323434,0.0001881513,0.00002463611,0.0003908376,0.000150139,0.001153867,0.000161244,0.0002329196,0.000002179078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001582682,"about_ca_system_score_gemma":0.00004633683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001380833,"about_ca_topic_score_gemma":0.00001593615,"domain_scores_codex":[0.9983476,0.0002358177,0.000394278,0.0005464299,0.0001943646,0.0002815298],"domain_scores_gemma":[0.9986007,0.0007124121,0.0002000356,0.0001903695,0.0001449962,0.0001514812],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001758937,0.00103615,0.03938847,0.0003517101,0.00008161255,0.0001147591,0.06663756,0.01436242,0.0005268551,0.1900402,0.0004371008,0.6868473],"study_design_scores_gemma":[0.001430192,0.0001396733,0.01489789,0.0001726996,0.00001640947,0.0001434624,0.001966083,0.9684594,0.00001407024,0.003621412,0.008765621,0.0003731118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2517212,0.0009891373,0.7460097,0.0006321612,0.0002837898,0.0001552774,0.0000133936,0.0000592705,0.0001360392],"genre_scores_gemma":[0.9932453,0.0002000684,0.006154437,0.0002705674,0.00005398784,0.00002303182,0.00004277083,0.000004571477,0.000005278815],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.954097,"threshold_uncertainty_score":0.7672586,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01649001071601078,"gpt":0.3060330158584909,"spread":0.2895430051424801,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001386429,0.0001045023,0.000117802,0.00003379646,0.0002509743,0.00008263953,0.0000482488,0.00005057795,0.000002056141],"category_scores_gemma":[0.00008928964,0.0001145801,0.000008757698,0.00007445113,0.0001178018,0.0009519846,0.00002984868,0.00006220633,7.994545e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001950869,"about_ca_system_score_gemma":0.00001286234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000154112,"about_ca_topic_score_gemma":0.000004598486,"domain_scores_codex":[0.9994118,0.0000359555,0.0001985401,0.0001730575,0.00006384419,0.0001167611],"domain_scores_gemma":[0.999169,0.0004834279,0.00008148156,0.00007961985,0.0001291747,0.00005729058],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003624652,0.00002588291,0.0001457523,0.0001319249,0.00003249515,7.090546e-7,0.07778286,0.111406,0.001139683,0.0006342575,0.00008862004,0.8085756],"study_design_scores_gemma":[0.0006389416,0.000144162,0.0001742076,0.00009285595,0.00003095413,0.00002431109,0.01041963,0.9819675,0.0005202651,0.0001615359,0.005569026,0.0002566156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3632356,0.00294139,0.6333653,0.00002277208,0.0001017101,0.0001455017,0.000003890777,0.00007817207,0.0001056764],"genre_scores_gemma":[0.9482226,0.0006945368,0.05085257,0.00002612003,0.00007242239,0.00009244982,0.00002069692,0.00001169223,0.000006897111],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8705615,"threshold_uncertainty_score":0.4672439,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04667202060315748,"gpt":0.3341563895524129,"spread":0.2874843689492554,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002609999,0.0000890241,0.0001136369,0.00007541847,0.0002647847,0.00008566549,0.0001678153,0.00004272749,0.000001351854],"category_scores_gemma":[0.0002160997,0.0000904993,0.00001883352,0.0002036835,0.0001031946,0.0005257044,0.00009118761,0.00006327682,2.925632e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001113419,"about_ca_system_score_gemma":0.00001277335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001118351,"about_ca_topic_score_gemma":1.419498e-7,"domain_scores_codex":[0.9991782,0.00008690997,0.0002649768,0.000239235,0.0001249452,0.0001057067],"domain_scores_gemma":[0.9989212,0.0003873881,0.0002636691,0.0001493796,0.0002332941,0.00004510821],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008939429,0.0006880962,0.0008917374,0.0003524569,0.00005954424,0.000002271114,0.1411818,0.3569777,0.00135329,0.03702563,0.0006003337,0.4607777],"study_design_scores_gemma":[0.0003354551,0.00007825545,0.00007804922,0.00005067837,0.000009849524,0.0000178162,0.0008098665,0.9974717,0.0004117265,0.0002740558,0.0003697641,0.0000927849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07896263,0.001700107,0.9184812,0.0002370114,0.00008401064,0.0001946271,0.000002235405,0.00008661901,0.0002516134],"genre_scores_gemma":[0.8191488,0.0002875715,0.1804346,0.00009076713,0.000007224584,0.00001889154,0.00000239571,0.000003069606,0.000006704934],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7401862,"threshold_uncertainty_score":0.3690454,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01672593922934771,"gpt":0.3213727862077966,"spread":0.3046468469784489,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002330482,0.00009727955,0.0001426403,0.00008630849,0.0001074209,0.00009587833,0.0001521626,0.00004622137,0.000001600432],"category_scores_gemma":[0.0001191187,0.00009952564,0.0000166762,0.0002632189,0.00006050226,0.001942169,0.0001022102,0.00007974463,0.00000272313],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002401131,"about_ca_system_score_gemma":0.0000344215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001441934,"about_ca_topic_score_gemma":2.169222e-7,"domain_scores_codex":[0.998969,0.00007969475,0.0003363169,0.0003356724,0.0001723499,0.0001069654],"domain_scores_gemma":[0.998939,0.0001869796,0.0003794174,0.000201085,0.0002460315,0.0000474988],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001474502,0.0002079848,0.002308913,0.001073333,0.00005271147,0.00003605787,0.02895459,0.00200997,0.2181085,0.2051733,0.00006382073,0.5418633],"study_design_scores_gemma":[0.0009544138,0.0004744473,0.001768158,0.0003167364,0.00003457467,0.001053122,0.01047702,0.8815367,0.09820611,0.002173473,0.002376266,0.0006289909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.275643,0.0004081517,0.7232617,0.00006501452,0.0002220365,0.0001558884,0.000001553923,0.0001067797,0.0001358711],"genre_scores_gemma":[0.9761035,0.00005997411,0.02372816,0.00006083891,0.00001030749,0.00001388984,0.000001993636,0.000004139203,0.0000171888],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8795267,"threshold_uncertainty_score":0.4058538,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04034314571500323,"gpt":0.2803974470610432,"spread":0.24005430134604,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002030811,0.000100879,0.0001233606,0.00006954652,0.0001645371,0.0001008121,0.00005502736,0.00003031969,0.00001700419],"category_scores_gemma":[0.0001717848,0.00008854198,0.000009962399,0.0002117379,0.00004583134,0.0007145265,0.00001185822,0.0001098555,0.0000127886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001491916,"about_ca_system_score_gemma":0.00001673708,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001635365,"about_ca_topic_score_gemma":0.0000525618,"domain_scores_codex":[0.9992421,0.000039862,0.0002387362,0.0001611728,0.0001310848,0.0001870427],"domain_scores_gemma":[0.9995053,0.0002377639,0.0000803822,0.00005380384,0.00003967652,0.00008301296],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00001149166,0.00001615062,0.03826911,0.00001030981,0.000002263643,0.000003363405,0.02363761,0.0008247303,4.954777e-7,0.00006619218,0.00002127917,0.937137],"study_design_scores_gemma":[0.0004994343,0.0003932434,0.7740648,0.00005687364,0.00000979755,0.0001203723,0.02182062,0.1984797,0.000006737538,0.0003260355,0.003934319,0.0002881046],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9673294,0.001104722,0.01447579,0.0002718403,0.00009039378,0.0001518406,0.00000336308,0.00002287454,0.01654975],"genre_scores_gemma":[0.9940873,0.0001999681,0.004421366,0.001245609,0.00002471401,0.000002427386,0.00001001224,9.328195e-7,0.000007653803],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9368489,"threshold_uncertainty_score":0.3610637,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.1283474163911486,"gpt":0.4572647850993778,"spread":0.3289173687082292,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004315886,0.0000774358,0.0001255378,0.0000520818,0.001227665,0.00001386834,0.00002589277,0.00004045879,0.000005819085],"category_scores_gemma":[0.0006337882,0.00008010177,0.000009191101,0.00007753096,0.00008196225,0.0002473283,0.00008308735,0.0002837197,1.392089e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002341269,"about_ca_system_score_gemma":0.00008198444,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001903968,"about_ca_topic_score_gemma":0.000003623593,"domain_scores_codex":[0.9988849,0.0002597031,0.00033394,0.0002176709,0.000150318,0.0001534902],"domain_scores_gemma":[0.9980745,0.001330242,0.0002714141,0.00004120856,0.000211677,0.00007101599],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001312588,0.0000465753,0.7523323,0.0003744214,0.000008285699,4.070352e-7,0.1325051,0.003864582,0.0006591164,0.0007062125,0.00001070184,0.109361],"study_design_scores_gemma":[0.0002302756,0.0005409864,0.0060119,0.00008307172,0.00001679275,0.000001047997,0.04490235,0.9464245,0.0001796651,0.0005591099,0.000967887,0.00008244779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9857171,0.003091867,0.01005414,0.0003315136,0.0002712465,0.0004406644,0.00002739584,0.00002425746,0.00004184201],"genre_scores_gemma":[0.9981899,0.000228456,0.001154595,0.00008530837,0.00002848444,0.0002908625,0.000006065876,0.000006692775,0.000009589694],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9425599,"threshold_uncertainty_score":0.9442331,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01815302016986699,"gpt":0.2989604839171414,"spread":0.2808074637472744,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003513156,0.0001413062,0.0001432666,0.00006676937,0.0004118104,0.0002072941,0.0001886011,0.00004691695,0.000005704808],"category_scores_gemma":[0.0001953036,0.0001100401,0.00003639859,0.0002217887,0.0001708643,0.002115363,0.00008219432,0.00006954812,0.000005210788],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008462003,"about_ca_system_score_gemma":0.00003303474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003950746,"about_ca_topic_score_gemma":2.948906e-7,"domain_scores_codex":[0.9988412,0.0001096912,0.0002228857,0.0004452566,0.0001436196,0.0002373612],"domain_scores_gemma":[0.9985856,0.0008176459,0.0001641921,0.0001519951,0.0001611825,0.0001193271],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001456479,0.00004625349,0.00006810619,0.00001133099,0.00001255234,0.000006538826,0.005281419,0.000009434844,0.0003931798,0.09385214,0.000136582,0.9001679],"study_design_scores_gemma":[0.008097011,0.001941192,0.002824674,0.0005745711,0.0001037399,0.0006796455,0.009652026,0.5106973,0.005666957,0.3873683,0.07016824,0.002226332],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02403553,0.0008261797,0.9730537,0.0009665284,0.0006727459,0.0001817277,0.000008854569,0.00009695725,0.0001577901],"genre_scores_gemma":[0.9259688,0.0003225331,0.072851,0.000577307,0.000103808,0.0001149101,0.000003705189,0.000006215005,0.0000517382],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9019333,"threshold_uncertainty_score":0.4487305,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02190333245019963,"gpt":0.3213689313519091,"spread":0.2994655989017095,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001384085,0.0001169808,0.0001032436,0.00004781148,0.0002708796,0.0002644617,0.0002074087,0.00003503823,0.00001128796],"category_scores_gemma":[0.00005451483,0.000114736,0.00001916848,0.0002074075,0.0001063757,0.001771918,0.0001402071,0.0001069366,0.00003522262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001123763,"about_ca_system_score_gemma":0.00003905965,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008339023,"about_ca_topic_score_gemma":6.407476e-7,"domain_scores_codex":[0.9990451,0.00005110685,0.0002107934,0.0003726707,0.0001557062,0.0001646161],"domain_scores_gemma":[0.9993109,0.0001957793,0.0001133759,0.0001721537,0.00008701895,0.0001207914],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000001308098,0.00007142915,0.0001440043,0.000007979372,0.000005695151,0.000002677357,0.01021487,0.0000215033,0.0003515972,0.184419,0.0009860342,0.8037739],"study_design_scores_gemma":[0.0006713527,0.0001171994,0.002028617,0.00002523182,0.00002048903,0.0002416267,0.001813366,0.327515,0.001474403,0.0008603944,0.6647886,0.0004437237],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06279533,0.005443377,0.9229658,0.004096843,0.0002685111,0.0001635561,0.00000250267,0.0001821674,0.004081877],"genre_scores_gemma":[0.9901923,0.0003732339,0.008521632,0.0007186086,0.00007221404,0.00003988797,0.00000592975,0.000003673057,0.0000725306],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.927397,"threshold_uncertainty_score":0.46788,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04360194105333639,"gpt":0.3155570917525859,"spread":0.2719551506992495,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002682316,0.0001951688,0.0001976512,0.0000761093,0.0004789519,0.0003207438,0.0003111663,0.00006961081,0.000005803516],"category_scores_gemma":[0.0001668338,0.00017996,0.0000292404,0.0004178636,0.0001948252,0.001885925,0.0001062466,0.0001766138,0.000007975615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001206877,"about_ca_system_score_gemma":0.0001861198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001245383,"about_ca_topic_score_gemma":0.000005118071,"domain_scores_codex":[0.9984565,0.0002070118,0.0003065172,0.0005072215,0.0002668408,0.0002558434],"domain_scores_gemma":[0.9988854,0.000249934,0.0001881444,0.0002188224,0.0002575713,0.0002001146],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001224827,0.0004737388,0.003531915,0.00006622559,0.00003627836,0.0002302551,0.0492998,0.004232673,0.000125138,0.02262909,0.00124452,0.9180079],"study_design_scores_gemma":[0.0009862069,0.0005223197,0.003348299,0.00008850571,0.00001142215,0.0007584451,0.002103485,0.9525409,0.0001250268,0.0006887027,0.03833594,0.0004907909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1510767,0.0004851971,0.8462794,0.0004236368,0.0004499084,0.0001313905,0.000007237305,0.0001685054,0.0009779986],"genre_scores_gemma":[0.9691675,0.00006662863,0.03014657,0.0004726253,0.00005531533,0.00001990957,0.00003953641,0.000006037174,0.00002585026],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9483082,"threshold_uncertainty_score":0.7338558,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0235307633497342,"gpt":0.3056207684327931,"spread":0.2820900050830589,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001583312,0.0001200174,0.0001336533,0.00005550772,0.00009370542,0.00006835191,0.00006644622,0.0000560251,0.000003292886],"category_scores_gemma":[0.00006189931,0.0001264371,0.00001290639,0.000143957,0.00006977455,0.0006933848,0.00003010751,0.0000926844,0.000006508026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003192266,"about_ca_system_score_gemma":0.00001115315,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000167767,"about_ca_topic_score_gemma":0.00001270711,"domain_scores_codex":[0.9992692,0.00003527776,0.0001920611,0.000216342,0.000080641,0.0002064102],"domain_scores_gemma":[0.9995468,0.0001822454,0.00005379121,0.00008735996,0.00006384436,0.0000659374],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002804299,0.0001709262,0.002193701,0.001731153,0.0001028645,0.00008560828,0.1533335,0.02973091,0.001387519,0.00866696,0.001009568,0.8013068],"study_design_scores_gemma":[0.0005161593,0.0001115124,0.001118982,0.000113852,0.00001314906,0.00009444313,0.002646177,0.9844919,0.00006741465,0.00008599817,0.01056013,0.0001802469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8942925,0.004196977,0.09925228,0.0001651222,0.0007681846,0.0005663839,0.000006457195,0.0001713935,0.0005806584],"genre_scores_gemma":[0.9974687,0.0002904981,0.001841884,0.0000912759,0.0001121286,0.0001666647,0.00001131674,0.00001220115,0.000005343922],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.954761,"threshold_uncertainty_score":0.5155953,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02037084922007039,"gpt":0.3145459142218544,"spread":0.294175065001784,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003401796,0.0001441778,0.0001600653,0.00006649718,0.0002903751,0.0003755749,0.000199505,0.00005789311,0.000004058764],"category_scores_gemma":[0.000246386,0.0001363329,0.00002101021,0.0002612424,0.00009817642,0.00311761,0.0001539581,0.0001158124,0.00005596634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000021445,"about_ca_system_score_gemma":0.00008135674,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001232383,"about_ca_topic_score_gemma":6.036123e-7,"domain_scores_codex":[0.9986744,0.0001031218,0.0002793756,0.0005005664,0.0002385814,0.0002039839],"domain_scores_gemma":[0.9989842,0.0002936875,0.0001913422,0.0002237174,0.0001713413,0.0001357121],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007023561,0.0003442593,0.0003949078,0.0001278685,0.00004823398,0.0002401609,0.110921,0.004244913,0.0343488,0.2223973,0.0003283356,0.6265339],"study_design_scores_gemma":[0.008136687,0.002165639,0.01740689,0.001243484,0.0001288367,0.006205243,0.02637908,0.8467806,0.01262824,0.05123089,0.02401677,0.003677646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.482664,0.001202905,0.5096775,0.001540063,0.000431923,0.0002137309,5.652039e-7,0.0002027902,0.004066485],"genre_scores_gemma":[0.9583088,0.0004145977,0.04088637,0.0002848429,0.00004740154,0.00001715716,0.000002240706,0.000005732502,0.00003283771],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8425357,"threshold_uncertainty_score":0.5559494,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.4892419606017093,"gpt":0.5236692874574922,"spread":0.03442732685578292,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002659988,0.000120246,0.0001854671,0.00006487325,0.0002720926,0.0006907744,0.00061539,0.00003860694,0.00006426466],"category_scores_gemma":[0.007097396,0.0001018365,0.00001592579,0.0006149522,0.0001753637,0.003129852,0.0008812617,0.000139744,0.00007519533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003639136,"about_ca_system_score_gemma":0.00004937831,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007491941,"about_ca_topic_score_gemma":0.00003424976,"domain_scores_codex":[0.9976351,0.0005720825,0.0004515419,0.0007243362,0.0004649556,0.0001520248],"domain_scores_gemma":[0.9959857,0.003015235,0.0002559907,0.0003675308,0.0002112967,0.0001642744],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001836564,0.000202034,0.01345434,0.00006857319,0.00004636435,0.00002138052,0.07473557,0.00003396432,0.00004546967,0.04446862,0.04882319,0.8179169],"study_design_scores_gemma":[0.0008323353,0.000202391,0.0345243,0.00004543035,0.00003992899,0.0000135888,0.02614182,0.115001,0.00001358318,0.008601109,0.814151,0.0004334979],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5441949,0.01509278,0.4179058,0.01145903,0.001720974,0.0006864832,0.0005104198,0.0001796581,0.008249918],"genre_scores_gemma":[0.9948123,0.0007012231,0.0009686161,0.00327597,0.00005029829,0.000006697563,0.0001371515,0.000004119412,0.00004370058],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8174834,"threshold_uncertainty_score":0.8496758,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.08366151756304095,"gpt":0.3472004218482463,"spread":0.2635389042852053,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001653921,0.0001404822,0.0001208128,0.00006589211,0.0001968509,0.0000903819,0.0001038378,0.00005044674,0.0000138299],"category_scores_gemma":[0.0001621577,0.000148446,0.000008399787,0.0002217226,0.000113911,0.0009630315,0.00006085822,0.00009818942,0.000006878446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002996744,"about_ca_system_score_gemma":0.00002877238,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001050202,"about_ca_topic_score_gemma":0.000001396781,"domain_scores_codex":[0.999091,0.00004460176,0.0002254695,0.000310916,0.0001602398,0.0001677936],"domain_scores_gemma":[0.9992285,0.0002466733,0.00009591319,0.0002365879,0.0001207696,0.00007149754],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003753983,0.0000341208,0.0001736929,0.00002767414,0.00001527437,0.00000401426,0.001661489,0.9159245,0.001678874,0.0001553403,0.00005769953,0.08022981],"study_design_scores_gemma":[0.0003204461,0.00006001283,0.00008156231,0.00007823348,0.00002536947,0.000004679522,0.0004878833,0.9967578,0.0004542872,0.00002257243,0.001528453,0.0001787142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1495262,0.0002273632,0.8489337,0.00005621289,0.0004214728,0.000125044,0.000006636985,0.0001199954,0.000583342],"genre_scores_gemma":[0.9278049,0.0003895049,0.07141007,0.0001274204,0.000191941,0.000005443666,0.00004779835,0.00001699142,0.000005907186],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7782787,"threshold_uncertainty_score":0.6053451,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05974817568560483,"gpt":0.3991297576339752,"spread":0.3393815819483704,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005971566,0.000173328,0.0001763974,0.0001404419,0.0005935662,0.0004320032,0.0002615802,0.00008773067,0.000001291367],"category_scores_gemma":[0.0004714525,0.000169069,0.00003538802,0.00102994,0.00005040222,0.001363703,0.0001980897,0.000222823,0.00003657688],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002056295,"about_ca_system_score_gemma":0.00003977917,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004732537,"about_ca_topic_score_gemma":0.000004992122,"domain_scores_codex":[0.9984854,0.00007620647,0.0002665464,0.0005324502,0.0003144919,0.0003249346],"domain_scores_gemma":[0.9982796,0.001131846,0.0001753123,0.0001447168,0.0001220872,0.0001464843],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008679938,0.0003267783,0.0007656961,0.00007776565,0.00008705895,0.00006531415,0.1757918,0.01363367,0.003209569,0.08262619,0.01399912,0.7093303],"study_design_scores_gemma":[0.002920442,0.001893925,0.07062513,0.0002531843,0.00009734354,0.0004975437,0.03087058,0.7175232,0.00127141,0.02546765,0.1475926,0.0009869842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3699995,0.0001025864,0.6275464,0.0009115102,0.0008246807,0.0001555353,0.000004452772,0.000212476,0.0002429334],"genre_scores_gemma":[0.9632845,0.00009528245,0.03304679,0.003057201,0.0003459309,0.00005161056,0.00001784408,0.00001315584,0.00008769176],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7083433,"threshold_uncertainty_score":0.6894432,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03387021573419238,"gpt":0.3050660844650608,"spread":0.2711958687308685,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004188662,0.0002205122,0.0001931716,0.000202876,0.001465158,0.0003559387,0.0001439895,0.00006911228,0.000003732336],"category_scores_gemma":[0.00007763497,0.0002378283,0.00002772225,0.0009555036,0.0001986522,0.001873429,0.0001312122,0.0003153025,1.212254e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001091015,"about_ca_system_score_gemma":0.0001000017,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009995328,"about_ca_topic_score_gemma":4.788236e-7,"domain_scores_codex":[0.9977802,0.0005170234,0.0003288545,0.0007003983,0.0004355948,0.0002379113],"domain_scores_gemma":[0.9982602,0.0005880434,0.0005612193,0.0001709902,0.0003162811,0.000103247],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003123748,0.00006307165,0.0007747422,0.00001000816,0.00001840244,0.000004548675,0.002339371,0.9687722,0.00003564766,0.0005896642,0.000002446419,0.02707753],"study_design_scores_gemma":[0.001246223,0.00037109,0.001446907,0.00006917188,0.00004921034,0.0002101515,0.002306103,0.9935943,0.00004406318,0.0003719407,0.000006171007,0.0002846439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05763302,0.0003001325,0.9407927,0.0002432048,0.000477971,0.0004582752,0.00001143914,0.00007921656,0.000004012344],"genre_scores_gemma":[0.5540435,0.00003021592,0.445632,0.0001780733,0.00002538716,0.00005138357,0.00002918744,0.00000946676,7.567365e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4964105,"threshold_uncertainty_score":0.9998348,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; 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","retraction":null,"screen_n_in":null,"score":{"opus":0.100912155265429,"gpt":0.4402179227642692,"spread":0.3393057674988402,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.003415009,0.0001648104,0.0002677098,0.0001626071,0.0007097286,0.000350809,0.000192027,0.0001235382,0.000003698035],"category_scores_gemma":[0.02020547,0.0001468738,0.0000344283,0.0005221528,0.0001531344,0.001166305,0.000115904,0.0002278095,0.000001823577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002317167,"about_ca_system_score_gemma":0.0000761586,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001234691,"about_ca_topic_score_gemma":7.989435e-7,"domain_scores_codex":[0.9978592,0.000308826,0.0005637525,0.0005466605,0.0004738405,0.0002476752],"domain_scores_gemma":[0.9921911,0.006391836,0.0005792411,0.0001662544,0.000576966,0.00009464272],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001076379,0.00002884203,0.005798034,0.00003227183,0.000006213135,7.786537e-7,0.003620605,0.007924248,0.0004269633,0.005114357,0.00006271364,0.9768773],"study_design_scores_gemma":[0.000482268,0.0001851569,0.01796806,0.00006345402,0.00002789329,0.00004409936,0.000939413,0.9715623,0.0003528624,0.005021027,0.003143079,0.0002104173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4996058,0.000137981,0.4993891,0.00009310139,0.0005097889,0.0001163583,0.000001103486,0.00002067655,0.0001260419],"genre_scores_gemma":[0.8903612,0.00001948192,0.1089943,0.0004202356,0.0001721829,0.000007105468,0.000003075141,0.000007503121,0.00001491608],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9766669,"threshold_uncertainty_score":0.9880478,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.02475011887112764,"gpt":0.3350850981481921,"spread":0.3103349792770644,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004348274,0.00007400286,0.00008553665,0.00002207526,0.0006995288,0.00008570438,0.00006222383,0.00005115086,0.00001885843],"category_scores_gemma":[0.00007833444,0.00006302443,0.00001618549,0.0001824452,0.00009123173,0.001264253,0.000005542337,0.00007943229,0.000002614707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009449626,"about_ca_system_score_gemma":0.00009084817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002632664,"about_ca_topic_score_gemma":0.00009680028,"domain_scores_codex":[0.999026,0.0001635465,0.0002819333,0.0001803578,0.000216764,0.0001314011],"domain_scores_gemma":[0.9993295,0.0001751307,0.0001568057,0.00005779548,0.0002339144,0.00004686615],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007583478,0.00002779772,0.002233802,0.00002145557,0.00001353718,3.292467e-7,0.08509056,0.7923373,0.0001043986,0.1081685,0.00007009583,0.0118564],"study_design_scores_gemma":[0.000396593,0.00008616116,0.0007955655,0.00005734123,0.00003407761,0.000002099101,0.03160233,0.9619671,0.00003672102,0.002089211,0.002750057,0.0001827996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3734072,0.002991715,0.6187195,0.0008791289,0.0005043329,0.0003516414,0.000001954476,0.0000359815,0.00310852],"genre_scores_gemma":[0.9956849,0.00308156,0.0009723261,0.00006841576,0.00005208149,0.00001595331,0.00001956197,0.000004316465,0.0001008992],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6222777,"threshold_uncertainty_score":0.5380281,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.03333774499421042,"gpt":0.3171633814593046,"spread":0.2838256364650942,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004321173,0.0001758696,0.0001820958,0.00007272593,0.0007511302,0.0003776631,0.0001344044,0.00006435623,9.201881e-7],"category_scores_gemma":[0.00009143569,0.0001876654,0.000034276,0.0001946365,0.00008868179,0.001013215,0.00008353141,0.0001066703,0.000001397045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003719138,"about_ca_system_score_gemma":0.00004033369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001739665,"about_ca_topic_score_gemma":0.000001631869,"domain_scores_codex":[0.9984973,0.0001516598,0.0003902299,0.0005009223,0.0002060412,0.0002538129],"domain_scores_gemma":[0.9988644,0.0004984337,0.0003173266,0.0001456973,0.00009593617,0.00007818023],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002773839,0.001072123,0.03961466,0.0007875329,0.0001621308,0.0006759109,0.03124351,0.5436,0.006523231,0.1246119,0.003057039,0.2483746],"study_design_scores_gemma":[0.0006774729,0.0001131704,0.001887097,0.00008188886,0.00002010845,0.001043305,0.0005821238,0.9885415,0.00008035704,0.0002638093,0.006499166,0.0002099655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2241648,0.0004804693,0.7742779,0.00009980952,0.0005149257,0.0002311113,0.00001351526,0.00008098827,0.0001364255],"genre_scores_gemma":[0.9401259,0.000008778991,0.05947696,0.0001300418,0.0001801496,0.0000149096,0.00004952163,0.000007003787,0.000006686606],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7159612,"threshold_uncertainty_score":0.7652771,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07111025820182253,"gpt":0.3561732568124616,"spread":0.2850629986106391,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002456006,0.00009099366,0.0001055504,0.0000488855,0.0001550559,0.0001246673,0.0002434824,0.00004034463,0.000001685365],"category_scores_gemma":[0.0002062052,0.00007311699,0.00001197729,0.0001290642,0.00005449769,0.001584786,0.0001651761,0.00005525336,5.285937e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000146828,"about_ca_system_score_gemma":0.00004850002,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001426829,"about_ca_topic_score_gemma":0.000006879258,"domain_scores_codex":[0.999068,0.00007384684,0.0002104945,0.0003875878,0.0001135132,0.0001465179],"domain_scores_gemma":[0.9992451,0.0003806641,0.0001119657,0.0001388091,0.00008033528,0.00004309035],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005322649,0.00009362525,0.0001214863,0.000009960831,0.00000645382,0.000002638751,0.004439248,0.0004773136,0.0000444686,0.004046253,0.0005161382,0.9901892],"study_design_scores_gemma":[0.001076539,0.0001082606,0.0006653504,0.00004243851,0.00000904131,0.00001446784,0.001530694,0.9913875,0.000006139037,0.0001736639,0.004828345,0.0001575499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1203288,0.0006966557,0.8754743,0.002977198,0.0002849755,0.000149867,0.000010334,0.00003798183,0.00003985283],"genre_scores_gemma":[0.9939901,0.0004309118,0.005000836,0.0004299355,0.00007032618,0.00002309037,0.00003255589,0.000003266792,0.0000189881],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9909102,"threshold_uncertainty_score":0.2981624,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}