{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":76,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":76,"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","author_layer_release":"2026-06-26"},"query_hash":"3a11c843eba1","filters":{"venue":"Journal of Parallel and Distributed Computing"}},"results":[{"id":"W2095930915","doi":"10.1016/j.jpdc.2007.05.015","title":"A high performance algorithm for static task scheduling in heterogeneous distributed computing systems","year":2007,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":235,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Dynamic priority scheduling; Algorithm; Scheduling (production processes); Fair-share scheduling; Rate-monotonic scheduling; Distributed computing; Parallel computing; Speedup; Symmetric multiprocessor system; Critical path method; Two-level scheduling; Fixed-priority pre-emptive scheduling; Round-robin scheduling; Schedule; Mathematical optimization","authors":[{"name":"Mohammad I. Daoud","is_ca":true},{"name":"Nawwaf Kharma","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01504554752251884,"gpt":0.2554308832610148,"spread":0.240385335738496,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001878658,0.000965484,0.001150278,0.001220672,0.001707689,0.001431796,0.002599506,0.001212482,0.004216323],"category_scores_gemma":[0.00432393,0.0007284734,0.0006083153,0.001444831,0.0009178931,0.00168875,0.00182275,0.00131053,0.001000686],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001277654,"about_ca_system_score_gemma":0.002534362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006769767,"about_ca_topic_score_gemma":0.006568919,"domain_scores_codex":[0.999268,0.0001783859,0.00004636292,0.0001124789,0.0002822864,0.000112508],"domain_scores_gemma":[0.9986822,0.0006255645,0.00007722864,0.0001705749,0.0003368672,0.0001074169],"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.0008203531,0.0002553946,0.0009834826,0.0001738922,0.00009315098,0.0001458808,0.0001681087,0.6083156,0.00908876,0.01927683,0.007778596,0.3529001],"study_design_scores_gemma":[0.00007279497,0.00003818291,0.0000803766,0.000003522981,0.00001064025,0.00001739453,0.00001235735,0.9938865,0.0009601746,0.003985331,0.0009258016,0.000006850207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01726478,0.0002579395,0.9781535,0.0001842217,0.0001556456,0.0001019982,0.0000425673,0.001779907,0.002059457],"genre_scores_gemma":[0.1726642,0.0001557111,0.8231956,0.0001144617,0.00009515615,0.0002504877,0.0002066898,0.0003511883,0.002966621],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006769767,"threshold_uncertainty_score":0.01410496,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2088092680","doi":"10.1016/j.jpdc.2014.07.001","title":"A survey of high level frameworks in block-structured adaptive mesh refinement packages","year":2014,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":158,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Perimeter Institute; University of Guelph","funders":"Lawrence Berkeley National Laboratory; Deutsche Forschungsgemeinschaft; National Energy Research Scientific Computing Center; National Science Foundation; Compute Canada; Office of Science; National Aeronautics and Space Administration; Argonne National Laboratory; National Energy Technology Laboratory; U.S. Department of Energy; Natural Sciences and Engineering Research Council of Canada; National Nuclear Security Administration; Louisiana State University","keywords":"Computer science; Block (permutation group theory); Set (abstract data type); Range (aeronautics); Architecture; Adaptive mesh refinement; Domain (mathematical analysis); Cover (algebra); Programming language; Computational science; Archaeology","authors":[{"name":"Anshu Dubey","is_ca":false},{"name":"Ann Almgren","is_ca":false},{"name":"John B. Bell","is_ca":false},{"name":"Martin Berzins","is_ca":false},{"name":"Steven R. Brandt","is_ca":false},{"name":"Greg L. Bryan","is_ca":false},{"name":"Phillip Colella","is_ca":false},{"name":"Daniel Graves","is_ca":false},{"name":"Michael Lijewski","is_ca":false},{"name":"Frank Löffler","is_ca":false},{"name":"Brian W. O’Shea","is_ca":false},{"name":"Erik Schnetter","is_ca":true},{"name":"Brian Van Straalen","is_ca":false},{"name":"Klaus Weide","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02661456877355989,"gpt":0.266046701316634,"spread":0.2394321325430741,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002329687,0.001075258,0.001873896,0.001883666,0.0007494864,0.002475597,0.004580856,0.0017565,0.006439411],"category_scores_gemma":[0.004781016,0.001311514,0.001752,0.005057522,0.000937872,0.002388602,0.002080099,0.002987781,0.004642264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007176265,"about_ca_system_score_gemma":0.001844131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002196903,"about_ca_topic_score_gemma":0.002190969,"domain_scores_codex":[0.9981813,0.0004064537,0.0001501529,0.0001674396,0.0009737889,0.0001208085],"domain_scores_gemma":[0.9984139,0.0006215625,0.00008325527,0.0003139038,0.0004784846,0.00008877603],"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.0001718461,0.0001879347,0.001237435,0.003037127,0.0001600128,0.000103927,0.0001886285,0.06661682,0.005199578,0.1440828,0.02301264,0.7560013],"study_design_scores_gemma":[0.0001001373,0.0002061568,0.0009580374,0.0009692649,0.0001190817,0.0005042286,0.00007834685,0.4524541,0.007549564,0.1077221,0.4292109,0.0001281314],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.002660187,0.04404181,0.9416457,0.0005943108,0.0003180585,0.0001192526,0.0002728744,0.002471982,0.007875798],"genre_scores_gemma":[0.04395528,0.07349887,0.8690841,0.0007174436,0.0005740239,0.000462612,0.001600814,0.00250178,0.007605107],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.006439411,"threshold_uncertainty_score":0.02154201,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2148789662","doi":"10.1016/j.jpdc.2007.04.010","title":"Performance of memory reclamation for lockless synchronization","year":2007,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":145,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Land reclamation; Priority inversion; Pointer (user interface); Workload; Concurrency; Data structure; Blocking (statistics); Distributed computing; Parallel computing; Computer network; Operating system; Computer hardware; Dynamic priority scheduling; Quality of service","authors":[{"name":"Paul E. McKenney","is_ca":false},{"name":"Jonathan Walpole","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01227256843782585,"gpt":0.2517639469107619,"spread":0.2394913784729361,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001117148,0.0006501336,0.0007174337,0.0005335784,0.0007277625,0.00101429,0.001354309,0.0007044708,0.007082657],"category_scores_gemma":[0.005779389,0.0002694129,0.000168506,0.0006717229,0.000634123,0.00133588,0.0008364936,0.0006994611,0.0007465435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006648739,"about_ca_system_score_gemma":0.001156732,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00248376,"about_ca_topic_score_gemma":0.001875091,"domain_scores_codex":[0.998701,0.0002477985,0.00004808298,0.0002203904,0.0003084672,0.0004741942],"domain_scores_gemma":[0.9943483,0.002907189,0.000382089,0.0009926928,0.0009103552,0.0004594234],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.04220624,0.00180953,0.01720704,0.000750742,0.0002598092,0.0009247998,0.001466858,0.1338231,0.5047624,0.008377989,0.01446262,0.273949],"study_design_scores_gemma":[0.001288184,0.003935694,0.0113937,0.00003288662,0.0002317739,0.0002807768,0.0004530607,0.5151666,0.4613982,0.002235157,0.003462308,0.0001216046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9830578,0.000577347,0.00836391,0.0001655295,0.0001114089,0.00001890452,0.0001100263,0.004279205,0.003315705],"genre_scores_gemma":[0.997018,0.00004155269,0.001464084,0.00002656432,0.00001291509,0.000006930549,0.0001010512,0.0001339213,0.001194991],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007082657,"threshold_uncertainty_score":0.02369392,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083028490","doi":"10.1016/j.jpdc.2012.02.019","title":"Parallel differential evolution with self-adapting control parameters and generalized opposition-based learning for solving high-dimensional optimization problems","year":2012,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":120,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Tech University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Differential evolution; Speedup; Benchmark (surveying); Computational complexity theory; Graphics; Parallel computing; Optimization problem; Execution time; Mathematical optimization; Algorithm; Mathematics; Computer graphics (images)","authors":[{"name":"Hui Wang","is_ca":false},{"name":"Shahryar Rahnamayan","is_ca":true},{"name":"Zhijian Wu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01425295086016035,"gpt":0.2382615037605564,"spread":0.2240085529003961,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00141381,0.0005892972,0.001018337,0.0005713843,0.0004232609,0.0006317403,0.001150629,0.0009492646,0.0009941903],"category_scores_gemma":[0.00261192,0.0004150118,0.0006102191,0.0007809838,0.0007925735,0.0007086053,0.0009840046,0.001024679,0.0001540044],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005382113,"about_ca_system_score_gemma":0.0006028435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002574914,"about_ca_topic_score_gemma":0.002590309,"domain_scores_codex":[0.999644,0.0001369248,0.00002072601,0.0000374771,0.000131425,0.00002940447],"domain_scores_gemma":[0.9992657,0.0004373467,0.00006981775,0.00005311646,0.0001466537,0.00002735031],"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.00005689889,0.0000661184,0.0002304832,0.00004935397,0.00004063512,0.00003351229,0.00003748169,0.9556822,0.001479594,0.005576372,0.0002902811,0.03645718],"study_design_scores_gemma":[0.000008658118,0.00001568028,0.00002728991,0.000001588136,0.000003010146,0.000005199056,0.000001744962,0.9988275,0.000162477,0.0008388064,0.0001062718,0.000001767507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05160889,0.0005259758,0.9414863,0.0002077968,0.0001362165,0.0000793643,0.00001590645,0.0002064264,0.005733124],"genre_scores_gemma":[0.7522427,0.0002870147,0.2440888,0.0001262654,0.00005910301,0.000248066,0.00004418601,0.00007055204,0.002833138],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002574914,"threshold_uncertainty_score":0.007477045,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2975816306","doi":"10.1016/j.jpdc.2019.09.013","title":"En-ABC: An ensemble artificial bee colony based anomaly detection scheme for cloud environment","year":2019,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":105,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal; École de Technologie Supérieure","funders":"Ministry of Electronics and Information technology","keywords":"Computer science; Anomaly detection; Identification (biology); Cluster analysis; Cloud computing; Data mining; Feature selection; Identification scheme; Artificial intelligence; Artificial bee colony algorithm; Feature (linguistics); Machine learning","authors":[{"name":"Sahil Garg","is_ca":true},{"name":"Kuljeet Kaur","is_ca":true},{"name":"Shalini Batra","is_ca":false},{"name":"Gagangeet Singh Aujla","is_ca":false},{"name":"Graham Morgan","is_ca":false},{"name":"Neeraj Kumar","is_ca":false},{"name":"Albert Y. Zomaya","is_ca":false},{"name":"Rajiv Ranjan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01314066750836966,"gpt":0.2340278167369527,"spread":0.220887149228583,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004113507,0.0004371279,0.0008727433,0.0006353774,0.0005004331,0.000510846,0.001292023,0.0005497173,0.000793495],"category_scores_gemma":[0.00113205,0.0001683488,0.0003376881,0.0007022808,0.0002207997,0.0007667405,0.000603364,0.0007384422,0.0001919217],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004452397,"about_ca_system_score_gemma":0.0006385716,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006218999,"about_ca_topic_score_gemma":0.00715176,"domain_scores_codex":[0.999539,0.00007331972,0.00003226599,0.00007986418,0.0002314493,0.00004414719],"domain_scores_gemma":[0.9995068,0.00009026424,0.00004261752,0.00007532989,0.0002556105,0.00002938995],"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.0004804556,0.0002997636,0.006076253,0.00008301311,0.0001958706,0.0002078183,0.00007139101,0.2136385,0.03036517,0.003784426,0.00569131,0.7391061],"study_design_scores_gemma":[0.00001110436,0.00004641121,0.0006948016,0.000002242074,0.00001460026,0.00007600554,0.000006652097,0.9941244,0.003601898,0.0004949939,0.0009194387,0.00000751193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.107149,0.0009417655,0.8857045,0.0002769819,0.000282751,0.000113518,0.0001442702,0.002529124,0.002858057],"genre_scores_gemma":[0.7470602,0.0002617397,0.2481964,0.0001475351,0.00005045272,0.00006266458,0.0002385639,0.00006502403,0.003917394],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006218999,"threshold_uncertainty_score":0.01236558,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2935850529","doi":"10.1016/j.jpdc.2019.04.008","title":"GPU accelerated t-distributed stochastic neighbor embedding","year":2019,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Canadian Institute for Advanced Research; Nvidia","keywords":"Computer science; MNIST database; CUDA; Embedding; Dimensionality reduction; Curse of dimensionality; Visualization; Implementation; Parallel computing; Artificial intelligence; Machine learning; Artificial neural network; Theoretical computer science","authors":[{"name":"David M. Chan","is_ca":false},{"name":"Roshan Rao","is_ca":false},{"name":"Forrest Huang","is_ca":false},{"name":"John Canny","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0211537184037052,"gpt":0.285349262357592,"spread":0.2641955439538868,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002621021,0.0004045418,0.0005986645,0.0003042435,0.000343737,0.0005566308,0.001204494,0.0007659774,0.007401003],"category_scores_gemma":[0.001265033,0.0002131205,0.0003760011,0.0005627606,0.0002485595,0.0006294592,0.0009548495,0.0007891839,0.001502818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003498971,"about_ca_system_score_gemma":0.001118144,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006849562,"about_ca_topic_score_gemma":0.01578177,"domain_scores_codex":[0.9997582,0.00004278219,0.00000928966,0.00004296601,0.0001121501,0.00003459113],"domain_scores_gemma":[0.999579,0.00008684681,0.00002065165,0.00008475891,0.0001794969,0.00004935982],"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.0007044917,0.000244548,0.001609292,0.0001370081,0.0001263426,0.0002833667,0.0001041458,0.619512,0.01706308,0.02139374,0.02456763,0.3142544],"study_design_scores_gemma":[0.00001621726,0.00001467382,0.00006665862,0.000001131569,0.000002737881,0.00002113877,0.000006486478,0.9968137,0.001016298,0.001443173,0.0005951434,0.000002690958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06646042,0.0002712271,0.9195507,0.0004185307,0.0004112912,0.00007436924,0.0003183956,0.003132081,0.00936306],"genre_scores_gemma":[0.5419539,0.0001224524,0.4424042,0.0001999698,0.00008025362,0.0001096326,0.0008185331,0.0004290584,0.01388194],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007401003,"threshold_uncertainty_score":0.02475876,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966659084","doi":"10.1016/j.jpdc.2008.07.013","title":"Replica selection strategies in data grid","year":2008,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Replica; Computer science; Latency (audio); Grid; File transfer; Artificial neural network; Data mining; Transfer (computing); Parallel computing; Artificial intelligence","authors":[{"name":"Rashedur M. Rahman","is_ca":true},{"name":"Reda Alhajj","is_ca":true},{"name":"Ken Barker","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04508819402732072,"gpt":0.2830807135493802,"spread":0.2379925195220595,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003559545,0.0004740208,0.001518354,0.0009263888,0.001333821,0.002382947,0.002412896,0.0009443919,0.00311725],"category_scores_gemma":[0.01406258,0.0004913166,0.0004128387,0.001703663,0.0009487895,0.002210649,0.001279197,0.0008927249,0.0005864258],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001086613,"about_ca_system_score_gemma":0.001298767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002256932,"about_ca_topic_score_gemma":0.002447464,"domain_scores_codex":[0.9986449,0.0006683032,0.00008287113,0.0001456281,0.0002831133,0.0001751782],"domain_scores_gemma":[0.9927018,0.004371863,0.0003247096,0.001285056,0.0008842741,0.000432381],"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.002117248,0.0004071463,0.006682735,0.000334073,0.0001769801,0.0004322855,0.0008164809,0.4308186,0.01335113,0.2949893,0.01209592,0.2377781],"study_design_scores_gemma":[0.000136577,0.0001045221,0.0004602653,0.0000130347,0.00004275594,0.0001076134,0.0001677733,0.9043772,0.002275342,0.09014706,0.002149488,0.00001844717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3088469,0.002931177,0.6679892,0.001605279,0.0003197215,0.0002850471,0.0001957199,0.001088092,0.01673886],"genre_scores_gemma":[0.9176006,0.0003977877,0.07729079,0.0001012264,0.00006827688,0.0001027724,0.00008225835,0.0001364472,0.004219865],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003559545,"threshold_uncertainty_score":0.01882488,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2039340660","doi":"10.1016/j.jpdc.2015.04.003","title":"An energy-efficient and sink-location privacy enhanced scheme for WSNs through ring based routing","year":2015,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Sink (geography); Computer science; Computer network; Multipath routing; Geographic routing; Network packet; Static routing; Wireless sensor network; Equal-cost multi-path routing; Routing protocol; Anonymity; Dynamic Source Routing; Routing (electronic design automation); Policy-based routing; Topology (electrical circuits); Distributed computing; Computer security; Engineering; Geography","authors":[{"name":"Jun Long","is_ca":false},{"name":"Anfeng Liu","is_ca":true},{"name":"Mianxiong Dong","is_ca":true},{"name":"Zhi Li","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0313722191953885,"gpt":0.2852194507636361,"spread":0.2538472315682476,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001094905,0.0004204954,0.00112029,0.0004530798,0.0008629153,0.0008903968,0.002097121,0.0007731683,0.001360021],"category_scores_gemma":[0.001988414,0.0002461504,0.0005783546,0.0008059907,0.0005538495,0.002161652,0.002627452,0.0008377889,0.0004269707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007510444,"about_ca_system_score_gemma":0.00103983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005432871,"about_ca_topic_score_gemma":0.0008096861,"domain_scores_codex":[0.9987652,0.0003488244,0.00009021231,0.0002616846,0.0003411627,0.0001929795],"domain_scores_gemma":[0.9986204,0.00032074,0.0001736896,0.0005642342,0.0002507121,0.00007026693],"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.002831153,0.0005502653,0.002308618,0.0005174404,0.0003419465,0.000675422,0.0007769308,0.3470221,0.2495017,0.1100853,0.01120538,0.2741838],"study_design_scores_gemma":[0.00008465092,0.0004577205,0.0005203942,0.00001441907,0.000100328,0.0005945103,0.0001022401,0.940614,0.03554685,0.01519106,0.006697988,0.00007595024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08221938,0.0007974943,0.9119897,0.0004818621,0.0001989868,0.0001670561,0.0002266683,0.0008755655,0.003043259],"genre_scores_gemma":[0.8611839,0.0003397528,0.1329622,0.0001489007,0.00005651304,0.0000836851,0.0002054963,0.0000445281,0.00497505],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002097121,"threshold_uncertainty_score":0.005790472,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2017982663","doi":"10.1016/j.jpdc.2010.03.009","title":"Private key agreement and secure communication for heterogeneous sensor networks","year":2010,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ontario Institute of Technology","funders":"","keywords":"Computer science; Key management; Key (lock); Computer network; Key space; Computer security; Public-key cryptography; Encryption; Protocol (science); Node (physics); Key distribution; Wireless sensor network; Cryptography; Symmetric-key algorithm; Key-agreement protocol; Elliptic curve cryptography","authors":[{"name":"Sk. Md. Mizanur Rahman","is_ca":true},{"name":"Khalil El‐Khatib","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01095677645040634,"gpt":0.2451478531103873,"spread":0.234191076659981,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005408257,0.0006034324,0.001519482,0.0006784556,0.001543785,0.003092018,0.002061592,0.001788303,0.001809973],"category_scores_gemma":[0.01299947,0.0006779323,0.0006733836,0.001399705,0.003773864,0.007396952,0.004346493,0.003187865,0.0004464205],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00182246,"about_ca_system_score_gemma":0.001893199,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001120844,"about_ca_topic_score_gemma":0.001054084,"domain_scores_codex":[0.9948709,0.001994685,0.0003592548,0.0006318372,0.001590845,0.0005524448],"domain_scores_gemma":[0.9917557,0.004582698,0.0008207719,0.002027965,0.0006263552,0.0001865642],"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.000795859,0.00008941306,0.0004656442,0.0001829317,0.00009925963,0.0004249085,0.0005433473,0.2005629,0.006870031,0.740568,0.00346871,0.04592903],"study_design_scores_gemma":[0.0001229003,0.00006520282,0.0001330457,0.00001405558,0.00003576836,0.0001140266,0.00008961567,0.5273513,0.002672251,0.465974,0.003399594,0.0000280995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02958542,0.001076702,0.9632515,0.00137262,0.0001890972,0.000108062,0.00007763805,0.0001568966,0.004181953],"genre_scores_gemma":[0.8978407,0.0009504992,0.09285804,0.0002392009,0.0002865685,0.0002676423,0.0001786983,0.00007437831,0.007304298],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005408257,"threshold_uncertainty_score":0.02860194,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2802337893","doi":"10.1016/j.jpdc.2018.04.004","title":"Response time optimization for cloudlets in Mobile Edge Computing","year":2018,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Task (project management); Cloudlet; Distributed computing; Edge computing; Mobile device; Edge device; Mobile edge computing; Quality of service; Nash equilibrium; Cloud computing; Response time; Computer network; Operating system; Artificial intelligence","authors":[{"name":"Mayank Tiwary","is_ca":false},{"name":"Deepak Puthal","is_ca":false},{"name":"Kshira Sagar Sahoo","is_ca":false},{"name":"Bibhudatta Sahoo","is_ca":false},{"name":"Laurence T. Yang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01399967873238087,"gpt":0.2696285640487984,"spread":0.2556288853164175,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001185877,0.0008939616,0.001550104,0.0004249516,0.0007691819,0.001390004,0.001320715,0.001017885,0.004187999],"category_scores_gemma":[0.002581182,0.0003679551,0.0005503425,0.0006931984,0.0004742648,0.0009328689,0.0007744402,0.001092326,0.0005166531],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001533862,"about_ca_system_score_gemma":0.001719774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004684628,"about_ca_topic_score_gemma":0.003816468,"domain_scores_codex":[0.9989232,0.0002694416,0.00002897881,0.0001837018,0.0001820532,0.0004125612],"domain_scores_gemma":[0.9985141,0.0009059756,0.00009613647,0.00008664523,0.000243295,0.0001537857],"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.0009840307,0.0002420323,0.0005613971,0.0001649453,0.00004791917,0.0000990185,0.00004999346,0.9436364,0.00842467,0.009518961,0.006261526,0.03000908],"study_design_scores_gemma":[0.00000987825,0.0000464478,0.00008270785,0.000002423627,0.00000660738,0.00001072192,0.00001190673,0.9978871,0.0005095082,0.001256224,0.0001740171,0.000002495565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1950305,0.002054226,0.7842315,0.001995822,0.0005630745,0.0002170474,0.000362715,0.0009553576,0.01458971],"genre_scores_gemma":[0.9503126,0.0002844125,0.04425432,0.0001883782,0.0001419666,0.00005072346,0.0001153396,0.0001614244,0.00449087],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004684628,"threshold_uncertainty_score":0.01401025,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2093615050","doi":"10.1016/j.jpdc.2010.04.001","title":"Dynamic balancing of communication and computation load for HLA-based simulations on large-scale distributed systems","year":2010,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computation; Distributed computing; Load balancing (electrical power); Scale (ratio); Parallel computing; Algorithm","authors":[{"name":"Robson E. De Grande","is_ca":true},{"name":"Azzedine Boukerche","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0122417790204031,"gpt":0.2773900201079655,"spread":0.2651482410875625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00119683,0.0002873827,0.0005575162,0.000329591,0.0008973886,0.0011075,0.0009520222,0.0005470557,0.002067629],"category_scores_gemma":[0.004631679,0.0003112093,0.000178313,0.0004161284,0.0006075565,0.001210804,0.001060951,0.0007212022,0.0002956238],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005929419,"about_ca_system_score_gemma":0.0008607337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002780666,"about_ca_topic_score_gemma":0.002309557,"domain_scores_codex":[0.9994998,0.0002378077,0.00002675451,0.00004577334,0.000115624,0.00007420719],"domain_scores_gemma":[0.9983285,0.0008191266,0.0001177843,0.00024167,0.000274324,0.0002185213],"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.0008078251,0.0001985344,0.004167204,0.00003479029,0.00003611231,0.000102355,0.0002068094,0.9462542,0.01343161,0.006590394,0.00125298,0.02691716],"study_design_scores_gemma":[0.00002605446,0.00002025133,0.0003180474,0.000001229953,0.000003324577,0.000006488902,0.00003224832,0.9974534,0.0008977802,0.001051623,0.0001860547,0.000003581107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7813573,0.0002281909,0.2058353,0.001084038,0.0001401103,0.00008364995,0.00007608936,0.0009833374,0.01021204],"genre_scores_gemma":[0.9920359,0.00002053066,0.007431124,0.00002784419,0.000008790469,0.00002076705,0.00002444894,0.000041228,0.0003894594],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002780666,"threshold_uncertainty_score":0.006916881,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066431556","doi":"10.1016/j.jpdc.2003.11.007","title":"Sorting and election in anonymous asynchronous rings","year":2003,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Multiset; Combinatorics; Sorting; Upper and lower bounds; Ring (chemistry); Asynchronous communication; Prime (order theory); Leader election; Characterization (materials science); Computer science; Discrete mathematics; Mathematics; Theoretical computer science; Algorithm; Computer network; Physics; Chemistry","authors":[{"name":"Paola Flocchini","is_ca":true},{"name":"Evangelos Kranakis","is_ca":true},{"name":"Danny Kriz̧anc","is_ca":false},{"name":"Flaminia L. Luccio","is_ca":false},{"name":"Nicola Santoro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008125596502436955,"gpt":0.2324580116784604,"spread":0.2243324151760234,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004003241,0.0003032942,0.001091486,0.001489666,0.00341769,0.004293283,0.001503357,0.001451407,0.004511754],"category_scores_gemma":[0.01722747,0.0004778393,0.0006709507,0.002298139,0.00287945,0.006017957,0.002206278,0.001464395,0.0005879477],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001374251,"about_ca_system_score_gemma":0.002135495,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001555803,"about_ca_topic_score_gemma":0.002018934,"domain_scores_codex":[0.9976452,0.0008933562,0.0002049093,0.0002994672,0.0004838947,0.0004731159],"domain_scores_gemma":[0.9881881,0.006936882,0.001212657,0.001668504,0.001173666,0.000820292],"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.0005091217,0.00007761236,0.0009202519,0.00005122301,0.00001440005,0.00009983469,0.0004124535,0.02474858,0.001295138,0.9522889,0.001815609,0.01776681],"study_design_scores_gemma":[0.0001028004,0.00006350363,0.0002267556,0.00001129855,0.00002883506,0.00008783522,0.0001747398,0.1227826,0.001705811,0.870849,0.003940216,0.00002655217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4234394,0.0006666112,0.5438662,0.00265529,0.0005240951,0.0001899362,0.0002450678,0.0008523885,0.0275611],"genre_scores_gemma":[0.9317501,0.00030547,0.04785717,0.0001702578,0.0001921668,0.00008223856,0.0001218406,0.00008176652,0.01943906],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004511754,"threshold_uncertainty_score":0.02117139,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4402631819","doi":"10.1016/j.jpdc.2024.104976","title":"Survey of federated learning in intrusion detection","year":2024,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Intrusion detection system; Intrusion; Computer security; Geology","authors":[{"name":"Hao Zhang","is_ca":false},{"name":"Junwei Ye","is_ca":false},{"name":"Wei Huang","is_ca":false},{"name":"Ximeng Liu","is_ca":false},{"name":"Jason Gu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01716586040327511,"gpt":0.2557119318781298,"spread":0.2385460714748547,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00535192,0.001112447,0.002345959,0.004955699,0.0008031433,0.003785186,0.002860593,0.001786917,0.001938281],"category_scores_gemma":[0.0118911,0.000682,0.001189431,0.006482736,0.00107442,0.005772204,0.001986385,0.001713256,0.0008184244],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001800574,"about_ca_system_score_gemma":0.002373614,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00222138,"about_ca_topic_score_gemma":0.001339371,"domain_scores_codex":[0.995016,0.001362792,0.000528854,0.001194468,0.001595941,0.0003018485],"domain_scores_gemma":[0.9922806,0.004253877,0.0003477398,0.001141673,0.001742521,0.0002335524],"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.0001920307,0.0002913688,0.004507014,0.001520311,0.0001843048,0.00005156866,0.000065473,0.01551809,0.0007838281,0.02528296,0.006712607,0.9448906],"study_design_scores_gemma":[0.000109551,0.001671097,0.009272498,0.002924916,0.0005617686,0.002117465,0.0004839957,0.5333073,0.01302911,0.1311668,0.3051544,0.0002011322],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.02483934,0.6374472,0.3142933,0.004263944,0.001103554,0.000190549,0.0004495422,0.0009840473,0.01642856],"genre_scores_gemma":[0.3650749,0.4407452,0.1775838,0.002486068,0.003779167,0.0002566186,0.001863413,0.000166413,0.008044428],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.00535192,"threshold_uncertainty_score":0.02830398,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2120196685","doi":"10.1016/j.jpdc.2008.05.005","title":"A new analytical method for parallel, diffusion-type load balancing","year":2008,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"D-Wave Systems (Canada); Simon Fraser University","funders":"","keywords":"Computer science; Mathematical proof; Load balancing (electrical power); Obstacle; Type (biology); Distributed computing; Key (lock); Parallel computing; Diffusion; Algorithm; Theoretical computer science; Mathematics","authors":[{"name":"Petra Berenbrink","is_ca":true},{"name":"Tom Friedetzky","is_ca":false},{"name":"Zengjian Hu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02498088714067866,"gpt":0.294798513997003,"spread":0.2698176268563243,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008117848,0.000796916,0.0008838924,0.001059215,0.001001485,0.001100206,0.002106623,0.001131342,0.005075188],"category_scores_gemma":[0.002497652,0.000459974,0.0007420873,0.00106719,0.000884673,0.001674989,0.001238267,0.001452108,0.001815842],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000935483,"about_ca_system_score_gemma":0.001269771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001794643,"about_ca_topic_score_gemma":0.002137476,"domain_scores_codex":[0.9995145,0.00009043777,0.00002104919,0.00005808427,0.0002829747,0.00003294216],"domain_scores_gemma":[0.9994406,0.000182265,0.00003905997,0.00006578011,0.0002272685,0.00004489143],"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.0002088649,0.0002303128,0.00059514,0.0005039894,0.0001217396,0.0002496681,0.0004348888,0.2019702,0.0749736,0.3375267,0.02008707,0.3630978],"study_design_scores_gemma":[0.00002588,0.00002670305,0.00007581801,0.00001689201,0.00001957654,0.0001214687,0.0000194505,0.9539886,0.00334601,0.02452209,0.01781083,0.00002664652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001227322,0.0002151392,0.9946774,0.0001378904,0.0003206341,0.00003863403,0.0000191449,0.0002862817,0.00307761],"genre_scores_gemma":[0.1168964,0.001133089,0.8490294,0.0004244264,0.0005766762,0.0003600063,0.0001195468,0.0006903174,0.03077017],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005075188,"threshold_uncertainty_score":0.0169782,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007719809","doi":"10.1016/j.jpdc.2010.12.009","title":"The impact of mobility on Mobile Ad Hoc Networks through the perspective of complex networks","year":2011,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Mobile ad hoc network; Computer network; Wireless ad hoc network; Vehicular ad hoc network; Mobility model; Network topology; Wireless network; Perspective (graphical); Optimized Link State Routing Protocol; Wireless; Distributed computing; Telecommunications; Network packet","authors":[{"name":"Cristiano Rezende","is_ca":true},{"name":"Azzedine Boukerche","is_ca":true},{"name":"Richard W. Pazzi","is_ca":true},{"name":"Bruno P. S. Rocha","is_ca":false},{"name":"Antônio A. F. Loureiro","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04403697820227219,"gpt":0.2981529466302975,"spread":0.2541159684280253,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009297024,0.000489518,0.0004224982,0.0007865765,0.0008979103,0.002799509,0.0007385264,0.001332246,0.001891907],"category_scores_gemma":[0.005290937,0.0003198244,0.0003155954,0.001064001,0.002131824,0.005671357,0.001165815,0.001298736,0.000230889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00113945,"about_ca_system_score_gemma":0.0004744186,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00245603,"about_ca_topic_score_gemma":0.001797949,"domain_scores_codex":[0.9994692,0.0002773889,0.00001369975,0.00004673066,0.0001361285,0.00005673629],"domain_scores_gemma":[0.9972887,0.00184814,0.0002692484,0.0001465709,0.00026043,0.0001868406],"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.00004125276,0.00002935422,0.001165131,0.0001304553,0.00003508322,0.0003697508,0.0004286747,0.1092651,0.0009082282,0.8696592,0.002070402,0.01589737],"study_design_scores_gemma":[0.00002054849,0.00008596219,0.001567976,0.0001004382,0.00004711355,0.0002897718,0.000615522,0.327007,0.0002494391,0.6469761,0.02300368,0.00003645444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2431754,0.06079837,0.4785358,0.05198096,0.00321506,0.00008969602,0.0003703405,0.00009642122,0.161738],"genre_scores_gemma":[0.9642056,0.02066405,0.008298759,0.0004196326,0.001877106,0.00003294907,0.00002749076,0.00002744952,0.004446833],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002799509,"threshold_uncertainty_score":0.008267283,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2752406850","doi":"10.1016/j.jpdc.2017.08.008","title":"A location Prediction-based routing scheme for opportunistic networks in an IoT scenario","year":2017,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Node (physics); Overhead (engineering); Markov chain; Network packet; Geographic routing; Routing (electronic design automation); Scheme (mathematics); Routing protocol; Reliability (semiconductor); Internet of Things; Distributed computing; Dynamic Source Routing; Computer security","authors":[{"name":"Sanjay Kumar Dhurandher","is_ca":false},{"name":"Satya Jyoti Borah","is_ca":false},{"name":"Isaac Woungang","is_ca":true},{"name":"Aman Bansal","is_ca":false},{"name":"Apoorv Gupta","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04185171047291864,"gpt":0.2931014631230441,"spread":0.2512497526501254,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000757337,0.0005308819,0.0009195046,0.000660631,0.001117132,0.000721027,0.001745314,0.0007159099,0.0009623647],"category_scores_gemma":[0.00144641,0.0002963281,0.0003357515,0.0009214336,0.0004403522,0.001236314,0.001569179,0.0005850044,0.000265065],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007234105,"about_ca_system_score_gemma":0.001052291,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005315522,"about_ca_topic_score_gemma":0.009116574,"domain_scores_codex":[0.9995893,0.00007399397,0.00003150612,0.00009388927,0.0001228812,0.0000885119],"domain_scores_gemma":[0.9993157,0.000184544,0.00008200867,0.0001530941,0.0001948838,0.00006980207],"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.0006808408,0.000337104,0.00354018,0.0001552099,0.0001181313,0.000662151,0.0003129564,0.6146309,0.03121547,0.03104074,0.01149545,0.3058108],"study_design_scores_gemma":[0.0000154914,0.00007409268,0.0002754492,0.000005742733,0.00001992733,0.0001418573,0.00004553356,0.9927889,0.001711628,0.003568658,0.001333022,0.0000198764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07961163,0.0007658866,0.9127372,0.0005057449,0.0003583591,0.0001478164,0.0002091816,0.001107189,0.004557003],"genre_scores_gemma":[0.9146215,0.0002721476,0.08262729,0.00010166,0.00006652268,0.00005665684,0.0001868595,0.00003325009,0.002034078],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005315522,"threshold_uncertainty_score":0.01056916,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980911550","doi":"10.1006/jpdc.2001.1809","title":"From Design Patterns to Parallel Architectural Skeletons","year":2002,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Software design pattern; Design pattern; Flexibility (engineering); Architectural pattern; Extensibility; Object-oriented programming; Structural pattern; Context (archaeology); Distributed computing; Set (abstract data type); Programmer; Programming language; Object-oriented design; Parallel programming model; Programming paradigm; Software engineering; Theoretical computer science; Software; Software development; Software design","authors":[{"name":"Dhrubajyoti Goswami","is_ca":true},{"name":"Ajit Singh","is_ca":true},{"name":"Bruno R. Preiss","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03132999815766805,"gpt":0.2471270862060202,"spread":0.2157970880483522,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001950678,0.0006836245,0.0004572163,0.001473398,0.00115627,0.003603117,0.001195746,0.001500121,0.007237901],"category_scores_gemma":[0.01249113,0.001349474,0.0007599497,0.001491943,0.003452718,0.009368193,0.002114678,0.002328575,0.001686918],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008769592,"about_ca_system_score_gemma":0.001408527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001498288,"about_ca_topic_score_gemma":0.002462992,"domain_scores_codex":[0.9983664,0.0005871648,0.0001678685,0.0003066598,0.0004564043,0.0001154982],"domain_scores_gemma":[0.9942484,0.002628761,0.000420881,0.001682665,0.0008275326,0.0001917122],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004443007,0.00004865144,0.001423471,0.0002916082,0.0000244287,0.0002999432,0.001630699,0.01114976,0.002290137,0.852439,0.006278349,0.1240795],"study_design_scores_gemma":[0.00002554254,0.00003736372,0.0003193197,0.0001572021,0.00003885675,0.0003202727,0.0005605018,0.03508589,0.002170121,0.9047926,0.05647113,0.00002128194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02522771,0.0007527341,0.9459721,0.002575832,0.0001422941,0.0001297026,0.0002447831,0.001848494,0.02310634],"genre_scores_gemma":[0.2814645,0.001628113,0.696833,0.000566798,0.0001070109,0.0003282538,0.0008574416,0.001531548,0.01668348],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007237901,"threshold_uncertainty_score":0.02421325,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4224096756","doi":"10.1016/j.jpdc.2022.04.012","title":"Coordinate-based efficient indexing mechanism for intelligent IoT systems in heterogeneous edge computing","year":2022,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Edge computing; Enhanced Data Rates for GSM Evolution; Computer network; Search engine indexing; Latency (audio); Server; Edge device; Distributed computing; Node (physics); Cloud computing; Operating system","authors":[{"name":"Songtao Tang","is_ca":false},{"name":"Xin Du","is_ca":false},{"name":"Zhihui Lu","is_ca":false},{"name":"Keke Gai","is_ca":false},{"name":"Jie Wu","is_ca":false},{"name":"Patrick C. K. Hung","is_ca":true},{"name":"Kim‐Kwang Raymond Choo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02255559393046631,"gpt":0.2466381871917921,"spread":0.2240825932613258,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008896798,0.0006178162,0.001186033,0.001464154,0.001874738,0.003315467,0.002744065,0.0007793888,0.004293081],"category_scores_gemma":[0.002165459,0.000356377,0.0004080046,0.001915344,0.0005935636,0.003461686,0.002093256,0.0006761805,0.001458358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001101807,"about_ca_system_score_gemma":0.001623867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003351191,"about_ca_topic_score_gemma":0.003320595,"domain_scores_codex":[0.9990953,0.0001224362,0.0001076647,0.0001840385,0.0003159881,0.0001745876],"domain_scores_gemma":[0.9982798,0.00021246,0.0001354676,0.000732953,0.0005089801,0.0001303441],"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.003318706,0.001141139,0.0114294,0.0005550913,0.0003241786,0.001171036,0.001559876,0.106054,0.1848923,0.1909135,0.05167139,0.4469693],"study_design_scores_gemma":[0.0001556986,0.0003642027,0.002054361,0.00002404734,0.0001958738,0.0005013282,0.0003884331,0.8786778,0.06958387,0.02760396,0.02033792,0.0001125509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1266539,0.001324281,0.8453172,0.0003769362,0.0003724176,0.0003218693,0.0006733201,0.01072593,0.0142342],"genre_scores_gemma":[0.8903482,0.0002887579,0.102912,0.0001121282,0.0001206752,0.0001393271,0.0008688382,0.0002155135,0.004994552],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004293081,"threshold_uncertainty_score":0.0143618,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2052478271","doi":"10.1016/j.jpdc.2010.05.007","title":"Distributed hierarchical search for balanced energy consumption routing spanning trees in wireless sensor networks","year":2010,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University; Acadia University","funders":"","keywords":"Computer science; Spanning tree; Wireless sensor network; Minimum spanning tree; Routing (electronic design automation); Kruskal's algorithm; Energy consumption; Heuristic; Distributed minimum spanning tree; Cluster analysis; Tree (set theory); Hierarchical routing; Distributed computing; Connected dominating set; Degree (music); Routing protocol; Static routing; Algorithm; Computer network; Mathematics","authors":[{"name":"Andrei Gagarin","is_ca":true},{"name":"Sajid Hussain","is_ca":false},{"name":"Laurence T. Yang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01541678113930638,"gpt":0.2589145652732349,"spread":0.2434977841339285,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001190559,0.000464967,0.001173087,0.0008603192,0.0007584644,0.0007728279,0.001331273,0.0008500796,0.00165407],"category_scores_gemma":[0.004631613,0.0004797667,0.0003633283,0.001267011,0.0005115321,0.00145784,0.001296199,0.0005012134,0.0002285843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008992476,"about_ca_system_score_gemma":0.001214952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002943305,"about_ca_topic_score_gemma":0.004892697,"domain_scores_codex":[0.9994292,0.0001808041,0.00003675754,0.0001038996,0.0001681238,0.00008117617],"domain_scores_gemma":[0.9988307,0.0006987413,0.00009816641,0.0001236373,0.0001841031,0.0000647131],"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.0004356517,0.0001261447,0.0009557954,0.000122354,0.00005843771,0.00005890374,0.0001641917,0.8903367,0.005689644,0.01587346,0.002443308,0.08373535],"study_design_scores_gemma":[0.00003063026,0.00003495038,0.00009376874,0.000003019963,0.000007495238,0.00001080704,0.00001814805,0.9943135,0.000437164,0.004881402,0.0001664461,0.000002845997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1172351,0.0007291477,0.8780531,0.000460948,0.00006933092,0.0001189169,0.0001512892,0.0004615179,0.002720539],"genre_scores_gemma":[0.8043845,0.000216704,0.1925849,0.0001020688,0.0000434455,0.0001725877,0.0002707893,0.00007359242,0.002151313],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002943305,"threshold_uncertainty_score":0.006524503,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1700848872","doi":"10.1016/j.jpdc.2008.03.002","title":"Computing all the best swap edges distributively","year":2008,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Computer science; Swap (finance); Computation; Routing (electronic design automation); Distributed computing; Computer network; Algorithm","authors":[{"name":"Paola Flocchini","is_ca":true},{"name":"Linda Pagli","is_ca":false},{"name":"Giuseppe Prencipe","is_ca":false},{"name":"Nicola Santoro","is_ca":true},{"name":"Peter Widmayer","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0480711353341684,"gpt":0.2724358145048312,"spread":0.2243646791706628,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002342226,0.001396776,0.002231397,0.001432904,0.002592278,0.003527367,0.003742939,0.001681414,0.0113117],"category_scores_gemma":[0.009210936,0.001197386,0.001309491,0.003157456,0.00226718,0.006660556,0.002860924,0.002123896,0.001835742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001704965,"about_ca_system_score_gemma":0.004130426,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002596582,"about_ca_topic_score_gemma":0.009940309,"domain_scores_codex":[0.9972595,0.000674071,0.0001765056,0.0006525714,0.0006411129,0.0005961968],"domain_scores_gemma":[0.9929395,0.00312627,0.0003249265,0.002466877,0.0007821588,0.000360275],"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.00369119,0.001440996,0.005219139,0.0005217529,0.0003953521,0.0002945143,0.000596409,0.373371,0.02854624,0.08259413,0.02167088,0.4816585],"study_design_scores_gemma":[0.0004050051,0.0002634373,0.0007495704,0.00003657149,0.0002380882,0.0001971864,0.0005577021,0.6882419,0.02448456,0.2791237,0.005654893,0.00004754254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3689837,0.0006487458,0.5942453,0.002608568,0.0004239593,0.0005749913,0.000873405,0.003643478,0.02799798],"genre_scores_gemma":[0.5508366,0.0002607177,0.4313015,0.0005646116,0.0001464977,0.0002097515,0.001126116,0.0008034448,0.01475085],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0113117,"threshold_uncertainty_score":0.03784144,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969255113","doi":"10.1016/j.jpdc.2013.10.002","title":"Research on the conjugate gradient algorithm with a modified incomplete Cholesky preconditioner on GPU","year":2013,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Arctic Goose Joint Venture","keywords":"Cholesky decomposition; Preconditioner; Computer science; Conjugate gradient method; Incomplete Cholesky factorization; Kernel (algebra); Parallel computing; Algorithm; Multiplication (music); Matrix (chemical analysis); Sparse matrix; Mathematics; Iterative method; Eigenvalues and eigenvectors; Combinatorics","authors":[{"name":"Jiaquan Gao","is_ca":false},{"name":"Ronghua Liang","is_ca":false},{"name":"Jun Wang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04024971374101494,"gpt":0.2879158922448778,"spread":0.2476661785038629,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005801014,0.0005682064,0.000793255,0.0006500825,0.0005291072,0.0009003432,0.0009561527,0.0008478456,0.004040418],"category_scores_gemma":[0.002472611,0.0003785581,0.0006444471,0.001479449,0.0006550312,0.001792224,0.0005849434,0.0011867,0.0008126542],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004789239,"about_ca_system_score_gemma":0.001669734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008556231,"about_ca_topic_score_gemma":0.00492163,"domain_scores_codex":[0.999437,0.0001597097,0.00002321378,0.0001008367,0.0002315529,0.00004756245],"domain_scores_gemma":[0.9991222,0.000219345,0.00004211026,0.0001390029,0.0004186189,0.00005861035],"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.0005964934,0.0003138962,0.005102898,0.0008569549,0.0003121031,0.0003172079,0.0003620193,0.3107463,0.05578336,0.1826967,0.0188886,0.4240235],"study_design_scores_gemma":[0.00006150844,0.00007955086,0.0007375827,0.00002825485,0.00003297963,0.00007773113,0.00003567527,0.9648211,0.008838184,0.01275651,0.01250125,0.00002962255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04550286,0.003884603,0.9298332,0.001460992,0.0007408024,0.0001080027,0.0001102035,0.0008930446,0.01746634],"genre_scores_gemma":[0.3800877,0.003976304,0.5952314,0.0004348318,0.0005943013,0.0001486999,0.0003316446,0.0005775045,0.01861765],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008556231,"threshold_uncertainty_score":0.01701283,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W599153350","doi":"10.1016/j.jpdc.2015.06.004","title":"Tradeoffs between cost and information for rendezvous and treasure hunt","year":2015,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Rendezvous; Treasure; Computer science; Traverse; Advice (programming); Upper and lower bounds; Enhanced Data Rates for GSM Evolution; Node (physics); A priori and a posteriori; Situated; Network topology; Topology (electrical circuits); Combinatorics; Computer network; Mathematics; Telecommunications; Artificial intelligence; Physics","authors":[{"name":"Avery Miller","is_ca":true},{"name":"Andrzej Pelc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05024629657989928,"gpt":0.2861500957210397,"spread":0.2359037991411404,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003810421,0.0007794392,0.00173376,0.001976399,0.001047005,0.003334146,0.002388825,0.002830536,0.01200407],"category_scores_gemma":[0.04361625,0.0007884552,0.0006367672,0.001536663,0.001979572,0.008048253,0.0025412,0.001528083,0.001097052],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00138525,"about_ca_system_score_gemma":0.001259165,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002252063,"about_ca_topic_score_gemma":0.002809712,"domain_scores_codex":[0.9977731,0.0007340461,0.00009257967,0.0002398544,0.0006162517,0.0005441516],"domain_scores_gemma":[0.9552994,0.03809109,0.001200701,0.002843973,0.001600256,0.0009645071],"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.006876255,0.0004252289,0.006020481,0.0006141869,0.000190206,0.0005680511,0.0004842606,0.599772,0.01743885,0.2160017,0.004118498,0.1474904],"study_design_scores_gemma":[0.0002310514,0.0006060215,0.003924481,0.00007982409,0.0001374325,0.0006362205,0.0005296423,0.8318446,0.008117717,0.151992,0.001777464,0.0001235964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7097361,0.004051663,0.2169172,0.003777986,0.00023696,0.0001484482,0.000567237,0.001162187,0.06340219],"genre_scores_gemma":[0.9865566,0.0003021457,0.01038799,0.00005299292,0.00004030124,0.00002128576,0.00008202617,0.0001106342,0.002446002],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01200407,"threshold_uncertainty_score":0.04015762,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977083128","doi":"10.1016/j.jpdc.2011.10.013","title":"Microwave tomography for breast cancer detection on Cell broadband engine processors","year":2011,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Microwave Imaging and Scattering Analysis","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"University of Manitoba; Georgia Institute of Technology","keywords":"Computer science; Parallel computing; SIMD; Algorithm; Finite-difference time-domain method; Asynchronous communication; Computation; Node (physics); Distributed memory; Shared memory; Telecommunications; Optics","authors":[{"name":"Meilian Xu","is_ca":true},{"name":"Parimala Thulasiraman","is_ca":true},{"name":"Sima Noghanian","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01076360498594595,"gpt":0.2071658328064272,"spread":0.1964022278204812,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001918834,0.0001965997,0.0002023925,0.0001812376,0.0001547737,0.0003608022,0.0003243898,0.000246328,0.003235636],"category_scores_gemma":[0.000853756,0.0001397786,0.0001064095,0.0003120215,0.0001127282,0.0005298462,0.0002773117,0.0002142047,0.000505927],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001930009,"about_ca_system_score_gemma":0.0002896664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005628553,"about_ca_topic_score_gemma":0.001995369,"domain_scores_codex":[0.9999106,0.00002891548,0.000004343856,0.00001110964,0.00003351482,0.00001156434],"domain_scores_gemma":[0.9997795,0.0001285097,0.00001376815,0.00002248434,0.00004626617,0.000009392196],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00314965,0.0001722699,0.01018621,0.000229308,0.0001315456,0.0004749429,0.0002654164,0.07597543,0.6367795,0.01272936,0.004853558,0.2550527],"study_design_scores_gemma":[0.0001016004,0.0004145536,0.005122015,0.00002203052,0.0001092891,0.0003504143,0.0001610167,0.7632626,0.2222065,0.002769967,0.005461058,0.00001893204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6334274,0.0006463571,0.3548783,0.0004732033,0.00005910603,0.0000600984,0.0001670518,0.0008771481,0.009411269],"genre_scores_gemma":[0.8986798,0.0002595599,0.09599359,0.00009911492,0.00001608689,0.00004384955,0.0001380454,0.00004570316,0.004724273],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003235636,"threshold_uncertainty_score":0.01082426,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2164426675","doi":"10.1006/jpdc.2001.1789","title":"A Genetic Algorithm for Finding the Pagenumber of Interconnection Networks","year":2002,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa; University of Waterloo; Nortel (Canada)","funders":"","keywords":"Computer science; Interconnection; Genetic algorithm; Parallel computing; Algorithm; Computer network; Machine learning","authors":[{"name":"Nidhi Kapoor","is_ca":true},{"name":"Mark Russell","is_ca":true},{"name":"Ivan Stojmenović","is_ca":true},{"name":"Albert Y. Zomaya","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02333325426687188,"gpt":0.2493409548879686,"spread":0.2260077006210968,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009833791,0.001044604,0.001260018,0.002397963,0.001036425,0.001171819,0.00181104,0.002730768,0.003733279],"category_scores_gemma":[0.005548188,0.0008181378,0.0009329945,0.001916474,0.001043203,0.001426197,0.0007411976,0.001230277,0.000622655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001359525,"about_ca_system_score_gemma":0.001601965,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01015439,"about_ca_topic_score_gemma":0.009191088,"domain_scores_codex":[0.9995635,0.000121112,0.00002229592,0.00009685309,0.000148634,0.00004765965],"domain_scores_gemma":[0.9980025,0.001416152,0.0001095017,0.0001081427,0.0003054563,0.00005833979],"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.0001137188,0.0001075436,0.0009889811,0.00006390657,0.00006056856,0.00009063036,0.00009220018,0.7841596,0.002258353,0.0106604,0.002522788,0.1988813],"study_design_scores_gemma":[0.00003555921,0.0000208972,0.0001224053,0.000007979893,0.00001404983,0.00002313555,0.000009864542,0.9935758,0.0004425301,0.005327821,0.0004130489,0.000006911615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02538932,0.0003722746,0.9695845,0.0002463891,0.0001110521,0.0001069989,0.00008682516,0.001066766,0.003035829],"genre_scores_gemma":[0.1626133,0.0001901738,0.8329681,0.0001553635,0.00006969304,0.0002613142,0.0002037251,0.0001680842,0.003370354],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01015439,"threshold_uncertainty_score":0.0201906,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4392135566","doi":"10.1016/j.jpdc.2024.104866","title":"HoneyTwin: Securing smart cities with machine learning-enabled SDN edge and cloud-based honeypots","year":2024,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Honeypot; Computer science; Cloud computing; Enhanced Data Rates for GSM Evolution; Edge computing; Computer security; Computer network; Operating system; Artificial intelligence","authors":[{"name":"Mohammed M. Alani","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009161460302612013,"gpt":0.2130426484286773,"spread":0.2038811881260653,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008090147,0.0005599719,0.0004943091,0.000486471,0.0005287101,0.001091503,0.0010714,0.0006016633,0.002153307],"category_scores_gemma":[0.001652907,0.0002443297,0.0002450478,0.0003090697,0.0005568903,0.002592392,0.001998511,0.0008689898,0.0004231255],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002744243,"about_ca_system_score_gemma":0.0003403489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006407553,"about_ca_topic_score_gemma":0.001074342,"domain_scores_codex":[0.9993953,0.0001423111,0.00004230753,0.0001311292,0.0001820076,0.0001069679],"domain_scores_gemma":[0.9992146,0.0001951933,0.00007076422,0.0002867466,0.0001196818,0.0001129353],"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.004543478,0.001579984,0.03001602,0.0005769007,0.0007328453,0.002089937,0.001056268,0.1354359,0.1012366,0.03680062,0.06664503,0.6192865],"study_design_scores_gemma":[0.0001969259,0.0006683943,0.004475346,0.00003070553,0.00008717409,0.0004429053,0.0002573734,0.9283478,0.03427097,0.01150191,0.01966928,0.00005120831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5020018,0.001665288,0.4237841,0.001582337,0.001521356,0.0006986077,0.0007672166,0.04627729,0.02170202],"genre_scores_gemma":[0.9648628,0.0001305608,0.03111262,0.0001954204,0.00003959932,0.00006128252,0.0003826017,0.0002047172,0.003010468],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002153307,"threshold_uncertainty_score":0.007203519,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4312083945","doi":"10.1016/j.jpdc.2022.12.002","title":"A federated collaborative recommendation model for privacy-preserving distributed recommender applications based on microservice framework","year":2022,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Science Foundation of Zhejiang Province; Hangzhou Normal University","keywords":"Computer science; Recommender system; Collaborative filtering; Unavailability; Raw data; Server; Collaborative model; World Wide Web","authors":[{"name":"Wenmin Lin","is_ca":false},{"name":"Leng Hui","is_ca":false},{"name":"Ruihan Dou","is_ca":true},{"name":"Lianyong Qi","is_ca":false},{"name":"Zhigeng Pan","is_ca":false},{"name":"Md. Arafatur Rahman","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03254021263764888,"gpt":0.3023896621819635,"spread":0.2698494495443146,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002382119,0.000539888,0.001523291,0.0008472396,0.001618552,0.002437959,0.003714439,0.001650474,0.002997733],"category_scores_gemma":[0.003417695,0.0004083659,0.001189547,0.001725007,0.0007096573,0.003528879,0.002183683,0.001525746,0.0007910478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001231836,"about_ca_system_score_gemma":0.002435671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01369925,"about_ca_topic_score_gemma":0.01591814,"domain_scores_codex":[0.9977875,0.0005595369,0.0001421181,0.0006414067,0.0005771829,0.000292255],"domain_scores_gemma":[0.997858,0.0005138585,0.000142044,0.0006637629,0.0006339593,0.0001884949],"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.0008787017,0.0006464014,0.004011468,0.0001677724,0.0003305012,0.0005939071,0.0004947246,0.6045358,0.007506404,0.1755964,0.01034638,0.1948915],"study_design_scores_gemma":[0.00001056072,0.00003638892,0.0001011473,0.000004070124,0.00002001163,0.00006387459,0.00002648012,0.9864452,0.0005130699,0.01168166,0.001085291,0.00001216033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01982954,0.0002808606,0.9764767,0.000313647,0.00005752927,0.00009108274,0.0001539867,0.0007955072,0.002001038],"genre_scores_gemma":[0.7365434,0.00033783,0.2524822,0.000202241,0.00008847947,0.0001903406,0.0004618271,0.00008751356,0.009606271],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01369925,"threshold_uncertainty_score":0.02723897,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066429853","doi":"10.1016/j.jpdc.2005.10.011","title":"Optimal decision strategies in Byzantine environments","year":2005,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Correctness; Computer science; Probability distribution; Expected value; Set (abstract data type); Optimal decision; Markov decision process; Mathematical optimization; Value (mathematics); Decision rule; Decision problem; Construct (python library); Theoretical computer science; Mathematics; Algorithm; Decision tree; Artificial intelligence; Markov process; Machine learning; Statistics","authors":[{"name":"Michel Paquette","is_ca":true},{"name":"Andrzej Pelc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00963331687269626,"gpt":0.2521058600829257,"spread":0.2424725432102294,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002065875,0.0007988609,0.001337432,0.0007019186,0.001017239,0.003018205,0.001306278,0.001619618,0.004327666],"category_scores_gemma":[0.009311468,0.0005201859,0.0003316537,0.0008335508,0.001371861,0.003745426,0.001879946,0.001502253,0.0005538323],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001099235,"about_ca_system_score_gemma":0.001105914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001711708,"about_ca_topic_score_gemma":0.002053117,"domain_scores_codex":[0.9984123,0.0009388695,0.00005413549,0.0001602552,0.0001435044,0.0002909406],"domain_scores_gemma":[0.9954475,0.003565055,0.0002781429,0.0002039263,0.0002470393,0.0002583846],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009841766,0.0001247821,0.0006016616,0.0001945321,0.00005593603,0.0001886509,0.0005578812,0.4367428,0.001923858,0.5061166,0.003752708,0.04875639],"study_design_scores_gemma":[0.000113606,0.0001022265,0.0001234383,0.0000173101,0.0000183228,0.00004073124,0.0001410892,0.6458379,0.0009490856,0.3503669,0.002272478,0.00001692082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2812473,0.0007472561,0.6855276,0.001930135,0.00008945484,0.0001890003,0.0002170464,0.0004414626,0.02961083],"genre_scores_gemma":[0.8977226,0.0004490179,0.09179948,0.0001301517,0.00004405858,0.0001155818,0.0001017658,0.0001024732,0.00953474],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004327666,"threshold_uncertainty_score":0.01447743,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3196680848","doi":"10.1016/j.jpdc.2021.08.003","title":"Energy efficient spiking neural network processing using approximate arithmetic units and variable precision weights","year":2021,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Advanced Memory and Neural Computing","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea","keywords":"Computer science; Variable (mathematics); Field-programmable gate array; Neuromorphic engineering; Double-precision floating-point format; Artificial neural network; Algorithm; Arbitrary-precision arithmetic; Energy (signal processing); Computation; Computer hardware; Efficient energy use; Parallel computing; Artificial intelligence; Mathematics","authors":[{"name":"Yi Wang","is_ca":true},{"name":"Hao Zhang","is_ca":true},{"name":"Kwang‐Il Oh","is_ca":false},{"name":"Jae‐Jin Lee","is_ca":false},{"name":"Seok‐Bum Ko","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01809231094196755,"gpt":0.232126785407456,"spread":0.2140344744654885,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000179072,0.0002372436,0.0002749096,0.0001633443,0.0002407553,0.0006682391,0.0007240146,0.0003730585,0.00182294],"category_scores_gemma":[0.0007025787,0.0001563964,0.0002127826,0.0003549941,0.0002140398,0.0008086182,0.0004695029,0.0004631434,0.0002556939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003527753,"about_ca_system_score_gemma":0.0003681475,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001083524,"about_ca_topic_score_gemma":0.002792424,"domain_scores_codex":[0.9999119,0.000009809584,0.000006956488,0.00001910087,0.00003916256,0.00001307156],"domain_scores_gemma":[0.999853,0.00004269754,0.00001398043,0.0000326625,0.00004823597,0.000009408181],"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.0004555716,0.0001491263,0.001535451,0.0001941603,0.0001550004,0.0002046996,0.0001441605,0.3274823,0.1819652,0.06240176,0.003360217,0.4219524],"study_design_scores_gemma":[0.00001016859,0.00004124261,0.0002223176,0.000006358701,0.00001528881,0.00004436522,0.00001130867,0.9690385,0.01926933,0.01009923,0.001233731,0.000008232859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.118641,0.0003976303,0.8713111,0.0003643414,0.0001710616,0.00003269243,0.00007927432,0.00076572,0.008237088],"genre_scores_gemma":[0.8512099,0.0001654527,0.1444126,0.0000989251,0.00002676219,0.00003339565,0.00007094402,0.00005763237,0.003924415],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00182294,"threshold_uncertainty_score":0.00609839,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976080115","doi":"10.1006/jpdc.2000.1707","title":"A Case Study in Real-Time Parallel Computation: Correcting Algorithms","year":2001,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Speedup; Computation; Algorithm; Measure (data warehouse); Analysis of parallel algorithms; Parallel algorithm; Representation (politics); Class (philosophy); Theoretical computer science; Parallel computing; Artificial intelligence; Data mining","authors":[{"name":"Stefan D. Bruda","is_ca":true},{"name":"Selim G. Akl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03567379679215091,"gpt":0.3173730342745842,"spread":0.2816992374824333,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002719095,0.0007508165,0.0006292063,0.0009364996,0.00296355,0.002508862,0.002359544,0.006131178,0.004372972],"category_scores_gemma":[0.02176135,0.0003815237,0.0006598661,0.002151087,0.001842426,0.002165828,0.001034065,0.001550779,0.0008900736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001118838,"about_ca_system_score_gemma":0.001543313,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00678619,"about_ca_topic_score_gemma":0.007579106,"domain_scores_codex":[0.9970299,0.001195989,0.0001628806,0.0003239718,0.001020097,0.0002671724],"domain_scores_gemma":[0.9752422,0.01673619,0.0009449031,0.003358335,0.003109579,0.0006088303],"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.002492111,0.001889065,0.03393139,0.001685583,0.0002297046,0.0645581,0.006676109,0.3133791,0.02152327,0.1340155,0.032309,0.3873111],"study_design_scores_gemma":[0.0005707201,0.001068096,0.006994089,0.0002068298,0.0002805076,0.0505698,0.00387708,0.690829,0.09371672,0.05712243,0.09454038,0.0002242552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5690624,0.001498657,0.3859501,0.005681025,0.000379511,0.0004820407,0.0003202423,0.002463322,0.03416277],"genre_scores_gemma":[0.8192135,0.000449497,0.1668403,0.0002351736,0.0001012962,0.0001022261,0.0001331016,0.0003746097,0.01255034],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00678619,"threshold_uncertainty_score":0.01462907,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2811437435","doi":"10.1016/j.jpdc.2018.06.004","title":"Nontrivial and universal helping for wait-free queues and stacks","year":2018,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Israel Science Foundation; Ben-Gurion University of the Negev; University of Toronto","keywords":"Computer science; Queue; Implementation; Set (abstract data type); Priority queue; Stack (abstract data type); Theoretical computer science; Distributed computing; Operating system; Programming language","authors":[{"name":"Hagit Attiya","is_ca":false},{"name":"Armando Castañeda","is_ca":false},{"name":"Danny Hendler","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01242960972444316,"gpt":0.2506142068217256,"spread":0.2381845970972825,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004039144,0.001098468,0.002121988,0.002685699,0.007195715,0.006714118,0.003344833,0.003659901,0.007998612],"category_scores_gemma":[0.02899376,0.001604727,0.002414446,0.002113494,0.009620768,0.01406262,0.01153545,0.005749898,0.001025475],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002851925,"about_ca_system_score_gemma":0.004608839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003432904,"about_ca_topic_score_gemma":0.004187788,"domain_scores_codex":[0.9957729,0.0006872817,0.0003020317,0.0007540018,0.0009388712,0.00154504],"domain_scores_gemma":[0.9779197,0.01052575,0.001691952,0.004707312,0.00206313,0.003092022],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009699534,0.00004315511,0.000470308,0.00003806181,0.00001124472,0.00007295538,0.0005279128,0.001827707,0.0006408809,0.9920107,0.001306337,0.002953849],"study_design_scores_gemma":[0.00003591937,0.00001530439,0.0001298659,0.00001239152,0.00002681494,0.00005976524,0.0001580859,0.01069208,0.0007976972,0.9865143,0.001527129,0.00003072985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5095374,0.0007133218,0.4270706,0.003776538,0.0005402487,0.0002134825,0.0005164354,0.003803588,0.05382854],"genre_scores_gemma":[0.9323542,0.0002627831,0.04932911,0.0005991823,0.0002724539,0.0001719506,0.0002778763,0.0006421204,0.0160903],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007998612,"threshold_uncertainty_score":0.02675802,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2106327684","doi":"10.1016/j.jpdc.2014.08.001","title":"The IceProd framework: Distributed data processing for the IceCube neutrino observatory","year":2014,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Astrophysics and Cosmic Phenomena","field":"Physics and Astronomy","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of Alberta","funders":"Office of Polar Programs; Japan Society for the Promotion of Science; Science and Technology Facilities Council; Natural Sciences and Engineering Research Council of Canada; Knut och Alice Wallenbergs Stiftelse; National Research Foundation of Korea; Fonds Wetenschappelijk Onderzoek; Marsden Fund; Bundesministerium für Bildung und Forschung; Division of Physics; Helmholtz Alliance for Astroparticle Physics; Ruhr-Universität Bochum; Danmarks Grundforskningsfond; National Science Foundation; Belgian Federal Science Policy Office; Deutsche Forschungsgemeinschaft; National Research Foundation; Australian Research Council; Western Canada Research Grid; University of Oxford; Vlaamse regering; Fonds De La Recherche Scientifique - FNRS; Polarforskningssekretariatet; Compute Canada; U.S. Department of Energy; University of Wisconsin-Madison; Vetenskapsrådet; Wisconsin Alumni Research Foundation; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Python (programming language); Neutrino; Computer science; Plug-in; Detector; Physics; Middleware (distributed applications); XML; Data processing; Database; Grid computing; Dark matter; Operating system; Cosmic ray; Grid; Particle physics; Astronomy","authors":[{"name":"M. G. Aartsen","is_ca":false},{"name":"M. Ackermann","is_ca":false},{"name":"J. Adams","is_ca":false},{"name":"J. A. Aguilar","is_ca":false},{"name":"M. Ahlers","is_ca":false},{"name":"D. Altmann","is_ca":false},{"name":"C. Argüelles","is_ca":false},{"name":"J. Auffenberg","is_ca":false},{"name":"X. Bai","is_ca":false},{"name":"M. D. Baker","is_ca":false},{"name":"S. W. Barwick","is_ca":false},{"name":"V. Baum","is_ca":false},{"name":"R. Bay","is_ca":false},{"name":"J. J. Beatty","is_ca":false},{"name":"J. Becker Tjus","is_ca":false},{"name":"K.-H. Becker","is_ca":false},{"name":"S. BenZvi","is_ca":false},{"name":"P. Berghaus","is_ca":false},{"name":"D. Berley","is_ca":false},{"name":"E. Bernardini","is_ca":false},{"name":"A. Bernhard","is_ca":true},{"name":"Dominique Besson","is_ca":false},{"name":"G. Binder","is_ca":false},{"name":"D. Bindig","is_ca":false},{"name":"M. Bissok","is_ca":false},{"name":"E. Blaufuss","is_ca":false},{"name":"J. Blumenthal","is_ca":false},{"name":"D. J. Boersma","is_ca":false},{"name":"C. Böhm","is_ca":false},{"name":"D. Bose","is_ca":false},{"name":"S. Böser","is_ca":false},{"name":"O. Botner","is_ca":false},{"name":"L. Brayeur","is_ca":false},{"name":"H.-P. Bretz","is_ca":true},{"name":"A. M. Brown","is_ca":false},{"name":"R. Bruijn","is_ca":false},{"name":"J. Casey","is_ca":false},{"name":"M. Casier","is_ca":false},{"name":"D. Chirkin","is_ca":false},{"name":"A. Christov","is_ca":false},{"name":"B. Christy","is_ca":false},{"name":"K. Clark","is_ca":true},{"name":"Lew Classen","is_ca":false},{"name":"F. Clevermann","is_ca":false},{"name":"S. Coenders","is_ca":false},{"name":"S. Cohen","is_ca":false},{"name":"D. F. Cowen","is_ca":false},{"name":"A.H. Cruz Silva","is_ca":false},{"name":"M. Danninger","is_ca":false},{"name":"J. Daughhetee","is_ca":false},{"name":"J. C. Davis","is_ca":false},{"name":"M. Day","is_ca":false},{"name":"C. De Clercq","is_ca":false},{"name":"S. De Ridder","is_ca":false},{"name":"P. Desiati","is_ca":false},{"name":"K. D. de Vries","is_ca":false},{"name":"M. de With","is_ca":false},{"name":"T. DeYoung","is_ca":false},{"name":"J. C. Díaz–Vélez","is_ca":false},{"name":"M. Dunkman","is_ca":false},{"name":"R. Eagan","is_ca":false},{"name":"B. Eberhardt","is_ca":false},{"name":"B. Eichmann","is_ca":false},{"name":"J. Eisch","is_ca":false},{"name":"S. Euler","is_ca":false},{"name":"P. A. Evenson","is_ca":false},{"name":"O. Fadiran","is_ca":false},{"name":"A. R. Fazely","is_ca":false},{"name":"Anatoli Fedynitch","is_ca":false},{"name":"J. Feintzeig","is_ca":false},{"name":"T. Feusels","is_ca":false},{"name":"K. Filimonov","is_ca":false},{"name":"C. Finley","is_ca":false},{"name":"T. Fischer-Wasels","is_ca":false},{"name":"S. Flis","is_ca":false},{"name":"A. Franckowiak","is_ca":false},{"name":"K. Frantzen","is_ca":false},{"name":"T. Fuchs","is_ca":false},{"name":"T. K. Gaisser","is_ca":false},{"name":"J. S. Gallagher","is_ca":false},{"name":"L. Gerhardt","is_ca":false},{"name":"L. Gladstone","is_ca":false},{"name":"T. Glüsenkamp","is_ca":false},{"name":"A. Goldschmidt","is_ca":false},{"name":"G. Golup","is_ca":false},{"name":"J.G. Gonzalez","is_ca":false},{"name":"J. A. Goodman","is_ca":false},{"name":"D. Góra","is_ca":false},{"name":"D. T. Grandmont","is_ca":true},{"name":"D. Grant","is_ca":true},{"name":"P. Gretskov","is_ca":false},{"name":"J. C. Groh","is_ca":false},{"name":"A. Groß","is_ca":true},{"name":"C. Ha","is_ca":false},{"name":"A. Haj Ismail","is_ca":false},{"name":"P. Hallen","is_ca":false},{"name":"A. Hallgren","is_ca":false},{"name":"F. Halzen","is_ca":false},{"name":"K. Hanson","is_ca":false},{"name":"D. Hebecker","is_ca":false},{"name":"D. Heereman","is_ca":false},{"name":"D. Heinen","is_ca":false},{"name":"K. Helbing","is_ca":false},{"name":"R. Hellauer","is_ca":false},{"name":"S. Hickford","is_ca":false},{"name":"G. C. Hill","is_ca":false},{"name":"K. D. Hoffman","is_ca":false},{"name":"R. Hoffmann","is_ca":false},{"name":"A. Homeier","is_ca":false},{"name":"K. Hoshina","is_ca":false},{"name":"F. Huang","is_ca":false},{"name":"W. Huelsnitz","is_ca":false},{"name":"P. O. Hulth","is_ca":false},{"name":"K. Hultqvist","is_ca":false},{"name":"S. Hussain","is_ca":false},{"name":"A. Ishihara","is_ca":false},{"name":"E. Jacobi","is_ca":false},{"name":"J. Jacobsen","is_ca":false},{"name":"K. Jagielski","is_ca":false},{"name":"G. S. Japaridze","is_ca":false},{"name":"K. Jero","is_ca":false},{"name":"O. Jlelati","is_ca":false},{"name":"B. Kaminsky","is_ca":false},{"name":"A. Kappes","is_ca":false},{"name":"T. Karg","is_ca":false},{"name":"A. Karle","is_ca":false},{"name":"M. Kauer","is_ca":false},{"name":"J. L. Kelley","is_ca":false},{"name":"J. Kiryluk","is_ca":false},{"name":"J. Kläs","is_ca":false},{"name":"J.-H. Köhne","is_ca":false},{"name":"G. Kohnen","is_ca":false},{"name":"H. Kolanoski","is_ca":false},{"name":"L. Köpke","is_ca":false},{"name":"Claudio Kopper","is_ca":false},{"name":"S. Kopper","is_ca":false},{"name":"D. J. Koskinen","is_ca":false},{"name":"M. Kowalski","is_ca":false},{"name":"M. Krasberg","is_ca":false},{"name":"A. Kriesten","is_ca":false},{"name":"K. Krings","is_ca":false},{"name":"G. Kroll","is_ca":false},{"name":"J. Kunnen","is_ca":false},{"name":"N. Kurahashi","is_ca":false},{"name":"T. Kuwabara","is_ca":false},{"name":"M. Labare","is_ca":false},{"name":"H. Landsman","is_ca":false},{"name":"M. J. Larson","is_ca":false},{"name":"M. Lesiak-Bzdak","is_ca":false},{"name":"M. Leuermann","is_ca":false},{"name":"J. Leute","is_ca":false},{"name":"J. Lünemann","is_ca":false},{"name":"Oscar Macías","is_ca":false},{"name":"J. Madsen","is_ca":false},{"name":"G. Maggi","is_ca":false},{"name":"R. Maruyama","is_ca":false},{"name":"K. Mase","is_ca":false},{"name":"H. S. Matis","is_ca":false},{"name":"F. McNally","is_ca":false},{"name":"K. Meagher","is_ca":false},{"name":"M. Merck","is_ca":false},{"name":"G. Merino","is_ca":false},{"name":"T. Meures","is_ca":false},{"name":"S. Miarecki","is_ca":false},{"name":"E. Middell","is_ca":false},{"name":"N. Milke","is_ca":false},{"name":"J. Miller","is_ca":false},{"name":"L. Mohrmann","is_ca":false},{"name":"T. Montaruli","is_ca":false},{"name":"R. Morse","is_ca":false},{"name":"R. Nahnhauer","is_ca":false},{"name":"Uwe Naumann","is_ca":false},{"name":"Hans Niederhausen","is_ca":false},{"name":"Sarah Nowicki","is_ca":true},{"name":"D. R. Nygren","is_ca":false},{"name":"A. Obertacke","is_ca":false},{"name":"S. Odrowski","is_ca":true},{"name":"A. Olivas","is_ca":false},{"name":"A. Omairat","is_ca":false},{"name":"A. O’Murchadha","is_ca":false},{"name":"L. Paul","is_ca":false},{"name":"Joshua Pepper","is_ca":false},{"name":"C. Pérez de los Heros","is_ca":false},{"name":"C. Pfendner","is_ca":false},{"name":"D. Pieloth","is_ca":false},{"name":"E. Pinat","is_ca":false},{"name":"J. Posselt","is_ca":false},{"name":"P. B. Price","is_ca":false},{"name":"G. T. Przybylski","is_ca":false},{"name":"M. Quinnan","is_ca":false},{"name":"L. Rädel","is_ca":false},{"name":"Ian Rae","is_ca":false},{"name":"M. Rameez","is_ca":false},{"name":"K. Rawlins","is_ca":false},{"name":"P. Redl","is_ca":false},{"name":"R. Reimann","is_ca":false},{"name":"E. Resconi","is_ca":false},{"name":"W. Rhode","is_ca":false},{"name":"M. Ribordy","is_ca":false},{"name":"M. Richman","is_ca":false},{"name":"Benedikt Riedel","is_ca":false},{"name":"J. P. Rodrigues","is_ca":false},{"name":"C. Rott","is_ca":false},{"name":"T. Ruhe","is_ca":false},{"name":"B. Ruzybayev","is_ca":false},{"name":"D. Ryckbosch","is_ca":false},{"name":"S. M. Saba","is_ca":false},{"name":"H. G. Sander","is_ca":false},{"name":"M. Santander","is_ca":false},{"name":"S. Sarkar","is_ca":false},{"name":"K. Schatto","is_ca":false},{"name":"F. Scheriau","is_ca":false},{"name":"T. Schmidt","is_ca":false},{"name":"M. Schmitz","is_ca":false},{"name":"S. Schoenen","is_ca":false},{"name":"S. Schöneberg","is_ca":false},{"name":"A. Schönwald","is_ca":true},{"name":"A. Schukraft","is_ca":false},{"name":"L. Schulte","is_ca":false},{"name":"David Schultz","is_ca":false},{"name":"O. Schulz","is_ca":true},{"name":"D. Seckel","is_ca":false},{"name":"Y. Sestayo","is_ca":false},{"name":"S. Seunarine","is_ca":false},{"name":"R. Shanidze","is_ca":false},{"name":"C. Sheremata","is_ca":true},{"name":"M.W.E. Smith","is_ca":false},{"name":"Dennis Soldin","is_ca":false},{"name":"G. M. Spiczak","is_ca":false},{"name":"Christian Spiering","is_ca":false},{"name":"M. Stamatikos","is_ca":false},{"name":"Todor Stanev","is_ca":false},{"name":"N. A. Stanisha","is_ca":false},{"name":"A. Stasik","is_ca":false},{"name":"T. Stezelberger","is_ca":false},{"name":"R. G. Stokstad","is_ca":false},{"name":"A. Stößl","is_ca":true},{"name":"E. A. Strahler","is_ca":false},{"name":"L. R. Strom","is_ca":false},{"name":"N. L. Strotjohann","is_ca":false},{"name":"G. W. Sullivan","is_ca":false},{"name":"H. Taavola","is_ca":false},{"name":"I. Taboada","is_ca":false},{"name":"A. Tamburro","is_ca":false},{"name":"A. Tepe","is_ca":false},{"name":"S. Ter–Antonyan","is_ca":false},{"name":"G. Tešić","is_ca":false},{"name":"S. Tilav","is_ca":false},{"name":"P. A. Toale","is_ca":false},{"name":"M. N. Tobin","is_ca":false},{"name":"S. Toscano","is_ca":false},{"name":"M. Tselengidou","is_ca":false},{"name":"E. Unger","is_ca":false},{"name":"M. Usner","is_ca":false},{"name":"S. Vallecorsa","is_ca":false},{"name":"N. van Eijndhoven","is_ca":false},{"name":"A. Van Overloop","is_ca":false},{"name":"J. V. Santen","is_ca":false},{"name":"M. Vehring","is_ca":false},{"name":"M. Vöge","is_ca":false},{"name":"M. Vraeghe","is_ca":false},{"name":"C. Walck","is_ca":false},{"name":"T. Waldenmaier","is_ca":false},{"name":"M. Wallraff","is_ca":false},{"name":"Ch. Weaver","is_ca":false},{"name":"M. Wellons","is_ca":false},{"name":"Chris Wendt","is_ca":false},{"name":"S. Westerhoff","is_ca":false},{"name":"N. Whitehorn","is_ca":false},{"name":"K. Wiebe","is_ca":false},{"name":"C. H. Wiebusch","is_ca":false},{"name":"D. R. Williams","is_ca":false},{"name":"H. Wissing","is_ca":false},{"name":"M. Wolf","is_ca":false},{"name":"T. R. Wood","is_ca":true},{"name":"K. Woschnagg","is_ca":false},{"name":"Dawei Xu","is_ca":false},{"name":"Xiaolin Xu","is_ca":true},{"name":"G. Yodh","is_ca":false},{"name":"S. Yoshida","is_ca":false},{"name":"P. Zarzhitsky","is_ca":false},{"name":"J. Ziemann","is_ca":false},{"name":"Simon Zierke","is_ca":false},{"name":"M. Zoll","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02910911558188022,"gpt":0.2749389550856061,"spread":0.2458298395037258,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003584747,0.002551229,0.001837219,0.00117103,0.001132718,0.003563892,0.005654083,0.001303794,0.01239734],"category_scores_gemma":[0.006048407,0.00127226,0.001979769,0.001771525,0.001438402,0.003164127,0.003486448,0.002879204,0.004984811],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001882517,"about_ca_system_score_gemma":0.004303597,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02624035,"about_ca_topic_score_gemma":0.02034806,"domain_scores_codex":[0.9982176,0.0003764708,0.00009789418,0.0004070692,0.0006669635,0.0002339066],"domain_scores_gemma":[0.9980452,0.000395882,0.00008851739,0.0006508623,0.0004881698,0.0003313869],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.004837675,0.0006924635,0.01031898,0.001224962,0.001279428,0.0006785949,0.001022668,0.1861391,0.02684234,0.05262955,0.4443876,0.2699467],"study_design_scores_gemma":[0.001328633,0.0001728434,0.001799762,0.0001149459,0.0001343229,0.0001101699,0.0001349217,0.812232,0.01826528,0.04264001,0.1228952,0.0001719447],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.01670505,0.001302077,0.7048513,0.0009530648,0.0007219823,0.000549851,0.01815461,0.2445638,0.01219828],"genre_scores_gemma":[0.2367843,0.001160782,0.6452446,0.001094133,0.0003839841,0.001264249,0.07283217,0.03150984,0.00972601],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.02624035,"threshold_uncertainty_score":0.05217522,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2896639624","doi":"10.1016/j.jpdc.2018.10.004","title":"Automatic generation of benchmarks for I/O-intensive parallel applications","year":2018,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University","funders":"University of Illinois at Urbana-Champaign; National Natural Science Foundation of China","keywords":"Computer science; Parallel computing; Benchmark (surveying); TRACE (psycholinguistics); Computation; Supercomputer; Overhead (engineering); Parallel I/O; Parallel algorithm; Algorithm; Programming language","authors":[{"name":"Meng Hao","is_ca":false},{"name":"Weizhe Zhang","is_ca":false},{"name":"You Zhang","is_ca":false},{"name":"Marc Snir","is_ca":false},{"name":"Laurence T. Yang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03221570556506162,"gpt":0.2941877268886827,"spread":0.2619720213236211,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006797411,0.001975519,0.0007848413,0.00213033,0.0006527677,0.001050051,0.001861599,0.0006991843,0.006147579],"category_scores_gemma":[0.005402691,0.0006237901,0.0006328573,0.001371523,0.0003629729,0.0009802259,0.0009975244,0.0009540352,0.001693613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006021807,"about_ca_system_score_gemma":0.001556555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002813967,"about_ca_topic_score_gemma":0.00358743,"domain_scores_codex":[0.9991822,0.0001771365,0.00007381431,0.0001781224,0.0002545216,0.0001341561],"domain_scores_gemma":[0.9969642,0.001127308,0.0002206602,0.0004280863,0.001093606,0.0001661297],"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.003659729,0.0009464222,0.01528499,0.001426432,0.0001913783,0.001390457,0.0005950177,0.09837985,0.2177374,0.01127922,0.07647517,0.5726339],"study_design_scores_gemma":[0.0004295255,0.0004965034,0.005495129,0.00006991925,0.00009697435,0.0002473921,0.000241574,0.8059148,0.1580795,0.007763588,0.02109885,0.00006625683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4284993,0.001237429,0.4379292,0.0005769558,0.0007362337,0.0008438917,0.007495636,0.1068777,0.01580369],"genre_scores_gemma":[0.6489691,0.0002955282,0.3178433,0.0001960862,0.0001083596,0.000860089,0.02074335,0.00775386,0.003230341],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006147579,"threshold_uncertainty_score":0.02056575,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2181650317","doi":"10.1016/j.jpdc.2015.10.006","title":"Black hole search in computer networks: State-of-the-art, challenges and future directions","year":2015,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Correctness; Asynchronous communication; Black hole (networking); Node (physics); Focus (optics); TRACE (psycholinguistics); Process (computing); Black box; State (computer science); Distributed computing; Neighbor Discovery Protocol; Computer network; Artificial intelligence; World Wide Web; The Internet; Algorithm","authors":[{"name":"Mengfei Peng","is_ca":true},{"name":"Wei Shi","is_ca":true},{"name":"Jean‐Pierre Corriveau","is_ca":true},{"name":"Richard W. Pazzi","is_ca":true},{"name":"Yang Wang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02582787311008855,"gpt":0.2488118197902986,"spread":0.2229839466802101,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005956089,0.000829524,0.002727194,0.001531847,0.001254546,0.006174139,0.003695735,0.004958571,0.006403642],"category_scores_gemma":[0.01433882,0.0006270327,0.0008530034,0.00301069,0.005899936,0.01681525,0.00323421,0.003780846,0.001170683],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001587979,"about_ca_system_score_gemma":0.002346337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00269697,"about_ca_topic_score_gemma":0.002595569,"domain_scores_codex":[0.9976469,0.001029534,0.00008657906,0.0003610211,0.0005594239,0.0003164998],"domain_scores_gemma":[0.9790502,0.01723085,0.0006187598,0.0009134644,0.001530458,0.0006562824],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004726253,0.0003829119,0.003278105,0.003445364,0.0002330678,0.0001529454,0.0004356977,0.06365712,0.0006864925,0.4856832,0.03460219,0.4069702],"study_design_scores_gemma":[0.00005381741,0.0001017275,0.000413071,0.0007062466,0.0000455989,0.0001614127,0.0006264988,0.1509077,0.0004915471,0.8141912,0.03223961,0.00006166049],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.03139032,0.729535,0.1587225,0.04954524,0.00188856,0.00009370532,0.0002067582,0.0005110224,0.02810699],"genre_scores_gemma":[0.4281647,0.4779479,0.07450189,0.004246495,0.005954019,0.0001792107,0.0003806173,0.0001583414,0.008467034],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.006403642,"threshold_uncertainty_score":0.03149915,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2047772825","doi":"10.1006/jpdc.2001.1812","title":"A Parallel Algorithm for Lagrange Interpolation on the Star Graph","year":2002,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Initialization; Algorithm; Computation; Star (game theory); Lagrange polynomial; Interpolation (computer graphics); Multiplication (music); Graph; Parallel computing; Theoretical computer science; Mathematics; Class (philosophy)","authors":[{"name":"Hamid Sarbazi‐Azad","is_ca":false},{"name":"M. Ould‐Khaoua","is_ca":false},{"name":"Lewis Mackenzie","is_ca":false},{"name":"Selim G. Akl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0310953398422998,"gpt":0.2434343841298729,"spread":0.2123390442875731,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009507001,0.00078843,0.001358735,0.001110271,0.000938107,0.00080391,0.001809912,0.0009324898,0.009282446],"category_scores_gemma":[0.002609951,0.0006128314,0.0009375017,0.001844829,0.0007544664,0.001500558,0.00242259,0.001845063,0.002205436],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008110764,"about_ca_system_score_gemma":0.001860993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006565074,"about_ca_topic_score_gemma":0.009356464,"domain_scores_codex":[0.9995424,0.0001240511,0.00002339062,0.00009012869,0.0001596991,0.00006050106],"domain_scores_gemma":[0.9991807,0.0003631753,0.00003588597,0.0001679476,0.0001928814,0.0000594829],"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.0005720506,0.0002116853,0.0006848118,0.0001959926,0.0001048937,0.0001567446,0.0001922033,0.3270192,0.008551396,0.113151,0.01174428,0.5374158],"study_design_scores_gemma":[0.00009567458,0.00005907412,0.00008411305,0.000009754674,0.00001334124,0.00004086937,0.0000245293,0.9540817,0.002076156,0.0396459,0.003853298,0.00001555441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004360712,0.00006071509,0.9933123,0.00008967744,0.0000673036,0.00004340991,0.00005186901,0.0004628489,0.001551145],"genre_scores_gemma":[0.05851111,0.0001027925,0.9369697,0.00005697898,0.00005973488,0.0001356993,0.0002082867,0.0002431598,0.003712597],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009282446,"threshold_uncertainty_score":0.03105283,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4306935880","doi":"10.1016/j.jpdc.2022.09.014","title":"Special issue on Distributed Intelligence at the Edge for the Future Internet of Things","year":2022,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brandon University","funders":"","keywords":"Computer science; Exploit; Workload; Distributed computing; Initialization; A priori and a posteriori; Residual; Stream processing; Machine learning; Algorithm; Operating system","authors":[{"name":"Andrzej Gościński","is_ca":false},{"name":"Flávia C. Delicato","is_ca":false},{"name":"Giancarlo Fortino","is_ca":false},{"name":"Anna Kobusińska","is_ca":false},{"name":"Gautam Srivastava","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01676486155046227,"gpt":0.2555267494951793,"spread":0.2387618879447171,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00254102,0.002211653,0.003020839,0.003061629,0.00186469,0.007342301,0.002376522,0.005120461,0.1044609],"category_scores_gemma":[0.00376467,0.0007403021,0.001754392,0.001963931,0.001070712,0.00444672,0.002146536,0.004566188,0.04000079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001404838,"about_ca_system_score_gemma":0.002240285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007967896,"about_ca_topic_score_gemma":0.00204703,"domain_scores_codex":[0.998261,0.0001663299,0.0001525907,0.0003107263,0.0008759982,0.0002334013],"domain_scores_gemma":[0.9932544,0.001424602,0.0005123366,0.0003942359,0.00266174,0.001752691],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006768752,0.00005589236,0.0001077042,0.0004008798,0.00002402351,0.0001132607,0.00001111037,0.0001355651,0.0005047675,0.001811685,0.9733507,0.02341668],"study_design_scores_gemma":[0.00002568152,0.0001082324,0.0005724347,0.0002148602,0.00002970227,0.0001899721,0.00002152416,0.0004303395,0.0002521319,0.002295453,0.9958436,0.00001610301],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.0003756256,0.01198489,0.001460221,0.01399405,0.9377477,0.0001510621,0.0004239795,0.0002388405,0.0336236],"genre_scores_gemma":[0.002088406,0.01470534,0.0006782748,0.006981774,0.8555751,0.0001057292,0.0009731812,0.0002728875,0.1186194],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.1044609,"threshold_uncertainty_score":0.3494564,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4210651592","doi":"10.1016/j.jpdc.2022.01.011","title":"An efficient heuristic switch migration scheme for software-defined vehicular networks","year":2022,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Scheme (mathematics); Heuristic; Software; Distributed computing; Parallel computing; Computer network; Operating system; Artificial intelligence","authors":[{"name":"Noura Aljeri","is_ca":true},{"name":"Azzedine Boukerche","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007335743963057301,"gpt":0.2169336025473463,"spread":0.2095978585842889,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004538043,0.000826134,0.001150961,0.0007505807,0.001084651,0.0008442646,0.001593392,0.0004879871,0.001693191],"category_scores_gemma":[0.0009508791,0.0002524018,0.0003747236,0.0006856096,0.0003256348,0.000705581,0.0007989244,0.000520648,0.0002596222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007932471,"about_ca_system_score_gemma":0.001430417,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004564915,"about_ca_topic_score_gemma":0.007928234,"domain_scores_codex":[0.9995813,0.00009846491,0.00003194622,0.00007393018,0.00009776399,0.0001167321],"domain_scores_gemma":[0.9995323,0.0001430576,0.00004756549,0.00008388697,0.0001319805,0.00006117335],"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.001432581,0.0005748964,0.002101057,0.0002038363,0.0001941948,0.0002824826,0.0002119396,0.5318498,0.0421862,0.0108168,0.00971754,0.4004288],"study_design_scores_gemma":[0.00004738444,0.000161584,0.0003010811,0.000006219867,0.00002982949,0.00007357897,0.0000652516,0.9937716,0.002670788,0.001800133,0.001058784,0.00001381025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2125384,0.001188243,0.7756516,0.0004349017,0.0007744965,0.0003819099,0.000184935,0.002313862,0.006531696],"genre_scores_gemma":[0.9040071,0.0001752878,0.09372833,0.00007651805,0.00004283939,0.00008195656,0.0001760282,0.00003461514,0.001677365],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004564915,"threshold_uncertainty_score":0.009076655,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4309261811","doi":"10.1016/j.jpdc.2022.10.012","title":"Performance analysis of DPDK-based applications through tracing","year":2022,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Tracing; Parallel computing; Operating system","authors":[{"name":"Adel Belkhiri","is_ca":true},{"name":"Martin Pépin","is_ca":false},{"name":"Mike Bly","is_ca":false},{"name":"Michel Dagenais","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01404652098271776,"gpt":0.2547187242170605,"spread":0.2406722032343428,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001314249,0.0007729694,0.0005897729,0.001439001,0.0007852408,0.001391835,0.001505386,0.0006380408,0.001952487],"category_scores_gemma":[0.007131145,0.0003375822,0.0003155629,0.001527025,0.0006858311,0.001120527,0.000888121,0.0009540701,0.000337469],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001435475,"about_ca_system_score_gemma":0.001846193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009076378,"about_ca_topic_score_gemma":0.005533454,"domain_scores_codex":[0.9982715,0.000315497,0.00009638186,0.0002552985,0.0007606346,0.000300633],"domain_scores_gemma":[0.9938304,0.002955219,0.0004441872,0.001398456,0.001124212,0.0002476028],"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.004137871,0.001112149,0.03870598,0.0005745501,0.0002117955,0.000482622,0.0009046717,0.5977403,0.125894,0.01722267,0.004055826,0.2089576],"study_design_scores_gemma":[0.00002472616,0.0001188078,0.001942217,0.000008072382,0.0000238546,0.0000551073,0.00004563983,0.976068,0.01994961,0.00112639,0.0006257572,0.00001195492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9071614,0.0005293466,0.07922591,0.0002320159,0.00006170888,0.00007465656,0.0003128562,0.00660385,0.005798133],"genre_scores_gemma":[0.9841747,0.00007169587,0.0145694,0.00001745361,0.000005128696,0.00001336758,0.0001358044,0.0001706001,0.0008417371],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009076378,"threshold_uncertainty_score":0.01804709,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2931065016","doi":"10.1016/j.jpdc.2019.03.013","title":"INRFlow: An interconnection networks research flow-level simulation framework","year":2019,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Interconnection Networks and Systems","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 Victoria","funders":"Engineering and Physical Sciences Research Council; European Commission","keywords":"Computer science; Network topology; Scalability; Distributed computing; Modular design; Interconnection; Variety (cybernetics); Context (archaeology); Network traffic simulation; Bandwidth (computing); Computer network; Network traffic control","authors":[{"name":"Javier Navaridas","is_ca":false},{"name":"José A. Pascual","is_ca":false},{"name":"Alejandro Erickson","is_ca":true},{"name":"Iain A. Stewart","is_ca":false},{"name":"Mikel Luján","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06974009187274968,"gpt":0.3489167318946917,"spread":0.2791766400219421,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003000519,0.001328396,0.001095651,0.001273461,0.0008912906,0.001857309,0.003858801,0.00168152,0.008294124],"category_scores_gemma":[0.004779158,0.0008493485,0.00207585,0.0008077464,0.00104797,0.002261101,0.001797962,0.002559646,0.001636545],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001845679,"about_ca_system_score_gemma":0.003636033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01204873,"about_ca_topic_score_gemma":0.00721862,"domain_scores_codex":[0.998907,0.000408495,0.00007507761,0.0001298531,0.000346477,0.0001331943],"domain_scores_gemma":[0.9984393,0.0008205991,0.0001276057,0.0001966595,0.0002838378,0.0001320404],"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.00009506473,0.0001066838,0.001004719,0.0002115346,0.00008657492,0.00009055746,0.0001373643,0.8596907,0.002543763,0.09937354,0.01151993,0.02513956],"study_design_scores_gemma":[0.00004310765,0.00002633005,0.00008162728,0.00002943594,0.00001463382,0.00002686058,0.000007993903,0.9630547,0.001030916,0.01376698,0.0218973,0.00002011822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004105262,0.0002682096,0.9773361,0.0002810024,0.000160241,0.0003202847,0.00106598,0.007775874,0.008687132],"genre_scores_gemma":[0.1069311,0.001214864,0.8749093,0.00040487,0.0001636401,0.002036894,0.004340151,0.002352786,0.00764645],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01204873,"threshold_uncertainty_score":0.02774662,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2035937973","doi":"10.1016/j.jpdc.2011.04.003","title":"HD Tree: A novel data structure to support multi-dimensional range query for P2P networks","year":2011,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Distributed computing; Static routing; Range query (database); Routing (electronic design automation); Dynamic Source Routing; Multipath routing; Tree (set theory); Destination-Sequenced Distance Vector routing; Computer network; Routing protocol; Web search query; Mathematics; Sargable; Information retrieval","authors":[{"name":"Yunfeng Gu","is_ca":true},{"name":"Azzedine Boukerche","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09141247208430599,"gpt":0.2974670884671627,"spread":0.2060546163828568,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001112637,0.0006081513,0.001383464,0.001967515,0.001232373,0.002159247,0.003029505,0.001046025,0.004611629],"category_scores_gemma":[0.00444683,0.0005575056,0.0005661036,0.003479039,0.0007108357,0.004692959,0.003617086,0.001247156,0.001880675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000798429,"about_ca_system_score_gemma":0.001443834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004119081,"about_ca_topic_score_gemma":0.004994959,"domain_scores_codex":[0.9988978,0.0001370983,0.0001365105,0.0001421362,0.0005786457,0.0001078561],"domain_scores_gemma":[0.9973428,0.0006397686,0.0001804888,0.00100497,0.0005764067,0.0002556654],"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.001799436,0.0004451182,0.004716108,0.001364766,0.0003008769,0.0005652967,0.0009026251,0.03759218,0.04716906,0.07137518,0.1936735,0.6400959],"study_design_scores_gemma":[0.000586061,0.0006575777,0.002734459,0.0001662336,0.0002916795,0.001224666,0.0005462546,0.6017909,0.04875086,0.08645501,0.2564611,0.0003352626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02248891,0.002420977,0.9335157,0.0009145701,0.0006595243,0.0003757338,0.005781556,0.02746128,0.006381867],"genre_scores_gemma":[0.2948729,0.002252372,0.6670195,0.0009901007,0.0006677198,0.0006630007,0.01899388,0.002390164,0.01215041],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004611629,"threshold_uncertainty_score":0.01542747,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067366494","doi":"10.1016/j.jpdc.2008.01.001","title":"On the complexity and algorithm of grooming regular traffic in WDM optical networks","year":2008,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Traffic grooming; Synchronous optical networking; Computer science; Wavelength-division multiplexing; Multiplexing; Multiplexer; Upper and lower bounds; Algorithm; Channel (broadcasting); Computer network; Time complexity; Wavelength; Mathematics; Telecommunications","authors":[{"name":"Yong Wang","is_ca":true},{"name":"Qian‐Ping Gu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02036499625000479,"gpt":0.2189781675200836,"spread":0.1986131712700789,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003215416,0.001094944,0.001538742,0.001260297,0.001294773,0.003835953,0.002636214,0.002033199,0.00388812],"category_scores_gemma":[0.02464107,0.0009291273,0.0008989495,0.001867851,0.002382849,0.005954209,0.002650713,0.003180492,0.0004754789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003152227,"about_ca_system_score_gemma":0.003327045,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006090962,"about_ca_topic_score_gemma":0.006904489,"domain_scores_codex":[0.9976339,0.0008341327,0.0001139912,0.0002839916,0.0008053841,0.0003285945],"domain_scores_gemma":[0.9705361,0.02508941,0.001093437,0.001426497,0.001302828,0.0005517381],"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.001201583,0.0003415125,0.00373788,0.0002815155,0.00009135597,0.000143504,0.0004469797,0.763905,0.005975282,0.1287399,0.006942669,0.08819285],"study_design_scores_gemma":[0.00004520533,0.00003651059,0.0002523366,0.000009745312,0.00001316858,0.00002646747,0.00003594897,0.9426787,0.0004685844,0.0561232,0.0002978318,0.00001232414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2137938,0.001166412,0.7689468,0.002227993,0.000249637,0.0002452196,0.0003609055,0.0007878866,0.01222122],"genre_scores_gemma":[0.7107812,0.0009928193,0.2795841,0.0004844079,0.0003766955,0.0003049791,0.0006231745,0.0003251765,0.006527385],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006090962,"threshold_uncertainty_score":0.02287108,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2562314876","doi":"10.1016/j.jpdc.2016.12.013","title":"Low latency and division free Gauss–Jordan solver in floating point arithmetic","year":2016,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Gaussian elimination; Latency (audio); Parallel computing; Division (mathematics); Solver; Floating point; Gauss; Field-programmable gate array; Critical path method; Algorithm; Arithmetic; Gaussian; Computer hardware; Mathematics","authors":[{"name":"Jean‐Pierre David","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01159964820655143,"gpt":0.2535385210227733,"spread":0.2419388728162219,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002991419,0.0005803597,0.0006339868,0.0004215968,0.0008611645,0.001167664,0.001200652,0.0005631276,0.006150208],"category_scores_gemma":[0.001932815,0.000293183,0.0002922484,0.0009205732,0.0004812862,0.001260231,0.001127793,0.0008896196,0.002012959],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004595269,"about_ca_system_score_gemma":0.001565868,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002208704,"about_ca_topic_score_gemma":0.003685205,"domain_scores_codex":[0.9994203,0.00008086915,0.00002730491,0.00005419872,0.0003308105,0.00008657495],"domain_scores_gemma":[0.9993405,0.0002071149,0.00005044594,0.0001358197,0.0002201962,0.00004605854],"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.002160719,0.0003856778,0.003134966,0.0006255353,0.0001878745,0.0009419191,0.0006460766,0.2453765,0.09945594,0.1731052,0.02591017,0.4480694],"study_design_scores_gemma":[0.0001311059,0.0001508952,0.0003641641,0.00002585341,0.00003133117,0.000228379,0.00009421686,0.9267669,0.02395018,0.03959907,0.008624846,0.00003310441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08160326,0.0009863133,0.8897858,0.0005958115,0.0003242259,0.0000722992,0.0001798869,0.002217189,0.02423526],"genre_scores_gemma":[0.6018299,0.0004493961,0.3688924,0.0002733381,0.0001705701,0.0001356107,0.0003658137,0.0004665731,0.02741637],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006150208,"threshold_uncertainty_score":0.02057451,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023971739","doi":"10.1016/j.jpdc.2003.06.003","title":"A fine-grain load-adaptive algorithm of the 2D discrete wavelet transform for multithreaded architectures","year":2003,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Multithreading; Computation; Parallel computing; Algorithm; Implementation; Discrete wavelet transform; Multiprocessing; Overhead (engineering); Thread (computing); Wavelet; Wavelet transform","authors":[{"name":"Parimala Thulasiraman","is_ca":true},{"name":"Ashfaq A. Khokhar","is_ca":false},{"name":"Gerd Heber","is_ca":false},{"name":"Guang R. Gao","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02036601986041314,"gpt":0.2751653382257425,"spread":0.2547993183653293,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004640425,0.0004559103,0.0006003847,0.0004458989,0.0005267685,0.0007483927,0.001243237,0.0005864746,0.003852685],"category_scores_gemma":[0.0016937,0.0003973116,0.0003266988,0.0005670668,0.0003565692,0.0009752882,0.0009291198,0.0009608081,0.0007413667],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000523455,"about_ca_system_score_gemma":0.0008584633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003819222,"about_ca_topic_score_gemma":0.007554173,"domain_scores_codex":[0.9997637,0.0000421303,0.00001592758,0.00003893712,0.000107864,0.00003144606],"domain_scores_gemma":[0.9995369,0.0001288932,0.00002381845,0.0001196859,0.0001503615,0.00004034167],"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.0007638865,0.0001948248,0.001578898,0.0001310676,0.00009927102,0.0001360721,0.0002489657,0.2280234,0.08432396,0.02607531,0.01026406,0.6481603],"study_design_scores_gemma":[0.00003075006,0.00003076635,0.0001566136,0.000002904124,0.000007582621,0.00001779998,0.000008661691,0.9902908,0.00457244,0.00319229,0.001680308,0.000009053971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01691424,0.0001386704,0.9803233,0.0001311358,0.0001037829,0.00003550417,0.00002628523,0.001209013,0.00111801],"genre_scores_gemma":[0.1989401,0.000111548,0.796643,0.00009853028,0.00006062424,0.0001284392,0.0001268615,0.0003265894,0.003564245],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003852685,"threshold_uncertainty_score":0.01288855,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023756568","doi":"10.1016/j.jpdc.2007.01.009","title":"QoS and data relaying for wireless sensor networks","year":2007,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Network packet; Quality of service; Energy consumption; Base station; Wireless sensor network; Computer network; Efficient energy use; Distributed computing","authors":[{"name":"Sylvia Tai","is_ca":true},{"name":"Robert Benkoczi","is_ca":true},{"name":"Hossam S. Hassanein","is_ca":true},{"name":"Selim G. Akl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02813664022835643,"gpt":0.2868493204979524,"spread":0.2587126802695959,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002302493,0.0008654651,0.001035198,0.0007815128,0.0008147439,0.002325527,0.001368655,0.001578262,0.003130413],"category_scores_gemma":[0.008803421,0.0005403076,0.0003707347,0.001150042,0.001823253,0.003858068,0.001159769,0.001848583,0.0005238137],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001386964,"about_ca_system_score_gemma":0.0007033974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001469114,"about_ca_topic_score_gemma":0.001500415,"domain_scores_codex":[0.9989339,0.0003219414,0.0000885452,0.0001401562,0.0004079438,0.0001074692],"domain_scores_gemma":[0.9956663,0.002937852,0.0002889784,0.0003989969,0.0005643727,0.0001435133],"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.0003659099,0.00008820471,0.0006971671,0.0004814236,0.00007127316,0.0003588366,0.0003610965,0.1587438,0.008133373,0.6777625,0.01388467,0.1390518],"study_design_scores_gemma":[0.00003335503,0.00007818786,0.000235688,0.0000458115,0.00003693361,0.0002755671,0.00009030627,0.5012563,0.001898666,0.4816792,0.01434044,0.00002944829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02784407,0.02214694,0.9243665,0.008910462,0.002359525,0.0000769753,0.0001860593,0.0003621262,0.01374751],"genre_scores_gemma":[0.858017,0.01965963,0.09606877,0.0007964278,0.003819865,0.0001401603,0.0002393345,0.0002246587,0.02103421],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003130413,"threshold_uncertainty_score":0.01217693,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W242727464","doi":"10.1016/j.jpdc.2012.01.003","title":"Parallel Ant Colony Optimization on Graphics Processing Units","year":2012,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Chicoutimi","funders":"Agence Nationale de la Recherche","keywords":"Ant colony optimization algorithms; Computer science; Graphics; Graphics processing unit; ANT; Computer graphics (images); Parallel metaheuristic; Parallel computing; Metaheuristic; Artificial intelligence; Operating system; Meta-optimization","authors":[{"name":"Audrey Delévacq","is_ca":false},{"name":"Pierre Delisle","is_ca":false},{"name":"Marc Gravel","is_ca":true},{"name":"Michaël Krajecki","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04106945802338342,"gpt":0.2981955138576753,"spread":0.2571260558342919,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003024222,0.0004363373,0.0006427238,0.0003550791,0.0005921376,0.0006781287,0.001165263,0.0008415194,0.003108924],"category_scores_gemma":[0.001532106,0.000359165,0.000448797,0.0007878701,0.0004919012,0.0005427245,0.0007049002,0.0007884244,0.0004210716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007188712,"about_ca_system_score_gemma":0.0009142621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008327765,"about_ca_topic_score_gemma":0.006870685,"domain_scores_codex":[0.9997124,0.0001171407,0.00001003812,0.00003146586,0.00009518665,0.00003368372],"domain_scores_gemma":[0.9995073,0.0002184876,0.00003481057,0.00006221345,0.0001450078,0.00003223304],"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.0002040423,0.00003441809,0.000355292,0.00003971019,0.00002136253,0.00007513302,0.00003642556,0.9584913,0.004745679,0.005576116,0.001659594,0.02876106],"study_design_scores_gemma":[0.00001086828,0.00001331976,0.00004700966,8.808369e-7,0.000002411242,0.000003546917,0.000003625825,0.9982154,0.00039269,0.001081197,0.0002273177,0.00000178162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2003035,0.0006137494,0.7717174,0.0006906966,0.0003805777,0.0001509054,0.00008732067,0.001401532,0.02465444],"genre_scores_gemma":[0.7754428,0.0001831307,0.2167956,0.0001158494,0.00004426572,0.0001632786,0.00007682753,0.0001909805,0.006987209],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008327765,"threshold_uncertainty_score":0.01655859,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4309535831","doi":"10.1016/j.jpdc.2022.11.004","title":"PTTS: Power-aware tensor cores using two-sided sparsity","year":2022,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Computer science; Exploit; Overhead (engineering); Matrix multiplication; Sparse matrix; Power gating; Power (physics); Gating; Tensor (intrinsic definition); Energy (signal processing); Parallel computing; Algorithm; Physics","authors":[{"name":"Ehsan Atoofian","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02530485576936415,"gpt":0.2765003096781075,"spread":0.2511954539087433,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005818218,0.0009336767,0.0006319703,0.0004271998,0.0004964054,0.0008904893,0.001554194,0.0004816187,0.007461879],"category_scores_gemma":[0.002419568,0.000355828,0.0005249787,0.0006386042,0.0005744515,0.001654808,0.001532114,0.001213754,0.001558586],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004233261,"about_ca_system_score_gemma":0.001406433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002534617,"about_ca_topic_score_gemma":0.007741616,"domain_scores_codex":[0.999548,0.00009096881,0.00002475206,0.00006802569,0.0001817972,0.00008631923],"domain_scores_gemma":[0.9991257,0.0001940688,0.00006313412,0.0002759956,0.0002477046,0.00009342905],"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.00145168,0.0004762045,0.00228583,0.0004802311,0.0001917541,0.0003415791,0.0002638307,0.2506431,0.05900036,0.05387893,0.07555921,0.5554273],"study_design_scores_gemma":[0.00007538911,0.0001415598,0.0001895613,0.0000200767,0.00001973624,0.00007758093,0.00005025102,0.963953,0.01181398,0.01740612,0.006228967,0.00002378009],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0331305,0.0004176489,0.9443693,0.0004844953,0.000387863,0.0001367841,0.0004305341,0.008148152,0.01249467],"genre_scores_gemma":[0.4461429,0.0003379199,0.5395051,0.0003747172,0.000143468,0.0002465053,0.001028083,0.001249734,0.01097165],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007461879,"threshold_uncertainty_score":0.02496248,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4292133298","doi":"10.1016/j.jpdc.2022.08.001","title":"Utilization prediction-based VM consolidation approach","year":2022,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; PlanetLab; CloudSim; Cloud computing; Service-level agreement; Workload; Energy consumption; Consolidation (business); Benchmark (surveying); Distributed computing; Real-time computing; Operating system; The Internet","authors":[{"name":"Mirna Awad","is_ca":true},{"name":"Nadjia Kara","is_ca":true},{"name":"Aris Leivadeas","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0273799438588084,"gpt":0.2443415089910739,"spread":0.2169615651322655,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006517575,0.0005544802,0.001006077,0.0008426937,0.000400077,0.0008055522,0.001440289,0.0005189911,0.001763048],"category_scores_gemma":[0.00131851,0.0002884617,0.0004170258,0.0009236271,0.0002513389,0.00102404,0.0005042847,0.0006125467,0.0003500067],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000451655,"about_ca_system_score_gemma":0.001127627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005832397,"about_ca_topic_score_gemma":0.005516463,"domain_scores_codex":[0.9995928,0.00007602209,0.00002475751,0.000106402,0.0001308473,0.00006911032],"domain_scores_gemma":[0.9994476,0.0001814381,0.00005426605,0.00005224252,0.0002246607,0.00003973435],"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.0002910815,0.0004412614,0.005984338,0.0001397947,0.0001750038,0.0002013695,0.00008360145,0.5803565,0.008046289,0.006806775,0.005079648,0.3923943],"study_design_scores_gemma":[0.000003450568,0.00001560275,0.0002300148,0.000003292307,0.0000115606,0.00001647908,0.000006416608,0.9985366,0.0003528469,0.0006685597,0.0001527672,0.000002441107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0648799,0.00156655,0.9257606,0.0004071503,0.0002095749,0.0001331405,0.0001348288,0.001068328,0.005839909],"genre_scores_gemma":[0.908977,0.0005663703,0.08726386,0.000142913,0.0001171914,0.00007602409,0.0001854557,0.00003453004,0.002636603],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005832397,"threshold_uncertainty_score":0.01159692,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069254940","doi":"10.1016/j.jpdc.2013.08.009","title":"Searching for a black hole in interconnected networks using mobile agents and tokens","year":2013,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; Ontario Tech University","funders":"","keywords":"Asynchronous communication; Security token; Computer science; Network topology; FIFO (computing and electronics); Hypercube; Focus (optics); Mathematical proof; Torus; Whiteboard; Computer network; Distributed computing; Topology (electrical circuits); Theoretical computer science; Mathematics; Combinatorics; Parallel computing; Telecommunications","authors":[{"name":"Joaquín García-Alfaro","is_ca":false},{"name":"Jean‐Pierre Corriveau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02328991508059717,"gpt":0.2744323974459021,"spread":0.2511424823653049,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002511184,0.0005425109,0.00152534,0.001227849,0.002324721,0.002595176,0.001792461,0.002709004,0.002555847],"category_scores_gemma":[0.01418608,0.0009700218,0.0009237733,0.0008781737,0.003416925,0.006974838,0.004417206,0.001385124,0.0003052511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000808886,"about_ca_system_score_gemma":0.001052744,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001334729,"about_ca_topic_score_gemma":0.001259694,"domain_scores_codex":[0.9990274,0.0004109287,0.0000474434,0.0001827745,0.0001625821,0.0001689595],"domain_scores_gemma":[0.9919275,0.005804123,0.0007714157,0.0005926877,0.0003946407,0.0005096573],"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.001740657,0.0002268288,0.00592971,0.0003001481,0.000259355,0.001194067,0.001345087,0.5427866,0.009262417,0.3892917,0.002380169,0.0452833],"study_design_scores_gemma":[0.0001079102,0.0001354812,0.0001976699,0.00003005195,0.00005233696,0.0001260314,0.0002934354,0.8546298,0.002382832,0.1407886,0.001232096,0.0000238491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3600828,0.0005178801,0.6315929,0.001218098,0.0001533902,0.0001332315,0.00004584238,0.0004304582,0.005825405],"genre_scores_gemma":[0.8905071,0.0002183025,0.1056679,0.0001223869,0.00003085015,0.00008143774,0.00003226913,0.00005906854,0.003280669],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002709004,"threshold_uncertainty_score":0.01328057,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4404261179","doi":"10.1016/j.jpdc.2024.105010","title":"Enabling semi-supervised learning in intrusion detection systems","year":2024,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Intrusion detection system; Artificial intelligence; Machine learning; Supervised learning; Artificial neural network","authors":[{"name":"Panagis Sarantos","is_ca":false},{"name":"John Violos","is_ca":true},{"name":"Aris Leivadeas","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01233361842862074,"gpt":0.2364941214895929,"spread":0.2241605030609721,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006309648,0.0006340119,0.001157663,0.0008106097,0.0006456542,0.001683149,0.001760614,0.001231014,0.001057594],"category_scores_gemma":[0.01900345,0.0006817066,0.0008506877,0.0006982337,0.002166226,0.00332305,0.002558097,0.002084147,0.0005302777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001175249,"about_ca_system_score_gemma":0.001657268,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002008258,"about_ca_topic_score_gemma":0.001797098,"domain_scores_codex":[0.9934995,0.003726596,0.0004027623,0.0009641584,0.001197696,0.0002091928],"domain_scores_gemma":[0.9741554,0.01778217,0.001463006,0.003348253,0.002904054,0.0003471628],"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.000490351,0.0005703875,0.003682026,0.0004666691,0.0001667498,0.0001722125,0.0004994514,0.7051799,0.007929528,0.0306887,0.002885404,0.2472688],"study_design_scores_gemma":[0.0000103012,0.00004567044,0.0001985028,0.00000978082,0.000005802282,0.00002233727,0.0000146229,0.980755,0.002076953,0.01638438,0.0004678214,0.000008782273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02069261,0.0002162205,0.9766471,0.0003058961,0.00003116114,0.000080781,0.00007752661,0.001121746,0.0008269537],"genre_scores_gemma":[0.6316012,0.0003074873,0.3656386,0.0002757886,0.0001209352,0.0003335919,0.0004881824,0.0001365882,0.001097604],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006309648,"threshold_uncertainty_score":0.033369,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078536718","doi":"10.1016/j.jpdc.2014.09.014","title":"Hybrid parallel task placement in irregular applications","year":2014,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates - Technology Futures","keywords":"Locality; Computer science; Speedup; Scheduling (production processes); Asynchronous communication; Parallel computing; Load balancing (electrical power); Distributed computing; Computer network","authors":[{"name":"Jeeva Paudel","is_ca":true},{"name":"José Nelson Amaral","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009939898745951825,"gpt":0.2466919551668542,"spread":0.2367520564209024,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003991855,0.000334907,0.0004505842,0.0003954491,0.0005662366,0.0006599214,0.0009414972,0.0004059953,0.002625872],"category_scores_gemma":[0.001092723,0.0002888539,0.0002505021,0.000667063,0.0003476632,0.000454383,0.0008312743,0.0003914978,0.0004145218],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003080542,"about_ca_system_score_gemma":0.0004679153,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009683321,"about_ca_topic_score_gemma":0.002083563,"domain_scores_codex":[0.9997802,0.00006302239,0.0000139298,0.00003267514,0.00006244934,0.00004771478],"domain_scores_gemma":[0.9994588,0.000203097,0.00004814329,0.0001180221,0.0001082585,0.00006357879],"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.001131391,0.0002354751,0.002285057,0.0002010684,0.00005918276,0.0003078099,0.0001412001,0.8203153,0.03184576,0.01241091,0.00351614,0.1275506],"study_design_scores_gemma":[0.00003256275,0.0001174765,0.0003553072,0.000004399699,0.00001055222,0.00005333986,0.00003871453,0.9887103,0.004290028,0.005215284,0.001165929,0.000006084656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3141554,0.0006908729,0.6737799,0.0002567258,0.000271421,0.0000895812,0.0001001233,0.001297342,0.009358522],"genre_scores_gemma":[0.8908795,0.0001369112,0.1051403,0.00005860498,0.0000531066,0.00005801121,0.00009446604,0.0001460267,0.003433146],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002625872,"threshold_uncertainty_score":0.008784473,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4385249512","doi":"10.1016/j.jpdc.2023.104746","title":"Mixed precision support in HPC applications: What about reliability?","year":2023,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Intel Corporation","keywords":"Computer science; Leverage (statistics); Reliability (semiconductor); Supercomputer; Double-precision floating-point format; Exascale computing; Single-precision floating-point format; Floating point; Computer engineering; Parallel computing; Operating system; Machine learning","authors":[{"name":"Alessio Netti","is_ca":false},{"name":"Yang Peng","is_ca":false},{"name":"Patrik Omland","is_ca":false},{"name":"Michael Paulitsch","is_ca":false},{"name":"Jorge Parra","is_ca":false},{"name":"Gustavo Espinosa","is_ca":false},{"name":"Udit Agarwal","is_ca":true},{"name":"Abraham Chan","is_ca":true},{"name":"Karthik Pattabiraman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02413579568500913,"gpt":0.2851408112615091,"spread":0.2610050155765,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004540063,0.0004646367,0.0008585901,0.0008160869,0.0008034713,0.003162452,0.002431293,0.002439001,0.00601559],"category_scores_gemma":[0.04342782,0.0005272095,0.0003134637,0.0009589896,0.002064381,0.008357893,0.001526009,0.002151965,0.001984093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008246514,"about_ca_system_score_gemma":0.001614184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001759666,"about_ca_topic_score_gemma":0.001899794,"domain_scores_codex":[0.9977039,0.0005405945,0.0001307805,0.0002049746,0.00118602,0.0002337349],"domain_scores_gemma":[0.9732649,0.01433054,0.002586682,0.002402648,0.006397964,0.001017314],"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.001147167,0.0003427992,0.03429851,0.004678266,0.0003735071,0.0007333111,0.001760778,0.0296956,0.01007969,0.1637394,0.07181221,0.6813387],"study_design_scores_gemma":[0.0002632276,0.001245634,0.02134549,0.004227081,0.000598517,0.002625761,0.003044031,0.1080354,0.01601521,0.6559788,0.1863245,0.0002964434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"review","genre_gemma":"empirical","genre_scores_codex":[0.2617222,0.3305982,0.1792971,0.1640723,0.0106098,0.0001077937,0.0008866413,0.00231335,0.05039265],"genre_scores_gemma":[0.9337089,0.03407418,0.01871374,0.002598407,0.00501064,0.00008239447,0.0001775677,0.0004138705,0.005220233],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00601559,"threshold_uncertainty_score":0.02401042,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}