{"meta":{"query_hash":"217167b2f74c","filters":{"venue":"International Journal of Parallel Programming"},"cohort_total":19,"direct_labels_cover":0,"predictions_cover":19,"exported":19,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/217167b2f74c","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Journal+of+Parallel+Programming"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01146068857138414,"score_gpt":0.2513160070212024,"score_spread":0.23985531844981825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582451000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3709685,0.0007256437,0.6216169,0.00014754434,0.00315677,0.00015265534,0.0000055148184,0.000060619554,0.003165842],"genre_scores_gemma":[0.95053256,0.000016902215,0.04910262,0.000021312524,0.00022732763,0.000002448463,0.0000036010256,0.00000783752,0.00008540438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976485,0.00012817972,0.0008844318,0.00018367106,0.0008531011,0.00030214293],"domain_scores_gemma":[0.99776447,0.00014989491,0.00093937846,0.0002261317,0.0008112039,0.00010892722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013399641,0.00015641109,0.00031152667,0.00022996678,0.00007019315,0.00020238357,0.0015004352,0.00005909578,0.000012930335],"category_scores_gemma":[0.00013602784,0.00013449082,0.00020569848,0.00025587974,0.000033798467,0.0005054395,0.00011279078,0.0002025199,0.00001464197],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002190452,0.00136866,0.20576641,0.0005796404,0.0015025776,0.0008283144,0.005088785,0.026613988,0.00083802635,0.697156,0.0026315774,0.057406973],"study_design_scores_gemma":[0.0122749945,0.0031067242,0.03601512,0.0056939973,0.00015636203,0.012186443,0.003225804,0.21082094,0.0056045945,0.0020222035,0.70670366,0.0021891433],"about_ca_topic_score_codex":0.00000860339,"about_ca_topic_score_gemma":0.0000016085737,"teacher_disagreement_score":0.70407206,"about_ca_system_score_codex":0.00010734665,"about_ca_system_score_gemma":0.00014659004,"threshold_uncertainty_score":0.54843765},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01806667507047626,"score_gpt":0.29238740248497674,"score_spread":0.2743207274145005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964240473","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000070105752,0.0005309666,0.47962138,0.000280391,0.5186308,0.0007539589,0.00007477062,0.00007770024,0.000023023831],"genre_scores_gemma":[0.0010403314,0.00011794689,0.21637301,0.000021176544,0.7812813,0.00043296057,0.0003623143,0.000054155847,0.00031681053],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99414796,0.00014149753,0.0017877276,0.0007805875,0.0024294427,0.00071281387],"domain_scores_gemma":[0.9906218,0.0013261186,0.0025288987,0.0005182887,0.0046424717,0.00036241842],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016266335,0.00061823486,0.00092887395,0.0004714806,0.00027093693,0.0023735487,0.0038895977,0.0008466836,0.0000033550598],"category_scores_gemma":[0.0006649981,0.00056818215,0.00042468956,0.00025876614,0.0001389665,0.00095619046,0.0005750621,0.0011908454,0.000025322723],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008557169,0.00023631539,0.000028195032,0.0001424697,0.0006206664,0.000027839722,0.0002247758,0.00036836017,0.000006270725,0.0042439057,0.91783303,0.076182626],"study_design_scores_gemma":[0.0022633583,0.0004067465,0.00001266695,0.0003821733,0.00008463381,0.00008329691,0.000040999857,0.0006237094,0.0000029372254,0.0023275653,0.9932147,0.0005571804],"about_ca_topic_score_codex":0.00015789243,"about_ca_topic_score_gemma":0.0000136311955,"teacher_disagreement_score":0.26324838,"about_ca_system_score_codex":0.00027193196,"about_ca_system_score_gemma":0.0007382087,"threshold_uncertainty_score":0.99967694},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","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","score_opus":0.012444799379636131,"score_gpt":0.2962985924852328,"score_spread":0.2838537931055967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980008253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11711762,0.000039600396,0.87866014,0.0025542374,0.0009816631,0.00012429936,9.34131e-7,0.00011160285,0.00040988575],"genre_scores_gemma":[0.9015593,0.000019764373,0.09749884,0.0005616533,0.00029641195,0.0000053930867,0.0000016571504,0.0000124872595,0.00004451623],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849993,0.000043653796,0.00044190243,0.00022559079,0.000585915,0.0002029989],"domain_scores_gemma":[0.9987165,0.00009410505,0.0004415364,0.0001762926,0.00043867237,0.00013289381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004767717,0.00016137226,0.00017938997,0.0002474202,0.000074636584,0.00037622536,0.0011794785,0.00008412583,0.000010442043],"category_scores_gemma":[0.00008654955,0.00013593305,0.00009057173,0.00009728915,0.00006327479,0.0004680141,0.0001456953,0.00045585897,0.0000043908058],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016922902,0.0005096049,0.016019892,0.000033824916,0.0003471984,0.0003617847,0.0033932163,0.017974786,0.00037500612,0.0050438414,0.0011686716,0.95460296],"study_design_scores_gemma":[0.010227426,0.0036425253,0.018182011,0.0012302293,0.00008779732,0.0049971472,0.0005216761,0.8276681,0.0045813145,0.019718193,0.10663879,0.0025048275],"about_ca_topic_score_codex":0.0000093995,"about_ca_topic_score_gemma":0.000008562311,"teacher_disagreement_score":0.95209813,"about_ca_system_score_codex":0.000023592083,"about_ca_system_score_gemma":0.00007166451,"threshold_uncertainty_score":0.5543189},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016002559263521565,"score_gpt":0.3110218934464314,"score_spread":0.2950193341829098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991592471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02007829,0.000047413116,0.9768229,0.00085718295,0.0006725403,0.00009214393,1.8766775e-7,0.000096287746,0.0013330553],"genre_scores_gemma":[0.5700089,0.000037489186,0.429519,0.0001793017,0.00017888365,0.000004345877,0.0000027711787,0.0000056592007,0.00006369633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843746,0.0000605942,0.0005721748,0.00015636985,0.0005712791,0.00020210531],"domain_scores_gemma":[0.9985302,0.00004293751,0.00057745015,0.00016313199,0.00060337165,0.00008289561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093487155,0.00011221386,0.0001589946,0.00024688535,0.000086097716,0.00036056712,0.0013330288,0.000037209094,0.000030738367],"category_scores_gemma":[0.000052933887,0.00010015638,0.000097594144,0.00016395189,0.00002177931,0.00096329354,0.00017040195,0.00015153707,0.000016282029],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002134831,0.00008551946,0.007355275,0.000006784499,0.00008255931,0.000017467379,0.00042040448,0.011426399,0.0000878421,0.012515245,0.0013640905,0.96661705],"study_design_scores_gemma":[0.0040087206,0.0014656883,0.011458082,0.00027153784,0.00003902355,0.0010506015,0.00021408297,0.53080684,0.004888523,0.007821762,0.43717006,0.0008050894],"about_ca_topic_score_codex":0.000018255569,"about_ca_topic_score_gemma":0.000002371691,"teacher_disagreement_score":0.96581197,"about_ca_system_score_codex":0.00006655973,"about_ca_system_score_gemma":0.00008354528,"threshold_uncertainty_score":0.40842584},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.020079579519245598,"score_gpt":0.30113860609930204,"score_spread":0.28105902658005644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029940726","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08975828,0.00022983828,0.90850306,0.00018267204,0.0010460864,0.00010271549,0.0000014321272,0.00006256689,0.00011335104],"genre_scores_gemma":[0.4592128,0.000009952056,0.5405297,0.000024029681,0.00017777403,0.000003883477,0.000004769025,0.0000063499674,0.00003068751],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849474,0.00010625618,0.00056461274,0.00019201697,0.00047344514,0.00016894536],"domain_scores_gemma":[0.99842787,0.00005797147,0.0005992652,0.00018855158,0.0006631279,0.00006320434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005656859,0.0001230043,0.00014584762,0.0003280015,0.00010703081,0.00031460382,0.0006187328,0.00006979914,0.0000054331686],"category_scores_gemma":[0.00018092128,0.00011985719,0.00008733545,0.00023743359,0.00007081986,0.001210937,0.000097079355,0.00018636003,0.0000046239825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029021595,0.00058427284,0.013101359,0.00004926466,0.0003883401,0.00010935874,0.002554805,0.025984207,0.030748513,0.15799503,0.00053003983,0.7676646],"study_design_scores_gemma":[0.0037878223,0.00069420546,0.060997594,0.0006260607,0.0001725889,0.0045979293,0.0008421474,0.8602654,0.007553613,0.025417777,0.03389139,0.001153478],"about_ca_topic_score_codex":0.000047212357,"about_ca_topic_score_gemma":0.0000030577537,"teacher_disagreement_score":0.8342812,"about_ca_system_score_codex":0.0001652214,"about_ca_system_score_gemma":0.00007805191,"threshold_uncertainty_score":0.48876342},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.024888820919740047,"score_gpt":0.2882694005470693,"score_spread":0.26338057962732925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046897173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068734266,0.003953606,0.92015326,0.0005053744,0.0049495106,0.00019412911,0.000011185681,0.000024322891,0.0014743326],"genre_scores_gemma":[0.9749791,0.000022342572,0.024440942,0.000027675085,0.00038645792,0.000005845776,0.0000027474807,0.000006045948,0.00012886383],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980053,0.000076521166,0.0007846975,0.0001088999,0.0007905366,0.00023406219],"domain_scores_gemma":[0.99859786,0.00006739306,0.00057903596,0.00012534943,0.00051872426,0.000111608875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000892122,0.00010801509,0.0002606047,0.00022412188,0.000021647858,0.00010028435,0.0008424879,0.00006196853,0.000009071897],"category_scores_gemma":[0.000047174686,0.00009568117,0.00014064161,0.0001681606,0.000034356122,0.0009880145,0.000038022867,0.00019862497,0.0000053703],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006479737,0.0031441646,0.03463256,0.00037472558,0.0014743551,0.0035462498,0.015640363,0.06834961,0.0052341004,0.18137294,0.0014201816,0.6841628],"study_design_scores_gemma":[0.0095406035,0.0005173871,0.036955252,0.0024472266,0.000057215435,0.029019028,0.0022523967,0.06066599,0.0013753506,0.0006595978,0.8554327,0.0010772836],"about_ca_topic_score_codex":0.00006830153,"about_ca_topic_score_gemma":0.0000036764545,"teacher_disagreement_score":0.9062448,"about_ca_system_score_codex":0.00009851996,"about_ca_system_score_gemma":0.00007870952,"threshold_uncertainty_score":0.3901765},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.020723193220665036,"score_gpt":0.26641718456681657,"score_spread":0.24569399134615152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062877387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023324449,0.00020445089,0.9725338,0.0020435133,0.00094334735,0.00046279372,0.000001106456,0.000058365844,0.00042816883],"genre_scores_gemma":[0.8244761,0.000005521713,0.17346455,0.0002840149,0.0007091306,0.000055607958,0.000008229175,0.00001345222,0.0009833513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799335,0.00006372146,0.0006491721,0.00025849862,0.0007359277,0.00029934067],"domain_scores_gemma":[0.99829906,0.00011132258,0.00054901105,0.00020157397,0.000707586,0.00013141909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006358767,0.00017603535,0.00022725266,0.00022097578,0.00011700245,0.0005159819,0.0015521366,0.000051425304,0.000017649472],"category_scores_gemma":[0.000069623085,0.0001407617,0.00027839036,0.00012256367,0.000041069256,0.0001332236,0.000348998,0.00021596224,0.000013687422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018790027,0.0015043914,0.0016918965,0.00006231993,0.0015516836,0.0000829433,0.0024043177,0.16218369,0.00018779404,0.030272232,0.016863542,0.78300726],"study_design_scores_gemma":[0.003460845,0.0006846229,0.00040617067,0.000107375796,0.000037101025,0.00023656266,0.0009789988,0.9382109,0.00006539415,0.0009922645,0.05449395,0.00032582614],"about_ca_topic_score_codex":0.000058303936,"about_ca_topic_score_gemma":0.0000020512468,"teacher_disagreement_score":0.8011517,"about_ca_system_score_codex":0.00012809332,"about_ca_system_score_gemma":0.00003815542,"threshold_uncertainty_score":0.57400954},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03387168784162624,"score_gpt":0.2973515778122583,"score_spread":0.26347988997063204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071505781","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032751255,0.00013579473,0.9631662,0.0026778437,0.00080238626,0.00032701154,9.888925e-7,0.00008573655,0.00005283183],"genre_scores_gemma":[0.60398525,0.000010444227,0.39566824,0.000057057834,0.0001891334,0.000034988978,0.000006162177,0.000006668765,0.000042064745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998527,0.000035579014,0.00067307503,0.0001756878,0.00035031853,0.00023837545],"domain_scores_gemma":[0.9979346,0.00010664746,0.00087213994,0.00019213516,0.0008199937,0.00007447574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038185238,0.00012308868,0.00020381145,0.00018737739,0.000064720756,0.00031077935,0.0014133394,0.000073745294,0.000013083945],"category_scores_gemma":[0.00013652185,0.00010498123,0.00013641959,0.0001760978,0.00005942748,0.0016503847,0.00009269413,0.00013750578,0.0000026187677],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047270078,0.00012517672,0.0008012072,0.0000088825445,0.00010715395,0.000003773406,0.0008202303,0.009095717,0.0018149433,0.046997994,0.000371222,0.9398064],"study_design_scores_gemma":[0.003598399,0.0016071097,0.008770955,0.00009324295,0.00003787376,0.00017919055,0.0016099346,0.8621325,0.0013334026,0.10497813,0.015137717,0.00052157143],"about_ca_topic_score_codex":0.000024158599,"about_ca_topic_score_gemma":0.0000054533148,"teacher_disagreement_score":0.93928486,"about_ca_system_score_codex":0.000044901408,"about_ca_system_score_gemma":0.00007792947,"threshold_uncertainty_score":0.42810103},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01917536753296576,"score_gpt":0.2687987249979213,"score_spread":0.24962335746495554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078484109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035381047,0.000143065,0.9950162,0.00060794316,0.00045769266,0.00018054749,0.0000028447728,0.000029613837,0.000023962988],"genre_scores_gemma":[0.78066504,0.0000038615285,0.219092,0.000038453152,0.00016703065,0.000016656224,0.0000029694622,0.000006103544,0.000007880421],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870986,0.000045127228,0.00050063693,0.00017227075,0.00042121304,0.0001508651],"domain_scores_gemma":[0.99910426,0.000119665034,0.0003321365,0.000111076064,0.00024872468,0.000084158506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058495573,0.000109685156,0.00017999395,0.00010525047,0.000077185134,0.00023016043,0.00042008376,0.000049218877,0.0000010314492],"category_scores_gemma":[0.000030228439,0.00009726282,0.000120991,0.000040852177,0.0000197838,0.00038749631,0.000017512173,0.00008952968,0.0000017151665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053647076,0.000042652628,0.00008005639,0.000026759139,0.000049629325,0.000004594929,0.00011597831,0.89314693,0.000044807977,0.0060442244,0.000005286324,0.100385405],"study_design_scores_gemma":[0.0012738518,0.0001157675,0.000043218894,0.00011715612,0.000011649077,0.000037338585,0.000046796176,0.984642,0.000013151433,0.00033015208,0.01326916,0.00009972486],"about_ca_topic_score_codex":0.000010486452,"about_ca_topic_score_gemma":0.0000013498403,"teacher_disagreement_score":0.77712697,"about_ca_system_score_codex":0.000091539856,"about_ca_system_score_gemma":0.000031261312,"threshold_uncertainty_score":0.39662626},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020135539022872986,"score_gpt":0.31639754854423197,"score_spread":0.296262009521359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090209978","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020083154,0.00005667757,0.9915174,0.0011273287,0.0002133575,0.0035891943,5.021566e-7,0.00012977587,0.0013573975],"genre_scores_gemma":[0.47865918,0.000009238586,0.5203756,0.00034019398,0.00020567057,0.0003155883,7.30731e-7,0.000007891999,0.00008592808],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827605,0.00010267948,0.0005740048,0.00025850892,0.0005550493,0.00023371492],"domain_scores_gemma":[0.9983338,0.00008814267,0.0006450443,0.000163336,0.0006448529,0.00012479938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005021599,0.00018518702,0.00025047507,0.00032625732,0.00007664068,0.00040574122,0.0009439045,0.00006909328,0.000009920126],"category_scores_gemma":[0.00013731772,0.00015743922,0.00012439312,0.0001968588,0.000049601436,0.00087254,0.00017638026,0.00028384078,0.0000025921508],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083654537,0.0008115558,0.0012823595,0.000019410676,0.0004974028,0.0010259908,0.004522214,0.011076711,0.0005804415,0.124718264,0.0029128822,0.8517162],"study_design_scores_gemma":[0.015708946,0.00915749,0.019325735,0.0019873295,0.000083805695,0.004673509,0.0005023158,0.6658526,0.004805865,0.18325597,0.09242371,0.0022226921],"about_ca_topic_score_codex":0.000008973088,"about_ca_topic_score_gemma":0.0000020681514,"teacher_disagreement_score":0.8494935,"about_ca_system_score_codex":0.00010725682,"about_ca_system_score_gemma":0.00009698631,"threshold_uncertainty_score":0.6420185},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Theory of computation; Parallel computing; Distributed computing; Programming language; Theoretical computer science","score_opus":0.012189711723236973,"score_gpt":0.25844930472611793,"score_spread":0.24625959300288097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091829660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007158958,0.0009108823,0.98948354,0.0016720993,0.0001520294,0.00036047347,0.0000025801996,0.00007847106,0.00018099535],"genre_scores_gemma":[0.7382926,0.000022918877,0.26130944,0.000071161834,0.00018308175,0.00005383038,0.000009146553,0.000008738407,0.0000491097],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998261,0.000054171538,0.00055172946,0.00025320574,0.0006132606,0.00026666015],"domain_scores_gemma":[0.9979504,0.00007452377,0.0006456327,0.00018640331,0.00097564585,0.00016739655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003264726,0.00017823101,0.00023197624,0.00013965416,0.00011318118,0.0009959376,0.0011836739,0.000056792782,0.000006121178],"category_scores_gemma":[0.00003055614,0.00013410769,0.00006652955,0.00024380087,0.00007570429,0.0011035985,0.00016275447,0.00022131398,0.000016333961],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010180195,0.0005026988,0.019547733,0.00011478658,0.00051986316,0.0001507369,0.0015923232,0.030295365,0.00019398905,0.019723382,0.0015603105,0.925697],"study_design_scores_gemma":[0.0106832385,0.0018019225,0.04676473,0.002054437,0.00014338532,0.009867642,0.0017259403,0.35062048,0.0001171224,0.024025837,0.54989415,0.0023010853],"about_ca_topic_score_codex":0.000029702269,"about_ca_topic_score_gemma":0.0000021399892,"teacher_disagreement_score":0.92339593,"about_ca_system_score_codex":0.000060215145,"about_ca_system_score_gemma":0.00011762503,"threshold_uncertainty_score":0.96038496},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Pentium; Multithreading; Operating system; Benchmark (surveying); Parallel computing; Computer architecture; Embedded system","score_opus":0.03246800490371323,"score_gpt":0.27333945681580585,"score_spread":0.2408714519120926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138333931","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70177853,0.0012840572,0.29432738,0.00061783503,0.0014274446,0.0002659098,0.0000015611577,0.000013167757,0.00028411404],"genre_scores_gemma":[0.9863571,0.00030985073,0.013155836,0.00002886733,0.00010503016,0.0000039423776,7.746883e-7,0.0000041799894,0.000034423276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986699,0.000106352796,0.00042692875,0.000119369535,0.0005540619,0.00012337232],"domain_scores_gemma":[0.9983607,0.00043638414,0.0005700436,0.0004004092,0.0002053447,0.000027136848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010527651,0.0000864321,0.00015298382,0.00014594066,0.000108639564,0.000059021622,0.0030015255,0.000017552828,0.0000011838463],"category_scores_gemma":[0.000060605533,0.000046221532,0.00009029879,0.00019985714,0.0001005759,0.00045540213,0.00031773536,0.00015867614,0.0000015538583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002415263,0.00073967694,0.017995728,0.00037647857,0.0027963303,0.0005852806,0.0040338007,0.01952721,0.0014573415,0.33647007,0.00050099764,0.61527556],"study_design_scores_gemma":[0.007206644,0.004216247,0.040631514,0.009799872,0.0004624088,0.0048320275,0.002537546,0.8828821,0.016182464,0.00768977,0.022281608,0.0012777754],"about_ca_topic_score_codex":0.000005631536,"about_ca_topic_score_gemma":2.1157692e-7,"teacher_disagreement_score":0.8633549,"about_ca_system_score_codex":0.000017990302,"about_ca_system_score_gemma":0.000021917052,"threshold_uncertainty_score":0.5577631},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.13573008747490195,"score_gpt":0.44532355090904624,"score_spread":0.3095934634341443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766218044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05780983,0.000048795075,0.9310205,0.008051713,0.0016306549,0.00011319857,0.0000040967593,0.000021737738,0.0012994896],"genre_scores_gemma":[0.9248855,0.0000051206284,0.07339986,0.00016786005,0.0007929085,0.000009781175,0.0000013180454,0.000009354348,0.0007283165],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972715,0.000049599654,0.0008675277,0.00021396822,0.0014336617,0.0001637352],"domain_scores_gemma":[0.9954674,0.0004158636,0.001992735,0.00043712897,0.0015644135,0.00012241461],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0025210336,0.000114195966,0.00020733976,0.0003222568,0.0005013928,0.0010795036,0.0020396214,0.00006139259,0.0001604478],"category_scores_gemma":[0.0032727546,0.00008822301,0.00026172152,0.00011699895,0.00019568302,0.00090923626,0.00011748967,0.0002507933,0.00009078862],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045646162,0.0007864247,0.018867658,0.000004831587,0.00031623692,0.000085328116,0.0005703133,0.020026965,0.007097035,0.050469313,0.0020528382,0.8992666],"study_design_scores_gemma":[0.0057742065,0.00031616972,0.04394206,0.00032446437,0.00009473381,0.0013915902,0.002401884,0.022964925,0.007894154,0.095413126,0.8187358,0.00074688834],"about_ca_topic_score_codex":0.000024181234,"about_ca_topic_score_gemma":0.000010826948,"teacher_disagreement_score":0.8985197,"about_ca_system_score_codex":0.000077255405,"about_ca_system_score_gemma":0.00016272276,"threshold_uncertainty_score":0.99995744},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03523848755230249,"score_gpt":0.3201289732414859,"score_spread":0.28489048568918346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766773547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48802042,0.0013820195,0.50370616,0.0023137708,0.0037685225,0.00024180107,0.000002730522,0.00005451202,0.00051007175],"genre_scores_gemma":[0.89141273,0.000066294124,0.10823653,0.000053275937,0.00019947023,0.0000035876328,6.8306815e-7,0.000008822197,0.000018572904],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981058,0.000045236924,0.00072564645,0.00021770805,0.000632533,0.0002730633],"domain_scores_gemma":[0.9976993,0.000050936607,0.0012962493,0.0003186298,0.0005391074,0.000095786134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010423202,0.00015840204,0.000274674,0.0005741033,0.00017571122,0.00053932454,0.0029734802,0.000063282736,0.000003679319],"category_scores_gemma":[0.00015439936,0.00013839692,0.00022778362,0.00015706017,0.000144316,0.0013070923,0.00029175644,0.0003410715,0.000002698076],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015234732,0.00052938896,0.033209637,0.000046693258,0.00027447072,0.0009098909,0.0032905808,0.002348268,0.0016296427,0.039676405,0.000035138026,0.9178975],"study_design_scores_gemma":[0.018381782,0.0015927805,0.061263032,0.0065948484,0.00019890122,0.0027585526,0.0022104157,0.09261358,0.0143179605,0.76172,0.035407946,0.0029401754],"about_ca_topic_score_codex":0.000012794938,"about_ca_topic_score_gemma":0.00001661978,"teacher_disagreement_score":0.91495734,"about_ca_system_score_codex":0.000027298707,"about_ca_system_score_gemma":0.000095853735,"threshold_uncertainty_score":0.5643662},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Speedup; Scalability; Parallel computing; TRACE (psycholinguistics); Parallelizable manifold; Tracing; Synchronization (alternating current); Thread (computing); Distributed computing; Algorithm; Channel (broadcasting); Database; Programming language","score_opus":0.023685949324013,"score_gpt":0.37335821320108536,"score_spread":0.34967226387707234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911938026","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067411736,0.0004988263,0.99057376,0.0009879917,0.00082840596,0.00022985546,0.000002319427,0.000088626075,0.000049021033],"genre_scores_gemma":[0.23568243,0.000017004306,0.76412255,0.000044241413,0.000055669017,0.000011804789,0.000004906861,0.0000063955413,0.000054986776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853605,0.000059433514,0.0005349635,0.0002421282,0.00041986676,0.00020753889],"domain_scores_gemma":[0.9979923,0.00027910882,0.00066334364,0.0003110935,0.0007011133,0.000053059528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008987595,0.00012472927,0.00027479112,0.0006074382,0.000040012732,0.00019216504,0.0017900157,0.00006423655,0.000011306473],"category_scores_gemma":[0.00034644766,0.000107611704,0.00029337488,0.00057445705,0.000033340955,0.0004242966,0.00020368131,0.00014890854,0.00000831743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005338053,0.000115773524,0.00090080703,0.000007667116,0.000740934,0.000015048703,0.00025271092,0.3672475,0.0007462803,0.044550695,0.00004873523,0.5853205],"study_design_scores_gemma":[0.0012856643,0.00027923248,0.00068011065,0.00003420004,0.00013747606,0.000089377296,0.00014872673,0.9232045,0.0009908361,0.009239056,0.06364477,0.00026608093],"about_ca_topic_score_codex":0.000002791465,"about_ca_topic_score_gemma":0.000001385607,"teacher_disagreement_score":0.5850544,"about_ca_system_score_codex":0.00012045758,"about_ca_system_score_gemma":0.000052713323,"threshold_uncertainty_score":0.4388278},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dataflow; Computer science; Tracing; Profiling (computer programming); Graph; Parallel computing; Debugging; Dataflow architecture; CUDA; Theoretical computer science; Programming language","score_opus":0.018592923142388286,"score_gpt":0.2959411872809266,"score_spread":0.2773482641385383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914931648","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013061485,0.00046472062,0.9845599,0.0004514765,0.0002992944,0.00035191773,0.0000011414762,0.00010679921,0.000703265],"genre_scores_gemma":[0.6923319,0.000027706441,0.3073058,0.00005866798,0.00014596657,0.000017019254,0.0000032266685,0.0000097890625,0.000099897916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985154,0.000083170664,0.0004673431,0.00022202237,0.00054736086,0.00016468384],"domain_scores_gemma":[0.9988061,0.0001539156,0.000483604,0.00019353059,0.0002865193,0.000076316006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082930474,0.00012221161,0.00018202569,0.0002758128,0.000060693066,0.00032074563,0.0009625532,0.000050081937,0.0000053686476],"category_scores_gemma":[0.00006244584,0.00010717921,0.00009086589,0.00012699851,0.000021083672,0.00069512374,0.00014993788,0.00039051005,0.000019406132],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009785444,0.00028068037,0.024674265,0.0000915419,0.00037531275,0.00015733931,0.0012927393,0.0068395403,0.008438171,0.10178197,0.00009129099,0.8558793],"study_design_scores_gemma":[0.007728612,0.004418391,0.0025567294,0.0031608173,0.00012191798,0.0074950205,0.0011996003,0.605319,0.04025117,0.027566452,0.29770863,0.002473623],"about_ca_topic_score_codex":0.000009185606,"about_ca_topic_score_gemma":0.0000012859193,"teacher_disagreement_score":0.85340565,"about_ca_system_score_codex":0.0000728506,"about_ca_system_score_gemma":0.00004537455,"threshold_uncertainty_score":0.4370641},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06982645979023029,"score_gpt":0.3553432237376553,"score_spread":0.28551676394742503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118549947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24016358,0.00007902033,0.75929,0.00010158141,0.00013478748,0.00018202154,0.0000050000626,0.000039117847,0.00000493275],"genre_scores_gemma":[0.56870085,0.000009067384,0.43119597,0.000013102695,0.000053566393,0.000010519855,0.000010151621,0.0000036116667,0.0000031378859],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988619,0.000036695088,0.0005614002,0.00015442682,0.0002744201,0.00011113937],"domain_scores_gemma":[0.99819165,0.00008258442,0.0004990318,0.00012638213,0.001048332,0.000052033494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047942513,0.000086593915,0.00018741975,0.00011607318,0.00008370156,0.00009350051,0.00023404925,0.000061959596,0.0000013810262],"category_scores_gemma":[0.000054587796,0.000080146616,0.000099540724,0.00011395481,0.00006835085,0.00036056596,0.000039556882,0.00007054437,3.5071943e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008125413,0.0007444114,0.012832465,0.00024627606,0.00029010308,0.000030943702,0.001329399,0.5628032,0.18920435,0.0030662138,0.00005803925,0.22931333],"study_design_scores_gemma":[0.0008537372,0.00004300024,0.00052386086,0.00011539382,0.000018388855,0.00012362887,0.00003554561,0.9934701,0.004516682,0.00018645986,0.000036797563,0.000076424745],"about_ca_topic_score_codex":0.000012210924,"about_ca_topic_score_gemma":0.0000042323445,"teacher_disagreement_score":0.43066686,"about_ca_system_score_codex":0.00008608143,"about_ca_system_score_gemma":0.00024883726,"threshold_uncertainty_score":0.3268284},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021409134177746036,"score_gpt":0.2970786902296174,"score_spread":0.2756695560518714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125008876","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00090825796,0.0001566269,0.99559605,0.0017403414,0.0009073402,0.0003474067,0.0000067786223,0.0002241119,0.00011307984],"genre_scores_gemma":[0.46673724,0.000010769552,0.5324592,0.00038193355,0.00027301387,0.000056938596,0.000016125026,0.000014741493,0.000050009185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800825,0.00011416677,0.00063744246,0.00031768807,0.00062013,0.0003023231],"domain_scores_gemma":[0.9974536,0.00017020125,0.00059139275,0.00023057233,0.0014403902,0.00011388285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075212255,0.00019413266,0.00024008071,0.00022504007,0.00014440405,0.00035953548,0.0010521411,0.00007942177,0.000007405758],"category_scores_gemma":[0.00026178002,0.00018067108,0.00025294055,0.00027365764,0.000032210497,0.00041382344,0.00011893444,0.00032500396,0.0000013153392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020232933,0.00059719186,0.0015848731,0.00003356191,0.00015486835,0.000288335,0.00022459576,0.9373091,0.00019086897,0.0018493513,0.0030043847,0.054560576],"study_design_scores_gemma":[0.0011918383,0.00049652916,0.0002958155,0.00027605818,0.000012805585,0.00042725145,0.000017548262,0.9819045,0.0028796424,0.00089127396,0.011395307,0.00021140712],"about_ca_topic_score_codex":0.000002635639,"about_ca_topic_score_gemma":0.0000013880259,"teacher_disagreement_score":0.46582898,"about_ca_system_score_codex":0.00012372356,"about_ca_system_score_gemma":0.00026756796,"threshold_uncertainty_score":0.73675525},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0203141364912243,"score_gpt":0.31457089282380757,"score_spread":0.29425675633258325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321242097","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000018435435,0.00028344832,0.49289277,0.0007198361,0.505474,0.00022473483,0.000023833238,0.00032279047,0.000056770336],"genre_scores_gemma":[0.00012444727,0.0005932462,0.4666413,0.0000349322,0.53155404,0.000049352042,0.0001807286,0.00008723445,0.0007347228],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99076444,0.00031497737,0.0023565749,0.0010139105,0.004519077,0.0010310049],"domain_scores_gemma":[0.98925817,0.0016305371,0.003214051,0.00084826886,0.0046155024,0.00043345286],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00257003,0.000858554,0.0011643386,0.0012937664,0.0002823869,0.0021775714,0.0071332483,0.0011452589,0.000020657815],"category_scores_gemma":[0.0030908699,0.00082491036,0.00079032255,0.00082147925,0.00017196623,0.0013169324,0.0013796556,0.0025113667,0.00015840736],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008151313,0.000261815,0.0000146307475,0.00004928836,0.00046258818,0.0006718387,0.0002921939,0.007783906,0.0000044591957,0.00061531196,0.9013712,0.088391244],"study_design_scores_gemma":[0.0014035383,0.00040356792,0.000013804672,0.0008452454,0.00007309575,0.000074528754,0.000029502688,0.008191819,0.000022166005,0.0008966736,0.98722005,0.0008260196],"about_ca_topic_score_codex":0.00019471414,"about_ca_topic_score_gemma":0.0000361333,"teacher_disagreement_score":0.08756523,"about_ca_system_score_codex":0.00063917285,"about_ca_system_score_gemma":0.0013581278,"threshold_uncertainty_score":0.9997899},"labels":[],"label_agreement":null}]}