{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03195087,0.00034136212,0.9620119,0.00057646935,0.00006754024,0.00007548785,0.00018334044,0.00065805484,0.0041349675],"genre_scores_gemma":[0.78703547,0.00061797124,0.20589599,0.00020473411,0.00014502436,0.00012228264,0.00030685964,0.00016448903,0.0055071632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984176,0.00034560615,0.000096150274,0.0003919059,0.00045460538,0.00029402127],"domain_scores_gemma":[0.99764425,0.0009997947,0.00041022297,0.00059467065,0.0001890978,0.00016196296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013779984,0.0010485617,0.0011376977,0.0005866261,0.00083832163,0.0011997495,0.0020288466,0.0014030548,0.0027853055],"category_scores_gemma":[0.0058864183,0.0006267554,0.00087997137,0.0010745407,0.001185023,0.002517477,0.002038076,0.0013388775,0.0005116452],"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.00009117495,0.00003230696,0.00032029385,0.00009225004,0.0000245837,0.00007980402,0.00005965985,0.9493608,0.0038697226,0.02573308,0.001769078,0.018567214],"study_design_scores_gemma":[0.000011607117,0.000057704015,0.00018054781,0.000009609873,0.000009478731,0.00007189117,0.000034075805,0.97013915,0.0010384326,0.026959578,0.00147696,0.000010933325],"about_ca_topic_score_codex":0.0035814187,"about_ca_topic_score_gemma":0.004133332,"teacher_disagreement_score":0.0035814187,"about_ca_system_score_codex":0.0016695769,"about_ca_system_score_gemma":0.0014149992,"threshold_uncertainty_score":0.012113631},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030889275,0.0003208349,0.96021926,0.0003510368,0.00013425761,0.00022143194,0.00006689692,0.002330837,0.0054661646],"genre_scores_gemma":[0.4392828,0.00021573999,0.55075073,0.00025939572,0.000099347395,0.00040927823,0.0002217014,0.00034157123,0.008419463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839264,0.00036654132,0.00010537224,0.0003227907,0.0005316897,0.00028101113],"domain_scores_gemma":[0.9960751,0.0014997477,0.00033947578,0.0013073237,0.0006025024,0.00017585329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012385307,0.0008545662,0.001142134,0.0009219939,0.0016679508,0.0012790535,0.0020501348,0.0010703497,0.0042172996],"category_scores_gemma":[0.005561622,0.00039762037,0.0007174344,0.0011340566,0.001585799,0.0028109576,0.002421736,0.0014396076,0.0009963547],"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.0015318418,0.0003939051,0.003320701,0.0003633104,0.00015228393,0.00036386168,0.00088335254,0.1947221,0.030364081,0.21262608,0.013020845,0.54225767],"study_design_scores_gemma":[0.00023112306,0.00032724152,0.00039994682,0.000042391235,0.00007318446,0.00025816783,0.00010702049,0.81569713,0.03375153,0.12693746,0.022101102,0.000073698124],"about_ca_topic_score_codex":0.0026499878,"about_ca_topic_score_gemma":0.003966863,"teacher_disagreement_score":0.0042172996,"about_ca_system_score_codex":0.00096740155,"about_ca_system_score_gemma":0.0018356905,"threshold_uncertainty_score":0.014108241},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010232386,0.0007577539,0.9160229,0.00053394533,0.0006907078,0.00060492737,0.0013771923,0.044747528,0.025032664],"genre_scores_gemma":[0.18214463,0.0013480402,0.72223186,0.0021059394,0.00059621007,0.0022948526,0.005806941,0.024602342,0.058869217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960544,0.00080888136,0.00044587336,0.0006351508,0.0015251668,0.0005305148],"domain_scores_gemma":[0.99272233,0.0019747184,0.0005236165,0.0025967173,0.001652297,0.00053025474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039919387,0.0011108884,0.0010348443,0.0011331328,0.0018690731,0.00550975,0.00514635,0.001751286,0.025458658],"category_scores_gemma":[0.012989165,0.0013103904,0.0017253704,0.0013307724,0.0020224575,0.008047282,0.0064198244,0.0040099313,0.007704278],"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.0014488125,0.0005065439,0.00454558,0.0013403913,0.0001942784,0.00045956435,0.0013613767,0.018198034,0.01657829,0.5924062,0.115594745,0.24736612],"study_design_scores_gemma":[0.0003760015,0.00028458692,0.0006743386,0.00023562029,0.00010624281,0.0004679229,0.00018234242,0.0809977,0.029664982,0.22176406,0.6650587,0.00018746185],"about_ca_topic_score_codex":0.002692101,"about_ca_topic_score_gemma":0.0030261197,"teacher_disagreement_score":0.025458658,"about_ca_system_score_codex":0.0013199011,"about_ca_system_score_gemma":0.0040333816,"threshold_uncertainty_score":0.085167706},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013440857,0.00013340604,0.9756994,0.00045648165,0.00004389047,0.00027008244,0.0010970882,0.0065266276,0.0023320597],"genre_scores_gemma":[0.16903107,0.00023549062,0.82234496,0.00034054246,0.000049397444,0.000379941,0.0039356947,0.0012185145,0.0024643294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993026,0.0015686895,0.0006098966,0.0016961618,0.00251958,0.0005796941],"domain_scores_gemma":[0.98272437,0.009591994,0.0013835673,0.0039004195,0.0020489849,0.00035074633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032078854,0.0013656567,0.0013298221,0.0027339722,0.0017581041,0.004251257,0.004190778,0.0013131015,0.00625209],"category_scores_gemma":[0.025639992,0.001073674,0.00254038,0.0040526805,0.0020248804,0.008414513,0.00426001,0.0021908153,0.001955022],"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.00055932027,0.00037781653,0.007645614,0.0012333448,0.00027962917,0.00091766584,0.000644568,0.32374737,0.02333977,0.19585046,0.020577068,0.4248273],"study_design_scores_gemma":[0.000065323686,0.00005416877,0.00039628925,0.000055488264,0.000058983915,0.0001701038,0.00020234415,0.77128553,0.016757213,0.20278129,0.008131511,0.00004166141],"about_ca_topic_score_codex":0.011286127,"about_ca_topic_score_gemma":0.016654845,"teacher_disagreement_score":0.011286127,"about_ca_system_score_codex":0.0018267549,"about_ca_system_score_gemma":0.0047737225,"threshold_uncertainty_score":0.02244091},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018112734,0.00043033023,0.9750684,0.00015698273,0.0000979968,0.00010897597,0.00012259172,0.0026096243,0.0032922789],"genre_scores_gemma":[0.2495095,0.00039644187,0.7407058,0.0002250549,0.000090295085,0.00016893282,0.00058763276,0.00026977604,0.008046608],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995109,0.00007311468,0.000031731546,0.00010202687,0.00022958455,0.00005270689],"domain_scores_gemma":[0.9996044,0.000093466864,0.000040263058,0.000119079195,0.000119122014,0.000023664239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000382488,0.0005187975,0.0005216507,0.0006319995,0.00054651394,0.0008371933,0.001235023,0.0007423253,0.004436123],"category_scores_gemma":[0.0011899428,0.00036699168,0.00032300878,0.00070209283,0.0004458597,0.0013030544,0.00085925055,0.000999614,0.0022052943],"study_design_candidate":"bench_or_experimental","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.0008564641,0.0002146699,0.0011511846,0.00042861712,0.00013319297,0.00034281553,0.00027370895,0.11195671,0.24321021,0.041956116,0.008233617,0.59124273],"study_design_scores_gemma":[0.00010362839,0.00031291897,0.00041357178,0.00003670714,0.00005281399,0.0004988475,0.000032713175,0.7766895,0.18691427,0.010558927,0.024329085,0.000056973357],"about_ca_topic_score_codex":0.0016194523,"about_ca_topic_score_gemma":0.0020306585,"teacher_disagreement_score":0.004436123,"about_ca_system_score_codex":0.0005929089,"about_ca_system_score_gemma":0.0013381387,"threshold_uncertainty_score":0.014840364},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013540163,0.00017620486,0.98373485,0.00006687485,0.00002559748,0.000030766816,0.000044278866,0.0006643893,0.0017167602],"genre_scores_gemma":[0.35224584,0.00025139246,0.6437554,0.00007278268,0.00003793128,0.00017199811,0.00026231306,0.00054593757,0.0026565748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995053,0.00017382739,0.000018832694,0.0000448648,0.00021874985,0.00003841404],"domain_scores_gemma":[0.9990988,0.00045568278,0.00005038047,0.00019245975,0.00016651016,0.00003621143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006726146,0.0005681823,0.0007413374,0.00046971,0.00034956154,0.0005465257,0.001128911,0.00067183975,0.0018125837],"category_scores_gemma":[0.0026746667,0.00023988645,0.0005562381,0.0005433179,0.0005279842,0.00080711965,0.0010634789,0.0008952437,0.0008159641],"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.00012462834,0.00006881934,0.0008968315,0.0002263711,0.000054522618,0.00011576889,0.00017801317,0.8413858,0.02659681,0.026448308,0.0022704361,0.101633765],"study_design_scores_gemma":[0.000010447285,0.000016924336,0.000093679715,0.0000072959683,0.0000037657242,0.000015146256,0.000010871417,0.9920243,0.002967362,0.003766452,0.0010789516,0.000004731825],"about_ca_topic_score_codex":0.0026186884,"about_ca_topic_score_gemma":0.0038807015,"teacher_disagreement_score":0.0026186884,"about_ca_system_score_codex":0.00049472984,"about_ca_system_score_gemma":0.00073711947,"threshold_uncertainty_score":0.0060636997},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004425821,0.0013997834,0.95729125,0.00082573044,0.0011954065,0.00040165725,0.00055487273,0.01975848,0.01414713],"genre_scores_gemma":[0.17363942,0.0015508623,0.77130216,0.0020331938,0.0013084783,0.0008050192,0.0014923625,0.0057944832,0.04207405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963599,0.00050105294,0.00030047886,0.0004259598,0.0020157313,0.00039687558],"domain_scores_gemma":[0.9956189,0.0012691474,0.0003536873,0.001574973,0.0008955263,0.00028773927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026945919,0.0007683427,0.000766268,0.0014708857,0.0013796168,0.0025190734,0.002775881,0.0012831973,0.016665976],"category_scores_gemma":[0.012026248,0.0009067899,0.00087875896,0.0014325578,0.0027568345,0.006102153,0.0043017482,0.0030449415,0.003234364],"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.0007621953,0.00014946454,0.001384014,0.0005287585,0.000085534215,0.00014391998,0.00061733765,0.004198128,0.010219787,0.48103192,0.107149474,0.3937295],"study_design_scores_gemma":[0.00042393018,0.00033188416,0.0006709003,0.00014991038,0.00014000236,0.00046256615,0.00013391774,0.045907017,0.023299422,0.1199073,0.8084423,0.000130903],"about_ca_topic_score_codex":0.00423838,"about_ca_topic_score_gemma":0.00544446,"teacher_disagreement_score":0.016665976,"about_ca_system_score_codex":0.0012694442,"about_ca_system_score_gemma":0.0031945596,"threshold_uncertainty_score":0.05575323},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026383353,0.00009929763,0.99251634,0.00010595631,0.00007182618,0.000065349355,0.000064339525,0.0024636942,0.0019748039],"genre_scores_gemma":[0.045830853,0.00013453403,0.94816446,0.000073329975,0.000043158652,0.00025601068,0.0003119341,0.0006027215,0.0045830887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994406,0.00004774158,0.00003675011,0.00008032874,0.00032547885,0.00006915445],"domain_scores_gemma":[0.99934584,0.0002116632,0.000041944917,0.000107514956,0.0002467999,0.000046233978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005361389,0.0010940582,0.000977241,0.0007340166,0.00090494927,0.0011766002,0.0015501229,0.0011830527,0.011118819],"category_scores_gemma":[0.0023434935,0.0005175716,0.00078447716,0.00084480294,0.0007218021,0.00137476,0.0015595728,0.0019006078,0.005226171],"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.00022783097,0.0001395838,0.0010233711,0.00031311557,0.000063420535,0.00040118425,0.00037972062,0.20984097,0.029724155,0.07649024,0.025481535,0.6559149],"study_design_scores_gemma":[0.00007201264,0.000046799985,0.00014538756,0.000021894166,0.000008119739,0.00014071181,0.00003972996,0.9616537,0.009384963,0.012521358,0.01593703,0.000028291091],"about_ca_topic_score_codex":0.00439015,"about_ca_topic_score_gemma":0.004939056,"teacher_disagreement_score":0.011118819,"about_ca_system_score_codex":0.00075200544,"about_ca_system_score_gemma":0.0020535765,"threshold_uncertainty_score":0.03719622},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5040509,0.00080624555,0.41642678,0.0003772134,0.00024386746,0.00022099083,0.0014164113,0.066272505,0.010184958],"genre_scores_gemma":[0.89469546,0.00021082434,0.09904346,0.0001097263,0.00003087352,0.00010161224,0.0012538208,0.0016380011,0.0029163347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983753,0.00028246385,0.000079693105,0.00025703767,0.00077272777,0.00023263755],"domain_scores_gemma":[0.99680436,0.0009750545,0.00026527324,0.0012721367,0.00051568064,0.0001675304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058113434,0.00086345273,0.00056646037,0.0010991713,0.00064869184,0.0010419571,0.0016210929,0.0005340152,0.0026109074],"category_scores_gemma":[0.005520784,0.0004997584,0.000336043,0.0015853001,0.000655866,0.0012907664,0.00091658003,0.0010046153,0.0011636879],"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.002330378,0.0007393068,0.033699732,0.00069279387,0.0001732115,0.0008834052,0.0014575813,0.074985504,0.3482297,0.013942485,0.024469769,0.49839607],"study_design_scores_gemma":[0.00009560247,0.0004934851,0.016796568,0.00006605746,0.00006626056,0.00038515637,0.00026712072,0.6077432,0.3504131,0.0052206065,0.01834088,0.00011187736],"about_ca_topic_score_codex":0.005283982,"about_ca_topic_score_gemma":0.0069191386,"teacher_disagreement_score":0.005283982,"about_ca_system_score_codex":0.0009564989,"about_ca_system_score_gemma":0.0014421832,"threshold_uncertainty_score":0.010506451},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074875816,0.00029157812,0.9712828,0.00059836847,0.00032479252,0.00029502754,0.00012532464,0.003601486,0.015993139],"genre_scores_gemma":[0.24972124,0.00047995837,0.70953393,0.0009966474,0.00032692135,0.0006502333,0.0003548965,0.0020519376,0.035884287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945904,0.0008055785,0.00034570514,0.0011769123,0.0025495172,0.0005318933],"domain_scores_gemma":[0.99302214,0.001956225,0.00040098323,0.0028677525,0.0014836898,0.0002692295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036840898,0.0009438152,0.00079605076,0.00097631925,0.001593579,0.0041936645,0.0029271506,0.0015131594,0.009267497],"category_scores_gemma":[0.010184953,0.00077778724,0.001309277,0.0007746499,0.004033491,0.0052540596,0.0029664102,0.004436599,0.0039561964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00044666423,0.00018324824,0.0008598511,0.00037748733,0.000058535756,0.00038287064,0.0009462431,0.01515073,0.019417135,0.83157474,0.009577423,0.12102511],"study_design_scores_gemma":[0.0003021715,0.000440203,0.0003885565,0.0002073434,0.00015415729,0.0012023681,0.00023736879,0.16526437,0.085795894,0.46799886,0.27785885,0.00014988105],"about_ca_topic_score_codex":0.002354263,"about_ca_topic_score_gemma":0.001856367,"teacher_disagreement_score":0.009267497,"about_ca_system_score_codex":0.0016257084,"about_ca_system_score_gemma":0.004258813,"threshold_uncertainty_score":0.03100288},"labels":[],"label_agreement":null}]}