{"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011832142,0.00052457466,0.9827927,0.0014752194,0.0006697796,0.0005265578,0.001490377,0.00050025096,0.00018843016],"genre_scores_gemma":[0.97603786,0.000015297745,0.020536926,0.00021989176,0.00015828728,0.0009152871,0.0016319813,0.000051627492,0.00043282664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984515,0.000026647185,0.0004231851,0.0003636328,0.0004153889,0.00031969664],"domain_scores_gemma":[0.9992949,0.00013447272,0.00012228674,0.00012286722,0.00023152425,0.00009397172],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019699986,0.00025320108,0.00023465828,0.00015208131,0.00071573537,0.00019829611,0.00026345832,0.00005454954,0.000022383621],"category_scores_gemma":[0.000029976181,0.00027938274,0.00010169876,0.00025268854,0.000068159796,0.0002619882,0.00008782408,0.00023241727,0.0000033248584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.00006581762,0.00011660115,0.0005324958,0.00013107459,0.00009391187,0.0000039852894,0.00063799426,0.9930452,0.00041079553,0.0001862427,0.0032580958,0.0015177735],"study_design_scores_gemma":[0.0017088455,0.00003658411,0.00019962876,0.00002687293,0.000054550914,0.000009919156,0.00035532683,0.9874059,0.000042778964,0.00032960207,0.00950617,0.00032380834],"about_ca_topic_score_codex":0.00000713065,"about_ca_topic_score_gemma":0.000007928506,"teacher_disagreement_score":0.96420574,"about_ca_system_score_codex":0.00020962743,"about_ca_system_score_gemma":0.00007981201,"threshold_uncertainty_score":0.99996585},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0470141,0.00037679911,0.9490992,0.0018881053,0.0004148116,0.00026086785,0.00021164877,0.00023066164,0.0005038306],"genre_scores_gemma":[0.96853805,0.00007733704,0.030272799,0.00016459516,0.000045818593,0.00012298702,0.00048765438,0.000013721875,0.00027703334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976953,0.00017451288,0.0006748245,0.0005469188,0.00064583455,0.00026257947],"domain_scores_gemma":[0.9987924,0.00013209097,0.00043224535,0.00026501005,0.00028967235,0.000088600864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047584024,0.00021396572,0.00025538122,0.00041856433,0.0004653221,0.00027315877,0.0008923269,0.00004991704,0.000036876347],"category_scores_gemma":[0.000057692807,0.00024428815,0.000073239054,0.00076867326,0.00007958122,0.00070859864,0.00036080938,0.00031625095,0.0000033143297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.000058651363,0.000305063,0.0036307026,0.00004606248,0.000033291577,0.000034603345,0.00090923643,0.9782468,0.0017376964,0.010349666,0.001590763,0.0030574608],"study_design_scores_gemma":[0.0007887614,0.00008132719,0.0010066571,0.00006726938,0.000011710315,0.000108689404,0.00013269308,0.99008554,0.000991216,0.0057907267,0.00064901455,0.00028638425],"about_ca_topic_score_codex":0.00006641943,"about_ca_topic_score_gemma":0.000012113308,"teacher_disagreement_score":0.9215239,"about_ca_system_score_codex":0.00016467152,"about_ca_system_score_gemma":0.00020925105,"threshold_uncertainty_score":0.99617815},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00425767,0.00028662392,0.9915208,0.0017948871,0.00032454156,0.00041175564,0.00024379969,0.00042754947,0.0007323381],"genre_scores_gemma":[0.7543495,0.00010304086,0.24236964,0.00069586764,0.00008907207,0.00037889654,0.0013299973,0.00003259926,0.00065134326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979231,0.00012969202,0.00043538035,0.0007190797,0.00046213352,0.000330631],"domain_scores_gemma":[0.9989329,0.00011655128,0.0002867947,0.00025928442,0.00024958767,0.0001548879],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005726467,0.0002542844,0.00024485047,0.00017523915,0.0016862279,0.0010485073,0.00078641134,0.000079207566,0.000027418406],"category_scores_gemma":[0.000043786793,0.00028131227,0.00006222752,0.00036029716,0.00010387717,0.0010757445,0.00026122827,0.0002393064,0.0000017783511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.00022396474,0.00046297556,0.0011566657,0.00007752912,0.00010088124,0.000016120679,0.002002094,0.94602674,0.004659225,0.02055484,0.019518947,0.005200035],"study_design_scores_gemma":[0.00094003946,0.00022784079,0.0002387905,0.00003099208,0.000020677042,0.0000856603,0.000114259645,0.9863185,0.00042797276,0.0049615614,0.0062508285,0.00038283458],"about_ca_topic_score_codex":0.00002978519,"about_ca_topic_score_gemma":0.0000015894129,"teacher_disagreement_score":0.75009185,"about_ca_system_score_codex":0.00012562842,"about_ca_system_score_gemma":0.00016977142,"threshold_uncertainty_score":0.9999885},"labels":[],"label_agreement":null}]}