{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":17,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":17,"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":"0e3d1d99c5d6","filters":{"venue":"Parallel Computing"}},"results":[{"id":"W2044596392","doi":"10.1016/s0167-8191(01)00103-x","title":"A dynamic model and parallel tabu search heuristic for real-time ambulance relocation","year":2001,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":448,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Université de Montréal","funders":"","keywords":"Tabu search; Relocation; Heuristic; Computer science; Humanities; Operations research; Algorithm; Engineering; Artificial intelligence; Operating system","authors":[{"name":"Michel Gendreau","is_ca":true},{"name":"Gilbert Laporte","is_ca":true},{"name":"Frédéric Semet","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03028316466685818,"gpt":0.2720958466523946,"spread":0.2418126819855364,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008516841,0.0007571999,0.001782595,0.001150677,0.0008067575,0.001463963,0.002515227,0.001752215,0.006809692],"category_scores_gemma":[0.002391053,0.001095167,0.000820521,0.001831724,0.0007999006,0.001543937,0.0008256669,0.001155433,0.0006982198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002011844,"about_ca_system_score_gemma":0.002828674,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.03699258,"about_ca_topic_score_gemma":0.0212148,"domain_scores_codex":[0.9995146,0.0001775884,0.00001499467,0.00007821179,0.0001150116,0.00009958322],"domain_scores_gemma":[0.9992539,0.0004510319,0.00006351424,0.00003908017,0.0001464316,0.00004600371],"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.00001985969,0.00001479041,0.0000340843,0.00001108777,0.000005718951,0.000008075527,0.000005440931,0.994629,0.00005074576,0.001346905,0.0003190875,0.003555244],"study_design_scores_gemma":[0.000007956307,0.000006367601,0.00001304165,0.000001386493,0.000002202224,0.000002050397,0.00000261531,0.9991403,0.00002060867,0.0006970491,0.0001047287,0.000001660067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05640605,0.0007814112,0.9247028,0.0007172698,0.0002425792,0.0001913908,0.000368914,0.0008395148,0.01574997],"genre_scores_gemma":[0.7728342,0.0005166073,0.2167698,0.0001915965,0.00009085124,0.0004666194,0.0003713951,0.0002272658,0.008531588],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03699258,"threshold_uncertainty_score":0.07355452,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980816411","doi":"10.1016/j.parco.2010.10.004","title":"Scheduling of tasks in the parareal algorithm","year":2010,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":75,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"Atlantic Canada Opportunities Agency","keywords":"Computer science; Scheduling (production processes); Parallel computing; Algorithm; Scaling; Rate of convergence; Execution time; Convergence (economics); Domain decomposition methods; Distributed computing; Mathematical optimization; Mathematics","authors":[{"name":"Eric Aubanel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06867852865311079,"gpt":0.3808681107767238,"spread":0.312189582123613,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001208488,0.0003765022,0.0005854174,0.0003845946,0.0008589833,0.001164283,0.002424733,0.0005523912,0.01149206],"category_scores_gemma":[0.002977789,0.000349566,0.0003331225,0.0006275654,0.0007941974,0.001356173,0.00110007,0.0008819494,0.00172498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001088283,"about_ca_system_score_gemma":0.001978683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006026234,"about_ca_topic_score_gemma":0.01072095,"domain_scores_codex":[0.9992723,0.000265613,0.00002623226,0.0001140003,0.0001964223,0.0001254853],"domain_scores_gemma":[0.9989324,0.0004136284,0.00007234533,0.0002957941,0.0001792989,0.0001064047],"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.003223171,0.000307808,0.001449866,0.0003073295,0.00005630759,0.0001821897,0.0002513259,0.5513096,0.01379378,0.1987949,0.01379276,0.216531],"study_design_scores_gemma":[0.0002018447,0.0001178481,0.0001815373,0.000006337339,0.000009463413,0.00002712831,0.00003600005,0.9663921,0.002726973,0.02473835,0.005547686,0.00001477087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1090582,0.000471867,0.8634689,0.0008247404,0.0003136322,0.0001279636,0.0002220448,0.002213667,0.02329891],"genre_scores_gemma":[0.5431641,0.0002963821,0.4353589,0.0002064602,0.0001008186,0.0001840131,0.0003466031,0.0004894191,0.0198533],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01149206,"threshold_uncertainty_score":0.03844482,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2618636670","doi":"10.1016/j.parco.2017.05.003","title":"Proteus: Exploiting precision variability in deep neural networks","year":2017,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":23,"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; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Memory footprint; Inference; Convolutional neural network; Artificial neural network; Proteus; Efficient energy use; Floating point; Computer engineering; Real-time computing; Algorithm; Artificial intelligence","authors":[{"name":"Patrick Judd","is_ca":true},{"name":"Jorge Albericio","is_ca":true},{"name":"Tayler Hetherington","is_ca":true},{"name":"Tor M. Aamodt","is_ca":true},{"name":"Natalie Enright Jerger","is_ca":true},{"name":"Raquel Urtasun","is_ca":true},{"name":"Andreas Moshovos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02995690329559604,"gpt":0.3004231432261359,"spread":0.2704662399305399,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00158283,0.001102275,0.0008714188,0.0007841883,0.0005360073,0.001211244,0.002067271,0.000941433,0.003595531],"category_scores_gemma":[0.005365978,0.000772165,0.0006116833,0.0009903867,0.0006316295,0.002387444,0.001981676,0.001906466,0.0009912362],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007595967,"about_ca_system_score_gemma":0.001397347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004853653,"about_ca_topic_score_gemma":0.008671984,"domain_scores_codex":[0.9993786,0.0001611011,0.00002713546,0.0001415906,0.0002203762,0.00007118137],"domain_scores_gemma":[0.9988092,0.000539218,0.00007667605,0.0003295037,0.0001801558,0.00006526878],"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.001111738,0.0002984697,0.003457347,0.0002939188,0.0003334505,0.0001724676,0.000155594,0.4314687,0.01622213,0.03272056,0.0258889,0.4878767],"study_design_scores_gemma":[0.00003381399,0.00004457917,0.0001722292,0.000008091904,0.00001455009,0.00001443084,0.000007925046,0.9819676,0.003408981,0.01308923,0.001230139,0.000008361995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09607545,0.001347072,0.8671866,0.0006035143,0.0004647018,0.00008603714,0.000967367,0.02795463,0.005314589],"genre_scores_gemma":[0.6078084,0.0003874828,0.3819358,0.0003486695,0.0001713117,0.0001721998,0.001586755,0.002637075,0.004952356],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004853653,"threshold_uncertainty_score":0.01202828,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2019783787","doi":"10.1016/s0167-8191(03)00022-x","title":"The maximum flow problem: a real-time approach","year":2003,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":18,"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":"Flow (mathematics); Computer science; Mechanics; Physics","authors":[{"name":"Naya Nagy","is_ca":true},{"name":"Selim G. Akl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0190484485478017,"gpt":0.2464133393650204,"spread":0.2273648908172187,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003525482,0.002178987,0.002190082,0.001511978,0.0008750883,0.003384924,0.004040203,0.002869749,0.008518497],"category_scores_gemma":[0.009711384,0.001196929,0.001279816,0.002241676,0.001968263,0.006001507,0.001694729,0.003602448,0.0009525102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001317244,"about_ca_system_score_gemma":0.001308823,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002253678,"about_ca_topic_score_gemma":0.002223199,"domain_scores_codex":[0.9984576,0.0006465754,0.00005510525,0.0002986263,0.0003952231,0.000146935],"domain_scores_gemma":[0.9968061,0.002373963,0.0002285617,0.0001805669,0.0002797809,0.0001310645],"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.0002570028,0.0001328595,0.0002444786,0.0005176906,0.00007459326,0.0001418245,0.0001239963,0.6497263,0.001512665,0.2302904,0.009206596,0.1077716],"study_design_scores_gemma":[0.00003211255,0.00002438281,0.00004240915,0.00002119933,0.00001839818,0.0000456136,0.00002189923,0.9270799,0.0004019049,0.06870968,0.003591466,0.00001102273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002309819,0.0008359822,0.9917856,0.0005772702,0.0001602801,0.00004436605,0.00005396339,0.0001916161,0.004041168],"genre_scores_gemma":[0.1772907,0.002414746,0.8082588,0.0002546681,0.0008759289,0.0002948091,0.000223531,0.0004830986,0.009903747],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008518497,"threshold_uncertainty_score":0.02849716,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966773917","doi":"10.1016/j.parco.2005.02.008","title":"Interactive parallel visualization of large particle datasets","year":2005,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"McMaster University","keywords":"Rendering (computer graphics); Visualization; Computer science; Volume rendering; Interactive visualization; Computer graphics (images); Scientific visualization; Frame rate; Data visualization; Computational science; Data mining; Artificial intelligence","authors":[{"name":"Kevin Liang","is_ca":true},{"name":"Patricia Monger","is_ca":true},{"name":"H. M. P. Couchman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02303529292556327,"gpt":0.3434211950819711,"spread":0.3203859021564078,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007130543,0.001122344,0.001058756,0.001114667,0.0009795914,0.002439321,0.001299985,0.0008869028,0.02206384],"category_scores_gemma":[0.002297851,0.0006366661,0.0007768573,0.001403177,0.000507669,0.001303672,0.002714793,0.002189836,0.001262457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005794438,"about_ca_system_score_gemma":0.001022499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003454587,"about_ca_topic_score_gemma":0.006146624,"domain_scores_codex":[0.9997198,0.00005200692,0.00001451041,0.00002759213,0.0001501453,0.00003592924],"domain_scores_gemma":[0.9987073,0.0007038153,0.00004972557,0.0001912647,0.0001890835,0.0001588403],"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.003207501,0.0007819571,0.004015485,0.001470293,0.0006738102,0.002495679,0.001948807,0.2752282,0.1403813,0.05128456,0.1910454,0.327467],"study_design_scores_gemma":[0.0005203592,0.00007843126,0.002316187,0.00005303079,0.00006956343,0.0003979909,0.0001935885,0.9079638,0.02560144,0.03351987,0.02921602,0.00006975049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1457939,0.0008806884,0.772054,0.0033155,0.000648309,0.0003104918,0.004008126,0.04550326,0.02748557],"genre_scores_gemma":[0.4955699,0.001161145,0.4802585,0.0003897157,0.00026678,0.0003493757,0.003762184,0.006226514,0.01201584],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02206384,"threshold_uncertainty_score":0.07381094,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994064073","doi":"10.1016/j.parco.2006.08.007","title":"Quasi-atomic recovery for distributed agents","year":2006,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Correctness; Distributed computing; Asynchronous communication; Protocol (science); Overhead (engineering); Two-phase commit protocol; Simple (philosophy); Locality; Computer network; Algorithm; Operating system; Distributed transaction; Transaction processing; Database transaction; Programming language","authors":[{"name":"Hon F. Li","is_ca":true},{"name":"Zunce Wei","is_ca":true},{"name":"Dhrubajyoti Goswami","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01765791351258682,"gpt":0.2589437906140779,"spread":0.2412858771014911,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002151471,0.0003472066,0.0007209205,0.0004114835,0.001464913,0.001527895,0.002021833,0.001006749,0.00480054],"category_scores_gemma":[0.006190068,0.0004823952,0.000542424,0.0004698978,0.002038152,0.002626705,0.002657872,0.002419891,0.0006776633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007561726,"about_ca_system_score_gemma":0.001364324,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002125843,"about_ca_topic_score_gemma":0.002258133,"domain_scores_codex":[0.9990979,0.0002676413,0.0000465929,0.0001220107,0.0002953317,0.0001704496],"domain_scores_gemma":[0.9965472,0.001202076,0.0002225261,0.001323405,0.0004778875,0.0002269349],"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.0007926669,0.0001483286,0.0006806835,0.0001784221,0.00004795127,0.0002402899,0.0005376394,0.06810389,0.01067241,0.840547,0.006338654,0.07171211],"study_design_scores_gemma":[0.0001230037,0.0001049159,0.0002954376,0.0000140045,0.00003676227,0.00008828925,0.0001003717,0.5226378,0.003653638,0.4678107,0.005112098,0.0000229561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04229778,0.0003319054,0.9480565,0.0008125099,0.0002697996,0.00007218179,0.00003442121,0.0009568969,0.007167852],"genre_scores_gemma":[0.7856138,0.0002799706,0.1967836,0.0002770999,0.000170435,0.0001851052,0.0001207813,0.0002738445,0.01629521],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00480054,"threshold_uncertainty_score":0.01605934,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3033979988","doi":"10.1016/j.parco.2020.102663","title":"AIR: Iterative refinement acceleration using arbitrary dynamic precision","year":2020,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Queen's University; Queen's University Belfast; European Commission","keywords":"Iterative refinement; Computer science; Algorithm; Granularity; Iterative method; Acceleration; Double-precision floating-point format; Arbitrary-precision arithmetic; Floating point","authors":[{"name":"Junkyu Lee","is_ca":false},{"name":"Gregory D. Peterson","is_ca":false},{"name":"Dimitrios S. Nikolopoulos","is_ca":false},{"name":"Hans Vandierendonck","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05825726204588218,"gpt":0.3299951338883736,"spread":0.2717378718424915,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007630847,0.0012158,0.0008617357,0.0009916433,0.0006740399,0.001156176,0.002295322,0.0009249877,0.02334816],"category_scores_gemma":[0.003369998,0.0006280405,0.000773043,0.001256856,0.0007339322,0.00146206,0.002668132,0.002539465,0.007468829],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004647911,"about_ca_system_score_gemma":0.0009986669,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002729461,"about_ca_topic_score_gemma":0.00438076,"domain_scores_codex":[0.9991516,0.0001403474,0.00003835561,0.00008744766,0.0004986829,0.00008355534],"domain_scores_gemma":[0.9989661,0.0003173699,0.00004648738,0.0003109143,0.0002873741,0.00007185914],"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.001173119,0.000190496,0.001126886,0.0006911052,0.0001932032,0.0002670294,0.0004250617,0.1081555,0.02291907,0.1135475,0.07685387,0.6744572],"study_design_scores_gemma":[0.0002775452,0.0001469723,0.00039523,0.00009372167,0.0000577971,0.0002008226,0.0000559588,0.8687304,0.0252499,0.03109687,0.07363851,0.00005630645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004837715,0.0002856367,0.9662061,0.0001715422,0.0005223075,0.00007979257,0.0002798381,0.01466731,0.01294967],"genre_scores_gemma":[0.1067367,0.0003141173,0.8653861,0.0002553656,0.0001546646,0.0002342231,0.0009271202,0.005870786,0.02012089],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02334816,"threshold_uncertainty_score":0.07810736,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2011629644","doi":"10.1016/s0167-8191(02)00109-6","title":"Parallel codebook design for vector quantization on a message passing MIMD architecture","year":2002,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Advanced Data Compression Techniques","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":"Queen's University","funders":"Scheme for Promotion of Academic and Research Collaboration","keywords":"Codebook; MIMD; Vector quantization; Linde–Buzo–Gray algorithm; Computer science; Pipeline (software); Computation; Image compression; Quantization (signal processing); Parallel computing; Algorithm; Data compression; Computer engineering; Image (mathematics); Artificial intelligence; Image processing; Theoretical computer science","authors":[{"name":"Hazem M. Abbas","is_ca":false},{"name":"M.M. Bayoumi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05951995360818504,"gpt":0.2954016781205356,"spread":0.2358817245123505,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005099482,0.0003919545,0.0006080374,0.0005121847,0.0006026258,0.0008788225,0.001424581,0.0004477911,0.004788636],"category_scores_gemma":[0.00147414,0.000246565,0.000230618,0.00102216,0.0003463178,0.001079754,0.0007031675,0.0005369585,0.001145961],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008286672,"about_ca_system_score_gemma":0.001253669,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002692856,"about_ca_topic_score_gemma":0.005759526,"domain_scores_codex":[0.9996132,0.00007963151,0.00003220179,0.00005465103,0.0001749317,0.00004541899],"domain_scores_gemma":[0.9993765,0.0001356764,0.0000379824,0.0001407169,0.0002734461,0.00003569174],"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.001204813,0.0002100489,0.001335055,0.0003493057,0.000092872,0.0002028759,0.0001854515,0.172826,0.07658669,0.094247,0.02026479,0.632495],"study_design_scores_gemma":[0.00009643612,0.0001940313,0.0001987362,0.00001261513,0.00002190215,0.0000961962,0.00003552959,0.948074,0.02748766,0.01752388,0.006236549,0.00002258742],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01558437,0.0002657769,0.9800439,0.0001531759,0.00009941649,0.00007192451,0.0000925166,0.001370641,0.002318261],"genre_scores_gemma":[0.3811364,0.0002512785,0.6119761,0.0001569808,0.00008708904,0.0002702474,0.000341185,0.0001346081,0.005646009],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004788636,"threshold_uncertainty_score":0.01601958,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964212654","doi":"10.1016/j.parco.2015.03.009","title":"Scalable connectionless RDMA over unreliable datagrams","year":2015,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":7,"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":"Advanced Scientific Computing Research; National Science Foundation of Sri Lanka; Office of Science; Natural Sciences and Engineering Research Council of Canada; Savannah River Operations Office, U.S. Department of Energy; Ontario Innovation Trust; U.S. Department of Energy","keywords":"Remote direct memory access; InfiniBand; Datagram; Computer science; Connectionless communication; Scalability; Operating system; Computer network; The Internet; Network packet","authors":[{"name":"Ryan E. Grant","is_ca":true},{"name":"Mohammad Javad Rashti","is_ca":true},{"name":"Pavan Balaji","is_ca":false},{"name":"Ahmad Afsahi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04617615889508019,"gpt":0.291365737088616,"spread":0.2451895781935358,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002519498,0.001012761,0.001635369,0.001324851,0.00202413,0.002537502,0.003056077,0.001004983,0.003780548],"category_scores_gemma":[0.01076543,0.0006717431,0.0003703935,0.001691227,0.001038176,0.00353966,0.00314853,0.001583659,0.0007222394],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001419175,"about_ca_system_score_gemma":0.001794173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004002154,"about_ca_topic_score_gemma":0.004192749,"domain_scores_codex":[0.9976317,0.0004836703,0.0002056505,0.0003629974,0.0009362978,0.000379698],"domain_scores_gemma":[0.9894935,0.003574242,0.0006082961,0.004464586,0.001523733,0.0003356155],"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.005374317,0.0005319563,0.003873731,0.0007309449,0.0002787641,0.0009102761,0.0007627586,0.3097124,0.1288238,0.06179071,0.02152084,0.4656894],"study_design_scores_gemma":[0.0001096125,0.0001888418,0.0003546738,0.00002234422,0.00005883808,0.0001384944,0.00007667977,0.9617984,0.01673575,0.01685375,0.003624916,0.00003777939],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1790784,0.002292014,0.7985768,0.0007283959,0.0007645053,0.000306957,0.0003832658,0.01097232,0.0068974],"genre_scores_gemma":[0.9089826,0.0003129714,0.08530876,0.0001403302,0.0002634345,0.0001122533,0.0002316339,0.0002147878,0.004433262],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004002154,"threshold_uncertainty_score":0.01332456,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2971516936","doi":"10.1016/j.parco.2019.102547","title":"A dynamic, unified design for dedicated message matching engines for collective and point-to-point communications","year":2019,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"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; National Nuclear Security Administration; Government of Ontario; University of Toronto; Canada Foundation for Innovation; Ontario Research Foundation; U.S. Department of Energy","keywords":"Message queue; Computer science; Queue; Point-to-point; Message passing; Message Passing Interface; Scalability; Speedup; Computer network; Distributed computing; Matching (statistics); Priority queue; Queueing theory; Point (geometry); Parallel computing; Operating system","authors":[{"name":"S. Mahdieh Ghazimirsaeed","is_ca":true},{"name":"Ryan E. Grant","is_ca":false},{"name":"Ahmad Afsahi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02755589818956545,"gpt":0.2919306506323945,"spread":0.264374752442829,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001232367,0.0009472553,0.001188259,0.001273348,0.001182048,0.002897072,0.004974045,0.001073996,0.005412206],"category_scores_gemma":[0.002140663,0.0007457244,0.0007801013,0.0009682503,0.0006862833,0.002628815,0.001910157,0.001475355,0.002930907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001526589,"about_ca_system_score_gemma":0.002792362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002090457,"about_ca_topic_score_gemma":0.003342063,"domain_scores_codex":[0.9985672,0.000163417,0.0001259318,0.0003535025,0.000521689,0.0002681791],"domain_scores_gemma":[0.9984869,0.0002097723,0.0001540501,0.0004832865,0.0005559973,0.000110007],"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.001474173,0.0009351254,0.003155436,0.0008773467,0.0003951017,0.0003476912,0.0005193985,0.1671531,0.2057055,0.1214965,0.02795315,0.4699874],"study_design_scores_gemma":[0.0001303696,0.0006445932,0.0005478649,0.00006571405,0.0002584014,0.0002758006,0.0001143915,0.7885597,0.1498557,0.01893619,0.04050291,0.0001082405],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01812739,0.0005292419,0.9692762,0.0001571639,0.0001728262,0.0002606226,0.0001115116,0.006361722,0.00500324],"genre_scores_gemma":[0.4547162,0.0004596098,0.5314007,0.0003781116,0.0001430254,0.0005497173,0.0005646318,0.0008245252,0.01096345],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005412206,"threshold_uncertainty_score":0.01810557,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2043803280","doi":"10.1016/s0167-8191(03)00041-3","title":"Parallel computing in logistics","year":2003,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Intuitionistic Fuzzy Systems Applications","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":"HEC Montréal","funders":"","keywords":"Computer science; Representation (politics); Relevance (law); Space (punctuation); Theoretical computer science; Information exchange; Mechanism (biology); Complex system; Distributed computing; Artificial intelligence","authors":[{"name":"Gilbert Laporte","is_ca":true},{"name":"Roberto Musmanno","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.029854203686776,"gpt":0.2766728664270141,"spread":0.2468186627402381,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007742838,0.0005449121,0.0008462507,0.0005961859,0.001092666,0.003012584,0.0007288036,0.0008733673,0.007182841],"category_scores_gemma":[0.002143589,0.0003963275,0.0006535234,0.002315508,0.001425988,0.003367405,0.0009345484,0.001726975,0.001121581],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001694736,"about_ca_system_score_gemma":0.001435395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004092734,"about_ca_topic_score_gemma":0.002657458,"domain_scores_codex":[0.9994791,0.0001598321,0.00003167059,0.00009466631,0.0001696397,0.00006500509],"domain_scores_gemma":[0.9994342,0.0002094369,0.00003212842,0.0001438541,0.0001361134,0.00004422696],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001328527,0.00006277001,0.0003086633,0.0001692999,0.00004910738,0.000114728,0.0001241691,0.07975478,0.001052635,0.8181978,0.0162575,0.08377571],"study_design_scores_gemma":[0.00002115224,0.00001584925,0.0001882862,0.00002289844,0.00001952751,0.00006396318,0.00005143308,0.1359448,0.00068978,0.8351751,0.0277978,0.000009504469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0577745,0.03221465,0.7124137,0.01276902,0.003257953,0.0001265391,0.0002472018,0.0009409955,0.1802555],"genre_scores_gemma":[0.7845181,0.01468167,0.1380298,0.0007573973,0.001887784,0.0001335855,0.0003141021,0.0001794194,0.05949825],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007182841,"threshold_uncertainty_score":0.02402896,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4308487050","doi":"10.1016/j.parco.2022.102984","title":"Efficient parallel branch-and-bound approaches for exact graph edit distance problem","year":2022,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Graph Theory and Algorithms","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":"Université de Sherbrooke","funders":"Direction Générale de la Recherche Scientifique et du Développement Technologique","keywords":"Computer science; Speedup; Search tree; Pruning; Branch and bound; Theoretical computer science; Graph; Parallel computing; Algorithm; Search algorithm","authors":[{"name":"Adel Dabah","is_ca":false},{"name":"Ibrahim Chegrane","is_ca":true},{"name":"Saïd Yahiaoui","is_ca":false},{"name":"Ahcène Bendjoudi","is_ca":false},{"name":"Nadia Nouali‐Taboudjemat","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02693764481373495,"gpt":0.2351926344659796,"spread":0.2082549896522446,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002275577,0.002245014,0.002662168,0.001805508,0.001492871,0.002816617,0.003265942,0.001574991,0.007301641],"category_scores_gemma":[0.005927112,0.0007772134,0.001256595,0.002710945,0.0008909539,0.003538244,0.002774336,0.002318547,0.001451666],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00169626,"about_ca_system_score_gemma":0.003861676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006131713,"about_ca_topic_score_gemma":0.007897889,"domain_scores_codex":[0.9977109,0.0005686238,0.000123305,0.0005021398,0.000642931,0.0004520279],"domain_scores_gemma":[0.9962618,0.002312035,0.0002287202,0.0004862734,0.00043857,0.0002725302],"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.0007608481,0.0006019975,0.001037431,0.0005029705,0.0001558888,0.0002274871,0.000265795,0.629071,0.00547169,0.03280023,0.01284282,0.3162619],"study_design_scores_gemma":[0.00008554394,0.000061602,0.0001067892,0.000009259888,0.00002163597,0.00003838311,0.00004476114,0.9809132,0.0007185286,0.01669809,0.001295032,0.000007263306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04297417,0.002379293,0.938783,0.001071167,0.0002000341,0.0003892776,0.000309579,0.002915917,0.01097767],"genre_scores_gemma":[0.2685211,0.0007362809,0.7236525,0.0003375548,0.00017691,0.0006319877,0.001009352,0.0005952968,0.004338992],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007301641,"threshold_uncertainty_score":0.0244264,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4367397470","doi":"10.1016/j.parco.2023.103024","title":"A lightweight semi-centralized strategy for the massive parallelization of branching algorithms","year":2023,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Computer science; Programmer; Vertex cover; Bounded function; Algorithm; Branching (polymer chemistry); Parallel computing; Vertex (graph theory); Theoretical computer science; Graph; Approximation algorithm; Mathematics; Programming language","authors":[{"name":"Andres Pastrana-Cruz","is_ca":true},{"name":"Manuel Lafond","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05154537697838242,"gpt":0.3049463212381897,"spread":0.2534009442598072,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001779896,0.0009875073,0.0014612,0.001106961,0.001536073,0.002175864,0.003417651,0.0009034149,0.006993963],"category_scores_gemma":[0.006548,0.0006484195,0.0008327172,0.00161064,0.001443767,0.002679999,0.004385677,0.002341447,0.003319229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001237063,"about_ca_system_score_gemma":0.00342722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00205355,"about_ca_topic_score_gemma":0.004221062,"domain_scores_codex":[0.9975988,0.0006330782,0.0001313341,0.0004427797,0.0008720112,0.000321995],"domain_scores_gemma":[0.994953,0.001159975,0.0002586881,0.002478829,0.0007088065,0.0004406556],"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.002177108,0.000734798,0.001946583,0.0004591889,0.0001859397,0.0003482551,0.0005189442,0.1492002,0.09675451,0.2173272,0.03281387,0.4975334],"study_design_scores_gemma":[0.0001937793,0.0001589471,0.0003655302,0.00002161665,0.00004595426,0.0001070131,0.00005723902,0.8792204,0.0152391,0.09918648,0.005365611,0.00003832134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0124222,0.0001471807,0.979081,0.0002836119,0.00009502871,0.0001009869,0.00008494946,0.003620537,0.004164591],"genre_scores_gemma":[0.3617648,0.0001649858,0.6299503,0.0003077257,0.0002303111,0.0004568966,0.0004143639,0.0008990485,0.005811573],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006993963,"threshold_uncertainty_score":0.02339709,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029783178","doi":"10.1016/j.parco.2012.03.002","title":"Criticality guided energy aware speculation for speculative multithreaded processors","year":2012,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Parallel Computing and Optimization Techniques","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":"Advanced Micro Devices (Canada)","funders":"","keywords":"Criticality; Computer science; Thread (computing); Energy consumption; Speculative execution; Computation; Embedded system; Execution model; Architecture; Efficient energy use; Speculation; Parallel computing; Computer architecture; Distributed computing; Operating system; Engineering","authors":[{"name":"Rahul Nagpal","is_ca":false},{"name":"Anasua Bhowmik","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05511939389700363,"gpt":0.332821304914333,"spread":0.2777019110173294,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005686437,0.0004821998,0.0004062461,0.0004096741,0.0005595355,0.0007217643,0.0009418803,0.0003151111,0.001853475],"category_scores_gemma":[0.002354263,0.0003459581,0.0002372543,0.0003765467,0.0004449914,0.0009203663,0.0007114164,0.0006800853,0.0001581597],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005121891,"about_ca_system_score_gemma":0.00131633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001424261,"about_ca_topic_score_gemma":0.004735706,"domain_scores_codex":[0.9997297,0.00005651548,0.00001794541,0.00003548483,0.0001005295,0.00005966015],"domain_scores_gemma":[0.9988423,0.0004958931,0.0001071094,0.0002478796,0.0002492916,0.00005744868],"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.003482922,0.0004316964,0.01089528,0.0005052894,0.0001921262,0.0006401142,0.0008063773,0.4485109,0.1601799,0.0571726,0.01095293,0.30623],"study_design_scores_gemma":[0.00003978556,0.0001462812,0.0004732677,0.00001395368,0.00004036014,0.00004711536,0.0000646108,0.9598052,0.02135081,0.01641467,0.001589819,0.00001418791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4922711,0.003131083,0.491621,0.0009941355,0.0004259237,0.0001039827,0.0001665264,0.003160381,0.00812585],"genre_scores_gemma":[0.9597571,0.0001836961,0.03829601,0.00007821945,0.00003549634,0.00002577933,0.00005949573,0.0001013037,0.001463031],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001853475,"threshold_uncertainty_score":0.006200433,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4416746178","doi":"10.1016/j.parco.2025.103165","title":"Butterfly factorization for vision transformers on multi-IPU systems","year":2025,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Advanced Memory and Neural Computing","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Butterfly; Memory footprint; Transformer; Factorization; Computation","authors":[{"name":"S.‐Kazem Shekofteh","is_ca":true},{"name":"Daniel Bogacz","is_ca":true},{"name":"Christian Alles","is_ca":true},{"name":"Holger Fröning","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02213822854525998,"gpt":0.2953664193748585,"spread":0.2732281908295985,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002945713,0.0005826548,0.0004080151,0.0003865843,0.0003493901,0.0007315825,0.0009219017,0.0005371412,0.006463278],"category_scores_gemma":[0.001554693,0.0002713607,0.0004601412,0.0004631803,0.0004232805,0.001459762,0.0006346143,0.0008332914,0.00120307],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009646837,"about_ca_system_score_gemma":0.0009903399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00778245,"about_ca_topic_score_gemma":0.01135436,"domain_scores_codex":[0.9997928,0.00003514542,0.00001164565,0.00004456946,0.00007863839,0.00003725335],"domain_scores_gemma":[0.9996728,0.0001195993,0.00002465934,0.00008347497,0.00007454435,0.00002491949],"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.0005581754,0.0001265599,0.003063046,0.00027163,0.00007392391,0.0005687376,0.0002691596,0.5436905,0.03640322,0.05091356,0.01630553,0.3477559],"study_design_scores_gemma":[0.00001048961,0.00004004898,0.0002036621,0.000006958632,0.000004857677,0.00004338019,0.00003180671,0.9857449,0.005847408,0.005690284,0.002370964,0.000005303526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1433683,0.0005923475,0.8362958,0.0005381671,0.0001387478,0.00009624602,0.0003675341,0.005931061,0.01267168],"genre_scores_gemma":[0.6857207,0.0002611295,0.3076859,0.0002064602,0.00003000981,0.00009766365,0.0005547389,0.000277808,0.005165644],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00778245,"threshold_uncertainty_score":0.02162188,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4411297543","doi":"10.1016/j.parco.2025.103146","title":"Using Java to create and analyze models of parallel computing systems","year":2025,"lang":"en","type":"article","venue":"Parallel Computing","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Java; Parallel computing; Programming language; Distributed computing","authors":[{"name":"Harish Padmanaban","is_ca":false},{"name":"Nurkasym Arkabaev","is_ca":false},{"name":"Maher Ali Rusho","is_ca":true},{"name":"Vladyslav Kozub","is_ca":false},{"name":"Yurii Kozub","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0431495276323931,"gpt":0.3005110870569721,"spread":0.257361559424579,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002305589,0.001153941,0.0007997371,0.001287602,0.001070942,0.004808689,0.002611194,0.001041654,0.004292502],"category_scores_gemma":[0.00939208,0.001481387,0.002749615,0.0008694557,0.001121027,0.00513492,0.002003645,0.002710921,0.001225919],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001617984,"about_ca_system_score_gemma":0.002357454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006256722,"about_ca_topic_score_gemma":0.008384195,"domain_scores_codex":[0.998668,0.0003469674,0.0001454922,0.0002001291,0.0005130521,0.000126408],"domain_scores_gemma":[0.9960824,0.002296407,0.0002531437,0.0008236595,0.0004117757,0.0001326871],"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.0003474455,0.0005161276,0.01028172,0.0009159226,0.0004082049,0.0008794585,0.001566815,0.5092099,0.01268402,0.3045216,0.02061923,0.1380496],"study_design_scores_gemma":[0.00007471439,0.00002984097,0.0003617372,0.00006941098,0.00008056578,0.0001455413,0.0001046773,0.8689053,0.006311444,0.09884661,0.02502832,0.00004181659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008612902,0.00006313086,0.9737461,0.0002147792,0.00005987117,0.0001819886,0.0004744504,0.01372364,0.002923277],"genre_scores_gemma":[0.1230586,0.0002780045,0.8663055,0.0001566071,0.00003972397,0.0005456588,0.001910176,0.00499057,0.002715199],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006256722,"threshold_uncertainty_score":0.01435983,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030615194","doi":"10.1016/j.parco.2009.04.001","title":"A distributed Key Message algorithm to optimize the communication in clusters","year":2009,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Interconnection Networks and 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":"University of Lethbridge; University of Alberta","funders":"","keywords":"Computer science; Key (lock); Distributed computing; Message passing; Algorithm; Computer security","authors":[{"name":"Yang Wang","is_ca":true},{"name":"Ming Zhu","is_ca":false},{"name":"Hua Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01488383577701372,"gpt":0.2570849466904719,"spread":0.2422011109134582,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007095203,0.0007161133,0.001145905,0.0006758496,0.0009917855,0.0007403698,0.001487976,0.0009209513,0.003079939],"category_scores_gemma":[0.002593418,0.0003882095,0.000451489,0.001140475,0.000554365,0.001337497,0.001123645,0.0009512745,0.0007099257],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008896192,"about_ca_system_score_gemma":0.001534469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003256443,"about_ca_topic_score_gemma":0.003902836,"domain_scores_codex":[0.9995765,0.000124836,0.00002506748,0.00006311937,0.0001446661,0.00006582752],"domain_scores_gemma":[0.9993979,0.0002711983,0.0000390297,0.000105517,0.0001499683,0.00003633572],"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.000627341,0.0001614678,0.0005627961,0.0001432627,0.00007957262,0.00007439291,0.0001408775,0.6554799,0.01053555,0.03830596,0.0131573,0.2807316],"study_design_scores_gemma":[0.00008133499,0.00005306973,0.00008306702,0.000004023082,0.00001376892,0.00001601935,0.0000155569,0.984284,0.001875849,0.0119847,0.001579535,0.000008973958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01562341,0.0002958212,0.9800385,0.0002399275,0.0001361134,0.0000748676,0.00005965199,0.001108384,0.002423296],"genre_scores_gemma":[0.3068133,0.0002262095,0.6865914,0.0001447654,0.000116702,0.0003137967,0.0002363479,0.0003900061,0.005167394],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003256443,"threshold_uncertainty_score":0.01030344,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}