{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006544318,0.0003669769,0.0004476538,0.0003111433,0.0004794638,0.00005736939,0.0006059297,0.0001271745,0.00001661328],"category_scores_gemma":[0.0009429721,0.0003791384,0.0002438923,0.001122544,0.00006637423,0.00004125073,0.0000312332,0.0004095811,0.0001089799],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001840298,"about_ca_system_score_gemma":0.00002646183,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001991246,"about_ca_topic_score_gemma":8.990399e-7,"domain_scores_codex":[0.9978548,0.0001635116,0.0006719005,0.0004411347,0.0003372943,0.0005313213],"domain_scores_gemma":[0.9894956,0.00938239,0.0001099412,0.0007185307,0.000148638,0.0001449093],"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.00003856558,0.00009875147,0.000001053426,0.0001293629,0.00009386661,0.000002973721,0.000148215,0.9244143,0.0001622067,0.001167885,0.0004914822,0.07325136],"study_design_scores_gemma":[0.001000801,0.0001380291,0.0002110054,0.0001223975,0.00004499199,0.000006608013,0.0001219302,0.968418,0.0005016659,0.02823058,0.0008328041,0.0003712059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003791643,0.00003861598,0.9916306,0.0006505578,0.0008497903,0.0006684541,0.0001711711,0.00208343,0.0001157068],"genre_scores_gemma":[0.1336319,0.000007974008,0.8658733,0.00009203474,0.00008170454,0.0001032265,0.00006687228,0.00009246011,0.00005046896],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1298403,"threshold_uncertainty_score":0.9998661,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000508955,0.0004692368,0.0005157354,0.0003043535,0.0008088443,0.0003462707,0.001790076,0.0002057541,0.00004308295],"category_scores_gemma":[0.0000812951,0.0005197172,0.0003018489,0.001374412,0.00006594566,0.0006097535,0.0001844126,0.0008741483,0.0001466495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001910476,"about_ca_system_score_gemma":0.000154077,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003057397,"about_ca_topic_score_gemma":0.00005196515,"domain_scores_codex":[0.9963939,0.0002883756,0.000691538,0.001232448,0.0005783882,0.0008153196],"domain_scores_gemma":[0.996429,0.0006767202,0.0002320978,0.002187132,0.0002766784,0.0001983986],"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.00001283392,0.0004154958,0.00006820374,0.00003689849,0.0001327532,0.0002670734,0.00166622,0.09230957,0.002117061,0.001669753,0.0003273966,0.9009767],"study_design_scores_gemma":[0.001435761,0.0003779333,0.0005705981,0.0003612337,0.00006268549,0.001107784,0.0001531016,0.953703,0.02018553,0.01916921,0.00150749,0.001365627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0058229,0.0001505764,0.9876208,0.002160358,0.001353846,0.0002668321,0.000003856598,0.002302643,0.000318233],"genre_scores_gemma":[0.4021503,0.00002195349,0.596533,0.000935166,0.0001018616,0.0000194197,0.000005295167,0.00003707446,0.0001959082],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8996111,"threshold_uncertainty_score":0.9997255,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003697803,0.0001807786,0.0001907644,0.00008842878,0.0006036359,0.0002571616,0.001346239,0.0000474623,0.000008664028],"category_scores_gemma":[0.00001113362,0.0001193603,0.00008084668,0.001101731,0.00005705333,0.0001972539,0.00004039057,0.0003118219,0.0002239448],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004620555,"about_ca_system_score_gemma":0.0000549636,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002830691,"about_ca_topic_score_gemma":0.00002576278,"domain_scores_codex":[0.9985189,0.0000833213,0.0002229737,0.0004077618,0.0003734759,0.0003935383],"domain_scores_gemma":[0.9985252,0.0002396575,0.00008513234,0.0009883882,0.0000871514,0.00007445823],"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.00005264743,0.00004871545,0.00003812278,0.00002262498,0.00008721674,0.0000333044,0.002039314,0.8783095,0.00005159901,0.002169966,0.004774195,0.1123727],"study_design_scores_gemma":[0.001776882,0.0006262911,0.002040494,0.0003058459,0.00002628124,0.0001254091,0.001019273,0.9122485,0.0005063075,0.001063739,0.07956933,0.0006916687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0131123,0.00003988541,0.9783697,0.006780135,0.0003045959,0.0002198175,0.00001207493,0.0006177807,0.000543732],"genre_scores_gemma":[0.9831998,0.000007458118,0.01588489,0.0002527437,0.00003795423,0.0000175147,0.000002027301,0.00001451021,0.000583097],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9700875,"threshold_uncertainty_score":0.4867371,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005434292,0.0003818256,0.0003306142,0.0005223714,0.0007756423,0.0006969869,0.0007878908,0.0001710401,0.0000109375],"category_scores_gemma":[0.00003867379,0.0003838436,0.000160015,0.00107959,0.00006923766,0.0004310523,0.00006153479,0.0006796393,0.00008474609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001437388,"about_ca_system_score_gemma":0.0001091512,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001971362,"about_ca_topic_score_gemma":0.000003035766,"domain_scores_codex":[0.9974107,0.0001773035,0.0005000863,0.001010593,0.0004100092,0.0004912802],"domain_scores_gemma":[0.9981244,0.000755342,0.0001020887,0.0007611975,0.00009513754,0.000161784],"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.00004207213,0.0002457316,0.00002586783,0.0001302704,0.0001020675,0.00004459492,0.00113584,0.7407441,0.0002356002,0.01149232,0.001049018,0.2447525],"study_design_scores_gemma":[0.0004165994,0.0003601692,0.0002078602,0.0004257885,0.0000172259,0.0000929184,0.00002773224,0.9902096,0.003823874,0.003082029,0.0009049143,0.0004313258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01158732,0.0003670695,0.9814714,0.001448746,0.0009290744,0.0004311524,0.000003982734,0.002676866,0.001084424],"genre_scores_gemma":[0.6767836,0.0001160268,0.3222595,0.0003287235,0.00009050198,0.00001631199,0.000003429318,0.00003213657,0.000369822],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6651962,"threshold_uncertainty_score":0.9998614,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004158293,0.0003326606,0.0003320919,0.000204155,0.0007362164,0.0007459834,0.001562696,0.0001315841,0.00005874526],"category_scores_gemma":[0.00002762275,0.0003178751,0.0002668194,0.001036606,0.00004275141,0.0005573474,0.00006331621,0.000472895,0.001197407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001291782,"about_ca_system_score_gemma":0.00011216,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000189701,"about_ca_topic_score_gemma":0.0001145408,"domain_scores_codex":[0.9975145,0.00007485122,0.0005364735,0.0008622152,0.0004230523,0.0005889438],"domain_scores_gemma":[0.9979907,0.0003836433,0.00008652843,0.001264836,0.00008389051,0.0001904138],"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.00003906626,0.000353046,0.0001301426,0.0003954326,0.0002911914,0.0003293349,0.003148071,0.9042389,0.00006487448,0.03996013,0.001637922,0.04941193],"study_design_scores_gemma":[0.0004830571,0.0001475875,0.0008423476,0.0004238089,0.00001814944,0.0001337381,0.00002802436,0.8580706,0.000118571,0.002275282,0.1370132,0.0004456009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01784446,0.0005132925,0.9737793,0.003208412,0.001574829,0.0003408022,0.0000162076,0.001171562,0.001551196],"genre_scores_gemma":[0.9639941,0.00003889231,0.03411574,0.0003065777,0.0001140253,0.00004171527,0.000006204173,0.00003078157,0.001351978],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9461496,"threshold_uncertainty_score":0.9999273,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003654975,0.0002401159,0.0002021705,0.0001664728,0.0008198852,0.0002386992,0.0009293311,0.00006488911,0.00002133653],"category_scores_gemma":[0.00002618133,0.0002226278,0.00007605088,0.0004038403,0.0001264811,0.0000405356,0.0001464112,0.0002480838,0.00008097186],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006722588,"about_ca_system_score_gemma":0.00002931447,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000278108,"about_ca_topic_score_gemma":0.0000297271,"domain_scores_codex":[0.9981605,0.00009277852,0.0003116135,0.0006819278,0.0003119732,0.0004412201],"domain_scores_gemma":[0.9985066,0.0002372225,0.00009605099,0.0009367215,0.00008764303,0.000135751],"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.00001632641,0.0001756436,0.00004872819,0.00004420046,0.00007044618,0.0000111936,0.001469159,0.8720812,0.00001330921,0.002296686,0.0005637394,0.1232094],"study_design_scores_gemma":[0.0006318349,0.0003689135,0.0005373454,0.00009906581,0.00002013707,0.00003703318,0.0002110952,0.9938102,0.00004100111,0.001175822,0.002743387,0.0003241169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04436951,0.00002666754,0.9512888,0.002414619,0.0003649579,0.0002875591,8.883639e-7,0.0004508571,0.0007961469],"genre_scores_gemma":[0.88634,0.000002096161,0.112731,0.0004373639,0.000135075,0.000008843818,7.068819e-7,0.00001496026,0.0003300506],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8419704,"threshold_uncertainty_score":0.9078498,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003549285,0.0002055168,0.0002098444,0.00007888233,0.0007394955,0.0001889369,0.0008109966,0.00008398108,0.00002359896],"category_scores_gemma":[0.00001279465,0.000195679,0.00007265621,0.0003223117,0.00007923653,0.0002786582,0.00006968318,0.0002071727,0.0001240111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005705536,"about_ca_system_score_gemma":0.00001975108,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001229889,"about_ca_topic_score_gemma":0.00002822206,"domain_scores_codex":[0.9983056,0.00008625173,0.0003406924,0.0005552261,0.0003287888,0.000383449],"domain_scores_gemma":[0.9988524,0.000122996,0.0001004847,0.000710166,0.0000748741,0.0001390496],"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.00006449432,0.0004817835,0.0001803336,0.00004408807,0.00009642755,0.0000171655,0.00249092,0.002150741,0.004152562,0.007331368,0.007555657,0.9754345],"study_design_scores_gemma":[0.003445032,0.001464664,0.002869541,0.000357046,0.00003672579,0.0001522096,0.0003921084,0.871937,0.002369508,0.003118903,0.1125404,0.001316819],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03575803,0.0001324722,0.961513,0.0009839515,0.0005734579,0.0001849077,0.000009900579,0.0002685195,0.0005757348],"genre_scores_gemma":[0.9406738,0.00001896744,0.05852177,0.0004939002,0.00010909,0.000008461006,0.000005801303,0.00001182653,0.0001564012],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9741176,"threshold_uncertainty_score":0.7979558,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000200446,0.0002300902,0.0002805758,0.0002103366,0.0006982062,0.00008360086,0.0002104637,0.00005219736,0.00006350458],"category_scores_gemma":[0.000002806166,0.0002296022,0.000313248,0.0006153916,0.00004136726,0.00009349346,0.000006781035,0.0002111459,0.00004571784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003789711,"about_ca_system_score_gemma":0.00005811256,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001425191,"about_ca_topic_score_gemma":0.000004634993,"domain_scores_codex":[0.9985504,0.00003659151,0.0003493557,0.0003801674,0.0002171249,0.000466415],"domain_scores_gemma":[0.9992988,0.0001855111,0.00008974552,0.0002477907,0.00008660457,0.00009158287],"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.000008091937,0.00006561076,0.00007704079,0.00001241254,0.0001330516,9.437041e-7,0.000522258,0.3839418,0.0005516987,0.00001351558,0.00001974593,0.6146538],"study_design_scores_gemma":[0.0008802301,0.0001475156,0.000209962,0.00004920517,0.0001218101,0.000003067015,0.0008295795,0.9963094,0.0003600581,0.0006907647,0.0001334045,0.0002649898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1606173,0.000008523141,0.8384891,0.0002298893,0.0001307887,0.000224909,0.00004653523,0.0001575846,0.00009540327],"genre_scores_gemma":[0.8018077,0.00000219235,0.1974121,0.00005306629,0.0002281396,0.00002843325,0.00009002061,0.00003812836,0.000340176],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6411904,"threshold_uncertainty_score":0.9362904,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001242835,0.0006051884,0.0007724563,0.0006332759,0.0004850532,0.001121471,0.003055501,0.0003437245,0.00004381627],"category_scores_gemma":[0.000022664,0.000672811,0.0004736125,0.0008163505,0.0001124657,0.0007299689,0.0005503821,0.002334896,0.00001717982],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000113367,"about_ca_system_score_gemma":0.0001794897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004791545,"about_ca_topic_score_gemma":0.0001395897,"domain_scores_codex":[0.995837,0.0004639968,0.0008925293,0.00152004,0.0005072257,0.0007791632],"domain_scores_gemma":[0.9966798,0.0004170334,0.0003283689,0.002296999,0.0001050867,0.0001726794],"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.000006849811,0.0003336099,0.0001488684,0.0001661889,0.0001709122,0.0002370508,0.002681863,0.5328857,0.0001706857,0.002012963,0.000003227553,0.4611821],"study_design_scores_gemma":[0.001445182,0.00008698383,0.002096549,0.002202785,0.0001052338,0.0002656695,0.001004471,0.8202501,0.001112072,0.1694683,0.00007133702,0.001891308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05298248,0.0002979836,0.9440471,0.0004548813,0.001298507,0.0003714474,0.00001626994,0.000356405,0.0001749074],"genre_scores_gemma":[0.7410623,0.00004480229,0.2583798,0.0003622949,0.00003789613,0.00002478152,0.00002952937,0.00003171256,0.00002683474],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6880799,"threshold_uncertainty_score":0.9999667,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003066127,0.0002362905,0.0002527343,0.0002455511,0.0003039012,0.0001932832,0.001626325,0.0001027284,0.0000803924],"category_scores_gemma":[0.00002425667,0.0002353865,0.0001510336,0.0005374205,0.00002839653,0.0003498959,0.00006098915,0.0003402763,0.0008581883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005496172,"about_ca_system_score_gemma":0.000052072,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001496863,"about_ca_topic_score_gemma":9.93439e-7,"domain_scores_codex":[0.998242,0.000103926,0.000341596,0.0005943545,0.0003124877,0.0004056887],"domain_scores_gemma":[0.9980438,0.0003078951,0.0001142375,0.001335022,0.00009406565,0.0001049372],"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.00001556804,0.0001921033,0.0003699819,0.00002182379,0.00005000586,0.000008163743,0.000531641,0.8402957,0.0002140546,0.01026918,0.0005618253,0.1474699],"study_design_scores_gemma":[0.0007132294,0.0002686772,0.0009305448,0.00008499359,0.000008186164,0.00004632478,0.000035626,0.9853842,0.001636435,0.006075701,0.004263272,0.0005527937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0132096,0.0000577552,0.9773346,0.0008851915,0.0005064488,0.0002515858,8.828128e-7,0.001651432,0.006102496],"genre_scores_gemma":[0.6041008,0.00001594075,0.3945696,0.0005997013,0.00002624017,0.000004603998,0.000001436634,0.00001408835,0.0006676288],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5908912,"threshold_uncertainty_score":0.9999198,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}