{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":19,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":19,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"217167b2f74c","filters":{"venue":"International Journal of Parallel Programming"}},"results":[{"id":"W1991592471","doi":"10.1007/s10766-014-0320-y","title":"pocl: A Performance-Portable OpenCL Implementation","year":2014,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":124,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph; Perimeter Institute","funders":"","keywords":"Software portability; Compiler; Porting; SIMD; Kernel (algebra); Data parallelism; Parallelism (grammar); Exploit; Stencil","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01600255926352157,"gpt":0.3110218934464314,"spread":0.2950193341829098,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007770165,0.002086518,0.00096373,0.001689506,0.0009986997,0.002557121,0.006842348,0.001458096,0.08359098],"category_scores_gemma":[0.005265703,0.001504151,0.00115505,0.001716831,0.0006455302,0.0026374,0.002899126,0.002893367,0.03246607],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001330688,"about_ca_system_score_gemma":0.00199082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006855325,"about_ca_topic_score_gemma":0.01075461,"domain_scores_codex":[0.9985668,0.0001527628,0.000106733,0.0002725513,0.0006304972,0.0002705539],"domain_scores_gemma":[0.9976793,0.0005173651,0.0001025606,0.0006478499,0.0008550542,0.0001979495],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001926785,0.0005487083,0.001923752,0.001088594,0.0002156026,0.000507979,0.0003337255,0.0127138,0.03350737,0.02470007,0.3390895,0.5834441],"study_design_scores_gemma":[0.001993887,0.000403147,0.001638779,0.0003017503,0.0002250737,0.0006029181,0.0002152734,0.3603717,0.1655955,0.05781762,0.4104307,0.0004037131],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.007752874,0.0003741439,0.5766302,0.0003562923,0.0006039189,0.0002881982,0.003393627,0.3792748,0.03132603],"genre_scores_gemma":[0.1947669,0.000487026,0.5879437,0.001611699,0.0003716194,0.001354773,0.01570883,0.1114746,0.0862807],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.08359098,"threshold_uncertainty_score":0.2796397,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029940726","doi":"10.1007/s10766-005-0004-8","title":"Embedded Software Verification Using Symbolic Execution and Uninterpreted Functions","year":2006,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Symbolic execution; Programming language; Scalability; Formal verification; Model checking; Embedded software; Software; Key (lock); Computer architecture; Parallel computing; Operating system","authors":[{"name":"David W. Currie","is_ca":false},{"name":"Xiushan Feng","is_ca":true},{"name":"Masahiro Fujita","is_ca":false},{"name":"Alan J. Hu","is_ca":true},{"name":"Mark Kwan","is_ca":false},{"name":"Sreeranga P. Rajan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0200795795192456,"gpt":0.301138606099302,"spread":0.2810590265800564,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001940876,0.001034604,0.0009611918,0.0008657352,0.0004799339,0.001680327,0.001248168,0.0007815042,0.002279236],"category_scores_gemma":[0.007602462,0.0005004644,0.001262675,0.0005583575,0.002905348,0.002263368,0.001292138,0.001252376,0.000357381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009636639,"about_ca_system_score_gemma":0.001552616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00154994,"about_ca_topic_score_gemma":0.001770251,"domain_scores_codex":[0.997481,0.0009691239,0.0001585661,0.0003194323,0.0007895733,0.0002822017],"domain_scores_gemma":[0.9947559,0.003384339,0.000371346,0.001082489,0.0003547122,0.00005137081],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001144776,0.0001902016,0.002194911,0.0004444872,0.0001602268,0.0009852151,0.000714751,0.5416312,0.03638633,0.3058756,0.0008497888,0.1094225],"study_design_scores_gemma":[0.00006799083,0.00009246866,0.0001991307,0.00005181489,0.00005702819,0.0001063915,0.00003160824,0.8765912,0.03700928,0.08450983,0.001257598,0.00002575077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04278911,0.00008290922,0.9536044,0.00006245474,0.00003712923,0.00002877073,0.00005323494,0.001725004,0.001617067],"genre_scores_gemma":[0.7861927,0.0001325906,0.211376,0.00004343461,0.00001816583,0.00007360745,0.0001091631,0.0002870717,0.00176724],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002279236,"threshold_uncertainty_score":0.01026446,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062877387","doi":"10.1007/s10766-013-0286-1","title":"CCAP: A Cache Contention-Aware Virtual Machine Placement Approach for HPC Cloud","year":2013,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Leukemia and Lymphoma Society of Canada","keywords":"Computer science; Cache; Cache coloring; Smart Cache; Cache algorithms; Cache invalidation; Cache pollution; Page cache; Operating system; Cache-oblivious algorithm; Hypervisor; Cloud computing; Virtual machine; Virtualization; CPU cache","authors":[{"name":"Hai Jin","is_ca":false},{"name":"Hanfeng Qin","is_ca":false},{"name":"Song Wu","is_ca":false},{"name":"Xue-rong Guo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02072319322066504,"gpt":0.2664171845668166,"spread":0.2456939913461515,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004319085,0.000731442,0.0007754287,0.0007812689,0.001213043,0.0008545857,0.002620132,0.0007281951,0.003716097],"category_scores_gemma":[0.001262316,0.0004717743,0.0005726151,0.001391493,0.000366282,0.0007721695,0.001284316,0.001040397,0.0007582291],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006469014,"about_ca_system_score_gemma":0.002340797,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007925297,"about_ca_topic_score_gemma":0.01855761,"domain_scores_codex":[0.9995521,0.00009630545,0.00001864059,0.00005573306,0.0001987247,0.00007846965],"domain_scores_gemma":[0.9995311,0.00008711997,0.00003793784,0.0001121925,0.0001530211,0.00007871173],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006179213,0.0003909834,0.002405913,0.000363269,0.0002083545,0.0003882171,0.0001952725,0.3851677,0.04098391,0.01239186,0.04268154,0.5142051],"study_design_scores_gemma":[0.00006449308,0.0001099499,0.0003751223,0.000007849121,0.00002881604,0.0001221171,0.0000441398,0.9838958,0.005569838,0.003249778,0.006512307,0.00001983932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02904365,0.0009785547,0.9518241,0.0003607134,0.0004763149,0.0002144993,0.0002246184,0.01120581,0.005671612],"genre_scores_gemma":[0.4118983,0.0003951417,0.580963,0.0002740423,0.0001744488,0.0001946111,0.0004082907,0.0006582597,0.005033973],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007925297,"threshold_uncertainty_score":0.01575834,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2090209978","doi":"10.1007/s10766-009-0094-9","title":"A Speculative and Adaptive MPI Rendezvous Protocol Over RDMA-enabled Interconnects","year":2009,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Remote direct memory access; Computer science; InfiniBand; Rendezvous; Message passing; Computer network; Message Passing Interface; Latency (audio); Protocol (science); Distributed computing; Overhead (engineering); Parallel computing; Operating system","authors":[{"name":"Mohammad Javad Rashti","is_ca":true},{"name":"Ahmad Afsahi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02013553902287299,"gpt":0.316397548544232,"spread":0.296262009521359,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009577696,0.0005130077,0.0007104567,0.0005061438,0.001248646,0.001335456,0.002510071,0.0006254936,0.002460761],"category_scores_gemma":[0.003122342,0.0004096889,0.0002851923,0.0005499445,0.0007781205,0.001187942,0.001528867,0.0009587726,0.0005173728],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000677774,"about_ca_system_score_gemma":0.001237594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003596294,"about_ca_topic_score_gemma":0.005550504,"domain_scores_codex":[0.9994075,0.0001467381,0.00004447554,0.0001053512,0.0001970648,0.00009883915],"domain_scores_gemma":[0.9980103,0.0004262572,0.00009014241,0.001019954,0.0003292826,0.000124024],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.004629884,0.000524046,0.007818863,0.0004378431,0.0002683192,0.001039618,0.001079062,0.3254648,0.2246234,0.09897746,0.01714829,0.3179884],"study_design_scores_gemma":[0.0001164418,0.0002098462,0.0007696014,0.000009591243,0.00005210103,0.0001007484,0.00008567329,0.9587638,0.02678353,0.007862374,0.005201524,0.00004468157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3749929,0.0008154468,0.5939432,0.0008810275,0.0006259214,0.0002900579,0.0002973068,0.01314134,0.01501277],"genre_scores_gemma":[0.9073424,0.0001059175,0.0870806,0.00007763426,0.00006608487,0.00009447002,0.0001855058,0.0002329249,0.004814517],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003596294,"threshold_uncertainty_score":0.008231997,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980008253","doi":"10.1007/s10766-010-0152-3","title":"Process Arrival Pattern Aware Alltoall and Allgather on InfiniBand Clusters","year":2010,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"InfiniBand; Remote direct memory access; Computer science; Speedup; Process (computing); Implementation; Parallel computing; Message passing; Theory of computation; Message Passing Interface; Distributed computing; Operating system; Algorithm; Programming language","authors":[{"name":"Ying Qian","is_ca":true},{"name":"Ahmad Afsahi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01244479937963613,"gpt":0.2962985924852328,"spread":0.2838537931055967,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009010908,0.0009955202,0.001473941,0.0005477645,0.001531397,0.001491933,0.002457389,0.0005699967,0.003567608],"category_scores_gemma":[0.001606026,0.0004720697,0.0005502053,0.0008137344,0.0005870588,0.001407022,0.00146953,0.0008153882,0.0003503683],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001262868,"about_ca_system_score_gemma":0.003064065,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007130362,"about_ca_topic_score_gemma":0.01562134,"domain_scores_codex":[0.9990958,0.0001929903,0.00004297179,0.0001533906,0.0002385684,0.0002762372],"domain_scores_gemma":[0.9984649,0.0004521412,0.00008657836,0.0005378294,0.0002992578,0.0001593027],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.007578288,0.0008920893,0.007417273,0.0002727956,0.0002285282,0.0006470784,0.0004511478,0.6814826,0.03433896,0.01998475,0.01633415,0.2303724],"study_design_scores_gemma":[0.0001049528,0.0001852128,0.0006059908,0.000005220732,0.00005879152,0.00007102833,0.0001160367,0.981176,0.0117202,0.004640118,0.00129418,0.00002223512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6483063,0.0009076846,0.3223678,0.001116579,0.0004060538,0.0001647582,0.0002736748,0.01174667,0.01471045],"genre_scores_gemma":[0.9391212,0.00009095453,0.05537262,0.0001544117,0.00003674173,0.00003275409,0.0001110636,0.0002330226,0.004847234],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007130362,"threshold_uncertainty_score":0.01417768,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1582451000","doi":"10.1023/a:1023086618401","title":"Large System Performance of SPEC OMP Benchmark Suites","year":2003,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Hewlett-Packard (Canada)","funders":"","keywords":"Computer science; Spec#; Benchmark (surveying); Scalability; Scale (ratio); Parallel computing; Theory of computation; Operating system; Programming language","authors":[{"name":"Hideki Saito","is_ca":false},{"name":"Greg Gaertner","is_ca":true},{"name":"Wesley Jones","is_ca":false},{"name":"Rudolf Eigenmann","is_ca":false},{"name":"Hidetoshi Iwashita","is_ca":false},{"name":"Ron Lieberman","is_ca":true},{"name":"Matthijs van Waveren","is_ca":false},{"name":"Brian Whitney","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01146068857138414,"gpt":0.2513160070212024,"spread":0.2398553184498183,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002046006,0.0009723508,0.0006901497,0.001390425,0.0007659376,0.000916116,0.001294759,0.0006213629,0.002596591],"category_scores_gemma":[0.006905865,0.0004555705,0.0004090183,0.002826368,0.0006611181,0.001401321,0.0007563907,0.0007675854,0.0005392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009479613,"about_ca_system_score_gemma":0.001014577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008881583,"about_ca_topic_score_gemma":0.008472307,"domain_scores_codex":[0.9981418,0.0005078882,0.00008815652,0.0003002333,0.0006887709,0.0002731424],"domain_scores_gemma":[0.9944126,0.002811869,0.0002260335,0.0006975402,0.001542514,0.0003094375],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.009856486,0.002135578,0.06169178,0.0009990444,0.0008397179,0.001209468,0.0005814536,0.5754206,0.06249586,0.0112205,0.1367792,0.1367703],"study_design_scores_gemma":[0.000502485,0.001065681,0.07360946,0.00002991322,0.0001917592,0.0002351639,0.0002885029,0.8598614,0.05274377,0.004558092,0.006817172,0.00009656944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.987581,0.0004083922,0.001775364,0.0003260657,0.000101348,0.00002183837,0.003173966,0.002368609,0.004243394],"genre_scores_gemma":[0.9857254,0.0001327196,0.002300875,0.00005082403,0.00005351338,0.00002371134,0.01006306,0.0003968699,0.001253091],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008881583,"threshold_uncertainty_score":0.01765972,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071505781","doi":"10.1007/s10766-013-0245-x","title":"Parallel Training of An Improved Neural Network for Text Categorization","year":2013,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Speedup; Computer science; Categorization; Correctness; Artificial neural network; The Internet; Artificial intelligence; Text categorization; Process (computing); Machine learning; Data mining; Parallel computing; Algorithm; World Wide Web","authors":[{"name":"Cheng Hua Li","is_ca":true},{"name":"Laurence T. Yang","is_ca":true},{"name":"Man Lin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03387168784162624,"gpt":0.2973515778122583,"spread":0.263479889970632,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001015685,0.0007554996,0.001094236,0.0008120319,0.0005813543,0.0007993101,0.001674694,0.001010692,0.005425381],"category_scores_gemma":[0.002530736,0.0004527317,0.0006641573,0.001178867,0.000341127,0.00148392,0.0009293712,0.001356952,0.001729221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007737922,"about_ca_system_score_gemma":0.001293055,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009839626,"about_ca_topic_score_gemma":0.01225385,"domain_scores_codex":[0.9994557,0.00008257048,0.00004302936,0.0001934421,0.0001370457,0.00008821864],"domain_scores_gemma":[0.9988891,0.0003077669,0.0000509446,0.0002356092,0.0004592554,0.00005720638],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005583989,0.0003792682,0.001315828,0.0001053078,0.0001231807,0.000114701,0.00007068392,0.1608001,0.01927485,0.002141251,0.006957792,0.8081587],"study_design_scores_gemma":[0.00002169003,0.00006054752,0.0002765729,0.000003557551,0.00002362759,0.00002778012,0.0000101591,0.9933503,0.00406111,0.001379783,0.0007802737,0.000004639611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1332708,0.001018519,0.8527572,0.0005303498,0.0007086726,0.0001860309,0.0003267076,0.005658534,0.005543217],"genre_scores_gemma":[0.5851277,0.0003422251,0.3983788,0.0003130157,0.0002691073,0.0002477127,0.001085424,0.0002655821,0.01397034],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009839626,"threshold_uncertainty_score":0.01956469,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2138333931","doi":"10.1007/s10766-007-0066-x","title":"Analyzing the Effects of Hyperthreading on the Performance of Data Management Systems","year":2008,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Pentium; Multithreading; Operating system; Benchmark (surveying); Parallel computing; Computer architecture; Embedded system","authors":[{"name":"Wessam Hassanein","is_ca":true},{"name":"Layali Rashid","is_ca":true},{"name":"Moustafa A. Hammad","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03246800490371323,"gpt":0.2733394568158058,"spread":0.2408714519120926,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003646796,0.0006923045,0.0005777563,0.000896818,0.0008270461,0.001438962,0.001058631,0.0006534415,0.00151969],"category_scores_gemma":[0.02351126,0.00061375,0.0004632794,0.001323178,0.001031785,0.00184987,0.0007537126,0.00157959,0.0001979045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001146748,"about_ca_system_score_gemma":0.001577954,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003697015,"about_ca_topic_score_gemma":0.004252569,"domain_scores_codex":[0.9972224,0.0009462238,0.0001696222,0.0004014912,0.0006235302,0.0006367018],"domain_scores_gemma":[0.9614685,0.02920962,0.001927473,0.003642611,0.00253094,0.001220839],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.009476951,0.002733899,0.1392715,0.0005949491,0.0005578427,0.0004729428,0.0009269287,0.564661,0.14068,0.008827705,0.005034552,0.1267617],"study_design_scores_gemma":[0.0001283498,0.001146419,0.03310149,0.00001781698,0.0002501321,0.0000889077,0.0002263743,0.9135151,0.04697637,0.003578819,0.000919503,0.00005075523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9953159,0.0003111903,0.002776153,0.0001509864,0.00004321762,0.00001473204,0.0000716077,0.0001986546,0.001117573],"genre_scores_gemma":[0.9980848,0.00005921011,0.001400104,0.00002450133,0.00002096169,0.00001133138,0.00007873129,0.00005682631,0.0002637127],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003697015,"threshold_uncertainty_score":0.01928627,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2766218044","doi":"10.1007/s10766-017-0534-x","title":"A Novel Auction-Based Query Pricing Schema","year":2017,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Jilin Scientific and Technological Development Program; National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Schema (genetic algorithms); Theory of computation; Query optimization; Theoretical computer science; Information retrieval; Programming language","authors":[{"name":"Xingwang Wang","is_ca":false},{"name":"Xiaohui Wei","is_ca":false},{"name":"Shang Gao","is_ca":false},{"name":"Yuanyuan Liu","is_ca":false},{"name":"Zongpeng Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.135730087474902,"gpt":0.4453235509090462,"spread":0.3095934634341443,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004684425,0.0006378946,0.001561888,0.001761643,0.001133343,0.00731272,0.00498944,0.002095739,0.008889767],"category_scores_gemma":[0.01045212,0.000812971,0.001601108,0.003432102,0.001021267,0.008420793,0.004183616,0.003187249,0.002737922],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001510819,"about_ca_system_score_gemma":0.002895917,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002644063,"about_ca_topic_score_gemma":0.002414972,"domain_scores_codex":[0.9941024,0.001164979,0.0007305809,0.0009235575,0.002662382,0.0004161478],"domain_scores_gemma":[0.9951408,0.0008528546,0.0002693722,0.002139443,0.001289841,0.0003076489],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008269591,0.001012149,0.002140575,0.0003825863,0.0002646166,0.0004382614,0.0004651705,0.04313733,0.01604211,0.6358798,0.03225975,0.2671506],"study_design_scores_gemma":[0.0002681217,0.0001950315,0.0004758496,0.00005287148,0.0001432636,0.0009858301,0.0001585803,0.7442804,0.009576939,0.2072584,0.03648866,0.0001159885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01086066,0.0002857201,0.9759383,0.0008735351,0.0002686184,0.0005415889,0.001030374,0.003385697,0.006815544],"genre_scores_gemma":[0.2177808,0.000450457,0.7702507,0.0005068212,0.0002187136,0.0004506584,0.00210273,0.0005453892,0.007693711],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008889767,"threshold_uncertainty_score":0.0297392,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046897173","doi":"10.1007/s10766-012-0210-0","title":"Removal of Conflicts in Hardware Transactional Memory Systems","year":2012,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"European Research Consortium for Informatics and Mathematics; Ministère de l'Économie, de la Science et de l'Innovation - Québec; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Computer science; False sharing; Transactional memory; Cache; Cache coherence; Software versioning; Class (philosophy); Distributed computing; Theory of computation; Conflict resolution; Shared memory; Parallel computing; CPU cache; Operating system; Cache algorithms; Database transaction; Algorithm; Programming language; Artificial intelligence","authors":[{"name":"M. M. Waliullah","is_ca":false},{"name":"Per Stenström","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02488882091974005,"gpt":0.2882694005470693,"spread":0.2633805796273292,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002107297,0.0004190074,0.0007607732,0.0008214891,0.001339046,0.001627868,0.002774883,0.0007986766,0.002969413],"category_scores_gemma":[0.01249738,0.0006051508,0.0003482493,0.001096567,0.001059196,0.002567171,0.002007623,0.001533094,0.0005281199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003226616,"about_ca_system_score_gemma":0.001175617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006430133,"about_ca_topic_score_gemma":0.001117355,"domain_scores_codex":[0.9974578,0.000741634,0.0002426363,0.0001705191,0.0009788169,0.0004084863],"domain_scores_gemma":[0.9868197,0.005800613,0.0009174983,0.004140266,0.001768697,0.0005532529],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00365508,0.00114103,0.01105866,0.000812724,0.0002662148,0.001667058,0.001784646,0.1162808,0.07155534,0.06799871,0.01265,0.7111297],"study_design_scores_gemma":[0.0005592573,0.001220433,0.003251315,0.0001016819,0.0002981403,0.001519164,0.001053006,0.7680185,0.1049378,0.09757209,0.02135919,0.0001094297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.621896,0.003333081,0.3573671,0.001005038,0.0006624971,0.0001857237,0.0001268185,0.002773413,0.01265031],"genre_scores_gemma":[0.9371828,0.0002336645,0.05829281,0.0001506225,0.00008410487,0.00006078129,0.0001266241,0.0001816362,0.003686953],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002969413,"threshold_uncertainty_score":0.01114458,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2911938026","doi":"10.1007/s10766-019-00631-4","title":"Efficient Methods for Trace Analysis Parallelization","year":2019,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Speedup; Scalability; Parallel computing; TRACE (psycholinguistics); Parallelizable manifold; Tracing; Synchronization (alternating current); Thread (computing); Distributed computing; Algorithm; Channel (broadcasting); Database; Programming language","authors":[{"name":"Fabien Reumont-Locke","is_ca":true},{"name":"Naser Ezzati‐Jivan","is_ca":true},{"name":"Michel Dagenais","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.023685949324013,"gpt":0.3733582132010854,"spread":0.3496722638770723,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001647125,0.002225305,0.001383321,0.002622856,0.00151787,0.002370109,0.003559467,0.00119845,0.01440453],"category_scores_gemma":[0.01083279,0.001034523,0.001648576,0.002781782,0.001469147,0.003122323,0.003415274,0.003377317,0.004413611],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001349129,"about_ca_system_score_gemma":0.002752054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006112706,"about_ca_topic_score_gemma":0.00884172,"domain_scores_codex":[0.9978369,0.0005316471,0.0001400073,0.0003486042,0.0009100595,0.000232765],"domain_scores_gemma":[0.9943146,0.0025856,0.0002842968,0.001392216,0.001201485,0.000221897],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0005974607,0.0002932063,0.001280238,0.0004423569,0.0001712709,0.0001761261,0.0004910529,0.1611962,0.01706068,0.1423367,0.01670053,0.6592543],"study_design_scores_gemma":[0.00007585523,0.00004624448,0.0001510424,0.00002783607,0.00002672505,0.00006374962,0.00006100169,0.8747262,0.007282567,0.1109319,0.006578988,0.00002799487],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001418493,0.00006736493,0.9956321,0.00006578855,0.00003316512,0.00003547161,0.00006325465,0.001947727,0.0007367308],"genre_scores_gemma":[0.0950885,0.0002439864,0.893239,0.00009940558,0.0001265487,0.0003483614,0.0006486031,0.002304871,0.007900733],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01440453,"threshold_uncertainty_score":0.04818797,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3125008876","doi":"10.1007/s10766-021-00691-5","title":"A Power-Aware Hybrid Cache for Chip-Multi Processors Based on Neural Network Prediction Technique","year":2021,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Cache; Artificial neural network; Parallel computing; Theory of computation; Branch predictor; Power (physics); Chip; Cache algorithms; Computer architecture; Smart Cache; Cache pollution; CPU cache; Embedded system; Artificial intelligence; Algorithm; Telecommunications","authors":[{"name":"Furat Al-Obaidy","is_ca":true},{"name":"Arghavan Asad","is_ca":true},{"name":"Farah Mohammadi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02140913417774604,"gpt":0.2970786902296174,"spread":0.2756695560518714,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001199136,0.0003479274,0.0005315659,0.0003540547,0.0004337594,0.000461612,0.001492856,0.0003559047,0.002745224],"category_scores_gemma":[0.0003083983,0.0001760482,0.0002719116,0.0006161245,0.0001369435,0.001070607,0.000322296,0.0004304367,0.0003419104],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003806714,"about_ca_system_score_gemma":0.000758666,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006082755,"about_ca_topic_score_gemma":0.01896955,"domain_scores_codex":[0.999912,0.000009763571,0.000005262594,0.00002268571,0.00003488696,0.00001540876],"domain_scores_gemma":[0.99981,0.00003815181,0.00001492512,0.0000266286,0.00009745447,0.00001278976],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007857023,0.0005065923,0.004067439,0.0003570919,0.0003411912,0.0003662126,0.00008146767,0.3680355,0.08743346,0.008466875,0.01593937,0.5136192],"study_design_scores_gemma":[0.00001616745,0.00008985248,0.0002886767,0.000006828121,0.00003759017,0.00004395554,0.000009567443,0.9892452,0.008154329,0.000875995,0.001223595,0.000008210327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2152285,0.004631117,0.7615061,0.0005063499,0.0005587102,0.00007937272,0.0003846439,0.004420219,0.01268494],"genre_scores_gemma":[0.8758133,0.0006862405,0.1137909,0.0002508288,0.00008267632,0.00006302046,0.0003517638,0.00009872721,0.008862443],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006082755,"threshold_uncertainty_score":0.01209468,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2766773547","doi":"10.1007/s10766-017-0532-z","title":"BlockGraphChi: Enabling Block Update in Out-of-Core Graph Processing","year":2017,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Innovation Cluster (Canada)","funders":"National Natural Science Foundation of China","keywords":"Computer science; Theory of computation; Graph; Block (permutation group theory); Core (optical fiber); Parallel computing; Theoretical computer science; Distributed computing; Programming language; Mathematics; Telecommunications","authors":[{"name":"Zhiyuan Shao","is_ca":false},{"name":"Zhenjie Mei","is_ca":true},{"name":"Xiaofeng Ding","is_ca":false},{"name":"Hai Jin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03523848755230249,"gpt":0.3201289732414859,"spread":0.2848904856891835,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007631629,0.0009113559,0.0008916946,0.0008150999,0.0008226011,0.001452498,0.003202759,0.0009695879,0.009792801],"category_scores_gemma":[0.004049427,0.0006539209,0.0006254456,0.001197123,0.000736717,0.00312648,0.002679767,0.001837264,0.002434563],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008119355,"about_ca_system_score_gemma":0.002101113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008337434,"about_ca_topic_score_gemma":0.02172043,"domain_scores_codex":[0.9992206,0.000189222,0.00003998927,0.0001447684,0.0002627691,0.0001425653],"domain_scores_gemma":[0.9977676,0.0005994348,0.00008526637,0.001028366,0.0003213824,0.0001979632],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003365923,0.001159841,0.004124858,0.001079604,0.0003337245,0.0004183351,0.001005054,0.1020646,0.06830974,0.07244558,0.1284901,0.6172028],"study_design_scores_gemma":[0.0003406562,0.0003396975,0.0008482365,0.00006776524,0.0001005172,0.0001325494,0.0001589049,0.8370861,0.05240897,0.06836628,0.04008151,0.0000687079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06128165,0.0009850943,0.8605872,0.0007336088,0.0007520687,0.0003554313,0.001332839,0.06000356,0.01396852],"genre_scores_gemma":[0.4023179,0.0005376393,0.5747615,0.0005942461,0.0001700561,0.0004416067,0.00280169,0.004664654,0.0137108],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009792801,"threshold_uncertainty_score":0.0327602,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2914931648","doi":"10.1007/s10766-019-00630-5","title":"Tracing and Profiling Machine Learning Dataflow Applications on GPU","year":2019,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dataflow; Computer science; Tracing; Profiling (computer programming); Graph; Parallel computing; Debugging; Dataflow architecture; CUDA; Theoretical computer science; Programming language","authors":[{"name":"Pierre Zins","is_ca":true},{"name":"Michel Dagenais","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01859292314238829,"gpt":0.2959411872809266,"spread":0.2773482641385383,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004526113,0.0006681949,0.000393816,0.001182666,0.0006646456,0.001072298,0.0009604557,0.0005927343,0.002186013],"category_scores_gemma":[0.004103558,0.0003942107,0.0003904142,0.0009998021,0.0004521727,0.0009635239,0.0006980051,0.0007221399,0.000474019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009035889,"about_ca_system_score_gemma":0.001741162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01062929,"about_ca_topic_score_gemma":0.01411847,"domain_scores_codex":[0.9994091,0.00009824255,0.0000355718,0.0001278265,0.0002302725,0.00009899231],"domain_scores_gemma":[0.9983814,0.0006477168,0.0001189771,0.0003497741,0.0004069305,0.00009519127],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009150536,0.0004841559,0.03676422,0.0002549216,0.0001171292,0.0005117208,0.0008260176,0.3881254,0.08708968,0.01950053,0.01203923,0.4533719],"study_design_scores_gemma":[0.000008620222,0.00003499233,0.001044572,0.000007697205,0.000006046274,0.00004181712,0.00004727996,0.975784,0.01774676,0.003383761,0.001887628,0.000006856529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5276151,0.0005675675,0.4461035,0.0003898767,0.0002016667,0.0001244942,0.0005179531,0.0161676,0.008312123],"genre_scores_gemma":[0.8490981,0.0001267239,0.1459307,0.00007139465,0.00002079158,0.00004149824,0.0004913164,0.0004630666,0.003756521],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01062929,"threshold_uncertainty_score":0.02113485,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078484109","doi":"10.1007/s10766-013-0303-4","title":"A Transaction-Based Environment for System Modeling and Parallel Simulation","year":2014,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Speedup; SystemC; Parallel computing; Concurrency; Distributed computing; Scheduling (production processes); Granularity; Transaction processing; Workload; Database transaction; Computer architecture; Operating system; Programming language","authors":[{"name":"Amine Anane","is_ca":true},{"name":"E.M. Aboulhamid","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01917536753296576,"gpt":0.2687987249979213,"spread":0.2496233574649555,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002308095,0.001319511,0.001398268,0.0007427807,0.001063937,0.003181133,0.005125922,0.001781151,0.02051787],"category_scores_gemma":[0.005768762,0.001298313,0.001494801,0.001149181,0.00091733,0.002811952,0.002668123,0.003352293,0.005373012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006764344,"about_ca_system_score_gemma":0.001894862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003466671,"about_ca_topic_score_gemma":0.002957125,"domain_scores_codex":[0.9985641,0.0004605518,0.0001653854,0.0001990014,0.0004870867,0.0001240086],"domain_scores_gemma":[0.9971365,0.001214527,0.000114407,0.000871224,0.0004241288,0.0002393014],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001170798,0.000645714,0.002718604,0.0006193235,0.0003455464,0.0007839106,0.000622753,0.6905849,0.01405033,0.1052193,0.03937548,0.1438634],"study_design_scores_gemma":[0.000138259,0.00006430748,0.0001418337,0.00002805028,0.00004753907,0.00009863928,0.00002606935,0.9475271,0.004883793,0.02394284,0.02306486,0.00003681819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004032694,0.00009060573,0.9664765,0.0001081453,0.00007896279,0.0001343848,0.0006695515,0.02516891,0.003240365],"genre_scores_gemma":[0.201691,0.0005902063,0.7702975,0.0003046061,0.0001033171,0.001453637,0.004803893,0.01101638,0.009739404],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02051787,"threshold_uncertainty_score":0.06863904,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2091829660","doi":"10.1007/s10766-013-0254-9","title":"Parallel and Distributed Processing with Applications: Preface","year":2013,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Theory of computation; Parallel computing; Distributed computing; Programming language; Theoretical computer science","authors":[{"name":"Jesús Carretero","is_ca":false},{"name":"Laurence T. Yang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01218971172323697,"gpt":0.2584493047261179,"spread":0.246259593002881,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002602091,0.002995454,0.001805691,0.002954544,0.001757062,0.004182053,0.001454329,0.002588202,0.02085865],"category_scores_gemma":[0.00586694,0.0007584344,0.001312647,0.004282176,0.001887198,0.004991031,0.002292072,0.007921174,0.0240607],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002130807,"about_ca_system_score_gemma":0.00243273,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002389577,"about_ca_topic_score_gemma":0.002139398,"domain_scores_codex":[0.9988766,0.0002576853,0.0001157279,0.0002811597,0.0003951726,0.00007354213],"domain_scores_gemma":[0.9938607,0.001405566,0.0001969843,0.0003793064,0.003303115,0.0008542007],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00009122892,0.0002122643,0.0002780746,0.001565015,0.00003480501,0.0001670723,0.0002500434,0.001738255,0.0009629314,0.03315821,0.7511835,0.2103586],"study_design_scores_gemma":[0.00001381541,0.0001076254,0.0009415589,0.0006989442,0.0000182954,0.0002233268,0.00008364258,0.000574614,0.0002928327,0.02137466,0.9756398,0.00003090846],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"review","genre_gemma":"editorial","genre_scores_codex":[0.001480244,0.39413,0.06649998,0.03977339,0.3846254,0.0003710603,0.0009973908,0.0004494071,0.1116732],"genre_scores_gemma":[0.01702729,0.2974014,0.01949181,0.01669123,0.3609866,0.0005092717,0.001620788,0.001158699,0.2851129],"genre_candidate":"editorial","genre_consensus":null,"teacher_disagreement_score":0.02085865,"threshold_uncertainty_score":0.0697791,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3118549947","doi":"10.1007/s10766-020-00689-5","title":"Automated Generation of Model-Based Constraints for Common Multi-core and Real-Time Applications Using Execution Tracing","year":2021,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University; Polytechnique Montréal","funders":"","keywords":"Computer science; Scalability; Tracing; Overhead (engineering); Process (computing); Kernel (algebra); Event (particle physics); Distributed computing; Execution time; Real-time computing; Programming language; Operating system","authors":[{"name":"Raphaël Beamonte","is_ca":true},{"name":"Naser Ezzati‐Jivan","is_ca":true},{"name":"Michel Dagenais","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06982645979023029,"gpt":0.3553432237376553,"spread":0.285516763947425,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001469104,0.001966965,0.001429798,0.002366279,0.001212311,0.002333025,0.002383399,0.001355143,0.007015744],"category_scores_gemma":[0.01124511,0.001444219,0.002305035,0.001475907,0.00111527,0.00219772,0.002349169,0.002421362,0.0008614418],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001543736,"about_ca_system_score_gemma":0.006105063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01645532,"about_ca_topic_score_gemma":0.03369813,"domain_scores_codex":[0.9978027,0.0004941612,0.0001375541,0.0003286986,0.0009282253,0.0003086716],"domain_scores_gemma":[0.9923412,0.004922642,0.0005184761,0.0006903844,0.001302945,0.0002244582],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002837656,0.0002240399,0.002787055,0.0005120073,0.000102309,0.0006169715,0.0002860479,0.8747931,0.01374444,0.02573552,0.006498588,0.07441619],"study_design_scores_gemma":[0.00002683196,0.00001810518,0.0001321936,0.00001987384,0.00001362427,0.00002482779,0.00003272177,0.987241,0.003382272,0.007561935,0.001535766,0.00001079855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06328029,0.0002847274,0.9191214,0.0004009778,0.0001466786,0.0004461923,0.001522534,0.008603788,0.006193437],"genre_scores_gemma":[0.4845076,0.0001945912,0.507596,0.000177136,0.00004093681,0.0004216885,0.002641686,0.002366425,0.002054015],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01645532,"threshold_uncertainty_score":0.03271908,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4321242097","doi":"10.1007/s10766-023-00752-x","title":"Guest Editor’s Note: High-Level Parallel Programming 2021","year":2023,"lang":"en","type":"editorial","venue":"International Journal of Parallel Programming","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Università di Pisa; Universidade do Porto; Université d'Orléans; Centre National de la Recherche Scientifique; Linköpings Universitet; University of Edinburgh; Queen's University; Uppsala Universitet; Universiteit van Amsterdam; Queen's University Belfast; Mississippi State University","keywords":"Computer science; Theory of computation; Programming language; Parallel computing","authors":[{"name":"Virginia Niculescu","is_ca":false},{"name":"Frédéric Loulergue","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0203141364912243,"gpt":0.3145708928238076,"spread":0.2942567563325832,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006528264,0.003172386,0.003840443,0.003172626,0.003396939,0.01012755,0.003694323,0.01657402,0.01396239],"category_scores_gemma":[0.03106952,0.001228144,0.003336087,0.001953277,0.002368517,0.003320641,0.001575891,0.02749529,0.01155846],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002503056,"about_ca_system_score_gemma":0.003152519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001421032,"about_ca_topic_score_gemma":0.004192689,"domain_scores_codex":[0.9941365,0.0007905216,0.0007662235,0.0007332108,0.003166385,0.0004072543],"domain_scores_gemma":[0.9729546,0.008823379,0.001550905,0.0008124134,0.01231023,0.003548476],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000316896,0.00001083757,0.00003209004,0.0001289567,0.00002196257,0.0001461017,0.000007066362,0.00006014444,0.00005013873,0.0003235294,0.9955467,0.003640674],"study_design_scores_gemma":[0.00007241302,0.00003265302,0.0003729051,0.0003710017,0.00008294352,0.0004431235,0.00003619275,0.0007258027,0.0002368865,0.001860599,0.9957344,0.00003114395],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.00003205875,0.001581755,0.0002986619,0.03048961,0.9663676,0.00001077655,0.00003131608,0.00005514157,0.001133124],"genre_scores_gemma":[0.0005769965,0.001741603,0.0002688697,0.02022474,0.9692751,0.00002030963,0.00002449893,0.00008110127,0.007786739],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.01657402,"threshold_uncertainty_score":0.04670882,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964240473","doi":"10.1007/s10766-013-0297-y","title":"Guest Editorial for High-level Parallel Programming and Applications","year":2013,"lang":"en","type":"editorial","venue":"International Journal of Parallel Programming","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kelowna General Hospital; Okanagan College","funders":"","keywords":"Computer science; Compiler; Programming paradigm; Scalability; Parallel computing; Parallel programming model; Programming language; Von Neumann architecture; Software; Multi-core processor; Turing; Parallelism (grammar); Operating system","authors":[{"name":"Gaétan Hains","is_ca":false},{"name":"Youry Khmelevsky","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01806667507047626,"gpt":0.2923874024849767,"spread":0.2743207274145005,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005189331,0.003282108,0.003822094,0.0038249,0.002809707,0.007853102,0.002756062,0.008672042,0.0208748],"category_scores_gemma":[0.018052,0.001188609,0.002872921,0.001530209,0.001835522,0.002764969,0.002092805,0.0148982,0.01514838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002034201,"about_ca_system_score_gemma":0.002539282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006486507,"about_ca_topic_score_gemma":0.00193055,"domain_scores_codex":[0.9956331,0.0006097438,0.0005237485,0.0005110055,0.002315734,0.0004066296],"domain_scores_gemma":[0.9811341,0.004478437,0.001329156,0.0005516802,0.008911313,0.003595377],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004632456,0.00001192432,0.00002392409,0.0001505806,0.00002361789,0.0001568948,0.000004922586,0.0000384017,0.00008451272,0.0002178584,0.9931526,0.006088286],"study_design_scores_gemma":[0.00008636047,0.00003958722,0.0003125966,0.0002619783,0.00008553483,0.0004903199,0.00002089192,0.0003746915,0.0002778511,0.001494372,0.9965326,0.00002329298],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.00003584761,0.00259975,0.0003004333,0.01301166,0.9828203,0.00001233668,0.00002488746,0.00007240236,0.001122403],"genre_scores_gemma":[0.0005190296,0.002615392,0.0002586187,0.007016338,0.9771313,0.00002026097,0.00003462293,0.0001005372,0.01230395],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.0208748,"threshold_uncertainty_score":0.06983316,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}