{"meta":{"query_hash":"ebbbd8062de5","filters":{"venue":"ACM Transactions on Parallel Computing"},"cohort_total":10,"direct_labels_cover":0,"predictions_cover":10,"exported":10,"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/ebbbd8062de5","api":"https://metacan.xera.ac/api/v1/cohort?venue=ACM+Transactions+on+Parallel+Computing"},"results":[{"id":"W2809164497","doi":"10.1145/3210367","title":"Robust and Probabilistic Failure-Aware Placement","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Parallel Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Alberta Innovates - Technology Futures; National Science Foundation","keywords":"Probabilistic logic; Adversarial system; Node (physics); Computer science; Binary logarithm; Time complexity; Key (lock); Hierarchy; Adversary; Reliability (semiconductor); Theoretical computer science; Mathematics; Combinatorics; Algorithm; Artificial intelligence; Computer security","score_opus":0.029233040630333648,"score_gpt":0.2450902188165654,"score_spread":0.21585717818623174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809164497","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.04436951,0.000026667538,0.9512888,0.0024146189,0.00036495793,0.00028755915,8.883639e-7,0.0004508571,0.0007961469],"genre_scores_gemma":[0.88633996,0.0000020961613,0.11273095,0.00043736392,0.00013507504,0.000008843818,7.068819e-7,0.0000149602565,0.0003300506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981605,0.00009277852,0.00031161355,0.0006819278,0.00031197324,0.0004412201],"domain_scores_gemma":[0.9985066,0.00023722253,0.000096050986,0.00093672145,0.00008764303,0.00013575102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036549746,0.0002401159,0.00020217054,0.00016647276,0.0008198852,0.00023869917,0.00092933106,0.000064889115,0.000021336535],"category_scores_gemma":[0.000026181331,0.0002226278,0.000076050885,0.0004038403,0.00012648114,0.000040535597,0.00014641121,0.00024808382,0.00008097186],"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.000016326412,0.00017564355,0.000048728187,0.000044200464,0.00007044618,0.000011193599,0.0014691587,0.8720812,0.000013309207,0.0022966857,0.00056373945,0.12320937],"study_design_scores_gemma":[0.0006318349,0.00036891346,0.0005373454,0.00009906581,0.000020137075,0.00003703318,0.00021109525,0.99381024,0.00004100111,0.001175822,0.0027433874,0.00032411687],"about_ca_topic_score_codex":0.000027810796,"about_ca_topic_score_gemma":0.0000297271,"teacher_disagreement_score":0.84197044,"about_ca_system_score_codex":0.000067225876,"about_ca_system_score_gemma":0.000029314475,"threshold_uncertainty_score":0.9078498},"labels":[],"label_agreement":null},{"id":"W2907775321","doi":"10.1145/3309202","title":"Group Mutual Exclusion by Fetch-and-increment","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Parallel Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mutual exclusion; Concurrency; Computer science; Scalability; Synchronization (alternating current); Fetch; Shared memory; Parallel computing; Distributed computing; Concurrency control; Shared resource; Group (periodic table); Resource (disambiguation); Simple (philosophy); Operating system; Computer network; Programming language; Channel (broadcasting)","score_opus":0.01568523912858472,"score_gpt":0.25720906230243795,"score_spread":0.24152382317385324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907775321","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.035758026,0.00013247215,0.96151304,0.0009839515,0.0005734579,0.00018490772,0.000009900579,0.0002685195,0.00057573477],"genre_scores_gemma":[0.94067377,0.000018967437,0.058521774,0.00049390015,0.00010909004,0.000008461006,0.000005801303,0.000011826533,0.00015640125],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983056,0.00008625173,0.0003406924,0.00055522606,0.00032878877,0.00038344896],"domain_scores_gemma":[0.99885243,0.00012299603,0.000100484656,0.000710166,0.0000748741,0.00013904957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003549285,0.00020551683,0.00020984444,0.00007888233,0.0007394955,0.0001889369,0.00081099663,0.00008398108,0.000023598961],"category_scores_gemma":[0.000012794646,0.000195679,0.000072656214,0.00032231165,0.00007923653,0.00027865823,0.00006968318,0.00020717269,0.00012401107],"study_design_candidate":"design_other","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.00006449432,0.0004817835,0.00018033363,0.000044088072,0.00009642755,0.000017165503,0.0024909195,0.0021507407,0.004152562,0.0073313676,0.007555657,0.9754345],"study_design_scores_gemma":[0.0034450316,0.0014646638,0.0028695406,0.00035704597,0.000036725793,0.00015220963,0.0003921084,0.87193704,0.0023695077,0.0031189027,0.11254043,0.0013168185],"about_ca_topic_score_codex":0.00012298889,"about_ca_topic_score_gemma":0.000028222063,"teacher_disagreement_score":0.97411764,"about_ca_system_score_codex":0.000057055357,"about_ca_system_score_gemma":0.00001975108,"threshold_uncertainty_score":0.79795575},"labels":[],"label_agreement":null},{"id":"W2989945918","doi":"10.1145/3365660","title":"Hyperqueues","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Parallel Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Queen's University; Queen's University Belfast","keywords":"Computer science; Concurrency; Thread (computing); Scalability; POSIX Threads; Programming language; Concurrent data structure; Linearizability; Parallel computing; Data structure; Queue; Distributed computing; Operating system; Correctness","score_opus":0.017958829395511893,"score_gpt":0.26077548639037174,"score_spread":0.24281665699485985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989945918","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.013209605,0.0000577552,0.9773346,0.0008851915,0.0005064488,0.00025158582,8.828128e-7,0.0016514317,0.006102496],"genre_scores_gemma":[0.60410076,0.000015940746,0.39456958,0.0005997013,0.00002624017,0.000004603998,0.0000014366344,0.000014088351,0.0006676288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824196,0.00010392597,0.00034159602,0.0005943545,0.00031248768,0.00040568874],"domain_scores_gemma":[0.99804384,0.0003078951,0.00011423753,0.0013350217,0.00009406565,0.0001049372],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00030661267,0.00023629052,0.0002527343,0.00024555108,0.00030390118,0.00019328317,0.001626325,0.000102728445,0.0000803924],"category_scores_gemma":[0.000024256673,0.0002353865,0.00015103356,0.0005374205,0.000028396531,0.00034989588,0.000060989147,0.00034027634,0.00085818826],"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.000015568037,0.00019210327,0.00036998186,0.000021823786,0.000050005856,0.000008163743,0.00053164095,0.84029573,0.00021405464,0.010269181,0.00056182535,0.14746991],"study_design_scores_gemma":[0.00071322935,0.0002686772,0.0009305448,0.00008499359,0.0000081861635,0.000046324778,0.000035625995,0.9853842,0.0016364347,0.006075701,0.004263272,0.0005527937],"about_ca_topic_score_codex":0.000014968627,"about_ca_topic_score_gemma":9.93439e-7,"teacher_disagreement_score":0.5908912,"about_ca_system_score_codex":0.00005496172,"about_ca_system_score_gemma":0.000052072,"threshold_uncertainty_score":0.9999198},"labels":[],"label_agreement":null},{"id":"W2996401364","doi":"10.1145/3434391","title":"Scalable Pattern Matching in Metadata Graphs via Constraint Checking","year":2021,"lang":"en","type":"preprint","venue":"ACM Transactions on Parallel Computing","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"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 British Columbia","funders":"Lawrence Livermore National Laboratory; U.S. Department of Energy","keywords":"Computer science; Scalability; Theoretical computer science; Vertex (graph theory); Iterated function; Graph; Database; Mathematics","score_opus":0.02814714752405869,"score_gpt":0.2669009362328258,"score_spread":0.2387537887087671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996401364","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.052982483,0.00029798358,0.9440471,0.00045488132,0.0012985074,0.0003714474,0.00001626994,0.00035640498,0.00017490736],"genre_scores_gemma":[0.74106234,0.000044802287,0.2583798,0.00036229487,0.00003789613,0.000024781524,0.000029529372,0.00003171256,0.00002683474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99583703,0.00046399675,0.00089252926,0.0015200399,0.00050722575,0.0007791632],"domain_scores_gemma":[0.99667984,0.00041703336,0.00032836891,0.0022969993,0.000105086736,0.00017267939],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0012428348,0.0006051884,0.0007724563,0.0006332759,0.00048505323,0.0011214712,0.0030555013,0.0003437245,0.000043816268],"category_scores_gemma":[0.000022663997,0.000672811,0.00047361248,0.0008163505,0.000112465656,0.0007299689,0.0005503821,0.0023348958,0.000017179816],"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.0000068498107,0.00033360993,0.00014886844,0.00016618888,0.00017091224,0.00023705077,0.0026818626,0.53288573,0.0001706857,0.0020129634,0.0000032275534,0.46118206],"study_design_scores_gemma":[0.001445182,0.00008698383,0.0020965494,0.002202785,0.0001052338,0.00026566946,0.0010044707,0.8202501,0.0011120723,0.16946831,0.000071337025,0.0018913085],"about_ca_topic_score_codex":0.00047915452,"about_ca_topic_score_gemma":0.00013958967,"teacher_disagreement_score":0.6880799,"about_ca_system_score_codex":0.00011336697,"about_ca_system_score_gemma":0.00017948974,"threshold_uncertainty_score":0.99996674},"labels":[],"label_agreement":null},{"id":"W3206276601","doi":"10.1145/3470642","title":"A High-throughput Parallel Viterbi Algorithm via Bitslicing","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Parallel Computing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":7,"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 Alberta","funders":"","keywords":"Soft output Viterbi algorithm; Viterbi decoder; Computer science; Viterbi algorithm; Throughput; Iterative Viterbi decoding; Parallel computing; Decoding methods; Algorithm; Sequential decoding; Wireless; Telecommunications; Block code","score_opus":0.02045993853133701,"score_gpt":0.2725710921249695,"score_spread":0.2521111535936325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206276601","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058229,0.00015057641,0.9876208,0.0021603582,0.0013538459,0.00026683212,0.0000038565977,0.002302643,0.00031823298],"genre_scores_gemma":[0.4021503,0.000021953489,0.596533,0.000935166,0.00010186162,0.000019419704,0.000005295167,0.000037074464,0.00019590816],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963939,0.00028837557,0.000691538,0.001232448,0.00057838816,0.0008153196],"domain_scores_gemma":[0.99642897,0.0006767202,0.00023209778,0.002187132,0.00027667842,0.00019839861],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000508955,0.00046923684,0.00051573536,0.0003043535,0.00080884434,0.00034627068,0.0017900759,0.00020575413,0.000043082953],"category_scores_gemma":[0.0000812951,0.0005197172,0.0003018489,0.0013744122,0.00006594566,0.0006097535,0.00018441257,0.0008741483,0.0001466495],"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.0000128339225,0.0004154958,0.00006820374,0.00003689849,0.0001327532,0.0002670734,0.00166622,0.09230957,0.0021170613,0.0016697532,0.00032739664,0.9009767],"study_design_scores_gemma":[0.0014357606,0.00037793332,0.00057059806,0.0003612337,0.00006268549,0.0011077843,0.00015310163,0.95370305,0.020185528,0.019169208,0.0015074901,0.0013656268],"about_ca_topic_score_codex":0.00030573967,"about_ca_topic_score_gemma":0.000051965155,"teacher_disagreement_score":0.8996111,"about_ca_system_score_codex":0.00019104761,"about_ca_system_score_gemma":0.00015407697,"threshold_uncertainty_score":0.99972546},"labels":[],"label_agreement":null},{"id":"W4317884298","doi":"10.1145/3580314","title":"Efficient Distributed Matrix-free Multigrid Methods on Locally Refined Meshes for FEM Computations","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Parallel Computing","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Leibniz-Rechenzentrum; Leibniz-Gemeinschaft; U.S. Navy; Gauss Centre for Supercomputing; Clemson University; National Science Foundation","keywords":"Multigrid method; Polygon mesh; Smoothing; Computation; Computer science; Finite element method; Scalability; Solver; Computational science; Parallel computing; Matrix (chemical analysis); Scaling; Mathematical optimization; Node (physics); Algorithm; Applied mathematics; Mathematics; Partial differential equation; Geometry; Mathematical analysis","score_opus":0.05488410142957099,"score_gpt":0.38451096642041344,"score_spread":0.3296268649908424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317884298","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037916426,0.00003861598,0.9916306,0.0006505578,0.0008497903,0.0006684541,0.00017117114,0.00208343,0.00011570684],"genre_scores_gemma":[0.1336319,0.000007974008,0.86587334,0.00009203474,0.00008170454,0.00010322654,0.00006687228,0.00009246011,0.000050468963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978548,0.00016351159,0.00067190046,0.00044113473,0.00033729433,0.00053132133],"domain_scores_gemma":[0.9894956,0.00938239,0.000109941226,0.0007185307,0.00014863805,0.0001449093],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065443176,0.0003669769,0.00044765382,0.00031114332,0.00047946384,0.000057369387,0.0006059297,0.00012717453,0.00001661328],"category_scores_gemma":[0.00094297214,0.00037913836,0.00024389228,0.0011225438,0.00006637423,0.00004125073,0.000031233205,0.00040958112,0.00010897989],"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.000038565584,0.00009875147,0.0000010534261,0.00012936295,0.000093866605,0.0000029737214,0.00014821497,0.9244143,0.00016220666,0.0011678849,0.0004914822,0.07325136],"study_design_scores_gemma":[0.0010008015,0.00013802914,0.00021100538,0.00012239747,0.00004499199,0.000006608013,0.00012193022,0.968418,0.00050166587,0.028230583,0.00083280413,0.00037120594],"about_ca_topic_score_codex":0.0000019912459,"about_ca_topic_score_gemma":8.990399e-7,"teacher_disagreement_score":0.12984025,"about_ca_system_score_codex":0.00018402982,"about_ca_system_score_gemma":0.000026461832,"threshold_uncertainty_score":0.99986607},"labels":[],"label_agreement":null},{"id":"W4321372296","doi":"10.1145/3584696","title":"MCSH, a Lock with the Standard Interface","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Parallel Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Correctness; Lock (firearm); Mutual exclusion; Thread (computing); Critical section; Interface (matter); Pointer (user interface); Skew; Distributed computing; Embedded system; Parallel computing; Algorithm; Operating system; Computer hardware","score_opus":0.01950741890194746,"score_gpt":0.26958978643931664,"score_spread":0.2500823675373692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321372296","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.013112298,0.000039885406,0.97836965,0.0067801354,0.0003045959,0.00021981749,0.000012074929,0.0006177807,0.00054373196],"genre_scores_gemma":[0.9831998,0.0000074581176,0.015884891,0.00025274375,0.000037954233,0.000017514698,0.0000020273014,0.000014510208,0.00058309705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851894,0.0000833213,0.00022297367,0.00040776178,0.00037347592,0.00039353827],"domain_scores_gemma":[0.9985252,0.00023965747,0.00008513234,0.0009883882,0.0000871514,0.00007445823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036978032,0.00018077856,0.00019076442,0.00008842878,0.0006036359,0.0002571616,0.0013462392,0.0000474623,0.0000086640275],"category_scores_gemma":[0.000011133624,0.00011936027,0.00008084668,0.0011017311,0.00005705333,0.0001972539,0.000040390572,0.00031182193,0.00022394476],"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.00005264743,0.000048715454,0.000038122776,0.000022624978,0.00008721674,0.000033304404,0.002039314,0.87830955,0.000051599007,0.002169966,0.0047741947,0.11237274],"study_design_scores_gemma":[0.0017768815,0.00062629115,0.0020404935,0.00030584593,0.000026281237,0.00012540913,0.0010192731,0.9122485,0.0005063075,0.0010637393,0.07956933,0.0006916687],"about_ca_topic_score_codex":0.000028306911,"about_ca_topic_score_gemma":0.000025762782,"teacher_disagreement_score":0.9700875,"about_ca_system_score_codex":0.000046205547,"about_ca_system_score_gemma":0.000054963595,"threshold_uncertainty_score":0.48673707},"labels":[],"label_agreement":null},{"id":"W4385199271","doi":"10.1145/3606338","title":"A Fast Algorithm for Aperiodic Linear Stencil Computation using Fast Fourier Transforms","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Parallel Computing","topic":"Electromagnetic Scattering and Analysis","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; National Science Foundation","keywords":"Stencil; Computer science; Algorithm; Solver; Krylov subspace; Fast Fourier transform; Parallel computing; Aperiodic graph; Computation; Grid; Interpolation (computer graphics); Computational science; Iterative method; Mathematics; Geometry","score_opus":0.030232626766882854,"score_gpt":0.29475010164553955,"score_spread":0.2645174748786567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385199271","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.16061729,0.000008523141,0.83848906,0.00022988925,0.00013078874,0.00022490903,0.00004653523,0.00015758461,0.00009540327],"genre_scores_gemma":[0.8018077,0.0000021923497,0.19741215,0.000053066287,0.00022813964,0.000028433247,0.00009002061,0.000038128364,0.00034017602],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855036,0.00003659151,0.0003493557,0.00038016742,0.00021712494,0.00046641502],"domain_scores_gemma":[0.99929875,0.00018551115,0.00008974552,0.0002477907,0.00008660457,0.00009158287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020044598,0.00023009021,0.00028057583,0.0002103366,0.0006982062,0.00008360086,0.00021046372,0.00005219736,0.00006350458],"category_scores_gemma":[0.0000028061663,0.00022960217,0.000313248,0.0006153916,0.00004136726,0.00009349346,0.0000067810347,0.0002111459,0.000045717836],"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.000008091937,0.00006561076,0.00007704079,0.000012412537,0.00013305161,9.437041e-7,0.000522258,0.38394183,0.0005516987,0.000013515583,0.000019745927,0.6146538],"study_design_scores_gemma":[0.0008802301,0.00014751556,0.000209962,0.000049205166,0.000121810124,0.0000030670149,0.00082957954,0.9963094,0.00036005807,0.0006907647,0.00013340452,0.00026498977],"about_ca_topic_score_codex":0.0001425191,"about_ca_topic_score_gemma":0.0000046349933,"teacher_disagreement_score":0.6411904,"about_ca_system_score_codex":0.000037897105,"about_ca_system_score_gemma":0.00005811256,"threshold_uncertainty_score":0.93629044},"labels":[],"label_agreement":null},{"id":"W4392240387","doi":"10.1145/3649510","title":"Low-Overhead Trace Collection and Profiling on GPU Compute Kernels","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Parallel Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","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":"Polytechnique Montréal","funders":"","keywords":"Profiling (computer programming); Computer science; Parallel computing; Overhead (engineering); TRACE (psycholinguistics); Computational science; Operating system","score_opus":0.02225276152485731,"score_gpt":0.28097243297424046,"score_spread":0.2587196714493831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392240387","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.011587321,0.00036706947,0.98147136,0.0014487457,0.0009290744,0.00043115244,0.000003982734,0.0026768665,0.0010844239],"genre_scores_gemma":[0.67678356,0.0001160268,0.3222595,0.00032872352,0.00009050198,0.000016311986,0.0000034293184,0.00003213657,0.00036982197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974107,0.00017730353,0.00050008635,0.0010105928,0.00041000923,0.0004912802],"domain_scores_gemma":[0.9981244,0.000755342,0.000102088736,0.0007611975,0.00009513754,0.000161784],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005434292,0.0003818256,0.0003306142,0.00052237144,0.00077564234,0.00069698686,0.0007878908,0.00017104013,0.000010937495],"category_scores_gemma":[0.00003867379,0.00038384358,0.000160015,0.0010795902,0.000069237656,0.0004310523,0.00006153479,0.00067963934,0.00008474609],"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.00004207213,0.00024573156,0.000025867826,0.00013027042,0.000102067526,0.000044594915,0.0011358397,0.7407441,0.00023560016,0.011492323,0.0010490183,0.2447525],"study_design_scores_gemma":[0.00041659942,0.0003601692,0.00020786023,0.00042578852,0.000017225904,0.000092918395,0.00002773224,0.9902096,0.003823874,0.0030820293,0.0009049143,0.00043132578],"about_ca_topic_score_codex":0.000019713623,"about_ca_topic_score_gemma":0.0000030357664,"teacher_disagreement_score":0.66519624,"about_ca_system_score_codex":0.00014373884,"about_ca_system_score_gemma":0.000109151166,"threshold_uncertainty_score":0.99986136},"labels":[],"label_agreement":null},{"id":"W4400422050","doi":"10.1145/3669989","title":"First-Come-First-Served as a Separate Principle","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Parallel Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"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":"","keywords":"Mathematics","score_opus":0.02337878390958066,"score_gpt":0.29122242396082465,"score_spread":0.267843640051244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400422050","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.017844463,0.0005132925,0.97377926,0.0032084119,0.0015748289,0.00034080225,0.000016207605,0.0011715625,0.0015511961],"genre_scores_gemma":[0.9639941,0.000038892314,0.034115735,0.0003065777,0.00011402532,0.00004171527,0.000006204173,0.00003078157,0.0013519782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975145,0.000074851225,0.0005364735,0.00086221524,0.00042305232,0.0005889438],"domain_scores_gemma":[0.99799067,0.00038364335,0.00008652843,0.0012648357,0.00008389051,0.0001904138],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00041582933,0.0003326606,0.00033209188,0.000204155,0.0007362164,0.00074598345,0.0015626961,0.00013158414,0.00005874526],"category_scores_gemma":[0.00002762275,0.0003178751,0.0002668194,0.0010366061,0.000042751413,0.0005573474,0.000063316205,0.00047289496,0.001197407],"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.000039066257,0.000353046,0.00013014262,0.00039543264,0.00029119136,0.00032933493,0.0031480715,0.9042389,0.000064874475,0.039960135,0.001637922,0.049411934],"study_design_scores_gemma":[0.0004830571,0.00014758753,0.00084234757,0.00042380887,0.00001814944,0.0001337381,0.000028024357,0.8580706,0.000118570955,0.0022752823,0.13701323,0.0004456009],"about_ca_topic_score_codex":0.00018970096,"about_ca_topic_score_gemma":0.000114540824,"teacher_disagreement_score":0.94614965,"about_ca_system_score_codex":0.00012917818,"about_ca_system_score_gemma":0.00011216003,"threshold_uncertainty_score":0.99992734},"labels":[],"label_agreement":null}]}