{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":10,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":10,"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":"ebbbd8062de5","filters":{"venue":"ACM Transactions on Parallel Computing"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Peter Münch","is_ca":false},{"name":"Laura Prieto Saavedra","is_ca":true},{"name":"Martin Kronbichler","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05488410142957099,"gpt":0.3845109664204134,"spread":0.3296268649908424,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006726146,0.0005681823,0.0007413374,0.00046971,0.0003495615,0.0005465257,0.001128911,0.0006718397,0.001812584],"category_scores_gemma":[0.002674667,0.0002398864,0.0005562381,0.0005433179,0.0005279842,0.0008071196,0.001063479,0.0008952437,0.0008159641],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004947298,"about_ca_system_score_gemma":0.0007371195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002618688,"about_ca_topic_score_gemma":0.003880701,"domain_scores_codex":[0.9995053,0.0001738274,0.00001883269,0.0000448648,0.0002187498,0.00003841404],"domain_scores_gemma":[0.9990988,0.0004556828,0.00005038047,0.0001924597,0.0001665102,0.00003621143],"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.0001246283,0.00006881934,0.0008968315,0.0002263711,0.00005452262,0.0001157689,0.0001780132,0.8413858,0.02659681,0.02644831,0.002270436,0.1016338],"study_design_scores_gemma":[0.00001044728,0.00001692434,0.00009367972,0.000007295968,0.000003765724,0.00001514626,0.00001087142,0.9920243,0.002967362,0.003766452,0.001078952,0.000004731825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01354016,0.0001762049,0.9837348,0.00006687485,0.00002559748,0.00003076682,0.00004427887,0.0006643893,0.00171676],"genre_scores_gemma":[0.3522458,0.0002513925,0.6437554,0.00007278268,0.00003793128,0.0001719981,0.0002623131,0.0005459376,0.002656575],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002618688,"threshold_uncertainty_score":0.0060637,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Saleh Khalaj Monfared","is_ca":false},{"name":"Omid Hajihassani","is_ca":true},{"name":"Vahid Mohsseni","is_ca":false},{"name":"Dara Rahmati","is_ca":false},{"name":"Saeid Gorgin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02045993853133701,"gpt":0.2725710921249695,"spread":0.2521111535936325,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000382488,0.0005187975,0.0005216507,0.0006319995,0.0005465139,0.0008371933,0.001235023,0.0007423253,0.004436123],"category_scores_gemma":[0.001189943,0.0003669917,0.0003230088,0.0007020928,0.0004458597,0.001303054,0.0008592505,0.000999614,0.002205294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005929089,"about_ca_system_score_gemma":0.001338139,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001619452,"about_ca_topic_score_gemma":0.002030659,"domain_scores_codex":[0.9995109,0.00007311468,0.00003173155,0.0001020269,0.0002295845,0.00005270689],"domain_scores_gemma":[0.9996044,0.00009346686,0.00004026306,0.0001190792,0.000119122,0.00002366424],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0008564641,0.0002146699,0.001151185,0.0004286171,0.000133193,0.0003428155,0.000273709,0.1119567,0.2432102,0.04195612,0.008233617,0.5912427],"study_design_scores_gemma":[0.0001036284,0.000312919,0.0004135718,0.00003670714,0.00005281399,0.0004988475,0.00003271317,0.7766895,0.1869143,0.01055893,0.02432908,0.00005697336],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01811273,0.0004303302,0.9750684,0.0001569827,0.0000979968,0.000108976,0.0001225917,0.002609624,0.003292279],"genre_scores_gemma":[0.2495095,0.0003964419,0.7407058,0.0002250549,0.00009029509,0.0001689328,0.0005876328,0.000269776,0.008046608],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004436123,"threshold_uncertainty_score":0.01484036,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Wim H. Hesselink","is_ca":false},{"name":"Peter A. Buhr","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01950741890194746,"gpt":0.2695897864393166,"spread":0.2500823675373692,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002694592,0.0007683427,0.000766268,0.001470886,0.001379617,0.002519073,0.002775881,0.001283197,0.01666598],"category_scores_gemma":[0.01202625,0.0009067899,0.000878759,0.001432558,0.002756834,0.006102153,0.004301748,0.003044941,0.003234364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001269444,"about_ca_system_score_gemma":0.00319456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00423838,"about_ca_topic_score_gemma":0.00544446,"domain_scores_codex":[0.9963599,0.0005010529,0.0003004789,0.0004259598,0.002015731,0.0003968756],"domain_scores_gemma":[0.9956189,0.001269147,0.0003536873,0.001574973,0.0008955263,0.0002877393],"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.0007621953,0.0001494645,0.001384014,0.0005287585,0.00008553422,0.00014392,0.0006173376,0.004198128,0.01021979,0.4810319,0.1071495,0.3937295],"study_design_scores_gemma":[0.0004239302,0.0003318842,0.0006709003,0.0001499104,0.0001400024,0.0004625662,0.0001339177,0.04590702,0.02329942,0.1199073,0.8084423,0.000130903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004425821,0.001399783,0.9572912,0.0008257304,0.001195407,0.0004016572,0.0005548727,0.01975848,0.01414713],"genre_scores_gemma":[0.1736394,0.001550862,0.7713022,0.002033194,0.001308478,0.0008050192,0.001492362,0.005794483,0.04207405],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01666598,"threshold_uncertainty_score":0.05575323,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Sébastien Darche","is_ca":true},{"name":"Michel Dagenais","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02225276152485731,"gpt":0.2809724329742405,"spread":0.2587196714493831,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005811343,0.0008634527,0.0005664604,0.001099171,0.0006486918,0.001041957,0.001621093,0.0005340152,0.002610907],"category_scores_gemma":[0.005520784,0.0004997584,0.000336043,0.0015853,0.000655866,0.001290766,0.00091658,0.001004615,0.001163688],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009564989,"about_ca_system_score_gemma":0.001442183,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005283982,"about_ca_topic_score_gemma":0.006919139,"domain_scores_codex":[0.9983753,0.0002824639,0.00007969311,0.0002570377,0.0007727278,0.0002326376],"domain_scores_gemma":[0.9968044,0.0009750545,0.0002652732,0.001272137,0.0005156806,0.0001675304],"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.002330378,0.0007393068,0.03369973,0.0006927939,0.0001732115,0.0008834052,0.001457581,0.0749855,0.3482297,0.01394248,0.02446977,0.4983961],"study_design_scores_gemma":[0.00009560247,0.0004934851,0.01679657,0.00006605746,0.00006626056,0.0003851564,0.0002671207,0.6077432,0.3504131,0.005220606,0.01834088,0.0001118774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5040509,0.0008062455,0.4164268,0.0003772134,0.0002438675,0.0002209908,0.001416411,0.0662725,0.01018496],"genre_scores_gemma":[0.8946955,0.0002108243,0.09904346,0.0001097263,0.00003087352,0.0001016122,0.001253821,0.001638001,0.002916335],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005283982,"threshold_uncertainty_score":0.01050645,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics","authors":[{"name":"Wim H. Hesselink","is_ca":false},{"name":"Peter A. Buhr","is_ca":true},{"name":"Colby A. Parsons","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02337878390958066,"gpt":0.2912224239608247,"spread":0.267843640051244,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00368409,0.0009438152,0.0007960508,0.0009763193,0.001593579,0.004193665,0.002927151,0.001513159,0.009267497],"category_scores_gemma":[0.01018495,0.0007777872,0.001309277,0.0007746499,0.004033491,0.00525406,0.00296641,0.004436599,0.003956196],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001625708,"about_ca_system_score_gemma":0.004258813,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002354263,"about_ca_topic_score_gemma":0.001856367,"domain_scores_codex":[0.9945904,0.0008055785,0.0003457051,0.001176912,0.002549517,0.0005318933],"domain_scores_gemma":[0.9930221,0.001956225,0.0004009832,0.002867752,0.00148369,0.0002692295],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004466642,0.0001832482,0.0008598511,0.0003774873,0.00005853576,0.0003828706,0.0009462431,0.01515073,0.01941714,0.8315747,0.009577423,0.1210251],"study_design_scores_gemma":[0.0003021715,0.000440203,0.0003885565,0.0002073434,0.0001541573,0.001202368,0.0002373688,0.1652644,0.08579589,0.4679989,0.2778589,0.000149881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007487582,0.0002915781,0.9712828,0.0005983685,0.0003247925,0.0002950275,0.0001253246,0.003601486,0.01599314],"genre_scores_gemma":[0.2497212,0.0004799584,0.7095339,0.0009966474,0.0003269213,0.0006502333,0.0003548965,0.002051938,0.03588429],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009267497,"threshold_uncertainty_score":0.03100288,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Madhukar Korupolu","is_ca":false},{"name":"Rajmohan Rajaraman","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02923304063033365,"gpt":0.2450902188165654,"spread":0.2158571781862317,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001377998,0.001048562,0.001137698,0.0005866261,0.0008383216,0.00119975,0.002028847,0.001403055,0.002785305],"category_scores_gemma":[0.005886418,0.0006267554,0.0008799714,0.001074541,0.001185023,0.002517477,0.002038076,0.001338877,0.0005116452],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001669577,"about_ca_system_score_gemma":0.001414999,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003581419,"about_ca_topic_score_gemma":0.004133332,"domain_scores_codex":[0.9984176,0.0003456062,0.00009615027,0.0003919059,0.0004546054,0.0002940213],"domain_scores_gemma":[0.9976442,0.0009997947,0.000410223,0.0005946707,0.0001890978,0.000161963],"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.00009117495,0.00003230696,0.0003202939,0.00009225004,0.0000245837,0.00007980402,0.00005965985,0.9493608,0.003869723,0.02573308,0.001769078,0.01856721],"study_design_scores_gemma":[0.00001160712,0.00005770402,0.0001805478,0.000009609873,0.000009478731,0.00007189117,0.00003407581,0.9701391,0.001038433,0.02695958,0.00147696,0.00001093333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03195087,0.0003413621,0.9620119,0.0005764693,0.00006754024,0.00007548785,0.0001833404,0.0006580548,0.004134967],"genre_scores_gemma":[0.7870355,0.0006179712,0.205896,0.0002047341,0.0001450244,0.0001222826,0.0003068596,0.000164489,0.005507163],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003581419,"threshold_uncertainty_score":0.01211363,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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)","authors":[{"name":"Alex Aravind","is_ca":true},{"name":"Wim H. Hesselink","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01568523912858472,"gpt":0.257209062302438,"spread":0.2415238231738532,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001238531,0.0008545662,0.001142134,0.0009219939,0.001667951,0.001279054,0.002050135,0.00107035,0.0042173],"category_scores_gemma":[0.005561622,0.0003976204,0.0007174344,0.001134057,0.001585799,0.002810958,0.002421736,0.001439608,0.0009963547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009674015,"about_ca_system_score_gemma":0.00183569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002649988,"about_ca_topic_score_gemma":0.003966863,"domain_scores_codex":[0.9983926,0.0003665413,0.0001053722,0.0003227907,0.0005316897,0.0002810111],"domain_scores_gemma":[0.9960751,0.001499748,0.0003394758,0.001307324,0.0006025024,0.0001758533],"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.001531842,0.0003939051,0.003320701,0.0003633104,0.0001522839,0.0003638617,0.0008833525,0.1947221,0.03036408,0.2126261,0.01302085,0.5422577],"study_design_scores_gemma":[0.0002311231,0.0003272415,0.0003999468,0.00004239124,0.00007318446,0.0002581678,0.0001070205,0.8156971,0.03375153,0.1269375,0.0221011,0.00007369812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03088927,0.0003208349,0.9602193,0.0003510368,0.0001342576,0.0002214319,0.00006689692,0.002330837,0.005466165],"genre_scores_gemma":[0.4392828,0.00021574,0.5507507,0.0002593957,0.0000993474,0.0004092782,0.0002217014,0.0003415712,0.008419463],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0042173,"threshold_uncertainty_score":0.01410824,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Zafar Ahmad","is_ca":false},{"name":"Rezaul Chowdhury","is_ca":false},{"name":"Rathish Das","is_ca":false},{"name":"Pramod Ganapathi","is_ca":false},{"name":"Aaron Gregory","is_ca":false},{"name":"Y. Zhu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03023262676688285,"gpt":0.2947501016455396,"spread":0.2645174748786567,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005361389,0.001094058,0.000977241,0.0007340166,0.0009049493,0.0011766,0.001550123,0.001183053,0.01111882],"category_scores_gemma":[0.002343494,0.0005175716,0.0007844772,0.0008448029,0.0007218021,0.00137476,0.001559573,0.001900608,0.005226171],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007520054,"about_ca_system_score_gemma":0.002053577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00439015,"about_ca_topic_score_gemma":0.004939056,"domain_scores_codex":[0.9994406,0.00004774158,0.00003675011,0.00008032874,0.0003254788,0.00006915445],"domain_scores_gemma":[0.9993458,0.0002116632,0.00004194492,0.000107515,0.0002467999,0.00004623398],"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.000227831,0.0001395838,0.001023371,0.0003131156,0.00006342054,0.0004011843,0.0003797206,0.209841,0.02972415,0.07649024,0.02548154,0.6559149],"study_design_scores_gemma":[0.00007201264,0.00004679999,0.0001453876,0.00002189417,0.000008119739,0.0001407118,0.00003972996,0.9616537,0.009384963,0.01252136,0.01593703,0.00002829109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002638335,0.00009929763,0.9925163,0.0001059563,0.00007182618,0.00006534936,0.00006433953,0.002463694,0.001974804],"genre_scores_gemma":[0.04583085,0.000134534,0.9481645,0.00007332997,0.00004315865,0.0002560107,0.0003119341,0.0006027215,0.004583089],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01111882,"threshold_uncertainty_score":0.03719622,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Tahsin Reza","is_ca":true},{"name":"Hassan H. Halawa","is_ca":true},{"name":"Matei Ripeanu","is_ca":true},{"name":"Geoffrey Sanders","is_ca":false},{"name":"Roger Pearce","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02814714752405869,"gpt":0.2669009362328258,"spread":0.2387537887087671,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003207885,0.001365657,0.001329822,0.002733972,0.001758104,0.004251257,0.004190778,0.001313102,0.00625209],"category_scores_gemma":[0.02563999,0.001073674,0.00254038,0.00405268,0.00202488,0.008414513,0.00426001,0.002190815,0.001955022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001826755,"about_ca_system_score_gemma":0.004773722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01128613,"about_ca_topic_score_gemma":0.01665485,"domain_scores_codex":[0.993026,0.001568689,0.0006098966,0.001696162,0.00251958,0.0005796941],"domain_scores_gemma":[0.9827244,0.009591994,0.001383567,0.003900419,0.002048985,0.0003507463],"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.0005593203,0.0003778165,0.007645614,0.001233345,0.0002796292,0.0009176658,0.000644568,0.3237474,0.02333977,0.1958505,0.02057707,0.4248273],"study_design_scores_gemma":[0.00006532369,0.00005416877,0.0003962893,0.00005548826,0.00005898391,0.0001701038,0.0002023441,0.7712855,0.01675721,0.2027813,0.008131511,0.00004166141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01344086,0.000133406,0.9756994,0.0004564816,0.00004389047,0.0002700824,0.001097088,0.006526628,0.00233206],"genre_scores_gemma":[0.1690311,0.0002354906,0.822345,0.0003405425,0.00004939744,0.000379941,0.003935695,0.001218515,0.002464329],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01128613,"threshold_uncertainty_score":0.02244091,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Hans Vandierendonck","is_ca":false},{"name":"Dimitrios S. Nikolopoulos","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01795882939551189,"gpt":0.2607754863903717,"spread":0.2428166569948599,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003991939,0.001110888,0.001034844,0.001133133,0.001869073,0.00550975,0.00514635,0.001751286,0.02545866],"category_scores_gemma":[0.01298917,0.00131039,0.00172537,0.001330772,0.002022458,0.008047282,0.006419824,0.004009931,0.007704278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001319901,"about_ca_system_score_gemma":0.004033382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002692101,"about_ca_topic_score_gemma":0.00302612,"domain_scores_codex":[0.9960544,0.0008088814,0.0004458734,0.0006351508,0.001525167,0.0005305148],"domain_scores_gemma":[0.9927223,0.001974718,0.0005236165,0.002596717,0.001652297,0.0005302547],"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.001448813,0.0005065439,0.00454558,0.001340391,0.0001942784,0.0004595644,0.001361377,0.01819803,0.01657829,0.5924062,0.1155947,0.2473661],"study_design_scores_gemma":[0.0003760015,0.0002845869,0.0006743386,0.0002356203,0.0001062428,0.0004679229,0.0001823424,0.0809977,0.02966498,0.2217641,0.6650587,0.0001874618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01023239,0.0007577539,0.9160229,0.0005339453,0.0006907078,0.0006049274,0.001377192,0.04474753,0.02503266],"genre_scores_gemma":[0.1821446,0.00134804,0.7222319,0.002105939,0.0005962101,0.002294853,0.005806941,0.02460234,0.05886922],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02545866,"threshold_uncertainty_score":0.08516771,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}