{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":73,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":73,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"93eb47b7416c","filters":{"venue":"ACM SIGARCH Computer Architecture News"}},"results":[{"id":"W2147657366","doi":"10.1145/2024716.2024718","title":"The gem5 simulator","year":2011,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4858,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"x86; Computer science; ARM architecture; Booting; Operating system; Embedded system; Software","retraction":null,"screen_n_in":null,"score":{"opus":0.02500028102197819,"gpt":0.2505314914940309,"spread":0.2255312104720527,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004595835,0.0002899439,0.0002279444,0.0001527392,0.0005787532,0.000302617,0.004884156,0.0000929907,0.00001065549],"category_scores_gemma":[0.0001368464,0.000193441,0.000160647,0.000486732,0.0001438116,0.0001788293,0.002090631,0.0004545712,0.00006563912],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002956598,"about_ca_system_score_gemma":0.00008530447,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005464482,"about_ca_topic_score_gemma":0.00002081149,"domain_scores_codex":[0.9977067,0.0002713056,0.000382151,0.0006172374,0.0004108942,0.0006117248],"domain_scores_gemma":[0.9964881,0.0007325506,0.0001369667,0.002313611,0.0001321942,0.0001965895],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002600575,0.00009980442,0.0007942894,0.00001142103,0.00007017146,0.00003758199,0.004714817,0.01747379,0.00005726565,0.02359626,0.01743976,0.9356788],"study_design_scores_gemma":[0.0007791558,0.0006462273,0.005182208,0.00005526304,0.00001368604,0.0001359091,0.00001232948,0.623934,0.002776822,0.1728922,0.192702,0.0008702024],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001665531,0.0001650128,0.9908286,0.001993174,0.0005966055,0.0003099284,7.523847e-7,0.001169415,0.003270962],"genre_scores_gemma":[0.2023649,0.00003846549,0.7949302,0.002038797,0.0003627944,0.00002542691,0.000001959779,0.0000257248,0.0002117088],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9348086,"threshold_uncertainty_score":0.9076059,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2516141709","doi":"10.1145/3007787.3001138","title":"Cnvlutin","year":2016,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":639,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia; University of Toronto","funders":"","keywords":"Computer science; Multiplication (music); Operand; Computation; Overhead (engineering); Parallel computing; Efficient energy use; Fraction (chemistry); State (computer science); Algorithm; Arithmetic; Computer hardware; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01560700340416213,"gpt":0.2567286129807016,"spread":0.2411216095765395,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001439035,0.0002895793,0.0002453185,0.0001673857,0.0001968039,0.00009535169,0.003748959,0.00007473055,0.00002611285],"category_scores_gemma":[0.00009804605,0.0001855301,0.0001316563,0.0006037579,0.0001273437,0.0003040867,0.00212576,0.0002659776,0.0003435062],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005498826,"about_ca_system_score_gemma":0.00005789545,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007039327,"about_ca_topic_score_gemma":0.0000224666,"domain_scores_codex":[0.9975824,0.0001396307,0.000328049,0.000881936,0.0003961992,0.0006717261],"domain_scores_gemma":[0.9957933,0.001128543,0.000110086,0.002625724,0.00007447973,0.0002678819],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000006067488,0.00003096638,0.000283936,0.000003512244,0.0000126328,0.00001403719,0.0001778011,0.0005448352,0.005428725,0.01891732,0.007051363,0.9675288],"study_design_scores_gemma":[0.001447851,0.0003629068,0.006358832,0.000100553,0.000009266447,0.0002674868,0.000002038807,0.007641048,0.007823505,0.4057811,0.5692179,0.0009875116],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004555518,0.00006105741,0.9603595,0.03287324,0.0003742674,0.0003487736,0.000003610277,0.0006966607,0.00072733],"genre_scores_gemma":[0.2080746,0.00003141189,0.786678,0.00379519,0.0009136295,0.00008163513,0.000002319141,0.0000326703,0.0003905721],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9665413,"threshold_uncertainty_score":0.7565699,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098278566","doi":"10.1145/1735970.1736036","title":"Addressing shared resource contention in multicore processors via scheduling","year":2010,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":511,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scheduling (production processes); Distributed computing; Workload; Multi-core processor; Thread (computing); Gang scheduling; Shared memory; Cache; Fair-share scheduling; Parallel computing; Quality of service; Two-level scheduling; Operating system; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.03583677900696412,"gpt":0.2961899832905564,"spread":0.2603532042835923,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005965667,0.0003483513,0.0003671495,0.0005634263,0.0002544684,0.0004568528,0.002671339,0.000205647,0.000009469763],"category_scores_gemma":[0.0003570384,0.000323881,0.0001281211,0.0008106343,0.0001041999,0.0003825691,0.001291146,0.001264666,0.00001362378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003961035,"about_ca_system_score_gemma":0.00009370051,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008702186,"about_ca_topic_score_gemma":0.0001642326,"domain_scores_codex":[0.9971997,0.0002224208,0.0005568389,0.0009120731,0.0004728709,0.0006360968],"domain_scores_gemma":[0.9976546,0.0004256958,0.0002196128,0.001335859,0.0001632235,0.0002009949],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004434001,0.0002315556,0.005615556,0.00009795051,0.00002888508,0.00007257369,0.005559814,0.1253448,0.01192146,0.0008794933,0.0007777648,0.8494258],"study_design_scores_gemma":[0.000978102,0.0001221367,0.00504016,0.0002361143,0.00000489834,0.00009334418,0.00001175694,0.9791233,0.00281495,0.007675485,0.003413245,0.000486516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07983054,0.00005629673,0.9160228,0.002070299,0.0003417424,0.0004443374,0.00000136185,0.0008999381,0.0003326581],"genre_scores_gemma":[0.4172905,0.000002255767,0.5817139,0.0006830686,0.0002249908,0.00002570026,0.00001311854,0.00002187723,0.00002460978],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8537785,"threshold_uncertainty_score":0.9999213,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2119092821","doi":"10.1145/2366231.2337161","title":"RAIDR","year":2012,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":449,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Samsung; National Science Foundation","keywords":"Dram; Memory controller; Computer science; Row; Dynamic random-access memory; CAS latency; Embedded system; Universal memory; Static random-access memory; Computer hardware; Overhead (engineering); Memory refresh; Controller (irrigation); Data retention; Semiconductor memory; Operating system; Computer memory","retraction":null,"screen_n_in":null,"score":{"opus":0.01983698611201415,"gpt":0.2647596643035801,"spread":0.244922678191566,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002942983,0.0003609313,0.0003230135,0.0003337623,0.0001925388,0.0001465712,0.005187226,0.0001369093,0.00001948426],"category_scores_gemma":[0.0002941919,0.0003024271,0.0001264599,0.0007180988,0.0001738227,0.001047228,0.005303912,0.0006561797,0.0002884722],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007140882,"about_ca_system_score_gemma":0.00004663143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001691806,"about_ca_topic_score_gemma":0.000009732431,"domain_scores_codex":[0.9973177,0.0001300853,0.000318344,0.0006582415,0.0004960184,0.001079585],"domain_scores_gemma":[0.995487,0.0005580849,0.0001153637,0.003499665,0.00005672851,0.0002831291],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000006381702,0.0000845375,0.001315961,0.00001407203,0.00002743816,0.00002404227,0.001234322,0.0004621019,0.0009043938,0.03234402,0.01062567,0.952957],"study_design_scores_gemma":[0.001156747,0.0004671775,0.007675631,0.00006193938,0.00001728825,0.0006520096,0.00003421797,0.005830993,0.009740255,0.1870111,0.7858293,0.001523322],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00665709,0.0004765376,0.9839376,0.004688188,0.001111489,0.0002972287,0.000006344951,0.001859323,0.0009662635],"genre_scores_gemma":[0.2117402,0.00001625932,0.7855853,0.001815913,0.0007097335,0.00003288001,0.000009976137,0.00002584347,0.00006384222],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9514337,"threshold_uncertainty_score":0.9999428,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111880608","doi":"10.1145/545214.545218","title":"The optimal logic depth per pipeline stage is 6 to 8 FO4 inverter delays","year":2002,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":242,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"PQ Corporation (Canada)","funders":"","keywords":"Clock skew; Pipeline (software); Timing failure; Digital clock manager; Computer science; Inverter; Clock rate; Overhead (engineering); Microprocessor; Skew; Integer (computer science); Instructions per cycle; Window (computing); Parallel computing; Clock signal; Computer hardware; Engineering; Electrical engineering; Telecommunications; Central processing unit; Chip; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.0185644690845569,"gpt":0.2237830178775383,"spread":0.2052185487929813,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002495372,0.0005565807,0.000384017,0.0002594694,0.0003004877,0.000211373,0.001633362,0.0001600772,0.0004066958],"category_scores_gemma":[0.00004548917,0.0003872446,0.0001902547,0.0004366539,0.0001074252,0.0001633731,0.0006082274,0.0008609749,0.001218166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001102442,"about_ca_system_score_gemma":0.00001952301,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002619563,"about_ca_topic_score_gemma":0.0001299592,"domain_scores_codex":[0.9971508,0.0001053176,0.0005028285,0.0005839381,0.0005735628,0.001083562],"domain_scores_gemma":[0.9974596,0.0004288618,0.00004656601,0.001615272,0.00007940445,0.000370304],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004433457,0.00005641052,0.0005954265,0.000066115,0.0001386475,0.00005830528,0.007821876,0.3085544,0.001980297,0.00009997935,0.254891,0.4256932],"study_design_scores_gemma":[0.0007295898,0.0003252803,0.0007794384,0.00003822558,0.00002376938,0.00006872448,0.00002775944,0.5502496,0.002025717,0.0002673934,0.444762,0.0007025375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09719463,0.0006715727,0.8898906,0.006374623,0.001193792,0.0008835999,0.00002568471,0.0008159932,0.002949575],"genre_scores_gemma":[0.7599857,0.0002697967,0.2219748,0.01279261,0.00217065,0.0001632676,0.00001948806,0.0002657134,0.002357994],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6679157,"threshold_uncertainty_score":0.999858,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2137723287","doi":"10.1145/1735970.1736038","title":"SherLog","year":2010,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":217,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Computer science; Unavailability; Task (project management); Software bug; Code (set theory); Software; Server; Source code; Operating system; Software engineering; Programming language; Reliability engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.007245533686210765,"gpt":0.2351668028681178,"spread":0.2279212691819071,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005015893,0.0002998066,0.0003261306,0.000200592,0.0002387677,0.000247517,0.003931973,0.0001890716,0.00004164097],"category_scores_gemma":[0.0001653278,0.0002351303,0.0001947475,0.0005134995,0.0001452185,0.0003293391,0.001638131,0.001059426,0.0002701489],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002214705,"about_ca_system_score_gemma":0.0001397664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000909599,"about_ca_topic_score_gemma":0.0001580266,"domain_scores_codex":[0.9975002,0.0001253207,0.000392759,0.0008309656,0.0005136175,0.0006371315],"domain_scores_gemma":[0.9958341,0.0005077423,0.00009609397,0.003162466,0.0001198638,0.0002797332],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000009440121,0.00008153354,0.009858941,0.00004482418,0.00002714284,0.00002646009,0.001615781,0.0003418675,0.002933007,0.001600588,0.004504762,0.9789556],"study_design_scores_gemma":[0.003083474,0.001263125,0.1810016,0.0001282671,0.00003398449,0.001436008,0.00002073762,0.04735393,0.01070989,0.1312951,0.6210061,0.002667767],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2180847,0.00003536532,0.7708983,0.005121856,0.003537521,0.0003820767,0.000001760413,0.000792434,0.001145984],"genre_scores_gemma":[0.575192,0.000004504297,0.4215974,0.001783335,0.001275554,0.00003453909,0.000003983358,0.00002086551,0.00008787443],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9762879,"threshold_uncertainty_score":0.9588335,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2166263440","doi":"10.1145/2366231.2337207","title":"Staged memory scheduling","year":2012,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":199,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Army Research Office; National Science Foundation","keywords":"Computer science; Memory controller; Registered memory; Central processing unit; Embedded system; Uniform memory access; Scheduling (production processes); Parallel computing; Interleaved memory; Locality; Write buffer; Memory management; CPU cache; Operating system; Overlay; Cache; Cache algorithms; Semiconductor memory","retraction":null,"screen_n_in":null,"score":{"opus":0.01999806909825688,"gpt":0.2682172986647576,"spread":0.2482192295665007,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007328772,0.0003525864,0.0003372047,0.0003469274,0.0003151921,0.0002537298,0.002895025,0.0001281382,0.00002006023],"category_scores_gemma":[0.0001677245,0.0003140546,0.0001677187,0.0006158316,0.00007695468,0.000502979,0.002005442,0.0006299831,0.00008785133],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005670398,"about_ca_system_score_gemma":0.00008271448,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003083664,"about_ca_topic_score_gemma":0.000003808036,"domain_scores_codex":[0.9971962,0.0003567451,0.0004106973,0.0005947353,0.0005167413,0.0009248991],"domain_scores_gemma":[0.9970038,0.0005181803,0.0001488127,0.00183558,0.0001052378,0.0003884146],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000171469,0.000267962,0.003412175,0.00005436584,0.0000880876,0.00002232644,0.007391851,0.09108435,0.001056876,0.008397348,0.009951771,0.8782557],"study_design_scores_gemma":[0.003543876,0.001056401,0.01306931,0.0003750187,0.00006153281,0.0007526042,0.00008240956,0.7703688,0.03126473,0.04676678,0.1286609,0.003997619],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01473359,0.0003682884,0.9783688,0.002095379,0.0008675316,0.000305742,0.000001231651,0.00163217,0.001627311],"genre_scores_gemma":[0.2704934,0.0000140863,0.7264111,0.00205712,0.0008677538,0.0000175222,0.00000590065,0.0000249702,0.0001080843],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8742581,"threshold_uncertainty_score":0.9999312,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2513721464","doi":"10.1145/3007787.3001159","title":"Transparent offloading and mapping (TOM)","year":2016,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":196,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Computer science; Bottleneck; Programmer; Memory bandwidth; Bandwidth (computing); Computer architecture; Dram; Embedded system; Compiler; Parallel computing; Operating system; Computer hardware; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.02719656679893559,"gpt":0.2578622872750542,"spread":0.2306657204761186,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003151725,0.0002879113,0.0003012003,0.0003224398,0.0002115238,0.0001945247,0.001692109,0.00008630183,0.000008455498],"category_scores_gemma":[0.0000721631,0.0001974535,0.00009627811,0.0003528466,0.00009978795,0.00024543,0.0009969004,0.0002175686,0.00001571866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004099767,"about_ca_system_score_gemma":0.00004900581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001660436,"about_ca_topic_score_gemma":0.000007063594,"domain_scores_codex":[0.997853,0.0001858063,0.0003602957,0.0007529747,0.0003303608,0.0005175069],"domain_scores_gemma":[0.9979639,0.0005760607,0.0001022968,0.001065652,0.00006868035,0.0002233888],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006013939,0.00002838824,0.001212943,0.00002210663,0.00002910601,0.00001832777,0.001649548,0.001194869,0.002106472,0.002822089,0.001871723,0.9890384],"study_design_scores_gemma":[0.006832537,0.001807465,0.03736188,0.002238687,0.00004790144,0.001161123,0.00003558837,0.4010262,0.02538534,0.2546032,0.2652538,0.004246354],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009431448,0.00016378,0.9795781,0.008920156,0.0002628166,0.0002354749,0.000002055872,0.0009509792,0.000455165],"genre_scores_gemma":[0.3428813,0.00007602129,0.6556289,0.001070927,0.0002337429,0.00001527481,0.000001290822,0.00001789382,0.00007467566],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9847921,"threshold_uncertainty_score":0.8051922,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2158630919","doi":"10.1145/1150019.1136508","title":"Spatial Memory Streaming","year":2006,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":191,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cache; Parallel computing; Memory bandwidth; Exploit; Block size; Cache-only memory architecture; Interleaved memory; Uniform memory access; Block (permutation group theory); Registered memory; Shared memory; Flat memory model; Cache coloring; Computer architecture; CPU cache; Memory management; Semiconductor memory; Computer hardware; Operating system; Key (lock)","retraction":null,"screen_n_in":null,"score":{"opus":0.009048801510486407,"gpt":0.2347737888869235,"spread":0.2257249873764371,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002685491,0.0003457534,0.0003209725,0.0003393401,0.000273981,0.0003322175,0.002725888,0.0001177106,0.00001364025],"category_scores_gemma":[0.00005276345,0.0003145426,0.0001635658,0.0004868159,0.00008233725,0.0002087117,0.001539979,0.0004274418,0.00003895408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005301041,"about_ca_system_score_gemma":0.0000945975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008779778,"about_ca_topic_score_gemma":0.0001522918,"domain_scores_codex":[0.9974312,0.0002211609,0.0004431556,0.0007942739,0.0005030796,0.0006070917],"domain_scores_gemma":[0.9975845,0.0003920317,0.0001523564,0.001618819,0.0001104789,0.0001418379],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009100028,0.000124605,0.0008477282,0.00002089374,0.00002406181,0.00006396522,0.0005574495,0.09501469,0.0006085017,0.003832853,0.01623608,0.8826601],"study_design_scores_gemma":[0.001595095,0.0005878235,0.01619294,0.0001354265,0.00001947361,0.0002816588,0.000007292366,0.8276595,0.008393412,0.09772164,0.04595521,0.001450528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007557061,0.00009286451,0.983831,0.002133274,0.0004818119,0.0002841622,0.000002088043,0.00159202,0.00402569],"genre_scores_gemma":[0.3253672,0.000005013634,0.6725928,0.0008563413,0.0009307685,0.00001514694,0.0000155281,0.00002314035,0.0001940296],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8812096,"threshold_uncertainty_score":0.9999307,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4234833047","doi":"10.1145/2508148.2485964","title":"GPUWattch","year":2013,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":163,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Division of Computer and Network Systems; Division of Computing and Communication Foundations; Intel Corporation; Advanced Micro Devices; National Science Foundation","keywords":"Computer science; Frequency scaling; General-purpose computing on graphics processing units; Parallel computing; Energy consumption; Efficient energy use; Clock gating; Kernel (algebra); CUDA; Dynamic demand; Metric (unit); Embedded system; Performance metric; Power (physics); Graphics; Operating system; Clock skew; Clock signal","retraction":null,"screen_n_in":null,"score":{"opus":0.01219954443439917,"gpt":0.2427591527754178,"spread":0.2305596083410186,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002176271,0.0003274083,0.0003075406,0.0003033197,0.0002263306,0.000528986,0.003769579,0.0001153897,0.00006986628],"category_scores_gemma":[0.00008833882,0.0002755187,0.0001521256,0.0006095008,0.00007839478,0.0003972226,0.002029981,0.0004633547,0.0004148966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003793145,"about_ca_system_score_gemma":0.0000737835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000162015,"about_ca_topic_score_gemma":0.000007840265,"domain_scores_codex":[0.9975408,0.0002144234,0.0003923875,0.0007622483,0.0004493738,0.0006408024],"domain_scores_gemma":[0.9970104,0.0004024611,0.0001151877,0.002023811,0.0001808289,0.000267386],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002628681,0.00008537029,0.0007654991,0.00001790429,0.00003509388,0.00001527936,0.001180043,0.01435213,0.0004734134,0.005091023,0.08019718,0.8977844],"study_design_scores_gemma":[0.00109852,0.0006591788,0.00957538,0.0001041952,0.00001072851,0.0002651345,0.000009665603,0.668065,0.003903684,0.2053429,0.1095926,0.001373095],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004797537,0.00007601253,0.9800016,0.009510363,0.0004126419,0.0004785544,7.02011e-7,0.001692268,0.003030294],"genre_scores_gemma":[0.1176004,0.00001520714,0.877271,0.0042983,0.0004180841,0.00006510149,0.00000638635,0.00002528742,0.0003002731],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8964114,"threshold_uncertainty_score":0.9999697,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2122900653","doi":"10.1145/2678373.2665691","title":"SynFull","year":2014,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Speedup; Pace; Cache coherence; Workload; Power consumption; Cache; Computer architecture; Distributed computing; Power (physics); Cache algorithms; CPU cache; Computer network; Parallel computing","retraction":null,"screen_n_in":null,"score":{"opus":0.009785753314016484,"gpt":0.2220381049594068,"spread":0.2122523516453904,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005418555,0.0002892123,0.0003437479,0.0002199147,0.0002151914,0.0003613306,0.002858493,0.0001124279,0.00002667648],"category_scores_gemma":[0.0001064985,0.0002334195,0.0001947528,0.0004063088,0.0000549559,0.0002024224,0.001174356,0.0004515851,0.0002286505],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003587406,"about_ca_system_score_gemma":0.00003766187,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007516168,"about_ca_topic_score_gemma":0.00008264159,"domain_scores_codex":[0.9974427,0.0004107872,0.0003975086,0.0007327005,0.0004290916,0.000587244],"domain_scores_gemma":[0.9968795,0.0006701979,0.0001116859,0.002001161,0.0001036316,0.0002338778],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001129372,0.00005359498,0.0004474024,0.00002875034,0.00004725794,0.00001802972,0.001560175,0.009606202,0.0003195603,0.05118424,0.03040613,0.9063174],"study_design_scores_gemma":[0.0006773852,0.0005619695,0.001176089,0.00008407539,0.000006357909,0.000324815,0.000006520212,0.3678637,0.0003543902,0.04278063,0.5855785,0.0005856013],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006049002,0.00004413234,0.9802547,0.0048078,0.002425474,0.000232407,7.40164e-7,0.000498126,0.00568766],"genre_scores_gemma":[0.7563043,0.000004110832,0.2351459,0.005349121,0.002748024,0.00003034499,0.000004109389,0.00002880578,0.000385366],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9057318,"threshold_uncertainty_score":0.9518572,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2038724983","doi":"10.1145/373574.373578","title":"Multiprocessor enhancements of the SimpleScalar tool set","year":2001,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Uniprocessor system; Computer science; Multiprocessing; Parallel computing; Thread (computing); Suite; Symmetric multiprocessor system; Cache; MESI protocol; Operating system; CPU cache; Cache coloring","retraction":null,"screen_n_in":null,"score":{"opus":0.01854417103500763,"gpt":0.2712269902411761,"spread":0.2526828192061685,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003170606,0.0002747967,0.0003057653,0.0001577489,0.0002239824,0.0001088069,0.004120335,0.00009225922,0.00001278741],"category_scores_gemma":[0.0001648943,0.0001920666,0.0001814269,0.0008365134,0.0001096955,0.0001669388,0.002198116,0.0003585691,0.00001135275],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000318273,"about_ca_system_score_gemma":0.00009552696,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000402699,"about_ca_topic_score_gemma":0.00001650312,"domain_scores_codex":[0.9976617,0.0002370048,0.0004862395,0.0005775466,0.0005728353,0.0004646506],"domain_scores_gemma":[0.9972507,0.0003394782,0.0002375066,0.001908721,0.0001706181,0.00009301178],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004108698,0.0002660615,0.01296999,0.00008679906,0.0001008305,0.0000207168,0.004091645,0.08265956,0.002903376,0.002058595,0.0111604,0.8836409],"study_design_scores_gemma":[0.002851837,0.000835492,0.0281889,0.0004580749,0.00003954492,0.0002893054,0.00001986774,0.7148607,0.05408882,0.05298869,0.1438471,0.001531714],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05186508,0.00006252346,0.9441854,0.002397029,0.0003122851,0.0004139003,0.000003503912,0.0003573691,0.0004028798],"genre_scores_gemma":[0.5248951,0.00003154292,0.4729848,0.001729489,0.000181485,0.00002124769,0.000004562836,0.0000173127,0.0001344662],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8821092,"threshold_uncertainty_score":0.7832249,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098666492","doi":"10.1145/545214.545244","title":"Experiences with VI communication for database storage","year":2002,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Implementation; Exploit; Database; Kernel (algebra); Software deployment; Operating system; Linux kernel; Distributed computing; Embedded system; Software engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02720468784387153,"gpt":0.2631199432918902,"spread":0.2359152554480187,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0002040456,0.0003425991,0.0003142325,0.0002628404,0.0003925612,0.0002448143,0.006149531,0.0000875558,0.00002111472],"category_scores_gemma":[0.000211661,0.0002656215,0.00007503011,0.0006086989,0.0003512239,0.0008956022,0.00274414,0.000441263,0.00002356173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005863605,"about_ca_system_score_gemma":0.00003026453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002221868,"about_ca_topic_score_gemma":0.00008870973,"domain_scores_codex":[0.9976904,0.0001233888,0.0003057084,0.000863736,0.0004341522,0.0005825908],"domain_scores_gemma":[0.9939864,0.0009063891,0.0001710078,0.004691896,0.0001080074,0.0001363058],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004836375,0.000214558,0.00009307529,0.00005931298,0.00005887663,0.00005757789,0.02471785,0.003066414,0.0009282482,0.00938558,0.01763029,0.9437398],"study_design_scores_gemma":[0.005858546,0.004390411,0.0003377612,0.000485864,0.00005777254,0.0008083544,0.003034999,0.5929214,0.01385943,0.05687588,0.3176985,0.003671075],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01784961,0.0005455558,0.9746678,0.00481347,0.0001764021,0.0007235789,0.00002518915,0.001042222,0.0001561966],"genre_scores_gemma":[0.2338038,0.00003720298,0.7648203,0.0007952903,0.0001067597,0.0003310842,0.00003798554,0.00002354654,0.00004403319],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9400688,"threshold_uncertainty_score":0.9999796,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126584218","doi":"10.1145/2678373.2665719","title":"SleepScale","year":2014,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"National Science Foundation","keywords":"Computer science; Power management; Workload; Exploit; Data center; Server; Power (physics); Variety (cybernetics); Power budget; Quality of service; Task (project management); Frequency scaling; Distributed computing; Reliability engineering; Real-time computing; Power control; Operating system; Computer network; Engineering; Computer security; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.00845375235718684,"gpt":0.2191184189686967,"spread":0.2106646666115098,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000530978,0.0003372272,0.0003433672,0.0002663042,0.0002869755,0.0003107825,0.004170143,0.00008509991,0.00001170971],"category_scores_gemma":[0.0001067924,0.0002765064,0.0002050722,0.0005398394,0.00008600191,0.0000311008,0.003632453,0.0004617137,0.0001954655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003551969,"about_ca_system_score_gemma":0.00002644299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004732365,"about_ca_topic_score_gemma":0.00001656451,"domain_scores_codex":[0.9971032,0.0003249284,0.0003561679,0.0009079085,0.0005907061,0.0007170589],"domain_scores_gemma":[0.9963386,0.0006325211,0.0001062349,0.002587689,0.00006055553,0.0002743663],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004905925,0.00006812353,0.00045717,0.00002215228,0.00003734682,0.00001550128,0.001045031,0.02017429,0.0000871771,0.00955058,0.008524694,0.960013],"study_design_scores_gemma":[0.0008235121,0.0004258986,0.003681969,0.00005716957,0.00001171779,0.00008264963,0.000006187206,0.5179278,0.0002907504,0.03321275,0.4428562,0.0006234171],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04454096,0.00004440106,0.9372787,0.01012953,0.0009144769,0.000238452,5.573675e-7,0.0008017178,0.006051246],"genre_scores_gemma":[0.5350736,0.000001876776,0.4567778,0.005948391,0.001587377,0.0000168193,0.000002826888,0.00003141421,0.0005599078],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9593896,"threshold_uncertainty_score":0.9999687,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2099336824","doi":"10.1145/1028176.1006715","title":"Power Awareness through Selective Dynamically Optimized Traces","year":2004,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Canadian Institute of Steel Construction","keywords":"Computer science; Microarchitecture; Power (physics); Performance improvement; Key (lock); Energy (signal processing); Power budget; Constraint (computer-aided design); Resource (disambiguation); Path (computing); Real-time computing; Embedded system; Distributed computing; Operating system; Power control; Computer network; Operations management; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01216643267776838,"gpt":0.2717958289966569,"spread":0.2596293963188885,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003228078,0.0005329126,0.0005768419,0.0002907521,0.0004211146,0.0004271246,0.003857689,0.0002109495,0.00001250975],"category_scores_gemma":[0.0001485573,0.0004633352,0.0002676012,0.001029643,0.0001647457,0.0005127068,0.001537518,0.0007405799,0.00003591022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001609812,"about_ca_system_score_gemma":0.0003767767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001567673,"about_ca_topic_score_gemma":0.0000294368,"domain_scores_codex":[0.9964282,0.000307623,0.0005712112,0.001211696,0.0006530648,0.0008282314],"domain_scores_gemma":[0.9970145,0.0004950305,0.0002139974,0.001775207,0.0002725425,0.0002287623],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006768106,0.0003447818,0.0001827795,0.0000260118,0.0001315478,0.0000896542,0.008004428,0.9232807,0.0003949462,0.01498434,0.00218237,0.05031075],"study_design_scores_gemma":[0.00839819,0.002666816,0.003767194,0.0004512059,0.00004959479,0.0008214979,0.00004738277,0.3641308,0.01464178,0.583966,0.01779985,0.003259756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008816339,0.0001264629,0.9798803,0.006129129,0.0005056305,0.0005506732,0.000004114454,0.001952588,0.002034701],"genre_scores_gemma":[0.2364753,0.00002635871,0.7610605,0.002132814,0.0001776142,0.00003942262,0.00001152945,0.00003611584,0.00004031898],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5689816,"threshold_uncertainty_score":0.9997818,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136362035","doi":"10.1145/2366231.2337214","title":"Revisiting hardware-assisted page walks for virtualized systems","year":2012,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kootenay Association for Science & Technology","funders":"National Research Foundation of Korea","keywords":"Paging; Demand paging; Computer science; Page fault; Page; Translation lookaside buffer; Virtual memory; Cache; Operating system; Parallel computing; Computer graphics (images); Physical address; Memory management; Semiconductor memory","retraction":null,"screen_n_in":null,"score":{"opus":0.03030701190613608,"gpt":0.2870492056538025,"spread":0.2567421937476664,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001193261,0.0004505643,0.0006019423,0.0003527913,0.0004434062,0.0005192834,0.00268926,0.0001781395,0.000005401924],"category_scores_gemma":[0.0003585014,0.000395773,0.0002926303,0.0005678406,0.00006232665,0.0004239187,0.001362252,0.0004265432,0.00002484377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008944936,"about_ca_system_score_gemma":0.00008061579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004343775,"about_ca_topic_score_gemma":0.000001691247,"domain_scores_codex":[0.9964237,0.00051034,0.0007050945,0.0007765859,0.0005179166,0.001066317],"domain_scores_gemma":[0.9958779,0.001354446,0.000319621,0.001831051,0.0002325242,0.0003844106],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006239472,0.0002183514,0.001067216,0.0003600678,0.0001942865,0.00001754334,0.004527188,0.02208264,0.001941884,0.02669063,0.02467915,0.9181587],"study_design_scores_gemma":[0.002459286,0.0005143998,0.002411751,0.0005621887,0.0000570925,0.0004684438,0.00003369899,0.6384912,0.001469768,0.004926573,0.3469498,0.001655837],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001721303,0.0007452776,0.9911865,0.001682622,0.00128325,0.001007263,0.00000960482,0.001651677,0.0007124773],"genre_scores_gemma":[0.1638786,0.00002208447,0.8324654,0.001327547,0.001865173,0.000151171,0.00003620211,0.00005093818,0.0002028965],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9165028,"threshold_uncertainty_score":0.9998494,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1987683357","doi":"10.1145/2669594.2669599","title":"BadgerTrap","year":2014,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Advanced Micro Devices (Canada)","funders":"National Science Foundation","keywords":"Translation lookaside buffer; Computer science; x86; TRACE (psycholinguistics); Instrumentation (computer programming); Computer architecture; Operating system; Physical address; Software","retraction":null,"screen_n_in":null,"score":{"opus":0.01164685640406961,"gpt":0.2461383071206598,"spread":0.2344914507165902,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004730195,0.0003136816,0.0003216856,0.0003075679,0.0002346319,0.0003082806,0.00353054,0.0001110754,0.00001269133],"category_scores_gemma":[0.0001606304,0.0002721503,0.0001613627,0.0005503825,0.00007699434,0.0001976675,0.001497038,0.0004321945,0.00008355309],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002404345,"about_ca_system_score_gemma":0.00005662167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002677327,"about_ca_topic_score_gemma":0.00000870154,"domain_scores_codex":[0.9975057,0.000343428,0.0003643325,0.0007741713,0.0004402722,0.0005721125],"domain_scores_gemma":[0.9968458,0.0006142037,0.0001160398,0.002078191,0.0001081235,0.0002376679],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005915469,0.00006552106,0.0003959157,0.00001767505,0.00002448649,0.000008968606,0.0007262579,0.02514778,0.0002239479,0.02307514,0.0190277,0.9312807],"study_design_scores_gemma":[0.0007090213,0.0005304807,0.001948579,0.00006103255,0.000007330404,0.0001248625,0.000001473945,0.6645515,0.00207631,0.1066383,0.2226423,0.000708862],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001381283,0.00004787886,0.986119,0.004994854,0.0004991878,0.0002158832,6.540319e-7,0.001710947,0.005030331],"genre_scores_gemma":[0.1178577,0.0000105402,0.8765405,0.004747283,0.0006052017,0.00001737119,0.000006146636,0.00002462374,0.0001906256],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9305719,"threshold_uncertainty_score":0.9999731,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3006036681","doi":"10.1145/2189750.2150989","title":"Cosmic rays don't strike twice","year":2012,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Radiation Effects in Electronics","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Dram; Computer science; Set (abstract data type); Terabyte; Memory errors; Field (mathematics); Soft error; Reliability engineering; Computer hardware; Engineering; Operating system; Electronic engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.007157630022584263,"gpt":0.2184098578371754,"spread":0.2112522278145911,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002915272,0.0003658404,0.0003116776,0.0002348266,0.00009989857,0.00006575462,0.0008486759,0.0001453538,0.00007393282],"category_scores_gemma":[0.00008030346,0.0003495462,0.000131959,0.0003849516,0.00005524651,0.0001888881,0.0002116745,0.0008294443,0.0001685519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001919911,"about_ca_system_score_gemma":0.0000396014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002177615,"about_ca_topic_score_gemma":0.00003107155,"domain_scores_codex":[0.9978384,0.0001437478,0.0003070414,0.0002881737,0.0003703173,0.001052321],"domain_scores_gemma":[0.9979135,0.0007042537,0.00004615747,0.0009958175,0.00003247867,0.0003078196],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001869218,0.00005241983,0.001022972,0.00008524475,0.0001321566,0.000005608055,0.001593104,0.5887985,0.002739528,0.0003762637,0.02364972,0.3815258],"study_design_scores_gemma":[0.001798196,0.0004538416,0.01045876,0.00007439015,0.0000806523,0.0002382451,0.00001969059,0.3010457,0.007324587,0.004585553,0.6724414,0.00147904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4161599,0.002044066,0.573287,0.000581827,0.002622057,0.0006765699,0.00001448553,0.001417091,0.003197073],"genre_scores_gemma":[0.9524033,0.0000451297,0.04405808,0.0008601458,0.002399771,0.00004395057,0.00003184571,0.0001111554,0.00004663252],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6487917,"threshold_uncertainty_score":0.9998956,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3013744194","doi":"10.1145/384285.379250","title":"Tolerating memory latency through software-controlled pre-execution in simultaneous multithreading processors","year":2001,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"PQ Corporation (Canada)","funders":"","keywords":"Computer science; Multithreading; Instruction prefetch; Thread (computing); Speedup; Speculative multithreading; Parallel computing; Simultaneous multithreading; Software; Instruction set; Speculative execution; Latency (audio); Operating system; Cache","retraction":null,"screen_n_in":null,"score":{"opus":0.01372969541358384,"gpt":0.27089923931859,"spread":0.2571695439050062,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005720462,0.000506227,0.000716254,0.0004282659,0.0003407458,0.0003656761,0.002340646,0.0002033735,0.000009177903],"category_scores_gemma":[0.001098361,0.000447774,0.0001917449,0.001086124,0.00008078883,0.0005482804,0.001005381,0.0007523892,0.00001619641],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000128992,"about_ca_system_score_gemma":0.0001450931,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003185479,"about_ca_topic_score_gemma":0.0001784839,"domain_scores_codex":[0.9961668,0.0004037034,0.0008747137,0.001103125,0.0005812391,0.0008704335],"domain_scores_gemma":[0.9960865,0.001999133,0.0003082832,0.001248525,0.0001985935,0.0001589862],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000104748,0.0001391569,0.001455284,0.00003228931,0.00002795706,0.0001426703,0.006707471,0.7526243,0.0001491567,0.000223565,0.0001701807,0.2382232],"study_design_scores_gemma":[0.003004082,0.0002997967,0.0004985302,0.0002186625,0.000009587455,0.0001356167,0.00001375467,0.9808317,0.0005231482,0.01300427,0.0008961536,0.0005646361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05399445,0.000256248,0.9410335,0.001156714,0.0003444935,0.001092556,0.000001008354,0.001482343,0.0006387169],"genre_scores_gemma":[0.3930422,0.00004822202,0.605487,0.0009163774,0.0002577971,0.00007195518,0.000008324711,0.00002936195,0.0001387415],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3390477,"threshold_uncertainty_score":0.9997974,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4251628355","doi":"10.1145/2024723.2000113","title":"DBAR","year":2011,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Workload; Distributed computing; Computer network; Network congestion; Overhead (engineering); Routing (electronic design automation)","retraction":null,"screen_n_in":null,"score":{"opus":0.03189074900865286,"gpt":0.2279724631603166,"spread":0.1960817141516637,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003235087,0.0002835038,0.0003020182,0.0002302496,0.0001856555,0.0001729467,0.003023022,0.000110725,0.00008948595],"category_scores_gemma":[0.00003798867,0.0002283942,0.0001972743,0.0004253531,0.00006322059,0.0002564418,0.001240257,0.000431134,0.00024303],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003334809,"about_ca_system_score_gemma":0.00005291136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001983018,"about_ca_topic_score_gemma":0.0000999777,"domain_scores_codex":[0.9977329,0.0002415716,0.0003970682,0.0006914769,0.0003585132,0.000578464],"domain_scores_gemma":[0.9974759,0.000213723,0.0001075004,0.001870284,0.0001026303,0.0002299458],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003738194,0.000172646,0.001779149,0.00003694619,0.0001273684,0.000171903,0.01687866,0.001055743,0.0003562025,0.06465228,0.03410665,0.8806251],"study_design_scores_gemma":[0.002694441,0.002583508,0.01658686,0.0003026144,0.00003476067,0.001954332,0.00009961733,0.1752263,0.004365617,0.2246228,0.5687951,0.002734022],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007388858,0.0000755486,0.976298,0.0009937754,0.002338388,0.000270341,0.000001071733,0.0004832683,0.01215076],"genre_scores_gemma":[0.6157374,0.000007115342,0.379685,0.00286814,0.001284115,0.00003327954,0.000002501572,0.00002739686,0.0003550894],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8778911,"threshold_uncertainty_score":0.9313647,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4242746803","doi":"10.1145/1555815.1555810","title":"Achieving predictable performance through better memory controller placement in many-core CMPs","year":2009,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Memory controller; Computer science; Thread (computing); Chip; Memory refresh; Interconnection; Registered memory; Embedded system; Parallel computing; Distributed computing; Computer hardware; Semiconductor memory; Computer memory; Computer network; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.0172826486379525,"gpt":0.2416084760010145,"spread":0.224325827363062,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006534568,0.0004545938,0.0005990807,0.0002914311,0.0002569197,0.0003082005,0.002267887,0.0001633481,0.00003156472],"category_scores_gemma":[0.00003560103,0.0003731776,0.0001879871,0.0005541625,0.00005359592,0.0005991338,0.0007130195,0.0008558435,0.00003845691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001389154,"about_ca_system_score_gemma":0.00006522365,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007430556,"about_ca_topic_score_gemma":0.00005743803,"domain_scores_codex":[0.9964104,0.0002547902,0.000758192,0.0009474884,0.0006286961,0.001000447],"domain_scores_gemma":[0.9978628,0.0003454997,0.0001859825,0.001360586,0.00008656788,0.0001586141],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002675861,0.0003583235,0.007688814,0.0001162388,0.0001305409,0.0001390421,0.01664703,0.2228228,0.00164226,0.003736414,0.0281512,0.7182998],"study_design_scores_gemma":[0.005670644,0.002206174,0.02948669,0.0007590313,0.00002037802,0.0003744314,0.00008491092,0.8756837,0.0006386436,0.007050355,0.07668118,0.001343805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.253287,0.0001859996,0.7353812,0.005226474,0.001157224,0.0007627017,0.000001711921,0.0002670973,0.003730504],"genre_scores_gemma":[0.9083921,0.00003345039,0.07891524,0.01074886,0.001450478,0.00005931541,0.000006960031,0.00002491774,0.0003686991],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.716956,"threshold_uncertainty_score":0.999872,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4244995015","doi":"10.1145/2508148.2485949","title":"A hardware evaluation of cache partitioning to improve utilization and energy-efficiency while preserving responsiveness","year":2013,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Samsung; Nokia; University of California; Oracle; Agència de Gestió d'Ajuts Universitaris i de Recerca; Ministerio de Economía y Competitividad; Mountain Equipment Co-operative; Microsoft; Nvidia; Intel Corporation","keywords":"Computer science; Cache; Partition (number theory); Parallel computing; Throughput; Scheduling (production processes); Efficient energy use; x86; Multi-core processor; Energy consumption; Slowdown; Cache algorithms; CPU cache; Overhead (engineering); Embedded system; Operating system; Software","retraction":null,"screen_n_in":null,"score":{"opus":0.04075432672795978,"gpt":0.292253437584214,"spread":0.2514991108562543,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000901307,0.0002241005,0.0002612512,0.0003840852,0.0002156736,0.0002591362,0.001275417,0.0000875558,0.00002013719],"category_scores_gemma":[0.0004985472,0.0002073289,0.00006134509,0.0007084706,0.00005383936,0.0003704593,0.001595837,0.0001618125,0.000004403246],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005309108,"about_ca_system_score_gemma":0.0001630727,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002910928,"about_ca_topic_score_gemma":0.00003692192,"domain_scores_codex":[0.9972443,0.0006231203,0.0004234831,0.0006676714,0.0006890441,0.0003523808],"domain_scores_gemma":[0.9973084,0.0004315882,0.0001813996,0.001065647,0.000841436,0.0001715601],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001328716,0.00007189366,0.0006609836,0.00004365228,0.0000231174,0.000001203067,0.003232781,0.1762191,0.003464142,0.001739208,0.002013312,0.8125173],"study_design_scores_gemma":[0.0003819249,0.0002980354,0.006495708,0.0001285945,0.00001387766,0.0000116272,0.00001693264,0.9710869,0.007662572,0.01169237,0.001956717,0.0002547879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05752601,0.0001981393,0.939357,0.001543256,0.0001755047,0.000518947,0.000002600484,0.0002709421,0.0004076015],"genre_scores_gemma":[0.6363105,0.00001207738,0.3628374,0.0005187619,0.0001014799,0.0001472676,0.00001117491,0.00001559159,0.00004583786],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8122625,"threshold_uncertainty_score":0.8454626,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136674263","doi":"10.1145/1150019.1136504","title":"Tolerating Dependences Between Large Speculative Threads Via Sub-Threads","year":2006,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Speculative multithreading; Thread (computing); Computer science; Parallel computing; Speculative execution; Speculation; Speedup; Multiprocessing; Multithreading; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01087964460187838,"gpt":0.2432773610961072,"spread":0.2323977164942288,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006567126,0.0006018156,0.000744503,0.0002752546,0.0005186918,0.0006520985,0.003209556,0.000215633,0.00001552338],"category_scores_gemma":[0.00005132736,0.0005105813,0.0002892169,0.001006429,0.0001220193,0.0005437946,0.001505785,0.0007546092,0.0001007659],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000909489,"about_ca_system_score_gemma":0.0001245991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005978642,"about_ca_topic_score_gemma":0.0008160255,"domain_scores_codex":[0.9951726,0.0003643091,0.0008570745,0.001301743,0.001085675,0.001218577],"domain_scores_gemma":[0.9966958,0.0006707116,0.0003177941,0.001819126,0.0002146763,0.000281961],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00002925665,0.0003567779,0.08710197,0.0001234671,0.0002207884,0.0003486772,0.003638845,0.008422929,0.00336869,0.03188073,0.008539456,0.8559684],"study_design_scores_gemma":[0.005925606,0.001558598,0.383555,0.000824931,0.0001118901,0.0007079392,0.00009064218,0.2054269,0.01744401,0.2939994,0.08529277,0.005062273],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1134145,0.000272725,0.8813927,0.001660982,0.0006201771,0.0005120241,0.00004994051,0.0004594748,0.001617589],"genre_scores_gemma":[0.8465108,0.00000331169,0.150725,0.0004726754,0.002045878,0.00003625949,0.00008892531,0.00003397321,0.00008314968],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8509061,"threshold_uncertainty_score":0.9997346,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2143700077","doi":"10.1145/2678373.2665701","title":"Fine-grain task aggregation and coordination on GPUs","year":2014,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Parallel computing; Programmer; Thread (computing); Compiler; General-purpose computing on graphics processing units; Runtime system; Programming language; Graphics; Computer graphics (images)","retraction":null,"screen_n_in":null,"score":{"opus":0.009286951154045936,"gpt":0.24089021954084,"spread":0.2316032683867941,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004979116,0.0002745824,0.0002542929,0.0003574102,0.0002484181,0.0002896248,0.001197063,0.0001061859,0.000002755103],"category_scores_gemma":[0.000287759,0.0002428209,0.00007321851,0.0004192881,0.00007242971,0.0001763896,0.0006841417,0.0003420909,0.00001899012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003469676,"about_ca_system_score_gemma":0.00003223389,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002900084,"about_ca_topic_score_gemma":0.00002223509,"domain_scores_codex":[0.9979072,0.0003563794,0.0003020506,0.0006965147,0.000381195,0.0003566998],"domain_scores_gemma":[0.9978995,0.0006462862,0.0001450435,0.00104565,0.0001087354,0.000154792],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000097211,0.00004279668,0.0003099872,0.00001535498,0.00001230068,0.000003391186,0.0007098765,0.01508732,0.000200654,0.01389992,0.008976051,0.9607326],"study_design_scores_gemma":[0.0009098621,0.000885752,0.003208246,0.0001165259,0.000007276633,0.00006164316,0.000001707151,0.8586551,0.002637355,0.08113787,0.05187677,0.000501912],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009805561,0.00004060915,0.9795098,0.008156505,0.0003258878,0.0002924577,0.000001335348,0.0007563917,0.001111448],"genre_scores_gemma":[0.4721338,0.000007413708,0.5252856,0.002019489,0.000352526,0.00001966608,0.00001503483,0.00001874998,0.0001477273],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9602307,"threshold_uncertainty_score":0.9901947,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149324048","doi":"10.1145/2366231.2337174","title":"Inspection resistant memory","year":2012,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Physical Unclonable Functions (PUFs) and Hardware Security","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"National Science Foundation","keywords":"Computer science; Adversary; Probabilistic logic; Cryptography; Chip; Class (philosophy); Value (mathematics); Computer security; Scheme (mathematics); Computer engineering; Embedded system; Computer hardware; Theoretical computer science; Artificial intelligence; Telecommunications; Machine learning; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0142584763377409,"gpt":0.2369214523500651,"spread":0.2226629760123243,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003975379,0.0003578989,0.0003500409,0.000303919,0.0004663278,0.0002159402,0.001967694,0.0001171825,0.00003168267],"category_scores_gemma":[0.0001204024,0.0003053606,0.0002358241,0.000876288,0.0001183582,0.0007735972,0.00157914,0.000710325,0.0002525839],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001282197,"about_ca_system_score_gemma":0.0001028083,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001627691,"about_ca_topic_score_gemma":0.00008533569,"domain_scores_codex":[0.9970967,0.0002831156,0.0003598278,0.0006813906,0.0006410062,0.0009379484],"domain_scores_gemma":[0.9969071,0.0004275522,0.0001115675,0.001965083,0.0001189937,0.0004697707],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001503514,0.001153962,0.00160831,0.0001087675,0.0001925511,0.00004924983,0.0100387,0.001540733,0.007726316,0.09095396,0.05317976,0.8332974],"study_design_scores_gemma":[0.002388049,0.001431431,0.05933685,0.0001426824,0.00007419759,0.0003519943,0.00007754366,0.0200489,0.00871776,0.1473068,0.7578248,0.002298929],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03670375,0.000275057,0.949468,0.003813159,0.002507373,0.0003750483,0.000006630278,0.001165854,0.005685167],"genre_scores_gemma":[0.8385335,0.00001498103,0.1553802,0.002256818,0.003536685,0.00004517849,0.00001512585,0.00003239068,0.0001851884],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8309984,"threshold_uncertainty_score":0.9999399,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2517678212","doi":"10.1145/3007787.3001195","title":"The anytime automaton","year":2016,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Automaton; Pipeline (software); Computation; Theoretical computer science; Simple (philosophy); Distributed computing; Cellular automaton; State (computer science); Algorithm; Computer engineering; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01008672909762124,"gpt":0.2448873781263465,"spread":0.2348006490287253,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005067427,0.0002822516,0.0002253258,0.0001548673,0.0005310405,0.0003719827,0.004442761,0.00008959561,0.000008054586],"category_scores_gemma":[0.0002015556,0.0001424738,0.0001502088,0.0004331117,0.0001627571,0.0002174083,0.001979987,0.0002494578,0.000112343],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005218971,"about_ca_system_score_gemma":0.0001049676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001560449,"about_ca_topic_score_gemma":0.00001220847,"domain_scores_codex":[0.9975671,0.0003079104,0.0003739932,0.0006440834,0.0004670823,0.0006398209],"domain_scores_gemma":[0.9957135,0.00157189,0.0001384173,0.002271226,0.000119417,0.0001855144],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000007076049,0.0000233535,0.0002257724,0.000003659394,0.00002418203,0.00001144861,0.0003139858,0.0008581317,0.0003985916,0.01077228,0.0267162,0.9606453],"study_design_scores_gemma":[0.001437712,0.0006313636,0.004586853,0.0001964148,0.00001081965,0.0002990783,0.000003695445,0.1706287,0.00754812,0.1832298,0.6303939,0.001033545],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001593173,0.000132101,0.9684486,0.02621641,0.0005053965,0.0002640614,0.000001375084,0.001712728,0.001126197],"genre_scores_gemma":[0.1132658,0.0001033093,0.8827731,0.002372088,0.0005788373,0.00004223354,0.000001655164,0.00003405405,0.0008288813],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9596118,"threshold_uncertainty_score":0.8255829,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4247380146","doi":"10.1145/2490301.2451157","title":"Traffic management","year":2013,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Locality; Operating system; Linux kernel; Page fault; Embedded system; Virtual memory; Memory management; Computer network; Semiconductor memory","retraction":null,"screen_n_in":null,"score":{"opus":0.01037751646823844,"gpt":0.2347106971437542,"spread":0.2243331806755158,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000194946,0.0003140027,0.0002673777,0.0003565858,0.0002052371,0.0004637282,0.003468249,0.00008473461,0.0000457034],"category_scores_gemma":[0.00002078554,0.000269633,0.0001441093,0.0006000623,0.0000632095,0.0002910435,0.001857893,0.0003444607,0.0003127845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003970191,"about_ca_system_score_gemma":0.00002960575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002933784,"about_ca_topic_score_gemma":0.000004102702,"domain_scores_codex":[0.9976652,0.0001730649,0.0003680382,0.0007540875,0.0004424316,0.000597188],"domain_scores_gemma":[0.997535,0.0002132143,0.000098209,0.001830872,0.00009938721,0.0002233117],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001813985,0.0000650752,0.00005391909,0.0000213104,0.00003699067,0.00001912297,0.0005948219,0.05826762,0.00002979593,0.003608411,0.03546611,0.901835],"study_design_scores_gemma":[0.001068937,0.0004419362,0.004757581,0.0001104826,0.00001453567,0.0001490503,0.0000135975,0.8489189,0.0004937728,0.05787111,0.08512206,0.001038069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006386023,0.00006993524,0.9813314,0.005309571,0.0003647507,0.0006411961,4.978255e-7,0.001714451,0.004182179],"genre_scores_gemma":[0.1151915,0.00002740871,0.8811275,0.002910859,0.0002443925,0.00008752412,0.000005868726,0.00002290724,0.0003819876],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9007969,"threshold_uncertainty_score":0.9999756,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2072076019","doi":"10.1145/1294313.1294319","title":"Custom code generation for soft processors","year":2007,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Compiler; Field-programmable gate array; Suite; Embedded system; Computer architecture; Personalization; Code (set theory); Software; Parallel computing; Operating system; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02767314201053588,"gpt":0.2944678403683487,"spread":0.2667946983578128,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009167449,0.0003148191,0.0002932818,0.0003621234,0.0003540592,0.0002864856,0.002253778,0.0001469438,0.000003294878],"category_scores_gemma":[0.0002080502,0.0002838784,0.0001542046,0.000546819,0.00006416329,0.0002424026,0.0006834716,0.0003137676,0.00001218142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006099592,"about_ca_system_score_gemma":0.0001235874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001571397,"about_ca_topic_score_gemma":0.00007244557,"domain_scores_codex":[0.9974901,0.00009169841,0.0004911034,0.0008321755,0.0004187759,0.0006761451],"domain_scores_gemma":[0.9975451,0.0006054151,0.0001802736,0.001177965,0.0002812271,0.0002099757],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003401348,0.0001162962,0.0002759513,0.00005392341,0.00004033137,0.00001280609,0.002391594,0.07709023,0.002170807,0.005425131,0.02583745,0.8865514],"study_design_scores_gemma":[0.0008326042,0.0004579422,0.0003577395,0.00004175485,0.00001084468,0.00006760695,0.000004917984,0.884877,0.01368931,0.0197735,0.07930667,0.0005800613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003870666,0.00009309434,0.9905469,0.002664787,0.0005499628,0.0007207269,0.000004294579,0.001186766,0.000362848],"genre_scores_gemma":[0.1118576,0.000007720822,0.8842248,0.002507824,0.001143896,0.00004596837,0.00003095159,0.00003119725,0.0001499942],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8859714,"threshold_uncertainty_score":0.9999613,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3086779066","doi":"10.1145/2872887.2750403","title":"Quantitative comparison of hardware transactional memory for Blue Gene/Q, zEnterprise EC12, Intel Core, and POWER8","year":2015,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"IBM (Canada)","funders":"","keywords":"Transactional memory; Computer science; IBM; Software transactional memory; Scalability; Operating system; Overhead (engineering); Software; Multi-core processor; Computer architecture; Parallel computing; Embedded system; Programming language; Database transaction","retraction":null,"screen_n_in":null,"score":{"opus":0.06110665492036652,"gpt":0.3273915985601816,"spread":0.266284943639815,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004149775,0.0003352618,0.0006489287,0.0002069228,0.0001241544,0.0001322941,0.001474593,0.0001193605,0.00000375737],"category_scores_gemma":[0.0001324692,0.0002919968,0.0001883892,0.0003062788,0.0001771825,0.0002496992,0.000405786,0.0003364346,0.000006201181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004973375,"about_ca_system_score_gemma":0.000173863,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009383082,"about_ca_topic_score_gemma":0.00008112747,"domain_scores_codex":[0.997517,0.0001501155,0.0006404959,0.0007136703,0.0005450373,0.0004336271],"domain_scores_gemma":[0.9974883,0.0006840121,0.0002588051,0.0008724855,0.0004111229,0.0002852486],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001296095,0.0009922548,0.004086256,0.0005389467,0.000583941,0.00004728809,0.05871559,0.05680345,0.004711729,0.01104294,0.04996613,0.8112154],"study_design_scores_gemma":[0.007550819,0.004903649,0.003599621,0.0004968942,0.00007743531,0.0003070883,0.0008946616,0.8581201,0.009186383,0.01815473,0.09521262,0.001495936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06929772,0.0007205541,0.9270892,0.0009735705,0.0008957309,0.0006471103,0.000157466,0.0001103543,0.0001082567],"genre_scores_gemma":[0.5804843,0.000007241878,0.418702,0.0004183707,0.0001976903,0.00005332671,0.00005148735,0.00002446137,0.00006111961],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8097194,"threshold_uncertainty_score":0.9999532,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4234648926","doi":"10.1145/1273440.1250697","title":"BulkSC","year":2007,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"Computer science; Consistency (knowledge bases); Consistency model; Sequential consistency; Decoupling (probability); Parallel computing; Weak consistency; Simple (philosophy); Strong consistency; Distributed computing; Computer architecture; Data consistency; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01365119999028267,"gpt":0.2672355191216172,"spread":0.2535843191313345,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071157,0.0003132081,0.0002889958,0.0004279893,0.0002409406,0.0002432311,0.003454676,0.0001275815,0.00001292215],"category_scores_gemma":[0.0001181683,0.0002778444,0.0001561647,0.0007736858,0.0000829879,0.0002016803,0.001737527,0.0005024866,0.00007182384],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005156514,"about_ca_system_score_gemma":0.00007448499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005049335,"about_ca_topic_score_gemma":0.00002900101,"domain_scores_codex":[0.9974109,0.0001231311,0.000458186,0.0007448262,0.0005108183,0.0007521529],"domain_scores_gemma":[0.99696,0.0006432836,0.0001316233,0.001847344,0.0001322256,0.0002854622],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001514135,0.00009148719,0.0005694413,0.00001569627,0.00003209356,0.00008822805,0.001607582,0.01500496,0.0003439547,0.01215902,0.01650392,0.9535685],"study_design_scores_gemma":[0.002214965,0.001337481,0.01226057,0.0001830923,0.00002179238,0.0008126214,0.00002210493,0.2429849,0.01505137,0.1662499,0.5565607,0.002300561],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00239598,0.000102689,0.9868263,0.003114196,0.0005822194,0.0002669967,8.455083e-7,0.001725405,0.004985349],"genre_scores_gemma":[0.1236444,0.00001043577,0.8721519,0.003339414,0.000614681,0.000006735295,0.000005891255,0.0000235745,0.0002029408],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9512679,"threshold_uncertainty_score":0.9999674,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3003171358","doi":"10.1145/871656.859643","title":"Performance analysis of the Alpha 21364-based HP GS1280 multiprocessor","year":2003,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Hewlett-Packard (Canada)","funders":"","keywords":"Multiprocessing; Computer science; Profiling (computer programming); Parallel computing; Interconnection; Alpha (finance); Embedded system; Clock rate; Key (lock); Computer architecture; Operating system; Chip","retraction":null,"screen_n_in":null,"score":{"opus":0.01297377882707794,"gpt":0.2451543054494663,"spread":0.2321805266223884,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005435852,0.0003168333,0.0004910148,0.0005741607,0.0002817917,0.0001161866,0.003527546,0.0001105576,0.00001266608],"category_scores_gemma":[0.0002318692,0.0002223746,0.0003826709,0.003092325,0.0001548198,0.0001442334,0.0006770206,0.0004162409,0.000004810451],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003960926,"about_ca_system_score_gemma":0.0002086545,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000303996,"about_ca_topic_score_gemma":0.00002571639,"domain_scores_codex":[0.9972769,0.0004227199,0.0005219062,0.0006722662,0.0006318776,0.0004743303],"domain_scores_gemma":[0.9965127,0.0005652051,0.0003018687,0.002256253,0.0002353388,0.0001286377],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001211683,0.0001435478,0.01742205,0.00005130741,0.0002727115,0.000003612114,0.001143353,0.8825654,0.0003160054,0.001125671,0.0008128419,0.09613143],"study_design_scores_gemma":[0.0004693978,0.0001477097,0.0138466,0.00005311718,0.0000966662,0.00001089784,0.000002500057,0.9681146,0.0114451,0.0008591622,0.004643486,0.0003108444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06218295,0.00007333305,0.9351074,0.0009677928,0.000247021,0.0003031204,0.000003327292,0.0003468445,0.0007681943],"genre_scores_gemma":[0.5734261,0.000006926916,0.4253263,0.001128441,0.00003704958,0.00001426479,0.000003578084,0.00001196684,0.00004533595],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5112432,"threshold_uncertainty_score":0.9068174,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4247144579","doi":"10.1145/3140659.3080216","title":"LogCA","year":2017,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Scheme for Promotion of Academic and Research Collaboration; University of Wisconsin-Madison; National Science Foundation","keywords":"Computer science; Oracle; Interface (matter); Variety (cybernetics); Computer architecture; Embedded system; Efficient energy use; Parallel computing; Computer engineering; Software engineering; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02216156391471025,"gpt":0.2852843903068958,"spread":0.2631228263921855,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0003390647,0.0002987247,0.0003087237,0.0002042521,0.00096997,0.001114322,0.008089072,0.0001139686,0.00001187505],"category_scores_gemma":[0.0002666976,0.0002602218,0.0001666522,0.0001392421,0.000159912,0.0004050932,0.003977723,0.0004487235,0.00007871585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003093205,"about_ca_system_score_gemma":0.0000881248,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000818909,"about_ca_topic_score_gemma":0.00002369849,"domain_scores_codex":[0.9978157,0.0001442478,0.0003120855,0.0007665533,0.0004086965,0.0005527716],"domain_scores_gemma":[0.9945664,0.0002679936,0.0002460302,0.004586785,0.0001162337,0.0002165776],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009003062,0.00007274278,0.001969112,0.00001766512,0.00004012867,0.00006846362,0.0008624617,0.007987651,0.0001730524,0.01141506,0.02346059,0.9539241],"study_design_scores_gemma":[0.001933763,0.0008157025,0.03357715,0.0002041372,0.00002018598,0.0003610749,0.00000460428,0.4880485,0.005119991,0.2324332,0.2357455,0.001736275],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002198751,0.00005846965,0.9793801,0.0104467,0.0006970532,0.0002404354,0.000001453155,0.001056309,0.005920717],"genre_scores_gemma":[0.2054376,0.00002272058,0.7918811,0.001822873,0.0005556905,0.00001551811,0.000003533658,0.00002046353,0.0002404942],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9521878,"threshold_uncertainty_score":0.999985,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4214856401","doi":"10.1145/1273440.1250696","title":"Mechanisms for store-wait-free multiprocessors","year":2007,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Carnegie Mellon University","keywords":"Computer science; Scalability; Speculative execution; Parallel computing; Consistency (knowledge bases); Cache coherence; Cache; Consistency model; Rollback; Implementation; Distributed computing; Sequential consistency; Synchronization (alternating current); Weak consistency; Speculation; Out-of-order execution; Eventual consistency; Strong consistency; CPU cache; Data consistency; Operating system; Computer network; Cache algorithms; Channel (broadcasting); Programming language; Database transaction","retraction":null,"screen_n_in":null,"score":{"opus":0.01623284482417857,"gpt":0.2718618750697551,"spread":0.2556290302455765,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00109914,0.0004236904,0.0004067619,0.0004942148,0.0003753173,0.0002556827,0.005127537,0.0001881645,0.000004943896],"category_scores_gemma":[0.0004326349,0.0003812228,0.0002399356,0.0006651137,0.00007833841,0.0002397777,0.002109691,0.0004323136,0.00001247041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007429328,"about_ca_system_score_gemma":0.0001071772,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003719856,"about_ca_topic_score_gemma":0.00006343456,"domain_scores_codex":[0.9968373,0.0001047907,0.0005607738,0.0009918824,0.0005750363,0.0009302733],"domain_scores_gemma":[0.9958866,0.00117592,0.0002148505,0.002132908,0.0002782321,0.000311521],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009356556,0.0002253412,0.000154217,0.00009614325,0.00008239046,0.00003858039,0.002896583,0.03317313,0.001705942,0.0290043,0.01602998,0.9164999],"study_design_scores_gemma":[0.002729224,0.001300536,0.001328217,0.0001131424,0.00002167774,0.0001238819,0.00002069613,0.546194,0.01877255,0.3843145,0.04384083,0.001240802],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001772841,0.00008045879,0.991734,0.002813215,0.0007103632,0.0008010138,0.000005286371,0.001632704,0.0004501516],"genre_scores_gemma":[0.0703557,0.000007091182,0.9262723,0.002704366,0.0004228666,0.00004781979,0.00001453208,0.00004411912,0.000131198],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.915259,"threshold_uncertainty_score":0.999864,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4235983790","doi":"10.1145/1961295.1950391","title":"Flikker","year":2011,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Dram; Correctness; Embedded system; Software; Energy consumption; Operating system; Computer hardware; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02941515349656414,"gpt":0.2491711004345014,"spread":0.2197559469379372,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002848543,0.0003089638,0.0002835851,0.0003070014,0.0001951887,0.0001537233,0.003675511,0.0001116198,0.00004231005],"category_scores_gemma":[0.00006790724,0.0002646906,0.0001569299,0.0005503066,0.00008671464,0.0002480714,0.001898212,0.0004201344,0.0001149966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000285933,"about_ca_system_score_gemma":0.00007492667,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007832576,"about_ca_topic_score_gemma":0.00001198383,"domain_scores_codex":[0.9977669,0.0002007846,0.0003614665,0.0007353569,0.0003738239,0.0005617193],"domain_scores_gemma":[0.9973466,0.0001984467,0.0001160361,0.001997488,0.0001152494,0.000226119],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002278915,0.000221079,0.001712501,0.00002529191,0.00007465798,0.0001009083,0.008871339,0.003421428,0.0002126144,0.02943637,0.02451298,0.931388],"study_design_scores_gemma":[0.002318255,0.001948572,0.02072398,0.0002075881,0.00003695072,0.0007293736,0.00002248197,0.4106651,0.01558938,0.3683646,0.1765895,0.002804184],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002109372,0.00007251567,0.9844633,0.001066405,0.0004839065,0.00025172,9.823252e-7,0.001645779,0.009905978],"genre_scores_gemma":[0.0969736,0.00001436472,0.8999299,0.002564465,0.0002858095,0.00002062033,0.00000387015,0.00002401693,0.0001834036],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9285839,"threshold_uncertainty_score":0.9999805,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4249552604","doi":"10.1145/1273440.1250676","title":"An integrated hardware-software approach to flexible transactional memory","year":2007,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"Transactional memory; Computer science; Software transactional memory; Thread (computing); Copying; Speedup; Asynchronous communication; Software; Operating system; Commit; Parallel computing; Embedded system; Distributed computing; Database transaction; Programming language; Computer network; Database","retraction":null,"screen_n_in":null,"score":{"opus":0.016164649540846,"gpt":0.2612752837975549,"spread":0.2451106342567089,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008815444,0.0004944768,0.0005046009,0.000457561,0.0003103284,0.0004317883,0.003931089,0.0001916382,0.00002335319],"category_scores_gemma":[0.00006488785,0.0004239755,0.0002137759,0.001378786,0.00008153918,0.0004888363,0.0003703035,0.0007452997,0.00007648789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001243176,"about_ca_system_score_gemma":0.0001913329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002530822,"about_ca_topic_score_gemma":0.0001063303,"domain_scores_codex":[0.9959663,0.0002106762,0.0006327068,0.001295626,0.0008982536,0.0009964713],"domain_scores_gemma":[0.9963726,0.0003063291,0.0001134169,0.00217748,0.0002637807,0.0007663977],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00009071776,0.0003805402,0.0002612565,0.00004901709,0.00006230013,0.00005067319,0.003705601,0.05407462,0.0008917535,0.001333409,0.006056705,0.9330434],"study_design_scores_gemma":[0.003660925,0.0020203,0.02855978,0.0002603228,0.00003916677,0.001175473,0.0003017117,0.1045397,0.01002971,0.006252347,0.8398499,0.003310612],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006419653,0.00006744009,0.9883115,0.0008314436,0.001151123,0.0006718449,0.00005022417,0.001025468,0.001471289],"genre_scores_gemma":[0.1900721,0.000001387431,0.8059688,0.0026604,0.0008683978,0.00004895154,0.0001042491,0.00004083628,0.0002348603],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9297328,"threshold_uncertainty_score":0.9998212,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4230924300","doi":"10.1145/2189750.2150992","title":"Comprehensive kernel instrumentation via dynamic binary translation","year":2012,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Department of Biotechnology, Ministry of Science and Technology, India","keywords":"Binary translation; Computer science; sysfs; Configfs; Kernel (algebra); Instrumentation (computer programming); Operating system; Interrupt; Overhead (engineering); Linux kernel; Embedded system; Software","retraction":null,"screen_n_in":null,"score":{"opus":0.02822068934685864,"gpt":0.2849261348126105,"spread":0.2567054454657519,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002809487,0.0003288614,0.0002764368,0.0003229284,0.0003414563,0.0001909355,0.001664139,0.0001297672,0.00001936304],"category_scores_gemma":[0.00002080204,0.0003248059,0.0001543749,0.0006716443,0.00009063095,0.000794751,0.0006166124,0.0004865049,0.0001073042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009902814,"about_ca_system_score_gemma":0.00005949273,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004273373,"about_ca_topic_score_gemma":0.00001125839,"domain_scores_codex":[0.9973809,0.0003576778,0.0004775369,0.0006007604,0.0005187301,0.0006643962],"domain_scores_gemma":[0.99762,0.0006314983,0.0001853845,0.001201434,0.0001062469,0.0002554717],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002463627,0.0001414004,0.001133558,0.00004947445,0.00004367036,0.000004023781,0.009011337,0.004183526,0.004338292,0.001533987,0.0002931419,0.979243],"study_design_scores_gemma":[0.001903903,0.0005338656,0.06350434,0.00009763139,0.00003051174,0.0003247603,0.0000896253,0.8525058,0.002197507,0.01799796,0.05966854,0.001145521],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1330342,0.0004497438,0.8614268,0.002674471,0.001408871,0.0004068493,0.00000279681,0.0004100844,0.0001861409],"genre_scores_gemma":[0.6309662,0.00001897336,0.3672141,0.001307087,0.0004101071,0.00001928817,0.00003797936,0.00001852275,0.000007754128],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9780974,"threshold_uncertainty_score":0.9999204,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4253753479","doi":"10.1145/2786763.2694380","title":"Protecting Data on Smartphones and Tablets from Memory Attacks","year":2015,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of British Columbia","funders":"","keywords":"Computer science; Embedded system; Dram; Computer hardware; Code (set theory); Class (philosophy); Memory protection; Mobile device; Operating system; Computer security; Computer data storage; Registered memory; Extended memory","retraction":null,"screen_n_in":null,"score":{"opus":0.09310083894900183,"gpt":0.3039731020865903,"spread":0.2108722631375885,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009936597,0.0003359258,0.0003397937,0.0002002183,0.0003644126,0.0005372082,0.004467063,0.0001220433,0.000006745133],"category_scores_gemma":[0.0006570863,0.0003004567,0.0000481922,0.0004313795,0.0001048676,0.0004438486,0.005133929,0.0008425711,0.00005795022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004658238,"about_ca_system_score_gemma":0.0001628568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004825669,"about_ca_topic_score_gemma":0.00009191719,"domain_scores_codex":[0.9966335,0.000474711,0.0004030483,0.001360096,0.0006204095,0.0005082358],"domain_scores_gemma":[0.9941381,0.001511661,0.0001768775,0.003698026,0.0001153483,0.0003599633],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004724409,0.0001073579,0.0008239019,0.00003084929,0.0000638472,0.00004675597,0.01088371,0.003689115,0.0004106388,0.0006894565,0.0133186,0.9698885],"study_design_scores_gemma":[0.003168847,0.0008746231,0.006436525,0.0003839621,0.00003073071,0.000276937,0.0002502248,0.7642359,0.003484539,0.06114449,0.1580982,0.001615069],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08937079,0.0002864708,0.8985042,0.009055445,0.001308973,0.0004923698,0.00001744143,0.0004747548,0.000489569],"genre_scores_gemma":[0.3742062,0.00001045603,0.6200593,0.003641558,0.001912255,0.00002588825,0.00006508804,0.00003551766,0.00004369163],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9682735,"threshold_uncertainty_score":0.9999447,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4241113734","doi":"10.1145/2528521.1508259","title":"RapidMRC","year":2009,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Henan Institute of Science and Technology","keywords":"Computer science; Cache; Multi-core processor; Cache algorithms; Parallel computing; Cache invalidation; Overhead (engineering); Smart Cache; Software; Process (computing); Code (set theory); Cache pollution; CPU cache; Operating system; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01310465275337563,"gpt":0.258165818348991,"spread":0.2450611655956154,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003059415,0.0003224506,0.0003186401,0.0003384507,0.0002302782,0.0003195302,0.003562951,0.0001115454,0.00001225702],"category_scores_gemma":[0.00008924805,0.0002818333,0.0001709994,0.0006810827,0.00005214073,0.0002467283,0.000817137,0.0004580539,0.00005691042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003691144,"about_ca_system_score_gemma":0.00007975323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001282495,"about_ca_topic_score_gemma":0.000002934408,"domain_scores_codex":[0.997617,0.0002050807,0.0003764528,0.0007560964,0.0004525323,0.0005928417],"domain_scores_gemma":[0.9973316,0.0002740558,0.0001165306,0.001936702,0.0001089359,0.0002322344],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007847561,0.00008654655,0.00009115757,0.000005539898,0.00001547543,0.00003217,0.0008372315,0.0156847,0.0003376764,0.01043355,0.02235683,0.9501113],"study_design_scores_gemma":[0.001708537,0.00204694,0.008247334,0.0001417078,0.00001572431,0.00043812,0.000005334184,0.4486366,0.005883,0.3598008,0.1714602,0.001615623],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001423349,0.0001403259,0.9798281,0.01237614,0.0003335491,0.0002682986,8.052764e-7,0.001866385,0.003763087],"genre_scores_gemma":[0.1438998,0.00002425954,0.847522,0.007925233,0.0004697594,0.000007432896,0.000006060333,0.00001387883,0.0001316535],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9484956,"threshold_uncertainty_score":0.9999634,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4243453813","doi":"10.1145/384285.379260","title":"Code layout optimizations for transaction processing workloads","year":2001,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"PQ Corporation (Canada)","funders":"","keywords":"Computer science; Online transaction processing; Operating system; Compiler; Cache; Parallel computing; Transaction processing; Optimizing compiler; Database transaction; Database","retraction":null,"screen_n_in":null,"score":{"opus":0.02426083167866355,"gpt":0.2857617733199926,"spread":0.261500941641329,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003186731,0.0003285746,0.0003194685,0.0003603666,0.0005241556,0.0004329345,0.001972478,0.0001437918,0.000009047649],"category_scores_gemma":[0.00007672418,0.0003077805,0.0001815506,0.0008661088,0.00006886572,0.0003894195,0.0003061945,0.0003437573,0.000007849836],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005996719,"about_ca_system_score_gemma":0.0001377187,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001539878,"about_ca_topic_score_gemma":0.00002830372,"domain_scores_codex":[0.9976891,0.0001392422,0.0004492043,0.0007818513,0.0003489867,0.0005916245],"domain_scores_gemma":[0.997999,0.0003690661,0.0001627482,0.001034783,0.0002439767,0.0001904187],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002230952,0.00007525562,0.0001355731,0.00002327246,0.00001876098,0.000005427745,0.001161694,0.4635593,0.00006430583,0.0005641475,0.002413747,0.5319562],"study_design_scores_gemma":[0.0006715338,0.0002248418,0.0001844595,0.0000879694,0.00001407362,0.0001046519,0.000006338764,0.946655,0.0003799933,0.009895342,0.04138218,0.0003936588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005916809,0.000153934,0.9901056,0.005937207,0.0003318668,0.0006819251,0.000004832181,0.001558799,0.000634186],"genre_scores_gemma":[0.07049268,0.00004734271,0.9269791,0.00159734,0.0004610973,0.0001078772,0.00002646761,0.00003818065,0.0002499303],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5315626,"threshold_uncertainty_score":0.9999374,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2072283196","doi":"10.1145/563647.563649","title":"Adapting Tomasulo's algorithm for bytecode folding based Java processors","year":2001,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Bytecode; Java; Java bytecode; Java concurrency; Programming language; Java annotation; Parallel computing; Real time Java; Java applet; Java Modeling Language; Generics in Java; Scala; strictfp; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.02199764078528948,"gpt":0.2743950414538784,"spread":0.252397400668589,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006971452,0.0004779767,0.0004681757,0.0004906057,0.0005101974,0.0004554146,0.003281007,0.0001688927,0.000008756569],"category_scores_gemma":[0.0002300038,0.0004457011,0.0002660379,0.0009308048,0.00006941574,0.0003218134,0.0009802022,0.0004454434,0.00001002219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008338914,"about_ca_system_score_gemma":0.0001935299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003939181,"about_ca_topic_score_gemma":0.00001862404,"domain_scores_codex":[0.9965789,0.000196041,0.0005956654,0.001128062,0.0005484553,0.0009529254],"domain_scores_gemma":[0.9966901,0.001026609,0.0002602948,0.001459091,0.0002917098,0.0002722206],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001455468,0.00007938201,0.0001432803,0.00003413992,0.00003009688,0.0000229575,0.000559569,0.08398665,0.00015241,0.0004313172,0.003049232,0.9114964],"study_design_scores_gemma":[0.0008828834,0.000369253,0.00009112921,0.0001113216,0.00001042608,0.00007744633,0.000005207569,0.9519216,0.002099354,0.007864375,0.03605899,0.0005079826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001279006,0.0001415253,0.9913944,0.003487154,0.0004275732,0.0008506686,0.000005540539,0.001945589,0.0004685599],"genre_scores_gemma":[0.03174912,0.00001551291,0.9646499,0.002539141,0.0007124901,0.0001337614,0.00002176096,0.00005549062,0.000122811],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9109884,"threshold_uncertainty_score":0.9997995,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4241403285","doi":"10.1145/2508148.2485969","title":"Protozoa","year":2013,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Division of Computer and Network Systems; Natural Sciences and Engineering Research Council of Canada; Ministère de l'Économie, de la Science et de l'Innovation - Québec; Division of Computing and Communication Foundations; CMC Microsystems","keywords":"Computer science; Granularity; Cache coherence; Cache; Scalability; Bus sniffing; MESI protocol; Locality of reference; Metadata; Distributed computing; Parallel computing; CPU cache; Cache algorithms; Database; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01241564600759324,"gpt":0.2459268592791896,"spread":0.2335112132715964,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002207589,0.0003158904,0.0002898926,0.0002886549,0.0002171201,0.0005241467,0.003587148,0.0001077451,0.00005589078],"category_scores_gemma":[0.00009456334,0.0002619419,0.0001404987,0.0005755317,0.00007682749,0.0003975164,0.00189187,0.0004458849,0.0002906542],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003621909,"about_ca_system_score_gemma":0.00008202869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001521286,"about_ca_topic_score_gemma":0.000007157802,"domain_scores_codex":[0.9976156,0.00021667,0.0003824213,0.0007379846,0.0004410027,0.0006063738],"domain_scores_gemma":[0.9972075,0.0003030548,0.0001197835,0.001936586,0.0001832349,0.0002499064],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003403611,0.00009666573,0.0006911887,0.00002580481,0.00003236382,0.00001439297,0.001164001,0.01065694,0.0004182198,0.004918526,0.05794359,0.9240349],"study_design_scores_gemma":[0.001171731,0.0008449947,0.007888907,0.000132129,0.000009014719,0.0002565999,0.000007786871,0.6521245,0.004993874,0.2093717,0.1218397,0.001359043],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002978775,0.00005081322,0.9837879,0.007496304,0.0002963462,0.001165236,7.633687e-7,0.00173294,0.00249094],"genre_scores_gemma":[0.06731887,0.000008624961,0.9281268,0.003638382,0.0003952636,0.0002494298,0.000006617626,0.0000254084,0.0002306632],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9226758,"threshold_uncertainty_score":0.9999833,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4248503218","doi":"10.1145/2508148.2485947","title":"Cooperative boosting","year":2013,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Boosting (machine learning); Workload; Computer science; Power management; Central processing unit; Performance improvement; Supercomputer; Parallel computing; Computer engineering; Coupling (piping); Thermal; Efficient energy use; Computational science; Power (physics); Operating system; Artificial intelligence; Engineering; Electrical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0141690242549186,"gpt":0.2497245611594903,"spread":0.2355555369045717,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002317061,0.0003287346,0.0003124048,0.0002561802,0.0003209804,0.000598514,0.002860191,0.0001000088,0.0000495593],"category_scores_gemma":[0.0001894756,0.0002749605,0.0001173159,0.0006071147,0.00008613023,0.0004416296,0.001889576,0.0004908134,0.0002323111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004148313,"about_ca_system_score_gemma":0.00009054598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001421264,"about_ca_topic_score_gemma":0.000009114287,"domain_scores_codex":[0.9976022,0.0002707045,0.0003980024,0.0007427123,0.0003875277,0.0005988523],"domain_scores_gemma":[0.9973133,0.0005968145,0.0001263311,0.001464444,0.0002644557,0.0002346635],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003940344,0.00008961169,0.0006968984,0.00002003598,0.00005092389,0.00002220368,0.002902047,0.05401948,0.0009405144,0.006411599,0.04933609,0.8855066],"study_design_scores_gemma":[0.0008254005,0.000599147,0.003721918,0.0001208777,0.000007808624,0.0001788611,0.00001620549,0.9099184,0.004277746,0.04905577,0.03026896,0.001008947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005258209,0.0000795204,0.9831064,0.005932658,0.0003185832,0.0005345944,8.784e-7,0.001427907,0.00334126],"genre_scores_gemma":[0.1496706,0.00001034322,0.8455765,0.004035509,0.0003740532,0.00006263601,0.000006802344,0.0000234327,0.0002402019],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8844977,"threshold_uncertainty_score":0.9999703,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2998610137","doi":"10.1145/3140659.3080251","title":"There and Back Again","year":2017,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Network topology; Dram; Latency (audio); Scalability; Interconnection; Queueing theory; Interleaved memory; Registered memory; Efficient energy use; Distributed computing; Computer network; Parallel computing; Embedded system; Memory management; Semiconductor memory; Computer hardware; Operating system; Electrical engineering; Engineering; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02088922460367318,"gpt":0.2564817175323137,"spread":0.2355924929286405,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003470115,0.0002536533,0.0002965678,0.0001004757,0.0006377762,0.001206337,0.003130075,0.0001039131,0.00003203369],"category_scores_gemma":[0.00007282852,0.0001966182,0.0001122181,0.00007406547,0.0001296129,0.0003359439,0.002205276,0.0003758533,0.0001326161],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002000622,"about_ca_system_score_gemma":0.0000348729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001776815,"about_ca_topic_score_gemma":0.0001848637,"domain_scores_codex":[0.9981806,0.0001787212,0.0002719076,0.0006570329,0.0002691149,0.0004425704],"domain_scores_gemma":[0.9966149,0.000278484,0.0001723653,0.002671245,0.00006857039,0.0001944073],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001608343,0.00003690239,0.003563888,0.00004205685,0.00006911091,0.00007170939,0.002316888,0.0007768629,0.0002634985,0.01056314,0.01920097,0.9630789],"study_design_scores_gemma":[0.002376854,0.0008802952,0.04487847,0.0004055042,0.00001582526,0.0008420486,0.0000372129,0.2496774,0.0005414197,0.06505961,0.6338446,0.001440761],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03078708,0.0001831005,0.9482996,0.01037238,0.001625712,0.0003093938,0.00000187981,0.0001533189,0.008267513],"genre_scores_gemma":[0.865773,0.00003378184,0.1293697,0.002047066,0.001611505,0.00001684824,0.000001940741,0.00002544099,0.001120742],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9616382,"threshold_uncertainty_score":0.9998305,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2345041994","doi":"10.1145/2927964.2927968","title":"A Case Study in Reverse Engineering GPGPUs","year":2016,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; CUDA; Kepler; Key (lock); Set (abstract data type); Parallel computing; Instruction set; Science and engineering; Computer architecture; Operating system; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01812994576685835,"gpt":0.2580146050070201,"spread":0.2398846592401617,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004820848,0.0003044438,0.0003228038,0.0005511758,0.00009552992,0.0001348672,0.001828897,0.00007967231,0.000006051523],"category_scores_gemma":[0.0001750253,0.0002192594,0.00009245966,0.0007062866,0.00003252568,0.000247927,0.001529753,0.0003237632,0.00001952726],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008580168,"about_ca_system_score_gemma":0.00006781753,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002467263,"about_ca_topic_score_gemma":0.0001426466,"domain_scores_codex":[0.9976847,0.000250203,0.0004328962,0.0007692968,0.0003262647,0.000536634],"domain_scores_gemma":[0.9974009,0.0006775925,0.00008829953,0.001593129,0.00006816538,0.0001719071],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000222115,0.0005168975,0.01202104,0.00003037503,0.00006431066,0.01376654,0.009847074,0.06006408,0.0006087984,0.0008231894,0.002992031,0.8992435],"study_design_scores_gemma":[0.01344371,0.004707079,0.01440915,0.0009982352,0.00004650123,0.03142253,0.0002153826,0.8807119,0.002577784,0.01596769,0.03115309,0.004346972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1607268,0.00002204831,0.8363409,0.001378059,0.0002666015,0.0004702717,9.167611e-7,0.0007289453,0.00006549002],"genre_scores_gemma":[0.5763205,0.000004432883,0.423117,0.0003276438,0.0001430607,0.00003153647,3.704133e-7,0.00001735571,0.00003806297],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8948965,"threshold_uncertainty_score":0.894114,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2044274432","doi":"10.1145/1147349.1147358","title":"Hiding message delivery and reducing memory access latency by providing direct-to-cache transfer during receive operations in a message passing environment","year":2005,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Cache; Copying; Cache invalidation; Message passing; Latency (audio); Computer network; Thread (computing); Cache pollution; False sharing; Cache algorithms; Bus sniffing; CPU cache; Distributed computing; Parallel computing; Operating system; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01371884196843408,"gpt":0.2461404159929009,"spread":0.2324215740244668,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005819775,0.0004404343,0.0004572997,0.000577675,0.0004715291,0.0007207613,0.001759041,0.0001362168,0.00001251257],"category_scores_gemma":[0.00007032014,0.0004274758,0.00009353508,0.0005887595,0.00006816315,0.0009071191,0.001579282,0.0006244183,0.000008206647],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002317151,"about_ca_system_score_gemma":0.00007847601,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001769282,"about_ca_topic_score_gemma":0.00007606439,"domain_scores_codex":[0.9965651,0.0004442789,0.0006295884,0.001214304,0.0004371005,0.00070962],"domain_scores_gemma":[0.9983484,0.000347109,0.00006653277,0.0009211306,0.0000422099,0.000274665],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002405634,0.0001289889,0.0005891035,0.00005887637,0.00003976247,0.00003379392,0.01224637,0.6785186,0.02203018,0.00005162414,0.0007096359,0.285569],"study_design_scores_gemma":[0.001763622,0.0002530038,0.003779387,0.0007941432,0.00002972541,0.0001097525,0.00005190894,0.9088737,0.07910317,0.0003965293,0.003416731,0.001428348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2769884,0.0003676029,0.7169858,0.004237403,0.00008404788,0.0006441275,0.000003913061,0.0003466985,0.000342027],"genre_scores_gemma":[0.6328806,0.0001680655,0.3659161,0.0006496515,0.0001707452,0.00005486244,0.000006987192,0.00003541032,0.0001176252],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3558922,"threshold_uncertainty_score":0.9998177,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978176266","doi":"10.1145/773365.773371","title":"An EGA approach to the compile-time assignment of data to multiple memories in digital-signal processors","year":2003,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"University of Waterloo; University of Guelph","funders":"","keywords":"Computer science; Compiler; Parallel computing; Dual (grammatical number); Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.03251975303947704,"gpt":0.2719346247869187,"spread":0.2394148717474417,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0005466578,0.0002740712,0.0003175564,0.0002205873,0.0002015394,0.0002564671,0.006045704,0.00005544815,0.000005662559],"category_scores_gemma":[0.0001151055,0.0001996149,0.00005459175,0.00122473,0.0000933565,0.0005684578,0.001986097,0.0003051536,0.00003338092],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004732606,"about_ca_system_score_gemma":0.0001620489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004004885,"about_ca_topic_score_gemma":0.00004808758,"domain_scores_codex":[0.9972795,0.000173163,0.0004578262,0.0009999989,0.0006059731,0.0004835693],"domain_scores_gemma":[0.9959021,0.000504248,0.00009669689,0.003111124,0.000109536,0.0002763512],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005362569,0.002227813,0.00379698,0.00006703531,0.00008169605,0.000008429472,0.01412661,0.4852534,0.002019228,0.01135318,0.01085491,0.4701571],"study_design_scores_gemma":[0.001041644,0.0007719074,0.01211726,0.0000755655,0.00001248308,0.00008557796,0.0001593498,0.8763291,0.001199808,0.01762518,0.0897358,0.0008463272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01469755,0.0000380139,0.9802113,0.003204104,0.00007262148,0.001114289,0.000083014,0.0000932008,0.0004859411],"genre_scores_gemma":[0.4900806,9.248205e-7,0.5088834,0.0006828331,0.0001313895,0.0001105364,0.00006175657,0.00001429968,0.00003425981],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4753831,"threshold_uncertainty_score":0.9993321,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4230823926","doi":"10.1145/3140659.3080218","title":"Fractal","year":2017,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; Kwanjeong Educational Foundation; Massachusetts Institute of Technology; National Science Foundation","keywords":"Computer science; Parallel computing; Parallelism (grammar); Fractal; Data parallelism; Exploit; Task parallelism; Range (aeronautics); Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01936470364595629,"gpt":0.2836248710587225,"spread":0.2642601674127662,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0003096074,0.0002934287,0.0002976554,0.0001934515,0.0009726312,0.001174629,0.007483634,0.0001141806,0.00001319597],"category_scores_gemma":[0.0002641869,0.0002571842,0.0001634341,0.0001287507,0.0001451412,0.0004810294,0.003866368,0.0004857928,0.00007592085],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002986956,"about_ca_system_score_gemma":0.00008591081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009140032,"about_ca_topic_score_gemma":0.00002056211,"domain_scores_codex":[0.997869,0.0001291473,0.0003037863,0.0007363533,0.0004299699,0.0005317093],"domain_scores_gemma":[0.9949947,0.0002599659,0.0002511953,0.004166307,0.0001099627,0.0002178865],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008945956,0.00007517191,0.002121382,0.00001392522,0.00003766109,0.00007083808,0.0008788205,0.005541038,0.0001903823,0.007338078,0.01656341,0.9671603],"study_design_scores_gemma":[0.001950157,0.0008052838,0.04433656,0.0001887582,0.0000189992,0.0003845685,0.00000529946,0.5636173,0.005051274,0.1661521,0.2157629,0.001726765],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004600847,0.00004962386,0.9792382,0.008537106,0.0006826131,0.0002281655,0.000001571287,0.001004123,0.005657742],"genre_scores_gemma":[0.2923937,0.00001449976,0.705326,0.001494442,0.0005550983,0.00001289489,0.000003570258,0.00001851103,0.000181232],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9654336,"threshold_uncertainty_score":0.999988,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2344488400","doi":"10.1145/2927964.2927973","title":"Efficient Mapping and Allocation of Execution Units to Task Graphs using an Evolutionary Framework","year":2016,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Control reconfiguration; Computer science; Task (project management); Field-programmable gate array; Genetic algorithm; Execution time; Power consumption; Multi-objective optimization; Power (physics); Distributed computing; Parallel computing; Embedded system; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0317336233244092,"gpt":0.2716607310664878,"spread":0.2399271077420786,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005545728,0.0002719059,0.0003133296,0.0006867747,0.000158483,0.0000719622,0.001413273,0.0001519679,0.000001855511],"category_scores_gemma":[0.0002330092,0.0002091682,0.00005927246,0.001164433,0.000112009,0.0001952121,0.001003959,0.0002146033,0.000003051215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001054013,"about_ca_system_score_gemma":0.0001183727,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009044896,"about_ca_topic_score_gemma":0.000007982604,"domain_scores_codex":[0.997334,0.000483034,0.0004853978,0.000751809,0.0005257464,0.0004200235],"domain_scores_gemma":[0.9971358,0.0006013802,0.0001949332,0.001503665,0.0003146535,0.0002495335],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005221778,0.0002121515,0.002753595,0.0001484948,0.0000766923,0.00001986905,0.01324808,0.02190979,0.3642362,0.04249606,0.000808979,0.5540379],"study_design_scores_gemma":[0.00162017,0.002603458,0.04381657,0.004760619,0.00004793866,0.0007033573,0.0001365828,0.5046984,0.03787366,0.3973451,0.004001967,0.0023922],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2426621,0.00006915815,0.7551978,0.001059655,0.000205139,0.0005166091,0.00000430569,0.0002633023,0.00002185942],"genre_scores_gemma":[0.517685,0.000003070396,0.4819645,0.0002159804,0.0000982555,0.00001611973,0.000001444719,0.00001285508,0.000002765646],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5516457,"threshold_uncertainty_score":0.8529632,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4253914488","doi":"10.1145/2490301.2451124","title":"Power containers","year":2013,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Server; Computer science; Multi-core processor; Cloud computing; Power management; Operating system; Efficient energy use; Power (physics); Power budget; Embedded system; Distributed computing; Power control; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.007417182075350998,"gpt":0.2169103768373817,"spread":0.2094931947620307,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002601123,0.0003752196,0.0003483659,0.0002934058,0.0002355008,0.000524057,0.003882394,0.00008964702,0.00009250233],"category_scores_gemma":[0.00006980004,0.0002950887,0.0002119907,0.0005378976,0.00009847616,0.0000630398,0.003406353,0.000496399,0.0005574838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005520407,"about_ca_system_score_gemma":0.00004775892,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001983038,"about_ca_topic_score_gemma":0.000009013,"domain_scores_codex":[0.9971297,0.0002069846,0.0003926913,0.000871568,0.0005850142,0.0008140014],"domain_scores_gemma":[0.9967484,0.0004485384,0.0001135281,0.002252317,0.0001144073,0.000322752],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00000639172,0.0001230429,0.001005182,0.00002434748,0.0001159822,0.00006511641,0.003232833,0.009629266,0.0004499123,0.006916406,0.06218088,0.9162506],"study_design_scores_gemma":[0.00300189,0.001483628,0.02705693,0.0001847684,0.0000247825,0.000334001,0.0001389818,0.4231794,0.0005669341,0.06039064,0.4812699,0.002368122],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.165953,0.00009344359,0.8034358,0.02096857,0.0009031276,0.0006467104,5.962374e-7,0.000830137,0.007168619],"genre_scores_gemma":[0.757323,0.000001974198,0.2331895,0.008114839,0.0005312827,0.00005110324,0.000002418352,0.00003268553,0.0007532245],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9138825,"threshold_uncertainty_score":0.9999501,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4244472522","doi":"10.1145/384285.379265","title":"Power and energy reduction via pipeline balancing","year":2001,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"PQ Corporation (Canada)","funders":"","keywords":"Pipeline (software); Computer science; Queue; Reduction (mathematics); Power (physics); Embedded system; Energy (signal processing); Dissipation; Chip; Efficient energy use; Power budget; Component (thermodynamics); Real-time computing; Operating system; Electric power system; Engineering; Computer network; Electrical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.007678002474206413,"gpt":0.2342863465951199,"spread":0.2266083441209135,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000268165,0.0002877108,0.0002772124,0.0003199978,0.0002365091,0.0002237861,0.001216431,0.0001088561,0.000012045],"category_scores_gemma":[0.00004494788,0.000259654,0.00008581881,0.0005453491,0.00007574483,0.0002413141,0.001108914,0.0003078576,0.000007235705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003725304,"about_ca_system_score_gemma":0.00004386874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001000117,"about_ca_topic_score_gemma":0.00001267359,"domain_scores_codex":[0.9979326,0.0001882505,0.0003524093,0.0007320193,0.0003309908,0.0004637708],"domain_scores_gemma":[0.9983011,0.0001788877,0.0001198361,0.001085571,0.0001134523,0.0002011402],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001945132,0.00006845845,0.000366666,0.000009463633,0.00002389708,0.00004412355,0.001226905,0.01556126,0.001271627,0.002589457,0.009651792,0.9691669],"study_design_scores_gemma":[0.0009057708,0.0005200374,0.001377796,0.00009600111,0.0000107383,0.002223571,0.000009139289,0.778718,0.00225991,0.04581094,0.1672168,0.000851289],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00391575,0.0002314976,0.9885495,0.003873734,0.0004786018,0.00009919637,5.396502e-7,0.0009169393,0.001934255],"genre_scores_gemma":[0.3462219,0.0001102207,0.6508933,0.001923381,0.0004836603,0.00001152346,0.000007116021,0.00002294615,0.0003260523],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9683156,"threshold_uncertainty_score":0.9999856,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}