{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":2094,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":2094,"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":"17f67e24d851","filters":{"topic":"Parallel Computing and Optimization Techniques"}},"results":[{"id":"W2147657366","doi":"10.1145/2024716.2024718","title":"The gem5 simulator","year":2011,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4858,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"x86; Computer science; ARM architecture; Booting; Operating system; Embedded system; Software","retraction":null,"screen_n_in":null,"score":{"opus":0.02500028102197819,"gpt":0.2505314914940309,"spread":0.2255312104720527,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004595835,0.0002899439,0.0002279444,0.0001527392,0.0005787532,0.000302617,0.004884156,0.0000929907,0.00001065549],"category_scores_gemma":[0.0001368464,0.000193441,0.000160647,0.000486732,0.0001438116,0.0001788293,0.002090631,0.0004545712,0.00006563912],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002956598,"about_ca_system_score_gemma":0.00008530447,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005464482,"about_ca_topic_score_gemma":0.00002081149,"domain_scores_codex":[0.9977067,0.0002713056,0.000382151,0.0006172374,0.0004108942,0.0006117248],"domain_scores_gemma":[0.9964881,0.0007325506,0.0001369667,0.002313611,0.0001321942,0.0001965895],"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.00002600575,0.00009980442,0.0007942894,0.00001142103,0.00007017146,0.00003758199,0.004714817,0.01747379,0.00005726565,0.02359626,0.01743976,0.9356788],"study_design_scores_gemma":[0.0007791558,0.0006462273,0.005182208,0.00005526304,0.00001368604,0.0001359091,0.00001232948,0.623934,0.002776822,0.1728922,0.192702,0.0008702024],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001665531,0.0001650128,0.9908286,0.001993174,0.0005966055,0.0003099284,7.523847e-7,0.001169415,0.003270962],"genre_scores_gemma":[0.2023649,0.00003846549,0.7949302,0.002038797,0.0003627944,0.00002542691,0.000001959779,0.0000257248,0.0002117088],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9348086,"threshold_uncertainty_score":0.9076059,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1979527452","doi":"10.1109/ispass.2009.4919648","title":"Analyzing CUDA workloads using a detailed GPU simulator","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1660,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parallel computing; CUDA; Thread (computing); Graphics; Microarchitecture; Instruction set; SIMD; Computer architecture; General-purpose computing on graphics processing units; Memory bandwidth; Multithreading; Supercomputer; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.02341184931854888,"gpt":0.2874748231294658,"spread":0.2640629738109169,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000203527,0.0001169843,0.0001445777,0.0001468916,0.0001467951,0.0002087611,0.0005448899,0.00005375545,0.00001543553],"category_scores_gemma":[0.00002917447,0.0001051253,0.00006590071,0.0006159978,0.00001159611,0.0003232539,0.00009479052,0.00008826194,0.00001552212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003743164,"about_ca_system_score_gemma":0.0000403468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006464707,"about_ca_topic_score_gemma":7.382537e-7,"domain_scores_codex":[0.9990747,0.00004420473,0.0002082672,0.00028854,0.0001408165,0.0002435029],"domain_scores_gemma":[0.9993235,0.00004069563,0.00007027794,0.0004081262,0.00007515652,0.00008222111],"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.000009347455,0.0001597051,0.005020057,0.000006071372,0.0000308094,0.00002985814,0.0003667141,0.8296558,0.003024111,0.04948017,0.001928706,0.1102886],"study_design_scores_gemma":[0.0001168721,0.00003347213,0.0004764264,0.00001850285,0.000003166497,0.000005335117,0.000002120941,0.9939107,0.002565891,0.002449085,0.0002626865,0.0001557888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01575521,0.0001053433,0.9792586,0.0002766346,0.00006298172,0.00007117546,6.333268e-8,0.001031239,0.003438726],"genre_scores_gemma":[0.5563518,0.00000427637,0.4430777,0.0003740827,0.00002746367,3.722279e-7,2.343922e-7,0.000002728667,0.0001613195],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5405967,"threshold_uncertainty_score":0.4286884,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1606347560","doi":"10.48550/arxiv.1211.5590","title":"Theano: new features and speed improvements","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1041,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Compiler; Computer science; Implementation; Computation; Linear algebra; Speedup; Artificial neural network; Parallel computing; Computer architecture; Artificial intelligence; Computer engineering; Programming language; Theoretical computer science; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0549112386365422,"gpt":0.2015849026973034,"spread":0.1466736640607612,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001671535,0.0002424878,0.0002194304,0.0001635252,0.0001206764,0.0001635938,0.001117845,0.0002176579,0.00001113231],"category_scores_gemma":[0.00001399704,0.0002595617,0.00008583372,0.0002315854,0.00004770957,0.0002785283,0.002179473,0.0003651902,0.00001750489],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006912046,"about_ca_system_score_gemma":0.0001119849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002479473,"about_ca_topic_score_gemma":0.000006465228,"domain_scores_codex":[0.9987674,0.00007058073,0.000122937,0.0006788161,0.00006941148,0.0002908986],"domain_scores_gemma":[0.9987319,0.00003940789,0.0001749979,0.0007753906,0.00006547863,0.0002127878],"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.00008521174,0.0003890895,0.01434552,0.0002738845,0.0004678959,0.0001932067,0.002459629,0.2444116,0.0003497544,0.6569602,0.04634786,0.03371615],"study_design_scores_gemma":[0.001244146,0.0001198686,0.00990074,0.000209511,0.0001206668,0.00002254896,0.00003951364,0.8322464,0.00165613,0.1499198,0.003023126,0.001497482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02601833,0.0003197506,0.9666302,0.0001458037,0.0004415145,0.0002374675,0.00000312432,0.0006259179,0.005577864],"genre_scores_gemma":[0.9679459,0.000277906,0.02559421,0.0001914498,0.0001156863,1.585174e-7,0.000007411789,0.00001306175,0.005854257],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9419276,"threshold_uncertainty_score":0.9999856,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2080696000","doi":"10.1145/1925805.1925818","title":"Soot","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":939,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Bytecode; Java bytecode; Computer science; Programming language; Java; Representation (politics); Compiler; Intermediate language; Interpreter; Java annotation; Real time Java","retraction":null,"screen_n_in":null,"score":{"opus":0.00963409680639174,"gpt":0.2490440089576179,"spread":0.2394099121512261,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008662203,0.00002974497,0.00002824188,0.00002921279,0.0000406172,0.00006194642,0.0003949266,0.00002179806,0.00003853174],"category_scores_gemma":[0.00001374767,0.00002441201,0.0000137874,0.00009650482,0.000009237885,0.0001061315,0.00008488899,0.00007023141,0.00007232624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001206694,"about_ca_system_score_gemma":0.00001192339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004958169,"about_ca_topic_score_gemma":0.000002525865,"domain_scores_codex":[0.999723,0.000005370799,0.00004836683,0.000097822,0.00005395881,0.00007155191],"domain_scores_gemma":[0.9996693,0.00001424302,0.00001219754,0.0002494971,0.00002574247,0.00002904089],"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":[1.567136e-7,0.00001558726,0.0002871188,5.697028e-7,0.000001123588,0.000001198075,0.00004656363,0.00008357841,0.001968283,0.9463028,0.01559359,0.03569939],"study_design_scores_gemma":[0.0001293591,0.00003219787,0.001749475,0.000001848804,6.268347e-7,0.00002398466,0.000001601991,0.8210303,0.04133252,0.03840244,0.09707722,0.0002184696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001560153,0.000001917382,0.896332,0.0005889677,0.0001687933,0.00001755787,2.133787e-8,0.0008197431,0.1005109],"genre_scores_gemma":[0.4001338,6.036748e-7,0.5984114,0.0003101668,0.00001980683,0.000001038483,1.122063e-7,0.000001104732,0.001121983],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9079004,"threshold_uncertainty_score":0.09954928,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976203248","doi":"10.1021/ct300857j","title":"OpenMM 4: A Reusable, Extensible, Hardware Independent Library for High Performance Molecular Simulation","year":2012,"lang":"en","type":"article","venue":"Journal of Chemical Theory and Computation","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":750,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Advanced Micro Devices (Canada)","funders":"National Institute of General Medical Sciences","keywords":"Computer science; Extensibility; CUDA; Graphics; Software; Computer architecture; Implementation; Range (aeronautics); Integrator; Supercomputer; Embedded system; Operating system; Software engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01443208097642334,"gpt":0.2713628190157039,"spread":0.2569307380392805,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007033856,0.00009691226,0.0001657805,0.00009562236,0.00005899893,0.0001021987,0.0002438154,0.00006846277,0.000003151229],"category_scores_gemma":[0.0001086404,0.00008379319,0.0000499966,0.0001488152,0.00002253647,0.001370164,0.0001034072,0.0001245963,8.843608e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001629955,"about_ca_system_score_gemma":0.00003332948,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.051248e-7,"about_ca_topic_score_gemma":9.614016e-10,"domain_scores_codex":[0.9991331,0.0001021714,0.0003262884,0.0001128621,0.0001769653,0.0001486126],"domain_scores_gemma":[0.998989,0.0003512606,0.000288559,0.00009741769,0.0001799359,0.00009380659],"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.0008215614,0.000410975,0.001074682,0.0002027903,0.0001257207,0.000009333056,0.001206669,0.5681958,0.01437866,0.2043381,0.001565284,0.2076705],"study_design_scores_gemma":[0.001042827,0.0002672414,0.001089871,0.0001480842,0.00003140495,0.0001014662,0.00001521515,0.7148445,0.1606863,0.1210511,0.0004612397,0.0002608037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3229299,0.0002527699,0.6764011,0.0001058713,0.00009665191,0.00007872132,5.372008e-7,0.0000471322,0.00008726512],"genre_scores_gemma":[0.8343868,0.00002090776,0.165183,0.0002684024,0.0001046268,0.000002379942,0.000004239816,0.00000800611,0.00002166934],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5114568,"threshold_uncertainty_score":0.3416987,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2160428323","doi":"10.1109/micro.2007.30","title":"Dynamic Warp Formation and Scheduling for Efficient GPU Control Flow","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":727,"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":"","keywords":"Computer science; SIMD; Parallel computing; Control flow; Instruction set; Overhead (engineering); Scheduling (production processes); Graphics; Computer architecture; Embedded system; Operating system; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.00861684684107671,"gpt":0.2552551377058643,"spread":0.2466382908647876,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006039584,0.0000681443,0.00008009531,0.00009254932,0.0001308629,0.0000877322,0.000169864,0.00003818264,9.275765e-7],"category_scores_gemma":[0.00003652702,0.00005939133,0.00002686509,0.0001126492,0.0000126922,0.0001485156,0.00004324449,0.00003833267,0.000002609793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002582123,"about_ca_system_score_gemma":0.00001093121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001915435,"about_ca_topic_score_gemma":0.000002387539,"domain_scores_codex":[0.9993921,0.00001112725,0.0001717301,0.0001577594,0.00008985672,0.000177428],"domain_scores_gemma":[0.9995568,0.0001164032,0.00005252056,0.0001422191,0.00008433688,0.00004771815],"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.00003025462,0.00006973612,0.00007140617,0.00004520603,0.00001347401,0.00000172975,0.0007528592,0.7082294,0.0009105456,0.05713686,0.0003600056,0.2323785],"study_design_scores_gemma":[0.0004025054,0.00004222662,0.0001277276,0.000009093666,0.000001942074,0.000006108875,0.00001025525,0.9968829,0.001347546,0.0008169822,0.0002704783,0.00008225004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0053651,0.00007227235,0.9928263,0.0003426,0.00008551082,0.0002390562,6.312409e-7,0.0004391553,0.0006293186],"genre_scores_gemma":[0.4840815,0.000002758675,0.515694,0.0001739053,0.000006739163,0.000003797046,0.000001273119,0.00000216449,0.00003385348],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4787164,"threshold_uncertainty_score":0.2421908,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964784760","doi":"10.1088/1742-6596/256/1/012026","title":"SciNet: Lessons Learned from Building a Power-efficient Top-20 System and Data Centre","year":2010,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":516,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Data center; Power (physics); State (computer science); Efficient energy use; Research centre; Point (geometry); Operating system; Architectural engineering; Engineering; Electrical engineering; Library science","retraction":null,"screen_n_in":null,"score":{"opus":0.05157731895243441,"gpt":0.3030222129466453,"spread":0.2514448939942109,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003636263,0.0001336395,0.0002543704,0.00006263931,0.0001512028,0.0004496459,0.001256042,0.0000534077,0.000004830378],"category_scores_gemma":[0.00006750665,0.0001128656,0.00003746699,0.0001752502,0.00008150574,0.0007100469,0.0004372834,0.0003351787,0.000001837678],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001436634,"about_ca_system_score_gemma":0.000185839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001782561,"about_ca_topic_score_gemma":0.000005336235,"domain_scores_codex":[0.9989151,0.00006176753,0.0003017652,0.0002753831,0.0002726732,0.0001732841],"domain_scores_gemma":[0.9984579,0.00008070417,0.0003980926,0.0006141792,0.0003416894,0.0001074389],"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.0000344323,0.0001294227,0.0005528666,0.00004167043,0.00007954815,0.00004276234,0.003443888,0.003505358,0.0599466,0.807538,0.0009294929,0.1237559],"study_design_scores_gemma":[0.00114166,0.0003325498,0.001580814,0.000825862,0.00007004193,0.0002300431,0.001698647,0.744102,0.2001446,0.04121602,0.007824415,0.0008333067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06785494,0.00007065178,0.9289291,0.002103187,0.0004553824,0.00005126918,0.00001860749,0.0000978527,0.0004190053],"genre_scores_gemma":[0.8396983,0.00002387199,0.1600814,0.00002809233,0.000134058,2.775908e-7,0.000003048036,0.000005983782,0.00002495115],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7718433,"threshold_uncertainty_score":0.4602525,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098278566","doi":"10.1145/1735970.1736036","title":"Addressing shared resource contention in multicore processors via scheduling","year":2010,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":511,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scheduling (production processes); Distributed computing; Workload; Multi-core processor; Thread (computing); Gang scheduling; Shared memory; Cache; Fair-share scheduling; Parallel computing; Quality of service; Two-level scheduling; Operating system; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.03583677900696412,"gpt":0.2961899832905564,"spread":0.2603532042835923,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005965667,0.0003483513,0.0003671495,0.0005634263,0.0002544684,0.0004568528,0.002671339,0.000205647,0.000009469763],"category_scores_gemma":[0.0003570384,0.000323881,0.0001281211,0.0008106343,0.0001041999,0.0003825691,0.001291146,0.001264666,0.00001362378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003961035,"about_ca_system_score_gemma":0.00009370051,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008702186,"about_ca_topic_score_gemma":0.0001642326,"domain_scores_codex":[0.9971997,0.0002224208,0.0005568389,0.0009120731,0.0004728709,0.0006360968],"domain_scores_gemma":[0.9976546,0.0004256958,0.0002196128,0.001335859,0.0001632235,0.0002009949],"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.00004434001,0.0002315556,0.005615556,0.00009795051,0.00002888508,0.00007257369,0.005559814,0.1253448,0.01192146,0.0008794933,0.0007777648,0.8494258],"study_design_scores_gemma":[0.000978102,0.0001221367,0.00504016,0.0002361143,0.00000489834,0.00009334418,0.00001175694,0.9791233,0.00281495,0.007675485,0.003413245,0.000486516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07983054,0.00005629673,0.9160228,0.002070299,0.0003417424,0.0004443374,0.00000136185,0.0008999381,0.0003326581],"genre_scores_gemma":[0.4172905,0.000002255767,0.5817139,0.0006830686,0.0002249908,0.00002570026,0.00001311854,0.00002187723,0.00002460978],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8537785,"threshold_uncertainty_score":0.9999213,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2093043622","doi":"10.1145/2485922.2485964","title":"GPUWattch","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":498,"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":"Division of Computer and Network Systems; Advanced Micro Devices; Division of Computing and Communication Foundations; Intel Corporation","keywords":"Computer science; Frequency scaling; General-purpose computing on graphics processing units; Kernel (algebra); Energy consumption; Parallel computing; Clock gating; Efficient energy use; CUDA; Dynamic demand; Metric (unit); Performance metric; Embedded system; Power (physics); Graphics; Operating system; Clock skew; Clock signal","retraction":null,"screen_n_in":null,"score":{"opus":0.01162104043311467,"gpt":0.2333242383252962,"spread":0.2217031978921815,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004526386,0.00003503253,0.00003498262,0.00003094867,0.00003582453,0.0001130579,0.0003726968,0.00001608073,0.0001354845],"category_scores_gemma":[0.000006772532,0.00002755561,0.00001455714,0.0001215453,0.000006485076,0.0002505445,0.0000987388,0.00002664905,0.0006671633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004539612,"about_ca_system_score_gemma":0.000007502975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003645936,"about_ca_topic_score_gemma":1.943221e-7,"domain_scores_codex":[0.9996698,0.00001113517,0.00006183269,0.0001057577,0.00006116102,0.00009029511],"domain_scores_gemma":[0.9996728,0.00001495,0.00001322785,0.0002215088,0.00004458617,0.00003295766],"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":[1.452028e-7,0.00004216981,0.0008605497,0.00000273423,0.000005323705,0.000001309148,0.0001689384,0.000906986,0.0004382414,0.5098858,0.3405894,0.1470984],"study_design_scores_gemma":[0.00007560816,0.0000270449,0.002398752,0.000003031319,3.347617e-7,0.000006361272,0.000003593966,0.9446083,0.005930644,0.03475029,0.01205114,0.0001449029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006226597,0.000009126593,0.8999899,0.001327827,0.00004349774,0.00004650567,1.024071e-8,0.0008336453,0.09712683],"genre_scores_gemma":[0.3553827,0.000002631258,0.6403761,0.0007876821,0.00001151136,0.00000769763,1.636333e-7,0.000001564769,0.003429913],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9437013,"threshold_uncertainty_score":0.8575258,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2110195531","doi":"10.1109/ispass.2010.5452013","title":"Demystifying GPU microarchitecture through microbenchmarking","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":447,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"CUDA; Computer science; Speedup; Parallel computing; Suite; Graphics; Microarchitecture; General-purpose computing on graphics processing units; Architecture; Abstraction; Correctness; Computer architecture; Coprocessor; Computation; Computer graphics (images); Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01231577622013279,"gpt":0.2568736384592354,"spread":0.2445578622391027,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000197972,0.0001278789,0.000109885,0.00007234953,0.0002084974,0.0002120491,0.0009147834,0.00009066064,0.0000479472],"category_scores_gemma":[0.00003737633,0.0001097891,0.00005672671,0.0002948178,0.00004001965,0.0002493704,0.0002983424,0.000338622,0.00003161083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000861892,"about_ca_system_score_gemma":0.00003615651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003558906,"about_ca_topic_score_gemma":0.00001459066,"domain_scores_codex":[0.9990802,0.00003051492,0.000171376,0.0003391765,0.0001192624,0.0002594901],"domain_scores_gemma":[0.9992719,0.00006891047,0.0000617001,0.0004897394,0.00005676521,0.0000510186],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000005743967,0.0001290908,0.001752144,0.0000376095,0.00003591879,0.00002842077,0.003186767,0.002998668,0.3835478,0.4355811,0.02649738,0.1461994],"study_design_scores_gemma":[0.0006213055,0.0000825271,0.001420946,0.00006718053,0.000009441254,0.0004409812,0.00002595071,0.2886967,0.4116576,0.08778209,0.2079394,0.001255871],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006944655,0.00004568155,0.9613798,0.001398964,0.0003858091,0.00008189215,2.674538e-7,0.001069855,0.02869308],"genre_scores_gemma":[0.3359655,0.000004635727,0.6628664,0.0008065273,0.0000608575,0.00000296823,0.000001138657,0.000006046568,0.0002859462],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3477989,"threshold_uncertainty_score":0.447707,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2047060659","doi":"10.1109/micro.2012.16","title":"Cache-Conscious Wavefront Scheduling","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":419,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Advanced Micro Devices (Canada); University of British Columbia","funders":"Yale University; Advanced Micro Devices","keywords":"Computer science; Cache; Parallel computing; Cache algorithms; Thrashing; Cache invalidation; Scheduling (production processes); Smart Cache; Page cache; Cache pollution; Cache coloring; CPU cache; Distributed computing","retraction":null,"screen_n_in":null,"score":{"opus":0.01988670299464207,"gpt":0.2596949999905748,"spread":0.2398082969959327,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003011334,0.00007636543,0.00007792413,0.00006167909,0.00009460752,0.00006960174,0.0004095278,0.00003916587,0.00002249937],"category_scores_gemma":[0.00002868256,0.00006549086,0.00003328546,0.0001521305,0.00001526462,0.0003854805,0.0001755742,0.00007136041,0.0001280286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002272769,"about_ca_system_score_gemma":0.00002066662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001857675,"about_ca_topic_score_gemma":8.568642e-7,"domain_scores_codex":[0.9993148,0.00003296758,0.0001208435,0.0001416448,0.0001158484,0.000273886],"domain_scores_gemma":[0.9994717,0.00003482029,0.00003574987,0.0003147039,0.00003836919,0.0001046254],"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.000003596019,0.0003354576,0.01815059,0.00001769515,0.00004126886,0.000006259694,0.003083574,0.01165344,0.001032317,0.8201663,0.02556663,0.1199428],"study_design_scores_gemma":[0.000246882,0.00004318656,0.002396661,0.00001525492,0.000004649949,0.00004783898,0.00002959786,0.9602991,0.01556087,0.003650641,0.01725312,0.0004521694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002874069,0.0002501426,0.9645149,0.0003876621,0.000239945,0.00005173739,8.233279e-8,0.000997112,0.0306844],"genre_scores_gemma":[0.5049955,0.000004742746,0.4940328,0.0003373551,0.00005143399,0.000002479755,3.440858e-7,0.000002791165,0.0005725258],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9486457,"threshold_uncertainty_score":0.267064,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108801243","doi":"10.1109/tpds.2008.105","title":"The Design of OpenMP Tasks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":387,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Scalability; Flexibility (engineering); Exploit; Human multitasking; Parallelism (grammar); Key (lock); Computer architecture; Set (abstract data type); Parallel computing; Distributed computing; Programming language; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.02456869289260105,"gpt":0.2536215729391721,"spread":0.2290528800465711,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000385074,0.0001368315,0.0001898651,0.00005946228,0.0003955044,0.0001842952,0.0004727885,0.0000727998,8.298766e-7],"category_scores_gemma":[0.000006531815,0.00009562152,0.00005497071,0.0002948896,0.00005367794,0.0001511948,0.000002257048,0.0001226262,0.000005068492],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002038716,"about_ca_system_score_gemma":0.00003951365,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002130059,"about_ca_topic_score_gemma":8.530575e-7,"domain_scores_codex":[0.998863,0.0001727699,0.0003299743,0.0002346722,0.0001968096,0.0002027304],"domain_scores_gemma":[0.9990807,0.0002052088,0.0001230011,0.0004131838,0.00009862542,0.00007934017],"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.00002841993,0.00007420064,0.000002350063,0.000005643486,0.00001836387,0.00000206904,0.00007139816,0.9853373,0.0001259945,0.005499585,0.001678329,0.007156303],"study_design_scores_gemma":[0.0004249692,0.0003570194,0.0001077611,0.00004867154,0.00001095235,0.00003232759,0.00004100341,0.9955909,0.000701873,0.001044476,0.001454945,0.0001851296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001032552,0.000382062,0.9980537,0.0004570878,0.0002295598,0.0003089228,0.00001781829,0.0002191823,0.0002283619],"genre_scores_gemma":[0.9861876,0.000234297,0.01327275,0.00005383329,0.00001208587,0.00002632135,0.000002641878,0.000003899868,0.0002065788],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9860843,"threshold_uncertainty_score":0.3899332,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1958945689","doi":"10.1109/hpca.1998.650541","title":"The potential for using thread-level data speculation to facilitate automatic parallelization","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":347,"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","keywords":"Computer science; Compiler; Parallel computing; Speculation; Thread (computing); Speculative multithreading; Correctness; Exploit; Cache coherence; Cache; Multithreading; Speculative execution; Multiprocessing; Chip; Computer architecture; CPU cache; Programming language; Cache algorithms","retraction":null,"screen_n_in":null,"score":{"opus":0.223990135150863,"gpt":0.320554106465231,"spread":0.09656397131436803,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003892274,0.00009702583,0.00008660649,0.00006098928,0.0004088909,0.0003185695,0.001058692,0.00003429673,0.00001148391],"category_scores_gemma":[0.0001102713,0.00007186735,0.00003001684,0.000260833,0.00001661263,0.0004299205,0.0003322347,0.00003378879,0.00002498269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000286862,"about_ca_system_score_gemma":0.00001483921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002146118,"about_ca_topic_score_gemma":0.000009759729,"domain_scores_codex":[0.9989772,0.00004991441,0.0002501481,0.0003250431,0.0001928579,0.000204804],"domain_scores_gemma":[0.9988098,0.00009307419,0.00007466145,0.0008536356,0.0001178181,0.00005099865],"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.000006668413,0.00008199431,0.00005405342,0.00002514968,0.00003880901,0.000001654934,0.0008104129,0.5990167,0.0002257768,0.1307222,0.04514218,0.2238744],"study_design_scores_gemma":[0.000113419,0.00002515956,0.0001700294,0.000008138933,0.000004148001,0.000003917873,0.000008099567,0.9920245,0.00007799752,0.005275779,0.002180794,0.0001080657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007020386,0.00005053374,0.9962155,0.001449304,0.0001627996,0.0004115958,0.000007494596,0.0004526654,0.000548101],"genre_scores_gemma":[0.09206454,0.00001387202,0.9065561,0.0002292103,0.00004624335,0.00001115388,0.00002072114,0.000007015658,0.001051185],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3930077,"threshold_uncertainty_score":0.31449,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4240262711","doi":"10.1145/1736020.1736036","title":"Addressing shared resource contention in multicore processors via scheduling","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":344,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scheduling (production processes); Distributed computing; Workload; Multi-core processor; Gang scheduling; Thread (computing); Shared memory; Cache; Processor scheduling; Fair-share scheduling; Dynamic priority scheduling; Parallel computing; Quality of service; Two-level scheduling; Operating system; Resource (disambiguation); Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.04936813286589711,"gpt":0.3051726721502294,"spread":0.2558045392843323,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003403355,0.00009380038,0.0001065489,0.0001606901,0.00009965518,0.0001999249,0.0005106737,0.00008280004,0.00001442805],"category_scores_gemma":[0.0001307312,0.00008676093,0.00002981371,0.000350223,0.00002527763,0.0004006711,0.0001434037,0.0002524082,0.00001065353],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001365932,"about_ca_system_score_gemma":0.00002650299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003792387,"about_ca_topic_score_gemma":0.00003637587,"domain_scores_codex":[0.9991044,0.00003354781,0.0002206324,0.00029564,0.0001485196,0.0001972457],"domain_scores_gemma":[0.9994478,0.00004593838,0.00008373996,0.0002797742,0.00008928293,0.00005343516],"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.00008361356,0.001119101,0.05631518,0.0002750075,0.00004409232,0.0001002658,0.0100644,0.1306788,0.1536525,0.06834473,0.002905386,0.5764169],"study_design_scores_gemma":[0.0002514873,0.00001267447,0.002052197,0.0000526788,7.803631e-7,0.000006857177,0.00001958722,0.9897052,0.006669715,0.0007929776,0.0003059413,0.000129895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06319378,0.00001988798,0.932258,0.0003432972,0.0000882384,0.0001220565,1.596364e-7,0.0006648217,0.003309724],"genre_scores_gemma":[0.592195,6.939415e-7,0.4074965,0.0001335698,0.00001808175,0.000006732712,0.00000210606,0.000004533593,0.0001426878],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8590264,"threshold_uncertainty_score":0.3538008,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078994750","doi":"10.1109/iiswc.2010.5650274","title":"A characterization of the Rodinia benchmark suite with comparison to contemporary CMP workloads","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":296,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of British Columbia; George Mason University; Nvidia; National Science Foundation","keywords":"Rodinia; Benchmark (surveying); Parsec; Suite; Computer science; Parallel computing","retraction":null,"screen_n_in":null,"score":{"opus":0.01421237094159148,"gpt":0.2461461309164161,"spread":0.2319337599748247,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002208508,0.0001001693,0.0001503448,0.00007596863,0.00009001377,0.0000860385,0.0008054355,0.00004957976,0.00001434137],"category_scores_gemma":[0.00002398349,0.00006221854,0.00003256155,0.0005855313,0.00004015415,0.0002004363,0.0002153779,0.0001437233,0.00000559224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006230268,"about_ca_system_score_gemma":0.00007610601,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002545357,"about_ca_topic_score_gemma":0.00001918631,"domain_scores_codex":[0.999162,0.000046797,0.000235402,0.0002209721,0.0002087919,0.0001260829],"domain_scores_gemma":[0.9990391,0.00003797581,0.0001556628,0.0005718778,0.0001341539,0.00006128228],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001346116,0.0007038887,0.3758895,0.00005960228,0.00008044142,0.000004595504,0.006508118,0.004381895,0.4460019,0.1129905,0.01791789,0.03532706],"study_design_scores_gemma":[0.0007253305,0.0004504085,0.3183797,0.0001886454,0.00000919482,0.00001627535,0.00002884908,0.2971246,0.3608527,0.0005282926,0.0210285,0.0006675082],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2497635,0.000003368726,0.74219,0.001077927,0.0001759448,0.0002273626,0.000001041544,0.0002032007,0.006357591],"genre_scores_gemma":[0.8979097,6.084018e-7,0.1011417,0.000473669,0.00002428478,0.000009265413,0.000003486942,0.000005232992,0.0004320277],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6481462,"threshold_uncertainty_score":0.2537198,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2024959957","doi":"10.1016/s0010-4655(00)00189-2","title":"The HepMC C++ Monte Carlo event record for High Energy Physics","year":2001,"lang":"en","type":"article","venue":"Computer Physics Communications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":291,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monte Carlo method; Event (particle physics); Fortran; Computer science; Vertex (graph theory); Event generator; Computational science; Physics; Statistical physics; Graph; Theoretical computer science; Mathematics; Programming language; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03606666580185056,"gpt":0.2834892053248282,"spread":0.2474225395229776,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002593597,0.0002131138,0.0002122565,0.00003379148,0.00128373,0.0003711822,0.004122984,0.00005583131,4.098539e-7],"category_scores_gemma":[0.00001333998,0.0001850268,0.000170059,0.0005369206,0.0001312206,0.0003349061,0.001542761,0.0001873736,0.000008629296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006983379,"about_ca_system_score_gemma":0.0000804825,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001218565,"about_ca_topic_score_gemma":0.00003364978,"domain_scores_codex":[0.9985307,0.0002047772,0.0003749504,0.0003522024,0.0001913932,0.0003459957],"domain_scores_gemma":[0.9949463,0.0007398262,0.0002434109,0.003601111,0.0003872071,0.00008211661],"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.000002788569,0.0001172641,0.00003452528,0.000002226613,0.00003072793,2.490434e-7,0.0001572742,0.01056862,0.000004156581,0.6471217,0.008521221,0.3334393],"study_design_scores_gemma":[0.0001805299,0.0000582833,0.00006189724,0.00001772549,0.000007359429,0.000002481661,0.000003300222,0.7607388,0.00005957373,0.1652246,0.0734629,0.0001824743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00006329793,0.0003476853,0.9935786,0.004044086,0.0003933281,0.0002546848,0.00000509445,0.0005975193,0.0007157525],"genre_scores_gemma":[0.2309307,0.001158418,0.7660474,0.0007625816,0.0004090533,0.0002068857,0.00002781274,0.00002645819,0.0004307103],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7501702,"threshold_uncertainty_score":0.987354,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2120715680","doi":"10.1145/1346281.1346286","title":"Accelerating two-dimensional page walks for virtualized systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":259,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Paging; Computer science; Page fault; Demand paging; Overhead (engineering); Virtualization; Operating system; Page; Hypervisor; Table (database); Dimension (graph theory); Software; Virtual memory; Memory management; Page cache; Parallel computing; Cache algorithms; Overlay; Database; CPU cache; Cache; Cloud computing","retraction":null,"screen_n_in":null,"score":{"opus":0.05229468062472414,"gpt":0.287384977144376,"spread":0.2350902965196519,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002854278,0.0001125912,0.0001628231,0.00007565919,0.0003528008,0.0001098908,0.0004411236,0.00004417279,0.00000850277],"category_scores_gemma":[0.00004705387,0.00009573771,0.00006283072,0.0001693235,0.00002192444,0.0002441453,0.0001415145,0.00006076004,0.00001513308],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002199149,"about_ca_system_score_gemma":0.00005787013,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003495936,"about_ca_topic_score_gemma":6.450269e-7,"domain_scores_codex":[0.9989763,0.00005510431,0.0002610385,0.0003004025,0.0001907956,0.0002162892],"domain_scores_gemma":[0.999216,0.000182833,0.00008542318,0.0003018377,0.0001482454,0.0000657105],"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.00002909561,0.0002089694,0.0002982888,0.00004537688,0.00006050363,0.00003020256,0.001066004,0.36487,0.007314084,0.5198915,0.09962844,0.006557522],"study_design_scores_gemma":[0.0004550964,0.00005359941,0.00002542163,0.00001270051,0.000001254921,0.0000487764,0.000003945297,0.995141,0.001952816,0.000476377,0.001677471,0.0001515842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005985441,0.00007675703,0.9866381,0.0001678559,0.0002682605,0.0002671562,0.000001013268,0.001009729,0.005585688],"genre_scores_gemma":[0.4148665,0.000002946568,0.5827137,0.0003827391,0.00007186144,0.00003813494,0.00000436491,0.000007528685,0.001912202],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.630271,"threshold_uncertainty_score":0.390407,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985539519","doi":"10.1145/1272996.1273004","title":"Thread clustering","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":250,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Multithreading; Thread (computing); Multiprocessing; Cache; Parallel computing; Operating system; Embedded system; Chip; Computer architecture","retraction":null,"screen_n_in":null,"score":{"opus":0.02032641691659588,"gpt":0.2793823485428212,"spread":0.2590559316262254,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002964748,0.00004046345,0.00003952879,0.00005413091,0.00004786954,0.00005092489,0.0003344791,0.00002092435,0.000008053175],"category_scores_gemma":[0.000008212747,0.00003510911,0.00001682806,0.0001545784,0.000007063156,0.000126371,0.0001368149,0.000034814,0.00003124161],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000993722,"about_ca_system_score_gemma":0.00000670794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008822809,"about_ca_topic_score_gemma":0.000006210954,"domain_scores_codex":[0.9995789,0.000005738608,0.00009019094,0.0001174102,0.00007604261,0.0001317381],"domain_scores_gemma":[0.9996846,0.00002917721,0.00001941798,0.0002052423,0.0000255366,0.00003600106],"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.000003149768,0.00004390292,0.001213457,0.000005580043,0.000006886251,0.00002127437,0.0004061213,0.004696072,0.0002715146,0.7586645,0.007422012,0.2272455],"study_design_scores_gemma":[0.0002767132,0.00008601711,0.004902615,0.00001905634,0.000001369533,0.00005328781,0.00001748347,0.9100278,0.02645721,0.03508598,0.02266858,0.0004038864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003185751,0.00001618133,0.9035172,0.0001635344,0.00008809216,0.00002538107,1.415825e-8,0.0008794256,0.09499162],"genre_scores_gemma":[0.2360134,0.000002632039,0.7627294,0.000387622,0.00002239847,4.108848e-7,1.4475e-7,0.000001944451,0.0008420311],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9053317,"threshold_uncertainty_score":0.1431708,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2082982763","doi":"10.1109/micro.2012.30","title":"Fundamental Latency Trade-off in Architecting DRAM Caches: Outperforming Impractical SRAM-Tags with a Simple and Practical Design","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":238,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Advanced Micro Devices (Canada)","funders":"NetApp","keywords":"Computer science; Cache; Dram; Latency (audio); Static random-access memory; CAS latency; Embedded system; Cache pollution; CPU cache; Parallel computing; Cache algorithms; Operating system; Computer hardware; Memory controller; Semiconductor memory","retraction":null,"screen_n_in":null,"score":{"opus":0.04375466281009928,"gpt":0.3090592340245349,"spread":0.2653045712144357,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001027504,0.0001819593,0.0001954952,0.0001465342,0.000176257,0.0002092738,0.0001756074,0.00008288908,0.000009789544],"category_scores_gemma":[0.0001754661,0.0001435335,0.00002597451,0.0003202192,0.00006439178,0.001229374,0.000191416,0.0003817524,0.000005367815],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006293949,"about_ca_system_score_gemma":0.00008505608,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006695627,"about_ca_topic_score_gemma":0.000008559532,"domain_scores_codex":[0.9983977,0.0001891058,0.0002803031,0.0003434957,0.0002427687,0.0005466201],"domain_scores_gemma":[0.9988312,0.0006092642,0.00009721972,0.0002446253,0.00001907885,0.0001986393],"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.0005725034,0.003837129,0.3782067,0.0001908681,0.0002154636,0.0003880165,0.05028233,0.01687846,0.001968375,0.07636197,0.00248564,0.4686126],"study_design_scores_gemma":[0.0007354742,0.0005331437,0.009060367,0.00004497171,0.00001374279,0.001104526,0.0006304329,0.9835005,0.002223057,0.0006019698,0.001055518,0.0004962267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0904112,0.00006215261,0.9062999,0.00102237,0.00003901904,0.0002304077,1.999654e-7,0.0003448562,0.001589825],"genre_scores_gemma":[0.5638237,0.000005975438,0.4359321,0.0001752708,0.00002793044,0.000006869385,5.751056e-7,0.000008014067,0.00001953833],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9666221,"threshold_uncertainty_score":0.5853127,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2015827499","doi":"10.1109/rtas.2014.6925999","title":"PALLOC: DRAM bank-aware memory allocator for performance isolation on multicore platforms","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":236,"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":"National Science Foundation","keywords":"Dram; Computer science; Multi-core processor; Embedded system; Exploit; Isolation (microbiology); Allocator; Partition (number theory); Operating system; Shared memory; Dynamic random-access memory; Computer hardware; Semiconductor memory; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.01640095642474942,"gpt":0.2458419808425957,"spread":0.2294410244178463,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003544123,0.0001610856,0.0001526696,0.0001159701,0.0002283007,0.0001144582,0.0005987885,0.00009233389,0.00001002197],"category_scores_gemma":[0.00005720046,0.000129456,0.00006513952,0.0001619925,0.00002256276,0.0003831763,0.00009594438,0.00009662657,0.00004402535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000375868,"about_ca_system_score_gemma":0.00003115643,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005660078,"about_ca_topic_score_gemma":0.000002248011,"domain_scores_codex":[0.9989139,0.00001554875,0.000239449,0.0003672816,0.0001985743,0.000265183],"domain_scores_gemma":[0.9990486,0.0001520786,0.00009956128,0.0004903622,0.0001294182,0.00007996436],"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.000125618,0.0004001817,0.002913806,0.0002226455,0.00005392663,0.000001268562,0.001836786,0.2753969,0.0005820201,0.1627372,0.02482586,0.5309038],"study_design_scores_gemma":[0.000374902,0.0003099727,0.00097472,0.00002888637,0.000002328977,0.000001676402,0.000007255624,0.9897884,0.005307022,0.0009777548,0.002022813,0.0002043139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02616143,0.00000554183,0.9684428,0.0002641686,0.0002204504,0.0003169639,7.345925e-7,0.0009401547,0.003647734],"genre_scores_gemma":[0.7378953,0.000005829196,0.2603989,0.0008321878,0.00007568339,0.00003548611,0.000009630236,0.00001099258,0.0007360242],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7143915,"threshold_uncertainty_score":0.5279061,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2143677609","doi":"10.5555/1924943.1924946","title":"FlexSC: flexible system call scheduling with exception-less system calls","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":227,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Operating system; System call; Thread (computing); User space; File system; Server; Multi-core processor; Scheduling (production processes); Linux kernel; Embedded system; Distributed computing","retraction":null,"screen_n_in":null,"score":{"opus":0.01327535633680293,"gpt":0.2380410371283712,"spread":0.2247656807915683,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004850385,0.0002094431,0.000249071,0.000161338,0.0002729659,0.0003695322,0.000975363,0.0001351291,0.000006762723],"category_scores_gemma":[0.00001215128,0.0001611404,0.00005559089,0.000456017,0.00004615463,0.0003757564,0.0001956981,0.0002881668,0.00009661876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007709995,"about_ca_system_score_gemma":0.0001159054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001675595,"about_ca_topic_score_gemma":0.00003535755,"domain_scores_codex":[0.9983884,0.00006483606,0.0003242275,0.0005094984,0.0003587185,0.0003543741],"domain_scores_gemma":[0.9985423,0.00006140868,0.0001435422,0.0008194229,0.0002643278,0.0001690061],"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.00001679323,0.00009048294,0.00150771,0.0003650774,0.00004750807,0.00005228734,0.0004578035,0.05724397,0.002477301,0.9285483,0.001617875,0.007574911],"study_design_scores_gemma":[0.0003537979,0.00007904375,0.0002407366,0.0002289552,0.000008378569,0.0002151805,0.0001364086,0.9907112,0.006812516,0.0000615583,0.0007595333,0.0003927416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01699619,0.00001810774,0.9481905,0.0001351816,0.0004464789,0.0002275886,8.343483e-7,0.004623132,0.02936196],"genre_scores_gemma":[0.5953085,9.601696e-7,0.4037734,0.0000572247,0.00008799345,0.00001942161,0.000001729614,0.0000120018,0.0007388133],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9334672,"threshold_uncertainty_score":0.6571114,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2783614532","doi":"10.1145/3197978","title":"A Survey on Compiler Autotuning using Machine Learning","year":2018,"lang":"en","type":"review","venue":"ACM Computing Surveys","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":224,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Compiler; Optimizing compiler; Loop optimization; Leverage (statistics); Interprocedural optimization; Pace; Parallel computing; Artificial intelligence; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.1493865011485346,"gpt":0.3737570408707444,"spread":0.2243705397222097,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.01294191,0.001049822,0.002377106,0.000836907,0.0009923284,0.0007495499,0.005059957,0.0005342604,0.00001145251],"category_scores_gemma":[0.002623691,0.0009717431,0.0005484887,0.002110145,0.0001318651,0.0002044495,0.003444215,0.001597795,0.0001750151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000292391,"about_ca_system_score_gemma":0.0003505079,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007400461,"about_ca_topic_score_gemma":0.00003209661,"domain_scores_codex":[0.9842545,0.01097922,0.001408015,0.001683337,0.000685667,0.000989252],"domain_scores_gemma":[0.9906126,0.004774376,0.001455816,0.002507939,0.0004169828,0.0002323323],"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.000001810547,0.0001052456,0.0006785855,0.001110757,0.000197069,0.00003376366,0.0001472985,0.006959576,1.034923e-7,0.0001584201,0.002343517,0.9882638],"study_design_scores_gemma":[0.0001954602,0.0002095592,0.0004082438,0.009041241,0.00006601941,0.00005700695,7.624415e-7,0.7111483,0.000001614211,0.00006473729,0.2774907,0.001316387],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.00001184289,0.4611945,0.535966,0.000009594472,0.0007712569,0.000324674,0.00001671801,0.001519746,0.0001856652],"genre_scores_gemma":[0.000288128,0.725359,0.2724788,0.0001985573,0.0005762164,0.000007493465,0.0005799245,0.0002274139,0.0002845119],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.9869475,"threshold_uncertainty_score":0.9992733,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2002671355","doi":"10.1145/1531793.1531804","title":"HASS","year":2009,"lang":"en","type":"article","venue":"ACM SIGOPS Operating Systems Review","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":220,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Simon Fraser University","funders":"","keywords":"Computer science; Profiling (computer programming); Scalability; Parallel computing; Oracle; Multi-core processor; Thread (computing); Scheduling (production processes); Workload; Distributed computing; Homogeneous; Operating system; Programming language; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.02937903326200061,"gpt":0.3051996701791999,"spread":0.2758206369171993,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009576538,0.0001805412,0.0004020066,0.00005151764,0.0002089803,0.0003673348,0.001669827,0.00005379541,0.000005630311],"category_scores_gemma":[0.0006070064,0.0001474335,0.00008068742,0.0004729969,0.00001061136,0.0003558389,0.0001833102,0.0001393633,0.00009182428],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003551715,"about_ca_system_score_gemma":0.00005824983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001704508,"about_ca_topic_score_gemma":1.819031e-7,"domain_scores_codex":[0.9982864,0.0002527237,0.0005453021,0.0003932242,0.0002635075,0.0002588719],"domain_scores_gemma":[0.9981645,0.00009191963,0.000173892,0.001306868,0.0001766058,0.00008615488],"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.000001160986,0.0002534858,0.0003169847,0.003278778,0.00005993196,0.00008985335,0.0005969579,0.01065957,0.0007992821,0.2197277,0.3037225,0.4604937],"study_design_scores_gemma":[0.0007620486,0.0009489713,0.0003695981,0.03770043,0.00006287923,0.0006002985,0.00002015639,0.5661737,0.0008893667,0.002477452,0.3876558,0.002339371],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007109719,0.1252097,0.8564903,0.005426256,0.0003557657,0.0007436059,6.792042e-7,0.001315573,0.01038697],"genre_scores_gemma":[0.3208782,0.02361249,0.6393645,0.01343968,0.0003868578,0.0001201666,0.00001375706,0.00003106813,0.002153286],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5555141,"threshold_uncertainty_score":0.6012164,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2016888570","doi":"10.1109/tpds.2010.62","title":"hiCUDA: High-Level GPGPU Programming","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":219,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"CUDA; Computer science; Porting; Compiler; General-purpose computing on graphics processing units; Parallel computing; Programmer; Graphics; Software portability; Code (set theory); Operating system; Programming language; Software","retraction":null,"screen_n_in":null,"score":{"opus":0.02100504174156377,"gpt":0.2438634565018963,"spread":0.2228584147603326,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002919649,0.0002429544,0.0002718051,0.0001451332,0.0004422016,0.000386311,0.0004753168,0.0001939277,0.000008199556],"category_scores_gemma":[0.000008440235,0.0002180775,0.00008137873,0.0004129717,0.00007661355,0.0002991785,0.000006386447,0.0004316157,0.00002872489],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000271828,"about_ca_system_score_gemma":0.00005452854,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000219509,"about_ca_topic_score_gemma":0.00003247657,"domain_scores_codex":[0.9984145,0.00008221654,0.0003716912,0.0004938041,0.0002750698,0.0003627279],"domain_scores_gemma":[0.9988843,0.0001028806,0.0001230413,0.0005453537,0.0001378525,0.0002065978],"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.00007463966,0.0009395067,0.0001908843,0.0001535266,0.0001860714,0.00005596783,0.0005672851,0.8595603,0.0021741,0.05074704,0.005705204,0.07964548],"study_design_scores_gemma":[0.001658722,0.0003642961,0.0008098809,0.0001116015,0.00004140697,0.0002768488,0.00010175,0.9764302,0.001463918,0.0009131967,0.01681666,0.001011482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004282939,0.00005913933,0.992535,0.0003007568,0.001272574,0.0003511659,0.00008538886,0.0009502841,0.0001627863],"genre_scores_gemma":[0.928921,0.00002369261,0.07043195,0.00005258453,0.00005940712,0.0001149923,0.00002010681,0.00001321019,0.0003630877],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.924638,"threshold_uncertainty_score":0.8892943,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2169665207","doi":"10.1145/1854273.1854350","title":"A case for NUMA-aware contention management on multicore systems","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":214,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Memory hierarchy; Non-uniform memory access; Scheduling (production processes); Distributed computing; Latency (audio); Uniform memory access; Multi-core processor; Interleaved memory; Flat memory model; Shared memory; Cache-only memory architecture; Parallel computing; Memory management; Operating system; Cache; Semiconductor memory","retraction":null,"screen_n_in":null,"score":{"opus":0.03216423145503076,"gpt":0.2828044768988636,"spread":0.2506402454438328,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001998317,0.00008367027,0.00008415056,0.00008418181,0.0001331663,0.0001668825,0.0002836876,0.00004522343,0.000003839243],"category_scores_gemma":[0.00001217374,0.00006951625,0.00004658999,0.00008884353,0.0000105251,0.0001057102,0.00007248449,0.00006729677,0.0000163808],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001273793,"about_ca_system_score_gemma":0.000005590959,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002932958,"about_ca_topic_score_gemma":0.000007346916,"domain_scores_codex":[0.9993487,0.00001739026,0.0001491235,0.0002466526,0.00009829299,0.0001398516],"domain_scores_gemma":[0.9993784,0.0000508781,0.00005631445,0.0003695553,0.00009726845,0.00004752092],"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.00001205186,0.0001650019,0.00005901191,0.00009185176,0.00003150546,0.0002731014,0.0001554391,0.005414066,0.0001233178,0.947349,0.01479909,0.03152658],"study_design_scores_gemma":[0.000351637,0.00007339456,0.00002266523,0.00001743477,0.000003655718,0.0001940003,0.00003443254,0.9949833,0.0003769137,0.0004898419,0.003339897,0.0001128555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003609009,0.000003857751,0.9897535,0.0001593365,0.0006069881,0.0005149694,0.000001679639,0.0006812131,0.004669456],"genre_scores_gemma":[0.7730314,0.000001303392,0.224814,0.0001353424,0.00003303103,0.00007677665,0.000002881701,0.00000513256,0.001900185],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9895692,"threshold_uncertainty_score":0.283479,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2038666141","doi":"10.1109/hpca.2015.7056063","title":"GPGPU performance and power estimation using machine learning","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":213,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Memory bandwidth; Graphics; Kernel (algebra); Bandwidth (computing); General-purpose computing on graphics processing units; Frequency scaling; Multi-core processor; Graphics processing unit; Range (aeronautics); Scaling; Computer hardware; Power (physics); Parallel computing; Computer graphics (images)","retraction":null,"screen_n_in":null,"score":{"opus":0.02982307307628912,"gpt":0.2702077411338378,"spread":0.2403846680575487,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002481329,0.0000561346,0.00005732002,0.00005908405,0.00008672475,0.00009660878,0.0001341639,0.00002303491,0.000002895402],"category_scores_gemma":[0.00003449298,0.00004903218,0.000007569766,0.000133666,0.00001320885,0.0003722553,0.0001240789,0.00006428528,0.000006472679],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001689152,"about_ca_system_score_gemma":0.00002231716,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002479688,"about_ca_topic_score_gemma":3.741349e-7,"domain_scores_codex":[0.9995607,0.00002774841,0.00008701556,0.0001308143,0.0001022402,0.00009148729],"domain_scores_gemma":[0.9997255,0.00001370041,0.00003888201,0.0001108361,0.00005579688,0.00005524585],"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.000008066992,0.00003937459,0.02594538,0.00001556066,0.000009238943,0.000003856341,0.00196457,0.8988465,0.0001979098,0.01613121,0.0009224818,0.05591582],"study_design_scores_gemma":[0.0000938283,0.00005020734,0.0003328568,0.000007349,7.470957e-7,0.00001900512,0.000004398308,0.9980254,0.0005729402,0.0002885876,0.0005343217,0.00007035823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07987606,0.00005829957,0.9150819,0.00009305334,0.00004479836,0.00003281358,3.515083e-8,0.0003988893,0.004414123],"genre_scores_gemma":[0.544942,0.000004696881,0.4548,0.00005327988,0.00000382644,3.971084e-7,4.575959e-7,0.000002026336,0.000193252],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.465066,"threshold_uncertainty_score":0.1999474,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167675119","doi":"10.1145/1964179.1964184","title":"Reducing branch divergence in GPU programs","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":200,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Divergence (linguistics); CUDA; Parallel computing; General-purpose computing on graphics processing units; Computer graphics (images); Graphics","retraction":null,"screen_n_in":null,"score":{"opus":0.04299293693754882,"gpt":0.258245426340903,"spread":0.2152524894033541,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001969634,0.00006483185,0.00007153562,0.00008046501,0.00004150489,0.00003994592,0.0005755152,0.00003132235,0.00002619665],"category_scores_gemma":[0.00001217577,0.00005787609,0.00002161911,0.0004021754,0.00001756298,0.0002361596,0.0001844333,0.00006493001,0.00002717083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001317462,"about_ca_system_score_gemma":0.00001939896,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002787987,"about_ca_topic_score_gemma":0.00001026101,"domain_scores_codex":[0.999321,0.00003003594,0.0001455612,0.0002341618,0.0000935497,0.0001756398],"domain_scores_gemma":[0.9995993,0.000009009374,0.00003409464,0.0002851298,0.00003346947,0.00003894056],"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.000008315496,0.0004997251,0.113143,0.00002148857,0.000010436,0.00003243092,0.009766492,0.001624856,0.0002873514,0.1886542,0.002512523,0.6834391],"study_design_scores_gemma":[0.0005450516,0.0003426341,0.07149283,0.0001632487,0.000002907647,0.00003307181,0.00004703289,0.8436121,0.0340996,0.04688954,0.001890827,0.0008811331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01336103,0.0000308728,0.9488215,0.00005564342,0.0001059757,0.00009175354,2.799248e-8,0.0006123293,0.0369209],"genre_scores_gemma":[0.6171028,0.000008432099,0.3825234,0.00005992896,0.000006637213,0.000006347824,2.286028e-7,0.000002088647,0.0002901751],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8419873,"threshold_uncertainty_score":0.2360118,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2166263440","doi":"10.1145/2366231.2337207","title":"Staged memory scheduling","year":2012,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":199,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Army Research Office; National Science Foundation","keywords":"Computer science; Memory controller; Registered memory; Central processing unit; Embedded system; Uniform memory access; Scheduling (production processes); Parallel computing; Interleaved memory; Locality; Write buffer; Memory management; CPU cache; Operating system; Overlay; Cache; Cache algorithms; Semiconductor memory","retraction":null,"screen_n_in":null,"score":{"opus":0.01999806909825688,"gpt":0.2682172986647576,"spread":0.2482192295665007,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007328772,0.0003525864,0.0003372047,0.0003469274,0.0003151921,0.0002537298,0.002895025,0.0001281382,0.00002006023],"category_scores_gemma":[0.0001677245,0.0003140546,0.0001677187,0.0006158316,0.00007695468,0.000502979,0.002005442,0.0006299831,0.00008785133],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005670398,"about_ca_system_score_gemma":0.00008271448,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003083664,"about_ca_topic_score_gemma":0.000003808036,"domain_scores_codex":[0.9971962,0.0003567451,0.0004106973,0.0005947353,0.0005167413,0.0009248991],"domain_scores_gemma":[0.9970038,0.0005181803,0.0001488127,0.00183558,0.0001052378,0.0003884146],"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.0000171469,0.000267962,0.003412175,0.00005436584,0.0000880876,0.00002232644,0.007391851,0.09108435,0.001056876,0.008397348,0.009951771,0.8782557],"study_design_scores_gemma":[0.003543876,0.001056401,0.01306931,0.0003750187,0.00006153281,0.0007526042,0.00008240956,0.7703688,0.03126473,0.04676678,0.1286609,0.003997619],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01473359,0.0003682884,0.9783688,0.002095379,0.0008675316,0.000305742,0.000001231651,0.00163217,0.001627311],"genre_scores_gemma":[0.2704934,0.0000140863,0.7264111,0.00205712,0.0008677538,0.0000175222,0.00000590065,0.0000249702,0.0001080843],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8742581,"threshold_uncertainty_score":0.9999312,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2513721464","doi":"10.1145/3007787.3001159","title":"Transparent offloading and mapping (TOM)","year":2016,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":196,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Computer science; Bottleneck; Programmer; Memory bandwidth; Bandwidth (computing); Computer architecture; Dram; Embedded system; Compiler; Parallel computing; Operating system; Computer hardware; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.02719656679893559,"gpt":0.2578622872750542,"spread":0.2306657204761186,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003151725,0.0002879113,0.0003012003,0.0003224398,0.0002115238,0.0001945247,0.001692109,0.00008630183,0.000008455498],"category_scores_gemma":[0.0000721631,0.0001974535,0.00009627811,0.0003528466,0.00009978795,0.00024543,0.0009969004,0.0002175686,0.00001571866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004099767,"about_ca_system_score_gemma":0.00004900581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001660436,"about_ca_topic_score_gemma":0.000007063594,"domain_scores_codex":[0.997853,0.0001858063,0.0003602957,0.0007529747,0.0003303608,0.0005175069],"domain_scores_gemma":[0.9979639,0.0005760607,0.0001022968,0.001065652,0.00006868035,0.0002233888],"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.000006013939,0.00002838824,0.001212943,0.00002210663,0.00002910601,0.00001832777,0.001649548,0.001194869,0.002106472,0.002822089,0.001871723,0.9890384],"study_design_scores_gemma":[0.006832537,0.001807465,0.03736188,0.002238687,0.00004790144,0.001161123,0.00003558837,0.4010262,0.02538534,0.2546032,0.2652538,0.004246354],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009431448,0.00016378,0.9795781,0.008920156,0.0002628166,0.0002354749,0.000002055872,0.0009509792,0.000455165],"genre_scores_gemma":[0.3428813,0.00007602129,0.6556289,0.001070927,0.0002337429,0.00001527481,0.000001290822,0.00001789382,0.00007467566],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9847921,"threshold_uncertainty_score":0.8051922,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2158630919","doi":"10.1145/1150019.1136508","title":"Spatial Memory Streaming","year":2006,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":191,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cache; Parallel computing; Memory bandwidth; Exploit; Block size; Cache-only memory architecture; Interleaved memory; Uniform memory access; Block (permutation group theory); Registered memory; Shared memory; Flat memory model; Cache coloring; Computer architecture; CPU cache; Memory management; Semiconductor memory; Computer hardware; Operating system; Key (lock)","retraction":null,"screen_n_in":null,"score":{"opus":0.009048801510486407,"gpt":0.2347737888869235,"spread":0.2257249873764371,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002685491,0.0003457534,0.0003209725,0.0003393401,0.000273981,0.0003322175,0.002725888,0.0001177106,0.00001364025],"category_scores_gemma":[0.00005276345,0.0003145426,0.0001635658,0.0004868159,0.00008233725,0.0002087117,0.001539979,0.0004274418,0.00003895408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005301041,"about_ca_system_score_gemma":0.0000945975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008779778,"about_ca_topic_score_gemma":0.0001522918,"domain_scores_codex":[0.9974312,0.0002211609,0.0004431556,0.0007942739,0.0005030796,0.0006070917],"domain_scores_gemma":[0.9975845,0.0003920317,0.0001523564,0.001618819,0.0001104789,0.0001418379],"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.000009100028,0.000124605,0.0008477282,0.00002089374,0.00002406181,0.00006396522,0.0005574495,0.09501469,0.0006085017,0.003832853,0.01623608,0.8826601],"study_design_scores_gemma":[0.001595095,0.0005878235,0.01619294,0.0001354265,0.00001947361,0.0002816588,0.000007292366,0.8276595,0.008393412,0.09772164,0.04595521,0.001450528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007557061,0.00009286451,0.983831,0.002133274,0.0004818119,0.0002841622,0.000002088043,0.00159202,0.00402569],"genre_scores_gemma":[0.3253672,0.000005013634,0.6725928,0.0008563413,0.0009307685,0.00001514694,0.0000155281,0.00002314035,0.0001940296],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8812096,"threshold_uncertainty_score":0.9999307,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2121788702","doi":"10.1109/hpca.2013.6522302","title":"Power struggles: Revisiting the RISC vs. CISC debate on contemporary ARM and x86 architectures","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":188,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Canadian Institute of Steel Construction; Cisco Systems; National Science Foundation","keywords":"x86; Power (physics); ARM architecture; Computer science; Embedded system; Operating system; Physics; Software","retraction":null,"screen_n_in":null,"score":{"opus":0.01447038931767952,"gpt":0.2419511850591546,"spread":0.2274807957414751,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002519663,0.0001414496,0.000137494,0.00007439507,0.0002141542,0.0003876732,0.0005713234,0.00004096162,0.00006379464],"category_scores_gemma":[0.00006015996,0.00008281944,0.00004075009,0.0001493869,0.00006035874,0.0001283554,0.0002588379,0.0001701787,0.00005300511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008273087,"about_ca_system_score_gemma":0.000024136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001027866,"about_ca_topic_score_gemma":0.000001115816,"domain_scores_codex":[0.998994,0.0001206064,0.0002076209,0.000312458,0.000174054,0.0001912798],"domain_scores_gemma":[0.9990687,0.0002519408,0.00009445053,0.000456591,0.0000601519,0.00006813632],"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.00004726005,0.0002293334,0.01478794,0.0001090488,0.0001836518,0.0000570312,0.009100913,0.01419568,0.0004581559,0.2014586,0.2747869,0.4845855],"study_design_scores_gemma":[0.001206679,0.001026815,0.03024635,0.0004699735,0.000009359675,0.0001476815,0.0006370073,0.8468957,0.008325135,0.07003143,0.03946451,0.00153935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06285606,0.0004059823,0.8202091,0.01147128,0.0001048874,0.0004374002,8.596696e-7,0.0009354195,0.1035789],"genre_scores_gemma":[0.9428636,0.00001702698,0.05356811,0.002885574,0.00005564677,0.00001356541,7.393876e-7,0.000007999651,0.0005877534],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8800075,"threshold_uncertainty_score":0.3738342,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037462607","doi":"10.1145/1082469.1082471","title":"The STAMPede approach to thread-level speculation","year":2005,"lang":"en","type":"article","venue":"ACM Transactions on Computer Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":185,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Exploit; Multithreading; Thread (computing); Cache coherence; Multiprocessing; Parallel computing; Compiler; Simultaneous multithreading; Speculation; Speculative multithreading; Workload; Cache; Computer architecture; CPU cache; Embedded system; Operating system; Cache algorithms","retraction":null,"screen_n_in":null,"score":{"opus":0.04490225370586334,"gpt":0.2656086758826906,"spread":0.2207064221768273,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004756108,0.0002062341,0.0001842976,0.0001742609,0.0006461196,0.0006434257,0.001682499,0.00007917854,0.000001267901],"category_scores_gemma":[0.000008576817,0.0001569466,0.00009819295,0.0005323958,0.00002579486,0.0003169244,0.00004713088,0.0001939796,0.0001157498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00011276,"about_ca_system_score_gemma":0.00004340073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004082853,"about_ca_topic_score_gemma":0.000008877879,"domain_scores_codex":[0.9982355,0.0001609036,0.0003936934,0.0004864163,0.0003957469,0.0003277764],"domain_scores_gemma":[0.9979879,0.0002258178,0.00009840316,0.001413974,0.0001416422,0.0001322157],"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.000006152043,0.000116494,0.00000563044,0.0000074948,0.00002997457,5.694765e-7,0.0005162331,0.8351641,0.000009948324,0.02048178,0.004893088,0.1387685],"study_design_scores_gemma":[0.0001991142,0.00009963537,0.0002738258,0.00003374883,0.000005146774,0.00003317722,0.00001758469,0.9492558,0.0002367277,0.0003198362,0.04928038,0.0002450772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001808924,0.00007351246,0.9937114,0.001886897,0.001187738,0.0004977728,0.000003926165,0.0008022761,0.001655598],"genre_scores_gemma":[0.3162094,0.00001787886,0.6820413,0.0003856648,0.0003384078,0.00007994407,0.000002785341,0.00001603815,0.0009085274],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3160285,"threshold_uncertainty_score":0.6400098,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1986491730","doi":"10.1145/1534909.1534910","title":"A mechanistic performance model for superscalar out-of-order processors","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Computer Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":182,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Vlaamse regering; Universiteit Gent; Fonds Wetenschappelijk Onderzoek; Intel Corporation","keywords":"Computer science; Pipeline (software); Microarchitecture; Parallel computing; Cache; Interval (graph theory); Scaling; Superscalar; Branch predictor; Pipeline burst cache; Out-of-order execution; Instructions per cycle; Speculative execution; CPU cache; Cache algorithms; Operating system; Central processing unit","retraction":null,"screen_n_in":null,"score":{"opus":0.03322298014508084,"gpt":0.2662728396138084,"spread":0.2330498594687276,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002671723,0.00020748,0.0002986779,0.0002179715,0.000219042,0.0001187593,0.001140191,0.0001034202,7.808749e-7],"category_scores_gemma":[0.00001089683,0.0001948874,0.0001082122,0.0003622373,0.00001991652,0.0003256977,0.0000133773,0.0001287452,0.000006499599],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004540585,"about_ca_system_score_gemma":0.00008395233,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003772761,"about_ca_topic_score_gemma":8.57379e-7,"domain_scores_codex":[0.9985651,0.00004358414,0.0004166657,0.0004307715,0.000262464,0.0002813593],"domain_scores_gemma":[0.9985438,0.0001057507,0.0001281088,0.000803592,0.0003387965,0.00007993691],"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.00001644582,0.0001637279,0.000001899747,0.00009501207,0.00002299484,5.745534e-7,0.0008600972,0.9601936,0.00005430183,0.005640738,0.0003485167,0.03260206],"study_design_scores_gemma":[0.0003674729,0.0005022253,0.000008362674,0.0001159032,0.00001201657,0.000008023993,0.00000561668,0.9962397,0.001327773,0.0009755871,0.0002223082,0.0002150645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005445607,0.00005002074,0.9969156,0.0003156516,0.0009561239,0.0005410148,0.000007041941,0.0005795496,0.00009045275],"genre_scores_gemma":[0.5438531,0.00001306022,0.4556935,0.0001360867,0.00005417927,0.00004676501,0.000002088482,0.000009139941,0.0001920304],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5433086,"threshold_uncertainty_score":0.7947276,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037181413","doi":"10.1109/mdt.2007.151","title":"A Survey and Taxonomy of GALS Design Styles","year":2007,"lang":"en","type":"article","venue":"IEEE Design & Test of Computers","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":177,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"University of Waterloo","keywords":"Computer science; Asynchronous communication; Embedded system; Computer architecture; Asynchronous circuit; Block (permutation group theory); Reuse; Synchronous circuit; Computer hardware; Clock signal; Engineering; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.07293608293102576,"gpt":0.2720912248614472,"spread":0.1991551419304214,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002767934,0.0001889766,0.0003685759,0.0002768959,0.00006091153,0.00005467123,0.0007785738,0.00008101455,0.00000115623],"category_scores_gemma":[0.0001397785,0.000188812,0.00005435072,0.0004964623,0.0001406153,0.0002176905,0.000112747,0.00009255094,0.000001646398],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002078808,"about_ca_system_score_gemma":0.0001012499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004544984,"about_ca_topic_score_gemma":0.000001407059,"domain_scores_codex":[0.9982826,0.0002982435,0.0005364901,0.0003445034,0.0002562405,0.0002819699],"domain_scores_gemma":[0.9955088,0.003302069,0.0003688229,0.0004425736,0.0002693167,0.0001083761],"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.000404206,0.002060997,0.06678372,0.0004316087,0.0004234823,0.0001247144,0.002316566,0.4606106,0.03900013,0.01520915,0.08680807,0.3258268],"study_design_scores_gemma":[0.0008832237,0.001194037,0.04020144,0.000204179,0.00001349593,0.0000332549,0.000009421796,0.7631496,0.1923939,0.0009780459,0.0003589251,0.0005805222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002167226,0.0002101855,0.9966029,0.00002454813,0.0001716267,0.0003852997,0.000002440278,0.000214571,0.0002211922],"genre_scores_gemma":[0.4778876,0.0000203196,0.5220044,0.00004999634,0.00001947298,0.00000379719,6.230252e-7,0.000006710101,0.00000702653],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4757204,"threshold_uncertainty_score":0.7699528,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2151326614","doi":"10.1145/1508244.1508259","title":"RapidMRC","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":174,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cache; Multi-core processor; Cache algorithms; Overhead (engineering); Cache invalidation; Parallel computing; Smart Cache; Software; CPU cache; Process (computing); Code (set theory); Cache pollution; Operating system; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01268274042116076,"gpt":0.2532537885188776,"spread":0.2405710480977168,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007274897,0.00003414665,0.00003661971,0.00003642529,0.00003654597,0.00005514393,0.0003387553,0.00001522263,0.000008564465],"category_scores_gemma":[0.000006842522,0.00002841304,0.00001723328,0.0001442885,0.000003637302,0.0001275666,0.00002665562,0.00002573574,0.00002941105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004320992,"about_ca_system_score_gemma":0.000008356409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.936374e-7,"about_ca_topic_score_gemma":4.660524e-8,"domain_scores_codex":[0.9996853,0.00001048203,0.00005830857,0.0001039147,0.00006142571,0.00008050329],"domain_scores_gemma":[0.999724,0.000008661494,0.00001338525,0.0002055224,0.00002155456,0.00002685868],"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":[4.452225e-7,0.00002834673,0.00002700177,3.406734e-7,0.000001102382,0.000002506539,0.00006634001,0.0006965142,0.0001772366,0.7592161,0.0370746,0.2027095],"study_design_scores_gemma":[0.0002046607,0.0001920222,0.002699765,0.000006706833,8.180773e-7,0.0000187763,0.000002244677,0.836658,0.01530769,0.1119682,0.03267972,0.0002613975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001013615,0.00002192007,0.8721585,0.00181437,0.000030438,0.00001988259,1.242219e-8,0.0009303714,0.1249231],"genre_scores_gemma":[0.3873216,0.000005299088,0.6097127,0.001902657,0.00001352706,3.631187e-7,1.601778e-7,6.769801e-7,0.001043027],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8359615,"threshold_uncertainty_score":0.115865,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144643978","doi":"10.1109/pact.2005.33","title":"Optimizing Compiler for the CELL Processor","year":2005,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":173,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Compiler; Parallel computing; Computer architecture; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02180742573373786,"gpt":0.2665261959330418,"spread":0.244718770199304,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002124575,0.00007128676,0.00006506144,0.00003057817,0.0002077763,0.000145952,0.0007418796,0.00002588377,0.00001111861],"category_scores_gemma":[0.00001191827,0.0000448435,0.00004213762,0.0001372714,0.0000160447,0.000194701,0.0001095616,0.00005198021,0.00001944805],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001217055,"about_ca_system_score_gemma":0.00002548587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002167724,"about_ca_topic_score_gemma":0.000001308631,"domain_scores_codex":[0.9994339,0.00001196961,0.0001234475,0.0001759166,0.00009256075,0.0001622213],"domain_scores_gemma":[0.999401,0.0001587441,0.00004727475,0.0002797652,0.00008427306,0.00002892596],"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.00001024933,0.0001838108,0.00004209351,0.00003409255,0.00001925165,5.01411e-7,0.001686603,0.5747603,0.000329043,0.09437425,0.1692039,0.1593559],"study_design_scores_gemma":[0.0001325205,0.00002062831,0.00001004235,0.000002924097,0.000001786578,0.000001308898,0.0000079031,0.9086921,0.01335269,0.0003375322,0.07736408,0.00007646363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00005039875,0.0001792138,0.9805121,0.003976961,0.00006052043,0.0002176797,2.990647e-7,0.0005656285,0.01443717],"genre_scores_gemma":[0.1550194,0.00001659403,0.8405168,0.001514437,0.00008170975,0.0000368019,5.86015e-7,0.000005045182,0.002808596],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3339318,"threshold_uncertainty_score":0.1828665,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2135183949","doi":"10.1145/379240.379265","title":"Power and energy reduction via pipeline balancing","year":2001,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":168,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"PQ Corporation (Canada)","funders":"","keywords":"Computer science; Pipeline (software); Reduction (mathematics); Queue; Power (physics); Embedded system; Dissipation; Energy (signal processing); Power budget; Power optimization; Efficient energy use; Microarchitecture; Electric power system; Operating system; Power consumption; Engineering; Computer network; Electrical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.007263304535438872,"gpt":0.2288884298080601,"spread":0.2216251252726212,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001040625,0.00005696966,0.00005834771,0.00006264719,0.00006772119,0.00006004995,0.0001424037,0.00002915001,0.00001919127],"category_scores_gemma":[0.000006698897,0.00005051062,0.00001359007,0.0001800956,0.00001218258,0.0001879179,0.00008323044,0.00003194957,0.000003924812],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001004694,"about_ca_system_score_gemma":0.000008011289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004201603,"about_ca_topic_score_gemma":0.000001271466,"domain_scores_codex":[0.9995214,0.00001989873,0.00009970144,0.0001793918,0.00007416782,0.0001054507],"domain_scores_gemma":[0.9997028,0.00001065999,0.00002898654,0.0001733583,0.0000432679,0.00004097788],"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.00001754049,0.0001739354,0.001266562,0.000007985521,0.00002082053,0.00003511628,0.0008840106,0.008538614,0.007952971,0.2720993,0.07435913,0.634644],"study_design_scores_gemma":[0.0001238113,0.00004408097,0.000241355,0.000007488837,0.00000100859,0.0002208334,0.000007185201,0.9605793,0.004173466,0.00491426,0.02953906,0.0001481418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009544481,0.00008002904,0.9647325,0.0006138714,0.000115859,0.00001204736,2.777508e-8,0.0005178476,0.0329734],"genre_scores_gemma":[0.7589863,0.0000816814,0.2365686,0.0004105703,0.00003975451,0.000001561069,6.72442e-7,0.000003345387,0.003907531],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9520407,"threshold_uncertainty_score":0.2059763,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4234833047","doi":"10.1145/2508148.2485964","title":"GPUWattch","year":2013,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":163,"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":"Division of Computer and Network Systems; Division of Computing and Communication Foundations; Intel Corporation; Advanced Micro Devices; National Science Foundation","keywords":"Computer science; Frequency scaling; General-purpose computing on graphics processing units; Parallel computing; Energy consumption; Efficient energy use; Clock gating; Kernel (algebra); CUDA; Dynamic demand; Metric (unit); Embedded system; Performance metric; Power (physics); Graphics; Operating system; Clock skew; Clock signal","retraction":null,"screen_n_in":null,"score":{"opus":0.01219954443439917,"gpt":0.2427591527754178,"spread":0.2305596083410186,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002176271,0.0003274083,0.0003075406,0.0003033197,0.0002263306,0.000528986,0.003769579,0.0001153897,0.00006986628],"category_scores_gemma":[0.00008833882,0.0002755187,0.0001521256,0.0006095008,0.00007839478,0.0003972226,0.002029981,0.0004633547,0.0004148966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003793145,"about_ca_system_score_gemma":0.0000737835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000162015,"about_ca_topic_score_gemma":0.000007840265,"domain_scores_codex":[0.9975408,0.0002144234,0.0003923875,0.0007622483,0.0004493738,0.0006408024],"domain_scores_gemma":[0.9970104,0.0004024611,0.0001151877,0.002023811,0.0001808289,0.000267386],"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.000002628681,0.00008537029,0.0007654991,0.00001790429,0.00003509388,0.00001527936,0.001180043,0.01435213,0.0004734134,0.005091023,0.08019718,0.8977844],"study_design_scores_gemma":[0.00109852,0.0006591788,0.00957538,0.0001041952,0.00001072851,0.0002651345,0.000009665603,0.668065,0.003903684,0.2053429,0.1095926,0.001373095],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004797537,0.00007601253,0.9800016,0.009510363,0.0004126419,0.0004785544,7.02011e-7,0.001692268,0.003030294],"genre_scores_gemma":[0.1176004,0.00001520714,0.877271,0.0042983,0.0004180841,0.00006510149,0.00000638635,0.00002528742,0.0003002731],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8964114,"threshold_uncertainty_score":0.9999697,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092212481","doi":"10.1109/hpca.2015.7056027","title":"Heterogeneous memory architectures: A HW/SW approach for mixing die-stacked and off-package memories","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":161,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Dram; Embedded system; Leverage (statistics); Computer architecture; Software; Overlay; Memory management; Interleaved memory; Computer hardware; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.03267026224982563,"gpt":0.2646936095672053,"spread":0.2320233473173797,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004248489,0.0001894321,0.0002317774,0.0001270332,0.0001607285,0.0002290602,0.000545571,0.00007240249,0.000001083327],"category_scores_gemma":[0.0001284099,0.0001571865,0.00006328222,0.0001503418,0.00007445725,0.000121128,0.0003082332,0.00008948391,0.000001582485],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002601185,"about_ca_system_score_gemma":0.00006147121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001611865,"about_ca_topic_score_gemma":0.00000589254,"domain_scores_codex":[0.9987129,0.00007897131,0.0002275224,0.0004678021,0.0002050544,0.0003077792],"domain_scores_gemma":[0.9990302,0.0001165665,0.00008410904,0.0004627227,0.0001285509,0.0001777979],"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.0004973522,0.00100389,0.000706794,0.0007829602,0.0004810773,0.0001081303,0.05498137,0.4069724,0.002167284,0.02568767,0.03891242,0.4676986],"study_design_scores_gemma":[0.0007100723,0.0002140297,0.00001520052,0.00001379568,0.000008467782,0.00006178228,0.0001218716,0.97203,0.01911551,0.005624791,0.001743759,0.000340727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01091451,0.0006199884,0.9828637,0.0002225166,0.00009889682,0.0003888469,0.00000258799,0.0008634389,0.004025549],"genre_scores_gemma":[0.3040202,0.00001313204,0.6949145,0.0003649876,0.00006358274,0.00004210915,0.00000707453,0.00001399999,0.0005603707],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5650576,"threshold_uncertainty_score":0.6409879,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2543071820","doi":"10.1109/edtc.1994.326902","title":"Instruction-set matching and selection for DSP and ASIP code generation","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":161,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science; Instruction set; Compiler; Retargeting; Digital signal processing; Code generation; Set (abstract data type); Computer architecture; Selection (genetic algorithm); Code (set theory); Matching (statistics); Programming language; Parallel computing; Artificial intelligence; Computer hardware; Operating system; Key (lock)","retraction":null,"screen_n_in":null,"score":{"opus":0.0381013443426415,"gpt":0.2619556862124389,"spread":0.2238543418697974,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000104745,0.00005506677,0.00005460035,0.00005952507,0.0001982945,0.0001648836,0.00006080177,0.0000346068,0.000004197157],"category_scores_gemma":[0.00001090552,0.00005236802,0.00000941514,0.00009344884,0.00001090104,0.0002877411,0.00003329149,0.00003343163,8.829838e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001017215,"about_ca_system_score_gemma":0.000003482195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001540264,"about_ca_topic_score_gemma":0.00001431312,"domain_scores_codex":[0.9995748,0.00001816303,0.00009427973,0.0001834773,0.00005104867,0.00007820481],"domain_scores_gemma":[0.9998132,0.00002326631,0.00003493046,0.00005739539,0.00004294428,0.00002828916],"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.000007911671,0.00006859221,0.003046639,0.00006196417,0.00003563739,6.197995e-7,0.003149162,0.01928708,0.008986752,0.4274274,0.02862934,0.5092989],"study_design_scores_gemma":[0.0001690924,0.00004341539,0.0002039927,0.000003000772,0.000001555038,0.00002714947,0.00000517436,0.991959,0.002416853,0.003875925,0.001222381,0.00007245711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05632022,0.00005152127,0.9422477,0.0004093595,0.00005917244,0.00009949067,5.434286e-7,0.0002853888,0.0005266489],"genre_scores_gemma":[0.4917016,0.00005307468,0.5077454,0.0001513468,0.00005104029,0.000008217545,0.000001385186,0.000002976777,0.0002848646],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9726719,"threshold_uncertainty_score":0.2135506,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2119151382","doi":"10.1145/949305.949320","title":"Dynamic metrics for java","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":159,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Concurrency; Java; Suite; Just-in-time compilation; Programming language; Benchmark (surveying); Metric (unit); Set (abstract data type); Compiler","retraction":null,"screen_n_in":null,"score":{"opus":0.01851674850607874,"gpt":0.2784781831266818,"spread":0.259961434620603,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002332717,0.00005102774,0.00005987337,0.0001016161,0.00006557714,0.00006545169,0.0003015938,0.00002770556,0.000006551853],"category_scores_gemma":[0.0001229386,0.00004477922,0.00003457611,0.000379127,0.00000652162,0.0001011524,0.00003027205,0.00002602367,0.00001084792],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001670859,"about_ca_system_score_gemma":0.00002550837,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001400235,"about_ca_topic_score_gemma":5.345848e-7,"domain_scores_codex":[0.9995322,0.0000198538,0.00009348746,0.0001575744,0.00007191605,0.0001249663],"domain_scores_gemma":[0.9995602,0.00008412942,0.00002770415,0.0002276785,0.00006803074,0.00003225017],"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":[5.176281e-7,0.0000320415,0.00006969669,0.000004839379,0.000005216479,5.048647e-7,0.00004178251,0.002396095,0.00003865109,0.9686607,0.01130578,0.01744418],"study_design_scores_gemma":[0.0001250482,0.0000410986,0.00002695639,0.000001656443,0.00000114077,0.000003825134,0.000002438657,0.9362318,0.002412372,0.0220016,0.03905306,0.00009902086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00006841228,0.00006608115,0.9726428,0.0001681782,0.0001181282,0.00009689954,2.237555e-7,0.000495462,0.02634383],"genre_scores_gemma":[0.1220704,0.000009699705,0.8752333,0.0002979922,0.000002572454,0.000008160891,6.14985e-7,0.00000328737,0.002373944],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9466591,"threshold_uncertainty_score":0.1826043,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020517863","doi":"10.1109/micro.2014.22","title":"Load Value Approximation","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":158,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Latency (audio); Parallel computing; Speedup; Approximation error; Range (aeronautics); Efficient energy use; Parsec; Value (mathematics); Energy (signal processing); Real-time computing; Algorithm; Electrical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01116037258711738,"gpt":0.2386836109331823,"spread":0.2275232383460649,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003039071,0.00004504385,0.00004887459,0.00003214427,0.00005275675,0.00007852576,0.0003384048,0.00002376232,0.000006154137],"category_scores_gemma":[0.0000444952,0.00003845861,0.00001857324,0.0001363247,0.000007821583,0.0001700492,0.00007844631,0.00003161801,0.00006953083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001664547,"about_ca_system_score_gemma":0.00001739105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000962972,"about_ca_topic_score_gemma":2.997562e-7,"domain_scores_codex":[0.9995124,0.00003981281,0.00008560381,0.0001417981,0.0001333525,0.0000870307],"domain_scores_gemma":[0.9995907,0.00003042286,0.00002953478,0.0002656984,0.0000554168,0.00002825592],"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":[2.801053e-7,0.0000128478,0.00003764211,0.000002358428,0.000001190768,9.519348e-8,0.0000821675,0.005461138,0.00006700455,0.9479734,0.004600877,0.041761],"study_design_scores_gemma":[0.00005642034,0.0000185335,0.000121888,0.000002696996,3.696861e-7,0.000001796614,5.901304e-7,0.9654844,0.003021634,0.02327644,0.007955168,0.00006009214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001751018,0.000005884885,0.8742124,0.0004593089,0.00006037516,0.00003489684,1.725433e-8,0.0008357517,0.1242163],"genre_scores_gemma":[0.2959145,0.000001512285,0.7028116,0.0005230359,0.00002356556,0.000002681745,4.104393e-7,0.000001953792,0.0007207691],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9600232,"threshold_uncertainty_score":0.1568297,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2088092680","doi":"10.1016/j.jpdc.2014.07.001","title":"A survey of high level frameworks in block-structured adaptive mesh refinement packages","year":2014,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":158,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Perimeter Institute; University of Guelph","funders":"Lawrence Berkeley National Laboratory; Deutsche Forschungsgemeinschaft; National Energy Research Scientific Computing Center; National Science Foundation; Compute Canada; Office of Science; National Aeronautics and Space Administration; Argonne National Laboratory; National Energy Technology Laboratory; U.S. Department of Energy; Natural Sciences and Engineering Research Council of Canada; National Nuclear Security Administration; Louisiana State University","keywords":"Computer science; Block (permutation group theory); Set (abstract data type); Range (aeronautics); Architecture; Adaptive mesh refinement; Domain (mathematical analysis); Cover (algebra); Programming language; Computational science; Archaeology","retraction":null,"screen_n_in":null,"score":{"opus":0.02661456877355989,"gpt":0.266046701316634,"spread":0.2394321325430741,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001616262,0.0001964778,0.0005564048,0.0002200605,0.00009255742,0.00008621962,0.0006070362,0.0001785377,0.000002268876],"category_scores_gemma":[0.0004433001,0.0001670439,0.00007725132,0.0005516306,0.00006235387,0.0001535434,0.0002762808,0.0005292589,4.014693e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004322733,"about_ca_system_score_gemma":0.00007910935,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001720221,"about_ca_topic_score_gemma":0.0000266263,"domain_scores_codex":[0.9978347,0.0003896256,0.0009058207,0.0002506005,0.0003397363,0.0002795304],"domain_scores_gemma":[0.9976834,0.0005089406,0.0009330242,0.0002577279,0.0004972261,0.000119678],"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.0002749989,0.0004390362,0.06700125,0.00008514509,0.0002207247,0.00005791512,0.001299517,0.8197505,0.000166183,0.03377616,0.003641256,0.07328726],"study_design_scores_gemma":[0.001191331,0.0003665245,0.4283053,0.0002357786,0.00001088045,0.00005375504,0.00003170895,0.5637193,0.000189133,0.005625192,0.00005038369,0.0002206781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1489388,0.000245805,0.8502659,0.0002527508,0.000140831,0.0000676507,0.0000142711,0.00003440763,0.00003950661],"genre_scores_gemma":[0.8016086,0.00003359308,0.1982209,0.00007317786,0.00004471106,4.565537e-7,0.000008936224,0.000005800707,0.00000382873],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6526698,"threshold_uncertainty_score":0.6811852,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4234669735","doi":"10.1109/edtc.1995.470354","title":"Describing instruction set processors using nML","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":156,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Canadian Institute of Steel Construction","keywords":"Computer science; Programmer; Formalism (music); Programming language; Set (abstract data type); Instruction set; Theoretical computer science; Parallel computing","retraction":null,"screen_n_in":null,"score":{"opus":0.1006394418777845,"gpt":0.2709905581960719,"spread":0.1703511163182874,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009731335,0.00007315636,0.00006725085,0.00009899882,0.0001473105,0.0001352653,0.0003102148,0.00003755194,0.00003837296],"category_scores_gemma":[0.00002796929,0.00006822728,0.00002314279,0.0003862105,0.00001495036,0.0004779932,0.00009287406,0.00006169159,0.00001770058],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003052186,"about_ca_system_score_gemma":0.0000115252,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001741451,"about_ca_topic_score_gemma":7.20047e-7,"domain_scores_codex":[0.9993679,0.00002444135,0.0001305099,0.0002049442,0.0001236574,0.000148538],"domain_scores_gemma":[0.9996203,0.0000109184,0.00005236397,0.0002022573,0.0000620568,0.00005206082],"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.000005568677,0.0002273899,0.004304579,0.00006412034,0.00004767563,0.00002642432,0.006968199,0.2439705,0.002496382,0.1168545,0.01876585,0.6062689],"study_design_scores_gemma":[0.00008653039,0.00001363346,0.00001811309,0.00001529502,0.000001094606,0.00003144508,0.00001045167,0.9952283,0.003523763,0.0005540244,0.0004167629,0.0001006144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02680537,0.00003889111,0.9644712,0.0001503837,0.0001081428,0.00005412069,1.029572e-7,0.0008964815,0.007475268],"genre_scores_gemma":[0.5287434,0.000007962582,0.4708678,0.0001542018,0.00002208563,0.000001230125,2.598801e-7,0.000003529086,0.0001995259],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7512578,"threshold_uncertainty_score":0.2782228,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2164348333","doi":"10.1145/2379776.2379780","title":"Survey of scheduling techniques for addressing shared resources in multicore processors","year":2012,"lang":"en","type":"review","venue":"ACM Computing Surveys","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":156,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Thread (computing); Multi-core processor; Scheduling (production processes); Shared resource; Architecture; Distributed computing; Instruction set; Cache; Computer architecture; Embedded system; Operating system; Parallel computing","retraction":null,"screen_n_in":null,"score":{"opus":0.1980098304110593,"gpt":0.3957048113664924,"spread":0.1976949809554332,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.01424046,0.000674116,0.002323033,0.0009111956,0.0002172284,0.0002809075,0.004103098,0.0005604345,0.000001763889],"category_scores_gemma":[0.003935758,0.000632112,0.0003493067,0.001975245,0.00009761181,0.0003518713,0.001694136,0.000619455,0.000003163892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001356792,"about_ca_system_score_gemma":0.0003548761,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004415118,"about_ca_topic_score_gemma":0.00006589333,"domain_scores_codex":[0.9928878,0.003049999,0.001806097,0.001019013,0.0004149253,0.000822196],"domain_scores_gemma":[0.9908497,0.005060852,0.001777256,0.001556119,0.0006275443,0.0001284721],"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.000001935549,0.00009605691,0.001249398,0.006542183,0.00004059972,0.000001578295,0.000362601,0.0003682679,3.077954e-7,0.00003490434,0.00004988036,0.9912523],"study_design_scores_gemma":[0.001717293,0.0005682667,0.01900512,0.1660772,0.0005148776,0.00008245676,0.00004110823,0.6399858,0.0002565477,0.0007817333,0.1637544,0.00721511],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"review","genre_gemma":"methods","genre_scores_codex":[0.00003400028,0.5131975,0.48518,0.000005903987,0.0001580206,0.0008117628,0.00003042507,0.0005426666,0.00003974457],"genre_scores_gemma":[0.0045736,0.2939231,0.7008409,0.00001832975,0.0001554009,0.00008786568,0.00026128,0.0001143549,0.00002523754],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9840372,"threshold_uncertainty_score":0.999613,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964225254","doi":"10.1145/1880018.1880019","title":"Contention-Aware Scheduling on Multicore Systems","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Computer Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":155,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scheduling (production processes); Distributed computing; Workload; Thread (computing); Multi-core processor; Fair-share scheduling; Cache; Shared memory; Parallel computing; Quality of service; Operating system; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.02648338605496015,"gpt":0.2628462369562809,"spread":0.2363628509013208,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000433703,0.0003335465,0.0003731829,0.0003923737,0.0005067851,0.0007560887,0.001697,0.0002258986,0.000006087931],"category_scores_gemma":[0.000020535,0.0003099812,0.0001766151,0.000450912,0.00004824204,0.0003731148,0.00003951737,0.0006733786,0.0001757705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006125437,"about_ca_system_score_gemma":0.0000609691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001390068,"about_ca_topic_score_gemma":0.000007677166,"domain_scores_codex":[0.9976389,0.0001802225,0.0005665326,0.000735664,0.0004771714,0.0004015567],"domain_scores_gemma":[0.9971322,0.0003581527,0.0002090675,0.001803961,0.0003012121,0.0001954167],"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.00001723726,0.0004029415,0.0000888045,0.0000967475,0.0001066647,0.00002735746,0.0003588219,0.9514528,0.0003067275,0.01843428,0.001351205,0.02735642],"study_design_scores_gemma":[0.0005002953,0.0002297851,0.0001050325,0.0002371979,0.000009584253,0.00008796369,0.00002665018,0.9945075,0.0004182685,0.00006266963,0.003457656,0.0003573902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004134219,0.00004588506,0.9804813,0.0003581009,0.01235466,0.0005743249,0.000009693782,0.001764872,0.0002769906],"genre_scores_gemma":[0.8519436,0.000009591955,0.1468652,0.0001870853,0.0004807153,0.0000979028,0.000006234734,0.00002961018,0.0003800421],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8478094,"threshold_uncertainty_score":0.9999352,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2047390994","doi":"10.1109/hpca.2014.6835964","title":"Increasing TLB reach by exploiting clustering in page translations","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":154,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Advanced Micro Devices (Canada)","funders":"National Science Foundation","keywords":"Translation lookaside buffer; Locality; Computer science; Bottleneck; Page; Virtual memory; Operating system; Cluster analysis; Parallel computing; Virtual machine; Memory management; Page fault; Set (abstract data type); Cluster (spacecraft); Embedded system; Physical address; Artificial intelligence; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01730971472947552,"gpt":0.2496334948891294,"spread":0.2323237801596539,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006807509,0.00008485313,0.0001044843,0.0001154513,0.000102984,0.0001229957,0.0003551881,0.00004191877,0.000005069323],"category_scores_gemma":[0.00006412689,0.00008616771,0.0000251651,0.0003259361,0.00001162204,0.0003351101,0.00008666241,0.00009776064,0.000005762832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002148442,"about_ca_system_score_gemma":0.00001020275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001592886,"about_ca_topic_score_gemma":0.00002733414,"domain_scores_codex":[0.9991111,0.0001452164,0.0002208764,0.0002380949,0.00009323053,0.000191521],"domain_scores_gemma":[0.9994864,0.0001563518,0.00004510559,0.0002445022,0.00002314171,0.00004443046],"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.00001949279,0.0003514686,0.01705054,0.00008537051,0.00002271846,0.00001165763,0.007772735,0.09946788,0.04101565,0.1440185,0.007797157,0.6823869],"study_design_scores_gemma":[0.0001493384,0.00001495738,0.0004063463,0.00003138354,6.415343e-7,0.000006958376,0.0000142007,0.9957166,0.001277441,0.001337505,0.0009191028,0.0001255778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01341077,0.00002506829,0.9630298,0.000485886,0.00003603904,0.00006454362,2.073374e-7,0.0006376224,0.02231006],"genre_scores_gemma":[0.5975552,0.000004389673,0.4021445,0.0002031897,0.00001284189,0.000004129946,0.000001963438,0.000004515405,0.00006919643],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8962486,"threshold_uncertainty_score":0.3513817,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2080393180","doi":"10.1147/sj.451.0059","title":"Using advanced compiler technology to exploit the performance of the Cell Broadband Engine™ architecture","year":2006,"lang":"en","type":"article","venue":"IBM Systems Journal","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":151,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Compiler; Computer architecture; Exploit; Parallel computing; Microarchitecture; Embedded system; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01087601100992271,"gpt":0.2393543751388366,"spread":0.2284783641289139,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003676421,0.0001205461,0.0001716277,0.0001702007,0.0003476611,0.00011667,0.001142904,0.00006125915,0.000001435646],"category_scores_gemma":[0.00001232906,0.00006722194,0.00006399303,0.0006228875,0.00004847319,0.000112748,0.0001924312,0.000327232,0.000002224719],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004528174,"about_ca_system_score_gemma":0.00006181099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001526664,"about_ca_topic_score_gemma":0.00000115005,"domain_scores_codex":[0.998903,0.0001073862,0.0003643714,0.0001518472,0.0002418922,0.000231489],"domain_scores_gemma":[0.9990537,0.0000409448,0.0002970575,0.0004091014,0.0001629278,0.00003631104],"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.000003476945,0.00001824004,0.001548756,0.0000165233,0.000005055508,0.000001361099,0.0001741771,0.9894493,0.004104175,0.0003919187,0.0006204342,0.003666534],"study_design_scores_gemma":[0.0004810503,0.0001637659,0.001322796,0.000394719,0.00001085551,0.001168675,0.00007832766,0.945609,0.03806456,0.0004071721,0.0120177,0.0002814117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3384273,0.0003606883,0.6597579,0.0003488625,0.0004512784,0.0001599202,6.995386e-7,0.00007978299,0.0004135385],"genre_scores_gemma":[0.9507833,0.000008261362,0.04884083,0.00005510061,0.0001391004,0.000005023286,1.198329e-7,0.000008521472,0.0001597938],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6123559,"threshold_uncertainty_score":0.2741231,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139935536","doi":"10.1145/1513895.1513902","title":"<i>hi</i> CUDA","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":150,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"CUDA; Computer science; Programmer; Compiler; Parallel computing; Code (set theory); General-purpose computing on graphics processing units; Programming language; Programming paradigm; Operating system; Graphics","retraction":null,"screen_n_in":null,"score":{"opus":0.01090360951984743,"gpt":0.2477458379023851,"spread":0.2368422283825377,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008158328,0.00004647573,0.00004834332,0.00003796324,0.00004794393,0.00007604554,0.0004265871,0.00002030504,0.000009168038],"category_scores_gemma":[0.000007592656,0.00003930238,0.00002205121,0.0001828309,0.000005064116,0.0001618601,0.00003945345,0.00003665589,0.00005344615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006239343,"about_ca_system_score_gemma":0.00001190292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002294943,"about_ca_topic_score_gemma":1.337907e-7,"domain_scores_codex":[0.9995865,0.00001275433,0.00007654765,0.0001358106,0.00008210787,0.0001063004],"domain_scores_gemma":[0.9996487,0.00001119397,0.00001854534,0.0002572234,0.00002833103,0.00003593891],"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":[8.112988e-7,0.00005335352,0.00007197328,7.56778e-7,0.000001899001,0.000005237877,0.0001001265,0.001522515,0.0002574281,0.7202054,0.091042,0.1867384],"study_design_scores_gemma":[0.000292951,0.0002490881,0.002191485,0.00001251662,0.000001631079,0.00002896162,0.000003610088,0.7837111,0.02132589,0.1124471,0.07931712,0.000418573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001261419,0.00002586753,0.852391,0.001910691,0.00004294503,0.00002556081,2.745112e-8,0.001049611,0.1444282],"genre_scores_gemma":[0.3468493,0.000008972475,0.6472461,0.00427481,0.00002177842,6.391469e-7,2.936147e-7,0.000001218943,0.001596925],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7821885,"threshold_uncertainty_score":0.1602705,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2107216395","doi":"10.1109/isqed.2007.158","title":"Thermal vs Energy Optimization for DVFS-Enabled Processors in Embedded Systems","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":137,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Frequency scaling; Computer science; Energy consumption; Minification; Energy (signal processing); Thermal; Energy minimization; Optimization problem; Nonlinear programming; Nonlinear system; Embedded system; Real-time computing; Electrical engineering; Engineering; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01244012609550503,"gpt":0.2544930065094757,"spread":0.2420528804139707,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009149317,0.0001237803,0.0001634876,0.0002371465,0.00008542187,0.000150088,0.0005069076,0.0000937365,0.000005017903],"category_scores_gemma":[0.00005539885,0.0001099278,0.00003634194,0.0005378007,0.00001449081,0.0003425911,0.00007438994,0.00005071157,0.000001427027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004990379,"about_ca_system_score_gemma":0.00005576195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006859533,"about_ca_topic_score_gemma":0.00001216195,"domain_scores_codex":[0.9988171,0.00004910723,0.0003420831,0.0003121129,0.0001586618,0.0003208666],"domain_scores_gemma":[0.99926,0.0001316843,0.0001128454,0.0002628459,0.0001735407,0.00005910399],"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.00001881171,0.00004399052,0.00006573385,0.00001897237,0.000003913606,0.000002048439,0.0002122239,0.9565181,0.00005725532,0.03970432,0.0005381071,0.002816545],"study_design_scores_gemma":[0.0003485469,0.00005886648,0.0000348084,0.00002366452,0.000001313925,0.000002374832,0.00002616089,0.9947061,0.003769182,0.0002439927,0.0006305656,0.0001544443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008689784,0.00007043491,0.9907622,0.0001097126,0.0001648017,0.0002520439,3.108406e-7,0.0006368288,0.007134711],"genre_scores_gemma":[0.5234903,0.000009432669,0.475064,0.0002330042,0.0000527031,0.00004512414,0.000006239968,0.00001146719,0.001087724],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5226213,"threshold_uncertainty_score":0.4482725,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}