{"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54623246,0.0014421346,0.43611103,0.00021227865,0.00014854253,0.00016864305,0.00008384741,0.01241654,0.0031844957],"genre_scores_gemma":[0.8769246,0.00025155098,0.120869376,0.00007801238,0.000033186927,0.00006738679,0.00013162915,0.00034295427,0.0013014209],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994124,0.000113559494,0.000056765206,0.000115453775,0.00021601864,0.00008591497],"domain_scores_gemma":[0.9984262,0.00048051513,0.00025355694,0.00040945885,0.00033724977,0.000093019524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009240179,0.000779483,0.00040973615,0.0005745868,0.00034618957,0.0006305982,0.00091760105,0.0002326957,0.00075169955],"category_scores_gemma":[0.0027395957,0.00032283022,0.00024879805,0.0003361444,0.00028871652,0.00089881546,0.0005995119,0.0005370396,0.00024066238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00097253843,0.00037825186,0.013182192,0.00026937632,0.00010184492,0.0002699524,0.0004116785,0.10882049,0.45804226,0.004215206,0.0034010883,0.40993518],"study_design_scores_gemma":[0.000068324734,0.00044083124,0.0030419838,0.000017778362,0.00007184777,0.00011115685,0.000042736305,0.8606503,0.1292513,0.0014913272,0.004784505,0.000027836877],"about_ca_topic_score_codex":0.0019655854,"about_ca_topic_score_gemma":0.0021030016,"teacher_disagreement_score":0.0019655854,"about_ca_system_score_codex":0.00040720688,"about_ca_system_score_gemma":0.0014897933,"threshold_uncertainty_score":0.0048867464},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8244811,0.0013452802,0.15392867,0.0002614828,0.00011891188,0.000053871176,0.00023637155,0.0030503355,0.016524024],"genre_scores_gemma":[0.957106,0.00016844732,0.040989153,0.00009893842,0.000012132523,0.000032245058,0.0001314958,0.00009053662,0.0013711039],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998839,0.00001217066,0.0000066684884,0.000022893579,0.000044409575,0.000029892362],"domain_scores_gemma":[0.99991465,0.000010194721,0.00002368563,0.000022370165,0.000022873593,0.0000061761148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000617169,0.00044031677,0.00019269434,0.0002917701,0.0001620472,0.0003937713,0.0008670436,0.0003078443,0.00095653266],"category_scores_gemma":[0.00018517896,0.00013558309,0.00029649143,0.0004202598,0.000117398384,0.00054481503,0.00029192588,0.00019463805,0.00030749143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029278008,0.00017663256,0.0052226554,0.00025598847,0.00013917487,0.00063385407,0.0001465193,0.1224098,0.71203405,0.006128903,0.005353178,0.14720644],"study_design_scores_gemma":[0.000066203065,0.00081821275,0.006349121,0.000021478645,0.00012702306,0.0005328077,0.000098109005,0.54117334,0.43519917,0.0014982283,0.014030408,0.00008592302],"about_ca_topic_score_codex":0.00082465616,"about_ca_topic_score_gemma":0.001662895,"teacher_disagreement_score":0.00095653266,"about_ca_system_score_codex":0.0003077859,"about_ca_system_score_gemma":0.0002735993,"threshold_uncertainty_score":0.003199935},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22688174,0.0012595964,0.7588693,0.0003919846,0.00008280483,0.00010480237,0.00041635436,0.0025033932,0.009490049],"genre_scores_gemma":[0.9568433,0.0007174681,0.036878493,0.000090242,0.000045459907,0.00011172321,0.00017899742,0.00014405126,0.0049900957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993112,0.000097016,0.000033220127,0.00008344056,0.00035330365,0.00012173861],"domain_scores_gemma":[0.99859136,0.000611408,0.00028338228,0.00016314314,0.00031180464,0.000038817136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047746502,0.00090079295,0.00085960026,0.0008455483,0.00044629685,0.0009407247,0.0020322362,0.0010436802,0.0012215013],"category_scores_gemma":[0.0035545893,0.00071749894,0.0007415285,0.0009096733,0.0005224038,0.001773298,0.00051484373,0.000900164,0.0005526662],"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.000029840974,0.00001746455,0.0005400857,0.00002084454,0.000014842608,0.000059361657,0.000030610023,0.9893239,0.0026024473,0.0022891643,0.00019642728,0.0048749954],"study_design_scores_gemma":[0.0000010193295,0.0000070649553,0.000057974885,0.0000012649637,0.000002533019,0.000007565249,0.0000025315142,0.9989784,0.000580733,0.00026900356,0.00008984011,0.000002117333],"about_ca_topic_score_codex":0.015068934,"about_ca_topic_score_gemma":0.009259134,"teacher_disagreement_score":0.015068934,"about_ca_system_score_codex":0.001414597,"about_ca_system_score_gemma":0.0016541642,"threshold_uncertainty_score":0.02996248},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052082012,0.00026552347,0.97923535,0.00014134376,0.00008363629,0.00010824993,0.000117272444,0.011584795,0.0032555324],"genre_scores_gemma":[0.07056199,0.00032382205,0.92017823,0.0001839406,0.00007609231,0.00030147086,0.0006642192,0.0048859427,0.0028243172],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903667,0.00015072174,0.00009801189,0.00015307001,0.0004340374,0.00012754992],"domain_scores_gemma":[0.9992873,0.00011814241,0.000052700478,0.0002650054,0.00023849792,0.00003849036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086893386,0.0009255392,0.0008575771,0.00081882725,0.00066748366,0.0011962177,0.0018966321,0.00074868795,0.0025511163],"category_scores_gemma":[0.0019935113,0.000653681,0.0010492142,0.00085753255,0.00057534117,0.0012744003,0.0015434267,0.0019889798,0.0014840164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029793277,0.0002762711,0.0027546326,0.0004290778,0.0002148036,0.0004186125,0.00058965344,0.2681156,0.052027024,0.13569382,0.028544934,0.5106376],"study_design_scores_gemma":[0.00008481014,0.00013619529,0.0006461957,0.00007109092,0.00008606622,0.00032008113,0.00006924934,0.8346059,0.04266021,0.029345123,0.09189093,0.00008426096],"about_ca_topic_score_codex":0.0013694298,"about_ca_topic_score_gemma":0.0018644674,"teacher_disagreement_score":0.0025511163,"about_ca_system_score_codex":0.0006996925,"about_ca_system_score_gemma":0.001789942,"threshold_uncertainty_score":0.008534312},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20451772,0.0019177111,0.7638718,0.0011948165,0.00034203872,0.00032859584,0.00019249092,0.0026708695,0.024963945],"genre_scores_gemma":[0.755731,0.00111121,0.23589663,0.00034571165,0.0000841493,0.0002254909,0.00023840631,0.00021021273,0.006157181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999642,0.00010378583,0.000014517519,0.000042144027,0.000113234724,0.000084339306],"domain_scores_gemma":[0.99951684,0.000137299,0.000091911075,0.000071824325,0.00014219753,0.00004004907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055827666,0.0004565785,0.00029418844,0.0003890807,0.0004559133,0.00084270135,0.0012205795,0.00046947543,0.002597804],"category_scores_gemma":[0.0012983833,0.0003469821,0.0002184569,0.000407144,0.0003205399,0.0011673344,0.00056543434,0.00047993456,0.0005584885],"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.00027505038,0.00021319799,0.003585148,0.00040893903,0.00011816701,0.00019540594,0.00017075661,0.7128719,0.06994476,0.047047146,0.010876649,0.15429297],"study_design_scores_gemma":[0.000036874837,0.0002806118,0.0010139686,0.000033552038,0.000051895095,0.00007437203,0.000113665286,0.9470239,0.019885238,0.01264008,0.018824534,0.0000213369],"about_ca_topic_score_codex":0.0018998275,"about_ca_topic_score_gemma":0.005133115,"teacher_disagreement_score":0.002597804,"about_ca_system_score_codex":0.0010364022,"about_ca_system_score_gemma":0.00086409017,"threshold_uncertainty_score":0.008690536},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30679294,0.0005827587,0.6659336,0.0004843746,0.00021156219,0.00014523257,0.00025137136,0.01848135,0.007116845],"genre_scores_gemma":[0.6001059,0.00023402732,0.3968172,0.0001235011,0.00007608015,0.00009528765,0.00033304206,0.0009194205,0.0012956575],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991986,0.00016900183,0.0001104514,0.00009489126,0.00030490736,0.00012218174],"domain_scores_gemma":[0.9965293,0.0013555613,0.00053583074,0.00094295014,0.0005581847,0.00007815948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001027988,0.00047663605,0.000399176,0.0006316286,0.00034722578,0.0007157851,0.00087849976,0.00040071513,0.001906877],"category_scores_gemma":[0.003937591,0.00051338144,0.00040883667,0.00053759373,0.0005041576,0.0011070225,0.00053561816,0.0008432331,0.00034988695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077755365,0.00041953634,0.009556502,0.00060224376,0.00010214489,0.00031610136,0.0004220155,0.18799363,0.40512198,0.039523065,0.007819441,0.34734574],"study_design_scores_gemma":[0.0001984194,0.00043175064,0.002476495,0.000048077338,0.00012716316,0.00021361298,0.00006520527,0.7267616,0.24453904,0.007196761,0.017893724,0.00004818291],"about_ca_topic_score_codex":0.0014188511,"about_ca_topic_score_gemma":0.0024694945,"teacher_disagreement_score":0.001906877,"about_ca_system_score_codex":0.00048466725,"about_ca_system_score_gemma":0.002438379,"threshold_uncertainty_score":0.0063791275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26684403,0.0015674807,0.7238951,0.00026677264,0.000096815944,0.00029149413,0.00012605461,0.0024889181,0.0044234083],"genre_scores_gemma":[0.7577933,0.0002820835,0.24026422,0.00008650968,0.000021026066,0.00014639129,0.00014870442,0.00010651534,0.0011512205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962056,0.00009927478,0.000043896365,0.0000659168,0.00011692141,0.000053417818],"domain_scores_gemma":[0.9993907,0.00009829398,0.0001007346,0.00019544718,0.00017205635,0.00004269368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061919447,0.0003279818,0.0002691333,0.00027759816,0.0003293765,0.0006190089,0.001261261,0.00026178066,0.0006700474],"category_scores_gemma":[0.0010886634,0.000271895,0.0003186077,0.00033087336,0.00028604898,0.0006257351,0.00049217505,0.000450822,0.00015470509],"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.0004717169,0.00024222858,0.0066897846,0.00049421244,0.0002665882,0.0004971293,0.00037251413,0.44025102,0.3241113,0.029300088,0.0037747917,0.19352865],"study_design_scores_gemma":[0.000060987826,0.0004106474,0.0026257995,0.00002677568,0.0001118371,0.00013793481,0.000059709393,0.89894336,0.08227359,0.0035295552,0.011788079,0.000031581945],"about_ca_topic_score_codex":0.0011371532,"about_ca_topic_score_gemma":0.0025457807,"teacher_disagreement_score":0.001261261,"about_ca_system_score_codex":0.0005212633,"about_ca_system_score_gemma":0.0009296395,"threshold_uncertainty_score":0.003782034},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101078965,0.0024474582,0.8900663,0.00030549683,0.000085929874,0.00009985376,0.00009915325,0.0023441536,0.0034727666],"genre_scores_gemma":[0.92479986,0.00040834575,0.07308728,0.00011479349,0.00007092078,0.000056919424,0.00012871718,0.000113331305,0.001219911],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996327,0.0008376342,0.00021929487,0.000482173,0.0018228438,0.00031117952],"domain_scores_gemma":[0.99493885,0.0019816605,0.0006899157,0.00131468,0.00091738015,0.00015745466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015336375,0.00073405256,0.0012179246,0.00088752666,0.0005575612,0.00079112506,0.0028223163,0.0006229791,0.0011175856],"category_scores_gemma":[0.008972275,0.0004866398,0.0005379479,0.0011578233,0.00069027796,0.0019068533,0.0010432786,0.00075722113,0.00041267122],"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.0005878303,0.00020784292,0.0056428877,0.00020361732,0.00012190765,0.00013570876,0.00016586937,0.6843692,0.016132142,0.015664114,0.0038066295,0.27296224],"study_design_scores_gemma":[0.00003326419,0.00023321765,0.00070427073,0.000009699338,0.000050001174,0.00023451904,0.00001610909,0.9861958,0.005891918,0.0048950487,0.0017100166,0.000026164696],"about_ca_topic_score_codex":0.002133967,"about_ca_topic_score_gemma":0.0033794749,"teacher_disagreement_score":0.0028223163,"about_ca_system_score_codex":0.0011306846,"about_ca_system_score_gemma":0.0019759217,"threshold_uncertainty_score":0.008203745},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2595354,0.00095008395,0.7136359,0.0003673985,0.00030935844,0.00030766227,0.00017417003,0.006617479,0.018102575],"genre_scores_gemma":[0.817725,0.00039864605,0.17060407,0.00018380501,0.00007844882,0.0002592642,0.00034449145,0.0006120622,0.009794173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951506,0.000046574274,0.000024724914,0.00014978618,0.00017002222,0.00009376357],"domain_scores_gemma":[0.9992204,0.00017062628,0.00011070722,0.00028392012,0.00013111248,0.000083223735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003259485,0.00081763515,0.0006705981,0.00062914996,0.000763747,0.0007834212,0.0013754972,0.00047562123,0.005105175],"category_scores_gemma":[0.0016760693,0.00045956604,0.00041508838,0.000671289,0.0006963667,0.0014996462,0.0020436156,0.00086768577,0.0011112717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012148239,0.0003413523,0.006306045,0.00020981098,0.00010205681,0.00090875104,0.0010369383,0.16630155,0.20424873,0.051824708,0.011506826,0.55599844],"study_design_scores_gemma":[0.00012543995,0.0005442896,0.0020030122,0.000036038884,0.000054705622,0.00074089837,0.00028609092,0.68911207,0.21983719,0.02698228,0.0601933,0.000084737],"about_ca_topic_score_codex":0.00089584774,"about_ca_topic_score_gemma":0.0009137304,"teacher_disagreement_score":0.005105175,"about_ca_system_score_codex":0.00045501848,"about_ca_system_score_gemma":0.00070967886,"threshold_uncertainty_score":0.01707846},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8460193,0.0018911909,0.12926994,0.0002731684,0.00011820472,0.0001938708,0.0003157727,0.012499633,0.009419031],"genre_scores_gemma":[0.94697076,0.0002031632,0.04983158,0.00012298755,0.000016097018,0.0000625938,0.00035785665,0.00078060466,0.001654225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987213,0.00035055264,0.00010384482,0.00016291185,0.00033218646,0.0003291723],"domain_scores_gemma":[0.99613285,0.0019480365,0.0003235853,0.0008165783,0.00065757486,0.00012129843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012313443,0.0012340735,0.00044152513,0.0007313117,0.00037416516,0.0011078122,0.0013912203,0.00039024584,0.0031785152],"category_scores_gemma":[0.008043735,0.00044129248,0.00036934234,0.00068596477,0.00039831823,0.002764292,0.0009215762,0.0006828594,0.0008315936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003214848,0.0006561571,0.018930513,0.00075999636,0.00025897607,0.0003972926,0.00055311644,0.29680452,0.22457668,0.008411067,0.011121534,0.4343153],"study_design_scores_gemma":[0.00015425107,0.0014569873,0.007225464,0.00007742847,0.00016284238,0.00028671947,0.0002239229,0.6642779,0.30915833,0.0021099988,0.014791586,0.00007455468],"about_ca_topic_score_codex":0.0019835143,"about_ca_topic_score_gemma":0.0026740779,"teacher_disagreement_score":0.0031785152,"about_ca_system_score_codex":0.0008413594,"about_ca_system_score_gemma":0.0013411894,"threshold_uncertainty_score":0.010633171},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28136548,0.00953711,0.6291469,0.043295145,0.0012449475,0.00033553227,0.0003567229,0.0032899594,0.03142822],"genre_scores_gemma":[0.8404922,0.0056536105,0.14351304,0.0024096316,0.000804337,0.00021776455,0.00028948966,0.0010710766,0.005548864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98082215,0.005809463,0.0011389323,0.0022093377,0.008694177,0.0013259533],"domain_scores_gemma":[0.8919657,0.08351411,0.0044717463,0.0118487505,0.0074940166,0.0007058091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010370246,0.0010155418,0.001187168,0.0020240142,0.0022201817,0.0051098564,0.0028651853,0.0022067155,0.0047169137],"category_scores_gemma":[0.07126429,0.001467307,0.00240823,0.0012969101,0.009828858,0.016888108,0.0056530638,0.0074766134,0.00053244573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050963124,0.00033189167,0.010271964,0.0018827769,0.00021264526,0.0019036392,0.004750623,0.121235624,0.025915671,0.7047703,0.008940818,0.11927449],"study_design_scores_gemma":[0.00016565705,0.0004468773,0.0035348444,0.00091882737,0.00020366994,0.0017461707,0.0023745995,0.34074908,0.04913239,0.54779303,0.05258998,0.00034483575],"about_ca_topic_score_codex":0.007505032,"about_ca_topic_score_gemma":0.00565579,"teacher_disagreement_score":0.010370246,"about_ca_system_score_codex":0.004569173,"about_ca_system_score_gemma":0.0044640913,"threshold_uncertainty_score":0.054843724},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20917395,0.0058135325,0.37622687,0.004584535,0.002390767,0.0005159922,0.0023290948,0.052095007,0.34687024],"genre_scores_gemma":[0.82226753,0.0014406566,0.0750505,0.002048204,0.00034255424,0.00021869616,0.0019210138,0.002475933,0.09423486],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99884254,0.00011245483,0.00004590542,0.00019266304,0.0006488793,0.0001574284],"domain_scores_gemma":[0.9985513,0.00022720947,0.00018133436,0.000633604,0.00033571827,0.0000708603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050832337,0.0006401498,0.0003712019,0.0006776959,0.00062751485,0.0009245675,0.0009331627,0.0007678479,0.019327862],"category_scores_gemma":[0.0027419184,0.00029417893,0.00030596118,0.00034765937,0.0008829411,0.0020260592,0.0016140476,0.0011188361,0.00641022],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012971024,0.00014003043,0.0060625286,0.00061386434,0.0001168291,0.0007148403,0.00046886853,0.00921445,0.15195018,0.13706057,0.13657904,0.5557817],"study_design_scores_gemma":[0.00010280198,0.0008963607,0.0033094669,0.00019650164,0.000145964,0.003327005,0.00013592618,0.06389449,0.22716588,0.047696304,0.6530082,0.00012110573],"about_ca_topic_score_codex":0.00055142806,"about_ca_topic_score_gemma":0.0009436278,"teacher_disagreement_score":0.019327862,"about_ca_system_score_codex":0.000518667,"about_ca_system_score_gemma":0.0006497453,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012228859,0.0028911193,0.09854703,0.0026745675,0.004387403,0.0005800985,0.007881333,0.03805711,0.83275247],"genre_scores_gemma":[0.07055218,0.002498476,0.04436871,0.0029252185,0.00067137345,0.00055997487,0.01584427,0.0042569167,0.85832286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992379,0.000064195076,0.000053373646,0.00015568231,0.00037542003,0.00011338223],"domain_scores_gemma":[0.99909675,0.00006790814,0.00004924622,0.00028405644,0.0004226354,0.00007942039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052033324,0.0010233675,0.00050542236,0.0013890141,0.0010914541,0.0033669453,0.0024471576,0.001806098,0.21579434],"category_scores_gemma":[0.0015172701,0.00053607376,0.00055612356,0.0010084122,0.00036327878,0.0037810311,0.0023632487,0.0016357127,0.17642583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033996982,0.00020094904,0.0014793178,0.00060394505,0.00004645744,0.0005145617,0.00026093476,0.0015878446,0.018008739,0.037056133,0.4418025,0.49809873],"study_design_scores_gemma":[0.00003108898,0.00005834151,0.00045624905,0.00006649524,0.000013431017,0.00037727304,0.00007408097,0.0033080247,0.008920494,0.0049580326,0.98171127,0.000025204059],"about_ca_topic_score_codex":0.0014854423,"about_ca_topic_score_gemma":0.0021089623,"teacher_disagreement_score":0.21579434,"about_ca_system_score_codex":0.0006349537,"about_ca_system_score_gemma":0.0011155737,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005643455,0.0058823396,0.019017683,0.010483828,0.0088869305,0.00036821765,0.007950668,0.0129359225,0.928831],"genre_scores_gemma":[0.025893211,0.003746156,0.010104947,0.003499913,0.00093087356,0.00022397083,0.008016536,0.0031644993,0.9444199],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791783,0.0002042796,0.00010691829,0.00064049405,0.0008284662,0.00030197907],"domain_scores_gemma":[0.996693,0.00039251268,0.00021429278,0.0006759237,0.0012858291,0.0007383755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012593804,0.0014896798,0.0009761494,0.0025720359,0.0028641596,0.007175489,0.0029433975,0.003986577,0.5916217],"category_scores_gemma":[0.0043581696,0.0007636976,0.0008897523,0.0022949064,0.001240467,0.0043960414,0.004981776,0.0031757185,0.4095484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050518796,0.00015587521,0.0019054123,0.0007382049,0.000041567015,0.0011201459,0.00040788163,0.0007840096,0.0057885903,0.039356716,0.60975295,0.3394435],"study_design_scores_gemma":[0.000025413761,0.000036919297,0.00042856167,0.00010180775,0.000009097481,0.00047628544,0.0000936927,0.00033445048,0.0011112714,0.0031765236,0.9941896,0.000016325692],"about_ca_topic_score_codex":0.0036670484,"about_ca_topic_score_gemma":0.005563714,"teacher_disagreement_score":0.5916217,"about_ca_system_score_codex":0.0025172732,"about_ca_system_score_gemma":0.004178316,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033812717,0.0018118696,0.22905874,0.007107831,0.0046545262,0.00046406026,0.012419311,0.0799963,0.63067466],"genre_scores_gemma":[0.3792382,0.0022558107,0.13809633,0.003242493,0.0009247645,0.00072420173,0.018857218,0.015924525,0.44073647],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939823,0.00006137491,0.000020993079,0.00007392031,0.0003758113,0.000069772956],"domain_scores_gemma":[0.9988116,0.0002626508,0.000072784576,0.0002567937,0.0005088672,0.000087346816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005701858,0.00064765377,0.00052505534,0.0011268085,0.0009198362,0.0023451764,0.0015481316,0.0016670934,0.20775047],"category_scores_gemma":[0.0027156803,0.000317451,0.00047235054,0.0009889699,0.0006866372,0.0015256157,0.0011254449,0.0009794711,0.064712584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024270907,0.00012229157,0.0019071458,0.00026382087,0.00004363881,0.00076685956,0.00015468585,0.03494626,0.013047565,0.020744443,0.6558576,0.271903],"study_design_scores_gemma":[0.00008386893,0.00018998738,0.0018517678,0.000102176644,0.000018540932,0.0004264968,0.00007865574,0.2763875,0.027936073,0.010910161,0.6819512,0.000063553074],"about_ca_topic_score_codex":0.009522071,"about_ca_topic_score_gemma":0.013089184,"teacher_disagreement_score":0.20775047,"about_ca_system_score_codex":0.0017320927,"about_ca_system_score_gemma":0.0009459354,"threshold_uncertainty_score":0.69499457},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8287276,0.001027371,0.1619445,0.00041338685,0.00013766183,0.00015691636,0.00023874054,0.004684289,0.002669525],"genre_scores_gemma":[0.93658376,0.00015598125,0.061754126,0.00011820266,0.000025317328,0.000070175774,0.00020008956,0.00060310966,0.00048927293],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942509,0.0015579121,0.000348067,0.00070640905,0.0026740227,0.00046268557],"domain_scores_gemma":[0.9522841,0.02818356,0.004028534,0.008991117,0.006036005,0.0004766967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038695766,0.0010271994,0.00059464056,0.0008943271,0.00072031206,0.0009116378,0.0011864603,0.00055919634,0.00084596255],"category_scores_gemma":[0.05113979,0.0005875959,0.00040991156,0.0008052487,0.0008445394,0.002504971,0.0009522067,0.0014458644,0.00026994615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002659166,0.0010344972,0.07732595,0.00080416957,0.00023198556,0.00045215667,0.0015539546,0.312013,0.15070663,0.006663155,0.0040666875,0.4424887],"study_design_scores_gemma":[0.00012161328,0.0012343768,0.027705006,0.00012920763,0.00018642364,0.00026900566,0.00042397642,0.7126922,0.24759977,0.00469286,0.0048288666,0.000116715906],"about_ca_topic_score_codex":0.0032698184,"about_ca_topic_score_gemma":0.0047217337,"teacher_disagreement_score":0.0038695766,"about_ca_system_score_codex":0.0007621424,"about_ca_system_score_gemma":0.0017100052,"threshold_uncertainty_score":0.02046454},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014079304,0.002389315,0.25092506,0.0022191834,0.0020346437,0.00073224225,0.02301103,0.2738186,0.4307906],"genre_scores_gemma":[0.16634485,0.0025177442,0.34828478,0.003573933,0.0008455182,0.0012914698,0.1313029,0.054254346,0.29158452],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982955,0.00017740752,0.000115217015,0.00038739224,0.00075627456,0.0002682877],"domain_scores_gemma":[0.99839324,0.00019955914,0.00008198651,0.0006543149,0.000528166,0.0001427038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008547604,0.0016514269,0.0010079339,0.0015603884,0.0013201358,0.0036048258,0.0037669274,0.0014036008,0.116141796],"category_scores_gemma":[0.0034307714,0.00094577984,0.0014831687,0.0018636556,0.0006383099,0.0038655996,0.004271458,0.0021054416,0.09595275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006917719,0.00020673413,0.0020456023,0.00088283647,0.00010010881,0.00033790432,0.00022753683,0.008043678,0.009214886,0.056640506,0.563743,0.35786545],"study_design_scores_gemma":[0.00009473467,0.00010394114,0.0011409194,0.00009743883,0.000035127094,0.00036487385,0.00008230659,0.031355932,0.011400646,0.019734368,0.9355245,0.000065280234],"about_ca_topic_score_codex":0.0030909905,"about_ca_topic_score_gemma":0.0038792952,"teacher_disagreement_score":0.116141796,"about_ca_system_score_codex":0.001282962,"about_ca_system_score_gemma":0.0018724601,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038774107,0.0023776845,0.05494247,0.0049100374,0.0042840033,0.00053396134,0.011815075,0.043757122,0.87350225],"genre_scores_gemma":[0.040181816,0.00288556,0.049302537,0.0040247054,0.0009173912,0.0007479803,0.032956526,0.012350206,0.8566332],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983152,0.00017786268,0.000112746944,0.00044169292,0.0007046251,0.00024787904],"domain_scores_gemma":[0.99723935,0.0002861718,0.00013057406,0.0009918845,0.00091398385,0.00043813148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013358925,0.001325896,0.0009149933,0.0019851234,0.0017510301,0.0057719275,0.002996136,0.0021997467,0.4008659],"category_scores_gemma":[0.004355321,0.00077165524,0.0010294528,0.0017241833,0.0008076106,0.003968636,0.005112082,0.0022483456,0.3310575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043079356,0.00014183686,0.0013540108,0.0006243995,0.00004561572,0.00039626542,0.00020217478,0.00093143835,0.00724568,0.03891506,0.6823449,0.2673678],"study_design_scores_gemma":[0.000043928594,0.000026616512,0.00042488976,0.00008626695,0.0000099991885,0.00022228042,0.000044248653,0.001456672,0.0016602142,0.003953667,0.992054,0.000017309192],"about_ca_topic_score_codex":0.005334558,"about_ca_topic_score_gemma":0.0064978884,"teacher_disagreement_score":0.4008659,"about_ca_system_score_codex":0.0017510569,"about_ca_system_score_gemma":0.002850948,"threshold_uncertainty_score":0},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07719432,0.0033404648,0.70989895,0.0012118593,0.001791902,0.0006411613,0.002102295,0.031717863,0.17210117],"genre_scores_gemma":[0.4540347,0.0013680701,0.44872287,0.0024447616,0.00035201525,0.00038910023,0.004751576,0.003874367,0.08406247],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996649,0.00001869222,0.000011603852,0.0000660044,0.0001328814,0.00010602921],"domain_scores_gemma":[0.99963605,0.000034511122,0.000026012876,0.00016242659,0.00009178765,0.00004925697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020182015,0.00059157755,0.00037272632,0.00035192037,0.00031540383,0.00093165325,0.0014314334,0.00042201095,0.0149479415],"category_scores_gemma":[0.00068582396,0.00024402377,0.00032570277,0.0005258321,0.00045269783,0.0012462242,0.0015990501,0.0008646865,0.0035579554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001039004,0.000315246,0.0040609427,0.00078470184,0.00007262654,0.00044042428,0.00023636382,0.041245557,0.12062587,0.09039971,0.113219425,0.62756014],"study_design_scores_gemma":[0.0001610701,0.00067456224,0.0024985203,0.00007975556,0.00008636883,0.00071959646,0.00007937812,0.15105274,0.07390472,0.033012994,0.7376354,0.000094938056],"about_ca_topic_score_codex":0.0021720892,"about_ca_topic_score_gemma":0.0047045755,"teacher_disagreement_score":0.0149479415,"about_ca_system_score_codex":0.00057243527,"about_ca_system_score_gemma":0.0012267178,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19937089,0.00071433384,0.7587652,0.00067449064,0.00022542826,0.0006411743,0.00358852,0.007982543,0.0280374],"genre_scores_gemma":[0.7759383,0.0004741573,0.21024553,0.000279474,0.00003377045,0.0012475468,0.0023755406,0.0007218946,0.008683791],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998098,0.000047904003,0.000013535572,0.000024685925,0.00007760586,0.000026501513],"domain_scores_gemma":[0.99947184,0.00024376044,0.000047609487,0.00007121571,0.00013625325,0.000029239303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031812448,0.00057000294,0.000593528,0.0003684286,0.00035738366,0.00050125027,0.0016584196,0.0009204083,0.0065006004],"category_scores_gemma":[0.0013999209,0.00039395207,0.0005737744,0.00037808155,0.0002931237,0.0006713216,0.0005631069,0.0009298938,0.0006236412],"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.000024387002,0.000037805312,0.0006259085,0.00007561599,0.000025236179,0.0000630084,0.000037452202,0.98598737,0.0033081428,0.0040765656,0.0010330766,0.004705481],"study_design_scores_gemma":[0.000007817612,0.000014894251,0.000059623213,0.000003475061,0.0000044687904,0.0000082832685,0.0000046191967,0.9968323,0.00094506604,0.0007558852,0.0013599603,0.0000036766914],"about_ca_topic_score_codex":0.0039291596,"about_ca_topic_score_gemma":0.004614066,"teacher_disagreement_score":0.0065006004,"about_ca_system_score_codex":0.00080563093,"about_ca_system_score_gemma":0.001423399,"threshold_uncertainty_score":0.021746695},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24294326,0.00027730464,0.7416265,0.00018050702,0.000040348375,0.00009204988,0.00026301335,0.008702597,0.005874418],"genre_scores_gemma":[0.8641123,0.00010160429,0.13189887,0.000080371006,0.000027458796,0.000091095906,0.0004904473,0.00079989864,0.002397835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907506,0.00011294408,0.000040448893,0.00009436435,0.0005644819,0.0001126083],"domain_scores_gemma":[0.99804854,0.00089244626,0.0002664116,0.000303934,0.00044635995,0.00004230402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006798387,0.00055412564,0.00039097003,0.0011644718,0.00051677076,0.0009063533,0.00085721875,0.0004346305,0.0018235398],"category_scores_gemma":[0.0033426036,0.0003123051,0.00065497967,0.00052427244,0.00088773435,0.001043135,0.0008538239,0.0008451746,0.00040895672],"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.0006965172,0.0002810505,0.032454886,0.00035892718,0.00009813571,0.0006997512,0.00057226256,0.46026534,0.16964395,0.06305518,0.004594697,0.2672794],"study_design_scores_gemma":[0.000016644208,0.00009869857,0.0016265367,0.000015798987,0.000021231575,0.00009011238,0.000039876384,0.92036873,0.060446735,0.014760984,0.0024947403,0.000019960593],"about_ca_topic_score_codex":0.0025604542,"about_ca_topic_score_gemma":0.002459338,"teacher_disagreement_score":0.0025604542,"about_ca_system_score_codex":0.0008284027,"about_ca_system_score_gemma":0.0017800734,"threshold_uncertainty_score":0.0061003566},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006822572,0.000047890233,0.98767984,0.000039732247,0.000039439365,0.000044437278,0.000054804463,0.0027834033,0.002487882],"genre_scores_gemma":[0.16697271,0.00015616411,0.8274467,0.00010110028,0.00004327795,0.00028634226,0.00034306454,0.0013540854,0.0032965099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994973,0.000091976,0.00004042514,0.00006165303,0.0002558107,0.000052876698],"domain_scores_gemma":[0.9993843,0.00023100799,0.00006192347,0.00014603391,0.00014920831,0.000027577056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000375573,0.0005557839,0.00040239218,0.00043126525,0.00038263408,0.000569698,0.0007900056,0.0003174334,0.0035202678],"category_scores_gemma":[0.0016629416,0.00031724403,0.0005953404,0.000446306,0.00055373023,0.0005191831,0.0008741698,0.00083852216,0.0009055139],"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.00022767705,0.00023186058,0.001437905,0.00046150005,0.000074126954,0.00045143368,0.0003524958,0.47870013,0.06412086,0.09802072,0.011026462,0.34489483],"study_design_scores_gemma":[0.000041162584,0.000078953395,0.00014220044,0.000022741266,0.000014355258,0.0001198132,0.000026455082,0.9445819,0.028803207,0.01397522,0.012175618,0.000018405957],"about_ca_topic_score_codex":0.0014545794,"about_ca_topic_score_gemma":0.0021415825,"teacher_disagreement_score":0.0035202678,"about_ca_system_score_codex":0.0003949734,"about_ca_system_score_gemma":0.0009978494,"threshold_uncertainty_score":0.011776507},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03286703,0.0020206678,0.5773672,0.0008364647,0.0013197724,0.00076182414,0.0066845263,0.1828772,0.1952654],"genre_scores_gemma":[0.28499034,0.0020398397,0.4939185,0.002264254,0.0004959392,0.0014399715,0.031400725,0.03845082,0.14499967],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99932516,0.00009757986,0.00004697878,0.00011920634,0.00029070218,0.000120508834],"domain_scores_gemma":[0.9993782,0.00008807737,0.000053510044,0.00021754252,0.00018962854,0.00007300541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007598722,0.0010249321,0.0005369308,0.00051149185,0.0004923846,0.0015572372,0.0025951453,0.0006501454,0.044628724],"category_scores_gemma":[0.0014698949,0.0006726961,0.00074322004,0.00063392636,0.000541576,0.0017818316,0.0018862905,0.001703826,0.019597473],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023575618,0.0004028586,0.006598553,0.0011250994,0.00022972489,0.00070333574,0.00048942445,0.034924842,0.058255084,0.1335089,0.37928697,0.38211763],"study_design_scores_gemma":[0.0003812928,0.00058453804,0.0011793362,0.00010263625,0.00007744908,0.00064596906,0.000059906142,0.15898024,0.06681492,0.028891332,0.7421915,0.0000909194],"about_ca_topic_score_codex":0.0010874579,"about_ca_topic_score_gemma":0.0013386651,"teacher_disagreement_score":0.044628724,"about_ca_system_score_codex":0.0005657136,"about_ca_system_score_gemma":0.0013957681,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.640208,0.0005940278,0.3291254,0.00026841072,0.00024281413,0.00021965221,0.00021886756,0.014641401,0.0144814225],"genre_scores_gemma":[0.90111727,0.000086024644,0.09536966,0.000087924,0.000022108616,0.000088832676,0.00018618538,0.00018835206,0.002853517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924016,0.000109610526,0.000032708853,0.0001369647,0.0002827921,0.00019775916],"domain_scores_gemma":[0.9992847,0.00021723837,0.00005257118,0.00016366797,0.00020184754,0.0000800517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046670632,0.0009161334,0.00055402634,0.00048226715,0.00038946682,0.0007527357,0.001142078,0.0004095325,0.004628033],"category_scores_gemma":[0.0015139962,0.00032846714,0.00038507924,0.0005871525,0.00035009946,0.00072991505,0.0007258671,0.0005844432,0.00103315],"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.0042400635,0.00088402664,0.011164324,0.0005526276,0.0002893509,0.00089109316,0.00046285486,0.4452954,0.16600215,0.011295158,0.012411808,0.34651124],"study_design_scores_gemma":[0.00016312,0.0009632335,0.0030535895,0.000019731413,0.000071042,0.00015322435,0.00008315312,0.93398285,0.053760156,0.0015425764,0.0061699,0.000037507332],"about_ca_topic_score_codex":0.006001277,"about_ca_topic_score_gemma":0.006407542,"teacher_disagreement_score":0.006001277,"about_ca_system_score_codex":0.0008045082,"about_ca_system_score_gemma":0.0012872086,"threshold_uncertainty_score":0.0154823065},"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":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14383939,0.0026102606,0.36683652,0.001345582,0.0015591112,0.0010240027,0.008412481,0.40929967,0.06507295],"genre_scores_gemma":[0.56385976,0.0008409128,0.33343413,0.0021858034,0.00027029408,0.00067855883,0.01707629,0.013738853,0.06791541],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990822,0.00007416606,0.000056641024,0.00026301475,0.000355322,0.00016859743],"domain_scores_gemma":[0.99782145,0.00036344738,0.00016499842,0.0010323738,0.00052396505,0.00009372993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042654973,0.0012144459,0.000479731,0.0010416871,0.0005594936,0.0010373124,0.0023450002,0.00078181666,0.021598097],"category_scores_gemma":[0.002660061,0.0005387967,0.00062063464,0.00096441485,0.0005082403,0.0017682222,0.0013688568,0.0010941102,0.009393233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021125083,0.00042538208,0.008986971,0.00090681564,0.00018880781,0.00045953077,0.00033429934,0.017748207,0.06550852,0.017594427,0.22368196,0.66205263],"study_design_scores_gemma":[0.0006195152,0.0015040794,0.008796156,0.00015019767,0.00016946193,0.0012253693,0.0003198216,0.37563017,0.2458375,0.02783696,0.33762726,0.00028355804],"about_ca_topic_score_codex":0.004725823,"about_ca_topic_score_gemma":0.008908382,"teacher_disagreement_score":0.021598097,"about_ca_system_score_codex":0.0008214133,"about_ca_system_score_gemma":0.0015382796,"threshold_uncertainty_score":0},"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":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06261152,0.00086598867,0.30551526,0.00036696886,0.0004960876,0.00080053136,0.005479474,0.61174846,0.012115792],"genre_scores_gemma":[0.40148935,0.00084901997,0.49570674,0.00066114805,0.00018635692,0.0016971348,0.026722498,0.062057927,0.010629884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977689,0.0003082937,0.00022653291,0.00031260858,0.0011487638,0.00023490057],"domain_scores_gemma":[0.9951178,0.0013628126,0.0005731762,0.0014896097,0.0011864351,0.0002702457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031525043,0.0021222804,0.00082008954,0.002022702,0.0006702231,0.0015269325,0.004054509,0.0010671543,0.011890314],"category_scores_gemma":[0.008693556,0.0014903381,0.0010369567,0.0012079312,0.00083651784,0.0040434315,0.0024485888,0.0019494337,0.004524992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005541024,0.0014648257,0.02707913,0.0026097114,0.0007410933,0.0008777433,0.00087355665,0.09692024,0.13623498,0.025382787,0.18380706,0.51846784],"study_design_scores_gemma":[0.0013398358,0.0025124138,0.008371283,0.00033646417,0.00028082196,0.00045725817,0.00022523463,0.5531111,0.2517429,0.013784123,0.16733548,0.00050307397],"about_ca_topic_score_codex":0.0034520288,"about_ca_topic_score_gemma":0.003410733,"teacher_disagreement_score":0.011890314,"about_ca_system_score_codex":0.0014167704,"about_ca_system_score_gemma":0.002790871,"threshold_uncertainty_score":0.0397771},"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":"software","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009305572,0.0021231922,0.32743853,0.0008257818,0.00080527586,0.00031609883,0.0061459867,0.58495337,0.06808626],"genre_scores_gemma":[0.1509391,0.0025260807,0.41590264,0.0028643878,0.00038293627,0.0008616966,0.045654424,0.17319976,0.20766899],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998447,0.00013207985,0.00012573495,0.00040030913,0.00064158614,0.0002534556],"domain_scores_gemma":[0.99842167,0.00029274408,0.00013883843,0.00059765653,0.0004309733,0.000118018674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009041758,0.001999081,0.0009662915,0.0012685288,0.0007356142,0.002257087,0.003871665,0.0015503464,0.092070855],"category_scores_gemma":[0.0042709084,0.001259726,0.00140713,0.00091217813,0.0006399445,0.004514749,0.0035758042,0.0028594204,0.086137675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010767062,0.0002580242,0.0025043844,0.001189811,0.00015659866,0.00038414038,0.00034371667,0.007540692,0.01908009,0.043712657,0.47460917,0.44914398],"study_design_scores_gemma":[0.00024504756,0.0002201653,0.0015465625,0.00018425891,0.00008344627,0.0009198742,0.00008784438,0.06480827,0.05798774,0.03364249,0.84008735,0.00018698501],"about_ca_topic_score_codex":0.0022210344,"about_ca_topic_score_gemma":0.0027840622,"teacher_disagreement_score":0.092070855,"about_ca_system_score_codex":0.001088287,"about_ca_system_score_gemma":0.0018112133,"threshold_uncertainty_score":0.30800766},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23322722,0.0013841745,0.70147264,0.0006542207,0.00046678324,0.0007191227,0.0024699287,0.019106535,0.04049938],"genre_scores_gemma":[0.57940155,0.0007101572,0.39217767,0.0003972501,0.00013723766,0.00051779277,0.0053507998,0.001092678,0.02021479],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994578,0.00003798096,0.000037574715,0.00007619267,0.00032873495,0.00006183118],"domain_scores_gemma":[0.9988852,0.000304201,0.000093632836,0.00032208842,0.0003673927,0.000027593185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035836385,0.0006623227,0.00038945087,0.0011536755,0.00048025328,0.00084172713,0.00096423517,0.0005316594,0.005366927],"category_scores_gemma":[0.0024102072,0.00019293003,0.00030763922,0.0012504136,0.00044026304,0.0010314526,0.0005818606,0.00048270248,0.0015703944],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066924357,0.00020984726,0.0042800168,0.00025883928,0.000052134234,0.00031096028,0.000225701,0.03696732,0.07645572,0.029373793,0.026363676,0.82483286],"study_design_scores_gemma":[0.00009621686,0.00055212417,0.004224969,0.00008627958,0.000044285105,0.0011218888,0.0002163382,0.5460628,0.37065467,0.018033335,0.058841903,0.00006512817],"about_ca_topic_score_codex":0.0015742157,"about_ca_topic_score_gemma":0.0026323511,"teacher_disagreement_score":0.005366927,"about_ca_system_score_codex":0.0005394737,"about_ca_system_score_gemma":0.0008368981,"threshold_uncertainty_score":0.017954111},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02908627,0.00021954086,0.9563312,0.00010075604,0.000050569528,0.00007975599,0.00011661484,0.0044981893,0.009517138],"genre_scores_gemma":[0.38991225,0.00023408029,0.60256857,0.00016285508,0.00003590847,0.00023321729,0.0005775493,0.001103981,0.005171562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967134,0.00007114194,0.00002497098,0.00003903621,0.00013967624,0.000053778964],"domain_scores_gemma":[0.9995938,0.00017898026,0.00004723957,0.00008248217,0.000084530104,0.000013081214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050322886,0.00055880257,0.0002510393,0.00048634206,0.00025504266,0.0007236011,0.00077057147,0.00034631896,0.004067813],"category_scores_gemma":[0.00097410695,0.00025986813,0.0005487522,0.00031048703,0.00037874168,0.00051066594,0.00036202552,0.0007610835,0.0009664195],"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.00027815363,0.00021289004,0.0017619423,0.00074302807,0.00006238349,0.00034447017,0.00038202203,0.43590677,0.16698337,0.084475204,0.006454143,0.3023956],"study_design_scores_gemma":[0.000053353975,0.000291438,0.00048516586,0.000053599222,0.000041905816,0.00014953563,0.000053435342,0.8540721,0.09699773,0.023416327,0.024360389,0.000025001926],"about_ca_topic_score_codex":0.0009968964,"about_ca_topic_score_gemma":0.0014257487,"teacher_disagreement_score":0.004067813,"about_ca_system_score_codex":0.0005424721,"about_ca_system_score_gemma":0.0009009423,"threshold_uncertainty_score":0.013608158},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09810831,0.0004956281,0.87475973,0.000302598,0.00021479194,0.00021359778,0.0002724308,0.02046452,0.0051683863],"genre_scores_gemma":[0.4243487,0.00020460924,0.5653629,0.00024275472,0.000039209554,0.00026712954,0.0007989006,0.004684569,0.0040513175],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980823,0.00034930054,0.0001835738,0.0002851129,0.0008836393,0.0002160655],"domain_scores_gemma":[0.99312276,0.0024160387,0.000442022,0.0023049298,0.0015679973,0.00014623329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013779642,0.0007334946,0.0003832165,0.0010597333,0.00045596677,0.0012012338,0.0018873338,0.000646017,0.0034892058],"category_scores_gemma":[0.010564805,0.0005058525,0.00062391016,0.0009309199,0.0008385449,0.002126791,0.0018029743,0.0017160805,0.0013690563],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010067228,0.0004537359,0.012431641,0.0008302874,0.00012446872,0.0009043275,0.0014900565,0.12422673,0.19435865,0.0620153,0.01249728,0.5896608],"study_design_scores_gemma":[0.00014067505,0.00046524557,0.0011586993,0.00011081757,0.00006410284,0.0003377997,0.00020102497,0.7355459,0.21149287,0.021121556,0.029278485,0.00008287079],"about_ca_topic_score_codex":0.0017925757,"about_ca_topic_score_gemma":0.0026503368,"teacher_disagreement_score":0.0034892058,"about_ca_system_score_codex":0.0006105141,"about_ca_system_score_gemma":0.001485136,"threshold_uncertainty_score":0.011672497},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3997771,0.002552242,0.53698146,0.00061448343,0.00022238035,0.00034564035,0.00035977637,0.03414208,0.02500486],"genre_scores_gemma":[0.88052505,0.00058365474,0.10900733,0.00026802206,0.000035109068,0.00015099754,0.00034928462,0.0012112329,0.007869374],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99908614,0.00014948264,0.00008257097,0.00013805108,0.00027966689,0.0002640986],"domain_scores_gemma":[0.9985598,0.00024882998,0.00016939625,0.00070539856,0.00025055185,0.00006606329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008051678,0.00077903975,0.00041820045,0.0006355997,0.00076322467,0.0011911256,0.0013559968,0.00053046,0.0046500443],"category_scores_gemma":[0.002231286,0.0006088362,0.0004290626,0.00061114656,0.0010307127,0.003261217,0.0017145739,0.0011286427,0.0011641147],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035861155,0.00042240144,0.015045868,0.0011680915,0.00016448862,0.00095559057,0.001887173,0.06078528,0.24180454,0.16947247,0.02620722,0.47850075],"study_design_scores_gemma":[0.00033982235,0.001606469,0.005128109,0.00032037726,0.00026083997,0.00089859305,0.0005077283,0.2933356,0.496707,0.058351383,0.14235936,0.00018488333],"about_ca_topic_score_codex":0.0022305215,"about_ca_topic_score_gemma":0.0021244425,"teacher_disagreement_score":0.0046500443,"about_ca_system_score_codex":0.0010818461,"about_ca_system_score_gemma":0.0015487721,"threshold_uncertainty_score":0.015555978},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06214073,0.00007747909,0.92921746,0.00019722135,0.000022704096,0.00007701543,0.0001731192,0.0038068579,0.0042874576],"genre_scores_gemma":[0.64374435,0.00014910343,0.350826,0.00014452827,0.000040644834,0.0002438954,0.0006344146,0.0010433092,0.0031736658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985695,0.00034988605,0.00008915795,0.00019825617,0.0005963841,0.00019680902],"domain_scores_gemma":[0.9965688,0.0022537813,0.00033770467,0.00040615216,0.00038755458,0.000045929475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007790004,0.0010338977,0.00047260235,0.0012179357,0.0005030056,0.0010359604,0.0007308024,0.0005037145,0.003647955],"category_scores_gemma":[0.0057016183,0.0003603457,0.0011507263,0.0007962063,0.0017479729,0.0013614829,0.0011910752,0.0011191592,0.00038273295],"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.000488831,0.00019473734,0.007854144,0.0008165344,0.000107852815,0.000750474,0.00080053194,0.48047823,0.076211825,0.19187629,0.004415646,0.23600486],"study_design_scores_gemma":[0.000028988938,0.000066120214,0.00051267433,0.00003151861,0.00003450357,0.00009248229,0.00006259562,0.91399276,0.0354834,0.04582869,0.0038477571,0.000018642113],"about_ca_topic_score_codex":0.0024988782,"about_ca_topic_score_gemma":0.0031163208,"teacher_disagreement_score":0.003647955,"about_ca_system_score_codex":0.0012827452,"about_ca_system_score_gemma":0.0016069616,"threshold_uncertainty_score":0.012203634},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1816063,0.0029416985,0.7969242,0.00035943295,0.00014709558,0.00017807292,0.0002023801,0.005894531,0.011746338],"genre_scores_gemma":[0.86822784,0.00033928783,0.12872621,0.00013423874,0.00004189735,0.00012825822,0.00019737612,0.00018627518,0.0020185704],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996215,0.000043101638,0.000025469115,0.0000516701,0.0001703796,0.000087758446],"domain_scores_gemma":[0.99962616,0.00007122555,0.000049251175,0.00011981826,0.000102948354,0.00003062797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003290479,0.00042540923,0.00039383175,0.00034955738,0.00032796303,0.0007058437,0.0015205164,0.0002501381,0.0021320132],"category_scores_gemma":[0.0008929716,0.0001966291,0.00028050767,0.00048344245,0.0003989154,0.0014601231,0.0013333046,0.0004803119,0.00046705612],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053138996,0.00031247447,0.006376993,0.00072449626,0.00012217062,0.00024291828,0.00027289774,0.31013596,0.21040742,0.035026375,0.013517646,0.42232928],"study_design_scores_gemma":[0.000052258958,0.00032268738,0.0007863122,0.000017092609,0.0000532566,0.00017505453,0.00009429642,0.93479496,0.046493303,0.008073892,0.009103187,0.000033633456],"about_ca_topic_score_codex":0.0007141842,"about_ca_topic_score_gemma":0.0014025732,"teacher_disagreement_score":0.0021320132,"about_ca_system_score_codex":0.00052413426,"about_ca_system_score_gemma":0.00093194004,"threshold_uncertainty_score":0.007132232},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03417426,0.0006605444,0.9232315,0.00023614061,0.00014417018,0.000060551716,0.00028486547,0.03197937,0.009228581],"genre_scores_gemma":[0.2891856,0.00035092473,0.68936574,0.00041653955,0.00006955122,0.00026027628,0.0018296009,0.004263136,0.014258567],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99939,0.00007066124,0.000026923364,0.000094317074,0.00031070973,0.000107385466],"domain_scores_gemma":[0.9995433,0.000115294715,0.000030826388,0.0001485832,0.00012482332,0.000037152815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005038523,0.0007182105,0.00060954515,0.000505026,0.00059617026,0.0012047219,0.0024349878,0.0005919278,0.0049797124],"category_scores_gemma":[0.0016727287,0.0004714693,0.0005707189,0.00073358964,0.0006228856,0.0015992624,0.0014993909,0.0011393635,0.0019167044],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010481164,0.00022098966,0.00441497,0.00036546608,0.00021851998,0.00034644952,0.00028309185,0.13817278,0.0672958,0.08243728,0.06770077,0.6374958],"study_design_scores_gemma":[0.00006663042,0.00008909582,0.00047833283,0.000021610698,0.000019030585,0.00014217201,0.00002775427,0.91871285,0.044280507,0.015739905,0.020395672,0.000026458998],"about_ca_topic_score_codex":0.0062087397,"about_ca_topic_score_gemma":0.012637955,"teacher_disagreement_score":0.0062087397,"about_ca_system_score_codex":0.0011337537,"about_ca_system_score_gemma":0.0020886331,"threshold_uncertainty_score":0.016658783},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13800816,0.0021007103,0.6598968,0.0006958843,0.0005060783,0.00046822766,0.003412014,0.17037956,0.024532601],"genre_scores_gemma":[0.53081566,0.0005889534,0.44117725,0.00049025856,0.00008150298,0.0003846132,0.0065263165,0.011703866,0.0082316715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998321,0.0002477309,0.00015269741,0.0003422792,0.0007016723,0.00023463639],"domain_scores_gemma":[0.998539,0.00028457743,0.00006312624,0.000512032,0.000503528,0.00009781837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011107933,0.0010970143,0.0006415882,0.000491511,0.00059292326,0.0018959345,0.0026255597,0.00053611613,0.004613505],"category_scores_gemma":[0.003400356,0.0006153906,0.0006518858,0.00091636565,0.0007731023,0.0019086511,0.0017364738,0.001490248,0.0020193981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002921637,0.00071175187,0.018694704,0.0012850919,0.0003650065,0.0011338912,0.0019586463,0.105501935,0.1320706,0.045984987,0.21989845,0.4694733],"study_design_scores_gemma":[0.00031480912,0.00032280275,0.0031291877,0.00006402338,0.000066744855,0.000319842,0.00033210524,0.78968596,0.100097835,0.012685193,0.092891626,0.000089882364],"about_ca_topic_score_codex":0.010997508,"about_ca_topic_score_gemma":0.01296169,"teacher_disagreement_score":0.010997508,"about_ca_system_score_codex":0.0014671261,"about_ca_system_score_gemma":0.0023572652,"threshold_uncertainty_score":0.021866977},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05193672,0.00042471997,0.92056924,0.00021705675,0.000103749226,0.00005612298,0.00019658406,0.014877301,0.011618527],"genre_scores_gemma":[0.34022108,0.00024342035,0.65294343,0.00020066013,0.000046544727,0.0001006935,0.00077152054,0.0016781738,0.003794482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995926,0.00006757591,0.000031351447,0.00007901019,0.0001478215,0.00008158054],"domain_scores_gemma":[0.99922657,0.00025274267,0.00006550599,0.00024333697,0.00017938555,0.00003240618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060753315,0.0009481812,0.00051258685,0.00038116562,0.0003833636,0.0008571592,0.001043135,0.00037078527,0.004263404],"category_scores_gemma":[0.0022313583,0.00041795138,0.0009511658,0.000404705,0.0005630506,0.0013304296,0.0010231287,0.0010167554,0.0014266919],"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.00032370645,0.00013215838,0.0043723052,0.00032178164,0.000108213935,0.00023576156,0.0004059569,0.49202633,0.04280592,0.0653356,0.015765058,0.3781672],"study_design_scores_gemma":[0.000014490123,0.00003992493,0.00021734947,0.000013337373,0.000013733647,0.000045145145,0.00002530716,0.9668624,0.015904494,0.011017741,0.0058372235,0.000008907469],"about_ca_topic_score_codex":0.0055771107,"about_ca_topic_score_gemma":0.006609458,"teacher_disagreement_score":0.0055771107,"about_ca_system_score_codex":0.00090671005,"about_ca_system_score_gemma":0.002060088,"threshold_uncertainty_score":0.014262497},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21352202,0.0005139237,0.77063584,0.0002594619,0.000024417232,0.00007072627,0.00008426399,0.002225432,0.012663973],"genre_scores_gemma":[0.8380035,0.000112833986,0.15972202,0.000056922818,0.000010116519,0.00006085004,0.000089330555,0.0002703251,0.001674148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994678,0.00013225852,0.00002399683,0.00006570452,0.00019989647,0.000110351735],"domain_scores_gemma":[0.99929297,0.00036822332,0.00008236233,0.0001690531,0.000060672686,0.00002675709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005046971,0.0007364036,0.0004958005,0.0005494038,0.00036701476,0.0006936709,0.00075326057,0.0003692665,0.0017709184],"category_scores_gemma":[0.0017957115,0.0002526924,0.00036263518,0.00057023606,0.00075096387,0.001078639,0.0009863601,0.0005613904,0.00040716847],"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.00025153405,0.00013844635,0.0016903923,0.00018732113,0.00003109693,0.00015598546,0.00019103647,0.7447697,0.047755066,0.026810298,0.0016591205,0.17636003],"study_design_scores_gemma":[0.000020251486,0.000108255044,0.00027295607,0.0000146191005,0.000014955368,0.0000456168,0.000041425625,0.960861,0.021857655,0.014860959,0.0018916505,0.000010626325],"about_ca_topic_score_codex":0.0019198075,"about_ca_topic_score_gemma":0.003277497,"teacher_disagreement_score":0.0019198075,"about_ca_system_score_codex":0.0008422185,"about_ca_system_score_gemma":0.0011697788,"threshold_uncertainty_score":0.006110728},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035206378,0.0011960167,0.9330436,0.00036991233,0.00015256848,0.00021166606,0.00029686576,0.018995555,0.010527431],"genre_scores_gemma":[0.5602323,0.00041383022,0.42616475,0.0006026959,0.00008994907,0.00025207215,0.00069139374,0.002635605,0.008917527],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980268,0.00028493587,0.00012256143,0.00037172184,0.00082957576,0.00036442917],"domain_scores_gemma":[0.99853516,0.0003819307,0.00019810042,0.000581027,0.00023054816,0.000073258234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009869044,0.0012158436,0.00058719475,0.0009891047,0.0006390382,0.0016643205,0.0022087859,0.0005867693,0.0051449384],"category_scores_gemma":[0.0028460461,0.00049585983,0.00096044067,0.00062653207,0.0017055317,0.0027851758,0.002536058,0.001370514,0.0012519027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009949702,0.00026396953,0.006423177,0.001025769,0.00014518845,0.0005593343,0.00045396862,0.1532568,0.08751196,0.14783987,0.020304326,0.5812207],"study_design_scores_gemma":[0.00015994482,0.00046949822,0.00092949485,0.0001652335,0.00014988986,0.00051757816,0.00015331291,0.6819616,0.1318478,0.12927923,0.054248933,0.00011747982],"about_ca_topic_score_codex":0.0033788453,"about_ca_topic_score_gemma":0.006210232,"teacher_disagreement_score":0.0051449384,"about_ca_system_score_codex":0.0013921844,"about_ca_system_score_gemma":0.0026294708,"threshold_uncertainty_score":0.017211497},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70870554,0.0011792915,0.20904768,0.00052121084,0.00053588796,0.0004737657,0.001015762,0.06522957,0.013291325],"genre_scores_gemma":[0.90029263,0.00027128618,0.09088388,0.00026770556,0.00007858176,0.00017110605,0.0014142828,0.0010218603,0.005598638],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99939334,0.000075945034,0.000042100688,0.00012206973,0.00021080478,0.00015586326],"domain_scores_gemma":[0.99858046,0.00028268763,0.000102729005,0.0005358385,0.00024402874,0.00025422542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006786967,0.000799983,0.0005121898,0.00057711045,0.0007106842,0.0012426926,0.0023511495,0.00042473784,0.0031994267],"category_scores_gemma":[0.0020523856,0.0003562229,0.00038803485,0.00060812524,0.0007265522,0.0024639247,0.002301786,0.0010359698,0.0012592425],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0072437017,0.002644152,0.024026606,0.0006067914,0.00039714057,0.0013993633,0.0012530534,0.11010911,0.39493963,0.011135106,0.07634343,0.36990193],"study_design_scores_gemma":[0.00075678166,0.0021983492,0.008591561,0.000037146525,0.00013752273,0.00054440415,0.00031096477,0.74397826,0.21545729,0.00387725,0.023934418,0.00017596204],"about_ca_topic_score_codex":0.0027688423,"about_ca_topic_score_gemma":0.0025009734,"teacher_disagreement_score":0.0031994267,"about_ca_system_score_codex":0.0005628781,"about_ca_system_score_gemma":0.001189387,"threshold_uncertainty_score":0.010703146},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13218965,0.0016275332,0.81651366,0.0008451889,0.0004861721,0.0004889032,0.0013466828,0.025783485,0.020718783],"genre_scores_gemma":[0.713191,0.0005023299,0.27234784,0.000383845,0.00012142167,0.00038846082,0.001850957,0.0005255822,0.010688635],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99972636,0.00004621318,0.000023137847,0.000046833346,0.00009351946,0.000063961365],"domain_scores_gemma":[0.99967027,0.00006509457,0.000044480992,0.000096915006,0.00008526203,0.000038064612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045677897,0.00062320655,0.00027842383,0.0005162809,0.00041280797,0.0007006186,0.0011549047,0.00032525623,0.008074135],"category_scores_gemma":[0.000738771,0.00026245695,0.00038712463,0.00042167678,0.0003948153,0.0014317797,0.0007097864,0.0007715958,0.0011712093],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027872685,0.0006594627,0.006546887,0.000894179,0.00022945218,0.0007198627,0.00035288327,0.18900804,0.16545951,0.1012277,0.102654904,0.42945984],"study_design_scores_gemma":[0.00028121893,0.0009411389,0.0010439048,0.000058318637,0.00006607644,0.00029540883,0.0000619867,0.84111273,0.08190591,0.01905155,0.05511043,0.000071353534],"about_ca_topic_score_codex":0.0015088329,"about_ca_topic_score_gemma":0.0032566136,"teacher_disagreement_score":0.008074135,"about_ca_system_score_codex":0.00085097755,"about_ca_system_score_gemma":0.0012759324,"threshold_uncertainty_score":0.02701068},"labels":[],"label_agreement":null}]}