{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00376855,0.0004973466,0.001090374,0.0004046354,0.00044844,0.000540087,0.001103155,0.0002130642,7.090088e-7],"category_scores_gemma":[0.0001860235,0.0004604747,0.0002217297,0.0009753243,0.0001040546,0.0004777228,0.0003452289,0.0006016714,0.000002871002],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002912302,"about_ca_system_score_gemma":0.0001841358,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006785812,"about_ca_topic_score_gemma":0.000003390144,"domain_scores_codex":[0.9950495,0.0002045038,0.002308379,0.0005988167,0.0006514078,0.001187366],"domain_scores_gemma":[0.9958692,0.00103789,0.001643329,0.0003893452,0.0006486622,0.0004116137],"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.00008058799,0.0001980919,0.003959384,0.000249464,0.000137614,0.0002636209,0.0006246172,0.9494122,0.000081801,0.001399405,0.0001806912,0.04341248],"study_design_scores_gemma":[0.003100118,0.0004922814,0.006712424,0.0007673897,0.00003507105,0.001230538,0.0003783997,0.9856984,0.00004950679,0.0003205758,0.0007042509,0.000511017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3785735,0.0008477124,0.6190721,0.00009700183,0.0009483389,0.0003026339,0.00007489431,0.00007690564,0.000006829184],"genre_scores_gemma":[0.8699252,0.00002702085,0.1293434,0.00006706779,0.0004924811,0.000002400605,0.0001133708,0.00002447177,0.000004607733],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4913516,"threshold_uncertainty_score":0.9997847,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001616262,0.0001964778,0.0005564048,0.0002200605,0.00009255742,0.00008621962,0.0006070362,0.0001785377,0.000002268876],"category_scores_gemma":[0.0004433001,0.0001670439,0.00007725132,0.0005516306,0.00006235387,0.0001535434,0.0002762808,0.0005292589,4.014693e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004322733,"about_ca_system_score_gemma":0.00007910935,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001720221,"about_ca_topic_score_gemma":0.0000266263,"domain_scores_codex":[0.9978347,0.0003896256,0.0009058207,0.0002506005,0.0003397363,0.0002795304],"domain_scores_gemma":[0.9976834,0.0005089406,0.0009330242,0.0002577279,0.0004972261,0.000119678],"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.0002749989,0.0004390362,0.06700125,0.00008514509,0.0002207247,0.00005791512,0.001299517,0.8197505,0.000166183,0.03377616,0.003641256,0.07328726],"study_design_scores_gemma":[0.001191331,0.0003665245,0.4283053,0.0002357786,0.00001088045,0.00005375504,0.00003170895,0.5637193,0.000189133,0.005625192,0.00005038369,0.0002206781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1489388,0.000245805,0.8502659,0.0002527508,0.000140831,0.0000676507,0.0000142711,0.00003440763,0.00003950661],"genre_scores_gemma":[0.8016086,0.00003359308,0.1982209,0.00007317786,0.00004471106,4.565537e-7,0.000008936224,0.000005800707,0.00000382873],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6526698,"threshold_uncertainty_score":0.6811852,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001224434,0.000103501,0.0002751823,0.00009195692,0.0001239923,0.00005594218,0.0002963421,0.00006446159,6.752857e-7],"category_scores_gemma":[0.00007591651,0.00008940473,0.00007336124,0.0002884739,0.00003095875,0.0003624646,0.0000547315,0.00009759998,3.74681e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004441871,"about_ca_system_score_gemma":0.0000607404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003331058,"about_ca_topic_score_gemma":8.526167e-7,"domain_scores_codex":[0.9986486,0.00002768647,0.000756179,0.0001288578,0.0002329761,0.0002057409],"domain_scores_gemma":[0.9982255,0.0001544759,0.0008545712,0.0001318628,0.000549487,0.00008411688],"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.0005825761,0.0004827842,0.04239114,0.001394929,0.0002490953,0.00004254832,0.002243269,0.2983942,0.004349878,0.02521218,0.003125486,0.6215319],"study_design_scores_gemma":[0.001546231,0.0003687663,0.03047768,0.0003410826,0.00002015245,0.0001762989,0.0002088422,0.9645787,0.001080466,0.0003184807,0.0007098143,0.0001735092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3249575,0.0002668598,0.6743159,0.00007325821,0.0002231581,0.00008081628,0.000007621039,0.00001107654,0.00006376127],"genre_scores_gemma":[0.972165,0.00002176528,0.02762393,0.00001867052,0.000143521,4.712952e-7,0.00001421228,0.00000417477,0.000008263003],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6661845,"threshold_uncertainty_score":0.3645819,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001055447,0.0002181044,0.0004054512,0.000192619,0.0005329457,0.000323982,0.0002045064,0.00008407801,0.00000422077],"category_scores_gemma":[0.0002101163,0.0001761071,0.00007539109,0.0002466751,0.00005541711,0.0005608697,0.00008604939,0.0002771474,2.898033e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009982735,"about_ca_system_score_gemma":0.0001328025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001657879,"about_ca_topic_score_gemma":4.038843e-7,"domain_scores_codex":[0.9978929,0.0002498245,0.0006196103,0.000261163,0.0004961432,0.0004804282],"domain_scores_gemma":[0.9976838,0.0005829965,0.0007311731,0.0001166808,0.0005811511,0.0003042438],"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.0001299544,0.0001127078,0.004130229,0.0000488793,0.00010744,0.000003744352,0.0001210392,0.9928495,0.0001742906,0.001430535,0.00002827584,0.0008633879],"study_design_scores_gemma":[0.00523739,0.0003581402,0.003560167,0.0001089468,0.00008210996,0.0001102346,0.00002743469,0.9901486,0.00002381222,0.0001178629,0.00001278797,0.0002124827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07909353,0.0003287618,0.9196832,0.0003494626,0.0001488729,0.0003326107,0.000006438941,0.00005525143,0.000001865591],"genre_scores_gemma":[0.5307455,0.000007219791,0.4690961,0.00002628719,0.00008473521,0.000005247166,0.00002435985,0.000008731256,0.00000183404],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.451652,"threshold_uncertainty_score":0.7181441,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007487616,0.000135676,0.000241899,0.00008971042,0.0002531513,0.0001563251,0.0002658299,0.0001080802,0.00001095124],"category_scores_gemma":[0.00003555224,0.0001268488,0.0001107025,0.0001466004,0.00002432247,0.0003620764,0.00008277272,0.0002302676,0.000007031049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007499068,"about_ca_system_score_gemma":0.0000467751,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000073936,"about_ca_topic_score_gemma":0.000005234577,"domain_scores_codex":[0.9986983,0.000116043,0.0004635512,0.0002390936,0.0002315767,0.0002514448],"domain_scores_gemma":[0.9990181,0.0001828347,0.0004150787,0.0001490132,0.00009888811,0.0001360487],"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.002193091,0.001338868,0.005576112,0.0002043123,0.0002381776,0.0000673505,0.001309482,0.4332769,0.2180505,0.01726437,0.001517848,0.318963],"study_design_scores_gemma":[0.001053781,0.001385809,0.003144129,0.00003731469,0.00001642171,0.00008059484,0.00005800369,0.9814364,0.004820271,0.002559476,0.005224941,0.0001828844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4552539,0.00006241435,0.5440091,0.000182656,0.000360647,0.0001020597,0.000002658518,0.00001753731,0.000008965036],"genre_scores_gemma":[0.9648696,0.0000106999,0.03450466,0.0001149352,0.0004799225,0.000001586685,0.000005850348,0.000006481863,0.000006313427],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5481595,"threshold_uncertainty_score":0.5172743,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002878162,0.0002183601,0.0004038366,0.0001086887,0.0002137406,0.0002246859,0.0007279668,0.00007871974,0.00001229605],"category_scores_gemma":[0.00008384923,0.0001904314,0.0001066688,0.0007156489,0.00003984953,0.0005628713,0.0003197443,0.0004060914,0.00001901999],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007423122,"about_ca_system_score_gemma":0.0000782247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002170249,"about_ca_topic_score_gemma":3.199615e-7,"domain_scores_codex":[0.9982038,0.00006636645,0.0006852734,0.0003167174,0.0003121097,0.0004157657],"domain_scores_gemma":[0.9980435,0.0003565998,0.0007176395,0.0003169713,0.0003291308,0.0002360925],"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.00005162932,0.00009821923,0.001594729,0.00002159602,0.00007281969,0.00004201576,0.0001341017,0.9717996,0.001574232,0.01365797,0.001369659,0.00958341],"study_design_scores_gemma":[0.001332389,0.0001654782,0.007900679,0.0001032381,0.00002120444,0.0004086994,0.00007978139,0.9844843,0.00007090926,0.004201614,0.0009497439,0.0002819762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1570622,0.0003342331,0.8414325,0.0006101173,0.0002681525,0.0001541434,0.00001649662,0.00007443764,0.0000476906],"genre_scores_gemma":[0.9628283,0.00001588163,0.0368064,0.0001324481,0.0001625658,0.000001422473,0.00002742665,0.0000109089,0.00001462265],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8057661,"threshold_uncertainty_score":0.7765567,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001023569,0.0001966191,0.000434603,0.0001777185,0.0002421152,0.0002204527,0.001298363,0.00009024654,0.000001979045],"category_scores_gemma":[0.0001195146,0.0001726169,0.00006794719,0.0006854771,0.00007619177,0.0009601902,0.0004886104,0.000405987,0.000003482033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005294173,"about_ca_system_score_gemma":0.0002727761,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005703259,"about_ca_topic_score_gemma":0.000009809695,"domain_scores_codex":[0.9978066,0.0001703965,0.0008898985,0.0003984137,0.0003610872,0.0003735997],"domain_scores_gemma":[0.9983523,0.0001942927,0.0006179647,0.0004738317,0.0002055118,0.0001561139],"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.0002746205,0.001106387,0.1740779,0.000263797,0.0003743085,0.002484524,0.005145523,0.6897491,0.0006675635,0.03971187,0.06669535,0.01944909],"study_design_scores_gemma":[0.002066763,0.000259484,0.110709,0.0002494123,0.00001697149,0.00685657,0.0004607577,0.8647563,0.00001490161,0.002219346,0.011932,0.000458402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2107173,0.0006475617,0.7875155,0.0003657748,0.0003946125,0.00007103684,0.00001630931,0.0000576996,0.0002141515],"genre_scores_gemma":[0.97643,0.00007649716,0.02301422,0.00004784814,0.0003704045,4.077994e-7,0.00004297421,0.000006657863,0.00001097488],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7657127,"threshold_uncertainty_score":0.7039113,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007504167,0.0001835178,0.000313126,0.00007256275,0.0002533123,0.0003240441,0.0004281935,0.00009144342,3.141289e-7],"category_scores_gemma":[0.0002260981,0.0001699989,0.00006058787,0.0003037611,0.0000507673,0.0004172041,0.000148108,0.0001957994,2.177231e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008795041,"about_ca_system_score_gemma":0.0001358341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001680518,"about_ca_topic_score_gemma":0.000001669046,"domain_scores_codex":[0.9983646,0.0001030049,0.0005677573,0.000296064,0.0003121809,0.0003564276],"domain_scores_gemma":[0.9980685,0.0002900413,0.0005941389,0.0002372084,0.0005620213,0.0002481359],"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.00009152592,0.0002090965,0.0008621829,0.00004222894,0.00004328615,0.00001534424,0.002821311,0.9562609,0.001292048,0.0220987,0.0001481334,0.01611526],"study_design_scores_gemma":[0.001714553,0.0002493531,0.00080544,0.0001556907,0.00001560416,0.00006677244,0.0003258314,0.9936529,0.0008247964,0.001789838,0.0001990414,0.0002001255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3185792,0.0004155688,0.6803451,0.0003288813,0.0002011255,0.00006896332,0.000002194994,0.00004000754,0.00001889979],"genre_scores_gemma":[0.8109796,0.000007867981,0.1886117,0.0001268162,0.0002532616,0.00000118767,0.00001033445,0.000008490538,7.939129e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4924003,"threshold_uncertainty_score":0.6932353,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000584668,0.0001647767,0.0002905271,0.00005792516,0.0002947976,0.0002730725,0.0005133917,0.000125219,0.000001560569],"category_scores_gemma":[0.0000701927,0.0001461973,0.00008373503,0.000129388,0.00007782899,0.0001883354,0.0003026208,0.0004793937,3.698751e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001867556,"about_ca_system_score_gemma":0.00002000412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003881551,"about_ca_topic_score_gemma":0.000008716466,"domain_scores_codex":[0.998723,0.00008190459,0.0005134833,0.0001978571,0.0001857688,0.0002980228],"domain_scores_gemma":[0.9983224,0.0003872187,0.0005509765,0.0003197589,0.0002396163,0.0001800145],"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.0002909751,0.0004472859,0.01824526,0.0001742939,0.0005218991,0.0001537561,0.003678012,0.7822843,0.001886739,0.08718082,0.002862817,0.1022738],"study_design_scores_gemma":[0.001109954,0.0001593037,0.003555789,0.00007439002,0.0000263149,0.0007214984,0.00005178259,0.9884292,0.00005712908,0.002866889,0.002751542,0.0001962364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3748927,0.0007928156,0.6232337,0.0006858132,0.0002471373,0.0001140103,0.000004242972,0.00002012489,0.000009447082],"genre_scores_gemma":[0.8567473,0.0001716543,0.1426888,0.0001392262,0.0002323282,0.000001158809,0.00001078371,0.000007113658,0.000001716294],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4818546,"threshold_uncertainty_score":0.5961751,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00229752,0.0002022786,0.000414733,0.0002517514,0.0003434419,0.0002454104,0.0005635732,0.0001027654,0.00000222724],"category_scores_gemma":[0.0003058946,0.0001884783,0.0001170535,0.0005346556,0.00007705181,0.0003340347,0.0003220062,0.0002306844,0.000005540754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009392035,"about_ca_system_score_gemma":0.0001334287,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002750192,"about_ca_topic_score_gemma":2.183531e-7,"domain_scores_codex":[0.9979311,0.0002145233,0.0008406349,0.0003004959,0.0002341074,0.0004791848],"domain_scores_gemma":[0.997827,0.0007453802,0.0006174355,0.000199076,0.0004558746,0.0001552193],"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.002047924,0.0005957391,0.00712518,0.000137364,0.0001621031,0.000198324,0.007562299,0.8088163,0.002169053,0.0009894228,0.02387899,0.1463174],"study_design_scores_gemma":[0.001716183,0.0006319939,0.002834413,0.0001840574,0.00001000247,0.0001957401,0.00006128461,0.9898552,0.0001094727,0.0004492672,0.003727143,0.0002252701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3154847,0.0002374601,0.6823442,0.0002825772,0.00142807,0.0001441755,0.000001026286,0.00003840688,0.00003936722],"genre_scores_gemma":[0.7945796,0.000006730138,0.2033751,0.0001419808,0.001860225,0.000001000513,0.000007516989,0.00001345431,0.00001436219],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.479095,"threshold_uncertainty_score":0.7685921,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001359729,0.0002477332,0.0005718446,0.0001613238,0.000442009,0.000259735,0.0005238409,0.0001524077,7.56001e-7],"category_scores_gemma":[0.0002625142,0.0002254789,0.0001334249,0.0003813151,0.0001081339,0.0002542148,0.000142897,0.0004015357,5.382954e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007489861,"about_ca_system_score_gemma":0.0001798782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002304872,"about_ca_topic_score_gemma":0.00001724822,"domain_scores_codex":[0.9976746,0.0001801186,0.0010725,0.0003002987,0.0004237527,0.0003487123],"domain_scores_gemma":[0.9960392,0.001189693,0.001316809,0.0003608753,0.0009056199,0.0001878278],"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.00008779512,0.0002418045,0.004711484,0.00017616,0.00007261022,0.000004501735,0.000509638,0.9858772,0.0008451218,0.005451835,0.0003995197,0.00162229],"study_design_scores_gemma":[0.002378106,0.0002747126,0.01206709,0.0003389393,0.00003884316,0.00007241827,0.000205386,0.9826924,0.00002572675,0.0009191569,0.0007678026,0.0002194782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3165902,0.0002883577,0.6819392,0.000273222,0.0003557226,0.0002320357,0.0002638109,0.00004146036,0.00001592268],"genre_scores_gemma":[0.9611731,0.000007022491,0.03842844,0.00003381975,0.00006613058,0.000002414919,0.0002738243,0.00001216784,0.000003144374],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6445828,"threshold_uncertainty_score":0.9194764,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006644112,0.0001038744,0.0002055199,0.0001391372,0.000141734,0.0001598998,0.000153311,0.00004897702,0.000001303141],"category_scores_gemma":[0.000121888,0.00009426636,0.00004413242,0.0003616572,0.00003257015,0.0003888744,0.00007872759,0.0002486785,2.901571e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002473824,"about_ca_system_score_gemma":0.00004266671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001985047,"about_ca_topic_score_gemma":0.00000921263,"domain_scores_codex":[0.9989694,0.00008058579,0.0004159251,0.000168922,0.0001369357,0.0002281782],"domain_scores_gemma":[0.9993212,0.0001041562,0.0003078791,0.00009500366,0.00006803332,0.0001037639],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0001099008,0.0005882754,0.4648393,0.0001590887,0.0001230958,0.0005387138,0.003618494,0.009731133,0.001939033,0.3975466,0.0005046113,0.1203017],"study_design_scores_gemma":[0.007919031,0.001254137,0.5390974,0.0005064638,0.00006329024,0.007264455,0.001298396,0.2680357,0.001044354,0.1689286,0.003382618,0.001205564],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4323753,0.0007158813,0.5666316,0.0000647716,0.00007262958,0.00002635888,9.417316e-7,0.00001115966,0.0001013008],"genre_scores_gemma":[0.9650194,0.00007144547,0.03482261,0.00004384697,0.0000380128,2.196939e-7,0.000001536352,0.000002620588,2.881653e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5326441,"threshold_uncertainty_score":0.384407,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001291778,0.00008512377,0.0002070064,0.0002051783,0.0001062578,0.0001698306,0.0001378575,0.00006908543,0.000003003028],"category_scores_gemma":[0.0001712615,0.00007304874,0.00004658786,0.0008054707,0.00002101974,0.0003231518,0.0001105768,0.0004207523,0.000001036215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004126915,"about_ca_system_score_gemma":0.00005551088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001277558,"about_ca_topic_score_gemma":0.00007380072,"domain_scores_codex":[0.9987952,0.0002366108,0.000511674,0.0001385174,0.0001785236,0.000139439],"domain_scores_gemma":[0.9992262,0.0002594185,0.0002331944,0.00005233026,0.0001747198,0.0000541975],"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.0001644587,0.0001065961,0.01368536,0.000126253,0.00006254063,0.0001334805,0.0009233817,0.1256756,0.004681165,0.001083474,0.0002056222,0.8531521],"study_design_scores_gemma":[0.0002996569,0.0002393356,0.0886303,0.0002295531,0.00000417955,0.0001310065,0.00003395633,0.9090064,0.0004995793,0.0005369937,0.0003111378,0.00007796805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4586594,0.0009071599,0.5400063,0.00006370958,0.0003021577,0.00002225349,6.955195e-7,0.00002179859,0.00001647878],"genre_scores_gemma":[0.9988079,0.0001276473,0.0009762252,0.0000103727,0.0000676698,1.565455e-7,0.000003184158,0.000003524515,0.000003301404],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8530741,"threshold_uncertainty_score":0.2978841,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008581806,0.0002478292,0.0006567512,0.000091411,0.0003648401,0.000170154,0.0006421626,0.0001209507,0.000005183547],"category_scores_gemma":[0.0003028251,0.0002000845,0.0002322481,0.0004918549,0.00003820311,0.0003528816,0.0001952567,0.0002941743,0.000003701013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000962917,"about_ca_system_score_gemma":0.0004532912,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004829039,"about_ca_topic_score_gemma":0.000002970527,"domain_scores_codex":[0.9976434,0.00009924088,0.0009195172,0.0003453894,0.0005134129,0.0004790269],"domain_scores_gemma":[0.9976551,0.0004107584,0.0006168391,0.0002739872,0.0006036208,0.0004396781],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001681188,0.001209066,0.05195148,0.0004926681,0.001373654,0.002253467,0.005988489,0.1948017,0.002195362,0.12267,0.3410399,0.2743431],"study_design_scores_gemma":[0.003323717,0.000436038,0.01183637,0.0001795259,0.00004519045,0.002354357,0.00009680136,0.9423671,0.00001662523,0.002285651,0.0366816,0.0003770109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01724523,0.001740372,0.9792544,0.0009005207,0.0005322771,0.000150481,0.00001432305,0.00004875199,0.0001136693],"genre_scores_gemma":[0.5245716,0.00009105114,0.4745018,0.0002003907,0.0004865975,9.470625e-7,0.00001112797,0.00001105583,0.0001254942],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7475654,"threshold_uncertainty_score":0.815921,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001063875,0.0002252919,0.0005137007,0.00003141285,0.0003741409,0.0000775542,0.0009298768,0.00009969736,0.000008982513],"category_scores_gemma":[0.00002862083,0.0001165089,0.0003525495,0.0003679458,0.0003838875,0.0001710663,0.000276647,0.0005235734,3.168339e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006981795,"about_ca_system_score_gemma":0.0001214771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006476166,"about_ca_topic_score_gemma":0.000003368611,"domain_scores_codex":[0.9979236,0.0002567256,0.0008873568,0.0002256958,0.000316496,0.0003901687],"domain_scores_gemma":[0.9966237,0.0009225649,0.001283802,0.0004729216,0.0005650886,0.0001319031],"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.001005997,0.0007636672,0.004988843,0.00001648203,0.0006512965,0.00005553961,0.004691676,0.8655102,0.000008078161,0.02559794,0.005066852,0.0916434],"study_design_scores_gemma":[0.0006866425,0.00128782,0.02609573,0.00008458348,0.00003936332,0.0001146654,0.001227887,0.9623998,0.000002244107,0.007772815,0.0001498263,0.0001386663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05715134,0.006224077,0.935268,0.0001071462,0.0002442123,0.0001986685,0.00001184351,0.00001460157,0.0007801174],"genre_scores_gemma":[0.9958025,0.0008073458,0.00317681,0.00004475647,0.0001516827,0.000001426276,0.000003425206,0.000007329447,0.000004756866],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9386511,"threshold_uncertainty_score":0.4751094,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001047129,0.0001725094,0.0003478662,0.00009490186,0.0006513714,0.0005944514,0.0006764018,0.0001205138,0.000001400908],"category_scores_gemma":[0.00009801261,0.0001591718,0.00007953937,0.0001236902,0.00007605911,0.0003980514,0.0001237505,0.0003078157,2.595725e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006423079,"about_ca_system_score_gemma":0.0002940529,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001888396,"about_ca_topic_score_gemma":0.000009608882,"domain_scores_codex":[0.9983316,0.00006259016,0.0007452267,0.0002705293,0.0002229819,0.0003670489],"domain_scores_gemma":[0.9976825,0.0002382853,0.001041714,0.0003771818,0.0003954246,0.0002649448],"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.0003648776,0.0005078294,0.2127939,0.0001290382,0.00008664127,0.0003112789,0.0003822022,0.5952888,0.00004120244,0.01781913,0.0009856109,0.1712896],"study_design_scores_gemma":[0.001647556,0.0002437756,0.02373501,0.0003024899,0.00001913457,0.00006422049,0.00004872329,0.9729051,9.97284e-7,0.0007945041,0.00008222775,0.0001562783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03601455,0.0001191365,0.9626961,0.0004818832,0.0004574494,0.0001502614,0.000009310264,0.00002909564,0.00004220233],"genre_scores_gemma":[0.9508238,0.000008253768,0.04858977,0.0001188717,0.0004096436,0.000002136479,0.00003291276,0.000008518687,0.000006080709],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9148093,"threshold_uncertainty_score":0.6490836,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006538989,0.0003835821,0.000678226,0.0002221007,0.0003070936,0.0004805714,0.001393469,0.0001208431,0.00002753243],"category_scores_gemma":[0.0001599454,0.0003252514,0.0002340223,0.0005393418,0.00005491162,0.0003162377,0.0004442952,0.0004821524,0.00004421582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000725827,"about_ca_system_score_gemma":0.00004643547,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008897502,"about_ca_topic_score_gemma":0.000002842791,"domain_scores_codex":[0.9968281,0.0003436535,0.001082518,0.0004944993,0.0005709741,0.0006802192],"domain_scores_gemma":[0.99738,0.00062664,0.0006644305,0.0004753774,0.0002519992,0.0006015731],"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.0001332964,0.0005078214,0.009746325,0.00006059012,0.0005104457,0.0008620353,0.009377114,0.8239865,0.0004035179,0.00283345,0.03579823,0.1157807],"study_design_scores_gemma":[0.002978261,0.0009081084,0.02388874,0.0005518707,0.00006936504,0.001502161,0.0004797052,0.9571806,0.00005943568,0.004018176,0.007351439,0.001012197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.129235,0.0006470672,0.8671969,0.001840045,0.0006371796,0.0001843111,0.00005226273,0.0001085761,0.00009869662],"genre_scores_gemma":[0.8750891,0.00001870732,0.1238969,0.0003015024,0.0006259604,0.00000198448,0.00001629099,0.00001508855,0.00003443889],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7458541,"threshold_uncertainty_score":0.99992,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001480389,0.0001984395,0.0004374198,0.0002905063,0.0005120431,0.0002282041,0.000639241,0.00004763562,0.000001011382],"category_scores_gemma":[0.00008042267,0.0001925826,0.0001840417,0.0003677144,0.00002191002,0.00003874475,0.0004379135,0.0004343905,4.039384e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002613049,"about_ca_system_score_gemma":0.0001227354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006406073,"about_ca_topic_score_gemma":0.000001605469,"domain_scores_codex":[0.9977759,0.0002290458,0.0008480903,0.0003111235,0.0004112835,0.0004245533],"domain_scores_gemma":[0.9983854,0.0004054534,0.000653056,0.0001841396,0.0002303012,0.0001416756],"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.00006742118,0.0001505979,0.0006693049,0.00004423006,0.00003347714,0.0001323897,0.0002820451,0.9879963,0.0002548402,0.006597165,0.00005836213,0.003713909],"study_design_scores_gemma":[0.00145775,0.0003727954,0.000173283,0.0001370032,0.00001499446,0.0004269418,0.0004820902,0.9960353,0.00007588971,0.0004632222,0.0001500114,0.0002107542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4148072,0.0006219283,0.583532,0.0001868604,0.0006618521,0.0001479103,0.00001104353,0.00002695544,0.000004238907],"genre_scores_gemma":[0.9960357,0.00000223874,0.00364008,0.0001867378,0.0001081298,0.000004431693,0.000007613234,0.00001122299,0.000003835522],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5812286,"threshold_uncertainty_score":0.7853289,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00117771,0.0002903419,0.0005892122,0.0002162755,0.0003242494,0.0003138214,0.0006647501,0.000243786,0.000002138462],"category_scores_gemma":[0.0001255979,0.0002660362,0.000168428,0.0005283541,0.0001387862,0.0002894571,0.000280759,0.0009774974,3.545095e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007248791,"about_ca_system_score_gemma":0.00008482998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002689361,"about_ca_topic_score_gemma":0.00003439676,"domain_scores_codex":[0.9971849,0.000206324,0.0009888432,0.0004394595,0.0003926045,0.000787879],"domain_scores_gemma":[0.9974071,0.001124217,0.0005813589,0.0002791848,0.0003124923,0.0002956634],"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.0001288416,0.000124153,0.03023746,0.00001584326,0.00004124077,0.00009158075,0.0001451221,0.9281407,0.002145812,0.02019316,0.00008303046,0.01865304],"study_design_scores_gemma":[0.001969815,0.000121178,0.03472446,0.0001814002,0.00001370686,0.0002537684,0.00006158851,0.961892,0.0002386467,0.0001394506,0.0001225478,0.0002814373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4218197,0.00009855963,0.5773066,0.0002766692,0.0003734201,0.00006619041,0.00000956228,0.00004002701,0.000009233968],"genre_scores_gemma":[0.9526663,0.00005192133,0.04664674,0.00007053216,0.0004745673,0.000002575079,0.00006518118,0.00001795945,0.000004234817],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5308466,"threshold_uncertainty_score":0.9999792,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007829636,0.0002485022,0.0004203484,0.00009919499,0.0009433927,0.0002407657,0.001227985,0.0000743675,0.000002934194],"category_scores_gemma":[0.00015455,0.0001724904,0.0002205218,0.0005052936,0.0002902346,0.0003598631,0.0006367394,0.000575734,0.000006070294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004827798,"about_ca_system_score_gemma":0.0001122917,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002153924,"about_ca_topic_score_gemma":0.000001498735,"domain_scores_codex":[0.9978379,0.00017026,0.0007439771,0.0002839186,0.0004788613,0.0004850632],"domain_scores_gemma":[0.9978641,0.0005985568,0.000670344,0.000306753,0.0003419763,0.0002183276],"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.000318687,0.002683881,0.1112653,0.00024593,0.001939889,0.004095559,0.01706921,0.08916217,0.0007229776,0.2525113,0.04310219,0.476883],"study_design_scores_gemma":[0.004481644,0.001196078,0.1829857,0.0005011858,0.0001528504,0.0150834,0.001935196,0.7281778,0.0003437955,0.02544876,0.03832348,0.001370025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1760059,0.001361407,0.8199704,0.001917024,0.0004502101,0.00008047465,0.00001557606,0.00004637509,0.0001525876],"genre_scores_gemma":[0.969611,0.0001496115,0.02953729,0.0002699769,0.0004019223,3.692232e-7,0.000008542005,0.000007464498,0.00001385776],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7936051,"threshold_uncertainty_score":0.7255909,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001581689,0.0001762387,0.0002599876,0.0001669788,0.0005893267,0.0004529093,0.0006997795,0.00005097314,0.00001963145],"category_scores_gemma":[0.00005000395,0.00009709649,0.00007557279,0.0004101392,0.0001589377,0.0002755228,0.0001776794,0.0007004527,0.00003255485],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005051135,"about_ca_system_score_gemma":0.0000562538,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001655031,"about_ca_topic_score_gemma":4.795532e-7,"domain_scores_codex":[0.9979113,0.0004191867,0.0004186749,0.000258392,0.0005823436,0.0004101284],"domain_scores_gemma":[0.9979614,0.00080089,0.000326538,0.0003097857,0.0003972704,0.0002040946],"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.0002991814,0.001116093,0.0001953178,0.00005777171,0.000398116,0.0003435707,0.001768996,0.123967,0.0002162008,0.7233277,0.01411385,0.1341963],"study_design_scores_gemma":[0.002858912,0.002929026,0.01094089,0.0004980224,0.00001950915,0.0006368676,0.00076384,0.8801119,0.0003657548,0.09868682,0.001745072,0.0004433379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2573205,0.0000636757,0.7378883,0.003670483,0.0001489847,0.0002444062,0.00001383751,0.00002792422,0.000621924],"genre_scores_gemma":[0.9890717,0.00001182793,0.01024966,0.0003813049,0.0002187899,0.000006858925,0.00000527972,0.00000782728,0.00004673005],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.756145,"threshold_uncertainty_score":0.4532684,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007047827,0.00008286219,0.0001854947,0.000081386,0.000122213,0.0002845067,0.0001272975,0.0000476084,2.560024e-7],"category_scores_gemma":[0.0001353079,0.00006676247,0.0000252788,0.0001191492,0.0000326109,0.0009089229,0.00008071877,0.0001164504,2.535154e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002174884,"about_ca_system_score_gemma":0.00006706089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004639114,"about_ca_topic_score_gemma":6.378404e-7,"domain_scores_codex":[0.9991841,0.00004514412,0.0003473535,0.00008434092,0.000180797,0.0001582685],"domain_scores_gemma":[0.9990462,0.0001242288,0.0002544633,0.00006124535,0.0002536393,0.0002601871],"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.0002450235,0.0001468292,0.06971235,0.0002695839,0.0002424821,0.00002325319,0.01028097,0.06413539,0.00003536775,0.03724629,0.01105047,0.806612],"study_design_scores_gemma":[0.005919785,0.0008216297,0.05121543,0.000107023,0.00003863713,0.0003618968,0.0006260358,0.9134972,0.00001748676,0.005004328,0.02210813,0.0002824115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02731968,0.0003112515,0.9703431,0.001731006,0.00005947629,0.0001333383,0.0000168151,0.00001660051,0.00006875261],"genre_scores_gemma":[0.9470173,0.00006000642,0.05271831,0.00009849979,0.00007877878,9.369159e-7,0.00001857701,0.000002531637,0.000005081752],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9196976,"threshold_uncertainty_score":0.2743505,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001569886,0.00014376,0.0002290257,0.0001520626,0.00008607994,0.00004051184,0.0000868734,0.00004732866,0.000007945272],"category_scores_gemma":[0.000006323604,0.0001245954,0.0001330469,0.0001757894,0.00002026389,0.00006434775,0.00001059072,0.0001695668,5.952783e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003115007,"about_ca_system_score_gemma":0.000009513156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001428271,"about_ca_topic_score_gemma":0.000004721685,"domain_scores_codex":[0.9992821,0.00001246546,0.0003092224,0.0001070585,0.00008356678,0.0002056534],"domain_scores_gemma":[0.9995523,0.00003309773,0.0001425751,0.00006457278,0.0001132384,0.00009419819],"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.0007685428,0.0004052508,0.02299931,0.001426789,0.001335378,0.0000605747,0.003267925,0.4849897,0.141848,0.00002122836,0.005029052,0.3378482],"study_design_scores_gemma":[0.006333392,0.0007120465,0.1166908,0.001099778,0.000940458,0.001008182,0.0009543939,0.6756899,0.1925934,0.0007321407,0.001746781,0.001498807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5388047,0.0006253175,0.4602026,0.00003071115,0.0001420529,0.00004175009,0.00004679907,0.00003591487,0.00007017217],"genre_scores_gemma":[0.9971144,0.00007292089,0.002603513,0.00002194665,0.0001582941,0.000001644774,0.000004689661,0.00001584464,0.000006766472],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4583097,"threshold_uncertainty_score":0.5080854,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003538814,0.00009749347,0.0002007701,0.00004715976,0.0001975023,0.0001027741,0.0003927638,0.00004670647,0.000004822788],"category_scores_gemma":[0.00004294154,0.00006338784,0.0001003213,0.0001757599,0.00003336688,0.0002007278,0.0001809002,0.0001577563,4.117026e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001657911,"about_ca_system_score_gemma":0.000009820652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000632397,"about_ca_topic_score_gemma":3.946343e-7,"domain_scores_codex":[0.9990433,0.00005653418,0.0004418372,0.0001284185,0.0001505854,0.0001793633],"domain_scores_gemma":[0.9988633,0.0002792589,0.0004816328,0.000155513,0.0001555624,0.00006474811],"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.00001280116,0.00009503181,0.0008655517,0.0000191993,0.00008044251,0.00001822678,0.0005139001,0.06513293,0.00005527159,0.0008222091,0.00559288,0.9267915],"study_design_scores_gemma":[0.0005455627,0.0001410674,0.003489695,0.000075839,0.00001715801,0.0002331585,0.00007112854,0.9934661,0.00001745707,0.000636865,0.001230122,0.0000757981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01550884,0.00137655,0.9824103,0.0002169987,0.0003708484,0.00008244055,0.000008604964,0.00001056881,0.00001482807],"genre_scores_gemma":[0.7900798,0.0001043334,0.2094484,0.00004988927,0.0003020072,9.740902e-7,0.000002760513,0.000004350151,0.000007391996],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9283332,"threshold_uncertainty_score":0.2584881,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005929676,0.0001931139,0.0003001253,0.0001770575,0.0003599633,0.0006047774,0.0002188331,0.00007402067,0.000006746012],"category_scores_gemma":[0.00004175727,0.000146841,0.000073091,0.000427925,0.00007409117,0.0004252411,0.0001610615,0.000605059,0.000001924456],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003859508,"about_ca_system_score_gemma":0.00009244766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002203295,"about_ca_topic_score_gemma":0.00000724623,"domain_scores_codex":[0.9986439,0.0001181099,0.0003992156,0.0002643908,0.0002863298,0.0002880712],"domain_scores_gemma":[0.9991128,0.0002378114,0.0002273619,0.000114651,0.0001309295,0.0001764585],"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.002129769,0.0007190575,0.05634314,0.002773052,0.001572996,0.005221686,0.01409056,0.6243496,0.002489443,0.06579155,0.01577605,0.2087431],"study_design_scores_gemma":[0.001105548,0.0006904462,0.003223822,0.0006021344,0.00003888919,0.0009925099,0.0001068839,0.9813199,0.0002023232,0.001446707,0.01000802,0.0002628068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3719905,0.003955494,0.6225209,0.0007440652,0.0005638665,0.00005508922,0.000003343585,0.00009491961,0.00007191694],"genre_scores_gemma":[0.992953,0.0001468397,0.006275121,0.00009753378,0.0004857281,7.278736e-7,0.000005050279,0.00001059632,0.00002542792],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6209625,"threshold_uncertainty_score":0.5988004,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0012824,0.0002826146,0.0004327644,0.0002380878,0.001383912,0.0004333757,0.006916051,0.0001297401,0.00001412206],"category_scores_gemma":[0.00434276,0.0002843667,0.0001171439,0.001319027,0.00004608805,0.0004693278,0.01500142,0.0008307288,8.118013e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003523083,"about_ca_system_score_gemma":0.0002863397,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000536621,"about_ca_topic_score_gemma":0.000001464814,"domain_scores_codex":[0.9975057,0.0002621718,0.000853788,0.000526573,0.0003883009,0.0004634699],"domain_scores_gemma":[0.995373,0.001285443,0.001135069,0.001436343,0.0006190654,0.0001510596],"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.00065004,0.001111608,0.001203219,0.0001612682,0.0002679491,0.00002161643,0.0004844307,0.6760937,0.0004152865,0.005263936,0.2824635,0.03186341],"study_design_scores_gemma":[0.001281137,0.000264562,0.0001733743,0.0000638619,0.00002342591,0.00002866517,0.0003121339,0.9158582,0.00006771582,0.07558605,0.00606968,0.0002711573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002075481,0.0001320533,0.9487121,0.04696729,0.0001969338,0.0005785166,0.00111826,0.0001915172,0.00002792272],"genre_scores_gemma":[0.4986761,0.00001642067,0.49976,0.0008220904,0.00005362971,0.00007353321,0.0005797283,0.00001620401,0.000002315008],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4966006,"threshold_uncertainty_score":0.9999608,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000551274,0.0001541313,0.0003277574,0.0001066483,0.00009012285,0.0002447558,0.0004753516,0.00006766296,0.000003810442],"category_scores_gemma":[0.00003514815,0.0001280438,0.00007439637,0.0002467478,0.00003430444,0.0007713452,0.0001661065,0.0002440556,0.000006015773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003880153,"about_ca_system_score_gemma":0.00005296779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008742017,"about_ca_topic_score_gemma":0.000003256695,"domain_scores_codex":[0.9983782,0.00005389219,0.0007463103,0.0002061734,0.0003213063,0.0002941781],"domain_scores_gemma":[0.9991376,0.000105535,0.0004083016,0.0001680575,0.0000485819,0.0001318912],"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.0000897108,0.0003481967,0.007518177,0.00002068462,0.00004409657,0.0002515696,0.0005941401,0.862415,0.0005924062,0.01321809,0.00149313,0.1134148],"study_design_scores_gemma":[0.003823333,0.0002549279,0.1119593,0.0003569096,0.00001191782,0.0007152393,0.000425116,0.844773,0.00008803469,0.0008919255,0.03630224,0.0003980442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3139211,0.0007821116,0.6847084,0.0003409644,0.0001013572,0.00004008602,0.000005101727,0.000009778904,0.0000911481],"genre_scores_gemma":[0.9239333,0.00006190805,0.07579625,0.00005504771,0.0001363402,4.034373e-7,0.000004257231,0.000004154179,0.000008297518],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6100122,"threshold_uncertainty_score":0.5221475,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002888459,0.0002064766,0.0003703219,0.0000663004,0.0003649517,0.0001526185,0.00008831122,0.00007163955,0.000001784956],"category_scores_gemma":[0.00005740745,0.0001854869,0.00004207889,0.000539595,0.00003298323,0.0001640783,0.0001308318,0.0003182908,5.522831e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004285258,"about_ca_system_score_gemma":0.00004671634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001621661,"about_ca_topic_score_gemma":3.805096e-7,"domain_scores_codex":[0.99863,0.00007043996,0.0005412133,0.0001907683,0.0001873308,0.0003802116],"domain_scores_gemma":[0.9991185,0.0001744308,0.0002441273,0.00008271571,0.0002245463,0.000155653],"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.00002048317,0.00001469505,0.000222916,0.00009905107,0.00002334263,0.000119072,0.00008451657,0.9766819,0.004122246,0.0002560547,0.00001020164,0.01834554],"study_design_scores_gemma":[0.0005557188,0.00003575414,0.0003293846,0.0006132383,0.00004936977,0.001414048,0.0001161224,0.9944009,0.001102383,0.001021244,0.0001579012,0.0002039296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4777273,0.004379757,0.5176066,0.000008524409,0.00019676,0.00002194809,0.000001711402,0.00003161023,0.00002583669],"genre_scores_gemma":[0.9580295,0.00007302976,0.04146815,0.00002834064,0.0003705103,2.002129e-7,0.000007292944,0.00001989537,0.00000309936],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4803022,"threshold_uncertainty_score":0.7563938,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001038202,0.0002142372,0.0004418008,0.000251098,0.0001932626,0.000610378,0.0004651787,0.00005857682,0.000001428888],"category_scores_gemma":[0.000132236,0.0001956555,0.00007439093,0.0007599238,0.00004765428,0.0009857361,0.0003413918,0.0003243468,0.000002409868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008376699,"about_ca_system_score_gemma":0.00009791791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001211862,"about_ca_topic_score_gemma":0.000008600934,"domain_scores_codex":[0.9979743,0.0001478002,0.0008843451,0.0003106223,0.0003343407,0.0003485482],"domain_scores_gemma":[0.998395,0.0002939374,0.000649986,0.0001761741,0.0003208756,0.0001640188],"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.0001528137,0.002496332,0.109869,0.00006880466,0.0001716869,0.1209816,0.008240925,0.06871217,0.000120044,0.0003228599,0.001382648,0.6874811],"study_design_scores_gemma":[0.002230425,0.0007230316,0.007975467,0.0002021575,0.00002293189,0.08068379,0.001994921,0.9024494,0.00001089365,0.003279081,0.00004033453,0.0003875686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4072008,0.00008908363,0.5921039,0.0001050164,0.00008149798,0.0001089682,8.831957e-7,0.00009793911,0.0002118999],"genre_scores_gemma":[0.8089135,0.00001234554,0.1909434,0.00003230052,0.00007426767,0.00000137329,0.000002042422,0.00000870345,0.0000120894],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8337373,"threshold_uncertainty_score":0.7978601,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005615097,0.0001609314,0.0003531651,0.00007787572,0.0003387311,0.0003229668,0.0003801942,0.00007688956,7.838517e-7],"category_scores_gemma":[0.0001342209,0.0001363071,0.00005842818,0.0001536012,0.0001301657,0.0004263061,0.0003112967,0.0001436448,3.478176e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000293009,"about_ca_system_score_gemma":0.00006174883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002397442,"about_ca_topic_score_gemma":0.000009576118,"domain_scores_codex":[0.9987639,0.00005240256,0.0004449493,0.0002459295,0.0001889574,0.0003038719],"domain_scores_gemma":[0.9986815,0.0001905883,0.0003963834,0.0001786803,0.0003508747,0.000201929],"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.002128334,0.0007928656,0.05881616,0.001247642,0.001498557,0.0007143238,0.01424308,0.004323242,0.005121209,0.4144706,0.05848247,0.4381615],"study_design_scores_gemma":[0.01177899,0.002158015,0.03656377,0.0007992439,0.0001050233,0.001537309,0.001301836,0.8942156,0.0002182038,0.01383744,0.03660621,0.0008783714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1953654,0.0009624683,0.8024558,0.0006844204,0.0002859677,0.0001014064,0.00005026073,0.00002390542,0.00007033464],"genre_scores_gemma":[0.974778,0.00005377688,0.02459655,0.00007887272,0.0004646775,5.457494e-7,0.000004979629,0.000006039354,0.00001657006],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8898923,"threshold_uncertainty_score":0.5558444,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008471307,0.0001859105,0.0002784121,0.00001351018,0.001067505,0.0003383702,0.0008796315,0.00003358302,0.000002559676],"category_scores_gemma":[0.00006483361,0.0001055547,0.0001136412,0.0001565734,0.0001117476,0.0001965328,0.0003268935,0.0004103461,8.673928e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001797129,"about_ca_system_score_gemma":0.00009849907,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001213555,"about_ca_topic_score_gemma":4.761263e-7,"domain_scores_codex":[0.9986008,0.00006427654,0.0005225265,0.000222003,0.00021382,0.0003765306],"domain_scores_gemma":[0.9975829,0.0008998539,0.0007179471,0.0004417934,0.0002442402,0.0001132274],"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.0003260306,0.0003099866,0.02673394,0.00007297495,0.0006528637,0.000002422044,0.0004260087,0.02540778,0.0001188957,0.1176839,0.009039772,0.8192254],"study_design_scores_gemma":[0.00261123,0.000276689,0.0489171,0.0002642644,0.0004175801,0.0000158339,0.003261363,0.7232138,0.00002884135,0.1036164,0.1168405,0.0005364023],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0419992,0.0008734021,0.9550574,0.001400345,0.0002256565,0.0001623471,0.0001994399,0.00001087173,0.0000713629],"genre_scores_gemma":[0.9952427,0.00001406918,0.002952678,0.00008975543,0.001546799,0.000004111588,0.0001272111,0.0000142521,0.000008428412],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9532435,"threshold_uncertainty_score":0.8210493,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002832349,0.0001138182,0.0002752009,0.0001091691,0.0001705465,0.00005609406,0.0005174766,0.00006491705,0.000002696518],"category_scores_gemma":[0.0002971505,0.00009616801,0.00007105752,0.00024895,0.0001425324,0.0003355372,0.000204824,0.0001126292,8.191698e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003361886,"about_ca_system_score_gemma":0.0000579771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001986298,"about_ca_topic_score_gemma":0.000001422645,"domain_scores_codex":[0.9989025,0.00002448232,0.0005537692,0.0001759444,0.0001589336,0.0001843948],"domain_scores_gemma":[0.9977818,0.0001806842,0.0007561764,0.0002696411,0.0009512961,0.00006046978],"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.0001074779,0.0003932307,0.002332313,0.0002937404,0.0004181484,0.00003305284,0.001791451,0.03351143,0.01215627,0.3307442,0.03187299,0.5863457],"study_design_scores_gemma":[0.0009511253,0.0005133888,0.001357781,0.00006990202,0.00003247155,0.0001683063,0.0003565706,0.9667289,0.001207621,0.02620177,0.00223151,0.0001806827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03208404,0.0003374598,0.9666293,0.0005343881,0.0001269896,0.000194725,0.0000265484,0.00004511036,0.00002150067],"genre_scores_gemma":[0.5817568,0.00001510123,0.4180245,0.0000491834,0.0001233253,0.000003925277,0.00002301753,0.000002822752,0.000001365777],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9332174,"threshold_uncertainty_score":0.3921617,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009906336,0.000139907,0.0002870791,0.0001109611,0.00007896424,0.000094406,0.0004274978,0.00004333218,6.650735e-7],"category_scores_gemma":[0.00001205312,0.0001046798,0.00006476309,0.0003655514,0.00008315567,0.0002105406,0.0005260367,0.0003065125,8.016401e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000637883,"about_ca_system_score_gemma":0.00006325911,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007832708,"about_ca_topic_score_gemma":0.00001776371,"domain_scores_codex":[0.9984819,0.0002304987,0.0004821809,0.0002094933,0.0003143458,0.0002816339],"domain_scores_gemma":[0.9989873,0.0001280083,0.0003140128,0.0002288484,0.0001668842,0.0001749466],"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.00002330159,0.00008003811,0.00191037,0.00002991273,0.00004315652,0.00003947339,0.001157811,0.7713029,9.487845e-7,0.001211572,0.002141984,0.2220585],"study_design_scores_gemma":[0.001088067,0.0001951788,0.03911443,0.0001275354,0.00001202045,0.00004504731,0.000220566,0.9487374,0.00000313689,0.0007155972,0.009611505,0.0001294705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1355859,0.008670942,0.8522574,0.002630867,0.000583772,0.0001644363,0.000002163996,0.00001900147,0.00008551846],"genre_scores_gemma":[0.9828157,0.002543545,0.01404275,0.0001088108,0.0004659234,0.000001041087,0.000002187102,0.000007562499,0.00001244828],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8472298,"threshold_uncertainty_score":0.426872,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006396088,0.0001255228,0.0002185167,0.00008032686,0.0002826625,0.0002253579,0.0003547991,0.00005355418,0.000008357305],"category_scores_gemma":[0.00004649418,0.0000788988,0.0001587343,0.000194117,0.00002639982,0.0001925974,0.00005540569,0.000201629,0.00000288875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002450159,"about_ca_system_score_gemma":0.000008573087,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000640209,"about_ca_topic_score_gemma":0.000001894046,"domain_scores_codex":[0.9988597,0.0001055734,0.000468766,0.0001506663,0.0001998796,0.0002154388],"domain_scores_gemma":[0.9987378,0.0004042766,0.0004272714,0.0001487394,0.0002016167,0.00008036027],"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.0002297028,0.0007971413,0.001422921,0.0001017128,0.0007950503,0.0001220553,0.007572672,0.06151022,0.0001528703,0.2618494,0.1774634,0.4879829],"study_design_scores_gemma":[0.0007006479,0.0003412662,0.0004988569,0.00009304513,0.000009997541,0.0001321291,0.0001990236,0.9902954,0.000002906065,0.002935602,0.004687767,0.0001033313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008967653,0.0004627799,0.9877056,0.001968719,0.0005748351,0.0001489255,0.000008250146,0.00002330373,0.0001399557],"genre_scores_gemma":[0.9593897,0.00003838552,0.03970839,0.0003750823,0.0004408039,0.000003152558,0.000002888032,0.000005877851,0.00003567098],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9504221,"threshold_uncertainty_score":0.32174,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001438513,0.0001962478,0.0003320902,0.00007023291,0.0009428308,0.0001618139,0.001539959,0.00004673646,0.0000186958],"category_scores_gemma":[0.0001181153,0.00011701,0.0002336887,0.0004291212,0.0001053635,0.0001578627,0.001202161,0.0005728831,0.000002249945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001255499,"about_ca_system_score_gemma":0.00007835934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001143243,"about_ca_topic_score_gemma":9.243452e-7,"domain_scores_codex":[0.9980613,0.0001624217,0.0007113991,0.0002421823,0.0004718203,0.0003508795],"domain_scores_gemma":[0.9974213,0.001099813,0.0008700534,0.00030253,0.0002195303,0.00008680759],"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.0006294494,0.0002924399,0.001191801,0.00007324633,0.000300548,0.00006044942,0.008862535,0.05605625,0.00006640369,0.01252689,0.5748773,0.3450627],"study_design_scores_gemma":[0.0008216743,0.000802642,0.00265399,0.00007947484,0.0000574041,0.0004313885,0.001408258,0.3888714,0.0002670909,0.002733677,0.6015995,0.0002734806],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02305776,0.0009992862,0.9564605,0.006519256,0.01248632,0.0002489342,0.00001604896,0.0000242357,0.0001875895],"genre_scores_gemma":[0.9456829,0.00008655969,0.009448281,0.001356649,0.043069,0.000008778739,0.0000602461,0.00002760019,0.0002600031],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9470123,"threshold_uncertainty_score":0.7251588,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006476916,0.0001848481,0.0003224426,0.00007951912,0.0003470321,0.00008518664,0.0001973234,0.00006316789,0.000008799582],"category_scores_gemma":[0.00006021612,0.0001853106,0.0001317584,0.0002257231,0.00001888238,0.00006905459,0.00006166173,0.0004284569,4.450759e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001279948,"about_ca_system_score_gemma":0.00003313117,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003806005,"about_ca_topic_score_gemma":0.000002331338,"domain_scores_codex":[0.9985784,0.00007178947,0.0005442647,0.0001602773,0.0002728098,0.0003724232],"domain_scores_gemma":[0.9991629,0.0001634176,0.0002290587,0.0001417875,0.0001262544,0.0001766376],"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.00006072137,0.00006473484,0.001264785,0.00003105911,0.00007508052,0.00003829592,0.00007365978,0.9946814,0.0001584171,0.00009880099,0.001606268,0.001846836],"study_design_scores_gemma":[0.0010469,0.0002409797,0.002444911,0.00003350339,0.0000570943,0.0002318832,0.0001038608,0.9934165,0.000008493264,0.0001197435,0.002095407,0.0002007573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4255646,0.001710072,0.5722142,0.00004804638,0.0002753016,0.0001065509,0.00001764395,0.00006148107,0.00000215452],"genre_scores_gemma":[0.9805141,0.00002259716,0.01885333,0.00004175952,0.000364559,0.000007092322,0.0001641043,0.00003051499,0.000001946962],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5549495,"threshold_uncertainty_score":0.7556746,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000794446,0.0000981242,0.0003778509,0.0001899767,0.0003746013,0.00003621845,0.0004935935,0.00002748403,0.000007922338],"category_scores_gemma":[0.0000191644,0.00008250657,0.0001915577,0.001489174,0.00004195881,0.0002357571,0.0001701216,0.000217549,3.567159e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006111863,"about_ca_system_score_gemma":0.0001094417,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001205964,"about_ca_topic_score_gemma":4.898332e-7,"domain_scores_codex":[0.9985448,0.0000880474,0.000661391,0.00016582,0.0003696525,0.0001703129],"domain_scores_gemma":[0.9986046,0.0001778515,0.0007127835,0.0002523221,0.0001934077,0.00005903746],"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.00002198902,0.0001250787,0.1152618,0.00006502328,0.0002103605,0.000003758395,0.0004988752,0.8749413,0.00004625365,0.0004312875,0.00006681767,0.008327478],"study_design_scores_gemma":[0.0005308036,0.0001930875,0.09591424,0.00002539174,0.0001769576,0.0000460347,0.0002194123,0.9017235,0.00006215116,0.0001560281,0.0008321825,0.0001202251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3979505,0.0002383629,0.6015116,0.0001154398,0.00006859867,0.00005532721,0.00001023212,0.00001523351,0.00003472236],"genre_scores_gemma":[0.9806939,0.0000145696,0.01917874,0.0000543423,0.00003739654,0.000004250263,0.00001174474,0.000002794985,0.000002306526],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5827433,"threshold_uncertainty_score":0.336452,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002451972,0.0001492304,0.0003222417,0.0002165069,0.0002807371,0.0004683185,0.0004934223,0.0001814574,0.00001523281],"category_scores_gemma":[0.0001723103,0.0001262607,0.0001052256,0.0005408466,0.0000317952,0.0007957501,0.0002019722,0.0008064832,0.00001046975],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009406353,"about_ca_system_score_gemma":0.00004918901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001926296,"about_ca_topic_score_gemma":0.000004733872,"domain_scores_codex":[0.9977725,0.000444767,0.0006912658,0.0002877771,0.00042928,0.0003744809],"domain_scores_gemma":[0.9976347,0.0007697768,0.0003885347,0.0002955861,0.0007281846,0.0001832246],"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.00004286193,0.00005206783,0.002995726,0.00001235344,0.0000324204,0.0000123092,0.0005762798,0.9680263,0.00001812791,0.008890839,0.0003146274,0.01902609],"study_design_scores_gemma":[0.0004653385,0.000452772,0.00485075,0.0002481113,0.00000498563,0.0001419029,0.0003796248,0.9884006,0.000003903856,0.003927017,0.000981045,0.0001439746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1953448,0.0002056709,0.8024333,0.0001745328,0.001608292,0.0001091605,0.000001584377,0.0000331619,0.00008953609],"genre_scores_gemma":[0.9788825,0.00001593815,0.02006348,0.00008395545,0.0009135879,7.015437e-7,0.00000649303,0.000009227991,0.00002411626],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7835377,"threshold_uncertainty_score":0.5148763,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007464035,0.0002562264,0.0004747122,0.0001806788,0.0002033511,0.0001473396,0.002118218,0.0001525861,0.000004071583],"category_scores_gemma":[0.000267875,0.0002116399,0.00009296674,0.0004744799,0.00004878161,0.0004127347,0.001700669,0.000362569,0.000001677954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004761132,"about_ca_system_score_gemma":0.000106402,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001666853,"about_ca_topic_score_gemma":0.0000372806,"domain_scores_codex":[0.9979222,0.0000339077,0.000684349,0.0004769228,0.0003341162,0.0005484956],"domain_scores_gemma":[0.9980436,0.000202636,0.0004352728,0.0006744183,0.0003242925,0.0003197591],"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.001204049,0.001118547,0.027203,0.0001340534,0.0008219357,0.0006425334,0.002234616,0.3759366,0.001888272,0.01010711,0.2225417,0.3561676],"study_design_scores_gemma":[0.002665304,0.0007514565,0.04681189,0.0001589497,0.00005522134,0.0007104788,0.0000939672,0.9426842,0.00006840104,0.001094219,0.004409557,0.0004963422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04280391,0.0002762846,0.9548511,0.0009720759,0.000563374,0.0002467744,0.0001731849,0.0001017636,0.00001151226],"genre_scores_gemma":[0.5211983,0.000003866277,0.4781733,0.0003779367,0.0001847613,0.000001345117,0.00004198099,0.000009025127,0.000009390133],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5667476,"threshold_uncertainty_score":0.8630422,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002259544,0.0001186366,0.0003027015,0.00005282626,0.00007886317,0.0000119251,0.0001214243,0.00008155732,0.000001200141],"category_scores_gemma":[0.00009845962,0.00008480813,0.0000432875,0.0001841791,0.0002969222,0.00005338582,0.000057937,0.000457601,1.183854e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002793995,"about_ca_system_score_gemma":0.000005807473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.849886e-7,"about_ca_topic_score_gemma":0.00000115695,"domain_scores_codex":[0.9991592,0.00002469177,0.0004098956,0.00008369672,0.0001086191,0.0002138681],"domain_scores_gemma":[0.9993093,0.0004092694,0.0001028826,0.0000853461,0.00003747578,0.00005570358],"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.00002069663,0.00002504768,0.0003548914,0.00001120233,0.00002373349,0.00006299676,0.00004636308,0.9720032,0.00001822361,0.004603124,0.0001196293,0.02271092],"study_design_scores_gemma":[0.0004948087,0.00009696268,0.01165781,0.0001228389,0.000008604036,0.0002321538,0.0001442137,0.9830379,0.00001501898,0.004071895,0.00002430797,0.00009347797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5748588,0.0008517716,0.4240273,0.0001397597,0.00003779207,0.00003800005,0.000001733987,0.00002493928,0.00001991465],"genre_scores_gemma":[0.9448172,0.0002615039,0.05484807,0.00001185057,0.00005138596,3.416564e-7,0.000001662456,0.000007560255,4.159464e-7],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3699584,"threshold_uncertainty_score":0.3458375,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009386275,0.0001474907,0.0003330598,0.0001121446,0.000113966,0.0001323408,0.000381615,0.00005304658,0.000003165779],"category_scores_gemma":[0.000382658,0.0000904714,0.00006465481,0.0002614844,0.00005465207,0.0003851009,0.000439957,0.0002076633,9.739639e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000330236,"about_ca_system_score_gemma":0.00003184224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001679034,"about_ca_topic_score_gemma":9.390167e-7,"domain_scores_codex":[0.9984985,0.0001411114,0.000571688,0.0002349998,0.0002445228,0.0003091687],"domain_scores_gemma":[0.9987195,0.0004650294,0.0003482642,0.0001785716,0.000100817,0.0001878095],"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.00002711498,0.0001811765,0.02740381,0.00004354253,0.00003408975,0.0002493427,0.0004450221,0.0007405613,0.002985252,0.006356044,0.000163915,0.9613701],"study_design_scores_gemma":[0.00733666,0.001036501,0.3736542,0.001918409,0.00002846027,0.0007309956,0.0002543697,0.4385559,0.0008850608,0.1744042,0.0004023493,0.000792874],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2285845,0.0003190575,0.769368,0.001495038,0.0001545774,0.00003959522,0.000003049232,0.00001317663,0.00002307514],"genre_scores_gemma":[0.7029152,0.00005904652,0.2968844,0.0000579474,0.00007422804,1.830536e-7,2.930217e-7,0.000004271873,0.00000444948],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9605772,"threshold_uncertainty_score":0.3689317,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001163232,0.000167175,0.0003650501,0.00006119658,0.0002097428,0.00008032378,0.0004761545,0.00005943355,0.000001136043],"category_scores_gemma":[0.0002863509,0.0001035696,0.0002628686,0.0002647227,0.00009714447,0.0001054634,0.00006249313,0.0002590115,1.283693e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000356085,"about_ca_system_score_gemma":0.0001638406,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001250861,"about_ca_topic_score_gemma":0.000003913917,"domain_scores_codex":[0.9984438,0.000225383,0.0005418055,0.0001760595,0.0003297249,0.0002831705],"domain_scores_gemma":[0.9985375,0.0004402017,0.000448708,0.0001785804,0.0002989208,0.00009604975],"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.0005375696,0.0003557718,0.0004038204,0.0001510507,0.0005230145,0.00009808999,0.007623877,0.04395432,0.005400082,0.0195209,0.001498448,0.9199331],"study_design_scores_gemma":[0.0105644,0.001299003,0.006768205,0.0005181364,0.0001710151,0.001198179,0.0005005734,0.8439237,0.02921592,0.1017466,0.003429128,0.0006651134],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0102075,0.0005326711,0.9881862,0.0005240517,0.0002329305,0.0001819987,0.00003006089,0.00001072826,0.00009389102],"genre_scores_gemma":[0.5826786,0.000003705406,0.4171761,0.00005665718,0.00005755504,9.422516e-7,0.000001083337,0.000005350791,0.00002000238],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.919268,"threshold_uncertainty_score":0.4223446,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001839672,0.0001864834,0.0003594476,0.0001037917,0.0003113303,0.0002367984,0.0008000258,0.0001177676,3.680117e-7],"category_scores_gemma":[0.0001127626,0.000162323,0.0000611591,0.0002830152,0.00007055777,0.0003618349,0.0006020639,0.0003281622,1.930008e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003034657,"about_ca_system_score_gemma":0.00003359614,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004720624,"about_ca_topic_score_gemma":0.000003561548,"domain_scores_codex":[0.9981505,0.00005855144,0.0006884809,0.0003686419,0.0002478689,0.0004859125],"domain_scores_gemma":[0.9977518,0.0007833726,0.0005974443,0.000406888,0.0002175729,0.0002429416],"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.0001532612,0.0001133071,0.007838865,0.00005171219,0.0001321273,0.0002193809,0.0003010108,0.8728165,0.000198786,0.01042357,0.002452682,0.1052988],"study_design_scores_gemma":[0.001053624,0.0001096041,0.004133154,0.0001209188,0.00002672346,0.0005108977,0.0001462734,0.9920554,0.00001731531,0.0001107783,0.001516878,0.0001984905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1403915,0.001209963,0.8573217,0.0003623915,0.0005525448,0.00008716663,0.000007044263,0.00003775821,0.00002993173],"genre_scores_gemma":[0.8458434,0.00008621977,0.1532775,0.0001185729,0.0006352116,2.112393e-7,0.00002066914,0.0000109638,0.000007242827],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7054519,"threshold_uncertainty_score":0.661934,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001246106,0.0001749485,0.000303652,0.0002561872,0.000321659,0.0002989508,0.0004837904,0.00008493361,0.000007727928],"category_scores_gemma":[0.0005135697,0.0001443318,0.00005485177,0.001051747,0.00006444302,0.0006531487,0.0001856876,0.0003759723,0.000002967143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005504993,"about_ca_system_score_gemma":0.0001679038,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003037582,"about_ca_topic_score_gemma":1.406607e-7,"domain_scores_codex":[0.9979373,0.0002081034,0.0006121288,0.0001847664,0.0006122412,0.0004454477],"domain_scores_gemma":[0.997812,0.0002593148,0.0005976562,0.0001857815,0.0007884862,0.0003567168],"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.00004566716,0.0002070679,0.003018905,0.00003683046,0.00004018786,0.0000302932,0.0004303019,0.9734492,0.0000082155,0.01128203,0.001005103,0.01044615],"study_design_scores_gemma":[0.0008661214,0.000178304,0.004374648,0.00008765088,0.00001546543,0.0002058851,0.00007194529,0.9929945,0.00001056057,0.0002381846,0.0007903611,0.0001663382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005648012,0.0007729215,0.9923618,0.0006299473,0.0002653364,0.0001091262,0.000004944571,0.00004051962,0.0001674376],"genre_scores_gemma":[0.6469975,0.0001325099,0.3524372,0.0001678949,0.0002237773,9.63972e-7,0.00001260797,0.000009792268,0.00001771251],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6413495,"threshold_uncertainty_score":0.588568,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009172851,0.0002071682,0.0004139641,0.000223719,0.0008559518,0.0002190132,0.0008789093,0.00004352077,0.00001810929],"category_scores_gemma":[0.0001106064,0.0001977735,0.0001509283,0.0005573958,0.00005571077,0.0003020392,0.000963508,0.0004862363,0.00000107345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001341368,"about_ca_system_score_gemma":0.0001535622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002587638,"about_ca_topic_score_gemma":4.479257e-7,"domain_scores_codex":[0.9978714,0.0002725329,0.0006883426,0.0002967189,0.0005042031,0.0003668179],"domain_scores_gemma":[0.9981631,0.0002208356,0.0008587445,0.0002701389,0.0003023594,0.0001847951],"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.00006099213,0.0001677572,0.008920866,0.00001293297,0.00007519979,0.0002391148,0.0005244277,0.9805678,0.0001903534,0.00380434,0.003069912,0.002366315],"study_design_scores_gemma":[0.001212394,0.0003280158,0.004478275,0.00006547122,0.00002437446,0.001447845,0.0002840366,0.9881962,0.00006845596,0.002647033,0.0009380446,0.0003098578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1975669,0.0004018378,0.8011007,0.00033526,0.0002996594,0.00008036081,0.00001289066,0.0001242943,0.00007810394],"genre_scores_gemma":[0.8747309,0.0000135592,0.1249073,0.000235137,0.0000841491,6.210503e-7,0.000007896877,0.000009209756,0.0000112266],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.677164,"threshold_uncertainty_score":0.8064967,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008128494,0.0001081698,0.0001806323,0.0001563265,0.0005582809,0.0001367845,0.0004243117,0.00002459647,0.000005316986],"category_scores_gemma":[0.00004147027,0.00009969245,0.00007946515,0.0004446229,0.00002787812,0.00003975509,0.0003401701,0.0002461072,4.882297e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007817213,"about_ca_system_score_gemma":0.00007224287,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004614916,"about_ca_topic_score_gemma":6.79417e-8,"domain_scores_codex":[0.9985572,0.0001823848,0.0004557544,0.0001950802,0.0004250573,0.0001844958],"domain_scores_gemma":[0.9990325,0.0001103288,0.000479707,0.0001650973,0.0001238781,0.00008848167],"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.00001669734,0.0001422153,0.002686643,0.00001755367,0.00002946807,0.00001392018,0.0002641279,0.9779579,0.00001213621,0.003792348,0.001440678,0.0136263],"study_design_scores_gemma":[0.0008588426,0.0001777626,0.005613197,0.00001589163,0.00001698295,0.0001381718,0.0003314971,0.9881969,0.00000893722,0.000446268,0.004097693,0.00009781859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08948199,0.0002501176,0.9089776,0.0005358434,0.0002970484,0.00008244094,0.000007554262,0.00006022292,0.0003071737],"genre_scores_gemma":[0.9755415,0.000002371332,0.0241245,0.0001698334,0.0001141845,0.000001627992,0.0000243335,0.00000485338,0.00001676571],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8860595,"threshold_uncertainty_score":0.4293902,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006398534,0.0001550272,0.0002966236,0.0001550742,0.0001276056,0.0003387111,0.000345616,0.00005019148,0.000004099615],"category_scores_gemma":[0.00004410225,0.0001384728,0.0000682867,0.0002870073,0.00004536262,0.0004110783,0.0004093968,0.000238194,7.451198e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008602865,"about_ca_system_score_gemma":0.00003175599,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005992212,"about_ca_topic_score_gemma":0.00000571398,"domain_scores_codex":[0.9985233,0.0001151964,0.0005509829,0.0002420959,0.0001675188,0.0004008915],"domain_scores_gemma":[0.9989403,0.0002624546,0.000343763,0.0001540364,0.0001314127,0.0001680046],"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.00001786767,0.00005200321,0.004441017,0.00004077637,0.00004208792,0.00003271194,0.0003795445,0.9662477,0.00004500894,0.0004959102,0.0006906061,0.02751473],"study_design_scores_gemma":[0.001199461,0.0001723533,0.010142,0.0001880233,0.00001269997,0.00002921695,0.000237769,0.9869956,0.000005121198,0.0006125872,0.0002639795,0.0001412217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4756667,0.0002001487,0.5236933,0.00009088354,0.00008274624,0.0002468021,9.514501e-7,0.00001061942,0.000007903812],"genre_scores_gemma":[0.963631,0.00004727497,0.03600724,0.0001718474,0.0001193042,0.000006024832,0.000004667051,0.000008252945,0.000004370396],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4879643,"threshold_uncertainty_score":0.5646757,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001001073,0.000120903,0.0002259063,0.0002947724,0.0001869179,0.0005114616,0.0002044777,0.00009355954,0.000002408685],"category_scores_gemma":[0.00008454981,0.0001038653,0.00007241068,0.0007088356,0.00001686165,0.0005889891,0.0001466239,0.0006307409,0.000003102118],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009067365,"about_ca_system_score_gemma":0.00004770339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003345401,"about_ca_topic_score_gemma":0.000004596469,"domain_scores_codex":[0.9986163,0.0001644508,0.0005490559,0.0002057636,0.0002413854,0.0002230267],"domain_scores_gemma":[0.9993393,0.0001964024,0.0001863412,0.00008384497,0.0001028527,0.00009118718],"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.00006882584,0.00005943385,0.001195424,0.0002216876,0.00005197704,0.0003453875,0.001726775,0.5805728,0.005850976,0.003964317,0.0001673462,0.405775],"study_design_scores_gemma":[0.0003541107,0.0001721668,0.0009085283,0.0005271242,0.000007689262,0.0005548082,0.0002273911,0.9924208,0.0001598424,0.000685906,0.003863499,0.0001181368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3338062,0.003515751,0.6614881,0.0001462298,0.0008952524,0.00004579262,3.640586e-7,0.00006921106,0.00003315629],"genre_scores_gemma":[0.9980394,0.0003142754,0.001221143,0.00001983669,0.0003882219,6.434582e-7,0.0000016671,0.000006055608,0.000008726281],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6642333,"threshold_uncertainty_score":0.4932036,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001030196,0.0001891566,0.0003706235,0.000223946,0.0001733789,0.0001787043,0.0006906918,0.00005858939,0.000002795359],"category_scores_gemma":[0.00007622768,0.000172396,0.00009302495,0.0003265735,0.00004924923,0.0002492051,0.000258132,0.0002831941,0.000004450199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006084258,"about_ca_system_score_gemma":0.00006198596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005641312,"about_ca_topic_score_gemma":6.065672e-7,"domain_scores_codex":[0.9981506,0.0001643526,0.0007743952,0.0002839138,0.0003006933,0.000325975],"domain_scores_gemma":[0.9985846,0.0002029761,0.0005581328,0.0002967539,0.0001878944,0.0001696869],"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.00004206783,0.0003117012,0.00460522,0.00005027003,0.00005324453,0.00004329904,0.0003102172,0.8990212,0.00009938452,0.04988052,0.004736316,0.04084654],"study_design_scores_gemma":[0.001383704,0.0001899685,0.004965505,0.000104566,0.0000119154,0.0002512996,0.00003338341,0.9672162,0.00005444798,0.01353816,0.01196948,0.0002813601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01144944,0.0004472322,0.9867349,0.0006650407,0.00009309819,0.0001532529,0.000002650521,0.00009566863,0.0003586726],"genre_scores_gemma":[0.7603792,0.00005923089,0.239248,0.000167022,0.0001103585,0.000004149372,0.000009250511,0.000006734517,0.00001605045],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7489297,"threshold_uncertainty_score":0.7030104,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009519918,0.0001284657,0.0002788155,0.0002579039,0.000111444,0.0002280016,0.0008324738,0.00008369361,0.000001487151],"category_scores_gemma":[0.0003304537,0.0001104274,0.00005768297,0.001073678,0.0000689125,0.001354033,0.0006429369,0.0003033195,0.00001379616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007268965,"about_ca_system_score_gemma":0.00005837633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002249531,"about_ca_topic_score_gemma":0.000001572292,"domain_scores_codex":[0.9984525,0.00005599888,0.000646881,0.0002791315,0.0002794518,0.0002860577],"domain_scores_gemma":[0.9985804,0.0003744923,0.0004028774,0.0004091602,0.0001509607,0.00008211504],"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.00005007454,0.000187325,0.008561038,0.00008018639,0.00002453984,0.0003168518,0.0005552919,0.09979893,0.0003706353,0.01806971,0.004788557,0.8671969],"study_design_scores_gemma":[0.004296354,0.0007640109,0.1301845,0.0009023106,0.00003136165,0.0008695432,0.004199925,0.5282002,0.0006687999,0.2686414,0.0601658,0.001075687],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08895513,0.0006884092,0.9087209,0.001108297,0.0001971007,0.0001404581,0.000008369398,0.0001663325,0.00001508587],"genre_scores_gemma":[0.8715416,0.001006662,0.127287,0.00005372025,0.00005820543,0.000006654092,0.00002955805,0.000006723244,0.000009866269],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8661212,"threshold_uncertainty_score":0.4503099,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}