{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005726467,0.0002542844,0.0002448505,0.0001752392,0.001686228,0.001048507,0.0007864113,0.00007920757,0.00002741841],"category_scores_gemma":[0.00004378679,0.0002813123,0.00006222752,0.0003602972,0.0001038772,0.001075745,0.0002612283,0.0002393064,0.000001778351],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001256284,"about_ca_system_score_gemma":0.0001697714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002978519,"about_ca_topic_score_gemma":0.000001589413,"domain_scores_codex":[0.9979231,0.000129692,0.0004353804,0.0007190797,0.0004621335,0.000330631],"domain_scores_gemma":[0.9989329,0.0001165513,0.0002867947,0.0002592844,0.0002495877,0.0001548879],"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.0002239647,0.0004629756,0.001156666,0.00007752912,0.0001008812,0.00001612068,0.002002094,0.9460267,0.004659225,0.02055484,0.01951895,0.005200035],"study_design_scores_gemma":[0.0009400395,0.0002278408,0.0002387905,0.00003099208,0.00002067704,0.0000856603,0.0001142596,0.9863185,0.0004279728,0.004961561,0.006250829,0.0003828346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00425767,0.0002866239,0.9915208,0.001794887,0.0003245416,0.0004117556,0.0002437997,0.0004275495,0.0007323381],"genre_scores_gemma":[0.7543495,0.0001030409,0.2423696,0.0006958676,0.00008907207,0.0003788965,0.001329997,0.00003259926,0.0006513433],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7500919,"threshold_uncertainty_score":0.9999885,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004758402,0.0002139657,0.0002553812,0.0004185643,0.0004653221,0.0002731588,0.0008923269,0.00004991704,0.00003687635],"category_scores_gemma":[0.00005769281,0.0002442882,0.00007323905,0.0007686733,0.00007958122,0.0007085986,0.0003608094,0.000316251,0.00000331433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001646715,"about_ca_system_score_gemma":0.0002092511,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006641943,"about_ca_topic_score_gemma":0.00001211331,"domain_scores_codex":[0.9976953,0.0001745129,0.0006748245,0.0005469188,0.0006458345,0.0002625795],"domain_scores_gemma":[0.9987924,0.000132091,0.0004322453,0.0002650101,0.0002896723,0.00008860086],"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.00005865136,0.000305063,0.003630703,0.00004606248,0.00003329158,0.00003460334,0.0009092364,0.9782468,0.001737696,0.01034967,0.001590763,0.003057461],"study_design_scores_gemma":[0.0007887614,0.00008132719,0.001006657,0.00006726938,0.00001171032,0.0001086894,0.0001326931,0.9900855,0.000991216,0.005790727,0.0006490145,0.0002863843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0470141,0.0003767991,0.9490992,0.001888105,0.0004148116,0.0002608678,0.0002116488,0.0002306616,0.0005038306],"genre_scores_gemma":[0.968538,0.00007733704,0.0302728,0.0001645952,0.00004581859,0.000122987,0.0004876544,0.00001372187,0.0002770333],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9215239,"threshold_uncertainty_score":0.9961782,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001969999,0.0002532011,0.0002346583,0.0001520813,0.0007157354,0.0001982961,0.0002634583,0.00005454954,0.00002238362],"category_scores_gemma":[0.00002997618,0.0002793827,0.0001016988,0.0002526885,0.0000681598,0.0002619882,0.00008782408,0.0002324173,0.000003324858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002096274,"about_ca_system_score_gemma":0.00007981201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000713065,"about_ca_topic_score_gemma":0.000007928506,"domain_scores_codex":[0.9984515,0.00002664719,0.0004231851,0.0003636328,0.0004153889,0.0003196966],"domain_scores_gemma":[0.9992949,0.0001344727,0.0001222867,0.0001228672,0.0002315242,0.00009397172],"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.00006581762,0.0001166011,0.0005324958,0.0001310746,0.00009391187,0.000003985289,0.0006379943,0.9930452,0.0004107955,0.0001862427,0.003258096,0.001517773],"study_design_scores_gemma":[0.001708845,0.00003658411,0.0001996288,0.00002687293,0.00005455091,0.000009919156,0.0003553268,0.9874059,0.00004277896,0.0003296021,0.00950617,0.0003238083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01183214,0.0005245747,0.9827927,0.001475219,0.0006697796,0.0005265578,0.001490377,0.000500251,0.0001884302],"genre_scores_gemma":[0.9760379,0.00001529774,0.02053693,0.0002198918,0.0001582873,0.0009152871,0.001631981,0.00005162749,0.0004328266],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9642057,"threshold_uncertainty_score":0.9999658,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}