{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":22,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":22,"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":"0cbaf240d14f","filters":{"venue":"International Journal of High Performance Computing and Networking"}},"results":[{"id":"W2143374468","doi":"10.1504/ijhpcn.2006.013483","title":"Solving the Dynamic Plant Layout Problem using a new hybrid meta-heuristic algorithm","year":2006,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Mathematical optimization; Heuristic; Computer science; Quadratic assignment problem; Meta heuristic; Remainder; Quadratic equation; Algorithm; Optimization problem; Mathematics; Arithmetic","authors":[{"name":"José M. Rodrı́guez","is_ca":true},{"name":"F. Chris MacPhee","is_ca":true},{"name":"David J. Bonham","is_ca":true},{"name":"Virendrakumar C. Bhavsar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01254569396171001,"gpt":0.2259239866208807,"spread":0.2133782926591707,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004243932,0.0007728603,0.0007489909,0.0009295213,0.0003810835,0.0008930818,0.001404039,0.001208721,0.003086803],"category_scores_gemma":[0.0008271206,0.0005646098,0.001034175,0.001037204,0.0003000612,0.0009202141,0.0006968434,0.0007892245,0.0005130862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006511177,"about_ca_system_score_gemma":0.0009434929,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00361375,"about_ca_topic_score_gemma":0.005034238,"domain_scores_codex":[0.9997085,0.00007599775,0.00001470222,0.00006635111,0.00009287264,0.00004161987],"domain_scores_gemma":[0.9996624,0.0001793199,0.00003500187,0.00004448684,0.00005605105,0.0000227941],"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.00007717928,0.000141061,0.0004666493,0.00009631019,0.00009432901,0.0001036971,0.00005215124,0.8880486,0.004152419,0.006565674,0.002351211,0.09785058],"study_design_scores_gemma":[0.00003185028,0.00003538078,0.00007151451,0.000005361251,0.00001448337,0.00003310213,0.000009347636,0.9960218,0.000518834,0.001538815,0.00171319,0.000006296773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03422,0.0004066017,0.9539981,0.0002199805,0.00009637965,0.0001105096,0.0001558409,0.001069636,0.009722875],"genre_scores_gemma":[0.2013208,0.0002409833,0.7926614,0.0001520603,0.00005870352,0.0003775695,0.0004462993,0.0001243121,0.004617855],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00361375,"threshold_uncertainty_score":0.01032639,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2063877455","doi":"10.1504/ijhpcn.2006.013487","title":"A parallel quasi-Monte Carlo approach to pricing multidimensional American options","year":2006,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Actua; University of Waterloo","funders":"","keywords":"Computer science; Speedup; Scalability; Monte Carlo method; Parallel computing; Monte Carlo methods for option pricing; Recursion (computer science); Parallel algorithm; Mathematical optimization; Quasi-Monte Carlo method; Markov chain Monte Carlo; Algorithm; Hybrid Monte Carlo; Mathematics; Artificial intelligence","authors":[{"name":"Justin W. L. Wan","is_ca":true},{"name":"Kevin A. Lai","is_ca":true},{"name":"Adam W. Kolkiewicz","is_ca":true},{"name":"Ken Seng Tan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02553075317867747,"gpt":0.2953977628151206,"spread":0.2698670096364432,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000836431,0.0003907461,0.0005619603,0.0004476684,0.0006567226,0.0006793601,0.001197887,0.0007707973,0.003531949],"category_scores_gemma":[0.002294085,0.0003197637,0.0007254197,0.000653198,0.0008620282,0.001074573,0.0007300646,0.001135056,0.0006203567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006805949,"about_ca_system_score_gemma":0.001254668,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004083524,"about_ca_topic_score_gemma":0.00418171,"domain_scores_codex":[0.9995149,0.0001827919,0.00001565654,0.00003904526,0.0002150734,0.00003258756],"domain_scores_gemma":[0.9991301,0.0004195872,0.00006183761,0.0001552759,0.0001835837,0.0000497618],"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.00004678642,0.00006713572,0.0006025723,0.00005724729,0.00003696314,0.000095228,0.00005974,0.7701063,0.00275952,0.1932959,0.001746934,0.0311257],"study_design_scores_gemma":[0.0000102196,0.000008156237,0.00004350658,0.000002094431,0.000002649135,0.00001322167,0.000003255506,0.9823118,0.0002933597,0.01579966,0.001508419,0.000003693446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005162207,0.00009166476,0.9913935,0.0002046265,0.00006502411,0.00002755103,0.00002416772,0.0001777669,0.002853577],"genre_scores_gemma":[0.1995668,0.0004215,0.79278,0.0002035401,0.0001710219,0.0002708125,0.0001126759,0.0002136099,0.006259983],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004083524,"threshold_uncertainty_score":0.01181561,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2102000944","doi":"10.1504/ijhpcn.2006.010202","title":"A protocol independent energy saving technique for mobile ad hoc networks","year":2006,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Mobile ad hoc network; Routing protocol; Node (physics); Protocol (science); Distributed computing; Optimized Link State Routing Protocol; Wireless ad hoc network; Energy (signal processing); Routing (electronic design automation); Telecommunications; Wireless","authors":[{"name":"Yasser Gadallah","is_ca":true},{"name":"Thomas Kunz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008696791933068668,"gpt":0.2612928837494678,"spread":0.2525960918163991,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003649877,0.000712277,0.0004239371,0.0007338095,0.000633209,0.0006178365,0.001694261,0.0004824253,0.003480575],"category_scores_gemma":[0.001043002,0.00024004,0.0006088402,0.0007141907,0.0005033771,0.002053537,0.001377429,0.001162525,0.001483467],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002193667,"about_ca_system_score_gemma":0.0003213664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001548924,"about_ca_topic_score_gemma":0.0003341674,"domain_scores_codex":[0.9996025,0.00006186084,0.00002033753,0.0000663899,0.0002110921,0.00003791599],"domain_scores_gemma":[0.9996142,0.0001170019,0.00003994022,0.0001429407,0.0000677162,0.00001813799],"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.0002755957,0.0002653453,0.0007270437,0.0008716341,0.0001674179,0.0004438979,0.0002850697,0.02393275,0.1211797,0.06643797,0.01010952,0.7753041],"study_design_scores_gemma":[0.0001618567,0.002248092,0.002308768,0.000356305,0.000465723,0.005529797,0.0004308379,0.2586287,0.212877,0.06308198,0.4537393,0.000171639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02134669,0.008394222,0.9290433,0.0006240219,0.001378227,0.0003525421,0.0001181953,0.0022385,0.03650431],"genre_scores_gemma":[0.5114439,0.007930468,0.4246521,0.001351068,0.0008413715,0.0005203644,0.0004605203,0.0004182234,0.05238201],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003480575,"threshold_uncertainty_score":0.01164371,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2888279336","doi":"10.1504/ijhpcn.2019.097051","title":"Performance evaluation of OpenMP's target construct on GPUs - exploring compiler optimisations","year":2018,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Compiler; CUDA; Parallel computing; Fortran; Programming language; Programming paradigm; Implementation; Construct (python library); Set (abstract data type); IBM; Supercomputer","authors":[{"name":"Akihiro Hayashi","is_ca":false},{"name":"Jun Shirako","is_ca":false},{"name":"Etorre Tiotto","is_ca":true},{"name":"Robert Ho","is_ca":true},{"name":"Vivek Sarkar","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06125931175195404,"gpt":0.3097343786552617,"spread":0.2484750669033077,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001434772,0.001067533,0.0008785964,0.0009290746,0.0007878075,0.001284356,0.002437624,0.0009937698,0.002246557],"category_scores_gemma":[0.005575276,0.0004703841,0.0005549713,0.002027643,0.0007376985,0.001268407,0.000926602,0.0009568111,0.0006572194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001324726,"about_ca_system_score_gemma":0.00124763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008981158,"about_ca_topic_score_gemma":0.005539387,"domain_scores_codex":[0.9983108,0.0004327998,0.0001174328,0.0002684492,0.0006018907,0.0002685493],"domain_scores_gemma":[0.9960607,0.001410388,0.0001657975,0.0007005792,0.001442808,0.000219777],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.007129985,0.001318601,0.02563903,0.001958996,0.0005014375,0.001139839,0.00140893,0.5663803,0.1252487,0.01321625,0.03818417,0.2178738],"study_design_scores_gemma":[0.0002948147,0.0009309601,0.00743825,0.00008224419,0.00007850932,0.0001570208,0.0002166401,0.8773196,0.1023838,0.001651326,0.009387992,0.00005879941],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9535489,0.001322829,0.01761147,0.0002209683,0.0001849481,0.00008426088,0.0009183806,0.01173393,0.01437429],"genre_scores_gemma":[0.944616,0.0004052628,0.04740517,0.00009082462,0.00003148063,0.0001037208,0.003009618,0.002192569,0.002145123],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008981158,"threshold_uncertainty_score":0.01785779,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W321534596","doi":"10.1504/ijhpcn.2006.013481","title":"Adaptive time/space sharing with SCOJO","year":2006,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Computer multitasking; Distributed computing; Scheduling (production processes); Job scheduler; Flexibility (engineering); Shared resource; Time-sharing; Fragmentation (computing); Response time; Load sharing; Job shop scheduling; Parallel computing; Mathematical optimization; Operating system","authors":[{"name":"Angela C. Sodan","is_ca":true},{"name":"Xuemin Huang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008127605547879013,"gpt":0.2166094162329801,"spread":0.208481810685101,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006969237,0.0005102871,0.0005103757,0.000540718,0.0006262619,0.0009328231,0.001749565,0.0004630573,0.002103075],"category_scores_gemma":[0.001877666,0.0002107138,0.0004759975,0.0008837702,0.0008438452,0.001117908,0.0014709,0.0007580406,0.0004001788],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005570246,"about_ca_system_score_gemma":0.001320962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001996118,"about_ca_topic_score_gemma":0.002346263,"domain_scores_codex":[0.9994831,0.00009399217,0.00003224166,0.00009341686,0.000162544,0.0001346249],"domain_scores_gemma":[0.9983292,0.0003923895,0.000166858,0.0005939898,0.0002582329,0.0002593175],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00124664,0.0007046686,0.004434055,0.000224488,0.00009188644,0.0003043298,0.0003269397,0.7645756,0.05043724,0.03716147,0.005378894,0.1351137],"study_design_scores_gemma":[0.00005573823,0.00009126212,0.0002632794,0.000005756953,0.00002102771,0.00004705331,0.00003312203,0.9780892,0.008367271,0.009757203,0.003246398,0.00002276367],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2438224,0.0003551501,0.7369042,0.0003298459,0.0002646113,0.000259286,0.0001668807,0.003956628,0.01394102],"genre_scores_gemma":[0.9004812,0.00010615,0.09627108,0.0001340026,0.00004967274,0.0001113238,0.0001109013,0.0003077588,0.002427905],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002103075,"threshold_uncertainty_score":0.007035434,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068518386","doi":"10.1504/ijhpcn.2010.037791","title":"A novel technique of recognising multi-stage attack behaviour","year":2010,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Audit; Computer security; Feature (linguistics); Data mining; Attack model","authors":[{"name":"Wang Li","is_ca":true},{"name":"Yao Li","is_ca":true},{"name":"Zhi tang Li","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03453044453066623,"gpt":0.3034008261695685,"spread":0.2688703816389023,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005792527,0.0007810991,0.0005455841,0.002866845,0.0003802445,0.0007193701,0.0008414328,0.0007088603,0.001477303],"category_scores_gemma":[0.002270869,0.0003685557,0.0007986805,0.001633014,0.0004533099,0.001365267,0.0008592157,0.0009355944,0.001032625],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002588668,"about_ca_system_score_gemma":0.000637793,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00107233,"about_ca_topic_score_gemma":0.001848161,"domain_scores_codex":[0.9991223,0.0001108411,0.00006171495,0.0002518862,0.0003626646,0.00009064237],"domain_scores_gemma":[0.9985369,0.0004638006,0.0002401644,0.0002536349,0.0004043956,0.0001010827],"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.0002768683,0.0001838669,0.01036718,0.0002653304,0.0001401881,0.0005869153,0.0005301749,0.01966906,0.1774544,0.009981623,0.002912506,0.7776319],"study_design_scores_gemma":[0.00003272085,0.0006921595,0.02359494,0.00006485807,0.0001538569,0.003982133,0.0003196121,0.8380861,0.1013997,0.01173953,0.01975328,0.0001810753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01653122,0.00009486273,0.9811307,0.00005390084,0.00004832843,0.00007368658,0.00007976078,0.001113629,0.000873891],"genre_scores_gemma":[0.2237101,0.0002224996,0.773179,0.00007147033,0.00006135446,0.0001107568,0.0002653324,0.0001174609,0.002261921],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002866845,"threshold_uncertainty_score":0.00494206,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2165358822","doi":"10.1504/ijhpcn.2011.038704","title":"Grid resources valuation with fuzzy real option","year":2011,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Grid; Valuation (finance); Fuzzy logic; Quality of service; Grid computing; Operations research; Mathematical optimization; Finance; Computer network; Economics; Artificial intelligence","authors":[{"name":"David Allenotor","is_ca":true},{"name":"Ruppa K. Thulasiram","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03691834865257854,"gpt":0.230033555095796,"spread":0.1931152064432174,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002298934,0.001108025,0.001216106,0.0008894247,0.0006988351,0.003152594,0.001585201,0.002524632,0.003901249],"category_scores_gemma":[0.004541854,0.0006042298,0.001350325,0.001212205,0.001924599,0.003595377,0.001027664,0.002067376,0.0002331236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002700872,"about_ca_system_score_gemma":0.001376288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00770064,"about_ca_topic_score_gemma":0.00401148,"domain_scores_codex":[0.998841,0.0005693816,0.00004561431,0.0001621526,0.0002579155,0.000123994],"domain_scores_gemma":[0.9981951,0.001215183,0.0001888869,0.00007374913,0.0001720261,0.000155115],"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.00004528959,0.00004254198,0.000446823,0.00002899092,0.00002708872,0.0001778998,0.00005537572,0.8820295,0.0003105531,0.1133998,0.0003264036,0.003109766],"study_design_scores_gemma":[0.000008292175,0.00001071275,0.00004519947,0.000003469821,0.000004605459,0.0000146696,0.00001264331,0.9779769,0.00005109579,0.02164694,0.000219427,0.000006065007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07984883,0.0008331838,0.8992694,0.001349082,0.0001432151,0.00009968851,0.0001340241,0.0001077457,0.01821488],"genre_scores_gemma":[0.9433512,0.0004184468,0.04843239,0.000101458,0.00007941191,0.00009959079,0.00006883916,0.00002002199,0.007428665],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00770064,"threshold_uncertainty_score":0.01959622,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2035538419","doi":"10.1504/ijhpcn.2011.038708","title":"Leveraging many simple statistical models to adaptively monitor software systems","year":2011,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; System monitoring; Context (archaeology); Software; Component (thermodynamics); Continuous monitoring; Fault detection and isolation; Data mining; Reliability engineering; Simple (philosophy); Real-time computing; Artificial intelligence","authors":[{"name":"Mohammad A. Munawar","is_ca":true},{"name":"Paul A. S. Ward","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0422950986400276,"gpt":0.2618850722666185,"spread":0.2195899736265909,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003244373,0.001120571,0.0008592923,0.001257879,0.000431365,0.001562871,0.001414452,0.001229644,0.0005535798],"category_scores_gemma":[0.01740867,0.0007857655,0.000925112,0.0008764552,0.001206695,0.002940111,0.00122638,0.001490312,0.0002427394],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008051916,"about_ca_system_score_gemma":0.0008868014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003627651,"about_ca_topic_score_gemma":0.004901885,"domain_scores_codex":[0.9979165,0.0007545952,0.0001317119,0.0004447079,0.0006119494,0.0001405102],"domain_scores_gemma":[0.9892211,0.006715443,0.001622632,0.001695238,0.0005708186,0.0001746986],"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.00008044668,0.0001228281,0.01305551,0.00005060044,0.0001244596,0.0001188626,0.000100058,0.9361539,0.004998556,0.01017454,0.0003720621,0.03464822],"study_design_scores_gemma":[0.000004868518,0.00002843528,0.0006332452,0.000002114319,0.00001056799,0.00002947016,0.000004474315,0.9934493,0.0005167286,0.005195915,0.0001155017,0.000009321805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06986227,0.0002099672,0.9279943,0.0003417245,0.00003125054,0.00005391293,0.0000739927,0.0007957036,0.0006369084],"genre_scores_gemma":[0.897903,0.0003499409,0.1002951,0.0001460796,0.00009860705,0.0001306129,0.0001474876,0.00007966366,0.0008494281],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003627651,"threshold_uncertainty_score":0.01715809,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2293138419","doi":"10.1504/ijhpcn.2016.074656","title":"OCReM: OpenStack-based cloud datacentre resource monitoring and management scheme","year":2016,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Tech University","funders":"","keywords":"Cloud computing; Computer science; Operating system; Virtual machine; Resource (disambiguation); Resource management (computing); Task (project management); Scheme (mathematics); Interface (matter); Open source; Distributed computing; Software; Database; Computer network; Systems engineering; Engineering","authors":[{"name":"Zhihui Lu","is_ca":false},{"name":"Jie Wu","is_ca":false},{"name":"Jie Bao","is_ca":false},{"name":"Patrick C. K. Hung","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01449026102868657,"gpt":0.2480292480325546,"spread":0.233538987003868,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001259599,0.0006467353,0.0005859483,0.001074294,0.0008284833,0.001524208,0.002825023,0.0007138824,0.005737026],"category_scores_gemma":[0.002430263,0.0003032294,0.0004088483,0.001114946,0.0006896448,0.002376565,0.002202959,0.0009614465,0.001420764],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001644085,"about_ca_system_score_gemma":0.001440677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003571233,"about_ca_topic_score_gemma":0.002172698,"domain_scores_codex":[0.9981615,0.0002335617,0.0001729191,0.0004181354,0.0006453774,0.0003684657],"domain_scores_gemma":[0.9977092,0.0001674581,0.0002522905,0.001094709,0.0004612649,0.0003151942],"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.004866751,0.001501071,0.01583949,0.0009133539,0.0003079521,0.001446433,0.00131531,0.09696905,0.1722609,0.06131499,0.1549711,0.4882936],"study_design_scores_gemma":[0.0003877089,0.0005474681,0.009774111,0.00006350262,0.000083479,0.0009430127,0.0001602301,0.7738695,0.08640416,0.009750646,0.1177922,0.0002239272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2720647,0.001159186,0.4604853,0.001209132,0.0007091734,0.001850534,0.00281278,0.1930987,0.06661056],"genre_scores_gemma":[0.9292943,0.0001647291,0.05566295,0.0004574142,0.0001072745,0.0003343103,0.002449985,0.001793935,0.00973522],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005737026,"threshold_uncertainty_score":0.01919228,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973814258","doi":"10.1504/ijhpcn.2006.013490","title":"Real-time minimum vertex cover for two-terminal series-parallel graphs","year":2006,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"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":"Computer science; Vertex cover; Vertex (graph theory); Cardinality (data modeling); Terminal (telecommunication); Algorithm; Edge cover; Parallel algorithm; Series and parallel circuits; Series (stratigraphy); Graph; Time complexity; Theoretical computer science","authors":[{"name":"Marius Nagy","is_ca":true},{"name":"Selim G. Akl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009274216943470406,"gpt":0.2574695263585593,"spread":0.2481953094150889,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001089872,0.0004904054,0.0007994769,0.0007404161,0.000691215,0.0007754475,0.00110574,0.0006882417,0.002233011],"category_scores_gemma":[0.003626555,0.000301954,0.0006767365,0.0008035881,0.001154167,0.001910396,0.00123087,0.001040233,0.000217277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009994459,"about_ca_system_score_gemma":0.0007914493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001485388,"about_ca_topic_score_gemma":0.00183509,"domain_scores_codex":[0.9994875,0.0001210266,0.00002053217,0.0001038841,0.0001893926,0.00007755184],"domain_scores_gemma":[0.9983863,0.0009864096,0.0002047649,0.0001826781,0.0001481553,0.00009173508],"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.0003816749,0.00008501006,0.00098359,0.0001668738,0.00003349832,0.0002298001,0.0001582488,0.8787772,0.01323973,0.05975763,0.001307926,0.0448787],"study_design_scores_gemma":[0.0000186397,0.00002845081,0.00009749633,0.000003905622,0.000003021193,0.00005308898,0.00002223711,0.9662017,0.002799365,0.03030107,0.0004669813,0.000004110777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.172446,0.0001221798,0.8237919,0.0002828215,0.00003318439,0.00006973882,0.00007363949,0.0002719896,0.002908594],"genre_scores_gemma":[0.6145477,0.0001577922,0.3819288,0.00006425495,0.00004441672,0.0001698533,0.0002595742,0.0001547234,0.002672968],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002233011,"threshold_uncertainty_score":0.007470131,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W230790256","doi":"10.1504/ijhpcn.2006.013476","title":"Performance evaluation of the Sun Fire Link SMP clusters","year":2006,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Interconnection; Latency (audio); Link (geometry); Node (physics); Bandwidth (computing); Software; Remote direct memory access; Cluster (spacecraft); Computer network; Computer architecture; Operating system; Engineering; Telecommunications","authors":[{"name":"Ying Qian","is_ca":true},{"name":"Ahmad Afsahi","is_ca":true},{"name":"Nathan R. Fredrickson","is_ca":true},{"name":"Reza Zamani","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01739200277958856,"gpt":0.2529183118943525,"spread":0.235526309114764,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001292777,0.0004851487,0.0005964496,0.0006775974,0.001029906,0.0007840758,0.001225591,0.0004472528,0.003897565],"category_scores_gemma":[0.002464418,0.0002438517,0.0002449319,0.00152994,0.0003432485,0.0008819838,0.0007649984,0.0004490448,0.0006988355],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001528674,"about_ca_system_score_gemma":0.0006993015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006297322,"about_ca_topic_score_gemma":0.004780321,"domain_scores_codex":[0.9989564,0.0001858876,0.00003014506,0.0001733754,0.0004994076,0.0001547623],"domain_scores_gemma":[0.9986115,0.0003125755,0.0001057187,0.0001856444,0.0005658036,0.0002187826],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.006673309,0.00119154,0.04257245,0.0007490492,0.0003844818,0.00119289,0.0009230955,0.546233,0.07631073,0.00861614,0.07324036,0.2419129],"study_design_scores_gemma":[0.0003372934,0.002646609,0.03467615,0.00003123298,0.00009282576,0.0004070258,0.0005007457,0.8685176,0.07472049,0.001429733,0.01655622,0.00008399251],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.966289,0.0003517509,0.007428639,0.0002762497,0.00009118675,0.00006023777,0.0007199115,0.003314778,0.02146819],"genre_scores_gemma":[0.9872012,0.0001808034,0.007976165,0.00003966352,0.00002756022,0.00003692611,0.00152337,0.0002044633,0.002809848],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006297322,"threshold_uncertainty_score":0.01303869,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2044923352","doi":"10.1504/ijhpcn.2005.009424","title":"A security system implementation using software agents","year":2005,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Acadia University","funders":"","keywords":"Computer science; Guard (computer science); Implementation; Computer security; Architecture; Service (business); Encryption; Interface (matter); Operating system; Software engineering; Business","authors":[{"name":"Elhadi Shakshuki","is_ca":true},{"name":"Zhonghai Luo","is_ca":true},{"name":"Jing Gong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01663277146289238,"gpt":0.2880028915173296,"spread":0.2713701200544372,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001425392,0.0004445401,0.0004082478,0.0006326176,0.001194942,0.003116176,0.001326495,0.001116514,0.006845084],"category_scores_gemma":[0.002672693,0.0005088705,0.0006198136,0.000411992,0.0007493097,0.002347926,0.001729521,0.00150303,0.003377441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006263628,"about_ca_system_score_gemma":0.001791645,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00192686,"about_ca_topic_score_gemma":0.001460462,"domain_scores_codex":[0.9986066,0.0003742446,0.0001545187,0.0001502916,0.0005908352,0.0001235787],"domain_scores_gemma":[0.9988154,0.00024921,0.00007486618,0.0002887099,0.000454431,0.0001173703],"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.0005732719,0.0007731841,0.005370185,0.0007666669,0.0002556744,0.001238531,0.002758024,0.05895596,0.06163811,0.3571118,0.02888607,0.4816726],"study_design_scores_gemma":[0.0002261155,0.0005794005,0.001352576,0.0003288559,0.0002015294,0.0009661118,0.0003587532,0.4192787,0.05645996,0.0525571,0.4675641,0.0001268063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01810379,0.0002004849,0.9453464,0.0006255276,0.0002295815,0.0005415019,0.00006888292,0.009811516,0.02507231],"genre_scores_gemma":[0.2598505,0.0005808906,0.704255,0.0003247416,0.00008283064,0.000639611,0.0003766509,0.0007121608,0.03317752],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006845084,"threshold_uncertainty_score":0.02289909,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4253159728","doi":"10.1504/ijhpcn.2017.084246","title":"pvFPGA: paravirtualising an FPGA-based hardware accelerator towards general purpose computing","year":2017,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Field-programmable gate array; Pipeline (software); Embedded system; Hardware acceleration; FPGA prototype; Direct memory access; Context (archaeology); Computer hardware; Operating system; Transfer (computing)","authors":[{"name":"Wei Wang","is_ca":true},{"name":"Miodrag Bolić","is_ca":true},{"name":"Jonathan Parri","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03970748224866133,"gpt":0.3243428409415965,"spread":0.2846353586929352,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002078559,0.0003816952,0.0002048598,0.0002763523,0.0002490624,0.0006160347,0.001562181,0.0002714278,0.002502935],"category_scores_gemma":[0.0005133207,0.0002376697,0.0002132473,0.0001842987,0.0002650101,0.0006735133,0.0004885037,0.0006430167,0.000600934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003304597,"about_ca_system_score_gemma":0.0004573837,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008832975,"about_ca_topic_score_gemma":0.001127537,"domain_scores_codex":[0.9997837,0.00003643185,0.00001209569,0.00004702661,0.00007027703,0.0000505221],"domain_scores_gemma":[0.9997888,0.00003516054,0.00003155445,0.00006655539,0.0000456657,0.00003224082],"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.001571377,0.0002761583,0.007437327,0.000617927,0.0001542764,0.001095053,0.0004689014,0.04751697,0.4316778,0.02545027,0.01455806,0.4691758],"study_design_scores_gemma":[0.0001822893,0.002504545,0.005543355,0.0001068991,0.0001570709,0.002591143,0.0001205259,0.5271022,0.320884,0.006069026,0.1346083,0.0001306424],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1874088,0.001699296,0.785976,0.0002857255,0.0003188297,0.0002610024,0.0001015666,0.01200078,0.01194794],"genre_scores_gemma":[0.834143,0.0003836746,0.157877,0.0002668898,0.00005258666,0.0001020076,0.0001276694,0.0002831209,0.006763968],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002502935,"threshold_uncertainty_score":0.008373201,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2084175966","doi":"10.1504/ijhpcn.2011.038709","title":"A self-stabilising algorithm for 3-edge-connectivity","year":2011,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Asynchronous communication; Enhanced Data Rates for GSM Evolution; Computation; Spanning tree; Distributed algorithm; Algorithm; Fault tolerance; Self-stabilization; Distributed minimum spanning tree; Minimum spanning tree; Tree (set theory); Distributed computing; Parallel computing; Mathematics; Discrete mathematics; Combinatorics; Computer network","authors":[{"name":"Abusayeed Saifullah","is_ca":false},{"name":"Yung H. Tsin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01976199835953035,"gpt":0.2508301788918436,"spread":0.2310681805323132,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004981333,0.0004748158,0.0004398557,0.0008414132,0.00073005,0.0006347683,0.001316856,0.001010778,0.002772272],"category_scores_gemma":[0.00305244,0.0002498752,0.0004668487,0.0006841583,0.0008807507,0.001448356,0.00174225,0.0009482264,0.0007795061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00052414,"about_ca_system_score_gemma":0.00075394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001104731,"about_ca_topic_score_gemma":0.001259377,"domain_scores_codex":[0.9995363,0.0000901333,0.00003607937,0.0001201936,0.0001567856,0.00006049463],"domain_scores_gemma":[0.9989446,0.0003899257,0.0001280271,0.0002464088,0.0002266154,0.00006451146],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005253188,0.0001890317,0.001479473,0.0002436707,0.00006532726,0.0003377863,0.0006686726,0.266962,0.0667787,0.1418853,0.00731437,0.5135504],"study_design_scores_gemma":[0.00009593039,0.0002065818,0.0002923187,0.00002646684,0.00001954851,0.0002800965,0.00006450284,0.9024101,0.01555045,0.07397819,0.007036772,0.00003902045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0191854,0.0001072053,0.9770944,0.0001364715,0.00002945341,0.00007922309,0.00003431804,0.001108789,0.002224791],"genre_scores_gemma":[0.4020811,0.0001255963,0.5938416,0.0001386851,0.00003034712,0.0002168409,0.0001861724,0.000145663,0.003234038],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002772272,"threshold_uncertainty_score":0.009274185,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2615460309","doi":"10.1504/ijhpcn.2017.10005140","title":"pvFPGA: paravirtualising an FPGA-based hardware accelerator towards general purpose computing","year":2017,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Field-programmable gate array; Pipeline (software); Embedded system; Hardware acceleration; FPGA prototype; Direct memory access; Computer hardware; Context (archaeology); Operating system; Transfer (computing)","authors":[{"name":"Miodrag Bolić","is_ca":true},{"name":"Jonathan Parri","is_ca":true},{"name":"Wei Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03320092829098779,"gpt":0.3159443608018204,"spread":0.2827434325108326,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002079577,0.0003808311,0.0002073549,0.0002711663,0.0002487499,0.0006226224,0.001580019,0.000267765,0.002556997],"category_scores_gemma":[0.000505733,0.0002391299,0.0002175204,0.0001890898,0.0002682656,0.0006636692,0.0004911628,0.0006513874,0.000614113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000332016,"about_ca_system_score_gemma":0.0004615416,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009040875,"about_ca_topic_score_gemma":0.001145532,"domain_scores_codex":[0.9997866,0.00003604538,0.00001164746,0.00004653102,0.00006934298,0.00004979046],"domain_scores_gemma":[0.9997947,0.00003428142,0.00003013958,0.00006485468,0.00004410145,0.00003198755],"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.001598464,0.0002863506,0.007514983,0.0006187304,0.0001621689,0.001072781,0.0004598106,0.05368556,0.4173165,0.02643875,0.0155103,0.4753357],"study_design_scores_gemma":[0.0001815683,0.002371717,0.005242038,0.0001000449,0.0001491565,0.002340341,0.000113062,0.5640927,0.2901044,0.006232228,0.1289471,0.0001257463],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1804469,0.001621642,0.7932191,0.0002855794,0.0003137706,0.000251312,0.0001020184,0.01195438,0.01180529],"genre_scores_gemma":[0.8280453,0.0003751897,0.1640364,0.0002666582,0.0000526671,0.0001024379,0.0001322425,0.0002906842,0.006698351],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002556997,"threshold_uncertainty_score":0.008554041,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1986921363","doi":"10.1504/ijhpcn.2005.007863","title":"Optimal all-to-all personalised exchange in a novel optical multistage interconnection network","year":2005,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Computer science; Computer network; Gigabit; Node (physics); Interconnection; Low latency (capital markets); Bandwidth (computing); Multistage interconnection networks; Distributed computing; Latency (audio); Transmission (telecommunications); Telecommunications","authors":[{"name":"Siu Cheung Chau","is_ca":true},{"name":"Ada W. C. Fu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02346415298483754,"gpt":0.2765684088121497,"spread":0.2531042558273121,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002803064,0.000266971,0.0003627282,0.0002275913,0.0004098448,0.0004865449,0.0006860695,0.0004253415,0.001089154],"category_scores_gemma":[0.0004314859,0.0002379071,0.0002260241,0.0003708348,0.0003198439,0.001159145,0.0004551308,0.0002860315,0.000176668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006053399,"about_ca_system_score_gemma":0.000401149,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000857517,"about_ca_topic_score_gemma":0.002322446,"domain_scores_codex":[0.9997681,0.00005557747,0.00001286346,0.00005864102,0.00006623305,0.00003854813],"domain_scores_gemma":[0.9997854,0.00006100768,0.00005250346,0.00003605413,0.00004172887,0.00002326467],"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.0007852457,0.0002382408,0.001363428,0.0002524487,0.00007269649,0.0005771064,0.0002800134,0.7010912,0.1061734,0.05821655,0.005261531,0.1256881],"study_design_scores_gemma":[0.00003005341,0.0001645356,0.0002719935,0.000005953719,0.00001556279,0.000116922,0.00001875849,0.9833682,0.006251246,0.007528098,0.00221323,0.00001547546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3231367,0.000590109,0.6628653,0.0003663094,0.0000770231,0.00008388004,0.0001083752,0.0004209104,0.01235139],"genre_scores_gemma":[0.8815942,0.0002443041,0.1133395,0.00006334449,0.00002790073,0.00005122884,0.00007433067,0.00002081758,0.004584436],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001089154,"threshold_uncertainty_score":0.004392087,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W234760897","doi":"10.1504/ijhpcn.2006.013478","title":"Performance evaluation for neutron transport application using message passing","year":2006,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Nuclear reactor physics and engineering","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Solver; Computer science; Neutron transport; Message passing; Scalar (mathematics); Neutron; Iterative method; Software; Computational science; Parallel computing; Context (archaeology); Mathematical optimization; Distributed computing; Algorithm; Nuclear physics; Physics; Mathematics; Operating system; Geometry","authors":[{"name":"Mohamed Dahmani","is_ca":true},{"name":"Benoît Morin","is_ca":true},{"name":"Robert J. Le Roy","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01105582788439223,"gpt":0.2352849991125603,"spread":0.2242291712281681,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002903127,0.0009203513,0.0008021336,0.0008079007,0.0007807316,0.001172651,0.001211121,0.0008191227,0.002413371],"category_scores_gemma":[0.008493905,0.0002060671,0.0003376562,0.001656981,0.0004183811,0.001278972,0.000486315,0.0006035026,0.0006369159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008324053,"about_ca_system_score_gemma":0.0008677143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003745675,"about_ca_topic_score_gemma":0.001582155,"domain_scores_codex":[0.9978662,0.0007434792,0.0001059524,0.000164551,0.0008249324,0.0002948209],"domain_scores_gemma":[0.9948407,0.002792246,0.0002488462,0.0004738001,0.001470125,0.0001743687],"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.005146237,0.000667737,0.01267027,0.001477071,0.0003352887,0.0006792502,0.0008167728,0.605333,0.1088686,0.008589251,0.007250074,0.2481665],"study_design_scores_gemma":[0.00005575677,0.0005152093,0.002237589,0.00002114799,0.00007535779,0.0001232554,0.000134684,0.9199255,0.07258264,0.000894309,0.003403162,0.00003153101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7969579,0.00170086,0.1797059,0.0005179952,0.0002512302,0.0002240351,0.0003814239,0.01077151,0.009489209],"genre_scores_gemma":[0.9545909,0.0007076692,0.04042161,0.00003286175,0.00004540331,0.00009383421,0.0006105487,0.0005004363,0.002996703],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003745675,"threshold_uncertainty_score":0.01535344,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999537538","doi":"10.1504/ijhpcn.2006.013482","title":"Performance assessment of four cluster interconnects on identical hardware: hints for cluster builders","year":2006,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Myrinet; Computer science; Gigabit Ethernet; Cluster (spacecraft); Popularity; Gigabit; Ethernet; Computer cluster; Computer architecture; Embedded system; Computer network; Distributed computing; Telecommunications; Message passing","authors":[{"name":"Hossein Pourreza","is_ca":true},{"name":"Rasit Eskicioglu","is_ca":true},{"name":"Peter Graham","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01671953947951334,"gpt":0.278292704617197,"spread":0.2615731651376837,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001931712,0.0007548663,0.0005366402,0.001851148,0.0006601215,0.0009822909,0.00118579,0.0005163591,0.00177964],"category_scores_gemma":[0.01138518,0.0003900055,0.0003675022,0.001500794,0.0005176471,0.00198082,0.0008307224,0.0005397365,0.0003047542],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00104938,"about_ca_system_score_gemma":0.0005907906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001613249,"about_ca_topic_score_gemma":0.001347407,"domain_scores_codex":[0.9987271,0.0003698747,0.00006578457,0.0002116613,0.0004371434,0.0001883],"domain_scores_gemma":[0.9924412,0.003378131,0.0009211731,0.001260484,0.001651275,0.000347879],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.004533617,0.0007877648,0.110046,0.0005691096,0.0002022684,0.001384057,0.0008599733,0.4963666,0.223372,0.007041113,0.002420099,0.1524174],"study_design_scores_gemma":[0.00008814738,0.004036426,0.03845793,0.00004471337,0.0002417419,0.0005728707,0.0007006615,0.7811319,0.1691411,0.002975721,0.002498293,0.0001106331],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9849672,0.000215753,0.0122809,0.00007559505,0.00001443778,0.00002656477,0.0000553471,0.0004649246,0.001899391],"genre_scores_gemma":[0.9893599,0.00009147604,0.009643522,0.00001064261,0.000007449943,0.00001470543,0.0001338845,0.000117693,0.0006208019],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001931712,"threshold_uncertainty_score":0.010216,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4231214464","doi":"10.1504/ijhpcn.2019.097047","title":"Efficient implementation of OpenACC cache directive on NVIDIA GPUs","year":2018,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; CUDA; Parallel computing; Cache; Compiler; Smart Cache; Cache algorithms; Operating system; Cache pollution; CPU cache","authors":[{"name":"Ahmad Lashgar","is_ca":true},{"name":"Amirali Baniasadi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01486184162275694,"gpt":0.3065057005190688,"spread":0.2916438588963118,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008144556,0.0007425871,0.0005785884,0.0005187995,0.0007148515,0.001384323,0.002700082,0.0007568799,0.004731177],"category_scores_gemma":[0.003762631,0.0005003442,0.0005132728,0.0009728933,0.0005793397,0.00105656,0.0009401758,0.00120749,0.001974758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001554575,"about_ca_system_score_gemma":0.002583755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01284562,"about_ca_topic_score_gemma":0.01847448,"domain_scores_codex":[0.9990432,0.0001588631,0.00006973546,0.0001170129,0.0004543491,0.0001567983],"domain_scores_gemma":[0.9978638,0.0004221646,0.0001133564,0.0005721411,0.000896372,0.0001322179],"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.002471164,0.000675662,0.01667373,0.0007426224,0.0002652808,0.002029283,0.001818426,0.276409,0.1253023,0.05597156,0.1273381,0.3903029],"study_design_scores_gemma":[0.0001901211,0.0001827331,0.00320135,0.00006196529,0.00004171057,0.0002438904,0.0001288735,0.8783734,0.05281085,0.007663011,0.05701982,0.0000822506],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2752054,0.0008826526,0.576892,0.0007778458,0.0003503867,0.0002518708,0.001214765,0.09362575,0.05079936],"genre_scores_gemma":[0.596224,0.0002673724,0.3811922,0.0003410908,0.00004166198,0.0003797699,0.002601017,0.005751741,0.0132012],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01284562,"threshold_uncertainty_score":0.02554166,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2103988755","doi":"10.1504/ijhpcn.2005.008033","title":"Flyover: a technique for achieving high performance in CORBA-based systems with limited heterogeneity","year":2005,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Common Object Request Broker Architecture; Computer science; Middleware (distributed applications); Workload; Distributed computing; Operability; Exploit; Operating system; Software engineering","authors":[{"name":"Wai Keung Wu","is_ca":true},{"name":"Shikharesh Majumdar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0147683961793474,"gpt":0.2491589364692765,"spread":0.2343905402899291,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001684126,0.0005657363,0.0004816036,0.0006020964,0.001098264,0.0009487166,0.001461228,0.000859946,0.003242266],"category_scores_gemma":[0.003019825,0.0005125405,0.000470264,0.0006644628,0.00105024,0.002087901,0.001873762,0.001729973,0.0009432511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005202626,"about_ca_system_score_gemma":0.0007737424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002010822,"about_ca_topic_score_gemma":0.001820126,"domain_scores_codex":[0.9988223,0.0002200513,0.00007941705,0.0001540493,0.0005487474,0.0001754009],"domain_scores_gemma":[0.9982918,0.0003878054,0.0001643213,0.000818194,0.0002464897,0.00009135502],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0008598728,0.0003539821,0.002982474,0.0007281211,0.0001935571,0.001537221,0.002935112,0.04451518,0.4502139,0.07517752,0.01882228,0.4016808],"study_design_scores_gemma":[0.0004921459,0.0008240956,0.003757257,0.0001583978,0.0001389759,0.002520416,0.0005304521,0.3567562,0.3813366,0.07584533,0.1773478,0.0002923752],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01822128,0.00008535777,0.967557,0.0002375084,0.00004435995,0.0002052066,0.00004904078,0.01073696,0.002863213],"genre_scores_gemma":[0.3276868,0.0002288175,0.6624076,0.0003345071,0.00005393121,0.0004927911,0.0002766916,0.001712063,0.006806704],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003242266,"threshold_uncertainty_score":0.01084644,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W209015621","doi":"10.1504/ijhpcn.2006.013484","title":"MPI scalability of a large memory LES code","year":2006,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Fluid Dynamics and Turbulent Flows","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Scalability; Parallel computing; Turbulence; Computer science; Computational science; Code (set theory); Finite volume method; Grid; Large eddy simulation; Reynolds number; Jet (fluid); Flow (mathematics); Visualization; Detached eddy simulation; Mechanics; Reynolds-averaged Navier–Stokes equations; Physics; Operating system; Geometry; Mathematics","authors":[{"name":"Mesbah Uddin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005598487294784071,"gpt":0.2172723026352232,"spread":0.2116738153404391,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001117042,0.0006852337,0.0005358349,0.0007079445,0.0009593625,0.001232633,0.001754137,0.000572698,0.00600334],"category_scores_gemma":[0.003804588,0.0002468812,0.0004269522,0.001196159,0.0004390026,0.0008599357,0.0009506366,0.000877485,0.001271414],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006317858,"about_ca_system_score_gemma":0.00107843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005799876,"about_ca_topic_score_gemma":0.002337429,"domain_scores_codex":[0.9992848,0.000148425,0.00005078797,0.000071993,0.0003357391,0.0001083776],"domain_scores_gemma":[0.9978697,0.0008293475,0.00008789974,0.0003871567,0.0007091591,0.0001166361],"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.001376137,0.0006045441,0.01321807,0.0003051451,0.0001811289,0.0008921666,0.0004081315,0.7825701,0.05012947,0.02419263,0.02748829,0.0986342],"study_design_scores_gemma":[0.00008771665,0.00005985151,0.001754005,0.00001104843,0.00001432669,0.00004469869,0.00004243695,0.9742231,0.01800466,0.001610763,0.004127132,0.0000201556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6438206,0.0005714455,0.2076882,0.001189501,0.0003667053,0.0005180858,0.005566493,0.03883812,0.1014409],"genre_scores_gemma":[0.9028667,0.0001781129,0.08251181,0.00009690566,0.00007738078,0.0005148543,0.004825358,0.001700734,0.007228121],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00600334,"threshold_uncertainty_score":0.02008319,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2904066832","doi":"10.1504/ijhpcn.2019.10018085","title":"Efficient implementation of OpenACC cache directive on NVIDIA GPUs","year":2018,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; CUDA; Cache; Parallel computing; Compiler; Smart Cache; Cache algorithms; Operating system; Cache pollution; CPU cache","authors":[{"name":"Amirali Baniasadi","is_ca":true},{"name":"Ahmad Lashgar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01486184162275694,"gpt":0.3065057005190688,"spread":0.2916438588963118,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008144556,0.0007425871,0.0005785884,0.0005187995,0.0007148515,0.001384323,0.002700082,0.0007568799,0.004731177],"category_scores_gemma":[0.003762631,0.0005003442,0.0005132728,0.0009728933,0.0005793397,0.00105656,0.0009401758,0.00120749,0.001974758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001554575,"about_ca_system_score_gemma":0.002583755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01284562,"about_ca_topic_score_gemma":0.01847448,"domain_scores_codex":[0.9990432,0.0001588631,0.00006973546,0.0001170129,0.0004543491,0.0001567983],"domain_scores_gemma":[0.9978638,0.0004221646,0.0001133564,0.0005721411,0.000896372,0.0001322179],"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.002471164,0.000675662,0.01667373,0.0007426224,0.0002652808,0.002029283,0.001818426,0.276409,0.1253023,0.05597156,0.1273381,0.3903029],"study_design_scores_gemma":[0.0001901211,0.0001827331,0.00320135,0.00006196529,0.00004171057,0.0002438904,0.0001288735,0.8783734,0.05281085,0.007663011,0.05701982,0.0000822506],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2752054,0.0008826526,0.576892,0.0007778458,0.0003503867,0.0002518708,0.001214765,0.09362575,0.05079936],"genre_scores_gemma":[0.596224,0.0002673724,0.3811922,0.0003410908,0.00004166198,0.0003797699,0.002601017,0.005751741,0.0132012],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01284562,"threshold_uncertainty_score":0.02554166,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}