{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":3,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":3,"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":"3096a4af1768","filters":{"venue":"2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS)"}},"results":[{"id":"W4285504014","doi":"10.1109/ipdps53621.2022.00055","title":"Co-Designing an OpenMP GPU Runtime and Optimizations for Near-Zero Overhead Execution","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":16,"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":"Lawrence Livermore National Laboratory","keywords":"Computer science; Software portability; Compiler; CUDA; Parallel computing; Runtime system; Overhead (engineering); Programming paradigm; Operating system; Programming language","authors":[{"name":"Johannes Doerfert","is_ca":false},{"name":"Atmn Patel","is_ca":true},{"name":"Joseph Huber","is_ca":false},{"name":"Shilei Tian","is_ca":false},{"name":"Jose M. Monsalve Diaz","is_ca":false},{"name":"Barbara Chapman","is_ca":false},{"name":"Giorgis Georgakoudis","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02112686276357748,"gpt":0.2952386818613041,"spread":0.2741118190977266,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007604634,0.0008631579,0.0004430398,0.0004206091,0.0004345518,0.001138819,0.002276148,0.0005644724,0.001608404],"category_scores_gemma":[0.003247068,0.0006799016,0.0005612152,0.0004595461,0.0006766701,0.001560643,0.001363626,0.001978729,0.001123116],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005602028,"about_ca_system_score_gemma":0.001391124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009887674,"about_ca_topic_score_gemma":0.002309951,"domain_scores_codex":[0.9986449,0.0002336307,0.0001088173,0.0002339119,0.0005816408,0.000197056],"domain_scores_gemma":[0.9983479,0.0002843529,0.0001561469,0.0006822143,0.0004553377,0.00007406394],"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.0009741568,0.0008424758,0.01076382,0.0006775696,0.0002683068,0.0007388673,0.0008408763,0.1867229,0.3676743,0.0277707,0.01278627,0.3899397],"study_design_scores_gemma":[0.00009302178,0.0003939153,0.002867673,0.00005155359,0.0001094437,0.0003656514,0.0001137841,0.6729926,0.2825728,0.008405012,0.03194501,0.00008963768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08913554,0.00025299,0.8785847,0.0002214515,0.0001145095,0.0001880263,0.00009221036,0.02459347,0.00681719],"genre_scores_gemma":[0.4061474,0.000148898,0.5828063,0.0002075407,0.0000430922,0.0002650678,0.0003495673,0.00530182,0.004730275],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002276148,"threshold_uncertainty_score":0.00538063,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4285503949","doi":"10.1109/ipdps53621.2022.00121","title":"HDagg: Hybrid Aggregation of Loop-carried Dependence Iterations in Sparse Matrix Computations","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Speedup; Sparse matrix; Computer science; Cholesky decomposition; Computation; Parallel computing; Solver; Algorithm; Locality; Matrix (chemical analysis); Tree (set theory); Mathematics","authors":[{"name":"Behrooz Zarebavani","is_ca":true},{"name":"Kazem Cheshmi","is_ca":true},{"name":"Bangtian Liu","is_ca":true},{"name":"Michelle Mills Strout","is_ca":false},{"name":"Maryam Mehri Dehnavi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01649664832997953,"gpt":0.2814351398593931,"spread":0.2649384915294136,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000635943,0.0007646796,0.0006617946,0.0007593449,0.0008809516,0.0006879432,0.001099351,0.0003244937,0.001829054],"category_scores_gemma":[0.001666374,0.0003601532,0.0006161606,0.001075154,0.0005227572,0.001158096,0.001698591,0.000743605,0.0005381671],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006120746,"about_ca_system_score_gemma":0.001857218,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006731331,"about_ca_topic_score_gemma":0.014451,"domain_scores_codex":[0.9993586,0.00009868399,0.00003878351,0.00008972443,0.0002974919,0.0001167419],"domain_scores_gemma":[0.9991161,0.000236894,0.00008026093,0.0002403388,0.0002333906,0.00009297255],"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.000660973,0.0004112718,0.01102248,0.0002224919,0.0001516758,0.000269634,0.0005318305,0.3468081,0.03829909,0.01907187,0.01569728,0.5668533],"study_design_scores_gemma":[0.00005846585,0.0001466718,0.0008400198,0.000008658364,0.00002201663,0.00005797994,0.00006088415,0.9732473,0.01298684,0.006930158,0.005623965,0.00001714996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1099368,0.0004283287,0.8757942,0.0002415803,0.0001619232,0.0001326243,0.0002065097,0.007659682,0.005438359],"genre_scores_gemma":[0.4745183,0.0001756205,0.5190786,0.000209884,0.0000763263,0.000175832,0.0008860785,0.0006851539,0.004194323],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006731331,"threshold_uncertainty_score":0.01338428,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4285503932","doi":"10.1109/ipdps53621.2022.00084","title":"Neon: A Multi-GPU Programming Model for Grid-based Computations","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","topic":"Lattice Boltzmann Simulation Studies","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Autodesk (Canada)","funders":"","keywords":"Computer science; Solver; Parallel computing; Computational science; Computation; Grid; CUDA; Theoretical computer science; Algorithm; Programming language","authors":[{"name":"Massimiliano Meneghin","is_ca":true},{"name":"Ahmed H. Mahmoud","is_ca":true},{"name":"Pradeep Kumar Jayaraman","is_ca":true},{"name":"Nigel Morris","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03403079285066574,"gpt":0.2917073939331894,"spread":0.2576766010825237,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001321467,0.001081798,0.0009107925,0.0004696426,0.0007442902,0.00196833,0.004134533,0.001179766,0.005548049],"category_scores_gemma":[0.003294551,0.0007604989,0.001447865,0.0006187438,0.001047698,0.002883284,0.002920174,0.003046127,0.002742585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009437308,"about_ca_system_score_gemma":0.001834921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002772968,"about_ca_topic_score_gemma":0.003514176,"domain_scores_codex":[0.9989576,0.0002584452,0.00008236201,0.00012195,0.0004781378,0.000101383],"domain_scores_gemma":[0.9991257,0.0002536281,0.00005973976,0.0002440924,0.0002180743,0.00009878827],"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.0004645719,0.0002000674,0.002618958,0.0005807722,0.0001660097,0.00069811,0.0009199748,0.3956255,0.0192615,0.4159586,0.05340916,0.1100968],"study_design_scores_gemma":[0.00008149982,0.00005115956,0.0001364653,0.00006129283,0.00002140123,0.0001976684,0.00003756208,0.8557212,0.00826179,0.0562677,0.07912503,0.00003721397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001972756,0.0000953305,0.9900844,0.0001683175,0.00005235111,0.00006940688,0.00015746,0.004332037,0.00306786],"genre_scores_gemma":[0.05201833,0.0003694607,0.9343798,0.0004279703,0.00004613725,0.0007336474,0.0007360242,0.003971162,0.007317507],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005548049,"threshold_uncertainty_score":0.01856011,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}