{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":19,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":19,"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":"217167b2f74c","filters":{"venue":"International Journal of Parallel Programming"}},"results":[{"id":"W1991592471","doi":"10.1007/s10766-014-0320-y","title":"pocl: A Performance-Portable OpenCL Implementation","year":2014,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":124,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph; Perimeter Institute","funders":"","keywords":"Software portability; Compiler; Porting; SIMD; Kernel (algebra); Data parallelism; Parallelism (grammar); Exploit; Stencil","retraction":null,"screen_n_in":null,"score":{"opus":0.01600255926352157,"gpt":0.3110218934464314,"spread":0.2950193341829098,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009348716,0.0001122139,0.0001589946,0.0002468853,0.00008609772,0.0003605671,0.001333029,0.00003720909,0.00003073837],"category_scores_gemma":[0.00005293389,0.0001001564,0.00009759414,0.0001639519,0.00002177931,0.0009632935,0.000170402,0.0001515371,0.00001628203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006655973,"about_ca_system_score_gemma":0.00008354528,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001825557,"about_ca_topic_score_gemma":0.000002371691,"domain_scores_codex":[0.9984375,0.0000605942,0.0005721748,0.0001563698,0.0005712791,0.0002021053],"domain_scores_gemma":[0.9985302,0.00004293751,0.0005774501,0.000163132,0.0006033716,0.00008289561],"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.00002134831,0.00008551946,0.007355275,0.000006784499,0.00008255931,0.00001746738,0.0004204045,0.0114264,0.0000878421,0.01251525,0.00136409,0.966617],"study_design_scores_gemma":[0.004008721,0.001465688,0.01145808,0.0002715378,0.00003902355,0.001050601,0.000214083,0.5308068,0.004888523,0.007821762,0.4371701,0.0008050894],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02007829,0.00004741312,0.9768229,0.000857183,0.0006725403,0.00009214393,1.876678e-7,0.00009628775,0.001333055],"genre_scores_gemma":[0.5700089,0.00003748919,0.429519,0.0001793017,0.0001788837,0.000004345877,0.000002771179,0.000005659201,0.00006369633],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.965812,"threshold_uncertainty_score":0.4084258,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029940726","doi":"10.1007/s10766-005-0004-8","title":"Embedded Software Verification Using Symbolic Execution and Uninterpreted Functions","year":2006,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":37,"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","keywords":"Computer science; Symbolic execution; Programming language; Scalability; Formal verification; Model checking; Embedded software; Software; Key (lock); Computer architecture; Parallel computing; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.0200795795192456,"gpt":0.301138606099302,"spread":0.2810590265800564,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005656859,0.0001230043,0.0001458476,0.0003280015,0.0001070308,0.0003146038,0.0006187328,0.00006979914,0.000005433169],"category_scores_gemma":[0.0001809213,0.0001198572,0.00008733545,0.0002374336,0.00007081986,0.001210937,0.00009707936,0.00018636,0.000004623982],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001652214,"about_ca_system_score_gemma":0.00007805191,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004721236,"about_ca_topic_score_gemma":0.000003057754,"domain_scores_codex":[0.9984947,0.0001062562,0.0005646127,0.000192017,0.0004734451,0.0001689454],"domain_scores_gemma":[0.9984279,0.00005797147,0.0005992652,0.0001885516,0.0006631279,0.00006320434],"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.0002902159,0.0005842728,0.01310136,0.00004926466,0.0003883401,0.0001093587,0.002554805,0.02598421,0.03074851,0.157995,0.0005300398,0.7676646],"study_design_scores_gemma":[0.003787822,0.0006942055,0.06099759,0.0006260607,0.0001725889,0.004597929,0.0008421474,0.8602654,0.007553613,0.02541778,0.03389139,0.001153478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08975828,0.0002298383,0.9085031,0.000182672,0.001046086,0.0001027155,0.000001432127,0.00006256689,0.000113351],"genre_scores_gemma":[0.4592128,0.000009952056,0.5405297,0.00002402968,0.000177774,0.000003883477,0.000004769025,0.000006349967,0.00003068751],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8342812,"threshold_uncertainty_score":0.4887634,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062877387","doi":"10.1007/s10766-013-0286-1","title":"CCAP: A Cache Contention-Aware Virtual Machine Placement Approach for HPC Cloud","year":2013,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Leukemia and Lymphoma Society of Canada","keywords":"Computer science; Cache; Cache coloring; Smart Cache; Cache algorithms; Cache invalidation; Cache pollution; Page cache; Operating system; Cache-oblivious algorithm; Hypervisor; Cloud computing; Virtual machine; Virtualization; CPU cache","retraction":null,"screen_n_in":null,"score":{"opus":0.02072319322066504,"gpt":0.2664171845668166,"spread":0.2456939913461515,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006358767,0.0001760353,0.0002272527,0.0002209758,0.0001170024,0.0005159819,0.001552137,0.0000514253,0.00001764947],"category_scores_gemma":[0.00006962309,0.0001407617,0.0002783904,0.0001225637,0.00004106926,0.0001332236,0.000348998,0.0002159622,0.00001368742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001280933,"about_ca_system_score_gemma":0.00003815542,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005830394,"about_ca_topic_score_gemma":0.000002051247,"domain_scores_codex":[0.9979934,0.00006372146,0.0006491721,0.0002584986,0.0007359277,0.0002993407],"domain_scores_gemma":[0.9982991,0.0001113226,0.000549011,0.000201574,0.000707586,0.0001314191],"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.0001879003,0.001504391,0.001691896,0.00006231993,0.001551684,0.0000829433,0.002404318,0.1621837,0.000187794,0.03027223,0.01686354,0.7830073],"study_design_scores_gemma":[0.003460845,0.0006846229,0.0004061707,0.0001073758,0.00003710102,0.0002365627,0.0009789988,0.9382109,0.00006539415,0.0009922645,0.05449395,0.0003258261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02332445,0.0002044509,0.9725338,0.002043513,0.0009433473,0.0004627937,0.000001106456,0.00005836584,0.0004281688],"genre_scores_gemma":[0.8244761,0.000005521713,0.1734646,0.0002840149,0.0007091306,0.00005560796,0.000008229175,0.00001345222,0.0009833513],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8011517,"threshold_uncertainty_score":0.5740095,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2090209978","doi":"10.1007/s10766-009-0094-9","title":"A Speculative and Adaptive MPI Rendezvous Protocol Over RDMA-enabled Interconnects","year":2009,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Parallel Computing and Optimization 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":"Remote direct memory access; Computer science; InfiniBand; Rendezvous; Message passing; Computer network; Message Passing Interface; Latency (audio); Protocol (science); Distributed computing; Overhead (engineering); Parallel computing; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.02013553902287299,"gpt":0.316397548544232,"spread":0.296262009521359,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005021599,0.000185187,0.0002504751,0.0003262573,0.00007664068,0.0004057412,0.0009439045,0.00006909328,0.000009920126],"category_scores_gemma":[0.0001373177,0.0001574392,0.0001243931,0.0001968588,0.00004960144,0.00087254,0.0001763803,0.0002838408,0.000002592151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001072568,"about_ca_system_score_gemma":0.00009698631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008973088,"about_ca_topic_score_gemma":0.000002068151,"domain_scores_codex":[0.9982761,0.0001026795,0.0005740048,0.0002585089,0.0005550493,0.0002337149],"domain_scores_gemma":[0.9983338,0.00008814267,0.0006450443,0.000163336,0.0006448529,0.0001247994],"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.0008365454,0.0008115558,0.001282359,0.00001941068,0.0004974028,0.001025991,0.004522214,0.01107671,0.0005804415,0.1247183,0.002912882,0.8517162],"study_design_scores_gemma":[0.01570895,0.00915749,0.01932574,0.001987329,0.00008380569,0.004673509,0.0005023158,0.6658526,0.004805865,0.183256,0.09242371,0.002222692],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002008315,0.00005667757,0.9915174,0.001127329,0.0002133575,0.003589194,5.021566e-7,0.0001297759,0.001357398],"genre_scores_gemma":[0.4786592,0.000009238586,0.5203756,0.000340194,0.0002056706,0.0003155883,7.30731e-7,0.000007891999,0.00008592808],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8494935,"threshold_uncertainty_score":0.6420185,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980008253","doi":"10.1007/s10766-010-0152-3","title":"Process Arrival Pattern Aware Alltoall and Allgather on InfiniBand Clusters","year":2010,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Parallel Computing and Optimization Techniques","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"InfiniBand; Remote direct memory access; Computer science; Speedup; Process (computing); Implementation; Parallel computing; Message passing; Theory of computation; Message Passing Interface; Distributed computing; Operating system; Algorithm; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01244479937963613,"gpt":0.2962985924852328,"spread":0.2838537931055967,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004767717,0.0001613723,0.00017939,0.0002474202,0.00007463658,0.0003762254,0.001179478,0.00008412583,0.00001044204],"category_scores_gemma":[0.00008654955,0.000135933,0.00009057173,0.00009728915,0.00006327479,0.0004680141,0.0001456953,0.000455859,0.000004390806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002359208,"about_ca_system_score_gemma":0.00007166451,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000093995,"about_ca_topic_score_gemma":0.000008562311,"domain_scores_codex":[0.9984999,0.0000436538,0.0004419024,0.0002255908,0.000585915,0.0002029989],"domain_scores_gemma":[0.9987165,0.00009410505,0.0004415364,0.0001762926,0.0004386724,0.0001328938],"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.000169229,0.0005096049,0.01601989,0.00003382492,0.0003471984,0.0003617847,0.003393216,0.01797479,0.0003750061,0.005043841,0.001168672,0.954603],"study_design_scores_gemma":[0.01022743,0.003642525,0.01818201,0.001230229,0.00008779732,0.004997147,0.0005216761,0.8276681,0.004581315,0.01971819,0.1066388,0.002504827],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1171176,0.0000396004,0.8786601,0.002554237,0.0009816631,0.0001242994,9.34131e-7,0.0001116029,0.0004098857],"genre_scores_gemma":[0.9015593,0.00001976437,0.09749884,0.0005616533,0.0002964119,0.000005393087,0.00000165715,0.00001248726,0.00004451623],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9520981,"threshold_uncertainty_score":0.5543189,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1582451000","doi":"10.1023/a:1023086618401","title":"Large System Performance of SPEC OMP Benchmark Suites","year":2003,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Hewlett-Packard (Canada)","funders":"","keywords":"Computer science; Spec#; Benchmark (surveying); Scalability; Scale (ratio); Parallel computing; Theory of computation; Operating system; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01146068857138414,"gpt":0.2513160070212024,"spread":0.2398553184498183,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001339964,0.0001564111,0.0003115267,0.0002299668,0.00007019315,0.0002023836,0.001500435,0.00005909578,0.00001293034],"category_scores_gemma":[0.0001360278,0.0001344908,0.0002056985,0.0002558797,0.00003379847,0.0005054395,0.0001127908,0.0002025199,0.00001464197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001073466,"about_ca_system_score_gemma":0.00014659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000860339,"about_ca_topic_score_gemma":0.000001608574,"domain_scores_codex":[0.9976485,0.0001281797,0.0008844318,0.0001836711,0.0008531011,0.0003021429],"domain_scores_gemma":[0.9977645,0.0001498949,0.0009393785,0.0002261317,0.0008112039,0.0001089272],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002190452,0.00136866,0.2057664,0.0005796404,0.001502578,0.0008283144,0.005088785,0.02661399,0.0008380263,0.697156,0.002631577,0.05740697],"study_design_scores_gemma":[0.01227499,0.003106724,0.03601512,0.005693997,0.000156362,0.01218644,0.003225804,0.2108209,0.005604594,0.002022204,0.7067037,0.002189143],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3709685,0.0007256437,0.6216169,0.0001475443,0.00315677,0.0001526553,0.000005514818,0.00006061955,0.003165842],"genre_scores_gemma":[0.9505326,0.00001690222,0.04910262,0.00002131252,0.0002273276,0.000002448463,0.000003601026,0.00000783752,0.00008540438],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7040721,"threshold_uncertainty_score":0.5484377,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071505781","doi":"10.1007/s10766-013-0245-x","title":"Parallel Training of An Improved Neural Network for Text Categorization","year":2013,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Text and Document Classification 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":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Speedup; Computer science; Categorization; Correctness; Artificial neural network; The Internet; Artificial intelligence; Text categorization; Process (computing); Machine learning; Data mining; Parallel computing; Algorithm; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.03387168784162624,"gpt":0.2973515778122583,"spread":0.263479889970632,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003818524,0.0001230887,0.0002038114,0.0001873774,0.00006472076,0.0003107793,0.001413339,0.00007374529,0.00001308395],"category_scores_gemma":[0.0001365218,0.0001049812,0.0001364196,0.0001760978,0.00005942748,0.001650385,0.00009269413,0.0001375058,0.000002618768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004490141,"about_ca_system_score_gemma":0.00007792947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000241586,"about_ca_topic_score_gemma":0.000005453315,"domain_scores_codex":[0.998527,0.00003557901,0.000673075,0.0001756878,0.0003503185,0.0002383754],"domain_scores_gemma":[0.9979346,0.0001066475,0.0008721399,0.0001921352,0.0008199937,0.00007447574],"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.00004727008,0.0001251767,0.0008012072,0.000008882545,0.000107154,0.000003773406,0.0008202303,0.009095717,0.001814943,0.04699799,0.000371222,0.9398064],"study_design_scores_gemma":[0.003598399,0.00160711,0.008770955,0.00009324295,0.00003787376,0.0001791906,0.001609935,0.8621325,0.001333403,0.1049781,0.01513772,0.0005215714],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03275125,0.0001357947,0.9631662,0.002677844,0.0008023863,0.0003270115,9.888925e-7,0.00008573655,0.00005283183],"genre_scores_gemma":[0.6039852,0.00001044423,0.3956682,0.00005705783,0.0001891334,0.00003498898,0.000006162177,0.000006668765,0.00004206474],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9392849,"threshold_uncertainty_score":0.428101,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2138333931","doi":"10.1007/s10766-007-0066-x","title":"Analyzing the Effects of Hyperthreading on the Performance of Data Management Systems","year":2008,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":7,"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":"Computer science; Pentium; Multithreading; Operating system; Benchmark (surveying); Parallel computing; Computer architecture; Embedded system","retraction":null,"screen_n_in":null,"score":{"opus":0.03246800490371323,"gpt":0.2733394568158058,"spread":0.2408714519120926,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001052765,0.0000864321,0.0001529838,0.0001459407,0.0001086396,0.00005902162,0.003001526,0.00001755283,0.000001183846],"category_scores_gemma":[0.00006060553,0.00004622153,0.00009029879,0.0001998571,0.0001005759,0.0004554021,0.0003177354,0.0001586761,0.000001553858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000179903,"about_ca_system_score_gemma":0.00002191705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005631536,"about_ca_topic_score_gemma":2.115769e-7,"domain_scores_codex":[0.9986699,0.0001063528,0.0004269287,0.0001193695,0.0005540619,0.0001233723],"domain_scores_gemma":[0.9983607,0.0004363841,0.0005700436,0.0004004092,0.0002053447,0.00002713685],"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.0002415263,0.0007396769,0.01799573,0.0003764786,0.00279633,0.0005852806,0.004033801,0.01952721,0.001457341,0.3364701,0.0005009976,0.6152756],"study_design_scores_gemma":[0.007206644,0.004216247,0.04063151,0.009799872,0.0004624088,0.004832027,0.002537546,0.8828821,0.01618246,0.00768977,0.02228161,0.001277775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7017785,0.001284057,0.2943274,0.000617835,0.001427445,0.0002659098,0.000001561158,0.00001316776,0.000284114],"genre_scores_gemma":[0.9863571,0.0003098507,0.01315584,0.00002886733,0.0001050302,0.000003942378,7.746883e-7,0.000004179989,0.00003442328],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8633549,"threshold_uncertainty_score":0.5577631,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2766218044","doi":"10.1007/s10766-017-0534-x","title":"A Novel Auction-Based Query Pricing Schema","year":2017,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":7,"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":"Jilin Scientific and Technological Development Program; National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Schema (genetic algorithms); Theory of computation; Query optimization; Theoretical computer science; Information retrieval; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.135730087474902,"gpt":0.4453235509090462,"spread":0.3095934634341443,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002521034,0.000114196,0.0002073398,0.0003222568,0.0005013928,0.001079504,0.002039621,0.00006139259,0.0001604478],"category_scores_gemma":[0.003272755,0.00008822301,0.0002617215,0.0001169989,0.000195683,0.0009092363,0.0001174897,0.0002507933,0.00009078862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000772554,"about_ca_system_score_gemma":0.0001627228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002418123,"about_ca_topic_score_gemma":0.00001082695,"domain_scores_codex":[0.9972715,0.00004959965,0.0008675277,0.0002139682,0.001433662,0.0001637352],"domain_scores_gemma":[0.9954674,0.0004158636,0.001992735,0.000437129,0.001564414,0.0001224146],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004564616,0.0007864247,0.01886766,0.000004831587,0.0003162369,0.00008532812,0.0005703133,0.02002697,0.007097035,0.05046931,0.002052838,0.8992666],"study_design_scores_gemma":[0.005774206,0.0003161697,0.04394206,0.0003244644,0.00009473381,0.00139159,0.002401884,0.02296492,0.007894154,0.09541313,0.8187358,0.0007468883],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05780983,0.00004879507,0.9310205,0.008051713,0.001630655,0.0001131986,0.000004096759,0.00002173774,0.00129949],"genre_scores_gemma":[0.9248855,0.000005120628,0.07339986,0.0001678601,0.0007929085,0.000009781175,0.000001318045,0.000009354348,0.0007283165],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8985197,"threshold_uncertainty_score":0.9999574,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046897173","doi":"10.1007/s10766-012-0210-0","title":"Removal of Conflicts in Hardware Transactional Memory Systems","year":2012,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"European Research Consortium for Informatics and Mathematics; Ministère de l'Économie, de la Science et de l'Innovation - Québec; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Computer science; False sharing; Transactional memory; Cache; Cache coherence; Software versioning; Class (philosophy); Distributed computing; Theory of computation; Conflict resolution; Shared memory; Parallel computing; CPU cache; Operating system; Cache algorithms; Database transaction; Algorithm; Programming language; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02488882091974005,"gpt":0.2882694005470693,"spread":0.2633805796273292,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000892122,0.0001080151,0.0002606047,0.0002241219,0.00002164786,0.0001002843,0.0008424879,0.00006196853,0.000009071897],"category_scores_gemma":[0.00004717469,0.00009568117,0.0001406416,0.0001681606,0.00003435612,0.0009880145,0.00003802287,0.000198625,0.0000053703],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009851996,"about_ca_system_score_gemma":0.00007870952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006830153,"about_ca_topic_score_gemma":0.000003676455,"domain_scores_codex":[0.9980053,0.00007652117,0.0007846975,0.0001088999,0.0007905366,0.0002340622],"domain_scores_gemma":[0.9985979,0.00006739306,0.000579036,0.0001253494,0.0005187243,0.0001116089],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0006479737,0.003144165,0.03463256,0.0003747256,0.001474355,0.00354625,0.01564036,0.06834961,0.0052341,0.1813729,0.001420182,0.6841628],"study_design_scores_gemma":[0.009540603,0.0005173871,0.03695525,0.002447227,0.00005721543,0.02901903,0.002252397,0.06066599,0.001375351,0.0006595978,0.8554327,0.001077284],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06873427,0.003953606,0.9201533,0.0005053744,0.004949511,0.0001941291,0.00001118568,0.00002432289,0.001474333],"genre_scores_gemma":[0.9749791,0.00002234257,0.02444094,0.00002767509,0.0003864579,0.000005845776,0.000002747481,0.000006045948,0.0001288638],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9062448,"threshold_uncertainty_score":0.3901765,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2911938026","doi":"10.1007/s10766-019-00631-4","title":"Efficient Methods for Trace Analysis Parallelization","year":2019,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":3,"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; Speedup; Scalability; Parallel computing; TRACE (psycholinguistics); Parallelizable manifold; Tracing; Synchronization (alternating current); Thread (computing); Distributed computing; Algorithm; Channel (broadcasting); Database; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.023685949324013,"gpt":0.3733582132010854,"spread":0.3496722638770723,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008987595,0.0001247293,0.0002747911,0.0006074382,0.00004001273,0.000192165,0.001790016,0.00006423655,0.00001130647],"category_scores_gemma":[0.0003464477,0.0001076117,0.0002933749,0.0005744571,0.00003334096,0.0004242966,0.0002036813,0.0001489085,0.00000831743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001204576,"about_ca_system_score_gemma":0.00005271332,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002791465,"about_ca_topic_score_gemma":0.000001385607,"domain_scores_codex":[0.9985361,0.00005943351,0.0005349635,0.0002421282,0.0004198668,0.0002075389],"domain_scores_gemma":[0.9979923,0.0002791088,0.0006633436,0.0003110935,0.0007011133,0.00005305953],"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.00005338053,0.0001157735,0.000900807,0.000007667116,0.000740934,0.0000150487,0.0002527109,0.3672475,0.0007462803,0.04455069,0.00004873523,0.5853205],"study_design_scores_gemma":[0.001285664,0.0002792325,0.0006801107,0.00003420004,0.0001374761,0.0000893773,0.0001487267,0.9232045,0.0009908361,0.009239056,0.06364477,0.0002660809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006741174,0.0004988263,0.9905738,0.0009879917,0.000828406,0.0002298555,0.000002319427,0.00008862608,0.00004902103],"genre_scores_gemma":[0.2356824,0.00001700431,0.7641225,0.00004424141,0.00005566902,0.00001180479,0.000004906861,0.000006395541,0.00005498678],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5850544,"threshold_uncertainty_score":0.4388278,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3125008876","doi":"10.1007/s10766-021-00691-5","title":"A Power-Aware Hybrid Cache for Chip-Multi Processors Based on Neural Network Prediction Technique","year":2021,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"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; Cache; Artificial neural network; Parallel computing; Theory of computation; Branch predictor; Power (physics); Chip; Cache algorithms; Computer architecture; Smart Cache; Cache pollution; CPU cache; Embedded system; Artificial intelligence; Algorithm; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02140913417774604,"gpt":0.2970786902296174,"spread":0.2756695560518714,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007521225,0.0001941327,0.0002400807,0.0002250401,0.0001444041,0.0003595355,0.001052141,0.00007942177,0.000007405758],"category_scores_gemma":[0.00026178,0.0001806711,0.0002529405,0.0002736576,0.0000322105,0.0004138234,0.0001189344,0.000325004,0.000001315339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001237236,"about_ca_system_score_gemma":0.000267568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002635639,"about_ca_topic_score_gemma":0.000001388026,"domain_scores_codex":[0.9980083,0.0001141668,0.0006374425,0.0003176881,0.00062013,0.0003023231],"domain_scores_gemma":[0.9974536,0.0001702013,0.0005913927,0.0002305723,0.00144039,0.0001138829],"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.0002023293,0.0005971919,0.001584873,0.00003356191,0.0001548684,0.000288335,0.0002245958,0.9373091,0.000190869,0.001849351,0.003004385,0.05456058],"study_design_scores_gemma":[0.001191838,0.0004965292,0.0002958155,0.0002760582,0.00001280559,0.0004272514,0.00001754826,0.9819045,0.002879642,0.000891274,0.01139531,0.0002114071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000908258,0.0001566269,0.9955961,0.001740341,0.0009073402,0.0003474067,0.000006778622,0.0002241119,0.0001130798],"genre_scores_gemma":[0.4667372,0.00001076955,0.5324592,0.0003819336,0.0002730139,0.0000569386,0.00001612503,0.00001474149,0.00005000918],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.465829,"threshold_uncertainty_score":0.7367553,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2766773547","doi":"10.1007/s10766-017-0532-z","title":"BlockGraphChi: Enabling Block Update in Out-of-Core Graph Processing","year":2017,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Innovation Cluster (Canada)","funders":"National Natural Science Foundation of China","keywords":"Computer science; Theory of computation; Graph; Block (permutation group theory); Core (optical fiber); Parallel computing; Theoretical computer science; Distributed computing; Programming language; Mathematics; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.03523848755230249,"gpt":0.3201289732414859,"spread":0.2848904856891835,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00104232,0.000158402,0.000274674,0.0005741033,0.0001757112,0.0005393245,0.00297348,0.00006328274,0.000003679319],"category_scores_gemma":[0.0001543994,0.0001383969,0.0002277836,0.0001570602,0.000144316,0.001307092,0.0002917564,0.0003410715,0.000002698076],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002729871,"about_ca_system_score_gemma":0.00009585373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001279494,"about_ca_topic_score_gemma":0.00001661978,"domain_scores_codex":[0.9981058,0.00004523692,0.0007256464,0.000217708,0.000632533,0.0002730633],"domain_scores_gemma":[0.9976993,0.00005093661,0.001296249,0.0003186298,0.0005391074,0.00009578613],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001523473,0.000529389,0.03320964,0.00004669326,0.0002744707,0.0009098909,0.003290581,0.002348268,0.001629643,0.03967641,0.00003513803,0.9178975],"study_design_scores_gemma":[0.01838178,0.00159278,0.06126303,0.006594848,0.0001989012,0.002758553,0.002210416,0.09261358,0.01431796,0.76172,0.03540795,0.002940175],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4880204,0.001382019,0.5037062,0.002313771,0.003768523,0.0002418011,0.000002730522,0.00005451202,0.0005100718],"genre_scores_gemma":[0.8914127,0.00006629412,0.1082365,0.00005327594,0.0001994702,0.000003587633,6.830682e-7,0.000008822197,0.0000185729],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9149573,"threshold_uncertainty_score":0.5643662,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2914931648","doi":"10.1007/s10766-019-00630-5","title":"Tracing and Profiling Machine Learning Dataflow Applications on GPU","year":2019,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":2,"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":"Dataflow; Computer science; Tracing; Profiling (computer programming); Graph; Parallel computing; Debugging; Dataflow architecture; CUDA; Theoretical computer science; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01859292314238829,"gpt":0.2959411872809266,"spread":0.2773482641385383,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008293047,0.0001222116,0.0001820257,0.0002758128,0.00006069307,0.0003207456,0.0009625532,0.00005008194,0.000005368648],"category_scores_gemma":[0.00006244584,0.0001071792,0.00009086589,0.0001269985,0.00002108367,0.0006951237,0.0001499379,0.00039051,0.00001940613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000728506,"about_ca_system_score_gemma":0.00004537455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009185606,"about_ca_topic_score_gemma":0.000001285919,"domain_scores_codex":[0.9985154,0.00008317066,0.0004673431,0.0002220224,0.0005473609,0.0001646838],"domain_scores_gemma":[0.9988061,0.0001539156,0.000483604,0.0001935306,0.0002865193,0.00007631601],"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.00009785444,0.0002806804,0.02467426,0.0000915419,0.0003753128,0.0001573393,0.001292739,0.00683954,0.008438171,0.101782,0.00009129099,0.8558793],"study_design_scores_gemma":[0.007728612,0.004418391,0.002556729,0.003160817,0.000121918,0.007495021,0.0011996,0.605319,0.04025117,0.02756645,0.2977086,0.002473623],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01306149,0.0004647206,0.9845599,0.0004514765,0.0002992944,0.0003519177,0.000001141476,0.0001067992,0.000703265],"genre_scores_gemma":[0.6923319,0.00002770644,0.3073058,0.00005866798,0.0001459666,0.00001701925,0.000003226668,0.000009789062,0.00009989792],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8534057,"threshold_uncertainty_score":0.4370641,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078484109","doi":"10.1007/s10766-013-0303-4","title":"A Transaction-Based Environment for System Modeling and Parallel Simulation","year":2014,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Speedup; SystemC; Parallel computing; Concurrency; Distributed computing; Scheduling (production processes); Granularity; Transaction processing; Workload; Database transaction; Computer architecture; Operating system; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01917536753296576,"gpt":0.2687987249979213,"spread":0.2496233574649555,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005849557,0.0001096852,0.0001799939,0.0001052505,0.00007718513,0.0002301604,0.0004200838,0.00004921888,0.000001031449],"category_scores_gemma":[0.00003022844,0.00009726282,0.000120991,0.00004085218,0.0000197838,0.0003874963,0.00001751217,0.00008952968,0.000001715166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009153986,"about_ca_system_score_gemma":0.00003126131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001048645,"about_ca_topic_score_gemma":0.00000134984,"domain_scores_codex":[0.9987099,0.00004512723,0.0005006369,0.0001722708,0.000421213,0.0001508651],"domain_scores_gemma":[0.9991043,0.000119665,0.0003321365,0.0001110761,0.0002487247,0.00008415851],"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.00005364708,0.00004265263,0.00008005639,0.00002675914,0.00004962933,0.000004594929,0.0001159783,0.8931469,0.00004480798,0.006044224,0.000005286324,0.1003854],"study_design_scores_gemma":[0.001273852,0.0001157675,0.00004321889,0.0001171561,0.00001164908,0.00003733858,0.00004679618,0.984642,0.00001315143,0.0003301521,0.01326916,0.00009972486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003538105,0.000143065,0.9950162,0.0006079432,0.0004576927,0.0001805475,0.000002844773,0.00002961384,0.00002396299],"genre_scores_gemma":[0.780665,0.000003861529,0.219092,0.00003845315,0.0001670307,0.00001665622,0.000002969462,0.000006103544,0.000007880421],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.777127,"threshold_uncertainty_score":0.3966263,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2091829660","doi":"10.1007/s10766-013-0254-9","title":"Parallel and Distributed Processing with Applications: Preface","year":2013,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":1,"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; Theory of computation; Parallel computing; Distributed computing; Programming language; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01218971172323697,"gpt":0.2584493047261179,"spread":0.246259593002881,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003264726,0.000178231,0.0002319762,0.0001396542,0.0001131812,0.0009959376,0.001183674,0.00005679278,0.000006121178],"category_scores_gemma":[0.00003055614,0.0001341077,0.00006652955,0.0002438009,0.00007570429,0.001103599,0.0001627545,0.000221314,0.00001633396],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006021514,"about_ca_system_score_gemma":0.000117625,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002970227,"about_ca_topic_score_gemma":0.000002139989,"domain_scores_codex":[0.998261,0.00005417154,0.0005517295,0.0002532057,0.0006132606,0.0002666602],"domain_scores_gemma":[0.9979504,0.00007452377,0.0006456327,0.0001864033,0.0009756458,0.0001673965],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001018019,0.0005026988,0.01954773,0.0001147866,0.0005198632,0.0001507369,0.001592323,0.03029536,0.000193989,0.01972338,0.00156031,0.925697],"study_design_scores_gemma":[0.01068324,0.001801922,0.04676473,0.002054437,0.0001433853,0.009867642,0.00172594,0.3506205,0.0001171224,0.02402584,0.5498942,0.002301085],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007158958,0.0009108823,0.9894835,0.001672099,0.0001520294,0.0003604735,0.0000025802,0.00007847106,0.0001809954],"genre_scores_gemma":[0.7382926,0.00002291888,0.2613094,0.00007116183,0.0001830817,0.00005383038,0.000009146553,0.000008738407,0.0000491097],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9233959,"threshold_uncertainty_score":0.960385,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3118549947","doi":"10.1007/s10766-020-00689-5","title":"Automated Generation of Model-Based Constraints for Common Multi-core and Real-Time Applications Using Execution Tracing","year":2021,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University; Polytechnique Montréal","funders":"","keywords":"Computer science; Scalability; Tracing; Overhead (engineering); Process (computing); Kernel (algebra); Event (particle physics); Distributed computing; Execution time; Real-time computing; Programming language; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.06982645979023029,"gpt":0.3553432237376553,"spread":0.285516763947425,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004794251,0.00008659391,0.0001874197,0.0001160732,0.00008370156,0.00009350051,0.0002340493,0.0000619596,0.000001381026],"category_scores_gemma":[0.0000545878,0.00008014662,0.00009954072,0.0001139548,0.00006835085,0.000360566,0.00003955688,0.00007054437,3.507194e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008608143,"about_ca_system_score_gemma":0.0002488373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001221092,"about_ca_topic_score_gemma":0.000004232345,"domain_scores_codex":[0.9988619,0.00003669509,0.0005614002,0.0001544268,0.0002744201,0.0001111394],"domain_scores_gemma":[0.9981917,0.00008258442,0.0004990318,0.0001263821,0.001048332,0.00005203349],"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.00008125413,0.0007444114,0.01283246,0.0002462761,0.0002901031,0.0000309437,0.001329399,0.5628032,0.1892044,0.003066214,0.00005803925,0.2293133],"study_design_scores_gemma":[0.0008537372,0.00004300024,0.0005238609,0.0001153938,0.00001838886,0.0001236289,0.00003554561,0.9934701,0.004516682,0.0001864599,0.00003679756,0.00007642475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2401636,0.00007902033,0.75929,0.0001015814,0.0001347875,0.0001820215,0.000005000063,0.00003911785,0.00000493275],"genre_scores_gemma":[0.5687009,0.000009067384,0.431196,0.0000131027,0.00005356639,0.00001051986,0.00001015162,0.000003611667,0.000003137886],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4306669,"threshold_uncertainty_score":0.3268284,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4321242097","doi":"10.1007/s10766-023-00752-x","title":"Guest Editor’s Note: High-Level Parallel Programming 2021","year":2023,"lang":"en","type":"editorial","venue":"International Journal of Parallel Programming","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Università di Pisa; Universidade do Porto; Université d'Orléans; Centre National de la Recherche Scientifique; Linköpings Universitet; University of Edinburgh; Queen's University; Uppsala Universitet; Universiteit van Amsterdam; Queen's University Belfast; Mississippi State University","keywords":"Computer science; Theory of computation; Programming language; Parallel computing","retraction":null,"screen_n_in":null,"score":{"opus":0.0203141364912243,"gpt":0.3145708928238076,"spread":0.2942567563325832,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00257003,0.000858554,0.001164339,0.001293766,0.0002823869,0.002177571,0.007133248,0.001145259,0.00002065782],"category_scores_gemma":[0.00309087,0.0008249104,0.0007903225,0.0008214792,0.0001719662,0.001316932,0.001379656,0.002511367,0.0001584074],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006391729,"about_ca_system_score_gemma":0.001358128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001947141,"about_ca_topic_score_gemma":0.0000361333,"domain_scores_codex":[0.9907644,0.0003149774,0.002356575,0.001013911,0.004519077,0.001031005],"domain_scores_gemma":[0.9892582,0.001630537,0.003214051,0.0008482689,0.004615502,0.0004334529],"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.00008151313,0.000261815,0.00001463075,0.00004928836,0.0004625882,0.0006718387,0.0002921939,0.007783906,0.000004459196,0.000615312,0.9013712,0.08839124],"study_design_scores_gemma":[0.001403538,0.0004035679,0.00001380467,0.0008452454,0.00007309575,0.00007452875,0.00002950269,0.008191819,0.000022166,0.0008966736,0.98722,0.0008260196],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.000001843543,0.0002834483,0.4928928,0.0007198361,0.505474,0.0002247348,0.00002383324,0.0003227905,0.00005677034],"genre_scores_gemma":[0.0001244473,0.0005932462,0.4666413,0.0000349322,0.531554,0.00004935204,0.0001807286,0.00008723445,0.0007347228],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.08756523,"threshold_uncertainty_score":0.9997899,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964240473","doi":"10.1007/s10766-013-0297-y","title":"Guest Editorial for High-level Parallel Programming and Applications","year":2013,"lang":"en","type":"editorial","venue":"International Journal of Parallel Programming","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kelowna General Hospital; Okanagan College","funders":"","keywords":"Computer science; Compiler; Programming paradigm; Scalability; Parallel computing; Parallel programming model; Programming language; Von Neumann architecture; Software; Multi-core processor; Turing; Parallelism (grammar); Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01806667507047626,"gpt":0.2923874024849767,"spread":0.2743207274145005,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001626633,0.0006182349,0.000928874,0.0004714806,0.0002709369,0.002373549,0.003889598,0.0008466836,0.00000335506],"category_scores_gemma":[0.0006649981,0.0005681821,0.0004246896,0.0002587661,0.0001389665,0.0009561905,0.0005750621,0.001190845,0.00002532272],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000271932,"about_ca_system_score_gemma":0.0007382087,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001578924,"about_ca_topic_score_gemma":0.0000136312,"domain_scores_codex":[0.994148,0.0001414975,0.001787728,0.0007805875,0.002429443,0.0007128139],"domain_scores_gemma":[0.9906218,0.001326119,0.002528899,0.0005182887,0.004642472,0.0003624184],"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.00008557169,0.0002363154,0.00002819503,0.0001424697,0.0006206664,0.00002783972,0.0002247758,0.0003683602,0.000006270725,0.004243906,0.917833,0.07618263],"study_design_scores_gemma":[0.002263358,0.0004067465,0.00001266695,0.0003821733,0.00008463381,0.00008329691,0.00004099986,0.0006237094,0.000002937225,0.002327565,0.9932147,0.0005571804],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.000007010575,0.0005309666,0.4796214,0.000280391,0.5186308,0.0007539589,0.00007477062,0.00007770024,0.00002302383],"genre_scores_gemma":[0.001040331,0.0001179469,0.216373,0.00002117654,0.7812813,0.0004329606,0.0003623143,0.00005415585,0.0003168105],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.2632484,"threshold_uncertainty_score":0.9996769,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}