{"meta":{"query_hash":"8ba3c3aa618b","filters":{"venue":"ACM Transactions on Architecture and Code Optimization"},"cohort_total":40,"direct_labels_cover":0,"predictions_cover":40,"exported":40,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/8ba3c3aa618b","api":"https://metacan.xera.ac/api/v1/cohort?venue=ACM+Transactions+on+Architecture+and+Code+Optimization"},"results":[{"id":"W1979593478","doi":"10.1145/2355585.2355586","title":"Dynamically dispatching speculative threads to improve sequential execution","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Division of Computer and Network Systems; Semiconductor Research Corporation; National Science Foundation","keywords":"Computer science; Speculative multithreading; Thread (computing); Spec#; Parallel computing; Compiler; Speculative execution; Multi-core processor; Multithreading; Benchmark (surveying); Instruction-level parallelism; Execution time; Execution model; Operating system; Embedded system; Programming language; Parallelism (grammar)","score_opus":0.012038153935295453,"score_gpt":0.26157256967392906,"score_spread":0.2495344157386336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979593478","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027129364,0.000031425563,0.9940319,0.0016803254,0.0002547045,0.00032132166,0.000014685394,0.000440392,0.0005123267],"genre_scores_gemma":[0.46199706,0.000023591829,0.53740376,0.00040082217,0.000044328142,0.000026002042,0.000010899618,0.000012094348,0.000081423575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875915,0.00010162827,0.00022210191,0.0003782777,0.00022471376,0.00031410862],"domain_scores_gemma":[0.9990911,0.00008483714,0.000074604235,0.00048564852,0.00007204787,0.00019176728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019474738,0.00020243002,0.00015477023,0.0002497077,0.00033849583,0.00013759526,0.00037488688,0.00009757847,0.000015480793],"category_scores_gemma":[0.000034099372,0.00018779149,0.000064487576,0.00043512354,0.00003314063,0.00040365805,0.00004163784,0.00023096814,0.0000072319863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027947817,0.0000822892,0.000025717667,0.000006802758,0.000018628378,5.1619116e-7,0.001319574,0.8595935,0.0004268653,0.001990444,0.00001552052,0.13649218],"study_design_scores_gemma":[0.00033574665,0.00026396068,0.00049724954,0.00005601017,0.000033303684,0.00002916789,0.000031453805,0.988638,0.0051080296,0.004177,0.00037862296,0.0004514966],"about_ca_topic_score_codex":0.000016351773,"about_ca_topic_score_gemma":0.000013500793,"teacher_disagreement_score":0.45928413,"about_ca_system_score_codex":0.000060664526,"about_ca_system_score_gemma":0.000024750769,"threshold_uncertainty_score":0.7657915},"labels":[],"label_agreement":null},{"id":"W1990962327","doi":"10.1145/2541228.2541231","title":"Optimizing GPU energy efficiency with 3D die-stacking graphics memory and reconfigurable memory interface","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"National Science Foundation","keywords":"Computer science; Dram; Graphics; Registered memory; Embedded system; Computer hardware; Parallel computing; Graphics processing unit; Non-volatile random-access memory; Memory architecture; Efficient energy use; Semiconductor memory; Computer architecture; Computer memory; Memory refresh; Operating system","score_opus":0.009686664645152675,"score_gpt":0.21922189023539854,"score_spread":0.20953522559024587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990962327","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010967805,0.0004372818,0.99465,0.0012531366,0.000081189086,0.00026844663,0.0000037331736,0.0005039334,0.0017054967],"genre_scores_gemma":[0.33794236,0.00082042726,0.6602015,0.0005958084,0.000018148867,0.00006459688,0.0000062029976,0.00002972027,0.00032124098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846494,0.000116783944,0.00027949765,0.0006045215,0.00022046512,0.00031381354],"domain_scores_gemma":[0.99881417,0.00018033932,0.00013245826,0.00059304025,0.00014108306,0.00013893346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016105197,0.00028683097,0.00023524012,0.00037732784,0.0005545664,0.00035956365,0.0004562097,0.0001222125,0.000029816705],"category_scores_gemma":[0.000020292056,0.0002441393,0.000043212618,0.0004657813,0.000120877805,0.000494249,0.000024520501,0.00030249314,0.0000016655227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016347876,0.000044411492,0.000003158627,0.00001448419,0.000022476239,0.0000016409475,0.0010073966,0.87253034,0.00009345201,0.00014396363,0.000019740959,0.12610258],"study_design_scores_gemma":[0.00048411766,0.00031017067,0.000015924992,0.00011711164,0.000024407973,0.0000626341,0.00008949497,0.99089843,0.0064178533,0.0008741725,0.00033148425,0.0003741968],"about_ca_topic_score_codex":0.000101680635,"about_ca_topic_score_gemma":0.000048409893,"teacher_disagreement_score":0.3368456,"about_ca_system_score_codex":0.000024818906,"about_ca_system_score_gemma":0.000040846688,"threshold_uncertainty_score":0.99557114},"labels":[],"label_agreement":null},{"id":"W2014468639","doi":"10.1145/2019608.2019609","title":"Hybrid analytical modeling of pending cache hits, data prefetching, and MSHRs","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Superscalar; Cache; Parallel computing; Dram; Latency (audio); CAS latency; CPU cache; Operating system; Computer hardware; Semiconductor memory; Memory controller","score_opus":0.06709639629547699,"score_gpt":0.27660955102403134,"score_spread":0.20951315472855436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014468639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019221494,0.00009596426,0.9967412,0.00024081662,0.000043515083,0.0001359633,0.000022308563,0.00019474748,0.000603376],"genre_scores_gemma":[0.51665807,0.00016767772,0.48307374,0.00005477107,0.000006471827,0.0000030201522,0.00001254136,0.000007880773,0.00001582471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889123,0.00007671374,0.00025917075,0.00045601767,0.00015666115,0.00016020877],"domain_scores_gemma":[0.9988766,0.00007386521,0.00008352111,0.0008283288,0.000054568518,0.00008314615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023568496,0.00015140064,0.00017431212,0.00023206987,0.00019939733,0.00005986991,0.00067037373,0.00005874596,0.000015046772],"category_scores_gemma":[0.00004073054,0.00013948904,0.00002934091,0.00019605293,0.00005183773,0.0003198899,0.000087457825,0.0002040758,3.9491405e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019575047,0.000052097672,0.000025936024,0.000015861113,0.000024521101,0.0000012271414,0.0009031393,0.941057,0.000008367498,0.0005490313,0.000008388798,0.057334855],"study_design_scores_gemma":[0.00019568554,0.00008814411,0.000021888325,0.000040624625,0.00003303466,0.000031780346,0.000021865482,0.99667495,0.00042371044,0.0022957786,0.000027872922,0.00014464707],"about_ca_topic_score_codex":0.000040694562,"about_ca_topic_score_gemma":0.000008245207,"teacher_disagreement_score":0.51473594,"about_ca_system_score_codex":0.000009679955,"about_ca_system_score_gemma":0.00002944338,"threshold_uncertainty_score":0.5688198},"labels":[],"label_agreement":null},{"id":"W2016563136","doi":"10.1145/2207222.2207225","title":"A unified optimizing compiler framework for different GPGPU architectures","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Division of Computing and Communication Foundations","keywords":"Computer science; Compiler; Parallel computing; General-purpose computing on graphics processing units; CUDA; Optimizing compiler; Kernel (algebra); Graphics; Memory hierarchy; Interprocedural optimization; Loop optimization; Programming language; Operating system; Cache","score_opus":0.02322804625764478,"score_gpt":0.2749521265641031,"score_spread":0.2517240803064583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016563136","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00082949945,0.00018856012,0.9953216,0.001944408,0.00028866177,0.0005311551,0.000023624192,0.00066115067,0.00021136862],"genre_scores_gemma":[0.30454716,0.00007646749,0.6944449,0.0006594191,0.00007601978,0.000096569216,0.000015407244,0.000025140795,0.00005888403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984522,0.00012227616,0.00030059402,0.00044252834,0.00022138722,0.0004610156],"domain_scores_gemma":[0.9983318,0.00056181697,0.0001245386,0.0007061387,0.000077396624,0.00019832287],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019434451,0.00031001566,0.00027032377,0.00031988992,0.00053752976,0.00017201243,0.00058943225,0.0001751059,0.000020058871],"category_scores_gemma":[0.00007214954,0.00026586666,0.00012631693,0.00034729255,0.000063267165,0.0001682841,0.000037796086,0.00036955616,0.0000019125687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005430176,0.00014493248,0.000025292782,0.000022472774,0.000037275364,2.608222e-7,0.0011916541,0.92624646,0.000035875226,0.0073838667,0.000043727043,0.064813904],"study_design_scores_gemma":[0.0008367918,0.0003682714,0.00024385772,0.00013543667,0.000063222986,0.000043436085,0.00004906194,0.959689,0.004522659,0.031847823,0.0015346046,0.00066579063],"about_ca_topic_score_codex":0.0000031830484,"about_ca_topic_score_gemma":0.0000037499076,"teacher_disagreement_score":0.30371767,"about_ca_system_score_codex":0.000034939698,"about_ca_system_score_gemma":0.00002212698,"threshold_uncertainty_score":0.9999794},"labels":[],"label_agreement":null},{"id":"W2035709574","doi":"10.1145/2512429","title":"Designing on-chip networks for throughput accelerators","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Iran Telecommunication Research Center; National Research Foundation of Korea; National IT Industry Promotion Agency; Ministry of Science, ICT and Future Planning; National Research Foundation","keywords":"Computer science; Dram; Throughput; Network on a chip; Embedded system; Bandwidth (computing); Parallel computing; Graphics processing unit; Chip; Computer architecture; Computer hardware; Computer network; Operating system; Wireless","score_opus":0.019053741046177793,"score_gpt":0.2342818736979202,"score_spread":0.2152281326517424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035709574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043241103,0.00003900463,0.996113,0.001687483,0.0005230892,0.00060571847,0.0000041217777,0.00017024361,0.00042494],"genre_scores_gemma":[0.7178422,0.00005009857,0.2798817,0.001490108,0.00015015418,0.00028577185,0.000007847389,0.000023786919,0.000268312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892974,0.00007742466,0.00022639555,0.00039143584,0.0001248672,0.0002501602],"domain_scores_gemma":[0.99901384,0.00030076512,0.00007358527,0.00043378895,0.0000923129,0.00008568709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012973175,0.00018322207,0.00016120957,0.00013879717,0.0004689548,0.00030986647,0.0003345891,0.000116018244,0.000044079126],"category_scores_gemma":[0.000016462565,0.0001534899,0.000082997205,0.0002634289,0.00002532036,0.00029163808,0.000008722585,0.00021116743,0.0000073732253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001680498,0.000029913303,0.000004199663,0.000006031085,0.0000222381,2.586746e-7,0.0003139764,0.9143949,0.000030919146,0.0009508112,0.0002875598,0.08394235],"study_design_scores_gemma":[0.00040514948,0.00032112355,0.000025845466,0.000046594338,0.000011086137,0.000014217307,0.000044899,0.9952127,0.000534357,0.0021872364,0.0009971092,0.00019971479],"about_ca_topic_score_codex":0.000014948743,"about_ca_topic_score_gemma":0.000021712263,"teacher_disagreement_score":0.7174098,"about_ca_system_score_codex":0.000024510595,"about_ca_system_score_gemma":0.000017114657,"threshold_uncertainty_score":0.6259137},"labels":[],"label_agreement":null},{"id":"W2037303555","doi":"10.1145/1369396.1369399","title":"Compiler and hardware support for reducing the synchronization of speculative threads","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Intel Corporation; National Aeronautics and Space Administration; National Science Foundation","keywords":"Computer science; Compiler; Speculative multithreading; Parallel computing; Exploit; Dataflow; Synchronizing; Speculation; Thread (computing); Synchronization (alternating current); Scheduling (production processes); Embedded system; Operating system; Multithreading; Computer network","score_opus":0.020862637840641293,"score_gpt":0.2550579337353402,"score_spread":0.2341952958946989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037303555","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007452919,0.000068483714,0.9971066,0.0013095359,0.000055058328,0.0003611733,0.00001922965,0.00012809064,0.00020652276],"genre_scores_gemma":[0.4400754,0.00025334684,0.5593082,0.00019694488,0.000015946236,0.000026225849,0.000016835229,0.0000102425165,0.00009689263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992028,0.00005691656,0.0002072112,0.00027481688,0.00013429829,0.0001239694],"domain_scores_gemma":[0.9991256,0.00024181102,0.00010819241,0.00035016178,0.0001338352,0.00004039305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012779617,0.00012748134,0.00014543488,0.00013061216,0.00046402792,0.000039230777,0.00024828876,0.000060315517,0.0000081211465],"category_scores_gemma":[0.00004198088,0.00009823532,0.000043352153,0.0002788445,0.00011759428,0.00014449612,0.000017977643,0.000110423556,2.5266107e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021726937,0.00003362674,0.000033204098,0.00001620879,0.000019818666,3.9146926e-7,0.0017866115,0.9525648,0.000029523128,0.000871108,0.0000800847,0.044542894],"study_design_scores_gemma":[0.00040660158,0.00026076142,0.00032623328,0.000038651917,0.000022733162,0.000060568113,0.000028656084,0.9942608,0.002042216,0.0020316185,0.0003722719,0.00014889808],"about_ca_topic_score_codex":0.000006625885,"about_ca_topic_score_gemma":0.0000045625143,"teacher_disagreement_score":0.4393301,"about_ca_system_score_codex":0.000014008676,"about_ca_system_score_gemma":0.0000421671,"threshold_uncertainty_score":0.40059203},"labels":[],"label_agreement":null},{"id":"W2050419810","doi":"10.1145/2541228.2541233","title":"The design and implementation of heterogeneous multicore systems for energy-efficient speculative thread execution","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Division of Computer and Network Systems; Division of Computing and Communication Foundations; Semiconductor Research Corporation; International Business Machines Corporation; National Science Foundation","keywords":"Computer science; Uniprocessor system; Multi-core processor; Thread (computing); Parallel computing; Context switch; Efficient energy use; Spec#; Energy consumption; Speculative multithreading; Exploit; Embedded system; Simultaneous multithreading; Multithreading; Instruction set; Microarchitecture; Control reconfiguration; Multiprocessing; Operating system","score_opus":0.015645659846109647,"score_gpt":0.2602533367090387,"score_spread":0.24460767686292906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050419810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001140209,0.0002610664,0.9970756,0.0005496408,0.000073769654,0.00078049465,0.0000088149545,0.00009986948,0.000010491417],"genre_scores_gemma":[0.5483377,0.00035953082,0.45100042,0.00004899658,0.000009422854,0.0002041208,0.000007472884,0.000009301106,0.00002305994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912566,0.000111329995,0.00023826434,0.00025154615,0.00012774227,0.00014543362],"domain_scores_gemma":[0.99905914,0.00032934357,0.00013513879,0.00027910864,0.00015167275,0.00004558007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015513164,0.00012864145,0.000117598145,0.00010564951,0.00039932513,0.00014665931,0.00019959598,0.000052268973,0.0000020451278],"category_scores_gemma":[0.000012797499,0.00009503698,0.00003693319,0.0001584643,0.0000570245,0.0000923938,0.000013648953,0.00005653921,1.9871824e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001399442,0.000020175681,0.0000026206399,0.0000085798765,0.000018936733,7.3534416e-8,0.0004314681,0.92692673,0.00006937826,0.0019460889,0.000015116238,0.07054681],"study_design_scores_gemma":[0.00031648378,0.0002101823,0.00004126902,0.000019417841,0.000015549034,0.00001094865,0.00007954689,0.99291074,0.003776714,0.0024409334,0.00007563077,0.000102584105],"about_ca_topic_score_codex":0.00006295735,"about_ca_topic_score_gemma":0.000010286775,"teacher_disagreement_score":0.54719746,"about_ca_system_score_codex":0.000020129124,"about_ca_system_score_gemma":0.000021439424,"threshold_uncertainty_score":0.38754955},"labels":[],"label_agreement":null},{"id":"W2072873664","doi":"10.1145/2818374","title":"Reuse Distance-Based Probabilistic Cache Replacement","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Security Agency","keywords":"Computer science; Cache; Overhead (engineering); Reuse; Probabilistic logic; Spec#; CPU cache; Dram; Parallel computing; Cache algorithms; Operating system; Computer hardware; Programming language; Artificial intelligence","score_opus":0.025274851090280555,"score_gpt":0.25576089299935606,"score_spread":0.2304860419090755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072873664","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019189922,0.00006438932,0.99398965,0.004233802,0.00011175625,0.00030165343,0.000009362329,0.00057473767,0.0005227565],"genre_scores_gemma":[0.20048562,0.000027375756,0.79855853,0.0006173129,0.00001768845,0.00005885995,0.000016234377,0.000014867654,0.00020351903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987557,0.00012257173,0.0002301495,0.00043811018,0.00025868378,0.00019481097],"domain_scores_gemma":[0.9984189,0.000108465516,0.000086188345,0.0011031516,0.00013033487,0.00015296045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025100724,0.000179111,0.00014638058,0.00017623312,0.00021421944,0.00014212796,0.0006415807,0.00007790705,0.000008594051],"category_scores_gemma":[0.00014481497,0.00016101054,0.000043995507,0.00041811398,0.000053950534,0.000149747,0.000028365794,0.00018701411,0.0000033564547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000584473,0.00008593331,0.000012743853,0.000009810593,0.000008539714,0.0000013989388,0.00042582353,0.98194736,0.0000041482003,0.0005128215,0.00024323104,0.016689714],"study_design_scores_gemma":[0.00066610734,0.0003333464,0.000013434028,0.000038256854,0.000015577094,0.00001090168,0.000013072742,0.9896565,0.0005194224,0.00577818,0.0027373554,0.0002178613],"about_ca_topic_score_codex":0.00000877176,"about_ca_topic_score_gemma":0.000016625952,"teacher_disagreement_score":0.20029372,"about_ca_system_score_codex":0.00006989957,"about_ca_system_score_gemma":0.000107249776,"threshold_uncertainty_score":0.65658194},"labels":[],"label_agreement":null},{"id":"W2081373884","doi":"10.1145/1543753.1543756","title":"Dynamic warp formation","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; SIMD; Parallel computing; Thread (computing); Instruction set; Control flow; Massively parallel; Operating system; Programming language","score_opus":0.008459880391551905,"score_gpt":0.24081069080865528,"score_spread":0.23235081041710337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081373884","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021359629,0.00006017276,0.9930213,0.0050516427,0.000063344385,0.00017752824,0.0000042469887,0.00065021677,0.0007579398],"genre_scores_gemma":[0.32508615,0.00019907636,0.6735979,0.00095762336,0.0000070994615,0.000008934488,0.000012369567,0.0000064531077,0.00012440396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912167,0.00005645851,0.00019857104,0.00028789617,0.00016173691,0.00017368571],"domain_scores_gemma":[0.99927837,0.000050581188,0.000070982474,0.00047185272,0.000058542704,0.00006966626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010290638,0.00015117842,0.0001177479,0.00024870195,0.00030255973,0.000138221,0.00038793887,0.000081007296,0.000009747547],"category_scores_gemma":[0.000016490008,0.00014056938,0.00004791833,0.00038139257,0.000021049767,0.00038558815,0.000008739476,0.00017587615,0.000004478177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000085625325,0.000035237103,3.9155648e-7,0.0000028796658,0.0000033851018,6.675683e-7,0.00027642184,0.74043787,0.000048971942,0.0004957302,0.000030035511,0.25865987],"study_design_scores_gemma":[0.00025531242,0.0002146274,0.00006315645,0.00002379803,0.0000082325105,0.00003716673,0.0000075130947,0.98863125,0.0009174798,0.009163249,0.00050518394,0.00017304622],"about_ca_topic_score_codex":0.0000014137189,"about_ca_topic_score_gemma":0.00000510537,"teacher_disagreement_score":0.32487255,"about_ca_system_score_codex":0.000029321282,"about_ca_system_score_gemma":0.00001779506,"threshold_uncertainty_score":0.57322526},"labels":[],"label_agreement":null},{"id":"W2091873788","doi":"10.1145/2686034","title":"Optimizing Memory Translation Emulation in Full System Emulators","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Emulation; Computer science; Translation lookaside buffer; Embedded system; Hardware emulation; Operating system; Software; Parallel computing; Speedup; Performance improvement; Physical address; Semiconductor memory","score_opus":0.026389964046619124,"score_gpt":0.25443037039220945,"score_spread":0.22804040634559034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091873788","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019318195,0.00015495696,0.9949887,0.00079013867,0.00018291555,0.00035970224,0.00000468651,0.0006954118,0.00089171395],"genre_scores_gemma":[0.49605197,0.000025905818,0.50374776,0.0000835921,0.000018336888,0.000023388739,0.000011026491,0.000014531256,0.000023468503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841857,0.00018554012,0.00038425557,0.00047709665,0.00029491787,0.00023959664],"domain_scores_gemma":[0.99899924,0.00011465816,0.00011504223,0.000527179,0.00010271119,0.00014118208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036693396,0.00022448479,0.00021962919,0.00056021946,0.0001904761,0.00014894402,0.00038639703,0.00015096659,0.0000036131137],"category_scores_gemma":[0.000027491787,0.00022565007,0.000056935645,0.0007482938,0.000032657983,0.0004518122,0.000016038672,0.00025759634,0.0000035682679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045235927,0.000042346608,0.000012449709,0.000016055314,0.000008031022,0.0000026519895,0.002040047,0.9456595,0.000021960805,0.00032662632,0.0000069670305,0.05181811],"study_design_scores_gemma":[0.00080830423,0.0001466022,0.000035660814,0.00007976542,0.000012241897,0.00003167824,0.00013246258,0.99736077,0.0004356827,0.00063226203,0.000083945386,0.00024065163],"about_ca_topic_score_codex":0.000022642504,"about_ca_topic_score_gemma":0.000044371525,"teacher_disagreement_score":0.49412015,"about_ca_system_score_codex":0.00011226797,"about_ca_system_score_gemma":0.00006406895,"threshold_uncertainty_score":0.9201743},"labels":[],"label_agreement":null},{"id":"W2095319311","doi":"10.1145/2663345","title":"Revisiting the Complexity of Hardware Cache Coherence and Some Implications","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Illinois at Urbana-Champaign; Defense Advanced Research Projects Agency; National Science Foundation; Ministère de l'Économie, de la Science et de l'Innovation - Québec; Microelectronics Advanced Research Corporation; Qualcomm; Division of Computing and Communication Foundations; Semiconductor Research Corporation","keywords":"Computer science; Cache coherence; Correctness; Protocol (science); Model checking; Exploit; Software; Formal verification; Coherence (philosophical gambling strategy); Embedded system; Programming complexity; Cache; Theoretical computer science; Distributed computing; Parallel computing; Programming language; CPU cache; Software development; Cache algorithms; Computer security","score_opus":0.029602047206979152,"score_gpt":0.2612191057671024,"score_spread":0.23161705856012324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095319311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005008171,0.00009973741,0.988579,0.0101445485,0.000026231197,0.00017583676,0.000012078199,0.00016385621,0.00029789837],"genre_scores_gemma":[0.5407024,0.0001335759,0.4586446,0.00043106364,0.000024867959,0.000019567122,0.000006014667,0.000007120313,0.000030775125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914944,0.00013838924,0.00020565433,0.00027184037,0.00011124189,0.0001234228],"domain_scores_gemma":[0.9989612,0.00023505308,0.00011611784,0.0005518304,0.000085369735,0.000050389808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023004871,0.000119137345,0.00013926746,0.0000930314,0.000425736,0.00008635976,0.00041631327,0.000051165793,0.000004889396],"category_scores_gemma":[0.00005936716,0.00009095575,0.000034707897,0.0002584616,0.00019567789,0.00014375818,0.000032232736,0.00016773253,4.979621e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006216876,0.000018418328,0.000055161414,0.000022053251,0.000013118012,6.956203e-8,0.00048165864,0.73695475,0.00010082034,0.021348285,0.000015141403,0.24098429],"study_design_scores_gemma":[0.0002724532,0.00010080576,0.0018832312,0.00007272534,0.00002607593,0.000026749343,0.000022941345,0.9529589,0.0013072041,0.042493034,0.00063850626,0.00019740236],"about_ca_topic_score_codex":0.000013624851,"about_ca_topic_score_gemma":0.000006200214,"teacher_disagreement_score":0.5402016,"about_ca_system_score_codex":0.000008441675,"about_ca_system_score_gemma":0.000018083456,"threshold_uncertainty_score":0.3709068},"labels":[],"label_agreement":null},{"id":"W2106075707","doi":"10.1145/2724718","title":"MAGIC","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Semiconductor materials and devices","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University; Intel Corporation; National Science Foundation","keywords":"Computer science; MAGIC (telescope); Process (computing); Embedded system; Operating system","score_opus":0.019623394055620923,"score_gpt":0.21815001530186295,"score_spread":0.19852662124624204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106075707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058080014,0.00025473576,0.9384265,0.0002570709,0.00036261734,0.00009570208,0.000027308022,0.00029221963,0.0022038443],"genre_scores_gemma":[0.9643685,0.0001625968,0.03507395,0.0001800003,0.000053225398,0.000010970514,0.000016539812,0.000025877498,0.0001083247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964154,0.000012628172,0.000086573345,0.000098493154,0.0000704523,0.000090297355],"domain_scores_gemma":[0.99972975,0.000018386581,0.000009450899,0.0001540339,0.000018832267,0.000069553746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000037012032,0.000090679576,0.000077767974,0.00007006484,0.000035868437,0.000039561837,0.00006424105,0.00004709262,0.00009386393],"category_scores_gemma":[0.0000059708686,0.000080328275,0.000016453434,0.00008749426,0.000015527034,0.00007083893,0.0000015883995,0.00007325794,0.000013156062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011628153,0.00000765706,0.000004567038,0.000010970594,0.000010447831,5.6123275e-7,0.0002727894,0.9874411,0.0010958308,0.000012797609,0.000077497214,0.011054147],"study_design_scores_gemma":[0.003093366,0.00048431897,0.0002426778,0.00012651057,0.00019208464,0.00017781621,0.00075114996,0.87806463,0.06256901,0.010955486,0.04201569,0.0013272545],"about_ca_topic_score_codex":0.000004797615,"about_ca_topic_score_gemma":0.000016685795,"teacher_disagreement_score":0.9062885,"about_ca_system_score_codex":0.000012047642,"about_ca_system_score_gemma":0.0000065430863,"threshold_uncertainty_score":0.3275692},"labels":[],"label_agreement":null},{"id":"W2116394526","doi":"10.1145/2541228.2555307","title":"WADE","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Division of Computing and Communication Foundations; National Science Foundation","keywords":"Computer science; Cache; Cache-only memory architecture; Embedded system; Dram; Static random-access memory; Overhead (engineering); Non-volatile memory; Cache pollution; CPU cache; Latency (audio); Operating system; Microprocessor; Parallel computing; Cache coloring; Cache algorithms; Computer hardware; Telecommunications","score_opus":0.010105644441797878,"score_gpt":0.22717923548104274,"score_spread":0.21707359103924487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116394526","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027609605,0.00004250682,0.9931117,0.004425646,0.0000768894,0.00022370162,0.0000025000568,0.00058310357,0.0012578288],"genre_scores_gemma":[0.16101786,0.00012231234,0.8373142,0.0010107192,0.000018031364,0.000053513555,0.0000049685073,0.000012155285,0.00044621964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991475,0.000056525056,0.00016315682,0.00031512018,0.00014094627,0.00017680101],"domain_scores_gemma":[0.999199,0.00008389081,0.000049265862,0.0005116059,0.000068533926,0.00008771837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000671279,0.00014132715,0.00010974489,0.00018580054,0.00025612485,0.00018895858,0.00043695813,0.000075085125,0.00007553627],"category_scores_gemma":[0.000018297542,0.00012502496,0.000042067284,0.000315887,0.00003518455,0.00028540552,0.000018503637,0.0001747911,0.000022667848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002534195,0.00003237183,0.0000049467553,0.0000036973925,0.000008069081,4.1504114e-7,0.0002303695,0.826876,0.000041552383,0.0005168783,0.00017088398,0.17211229],"study_design_scores_gemma":[0.0002458497,0.00012026735,0.00011526286,0.000019699222,0.0000072970292,0.000024340894,0.000010438097,0.98759466,0.0014301282,0.008947896,0.0012692461,0.0002149269],"about_ca_topic_score_codex":0.000017239345,"about_ca_topic_score_gemma":0.0000044026547,"teacher_disagreement_score":0.17189735,"about_ca_system_score_codex":0.000014167549,"about_ca_system_score_gemma":0.000018874325,"threshold_uncertainty_score":0.509837},"labels":[],"label_agreement":null},{"id":"W2233147800","doi":"10.1145/2840807","title":"Citadel","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Defense Advanced Research Projects Agency","keywords":"Computer science; Cache; Cache-only memory architecture; Granularity; Registered memory; Embedded system; CPU cache; Interleaved memory; Dram; Parallel computing; Overlay; Computer hardware; Memory management; Operating system; Cache coloring","score_opus":0.012470259115192277,"score_gpt":0.23610710468421053,"score_spread":0.22363684556901825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2233147800","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012972859,0.00003569123,0.9912192,0.0070788395,0.00008517002,0.000117658295,0.0000076794995,0.0005679415,0.0007580879],"genre_scores_gemma":[0.21408725,0.0002487507,0.7843497,0.000647524,0.000021135715,0.000021816353,0.0000018191356,0.00001268971,0.000609311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913514,0.000056862104,0.00015727397,0.00033712553,0.0001443342,0.00016926185],"domain_scores_gemma":[0.9991479,0.00014068793,0.000050898896,0.00052777474,0.000054612487,0.00007815072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000096397074,0.00013534434,0.000105108746,0.00019463518,0.00021411927,0.0000771967,0.00042359822,0.0000719622,0.000031140193],"category_scores_gemma":[0.000029950996,0.00009377094,0.000044347737,0.00027360715,0.00004432184,0.00021780618,0.000017859684,0.00009564472,0.000008569358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012683099,0.000038239486,0.00000855345,0.0000033515432,0.00001179947,0.0000011694766,0.00016488618,0.557749,0.0001667368,0.0018756235,0.00010954719,0.43985844],"study_design_scores_gemma":[0.0018010483,0.0005836674,0.00022072875,0.00019082469,0.00003372501,0.0001170241,0.00001587702,0.9340273,0.01318771,0.03921077,0.009719405,0.0008919109],"about_ca_topic_score_codex":0.0000022224265,"about_ca_topic_score_gemma":0.0000041414196,"teacher_disagreement_score":0.4389665,"about_ca_system_score_codex":0.00001908053,"about_ca_system_score_gemma":0.000022802295,"threshold_uncertainty_score":0.38238677},"labels":[],"label_agreement":null},{"id":"W2240238332","doi":"10.1145/2831234","title":"F <scp>ault</scp> S <scp>im</scp>","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Semiconductor materials and devices","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Defense Advanced Research Projects Agency; Microelectronics Advanced Research Corporation","keywords":"Computer science; BCH code; Dram; Reliability engineering; Reliability (semiconductor); Monte Carlo method; Parallel computing; Error detection and correction; Algorithm; Computer hardware; Engineering","score_opus":0.01733603363015965,"score_gpt":0.21889933386197813,"score_spread":0.20156330023181848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2240238332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25614378,0.00076876854,0.73615813,0.00011740641,0.00078492967,0.00026445024,0.00011003305,0.00061675103,0.005035733],"genre_scores_gemma":[0.9467749,0.0007483221,0.050402556,0.00043197564,0.00026169876,0.00007977665,0.000116223266,0.00012334873,0.0010612097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900174,0.000041612566,0.00022946349,0.00026351085,0.00019284752,0.0002708022],"domain_scores_gemma":[0.9991377,0.00022407048,0.00004147302,0.0003462306,0.00006312186,0.00018740626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010474681,0.00024859572,0.00021348428,0.00018167059,0.00013435597,0.0001247426,0.00017828529,0.0001582616,0.00002582556],"category_scores_gemma":[0.00010115357,0.00022982163,0.000055189113,0.00024632592,0.000044582768,0.00018305179,0.000006809107,0.00021692904,0.000028562994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033185952,0.00002853486,0.00001704278,0.0000395081,0.000045418175,0.0000020974373,0.0016500524,0.9899656,0.003269134,0.000017761555,0.0010319082,0.0039295773],"study_design_scores_gemma":[0.0044251047,0.00074331154,0.0005653821,0.0002728976,0.00047817748,0.0002705023,0.004940073,0.62989277,0.1279136,0.0057785804,0.22417165,0.0005479285],"about_ca_topic_score_codex":0.0000141983855,"about_ca_topic_score_gemma":0.000044616874,"teacher_disagreement_score":0.6906311,"about_ca_system_score_codex":0.000031173455,"about_ca_system_score_gemma":0.000022757844,"threshold_uncertainty_score":0.93718535},"labels":[],"label_agreement":null},{"id":"W2330657922","doi":"10.1145/2851502","title":"Examining and Reducing the Influence of Sampling Errors on Feedback-Driven Optimizations","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"U.S. Department of Energy; National Science Foundation","keywords":"Computer science; Compiler; Sampling (signal processing); Optimizing compiler; Profiling (computer programming); Algorithm; Detector; Programming language","score_opus":0.025459240443890786,"score_gpt":0.2574581186130349,"score_spread":0.23199887816914413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2330657922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028959105,0.000026141792,0.9666411,0.0037739133,0.00004872387,0.0002079232,0.000011437045,0.00019643425,0.00013520812],"genre_scores_gemma":[0.5885542,0.00018398551,0.41095263,0.00020513574,0.000009490878,0.000016475622,0.0000015888996,0.000010694728,0.00006582002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988539,0.00010868663,0.00027500233,0.0003967769,0.00018762465,0.0001779611],"domain_scores_gemma":[0.9985462,0.00054417603,0.00014738196,0.00058882654,0.000106802756,0.00006664918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018778778,0.00017423878,0.00015939312,0.00024037067,0.00043833157,0.00007756426,0.00043687172,0.00007837288,0.0000064777146],"category_scores_gemma":[0.000118884265,0.00011200494,0.00003412676,0.00041140203,0.00013862483,0.00022335153,0.000037264486,0.00016124967,8.0359786e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001460961,0.000024035426,0.000034584988,0.0000065194267,0.000014054975,2.5745632e-7,0.00062942004,0.9376585,0.0003808473,0.00059125136,0.0000076085935,0.06063832],"study_design_scores_gemma":[0.00086153543,0.0005510784,0.0024315426,0.00059064414,0.000046499747,0.00004824237,0.00008650615,0.9877808,0.0040479004,0.0028753835,0.00022535339,0.00045449703],"about_ca_topic_score_codex":0.000009266372,"about_ca_topic_score_gemma":0.000005792743,"teacher_disagreement_score":0.55959505,"about_ca_system_score_codex":0.000019956864,"about_ca_system_score_gemma":0.000033398916,"threshold_uncertainty_score":0.4567429},"labels":[],"label_agreement":null},{"id":"W2751901133","doi":"10.1145/3124452","title":"MiCOMP","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Horizon 2020 Framework Programme; City University of New York","keywords":"Computer science; Compiler; Optimizing compiler; Parallel computing; Heuristics; Speedup; Program optimization; Code (set theory); Sequence (biology); Set (abstract data type); Algorithm; Programming language","score_opus":0.016976133347568218,"score_gpt":0.26363595127099554,"score_spread":0.2466598179234273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751901133","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002776965,0.000032436226,0.99264544,0.004301288,0.0001364148,0.00012649503,0.0000053147446,0.00038330982,0.0020915961],"genre_scores_gemma":[0.29986352,0.0001329688,0.6992134,0.0004175422,0.000022433007,0.000014125281,0.0000031454654,0.000010256029,0.00032263272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991825,0.00004191726,0.0001432091,0.00033587826,0.00013614363,0.00016035387],"domain_scores_gemma":[0.9985555,0.00005589973,0.000105751824,0.0011550016,0.000052535084,0.00007535522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010526259,0.0001393271,0.00012021207,0.00013611217,0.0010364425,0.0004210682,0.000958884,0.0000729724,0.000015299715],"category_scores_gemma":[0.00003832119,0.00012790502,0.000047815967,0.00008618621,0.00006707256,0.00029740855,0.000038129994,0.00017485778,0.000005445321],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009257702,0.000037155645,0.000018147543,0.00000447501,0.000011186316,0.0000016502357,0.00018529405,0.796595,0.00002770055,0.0010861149,0.00005728866,0.20196672],"study_design_scores_gemma":[0.0004525917,0.00013185108,0.0003922858,0.000037982536,0.000012738689,0.000033114135,0.0000056343815,0.98597825,0.0019717338,0.008091355,0.0026181643,0.00027427537],"about_ca_topic_score_codex":0.000010007054,"about_ca_topic_score_gemma":0.000012267978,"teacher_disagreement_score":0.29958582,"about_ca_system_score_codex":0.0000127097455,"about_ca_system_score_gemma":0.000021447355,"threshold_uncertainty_score":0.7971582},"labels":[],"label_agreement":null},{"id":"W2767106296","doi":"10.1145/3232521","title":"CODA","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Advanced Micro Devices; National Science Foundation","keywords":"Thread (computing); Scalability; Exploit; Multithreading; Scheduling (production processes); Data structure; CAS latency; Distributed memory; Shared memory","score_opus":0.012651797860617523,"score_gpt":0.2498807854999817,"score_spread":0.23722898763936417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767106296","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018811425,0.000029895707,0.99493116,0.0018501836,0.00013783171,0.00012847385,0.000004759258,0.0005899746,0.002139635],"genre_scores_gemma":[0.21731685,0.00008258002,0.7812621,0.0009625326,0.000047299498,0.0000138723835,0.0000040737896,0.000011287989,0.00029939422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991299,0.000058217076,0.0001552162,0.0003392297,0.00014656622,0.00017086454],"domain_scores_gemma":[0.99915564,0.00007261094,0.000051948788,0.00054713176,0.00009615106,0.00007650911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010653946,0.0001361837,0.00010622546,0.00020322255,0.00037938953,0.0001247477,0.00045049482,0.00007374688,0.0000414819],"category_scores_gemma":[0.00001833423,0.00012477081,0.000037206104,0.00042654248,0.00008351202,0.00016844565,0.000020287245,0.00014373247,0.000013015988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019197143,0.00005475801,0.000008380505,0.0000047374556,0.000015338253,0.0000011247922,0.00058664166,0.7662878,0.00005017443,0.0016436136,0.00018749398,0.2311407],"study_design_scores_gemma":[0.00034180007,0.00037292406,0.000056132292,0.000026674577,0.000011264117,0.00003727534,0.00000943892,0.9842404,0.0032268947,0.006432632,0.0049929586,0.00025157642],"about_ca_topic_score_codex":0.000004920739,"about_ca_topic_score_gemma":0.0000120535815,"teacher_disagreement_score":0.23088913,"about_ca_system_score_codex":0.0000143989,"about_ca_system_score_gemma":0.000025755402,"threshold_uncertainty_score":0.50880057},"labels":[],"label_agreement":null},{"id":"W2775727119","doi":"10.1145/3151034","title":"CG-OoO","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Parallel computing; Compiler; Instruction scheduling; Out-of-order execution; Code (set theory); Operating system; Dynamic priority scheduling; Programming language; Schedule","score_opus":0.017094421243348288,"score_gpt":0.26500517816495206,"score_spread":0.24791075692160378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775727119","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013357884,0.000035280013,0.99205035,0.004471053,0.00014643396,0.00014054436,0.000005897914,0.00041363656,0.002603252],"genre_scores_gemma":[0.3148765,0.00017540403,0.6839872,0.00044683166,0.000026498732,0.000017684826,0.0000036706672,0.000011835284,0.00045438134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991043,0.00004594518,0.00015515606,0.0003631179,0.00015625928,0.00017519415],"domain_scores_gemma":[0.9984644,0.0000629667,0.000112957205,0.0012159942,0.00006064749,0.00008302788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012341783,0.00015026185,0.00012868905,0.0001463931,0.0010964981,0.00044999472,0.000974896,0.000083547035,0.00001901093],"category_scores_gemma":[0.000052644118,0.00013813116,0.000052112162,0.000101916514,0.00007201214,0.00033195372,0.00004000025,0.0001912833,0.0000060475368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009461255,0.000034993845,0.000017797343,0.0000038527633,0.000011421126,0.0000018789908,0.00020537738,0.7668969,0.000016307504,0.000991212,0.0000660722,0.2317447],"study_design_scores_gemma":[0.00043652795,0.0001433994,0.00036703603,0.000038384653,0.00001430899,0.000031611038,0.000006439695,0.98729825,0.0021025906,0.0071333027,0.002148229,0.00027990172],"about_ca_topic_score_codex":0.000011667192,"about_ca_topic_score_gemma":0.000014718601,"teacher_disagreement_score":0.31474292,"about_ca_system_score_codex":0.000014000546,"about_ca_system_score_gemma":0.000025862406,"threshold_uncertainty_score":0.8433488},"labels":[],"label_agreement":null},{"id":"W2909633668","doi":"10.1145/3291054","title":"A System-Level Simulator for RRAM-Based Neuromorphic Computing Chips","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Advanced Memory and Neural Computing","field":"Engineering","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institute for Advanced Research","keywords":"Neuromorphic engineering; Resistive random-access memory; Computer science; Scalability; Artificial neural network; CMOS; Computer architecture; Electronic engineering; Artificial intelligence; Electrical engineering; Engineering; Voltage","score_opus":0.03445061769588328,"score_gpt":0.24384610407322416,"score_spread":0.20939548637734087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2909633668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033315156,0.000025207462,0.9653111,0.0001225578,0.00029113828,0.00033212104,0.00007137196,0.00046950448,0.00006183758],"genre_scores_gemma":[0.89630556,0.00000364525,0.10330624,0.00017438283,0.0001232724,0.000013552889,0.000015846521,0.000041147283,0.000016333339],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992675,0.00002773128,0.0001856431,0.00023008148,0.000083054394,0.00020595496],"domain_scores_gemma":[0.9993906,0.0002284961,0.00003516372,0.00022466361,0.00005117748,0.00006987503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006640961,0.00017577429,0.00015237262,0.000118119184,0.0003964061,0.00003366253,0.00010914206,0.00006939979,0.000008217799],"category_scores_gemma":[0.00002229951,0.00017214709,0.000055082903,0.00018602534,0.000043461485,0.000055915938,0.0000032984906,0.0001778714,0.0000021499052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005940508,0.000012580265,0.0000019497027,0.0001021088,0.000013886336,8.314926e-7,0.000118430835,0.96805465,0.001263592,0.000019984138,0.000004184245,0.030348366],"study_design_scores_gemma":[0.00061381736,0.00018435423,0.000021204258,0.00009198265,0.000032123393,0.000016486028,0.000023214425,0.9860505,0.01241186,0.000069896196,0.00030585832,0.0001786996],"about_ca_topic_score_codex":5.3567607e-7,"about_ca_topic_score_gemma":0.000010069818,"teacher_disagreement_score":0.86299044,"about_ca_system_score_codex":0.000023854616,"about_ca_system_score_gemma":0.000010535485,"threshold_uncertainty_score":0.7019955},"labels":[],"label_agreement":null},{"id":"W2962989815","doi":"10.1145/3333060","title":"Memory-access-aware Safety and Profitability Analysis for Transformation of Accelerator-bound OpenMP Loops","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Benchmark (surveying); Parallel computing; Compiler; Speedup; Software portability; Programmer; Kernel (algebra); Suite; Loop unrolling; Static analysis; Control flow; Performance improvement; Operating system; Programming language","score_opus":0.018152986027342766,"score_gpt":0.2768442974359539,"score_spread":0.2586913114086111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962989815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064990963,0.000041237196,0.99099827,0.0011034472,0.000053995613,0.00085138256,0.000062497056,0.00015709101,0.00023299684],"genre_scores_gemma":[0.7911054,0.00016072611,0.20842923,0.00013964277,0.000006976526,0.00004319446,0.000050316896,0.000010882342,0.0000536551],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879473,0.00008487601,0.00037254638,0.00041810438,0.00016989403,0.00015986788],"domain_scores_gemma":[0.9989255,0.000173929,0.00014574114,0.0005151362,0.00017387977,0.000065804794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028657285,0.00017369362,0.00030257585,0.00035573274,0.0002543454,0.0001740399,0.00042734886,0.00010263323,0.00002630551],"category_scores_gemma":[0.000017524531,0.00015907135,0.000100234465,0.00079649943,0.00005514083,0.0005743095,0.000022725077,0.00012746762,4.360742e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010538522,0.00005070723,0.0001799667,0.00006936799,0.000089845606,6.324537e-8,0.0007524206,0.9526318,0.000040362112,0.00039595165,0.000002391943,0.04568178],"study_design_scores_gemma":[0.00077038055,0.00023373043,0.0011866771,0.000027181766,0.00011826219,0.0000037629923,0.000045281355,0.9911081,0.0043710773,0.0017839515,0.00013217216,0.00021942965],"about_ca_topic_score_codex":0.000019454994,"about_ca_topic_score_gemma":0.000037502243,"teacher_disagreement_score":0.7846063,"about_ca_system_score_codex":0.000023150527,"about_ca_system_score_gemma":0.00004486399,"threshold_uncertainty_score":0.6486742},"labels":[],"label_agreement":null},{"id":"W2963523287","doi":"10.1145/3330999","title":"Polyhedral Compilation for Multi-dimensional Stream Processing","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parallel computing; Xeon; Affine transformation; Code (set theory); Parallelism (grammar); Stream processing; Schedule; Transformation (genetics); Throughput; Polytope model; Xeon Phi; Digital signal processing; Algorithm; Programming language; Computer hardware; Mathematics","score_opus":0.02054009118434834,"score_gpt":0.27325854166869296,"score_spread":0.2527184504843446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963523287","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012168076,0.000056727218,0.99669254,0.000915651,0.00011440858,0.0004720644,0.000023097773,0.0004092382,0.000099453304],"genre_scores_gemma":[0.22583689,0.000012558023,0.77344555,0.00036147065,0.000016346981,0.000030760664,0.000038689304,0.00001429926,0.00024343099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990082,0.00004321358,0.00020353735,0.00040141703,0.0001576694,0.00018595521],"domain_scores_gemma":[0.99928766,0.00009727,0.000093563496,0.00034523688,0.00011266185,0.00006359452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011391621,0.00016426964,0.00014778595,0.00020310999,0.00030178353,0.00013077987,0.00029097148,0.00008966069,0.00001387531],"category_scores_gemma":[0.000014707054,0.00015302126,0.000058126036,0.0002609499,0.000026487185,0.00026775908,0.000015437046,0.00014095276,0.000003601108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029359002,0.00006623905,0.000033628337,0.000017124532,0.000008430037,1.5751276e-7,0.00021384665,0.9021222,0.0001043642,0.00027391154,0.000015368447,0.097115375],"study_design_scores_gemma":[0.00068114157,0.00017720122,0.00014997531,0.000043423275,0.000010476469,0.000011254247,0.0000088170145,0.9966022,0.001115278,0.00078017457,0.0002359214,0.00018417889],"about_ca_topic_score_codex":0.0000030924234,"about_ca_topic_score_gemma":0.0000055462547,"teacher_disagreement_score":0.22462009,"about_ca_system_score_codex":0.000023439072,"about_ca_system_score_gemma":0.000046884954,"threshold_uncertainty_score":0.6240026},"labels":[],"label_agreement":null},{"id":"W3017116334","doi":"10.1145/3392032","title":"SIMT-X","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Mitacs","keywords":"Computer science; Thread (computing); Parallel computing; Microarchitecture; SIMD; Instruction set; Out-of-order execution; Computer architecture; Latency (audio); Operating system","score_opus":0.01752328159174395,"score_gpt":0.23791624642776107,"score_spread":0.2203929648360171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017116334","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000078476194,0.00004781797,0.9846918,0.013500568,0.000049593797,0.00013651048,0.0000058383926,0.0007012434,0.00078813],"genre_scores_gemma":[0.19989316,0.00012405786,0.79607046,0.003782664,0.000029989113,0.0000127711555,0.000005666849,0.00001246318,0.00006875058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914414,0.00005652729,0.00015681723,0.00035181525,0.00014485586,0.00014585497],"domain_scores_gemma":[0.9993589,0.000073778414,0.000048932903,0.00034789697,0.000045049856,0.00012545487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000057849822,0.00013727527,0.00011927604,0.00009689066,0.00021958529,0.000115455296,0.0004504611,0.000065255714,0.000025977512],"category_scores_gemma":[0.000033833603,0.00012819521,0.00004504273,0.00040793215,0.000029690387,0.0001657787,0.000021007787,0.00018937983,0.000007852193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011573105,0.000020509391,0.0000033568479,0.0000057760026,0.000008354512,0.0000013048812,0.00053007226,0.90611255,0.00003103192,0.0005186337,0.000106076266,0.092650734],"study_design_scores_gemma":[0.0002563218,0.00018285678,0.000014568418,0.000011568505,0.000008503379,0.000010239172,0.000009564044,0.9935752,0.0013442644,0.00152898,0.0028847256,0.00017319381],"about_ca_topic_score_codex":0.000001989305,"about_ca_topic_score_gemma":0.0000017153941,"teacher_disagreement_score":0.19981469,"about_ca_system_score_codex":0.0000091232405,"about_ca_system_score_gemma":0.000022883101,"threshold_uncertainty_score":0.5227649},"labels":[],"label_agreement":null},{"id":"W3080250604","doi":"10.1145/3406114","title":"Cooperative Software-hardware Acceleration of K-means on a Tightly Coupled CPU-FPGA System","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Field-programmable gate array; Xeon; CPU shielding; Thread (computing); Software; Central processing unit; Hardware acceleration; Acceleration; Embedded system; Parallel computing; Throughput; Computer hardware; Operating system","score_opus":0.02057012952841623,"score_gpt":0.23750115877557612,"score_spread":0.2169310292471599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080250604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006311607,0.000017266051,0.99567175,0.0022571948,0.0000657692,0.00039672383,0.00015681318,0.0005784038,0.00022492981],"genre_scores_gemma":[0.5082495,0.000036309935,0.49097657,0.00055150804,0.0000246205,0.00005407462,0.00006635481,0.000018921208,0.000022138784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870723,0.000101647856,0.00028786904,0.00047535315,0.00027085867,0.0001570404],"domain_scores_gemma":[0.99889654,0.00016422375,0.00012572028,0.0005702577,0.0001375168,0.000105712774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008911894,0.0002126488,0.00024106423,0.00016135084,0.00021848339,0.00012085887,0.0005610371,0.00009878403,0.000020681582],"category_scores_gemma":[0.00007181947,0.00018969543,0.00005638742,0.00049334846,0.000050358693,0.00030086204,0.000025712052,0.00023309377,0.0000053193626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001186525,0.00008816722,0.0000075835915,0.00007044729,0.000047181155,0.0000045837724,0.0022958773,0.93295074,0.00048808294,0.0013836336,0.00014296082,0.0624021],"study_design_scores_gemma":[0.0006792914,0.0012422123,0.000049139322,0.00019026246,0.0000461931,0.000017672115,0.000092653405,0.9757945,0.020910587,0.00018977196,0.00047715672,0.00031058773],"about_ca_topic_score_codex":0.000013691159,"about_ca_topic_score_gemma":0.000022102351,"teacher_disagreement_score":0.50761837,"about_ca_system_score_codex":0.00003776663,"about_ca_system_score_gemma":0.000061560015,"threshold_uncertainty_score":0.7735555},"labels":[],"label_agreement":null},{"id":"W3126960560","doi":"10.1145/3439803","title":"Gretch","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Computer science; Scheduling (production processes); Speedup; Cache; Embedded system; Computer architecture; Parallel computing","score_opus":0.012528226448284595,"score_gpt":0.24269104803251423,"score_spread":0.23016282158422963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126960560","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001667001,0.0001203613,0.9935804,0.004188937,0.00010879818,0.00008118249,0.000005367772,0.0004527182,0.0012955271],"genre_scores_gemma":[0.091755465,0.00030013602,0.9062434,0.001115777,0.000020408714,0.0000147217515,0.000011488382,0.000011974241,0.0005266332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908787,0.0000814177,0.00015602163,0.00036652148,0.00015219866,0.00015594426],"domain_scores_gemma":[0.9991154,0.00008982729,0.000043180156,0.0005758298,0.000102029706,0.00007371297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000081169004,0.00012946155,0.00011686201,0.00012638906,0.00026014858,0.00014855264,0.00031771543,0.00007529713,0.00004450095],"category_scores_gemma":[0.000032279728,0.00012614827,0.000049766117,0.00046483034,0.000028223832,0.00015641625,0.00002316566,0.00018090481,0.0000048213496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004753746,0.000044631433,0.0000058541436,0.000005155178,0.000011421421,0.000005460234,0.00023574031,0.868294,0.00004743058,0.0011271167,0.00006457984,0.13015383],"study_design_scores_gemma":[0.00039918005,0.00010424647,0.000063226624,0.00003726719,0.00001610391,0.000131136,0.000018587223,0.9779966,0.008175994,0.009076154,0.0036940984,0.0002873904],"about_ca_topic_score_codex":0.0000024437413,"about_ca_topic_score_gemma":0.000009067341,"teacher_disagreement_score":0.12986644,"about_ca_system_score_codex":0.000014930627,"about_ca_system_score_gemma":0.000051351577,"threshold_uncertainty_score":0.5144177},"labels":[],"label_agreement":null},{"id":"W3160898425","doi":"10.1145/3505250","title":"MetaSys: A Practical Open-source Metadata Management System to Implement and Evaluate Cross-layer Optimizations","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Metadata; Software; Interface (matter); Operating system; File system; Application layer; Embedded system; Computer architecture","score_opus":0.039247722767542396,"score_gpt":0.3404366622681214,"score_spread":0.301188939500579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160898425","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011105952,0.00006257792,0.9921872,0.005068014,0.00012634367,0.001227067,0.00007629658,0.0004629592,0.0006784902],"genre_scores_gemma":[0.06482781,0.00009224327,0.93201214,0.0014431213,0.000013045097,0.00062382786,0.000047890513,0.000033110307,0.00090680755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975316,0.00040152363,0.0004245536,0.00083978556,0.00048101126,0.00032154738],"domain_scores_gemma":[0.9983644,0.00016251198,0.00014633726,0.0010212162,0.00010736935,0.00019818841],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00082581415,0.00027032895,0.00027354056,0.000433383,0.0015480234,0.0010690339,0.0010870127,0.000047438938,0.00006393604],"category_scores_gemma":[0.000030954045,0.00026553305,0.000056022953,0.0008848707,0.00003333047,0.00062237115,0.000640936,0.00029591512,0.0000027636106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059650392,0.000114916125,0.000005042476,0.000022813167,0.00009574427,0.0000062855624,0.0004482877,0.96438396,0.000006732313,0.006972127,0.00026983515,0.027614614],"study_design_scores_gemma":[0.00088627165,0.00035282262,0.000030204981,0.000027979633,0.00012026643,0.00017256169,0.00020413355,0.97900677,0.00015439728,0.00046336878,0.018216087,0.00036512784],"about_ca_topic_score_codex":0.000027978898,"about_ca_topic_score_gemma":0.000011027783,"teacher_disagreement_score":0.06471675,"about_ca_system_score_codex":0.00011185931,"about_ca_system_score_gemma":0.00006232806,"threshold_uncertainty_score":0.9999797},"labels":[],"label_agreement":null},{"id":"W3175004880","doi":"10.1145/3459010","title":"KernelFaRer","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Computer science; Compiler; x86; Parallel computing; Source code; Kernel (algebra); Programming language; SIMD; Linear algebra; Code (set theory); Overhead (engineering); Block (permutation group theory); Software","score_opus":0.01197056625438376,"score_gpt":0.24026094265087528,"score_spread":0.22829037639649152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175004880","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014270449,0.000121045516,0.993272,0.0043324423,0.00010699859,0.00007999473,0.0000058132678,0.00045470337,0.0014842675],"genre_scores_gemma":[0.10225711,0.0002758332,0.89553076,0.001217575,0.000020441968,0.000015832462,0.0000122369065,0.000012836971,0.00065740483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908876,0.00007808768,0.00015522464,0.00037089107,0.00015078872,0.00015624275],"domain_scores_gemma":[0.99912214,0.00008097473,0.000042730684,0.00057872763,0.00010145699,0.00007399394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000075230935,0.00013128133,0.00011577317,0.00012298678,0.00026277162,0.00014966237,0.0003123262,0.000074784526,0.000051347077],"category_scores_gemma":[0.000031474967,0.00012692004,0.000051001385,0.00042641466,0.000027501173,0.0001537216,0.000024011457,0.00017491945,0.0000053031968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049656105,0.000047968733,0.0000047977624,0.000004927526,0.000012278228,0.000005511957,0.00021908745,0.88860327,0.000052660384,0.001004687,0.000068130925,0.10997174],"study_design_scores_gemma":[0.00046986848,0.00010894504,0.000059545942,0.000040412684,0.000019020103,0.0001380623,0.000022162472,0.9760673,0.012194068,0.0061684484,0.0043739,0.00033828954],"about_ca_topic_score_codex":0.0000025331688,"about_ca_topic_score_gemma":0.00000788097,"teacher_disagreement_score":0.10963345,"about_ca_system_score_codex":0.000015078248,"about_ca_system_score_gemma":0.000045999375,"threshold_uncertainty_score":0.5175649},"labels":[],"label_agreement":null},{"id":"W3198221083","doi":"10.1145/3462209","title":"Byte-Select Compression","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Advanced Micro Devices","keywords":"Computer science; Byte; Algorithm; Data compression; Cache; Compression ratio; Cache algorithms; Parallel computing; CPU cache; Computer hardware","score_opus":0.012485625820485907,"score_gpt":0.24648570327817632,"score_spread":0.23400007745769041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198221083","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019821041,0.00017443324,0.9951227,0.002602662,0.00011564919,0.0001054784,0.0000061074893,0.00051598804,0.0011588184],"genre_scores_gemma":[0.12570077,0.0003711306,0.87241954,0.000952177,0.000023365204,0.000017233313,0.000019773044,0.00001512281,0.00048086926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891263,0.0001214593,0.00018375537,0.00041771357,0.00018274024,0.0001816844],"domain_scores_gemma":[0.99902195,0.00012255953,0.000057528556,0.00059552654,0.0001152924,0.00008714185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000088430446,0.00015485722,0.00014414288,0.00014750594,0.00034368612,0.00015843363,0.00035921138,0.00008959977,0.000041952124],"category_scores_gemma":[0.000035853514,0.00014578717,0.00005629281,0.0005082483,0.000030408502,0.00016912258,0.000030288134,0.00022494116,0.0000044530584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009006222,0.00006273704,0.0000061634328,0.000006754881,0.0000119248025,0.0000046161836,0.00019880776,0.8885803,0.00021679697,0.0005056719,0.00012215153,0.11027504],"study_design_scores_gemma":[0.00041949932,0.000112146816,0.000059114325,0.00005787166,0.0000153241,0.00008715553,0.000011868382,0.97431433,0.017106831,0.003917309,0.0036330663,0.00026549335],"about_ca_topic_score_codex":0.0000031983147,"about_ca_topic_score_gemma":0.000008967652,"teacher_disagreement_score":0.12550256,"about_ca_system_score_codex":0.000017810686,"about_ca_system_score_gemma":0.000056041645,"threshold_uncertainty_score":0.5945028},"labels":[],"label_agreement":null},{"id":"W4210570899","doi":"10.1145/3501768","title":"Memory-Aware Functional IR for Higher-Level Synthesis of Accelerators","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; Microsoft Research","keywords":"Computer science; Stencil; Compiler; Field-programmable gate array; High-level synthesis; VHDL; Parallel computing; Benchmark (surveying); Computer architecture; Embedded system; Computer hardware; Programming language; Computational science","score_opus":0.032854212650612835,"score_gpt":0.2472620561366519,"score_spread":0.21440784348603906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210570899","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020944365,0.000036120022,0.9970096,0.0016744884,0.00022113265,0.00029485137,0.00013965284,0.00024421766,0.0001705223],"genre_scores_gemma":[0.37234262,0.000027568758,0.626585,0.00037832512,0.000025541842,0.0002959876,0.000024089783,0.000018953531,0.0003019296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988811,0.000101386155,0.00024798771,0.00035983947,0.00024916432,0.0001605428],"domain_scores_gemma":[0.9989599,0.0003297315,0.00012550617,0.00042632347,0.000102730664,0.00005579646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018420836,0.00015248627,0.00017674404,0.0002834054,0.0006065956,0.00004878464,0.00046449288,0.00005432203,0.00010002974],"category_scores_gemma":[0.000025500449,0.00015405453,0.000093257324,0.00044931922,0.00003682574,0.00012881345,0.000039291717,0.00017481945,4.1200175e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051475265,0.00008485504,0.0000031019492,0.000014968115,0.000025648174,3.0271238e-7,0.00012987191,0.9007851,0.00004232476,0.000583341,0.0002220866,0.098056965],"study_design_scores_gemma":[0.0007403351,0.0004248044,0.0001733951,0.000025908075,0.000052504907,0.000025044254,0.00005219376,0.97873676,0.011546151,0.0048660412,0.0029795708,0.0003773009],"about_ca_topic_score_codex":0.0000064917876,"about_ca_topic_score_gemma":0.0000034009072,"teacher_disagreement_score":0.37213317,"about_ca_system_score_codex":0.00003815878,"about_ca_system_score_gemma":0.00006273553,"threshold_uncertainty_score":0.62821615},"labels":[],"label_agreement":null},{"id":"W4225381858","doi":"10.1145/3533318","title":"Using Barrier Elision to Improve Transactional Code Generation","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Transactional memory; Computer science; Software transactional memory; Compiler; Leverage (statistics); Transactional leadership; Implementation; Operating system; Just-in-time compilation; Parallel computing; Programming language; Database transaction; Artificial intelligence","score_opus":0.02374602894507752,"score_gpt":0.2600450248490669,"score_spread":0.23629899590398937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225381858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034597444,0.000050445124,0.99318177,0.0017367481,0.0006051173,0.00036934027,0.0003939372,0.00011684239,0.00008604652],"genre_scores_gemma":[0.6586533,0.000017489441,0.3395458,0.0011632487,0.00008885902,0.00015376227,0.0000574619,0.000023888955,0.0002961946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998466,0.00012606817,0.00026559885,0.0005264826,0.00039579414,0.00022003375],"domain_scores_gemma":[0.99918157,0.000045381268,0.00007063845,0.00049255654,0.000073935356,0.00013591624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019556015,0.00017888105,0.00015554237,0.0002249457,0.0010042401,0.00015101938,0.00039381915,0.000057416848,0.00010883972],"category_scores_gemma":[0.000011551025,0.00018213392,0.000072021016,0.000549318,0.000019267756,0.0002660671,0.000022486553,0.00027775194,0.000002775038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032875523,0.000058692814,0.0000018515601,0.0000050327026,0.000015013653,0.0000023075079,0.00049136864,0.9129716,0.0064879805,0.00023265347,0.00006985423,0.07963073],"study_design_scores_gemma":[0.00044473895,0.00020758245,0.000013833972,0.000009704345,0.000017082428,0.00007193079,0.0000509613,0.9885141,0.002154943,0.00022010546,0.008062908,0.00023207619],"about_ca_topic_score_codex":0.000024663017,"about_ca_topic_score_gemma":0.00003994076,"teacher_disagreement_score":0.65519357,"about_ca_system_score_codex":0.000097176875,"about_ca_system_score_gemma":0.00007107751,"threshold_uncertainty_score":0.7723905},"labels":[],"label_agreement":null},{"id":"W4291972620","doi":"10.1145/3556977","title":"Practical Software-Based Shadow Stacks on x86-64","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"Australian Research Council; University of New South Wales","keywords":"Computer science; x86; Spec#; Operating system; Call stack; Software; Backward compatibility; Embedded system; Stack (abstract data type); Programming language","score_opus":0.027011251141305884,"score_gpt":0.27515192098975494,"score_spread":0.24814066984844907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4291972620","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038999887,0.000017365337,0.9882745,0.0102446135,0.0002797441,0.00021638264,0.000030211102,0.00032830343,0.00021885184],"genre_scores_gemma":[0.379411,0.000013880585,0.61677027,0.003549727,0.000033897755,0.00008821255,0.000026749658,0.000017641836,0.00008860476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985396,0.00020081954,0.00020205302,0.00047429043,0.00037862835,0.00020457405],"domain_scores_gemma":[0.9986079,0.0005150656,0.00009064021,0.0006517742,0.000044888184,0.00008974057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022753439,0.00015664876,0.00012126978,0.00023433554,0.0009908056,0.00014481167,0.00045974334,0.000056005065,0.00017588784],"category_scores_gemma":[0.00006938157,0.00016224373,0.00006390316,0.0005171357,0.000041685216,0.0001465543,0.0000308054,0.0005362894,0.000006037098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006317598,0.00019777486,0.000007786506,0.000007219961,0.000011888819,0.0000038696853,0.00044234298,0.9348261,0.000012103851,0.0023397817,0.00014023852,0.06194777],"study_design_scores_gemma":[0.00065109436,0.0005304509,0.000056571505,0.000016032885,0.00001831443,0.000046456225,0.000062540304,0.9868726,0.00059391337,0.0027910029,0.008093988,0.00026704447],"about_ca_topic_score_codex":0.000007932453,"about_ca_topic_score_gemma":0.000007230142,"teacher_disagreement_score":0.37902102,"about_ca_system_score_codex":0.00006392041,"about_ca_system_score_gemma":0.00011061762,"threshold_uncertainty_score":0.76205754},"labels":[],"label_agreement":null},{"id":"W4292179105","doi":"10.1145/3557727","title":"Symbolic Analysis for Data Plane Programs Specialization","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Compiler; Packet processing; Forwarding plane; Network packet; Domain-specific language; Program optimization; Field-programmable gate array; Factor (programming language); Digital subscriber line; Program analysis; Data structure; Computer architecture; Programming language; Distributed computing; Embedded system; Computer network","score_opus":0.03685688128299409,"score_gpt":0.2575731415698246,"score_spread":0.2207162602868305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292179105","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021044306,0.00009081242,0.99723923,0.0014754749,0.0001725759,0.00039346333,0.0001712293,0.00019551185,0.00005125584],"genre_scores_gemma":[0.30023834,0.00017260804,0.6953264,0.00090862263,0.00011965806,0.0003453637,0.00259895,0.0000325121,0.0002575365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882776,0.00007272757,0.00018547625,0.00050522265,0.0002220793,0.00018676152],"domain_scores_gemma":[0.99871904,0.00013223404,0.000077272045,0.0009735941,0.000037325004,0.000060531856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018090026,0.00013130248,0.00016386865,0.00029769767,0.0006495938,0.00014175144,0.0008180143,0.000041193085,0.000057450787],"category_scores_gemma":[0.000016539143,0.0001291849,0.00006578694,0.0013337226,0.000021955606,0.00017417257,0.000063730615,0.00014952187,6.148333e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030151738,0.0000766135,0.00009755298,0.00000472758,0.00010009259,6.152847e-7,0.00027416807,0.8050003,0.000001814422,0.0004362151,0.00006356599,0.1939142],"study_design_scores_gemma":[0.0003928775,0.00020609122,0.00013803106,0.0000039791917,0.0001995665,0.000012106185,0.000026207017,0.98602635,0.0000143082425,0.0016879105,0.011119508,0.00017307073],"about_ca_topic_score_codex":0.00001790142,"about_ca_topic_score_gemma":0.00012180551,"teacher_disagreement_score":0.3019128,"about_ca_system_score_codex":0.000023502143,"about_ca_system_score_gemma":0.000032063544,"threshold_uncertainty_score":0.52680075},"labels":[],"label_agreement":null},{"id":"W4294733115","doi":"10.1145/3561651","title":"Lock-Free High-performance Hashing for Persistent Memory via PM-aware Holistic Optimization","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Ministry of Education of the People's Republic of China; National Natural Science Foundation of China","keywords":"Computer science; Bottleneck; Hash function; Parallel computing; Dynamic perfect hashing; Latency (audio); Hash table; CAS latency; Lock (firearm); Distributed computing; Embedded system; Operating system; Memory controller; Double hashing; Semiconductor memory","score_opus":0.018319145688222953,"score_gpt":0.23075004998246174,"score_spread":0.21243090429423878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294733115","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00061259134,0.00009391059,0.99472547,0.0028903943,0.00032509348,0.00054105924,0.00022206521,0.00056094944,0.000028496639],"genre_scores_gemma":[0.34428608,0.0000801429,0.65472597,0.0003350281,0.000021186885,0.00029822,0.00011599466,0.000026105829,0.000111271125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853826,0.00005895039,0.00024621026,0.00056792947,0.00030220972,0.00028643192],"domain_scores_gemma":[0.99840325,0.00016120153,0.00012925254,0.0011664716,0.000078690726,0.00006113932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015044637,0.00022503355,0.00018800878,0.0003353136,0.0012147005,0.00010710232,0.0011951596,0.00007593191,0.000039391467],"category_scores_gemma":[0.00006625914,0.00023365344,0.000072686526,0.000561407,0.00007711359,0.00051645975,0.00015013394,0.00035920093,9.670149e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005228938,0.00005645342,9.668873e-7,0.000025936446,0.000022512742,0.0000016029618,0.0003055153,0.8952371,0.000037371003,0.00017197992,0.000041901025,0.104046404],"study_design_scores_gemma":[0.0007674973,0.00046574255,0.0000057998664,0.000016130864,0.00004377222,0.00005476674,0.00015903731,0.99525934,0.0006388278,0.0018922983,0.0004220464,0.00027472098],"about_ca_topic_score_codex":0.00000921954,"about_ca_topic_score_gemma":0.000012075298,"teacher_disagreement_score":0.3436735,"about_ca_system_score_codex":0.00014620004,"about_ca_system_score_gemma":0.000044139484,"threshold_uncertainty_score":0.95281106},"labels":[],"label_agreement":null},{"id":"W4311119077","doi":"10.1145/3570305","title":"YaConv: Convolution with Low Cache Footprint","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Cache; Speedup; Memory footprint; Parallel computing; Convolution (computer science); CPU cache; Memory hierarchy; Reduction (mathematics); Cache algorithms; Algorithm; Computer engineering; Computational science; Operating system; Artificial intelligence","score_opus":0.008153065125548538,"score_gpt":0.2143165338795878,"score_spread":0.20616346875403926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311119077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016959056,0.000043073338,0.99320585,0.004223312,0.00006933871,0.00034363978,0.000015106117,0.00022147322,0.00018230952],"genre_scores_gemma":[0.6355888,0.00004429944,0.363258,0.0005784552,0.000016699983,0.0003050484,0.00001678327,0.000016768518,0.00017510925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989745,0.00007806705,0.00013982088,0.000406871,0.00021763882,0.00018312337],"domain_scores_gemma":[0.9991312,0.000097938784,0.00007093562,0.0005887817,0.00003773643,0.00007340991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006848051,0.0001401479,0.00010351512,0.00013084126,0.00074323517,0.0000486157,0.00042128115,0.000029268234,0.000041545976],"category_scores_gemma":[0.0000046629634,0.00012882623,0.0000324936,0.0005838963,0.000051564573,0.00010970733,0.00003690513,0.00032473225,0.0000017565624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033368495,0.000048431622,0.0000055697274,0.0000033991018,0.000011037161,0.0000014826609,0.00026204486,0.8975719,0.00015211981,0.0012777491,0.0000070500173,0.10062586],"study_design_scores_gemma":[0.0010823295,0.00067124766,0.00022437992,0.000017211372,0.00003930766,0.0002237329,0.00012258823,0.97824323,0.0021649115,0.009640361,0.0071038525,0.0004668335],"about_ca_topic_score_codex":0.0000071327695,"about_ca_topic_score_gemma":0.00003118024,"teacher_disagreement_score":0.63389295,"about_ca_system_score_codex":0.000057158042,"about_ca_system_score_gemma":0.00003598354,"threshold_uncertainty_score":0.57164395},"labels":[],"label_agreement":null},{"id":"W4380087783","doi":"10.1145/3603503","title":"rNdN: Fast Query Compilation for NVIDIA GPUs","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Compiler; Parallel computing; Pipeline (software); Query optimization; Cache; Interprocedural optimization; Optimizing compiler; Programming language; Database; Loop optimization","score_opus":0.019207370622381884,"score_gpt":0.26343195738768405,"score_spread":0.24422458676530218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380087783","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002507686,0.000030793137,0.994297,0.0032586665,0.00019425579,0.0003980816,0.000046536745,0.0012233686,0.0003005249],"genre_scores_gemma":[0.114504926,0.00025163149,0.8836576,0.0006254873,0.0000578745,0.0001387755,0.00013437636,0.000030292435,0.0005990799],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988746,0.00006545882,0.00023099444,0.0004185831,0.00017186784,0.00023851694],"domain_scores_gemma":[0.9989963,0.00026117841,0.00008231332,0.00048482802,0.00009590963,0.00007943816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019858131,0.00017564304,0.00015808937,0.00038803567,0.00045961168,0.00015351728,0.000396473,0.0001042289,0.000008407001],"category_scores_gemma":[0.0000408684,0.00017199095,0.00007612237,0.00073254417,0.000037602633,0.00021789708,0.00002140778,0.00014984637,0.000008610434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019774388,0.0000272919,0.000008489346,0.000013281413,0.0000127694175,6.1643783e-7,0.00039075158,0.88608325,0.00004809397,0.0007381265,0.00032817354,0.11232937],"study_design_scores_gemma":[0.00040525073,0.00015223131,0.0001275196,0.000029281468,0.0000135932405,0.000009861376,0.000019237781,0.98993415,0.0011433378,0.0056397235,0.0023158751,0.00020993518],"about_ca_topic_score_codex":0.000003822766,"about_ca_topic_score_gemma":0.000010513554,"teacher_disagreement_score":0.11425416,"about_ca_system_score_codex":0.000023676763,"about_ca_system_score_gemma":0.000034851117,"threshold_uncertainty_score":0.70135874},"labels":[],"label_agreement":null},{"id":"W4386896826","doi":"10.1145/3625004","title":"Advancing Direct Convolution Using Convolution Slicing Optimization and ISA Extensions","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Parallel computing; Kernel (algebra); Kernelization; Speedup; x86; Convolution (computer science); Algorithm; Computational science; Artificial intelligence; Parameterized complexity; Programming language; Mathematics; Artificial neural network","score_opus":0.01661212601399944,"score_gpt":0.26203843607437394,"score_spread":0.2454263100603745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386896826","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00256437,0.0001388088,0.9940436,0.0012134829,0.00020801218,0.00036001953,0.000014220729,0.0012906812,0.0001667888],"genre_scores_gemma":[0.26403442,0.0009924632,0.7343834,0.00033813142,0.0000386555,0.000027382794,0.000041730484,0.000032776403,0.00011099837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823266,0.00017355269,0.0003466042,0.0006301573,0.00025068523,0.00036631562],"domain_scores_gemma":[0.9987949,0.0002472565,0.00015078386,0.0005124119,0.00015356173,0.00014107392],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000359041,0.00026595636,0.00025084498,0.0006374595,0.0009230903,0.00018459825,0.00026611425,0.00015312027,0.000010318095],"category_scores_gemma":[0.00010833705,0.00027156845,0.000060475355,0.001174748,0.000087082466,0.00051135494,0.000054807766,0.00024913394,0.0000029366217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001500534,0.000027131204,0.000027992826,0.000017813916,0.00001751313,0.0000022986633,0.0004556957,0.9815782,0.0003928407,0.00021303855,0.000041123574,0.017211404],"study_design_scores_gemma":[0.00039566532,0.00010724616,0.00009918762,0.00010737464,0.000036100522,0.00004898409,0.000055660585,0.997313,0.00067634566,0.00070753944,0.00016191014,0.0002909571],"about_ca_topic_score_codex":0.000035944402,"about_ca_topic_score_gemma":0.00001712554,"teacher_disagreement_score":0.26147005,"about_ca_system_score_codex":0.00007265399,"about_ca_system_score_gemma":0.0000580138,"threshold_uncertainty_score":0.99997365},"labels":[],"label_agreement":null},{"id":"W4406428192","doi":"10.1145/3711926","title":"Maximizing Data and Hardware Reuse for HLS with Early-Stage Symbolic Partitioning","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mila - Quebec Artificial Intelligence Institute; McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Computer science; Reuse; High-level synthesis; Parallel computing; Computer architecture; Embedded system; Field-programmable gate array; Programming language","score_opus":0.023446393610317383,"score_gpt":0.2755962635566579,"score_spread":0.25214986994634053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406428192","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006383039,0.00010710086,0.9952142,0.0029835752,0.000049801914,0.00036366342,0.00006119666,0.0003590806,0.000223055],"genre_scores_gemma":[0.08230866,0.00022388127,0.91644907,0.0004946145,0.000012918686,0.0000611926,0.000049924784,0.0000140550055,0.00038567735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895334,0.00005236066,0.00018258038,0.00051965896,0.00010739826,0.00018467556],"domain_scores_gemma":[0.9984722,0.00017531529,0.000068452544,0.0011441833,0.000080972066,0.000058872218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016427173,0.00016134928,0.0001575375,0.00023475228,0.00051888,0.00027493056,0.00072119833,0.000071704584,0.000003324907],"category_scores_gemma":[0.000061972954,0.00014422605,0.000022414008,0.0003670115,0.000051761457,0.00032671177,0.000082992534,0.00015694996,2.830939e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005698902,0.000037324317,0.00007795446,0.000044517943,0.000041674786,0.0000011072302,0.0005823004,0.9365881,0.000014411151,0.001400529,0.000099518045,0.061055545],"study_design_scores_gemma":[0.0006637973,0.00015841919,0.00016920322,0.00015928029,0.000044022872,0.000011063717,0.00003187321,0.9919062,0.0007060241,0.002836192,0.003097559,0.00021631406],"about_ca_topic_score_codex":0.000013179392,"about_ca_topic_score_gemma":0.000029969324,"teacher_disagreement_score":0.08167035,"about_ca_system_score_codex":0.000013862172,"about_ca_system_score_gemma":0.00004718485,"threshold_uncertainty_score":0.5881368},"labels":[],"label_agreement":null},{"id":"W4410211360","doi":"10.1145/3730584","title":"GOLDYLOC: Global Optimizations &amp; Lightweight Dynamic Logic for Concurrency","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Concurrency; Parallel computing; Distributed computing; Programming language","score_opus":0.018092089414499066,"score_gpt":0.31365807022529435,"score_spread":0.29556598081079527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410211360","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004330049,0.00020165234,0.99250764,0.004072844,0.0005431419,0.0006284145,0.00011034577,0.00027741486,0.0016152387],"genre_scores_gemma":[0.01793782,0.00023689351,0.9802981,0.00066471397,0.000013914486,0.00019946115,0.00006493597,0.0000109476605,0.00057320064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986585,0.00010637224,0.00031593922,0.0005201464,0.00014862137,0.00025041576],"domain_scores_gemma":[0.9987369,0.00014644967,0.000098989825,0.00078221835,0.00015939772,0.00007604101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018091916,0.00021928707,0.00018981702,0.00023351556,0.0004872116,0.00016065752,0.0006431594,0.00014839564,0.000024380048],"category_scores_gemma":[0.0001246998,0.00020705543,0.000091217116,0.0009332152,0.000082084785,0.00029326216,0.000024712548,0.00017332146,0.000004581741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003411265,0.000092569586,0.000006048,0.000034123866,0.000027391556,1.8602577e-7,0.00015699219,0.76460433,0.000039105704,0.05537548,0.000091083995,0.17953856],"study_design_scores_gemma":[0.0006466569,0.00011749615,0.00008226223,0.00004917709,0.000061760926,0.000012763647,0.00001623986,0.95186913,0.00026914387,0.04129398,0.0053286413,0.00025273458],"about_ca_topic_score_codex":0.0000034218947,"about_ca_topic_score_gemma":0.000050230406,"teacher_disagreement_score":0.1872648,"about_ca_system_score_codex":0.0000948708,"about_ca_system_score_gemma":0.00009451305,"threshold_uncertainty_score":0.84434754},"labels":[],"label_agreement":null},{"id":"W4412554211","doi":"10.1145/3747846","title":"Ephemera: Accelerating I/O-Intensive Serverless Workloads with a Harvested In-memory File System","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"National Natural Science Foundation of China","keywords":"Computer science; Operating system; Ephemera; Parallel computing; File system; Embedded system","score_opus":0.011059805654790627,"score_gpt":0.2272247325624125,"score_spread":0.21616492690762187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412554211","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001695283,0.00008467907,0.99536765,0.0015288122,0.00007812707,0.000323061,0.00006415769,0.00050779304,0.0003504231],"genre_scores_gemma":[0.3299207,0.000035737048,0.6691214,0.000497608,0.0000065918966,0.00014821679,0.00003483338,0.000013833903,0.00022110937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892104,0.000052780604,0.00021196538,0.00046868643,0.0001325341,0.00021300954],"domain_scores_gemma":[0.9988381,0.00019959352,0.00007600174,0.00072793965,0.0001239019,0.000034420475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006264341,0.00019198873,0.0002014963,0.00036985887,0.00024253778,0.00013754399,0.0005381977,0.000099854784,0.000015008849],"category_scores_gemma":[0.00006232771,0.00016460282,0.00002686023,0.0010833509,0.00006947788,0.0004417076,0.00004418484,0.00034192894,0.0000017037567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041284133,0.000027196482,0.000020337922,0.000042412237,0.000021332142,0.000015642117,0.00032569325,0.8647129,0.000055364762,0.0007662147,0.000041187184,0.13393043],"study_design_scores_gemma":[0.0019538212,0.00030493902,0.00079756696,0.0014719282,0.000048494938,0.00011852365,0.0025034186,0.98547465,0.004789985,0.0014322492,0.00046809466,0.0006363592],"about_ca_topic_score_codex":0.000024441171,"about_ca_topic_score_gemma":0.00040512058,"teacher_disagreement_score":0.32822543,"about_ca_system_score_codex":0.000078345,"about_ca_system_score_gemma":0.00005689388,"threshold_uncertainty_score":0.67123085},"labels":[],"label_agreement":null},{"id":"W4412900079","doi":"10.1145/3750446","title":"Matrix: Multi-Cipher Structures Dataflow for Parallel and Pipelined TFHE Accelerator","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Higher Education Discipline Innovation Project; National Natural Science Foundation of China","keywords":"Computer science; Dataflow; Parallel computing; Matrix (chemical analysis); Cipher; Programming language; Computer architecture; Computational science; Operating system; Encryption","score_opus":0.02131386073080926,"score_gpt":0.31209823705952505,"score_spread":0.2907843763287158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412900079","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014863927,0.00016125996,0.9948422,0.0026477012,0.00013505363,0.00048872316,0.000127928,0.00008928428,0.000021509679],"genre_scores_gemma":[0.15844323,0.00021847604,0.84037656,0.0006668967,0.000016535365,0.00009459684,0.000056934256,0.000009210488,0.000117579264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912184,0.000040575356,0.0002024168,0.00037270345,0.00009230913,0.000170176],"domain_scores_gemma":[0.9992926,0.0001332266,0.000046045687,0.00040385342,0.000066578075,0.000057664147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000090199734,0.00015461339,0.00013633953,0.00023209589,0.00044319415,0.00020962316,0.00028250486,0.000071861636,0.000023018287],"category_scores_gemma":[0.000019992469,0.00013619085,0.000048057183,0.00034993418,0.00004665171,0.00019971185,0.000022048764,0.00012701012,2.478807e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016143602,0.00018128136,0.00010302078,0.00009765659,0.00012612117,0.0000010250028,0.0016625653,0.6240181,0.00029000491,0.018646842,0.00034033746,0.35437167],"study_design_scores_gemma":[0.0030203108,0.0001603058,0.0008649403,0.000028071727,0.000084896164,0.000010475585,0.00016886627,0.9679689,0.0004890736,0.019763822,0.0071171345,0.00032320194],"about_ca_topic_score_codex":0.000016536751,"about_ca_topic_score_gemma":0.00021694727,"teacher_disagreement_score":0.35404846,"about_ca_system_score_codex":0.000009935849,"about_ca_system_score_gemma":0.000037972903,"threshold_uncertainty_score":0.5553702},"labels":[],"label_agreement":null}]}