{"meta":{"query_hash":"3096a4af1768","filters":{"venue":"2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS)"},"cohort_total":3,"direct_labels_cover":0,"predictions_cover":3,"exported":3,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/3096a4af1768","api":"https://metacan.xera.ac/api/v1/cohort?venue=2022+IEEE+International+Parallel+and+Distributed+Processing+Symposium+%28IPDPS%29"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.034030792850665736,"score_gpt":0.2917073939331894,"score_spread":0.25767660108252366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285503932","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001972756,0.0000953305,0.9900844,0.0001683175,0.000052351108,0.00006940688,0.00015745997,0.004332037,0.0030678604],"genre_scores_gemma":[0.052018333,0.00036946073,0.93437976,0.0004279703,0.000046137247,0.0007336474,0.0007360242,0.0039711623,0.007317507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895763,0.00025844522,0.000082362014,0.000121949975,0.00047813784,0.00010138298],"domain_scores_gemma":[0.99912566,0.00025362812,0.00005973976,0.00024409236,0.00021807427,0.000098788274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013214665,0.0010817982,0.0009107925,0.00046964263,0.00074429024,0.00196833,0.0041345335,0.0011797656,0.0055480488],"category_scores_gemma":[0.0032945513,0.00076049886,0.0014478652,0.00061874377,0.001047698,0.0028832844,0.0029201743,0.003046127,0.0027425848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004645719,0.00020006738,0.0026189578,0.0005807722,0.00016600966,0.00069811003,0.00091997476,0.3956255,0.019261504,0.41595855,0.05340916,0.11009681],"study_design_scores_gemma":[0.00008149982,0.000051159557,0.0001364653,0.000061292834,0.000021401227,0.0001976684,0.00003756208,0.8557212,0.0082617905,0.056267697,0.07912503,0.000037213973],"about_ca_topic_score_codex":0.0027729678,"about_ca_topic_score_gemma":0.003514176,"teacher_disagreement_score":0.0055480488,"about_ca_system_score_codex":0.00094373076,"about_ca_system_score_gemma":0.001834921,"threshold_uncertainty_score":0.018560112},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016496648329979526,"score_gpt":0.2814351398593931,"score_spread":0.26493849152941357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285503949","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10993675,0.0004283287,0.8757942,0.0002415803,0.0001619232,0.00013262426,0.00020650968,0.007659682,0.0054383595],"genre_scores_gemma":[0.4745183,0.00017562055,0.51907855,0.00020988402,0.0000763263,0.00017583197,0.0008860785,0.0006851539,0.0041943234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993586,0.00009868399,0.000038783513,0.00008972443,0.00029749188,0.00011674194],"domain_scores_gemma":[0.9991161,0.00023689397,0.00008026093,0.00024033876,0.0002333906,0.00009297255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063594297,0.0007646796,0.00066179456,0.0007593449,0.00088095164,0.00068794325,0.0010993509,0.0003244937,0.0018290544],"category_scores_gemma":[0.0016663738,0.00036015324,0.0006161606,0.001075154,0.0005227572,0.0011580961,0.0016985906,0.000743605,0.00053816714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000660973,0.00041127182,0.0110224765,0.0002224919,0.0001516758,0.00026963404,0.00053183053,0.3468081,0.038299087,0.019071871,0.015697278,0.56685334],"study_design_scores_gemma":[0.00005846585,0.00014667184,0.00084001984,0.000008658364,0.000022016633,0.00005797994,0.000060884147,0.9732473,0.012986836,0.0069301575,0.005623965,0.000017149956],"about_ca_topic_score_codex":0.006731331,"about_ca_topic_score_gemma":0.014451003,"teacher_disagreement_score":0.006731331,"about_ca_system_score_codex":0.0006120746,"about_ca_system_score_gemma":0.0018572182,"threshold_uncertainty_score":0.013384283},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021126862763577482,"score_gpt":0.2952386818613041,"score_spread":0.2741118190977266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285504014","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089135535,0.00025298996,0.8785847,0.00022145148,0.000114509494,0.00018802627,0.000092210365,0.024593465,0.0068171904],"genre_scores_gemma":[0.40614742,0.00014889802,0.5828063,0.00020754065,0.000043092197,0.00026506782,0.00034956733,0.0053018196,0.0047302754],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986449,0.00023363074,0.00010881731,0.00023391188,0.0005816408,0.00019705604],"domain_scores_gemma":[0.9983479,0.0002843529,0.00015614693,0.00068221433,0.00045533766,0.00007406394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076046336,0.00086315785,0.00044303975,0.0004206091,0.0004345518,0.0011388188,0.0022761477,0.0005644724,0.0016084036],"category_scores_gemma":[0.0032470683,0.00067990157,0.0005612152,0.00045954614,0.00067667005,0.0015606425,0.001363626,0.0019787287,0.0011231155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00097415684,0.0008424758,0.01076382,0.0006775696,0.00026830682,0.00073886727,0.0008408763,0.18672295,0.36767426,0.027770704,0.012786272,0.38993973],"study_design_scores_gemma":[0.00009302178,0.00039391528,0.0028676728,0.000051553587,0.00010944372,0.00036565145,0.00011378414,0.6729926,0.28257278,0.008405012,0.03194501,0.00008963768],"about_ca_topic_score_codex":0.0009887674,"about_ca_topic_score_gemma":0.002309951,"teacher_disagreement_score":0.0022761477,"about_ca_system_score_codex":0.00056020275,"about_ca_system_score_gemma":0.0013911235,"threshold_uncertainty_score":0.0053806305},"labels":[],"label_agreement":null}]}