{"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.987581,0.0004083922,0.0017753644,0.00032606567,0.00010134796,0.000021838374,0.0031739664,0.002368609,0.004243394],"genre_scores_gemma":[0.9857254,0.00013271961,0.002300875,0.000050824034,0.00005351338,0.000023711342,0.010063064,0.00039686993,0.0012530914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814177,0.00050788815,0.00008815652,0.00030023328,0.0006887709,0.00027314242],"domain_scores_gemma":[0.9944126,0.0028118687,0.00022603353,0.00069754024,0.001542514,0.00030943746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020460063,0.00097235077,0.0006901497,0.0013904248,0.0007659376,0.000916116,0.001294759,0.00062136294,0.0025965911],"category_scores_gemma":[0.0069058654,0.00045557052,0.0004090183,0.002826368,0.00066111813,0.0014013215,0.0007563907,0.00076758536,0.0005392],"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.009856486,0.0021355783,0.06169178,0.0009990444,0.00083971786,0.0012094682,0.0005814536,0.57542056,0.062495865,0.011220503,0.13677925,0.13677032],"study_design_scores_gemma":[0.000502485,0.001065681,0.073609464,0.000029913224,0.00019175919,0.00023516391,0.00028850292,0.85986143,0.052743766,0.0045580915,0.006817172,0.00009656944],"about_ca_topic_score_codex":0.008881583,"about_ca_topic_score_gemma":0.008472307,"teacher_disagreement_score":0.008881583,"about_ca_system_score_codex":0.0009479613,"about_ca_system_score_gemma":0.0010145768,"threshold_uncertainty_score":0.017659724},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035847614,0.00259975,0.0003004333,0.013011662,0.9828203,0.00001233668,0.000024887458,0.000072402356,0.001122403],"genre_scores_gemma":[0.0005190296,0.0026153924,0.0002586187,0.0070163384,0.9771313,0.00002026097,0.00003462293,0.00010053719,0.01230395],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99563307,0.00060974376,0.0005237485,0.00051100546,0.0023157338,0.0004066296],"domain_scores_gemma":[0.98113406,0.0044784374,0.0013291558,0.0005516802,0.0089113135,0.0035953766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051893312,0.0032821079,0.0038220936,0.0038248997,0.002809707,0.007853102,0.0027560624,0.008672042,0.0208748],"category_scores_gemma":[0.018051999,0.0011886089,0.0028729213,0.0015302094,0.0018355218,0.002764969,0.0020928045,0.014898202,0.015148375],"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.000046324563,0.000011924315,0.000023924087,0.00015058063,0.00002361789,0.00015689476,0.000004922586,0.000038401704,0.00008451272,0.0002178584,0.9931526,0.006088286],"study_design_scores_gemma":[0.000086360466,0.000039587223,0.00031259662,0.00026197828,0.000085534826,0.00049031986,0.00002089192,0.00037469153,0.00027785107,0.0014943717,0.99653256,0.000023292976],"about_ca_topic_score_codex":0.00064865075,"about_ca_topic_score_gemma":0.0019305502,"teacher_disagreement_score":0.0208748,"about_ca_system_score_codex":0.0020342013,"about_ca_system_score_gemma":0.0025392817,"threshold_uncertainty_score":0.06983316},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64830625,0.0009076846,0.32236782,0.0011165787,0.0004060538,0.00016475821,0.00027367478,0.011746665,0.014710451],"genre_scores_gemma":[0.9391212,0.00009095453,0.055372622,0.00015441167,0.00003674173,0.000032754087,0.00011106359,0.00023302261,0.0048472336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990958,0.00019299032,0.000042971795,0.00015339062,0.00023856845,0.00027623717],"domain_scores_gemma":[0.99846494,0.00045214116,0.00008657836,0.00053782936,0.00029925778,0.00015930273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009010908,0.0009955202,0.0014739409,0.00054776453,0.0015313968,0.0014919328,0.0024573887,0.0005699967,0.0035676078],"category_scores_gemma":[0.0016060256,0.0004720697,0.0005502053,0.00081373437,0.0005870588,0.0014070221,0.0014695297,0.00081538816,0.00035036827],"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.0075782877,0.00089208933,0.0074172732,0.00027279556,0.00022852822,0.0006470784,0.0004511478,0.6814826,0.03433896,0.01998475,0.016334152,0.2303724],"study_design_scores_gemma":[0.000104952844,0.00018521278,0.00060599076,0.000005220732,0.00005879152,0.00007102833,0.00011603668,0.98117596,0.011720202,0.0046401178,0.0012941797,0.000022235125],"about_ca_topic_score_codex":0.007130362,"about_ca_topic_score_gemma":0.015621335,"teacher_disagreement_score":0.007130362,"about_ca_system_score_codex":0.001262868,"about_ca_system_score_gemma":0.0030640648,"threshold_uncertainty_score":0.01417768},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077528744,0.0003741439,0.5766302,0.00035629226,0.00060391886,0.0002881982,0.0033936275,0.3792748,0.03132603],"genre_scores_gemma":[0.19476694,0.000487026,0.58794373,0.0016116985,0.00037161945,0.0013547732,0.015708834,0.11147464,0.0862807],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985668,0.00015276283,0.000106733045,0.00027255132,0.00063049723,0.0002705539],"domain_scores_gemma":[0.9976793,0.00051736506,0.000102560574,0.00064784987,0.0008550542,0.0001979495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077701645,0.002086518,0.00096373004,0.0016895062,0.0009986997,0.0025571208,0.0068423483,0.0014580959,0.08359098],"category_scores_gemma":[0.0052657034,0.0015041507,0.0011550505,0.0017168305,0.0006455302,0.0026373998,0.002899126,0.0028933673,0.032466073],"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.0019267851,0.0005487083,0.0019237518,0.0010885941,0.00021560257,0.000507979,0.00033372553,0.012713805,0.033507373,0.024700074,0.33908948,0.58344406],"study_design_scores_gemma":[0.0019938874,0.00040314702,0.0016387793,0.0003017503,0.0002250737,0.0006029181,0.00021527342,0.36037168,0.16559546,0.057817623,0.41043073,0.00040371314],"about_ca_topic_score_codex":0.0068553253,"about_ca_topic_score_gemma":0.01075461,"teacher_disagreement_score":0.08359098,"about_ca_system_score_codex":0.0013306881,"about_ca_system_score_gemma":0.0019908196,"threshold_uncertainty_score":0.27963972},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04278911,0.000082909224,0.9536044,0.00006245474,0.000037129226,0.000028770728,0.000053234937,0.0017250037,0.0016170668],"genre_scores_gemma":[0.7861927,0.00013259063,0.211376,0.000043434615,0.000018165825,0.00007360745,0.00010916306,0.00028707174,0.0017672405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748105,0.00096912385,0.00015856612,0.0003194323,0.0007895733,0.00028220168],"domain_scores_gemma":[0.99475586,0.003384339,0.00037134596,0.0010824886,0.00035471216,0.00005137081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019408755,0.0010346043,0.0009611918,0.0008657352,0.00047993386,0.0016803273,0.0012481683,0.0007815042,0.0022792362],"category_scores_gemma":[0.0076024616,0.0005004644,0.0012626752,0.0005583575,0.0029053479,0.0022633679,0.0012921379,0.0012523762,0.00035738095],"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.0011447761,0.0001902016,0.0021949108,0.00044448723,0.00016022676,0.0009852151,0.00071475096,0.5416312,0.036386326,0.30587563,0.00084978883,0.109422475],"study_design_scores_gemma":[0.000067990826,0.00009246866,0.00019913072,0.00005181489,0.00005702819,0.0001063915,0.000031608237,0.8765912,0.037009284,0.08450983,0.0012575977,0.000025750773],"about_ca_topic_score_codex":0.0015499399,"about_ca_topic_score_gemma":0.0017702507,"teacher_disagreement_score":0.0022792362,"about_ca_system_score_codex":0.0009636639,"about_ca_system_score_gemma":0.0015526162,"threshold_uncertainty_score":0.010264456},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.621896,0.0033330815,0.35736713,0.0010050378,0.00066249707,0.00018572368,0.00012681849,0.0027734132,0.012650311],"genre_scores_gemma":[0.9371828,0.0002336645,0.058292806,0.00015062247,0.00008410487,0.000060781287,0.00012662412,0.00018163618,0.003686953],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974578,0.000741634,0.00024263626,0.00017051905,0.0009788169,0.00040848632],"domain_scores_gemma":[0.9868197,0.0058006127,0.0009174983,0.004140266,0.0017686973,0.0005532529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002107297,0.00041900735,0.0007607732,0.00082148914,0.0013390464,0.0016278676,0.002774883,0.0007986766,0.0029694128],"category_scores_gemma":[0.012497377,0.00060515077,0.00034824933,0.0010965671,0.0010591958,0.0025671707,0.0020076232,0.0015330936,0.00052811985],"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.0036550802,0.0011410296,0.011058659,0.000812724,0.00026621483,0.0016670582,0.0017846461,0.11628076,0.07155534,0.06799871,0.012650005,0.7111297],"study_design_scores_gemma":[0.0005592573,0.0012204327,0.0032513153,0.00010168187,0.00029814028,0.0015191637,0.0010530058,0.7680185,0.10493781,0.09757209,0.021359188,0.00010942967],"about_ca_topic_score_codex":0.0006430133,"about_ca_topic_score_gemma":0.0011173552,"teacher_disagreement_score":0.0029694128,"about_ca_system_score_codex":0.0003226616,"about_ca_system_score_gemma":0.0011756171,"threshold_uncertainty_score":0.011144578},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029043654,0.0009785547,0.9518241,0.00036071337,0.00047631492,0.00021449929,0.00022461844,0.011205814,0.0056716125],"genre_scores_gemma":[0.4118983,0.00039514175,0.58096296,0.0002740423,0.00017444875,0.00019461109,0.0004082907,0.0006582597,0.0050339727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995521,0.00009630545,0.000018640592,0.000055733064,0.00019872472,0.000078469646],"domain_scores_gemma":[0.99953115,0.00008711997,0.00003793784,0.00011219246,0.00015302107,0.00007871173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004319085,0.000731442,0.00077542866,0.00078126893,0.001213043,0.0008545857,0.0026201322,0.0007281951,0.0037160974],"category_scores_gemma":[0.0012623161,0.00047177434,0.00057261507,0.0013914931,0.00036628195,0.0007721695,0.0012843161,0.0010403967,0.0007582291],"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.0006179213,0.00039098342,0.002405913,0.000363269,0.00020835454,0.0003882171,0.0001952725,0.3851677,0.040983908,0.012391862,0.04268154,0.5142051],"study_design_scores_gemma":[0.000064493084,0.000109949855,0.0003751223,0.000007849121,0.000028816039,0.00012211705,0.000044139797,0.9838958,0.0055698385,0.0032497784,0.006512307,0.00001983932],"about_ca_topic_score_codex":0.007925297,"about_ca_topic_score_gemma":0.018557612,"teacher_disagreement_score":0.007925297,"about_ca_system_score_codex":0.00064690143,"about_ca_system_score_gemma":0.002340797,"threshold_uncertainty_score":0.015758336},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13327079,0.0010185192,0.85275716,0.0005303498,0.0007086726,0.00018603094,0.00032670755,0.0056585344,0.005543217],"genre_scores_gemma":[0.58512765,0.00034222507,0.39837885,0.00031301568,0.00026910732,0.00024771265,0.0010854244,0.00026558206,0.013970335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945575,0.000082570485,0.00004302936,0.0001934421,0.00013704573,0.000088218636],"domain_scores_gemma":[0.99888915,0.0003077669,0.000050944596,0.00023560923,0.0004592554,0.00005720638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010156846,0.0007554996,0.0010942364,0.00081203185,0.00058135425,0.0007993101,0.0016746944,0.0010106917,0.0054253815],"category_scores_gemma":[0.0025307357,0.0004527317,0.0006641573,0.0011788674,0.00034112704,0.0014839196,0.0009293712,0.0013569515,0.001729221],"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.0005583989,0.00037926823,0.0013158284,0.00010530779,0.0001231807,0.00011470103,0.00007068392,0.16080011,0.019274846,0.002141251,0.0069577917,0.8081587],"study_design_scores_gemma":[0.000021690028,0.00006054752,0.0002765729,0.0000035575506,0.000023627594,0.000027780115,0.000010159098,0.9933503,0.00406111,0.0013797833,0.0007802737,0.000004639611],"about_ca_topic_score_codex":0.009839626,"about_ca_topic_score_gemma":0.012253845,"teacher_disagreement_score":0.009839626,"about_ca_system_score_codex":0.00077379216,"about_ca_system_score_gemma":0.0012930551,"threshold_uncertainty_score":0.019564688},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040326943,0.00009060573,0.9664765,0.00010814528,0.00007896279,0.0001343848,0.0006695515,0.025168914,0.0032403653],"genre_scores_gemma":[0.20169105,0.0005902063,0.7702975,0.00030460607,0.00010331712,0.0014536371,0.0048038927,0.011016379,0.009739404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856406,0.00046055176,0.00016538535,0.00019900143,0.0004870867,0.00012400855],"domain_scores_gemma":[0.9971365,0.0012145267,0.00011440698,0.000871224,0.00042412878,0.0002393014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023080946,0.0013195109,0.001398268,0.00074278074,0.0010639374,0.0031811332,0.005125922,0.0017811507,0.02051787],"category_scores_gemma":[0.0057687624,0.0012983134,0.001494801,0.0011491813,0.00091733,0.0028119523,0.0026681228,0.0033522933,0.005373012],"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.001170798,0.000645714,0.0027186042,0.00061932346,0.0003455464,0.00078391057,0.000622753,0.6905849,0.014050327,0.1052193,0.039375477,0.14386335],"study_design_scores_gemma":[0.00013825895,0.00006430748,0.00014183373,0.000028050275,0.000047539073,0.00009863928,0.000026069345,0.9475271,0.0048837927,0.023942843,0.023064861,0.000036818194],"about_ca_topic_score_codex":0.0034666706,"about_ca_topic_score_gemma":0.0029571252,"teacher_disagreement_score":0.02051787,"about_ca_system_score_codex":0.00067643437,"about_ca_system_score_gemma":0.0018948618,"threshold_uncertainty_score":0.06863904},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3749929,0.00081544684,0.59394324,0.0008810275,0.00062592136,0.0002900579,0.0002973068,0.013141343,0.015012775],"genre_scores_gemma":[0.9073424,0.000105917505,0.0870806,0.000077634264,0.000066084875,0.00009447002,0.00018550584,0.00023292491,0.004814517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940753,0.00014673814,0.00004447554,0.00010535117,0.00019706476,0.00009883915],"domain_scores_gemma":[0.99801034,0.00042625723,0.00009014241,0.0010199536,0.0003292826,0.00012402398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095776963,0.0005130077,0.0007104567,0.00050614384,0.0012486456,0.0013354556,0.002510071,0.00062549365,0.002460761],"category_scores_gemma":[0.003122342,0.00040968892,0.00028519228,0.00054994447,0.0007781205,0.0011879418,0.0015288666,0.00095877255,0.0005173728],"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.004629884,0.000524046,0.007818863,0.00043784306,0.0002683192,0.0010396179,0.0010790621,0.32546476,0.22462341,0.09897746,0.017148292,0.31798843],"study_design_scores_gemma":[0.0001164418,0.00020984624,0.00076960144,0.000009591243,0.00005210103,0.00010074843,0.00008567329,0.9587638,0.02678353,0.007862374,0.005201524,0.00004468157],"about_ca_topic_score_codex":0.0035962944,"about_ca_topic_score_gemma":0.005550504,"teacher_disagreement_score":0.0035962944,"about_ca_system_score_codex":0.000677774,"about_ca_system_score_gemma":0.0012375944,"threshold_uncertainty_score":0.0082319975},"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":"review","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014802443,0.39413002,0.06649998,0.039773386,0.38462538,0.0003710603,0.0009973908,0.00044940712,0.111673154],"genre_scores_gemma":[0.017027292,0.29740137,0.019491807,0.016691228,0.36098662,0.0005092717,0.0016207885,0.0011586986,0.28511286],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99887663,0.00025768526,0.000115727904,0.00028115968,0.0003951726,0.00007354213],"domain_scores_gemma":[0.9938607,0.0014055655,0.00019698434,0.0003793064,0.0033031155,0.00085420074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002602091,0.0029954538,0.0018056906,0.0029545438,0.0017570616,0.0041820533,0.0014543288,0.002588202,0.020858651],"category_scores_gemma":[0.00586694,0.0007584344,0.001312647,0.0042821756,0.0018871984,0.004991031,0.0022920717,0.007921174,0.024060696],"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.00009122892,0.00021226435,0.00027807456,0.0015650147,0.000034805013,0.00016707233,0.00025004343,0.0017382551,0.00096293143,0.033158205,0.7511835,0.2103586],"study_design_scores_gemma":[0.000013815412,0.000107625376,0.00094155886,0.0006989442,0.000018295397,0.00022332676,0.000083642575,0.00057461404,0.00029283273,0.021374663,0.97563976,0.000030908464],"about_ca_topic_score_codex":0.002389577,"about_ca_topic_score_gemma":0.002139398,"teacher_disagreement_score":0.020858651,"about_ca_system_score_codex":0.0021308074,"about_ca_system_score_gemma":0.0024327303,"threshold_uncertainty_score":0.0697791},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9953159,0.00031119032,0.0027761532,0.00015098637,0.00004321762,0.000014732043,0.000071607705,0.00019865455,0.0011175727],"genre_scores_gemma":[0.9980848,0.000059210113,0.0014001041,0.000024501325,0.00002096169,0.000011331377,0.00007873129,0.000056826313,0.0002637127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972224,0.0009462238,0.0001696222,0.00040149115,0.00062353024,0.00063670176],"domain_scores_gemma":[0.9614685,0.029209618,0.0019274735,0.0036426114,0.0025309403,0.001220839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036467959,0.00069230446,0.00057775626,0.000896818,0.0008270461,0.0014389622,0.0010586305,0.0006534415,0.0015196899],"category_scores_gemma":[0.023511259,0.00061374996,0.0004632794,0.0013231781,0.0010317847,0.0018498703,0.0007537126,0.0015795896,0.00019790453],"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.009476951,0.0027338988,0.13927154,0.00059494906,0.00055784266,0.00047294283,0.0009269287,0.564661,0.14067997,0.008827705,0.005034552,0.12676169],"study_design_scores_gemma":[0.00012834983,0.0011464187,0.03310149,0.000017816983,0.0002501321,0.0000889077,0.00022637432,0.9135151,0.046976365,0.003578819,0.000919503,0.000050755232],"about_ca_topic_score_codex":0.0036970149,"about_ca_topic_score_gemma":0.0042525693,"teacher_disagreement_score":0.0036970149,"about_ca_system_score_codex":0.0011467481,"about_ca_system_score_gemma":0.0015779539,"threshold_uncertainty_score":0.019286275},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010860658,0.0002857201,0.97593826,0.0008735351,0.00026861843,0.0005415889,0.001030374,0.0033856975,0.0068155443],"genre_scores_gemma":[0.2177808,0.00045045704,0.77025074,0.0005068212,0.00021871364,0.00045065835,0.0021027299,0.0005453892,0.007693711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941024,0.0011649792,0.0007305809,0.0009235575,0.002662382,0.0004161478],"domain_scores_gemma":[0.9951408,0.00085285463,0.00026937222,0.0021394426,0.0012898407,0.00030764888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004684425,0.00063789455,0.0015618883,0.0017616426,0.0011333433,0.0073127197,0.0049894396,0.0020957391,0.008889767],"category_scores_gemma":[0.0104521215,0.00081297103,0.0016011082,0.0034321016,0.0010212667,0.008420793,0.0041836165,0.0031872492,0.0027379221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.0008269591,0.0010121487,0.002140575,0.00038258627,0.00026461657,0.0004382614,0.0004651705,0.043137334,0.016042106,0.6358798,0.032259755,0.26715064],"study_design_scores_gemma":[0.00026812172,0.00019503148,0.00047584964,0.00005287148,0.0001432636,0.0009858301,0.00015858033,0.7442804,0.009576939,0.20725843,0.036488663,0.00011598854],"about_ca_topic_score_codex":0.0026440634,"about_ca_topic_score_gemma":0.0024149718,"teacher_disagreement_score":0.008889767,"about_ca_system_score_codex":0.0015108192,"about_ca_system_score_gemma":0.0028959173,"threshold_uncertainty_score":0.029739201},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061281648,0.0009850943,0.8605872,0.0007336088,0.0007520687,0.00035543134,0.0013328391,0.060003564,0.013968521],"genre_scores_gemma":[0.40231788,0.00053763925,0.5747615,0.0005942461,0.00017005614,0.00044160665,0.00280169,0.004664654,0.0137108015],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992206,0.00018922202,0.00003998927,0.00014476836,0.00026276914,0.00014256526],"domain_scores_gemma":[0.99776757,0.00059943483,0.000085266365,0.0010283659,0.00032138242,0.00019796324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076316285,0.00091135595,0.00089169457,0.00081509986,0.00082260114,0.0014524984,0.003202759,0.00096958794,0.009792801],"category_scores_gemma":[0.0040494273,0.0006539209,0.0006254456,0.0011971227,0.000736717,0.0031264797,0.002679767,0.0018372638,0.0024345627],"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.0033659227,0.0011598414,0.0041248584,0.0010796039,0.0003337245,0.00041833514,0.0010050538,0.10206456,0.06830974,0.07244558,0.12849012,0.61720276],"study_design_scores_gemma":[0.00034065617,0.0003396975,0.0008482365,0.000067765235,0.000100517194,0.0001325494,0.00015890494,0.8370861,0.052408975,0.06836628,0.04008151,0.0000687079],"about_ca_topic_score_codex":0.008337434,"about_ca_topic_score_gemma":0.021720426,"teacher_disagreement_score":0.009792801,"about_ca_system_score_codex":0.0008119355,"about_ca_system_score_gemma":0.0021011133,"threshold_uncertainty_score":0.032760203},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014184932,0.00006736493,0.99563205,0.00006578855,0.00003316512,0.000035471614,0.00006325465,0.0019477266,0.00073673076],"genre_scores_gemma":[0.095088504,0.00024398643,0.893239,0.00009940558,0.00012654868,0.00034836138,0.00064860313,0.002304871,0.007900733],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978369,0.0005316471,0.00014000727,0.00034860423,0.0009100595,0.00023276501],"domain_scores_gemma":[0.9943146,0.0025856,0.0002842968,0.0013922157,0.0012014849,0.00022189697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016471251,0.0022253054,0.001383321,0.0026228563,0.0015178705,0.0023701086,0.003559467,0.0011984502,0.01440453],"category_scores_gemma":[0.0108327875,0.0010345235,0.0016485763,0.002781782,0.001469147,0.0031223227,0.003415274,0.003377317,0.0044136113],"study_design_candidate":"bench_or_experimental","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.0005974607,0.00029320628,0.0012802384,0.00044235692,0.00017127086,0.00017612614,0.0004910529,0.16119617,0.017060682,0.14233668,0.01670053,0.65925425],"study_design_scores_gemma":[0.00007585523,0.00004624448,0.00015104242,0.000027836071,0.000026725049,0.00006374962,0.000061001687,0.8747262,0.007282567,0.110931925,0.006578988,0.00002799487],"about_ca_topic_score_codex":0.006112706,"about_ca_topic_score_gemma":0.00884172,"teacher_disagreement_score":0.01440453,"about_ca_system_score_codex":0.0013491285,"about_ca_system_score_gemma":0.0027520536,"threshold_uncertainty_score":0.04818797},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52761513,0.0005675675,0.44610354,0.00038987666,0.00020166671,0.00012449424,0.00051795307,0.016167596,0.008312123],"genre_scores_gemma":[0.84909815,0.00012672388,0.14593068,0.00007139465,0.000020791576,0.000041498235,0.0004913164,0.00046306662,0.003756521],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994091,0.00009824255,0.000035571797,0.00012782645,0.00023027248,0.00009899231],"domain_scores_gemma":[0.9983814,0.0006477168,0.00011897706,0.00034977408,0.00040693046,0.000095191266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045261128,0.0006681949,0.00039381598,0.0011826656,0.0006646456,0.0010722982,0.00096045574,0.00059273426,0.0021860132],"category_scores_gemma":[0.004103558,0.0003942107,0.00039041418,0.0009998021,0.00045217274,0.0009635239,0.00069800514,0.0007221399,0.000474019],"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.0009150536,0.00048415587,0.036764223,0.0002549216,0.000117129195,0.00051172083,0.00082601764,0.3881254,0.08708968,0.019500531,0.012039227,0.4533719],"study_design_scores_gemma":[0.000008620222,0.000034992332,0.0010445724,0.000007697205,0.000006046274,0.000041817122,0.000047279962,0.975784,0.017746761,0.0033837613,0.0018876282,0.000006856529],"about_ca_topic_score_codex":0.010629289,"about_ca_topic_score_gemma":0.014118471,"teacher_disagreement_score":0.010629289,"about_ca_system_score_codex":0.0009035889,"about_ca_system_score_gemma":0.001741162,"threshold_uncertainty_score":0.021134853},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06328029,0.00028472737,0.91912144,0.00040097776,0.00014667863,0.00044619225,0.0015225337,0.008603788,0.0061934367],"genre_scores_gemma":[0.4845076,0.00019459121,0.50759596,0.00017713601,0.000040936815,0.0004216885,0.0026416858,0.0023664252,0.0020540152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978027,0.0004941612,0.00013755407,0.00032869863,0.0009282253,0.0003086716],"domain_scores_gemma":[0.99234116,0.004922642,0.0005184761,0.0006903844,0.0013029448,0.0002244582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014691036,0.0019669647,0.0014297978,0.0023662793,0.0012123112,0.002333025,0.002383399,0.0013551429,0.0070157438],"category_scores_gemma":[0.011245113,0.0014442186,0.0023050352,0.0014759066,0.0011152703,0.0021977203,0.0023491695,0.0024213616,0.00086144183],"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.00028376558,0.00022403989,0.0027870547,0.00051200733,0.000102308964,0.00061697146,0.00028604793,0.8747931,0.013744442,0.02573552,0.0064985882,0.07441619],"study_design_scores_gemma":[0.000026831956,0.000018105182,0.00013219361,0.000019873843,0.000013624266,0.000024827787,0.000032721775,0.98724097,0.003382272,0.0075619346,0.0015357662,0.000010798547],"about_ca_topic_score_codex":0.01645532,"about_ca_topic_score_gemma":0.033698127,"teacher_disagreement_score":0.01645532,"about_ca_system_score_codex":0.001543736,"about_ca_system_score_gemma":0.006105063,"threshold_uncertainty_score":0.032719076},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2152285,0.0046311175,0.76150614,0.0005063499,0.00055871025,0.00007937272,0.00038464388,0.004420219,0.012684936],"genre_scores_gemma":[0.8758133,0.0006862405,0.11379093,0.00025082883,0.00008267632,0.00006302046,0.0003517638,0.00009872721,0.008862443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999912,0.000009763571,0.0000052625937,0.000022685706,0.000034886958,0.000015408761],"domain_scores_gemma":[0.99981004,0.000038151815,0.0000149251155,0.000026628599,0.00009745447,0.000012789756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011991364,0.00034792745,0.0005315659,0.00035405473,0.00043375944,0.00046161198,0.0014928558,0.00035590466,0.0027452244],"category_scores_gemma":[0.00030839833,0.00017604815,0.0002719116,0.0006161245,0.00013694348,0.0010706073,0.00032229602,0.00043043666,0.0003419104],"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.00078570226,0.00050659233,0.0040674387,0.00035709192,0.00034119116,0.0003662126,0.00008146767,0.36803547,0.087433465,0.008466875,0.01593937,0.5136192],"study_design_scores_gemma":[0.000016167454,0.00008985248,0.00028867673,0.0000068281206,0.000037590173,0.00004395554,0.000009567443,0.9892452,0.008154329,0.000875995,0.0012235955,0.000008210327],"about_ca_topic_score_codex":0.006082755,"about_ca_topic_score_gemma":0.018969547,"teacher_disagreement_score":0.006082755,"about_ca_system_score_codex":0.0003806714,"about_ca_system_score_gemma":0.000758666,"threshold_uncertainty_score":0.0120946765},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003205875,0.0015817545,0.00029866188,0.030489612,0.9663676,0.000010776551,0.00003131608,0.000055141565,0.0011331241],"genre_scores_gemma":[0.00057699654,0.0017416028,0.00026886968,0.020224735,0.9692751,0.00002030963,0.000024498928,0.000081101265,0.0077867387],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99413645,0.0007905216,0.00076622353,0.0007332108,0.003166385,0.00040725432],"domain_scores_gemma":[0.9729546,0.008823379,0.0015509049,0.0008124134,0.012310227,0.0035484757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065282644,0.0031723857,0.0038404434,0.0031726256,0.0033969386,0.010127553,0.0036943231,0.016574016,0.013962393],"category_scores_gemma":[0.031069515,0.0012281436,0.0033360873,0.0019532766,0.002368517,0.0033206411,0.0015758909,0.02749529,0.01155846],"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.0000316896,0.000010837573,0.000032090036,0.0001289567,0.000021962574,0.00014610172,0.000007066362,0.00006014444,0.000050138726,0.00032352936,0.9955467,0.003640674],"study_design_scores_gemma":[0.00007241302,0.000032653024,0.00037290514,0.0003710017,0.000082943516,0.00044312348,0.000036192752,0.0007258027,0.0002368865,0.0018605993,0.9957344,0.000031143947],"about_ca_topic_score_codex":0.0014210321,"about_ca_topic_score_gemma":0.004192689,"teacher_disagreement_score":0.016574016,"about_ca_system_score_codex":0.002503056,"about_ca_system_score_gemma":0.0031525192,"threshold_uncertainty_score":0.046708822},"labels":[],"label_agreement":null}]}