{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":19,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":19,"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":"4051704373d3","filters":{"venue":"ACM Transactions on Computer Systems"}},"results":[{"id":"W2074881976","doi":"10.1145/2806887","title":"The RAMCloud Storage System","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Computer Systems","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":270,"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; Samsung; Defense Advanced Research Projects Agency; NetApp; National Science Foundation; VMware; Cisco Systems; Semiconductor Research Corporation","keywords":"Computer science; Backup; Polling; Latency (audio); Operating system; Dram; Computer network; Computer data storage; RAID; Storage area network; Auxiliary memory; Server; File server; Converged storage; Data loss; Information repository; Computer hardware","retraction":null,"screen_n_in":null,"score":{"opus":0.03451363106089021,"gpt":0.2502271501895691,"spread":0.2157135191286789,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006221936,0.0002619254,0.0002712655,0.0001546261,0.000552458,0.0006083895,0.003964731,0.0001244723,3.828855e-7],"category_scores_gemma":[0.00003373562,0.0001860783,0.00009301765,0.0006265228,0.0001089848,0.0006757994,0.0001287798,0.0003576258,0.0003167256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003671808,"about_ca_system_score_gemma":0.00009315894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005874124,"about_ca_topic_score_gemma":0.00001253075,"domain_scores_codex":[0.9978217,0.0002022335,0.0004110311,0.0005636074,0.000560811,0.0004406127],"domain_scores_gemma":[0.9955403,0.0004369747,0.0001583623,0.003514751,0.0001814446,0.0001681332],"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.00005027921,0.0002302151,0.00001676804,0.0001394321,0.0002589378,0.0003015637,0.001439195,0.2331366,0.00005521445,0.2558255,0.03590385,0.4726424],"study_design_scores_gemma":[0.001223617,0.0006349955,0.00004312439,0.0002177773,0.00002398148,0.0007411485,0.001415809,0.7140198,0.0004264818,0.001607825,0.2788675,0.000777931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003792779,0.0005048951,0.9839557,0.0009781022,0.01097472,0.0004296129,0.00001386835,0.002487347,0.0002764704],"genre_scores_gemma":[0.8641123,0.00002093419,0.1346343,0.0001009038,0.0004076988,0.0001862548,0.000002813725,0.00003315565,0.0005016654],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.863733,"threshold_uncertainty_score":0.7588053,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037462607","doi":"10.1145/1082469.1082471","title":"The STAMPede approach to thread-level speculation","year":2005,"lang":"en","type":"article","venue":"ACM Transactions on Computer Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":185,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Exploit; Multithreading; Thread (computing); Cache coherence; Multiprocessing; Parallel computing; Compiler; Simultaneous multithreading; Speculation; Speculative multithreading; Workload; Cache; Computer architecture; CPU cache; Embedded system; Operating system; Cache algorithms","retraction":null,"screen_n_in":null,"score":{"opus":0.04490225370586334,"gpt":0.2656086758826906,"spread":0.2207064221768273,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004756108,0.0002062341,0.0001842976,0.0001742609,0.0006461196,0.0006434257,0.001682499,0.00007917854,0.000001267901],"category_scores_gemma":[0.000008576817,0.0001569466,0.00009819295,0.0005323958,0.00002579486,0.0003169244,0.00004713088,0.0001939796,0.0001157498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00011276,"about_ca_system_score_gemma":0.00004340073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004082853,"about_ca_topic_score_gemma":0.000008877879,"domain_scores_codex":[0.9982355,0.0001609036,0.0003936934,0.0004864163,0.0003957469,0.0003277764],"domain_scores_gemma":[0.9979879,0.0002258178,0.00009840316,0.001413974,0.0001416422,0.0001322157],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006152043,0.000116494,0.00000563044,0.0000074948,0.00002997457,5.694765e-7,0.0005162331,0.8351641,0.000009948324,0.02048178,0.004893088,0.1387685],"study_design_scores_gemma":[0.0001991142,0.00009963537,0.0002738258,0.00003374883,0.000005146774,0.00003317722,0.00001758469,0.9492558,0.0002367277,0.0003198362,0.04928038,0.0002450772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001808924,0.00007351246,0.9937114,0.001886897,0.001187738,0.0004977728,0.000003926165,0.0008022761,0.001655598],"genre_scores_gemma":[0.3162094,0.00001787886,0.6820413,0.0003856648,0.0003384078,0.00007994407,0.000002785341,0.00001603815,0.0009085274],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3160285,"threshold_uncertainty_score":0.6400098,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1986491730","doi":"10.1145/1534909.1534910","title":"A mechanistic performance model for superscalar out-of-order processors","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Computer Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":182,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Vlaamse regering; Universiteit Gent; Fonds Wetenschappelijk Onderzoek; Intel Corporation","keywords":"Computer science; Pipeline (software); Microarchitecture; Parallel computing; Cache; Interval (graph theory); Scaling; Superscalar; Branch predictor; Pipeline burst cache; Out-of-order execution; Instructions per cycle; Speculative execution; CPU cache; Cache algorithms; Operating system; Central processing unit","retraction":null,"screen_n_in":null,"score":{"opus":0.03322298014508084,"gpt":0.2662728396138084,"spread":0.2330498594687276,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002671723,0.00020748,0.0002986779,0.0002179715,0.000219042,0.0001187593,0.001140191,0.0001034202,7.808749e-7],"category_scores_gemma":[0.00001089683,0.0001948874,0.0001082122,0.0003622373,0.00001991652,0.0003256977,0.0000133773,0.0001287452,0.000006499599],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004540585,"about_ca_system_score_gemma":0.00008395233,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003772761,"about_ca_topic_score_gemma":8.57379e-7,"domain_scores_codex":[0.9985651,0.00004358414,0.0004166657,0.0004307715,0.000262464,0.0002813593],"domain_scores_gemma":[0.9985438,0.0001057507,0.0001281088,0.000803592,0.0003387965,0.00007993691],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001644582,0.0001637279,0.000001899747,0.00009501207,0.00002299484,5.745534e-7,0.0008600972,0.9601936,0.00005430183,0.005640738,0.0003485167,0.03260206],"study_design_scores_gemma":[0.0003674729,0.0005022253,0.000008362674,0.0001159032,0.00001201657,0.000008023993,0.00000561668,0.9962397,0.001327773,0.0009755871,0.0002223082,0.0002150645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005445607,0.00005002074,0.9969156,0.0003156516,0.0009561239,0.0005410148,0.000007041941,0.0005795496,0.00009045275],"genre_scores_gemma":[0.5438531,0.00001306022,0.4556935,0.0001360867,0.00005417927,0.00004676501,0.000002088482,0.000009139941,0.0001920304],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5433086,"threshold_uncertainty_score":0.7947276,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1991152532","doi":"10.1145/1113574.1113576","title":"MIDDLE-R","year":2005,"lang":"en","type":"article","venue":"ACM Transactions on Computer Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":173,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Replication (statistics); Middleware (distributed applications); Concurrency control; Correctness; Scalability; Distributed computing; Concurrency; Variety (cybernetics); Distributed object; Object (grammar); Operating system; Programming language; Common Object Request Broker Architecture; Database transaction","retraction":null,"screen_n_in":null,"score":{"opus":0.02774426662215443,"gpt":0.2335763803374512,"spread":0.2058321137152967,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002415412,0.000237284,0.0002897597,0.0001550315,0.0002471995,0.0004294205,0.001677285,0.0001089088,0.00001391436],"category_scores_gemma":[0.000003027958,0.0002179234,0.0001492259,0.0004556986,0.0000257838,0.0006380141,0.00002380799,0.000220286,0.0008701165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009680658,"about_ca_system_score_gemma":0.00004275791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005925756,"about_ca_topic_score_gemma":0.00001303602,"domain_scores_codex":[0.9981066,0.0001047058,0.0004551309,0.0005518603,0.0003948503,0.0003868495],"domain_scores_gemma":[0.997867,0.0001120198,0.0001038839,0.001637684,0.0001085582,0.0001708348],"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.00001583038,0.0006709634,0.00004169005,0.0001222869,0.0001834352,0.00004798201,0.001334529,0.1871061,0.0001097816,0.03046874,0.01837727,0.7615213],"study_design_scores_gemma":[0.0007152369,0.0001687029,0.0001947683,0.0001887899,0.000008775208,0.0002005729,0.00002491662,0.5873579,0.000285278,0.00007638684,0.4103377,0.0004410495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000893802,0.0002624765,0.9905936,0.001405939,0.004885478,0.0002874875,0.00002013654,0.0005615212,0.001089551],"genre_scores_gemma":[0.9312487,0.00001235704,0.06573576,0.0004957441,0.001000196,0.00008215402,0.0000038325,0.00001940096,0.001401817],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.930355,"threshold_uncertainty_score":0.9999079,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964225254","doi":"10.1145/1880018.1880019","title":"Contention-Aware Scheduling on Multicore Systems","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Computer Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":155,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scheduling (production processes); Distributed computing; Workload; Thread (computing); Multi-core processor; Fair-share scheduling; Cache; Shared memory; Parallel computing; Quality of service; Operating system; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.02648338605496015,"gpt":0.2628462369562809,"spread":0.2363628509013208,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000433703,0.0003335465,0.0003731829,0.0003923737,0.0005067851,0.0007560887,0.001697,0.0002258986,0.000006087931],"category_scores_gemma":[0.000020535,0.0003099812,0.0001766151,0.000450912,0.00004824204,0.0003731148,0.00003951737,0.0006733786,0.0001757705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006125437,"about_ca_system_score_gemma":0.0000609691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001390068,"about_ca_topic_score_gemma":0.000007677166,"domain_scores_codex":[0.9976389,0.0001802225,0.0005665326,0.000735664,0.0004771714,0.0004015567],"domain_scores_gemma":[0.9971322,0.0003581527,0.0002090675,0.001803961,0.0003012121,0.0001954167],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001723726,0.0004029415,0.0000888045,0.0000967475,0.0001066647,0.00002735746,0.0003588219,0.9514528,0.0003067275,0.01843428,0.001351205,0.02735642],"study_design_scores_gemma":[0.0005002953,0.0002297851,0.0001050325,0.0002371979,0.000009584253,0.00008796369,0.00002665018,0.9945075,0.0004182685,0.00006266963,0.003457656,0.0003573902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004134219,0.00004588506,0.9804813,0.0003581009,0.01235466,0.0005743249,0.000009693782,0.001764872,0.0002769906],"genre_scores_gemma":[0.8519436,0.000009591955,0.1468652,0.0001870853,0.0004807153,0.0000979028,0.000006234734,0.00002961018,0.0003800421],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8478094,"threshold_uncertainty_score":0.9999352,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2088723365","doi":"10.1145/1275517.1275518","title":"Experience distributing objects in an SMMP OS","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Computer Systems","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":"University of Toronto","funders":"","keywords":"Computer science; Locality; Scalability; Distributed computing; Lock (firearm); Concurrency; Implementation; Replication (statistics); Concurrency control; Locality of reference; Code (set theory); Object (grammar); Object-oriented programming; Parallel computing; Programming language; Operating system; Set (abstract data type); Cache; Database transaction","retraction":null,"screen_n_in":null,"score":{"opus":0.02736831849411399,"gpt":0.291977313327682,"spread":0.264608994833568,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007152272,0.0002185031,0.0002467837,0.0003492491,0.0002543059,0.0003280352,0.00151217,0.0001178516,0.00000292796],"category_scores_gemma":[0.00001318012,0.00022195,0.00006853063,0.0008494957,0.0000351168,0.0006266347,0.00004074832,0.0002706496,0.00001878714],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001332786,"about_ca_system_score_gemma":0.00004167498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001340419,"about_ca_topic_score_gemma":0.00004881428,"domain_scores_codex":[0.9979132,0.0001479071,0.0005329585,0.0006030553,0.000323993,0.0004788824],"domain_scores_gemma":[0.9981756,0.0002435346,0.0001214142,0.001192104,0.0001074006,0.0001599371],"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.00005697685,0.001260125,0.004006666,0.0001018923,0.00004752186,0.0002737898,0.01751684,0.6431634,0.0005883717,0.007486933,0.0004527209,0.3250447],"study_design_scores_gemma":[0.0005427437,0.000348096,0.003267602,0.0001978011,0.000003203779,0.00009466883,0.0002086066,0.9895092,0.004187199,0.0001756638,0.0009410117,0.0005242103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0271303,0.00004260946,0.9696283,0.00007104906,0.001717082,0.0002800799,0.000002116747,0.0008865404,0.000241905],"genre_scores_gemma":[0.8248696,0.000004348726,0.1747835,0.0001247966,0.0001408271,0.00002469196,0.000003123478,0.00001192953,0.00003725432],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7977393,"threshold_uncertainty_score":0.9050857,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2059530893","doi":"10.1145/2166879.2166880","title":"Leveraging Core Specialization via OS Scheduling to Improve Performance on Asymmetric Multicore Systems","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Computer Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":43,"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; Speedup; Multi-core processor; Thread (computing); Scheduling (production processes); Workload; Parallel computing; Single-core; Clock rate; Efficient energy use; Energy consumption; Distributed computing; Embedded system; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.03877981864644946,"gpt":0.2666494681676953,"spread":0.2278696495212458,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006611089,0.0003803082,0.0004045711,0.0008896215,0.0005417271,0.0004770502,0.001264089,0.0001637618,0.000002643452],"category_scores_gemma":[0.00002535376,0.0003712821,0.0001167204,0.001431947,0.00002023731,0.0007026809,0.0000627828,0.0003384934,0.0002119221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002932081,"about_ca_system_score_gemma":0.00004538617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000838441,"about_ca_topic_score_gemma":5.639714e-7,"domain_scores_codex":[0.9972866,0.0001709365,0.0006362088,0.000666686,0.0006010011,0.0006386319],"domain_scores_gemma":[0.9975983,0.0002610907,0.0002362865,0.001347463,0.0002492892,0.0003075681],"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.00001391627,0.0002060971,0.0003916531,0.00009795539,0.00004306215,0.000002270385,0.0008488452,0.9245732,0.00008562797,0.0009918017,0.0003766173,0.07236889],"study_design_scores_gemma":[0.0003733923,0.0003374887,0.0007147472,0.0003180756,0.00001301735,0.00004443961,0.00002404618,0.9946347,0.001123102,0.000008913195,0.001966686,0.0004414031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01083705,0.0001292969,0.976136,0.0001107063,0.01048607,0.0009078265,0.00000413308,0.001096019,0.0002928532],"genre_scores_gemma":[0.8332344,0.00001713401,0.165125,0.0002595218,0.001052374,0.0001058485,0.000005651517,0.00003653083,0.0001635052],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8223974,"threshold_uncertainty_score":0.9998739,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2000718212","doi":"10.1145/1880018.1880020","title":"Load Balancing Content-Based Publish/Subscribe Systems","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Computer Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":42,"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; Load balancing (electrical power); PlanetLab; Testbed; Scalability; Distributed computing; Network Load Balancing Services; Quality of service; Computer network; Server; Publication; Load management; Round-robin DNS; The Internet; Operating system; Grid","retraction":null,"screen_n_in":null,"score":{"opus":0.0311989009068941,"gpt":0.2317838798675431,"spread":0.200584978960649,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000909588,0.0004828359,0.0005995278,0.0006051622,0.0004065503,0.001848161,0.004632371,0.0003644363,0.00000664897],"category_scores_gemma":[0.00007591557,0.0004534758,0.0002066775,0.001332357,0.00008524586,0.0009431489,0.0001122241,0.0009659828,0.0003480587],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002609655,"about_ca_system_score_gemma":0.00024968,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007177065,"about_ca_topic_score_gemma":0.0001950207,"domain_scores_codex":[0.996078,0.00016241,0.0007508741,0.001107247,0.001037546,0.0008639925],"domain_scores_gemma":[0.994646,0.0004551389,0.0002155618,0.003744241,0.0005870189,0.000352068],"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.0001227146,0.001688583,0.001791326,0.0007506236,0.0008462379,0.0005046605,0.001869866,0.4228424,0.02053429,0.05159026,0.1067046,0.3907544],"study_design_scores_gemma":[0.001698059,0.0006239174,0.0008507536,0.0005125689,0.00004012654,0.0003660136,0.0001797189,0.8807575,0.003657756,0.0001092947,0.1098462,0.001358108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01182477,0.0001250927,0.9528849,0.003536322,0.02753064,0.0009155576,0.00002329712,0.002894396,0.0002650288],"genre_scores_gemma":[0.889531,0.000002564775,0.108351,0.0006069143,0.0006323807,0.0003195573,0.000004944074,0.00004586807,0.0005058351],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8777062,"threshold_uncertainty_score":0.9997917,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1982078374","doi":"10.1145/1189736.1189737","title":"Specifying memory consistency of write buffer multiprocessors","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Computer Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Consistency model; Cache coherence; Sequential consistency; Write buffer; Parallel computing; Memory model; Consistency (knowledge bases); Scalability; Shared memory; Out-of-order execution; Multiprocessing; Weak consistency; Equivalence (formal languages); Causal consistency; Abstraction; Programming language; Strong consistency; CPU cache; Correctness; Operating system; Cache","retraction":null,"screen_n_in":null,"score":{"opus":0.02920206529287197,"gpt":0.2672635606577219,"spread":0.2380614953648499,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007786175,0.0002310677,0.0003593845,0.0004329882,0.0002279607,0.000120322,0.001280256,0.0001283127,0.000006005117],"category_scores_gemma":[0.0000152933,0.0002243885,0.0001504745,0.0006455273,0.00006751582,0.0003120255,0.00003983071,0.0002358829,0.00002624503],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006088552,"about_ca_system_score_gemma":0.00005383069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000874835,"about_ca_topic_score_gemma":0.000006774579,"domain_scores_codex":[0.9979588,0.0001037484,0.0006991861,0.0004866509,0.0004057755,0.000345847],"domain_scores_gemma":[0.9977698,0.0004357099,0.0002397429,0.001149348,0.0002794309,0.0001260102],"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.0000953001,0.001228189,0.0005078886,0.0006670032,0.0003635148,0.0001116449,0.005406896,0.4847915,0.001240638,0.01354861,0.002771746,0.4892671],"study_design_scores_gemma":[0.001769623,0.000689003,0.001648717,0.0008067783,0.00004141455,0.0002690752,0.0002262775,0.9518289,0.03547521,0.0005369126,0.005580589,0.001127479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002931913,0.0002276559,0.9923697,0.0001272482,0.00208157,0.0003005303,0.000003270919,0.0007168188,0.00124133],"genre_scores_gemma":[0.6857643,0.00002048683,0.3137116,0.0001144098,0.0001457839,0.000009351115,0.00000125357,0.00001506405,0.0002177912],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6828323,"threshold_uncertainty_score":0.9150296,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2077733196","doi":"10.1145/1925109.1925111","title":"SnowFlock","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Computer Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":33,"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":"Division of Computer and Network Systems; Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Computer science; Cloud computing; Distributed computing; Virtual machine; Virtualization; Operating system; Cloning (programming); Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.03675574327674103,"gpt":0.218568661286748,"spread":0.181812918010007,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002452299,0.0002085763,0.0002102943,0.0002212599,0.0002638911,0.0001652849,0.001904115,0.00007076425,0.00001603506],"category_scores_gemma":[0.000002237328,0.0001839347,0.0001385682,0.0004182856,0.00002820275,0.00003320065,0.00007153938,0.0001968465,0.0003966264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004825366,"about_ca_system_score_gemma":0.00001945861,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001556279,"about_ca_topic_score_gemma":0.000003636302,"domain_scores_codex":[0.9983893,0.0001179419,0.0003152445,0.0005236879,0.0003129395,0.0003409064],"domain_scores_gemma":[0.9979749,0.00008753496,0.00008287873,0.001664483,0.00005976776,0.0001303797],"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.00002945293,0.001326688,0.0001761559,0.0001604908,0.0004840228,0.0002085129,0.008733911,0.1856113,0.0000243489,0.03600034,0.01253405,0.7547107],"study_design_scores_gemma":[0.0006990056,0.0005652248,0.001208035,0.0001611623,0.00002537289,0.0001490006,0.00008539357,0.9566709,0.0003292554,0.0006455906,0.03885223,0.000608832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00742736,0.00006054422,0.9817399,0.0003168932,0.005362416,0.0002368181,0.00000108326,0.000740618,0.004114376],"genre_scores_gemma":[0.9267437,0.000002021177,0.07125516,0.0003004475,0.0003349618,0.00003197001,2.916349e-7,0.00001753525,0.001313847],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9193164,"threshold_uncertainty_score":0.7500641,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1988220683","doi":"10.1145/2699682","title":"ISA Wars","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Computer Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":31,"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":"x86; Computer science; ARM architecture; Embedded system; Efficient energy use; Operating system; Server; Reduced instruction set computing; Instruction set; Software; Computer hardware; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0458146379857923,"gpt":0.2677970939450829,"spread":0.2219824559592906,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003831321,0.0001947519,0.0002266709,0.0002364214,0.0001643644,0.0003320906,0.00154098,0.00009663028,0.00000267844],"category_scores_gemma":[0.00001021182,0.0001831972,0.00009128486,0.0004885976,0.00002720115,0.0003806546,0.00004126056,0.0001910422,0.0002076551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009056913,"about_ca_system_score_gemma":0.00008693327,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007107892,"about_ca_topic_score_gemma":0.000001713677,"domain_scores_codex":[0.9984015,0.0001651661,0.0003263946,0.0004497937,0.0003778771,0.0002792709],"domain_scores_gemma":[0.998079,0.0001157162,0.00009143889,0.001307165,0.0001885484,0.0002181383],"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.00001342654,0.0002928634,0.00004952935,0.00002878764,0.00008021391,0.00003320704,0.00149169,0.821374,0.00001054049,0.009695349,0.04869374,0.1182367],"study_design_scores_gemma":[0.0004664181,0.0002934173,0.0000329266,0.00006088354,0.000006044379,0.0001058254,0.00002033962,0.9597661,0.0003135525,0.0007586355,0.03786505,0.0003107752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002480819,0.0001050448,0.9917922,0.0006799175,0.004094768,0.0002202929,0.000002219641,0.001673664,0.001183807],"genre_scores_gemma":[0.4264971,0.00001352234,0.5717185,0.0005076419,0.0003371836,0.00004597619,0.000002683376,0.00002112293,0.0008562493],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.426249,"threshold_uncertainty_score":0.7470566,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967420911","doi":"10.1145/2699683","title":"Energy-Oriented Partial Desktop Virtual Machine Migration","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Computer Systems","topic":"Cloud Computing and Resource Management","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; Operating system; Virtual machine; Computer network; Server; Scheduling (production processes); Context switch; Idle; Embedded system","retraction":null,"screen_n_in":null,"score":{"opus":0.02168213848845911,"gpt":0.2270547819452201,"spread":0.205372643456761,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004081014,0.0002571886,0.0002574184,0.0002412104,0.0002539371,0.0002904916,0.001093079,0.00009137328,0.00000291294],"category_scores_gemma":[0.000006647976,0.0002291536,0.0001288873,0.0005578213,0.00003320365,0.00006262229,0.00007552415,0.0001811747,0.00009289016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001263051,"about_ca_system_score_gemma":0.00005469066,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006194221,"about_ca_topic_score_gemma":0.00004724399,"domain_scores_codex":[0.997816,0.000223497,0.0004323481,0.0005930282,0.000580684,0.0003545026],"domain_scores_gemma":[0.9980996,0.0001178383,0.0001247187,0.00126634,0.000135839,0.0002557193],"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.00003773927,0.0004621648,0.0000736501,0.0000189761,0.0001483923,0.00004566908,0.001677314,0.6346688,0.00002647389,0.01348378,0.00527984,0.3440772],"study_design_scores_gemma":[0.0007017771,0.0004713401,0.00003407528,0.00004790342,0.00001481365,0.00004746824,0.00005676282,0.9140913,0.0002509425,0.00008050734,0.08394739,0.0002557343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01576607,0.0001251978,0.9748601,0.001117133,0.007073171,0.0001830125,0.00000398607,0.0006278341,0.0002434368],"genre_scores_gemma":[0.9839208,0.000003221138,0.01378971,0.000339315,0.000707523,0.00004508658,0.00000573279,0.00001971153,0.00116896],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9681547,"threshold_uncertainty_score":0.9344612,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1993356916","doi":"10.1145/367742.367747","title":"Accelerating shared virtual memory via general-purpose network interface support","year":2001,"lang":"en","type":"article","venue":"ACM Transactions on Computer Systems","topic":"Advanced Data Storage Technologies","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":"","keywords":"Computer science; Asynchronous communication; Distributed shared memory; Polling; Shared memory; Distributed computing; Interface (matter); Overhead (engineering); Protocol (science); Cache coherence; Network interface; Embedded system; Software; Cache; Computer network; Operating system; Memory management; CPU cache; Overlay; Uniform memory access","retraction":null,"screen_n_in":null,"score":{"opus":0.03383171766731335,"gpt":0.2650948084156319,"spread":0.2312630907483185,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003207407,0.0004196345,0.0004603567,0.0002585466,0.0004784251,0.0005397874,0.003299485,0.0002036011,0.00004574519],"category_scores_gemma":[0.00001478337,0.0004147149,0.0001391926,0.0009108266,0.0000791887,0.001631238,0.0002326144,0.0005326237,0.0003127091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000189938,"about_ca_system_score_gemma":0.00005882534,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006896453,"about_ca_topic_score_gemma":0.0000252829,"domain_scores_codex":[0.9970806,0.0001494876,0.0006562839,0.0009644344,0.0004462804,0.0007029516],"domain_scores_gemma":[0.9965677,0.0002410827,0.0002170744,0.002692271,0.0001274959,0.0001543633],"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.00002281143,0.0001555852,0.00003074298,0.00002427804,0.0001017661,0.0001934453,0.0004933557,0.5186138,0.000594271,0.001594441,0.008519066,0.4696564],"study_design_scores_gemma":[0.001035944,0.001031774,0.0001046952,0.0001952283,0.0000264291,0.001094759,0.0001217921,0.9467312,0.002443369,0.0007787644,0.04536773,0.001068364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002972784,0.0001582765,0.9873384,0.0004746091,0.006160511,0.0005353935,0.00001980431,0.002132895,0.0002073525],"genre_scores_gemma":[0.5245963,0.00005244441,0.4723361,0.0004645309,0.0009268579,0.0001796081,0.00002052699,0.0000567942,0.001366883],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5216235,"threshold_uncertainty_score":0.9998305,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010221388","doi":"10.1145/1328671.1328673","title":"Incrementally parallelizing database transactions with thread-level speculation","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Computer Systems","topic":"Distributed systems and fault tolerance","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 Toronto","funders":"","keywords":"Computer science; Speculative multithreading; Parallel computing; Database transaction; Multiprocessing; Programmer; Online transaction processing; Thread (computing); Speculative execution; Transaction processing; Database; Multithreading; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.05971631205217947,"gpt":0.2447571215692621,"spread":0.1850408095170827,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002431031,0.0003665372,0.0003993025,0.0002333055,0.0007664766,0.0002649417,0.001157005,0.0001107683,0.00001992885],"category_scores_gemma":[0.000002016447,0.0003216432,0.0001416958,0.000715519,0.0000736971,0.001189452,0.00001409407,0.0003239437,0.0001263743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001455919,"about_ca_system_score_gemma":0.0001223317,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006044145,"about_ca_topic_score_gemma":0.0001241658,"domain_scores_codex":[0.997339,0.0001503239,0.0005814514,0.000772365,0.0007039802,0.0004528708],"domain_scores_gemma":[0.9976583,0.0001214864,0.0001793614,0.0016503,0.0001812556,0.0002093253],"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.000334672,0.003116157,0.001333648,0.0005827097,0.001470085,0.001172133,0.006617236,0.8452488,0.001484163,0.01966645,0.006732833,0.1122412],"study_design_scores_gemma":[0.007011794,0.00158378,0.00984725,0.001505405,0.0001370151,0.005416567,0.0003645212,0.9249528,0.002085953,0.0001644897,0.04420117,0.002729264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005393692,0.0001188728,0.9906892,0.0003483769,0.001924384,0.000614364,0.0001320134,0.0004673791,0.0003117682],"genre_scores_gemma":[0.8675292,0.00004322325,0.1314238,0.0001564196,0.0002262671,0.0001242928,0.00004011968,0.00002979268,0.0004269704],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8621355,"threshold_uncertainty_score":0.9999236,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4313408232","doi":"10.1145/3576192","title":"Partial Network Partitioning","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Computer Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Huawei Technologies (Canada); Research Canada; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Computer science; Partition (number theory); Distributed computing; Network packet; Fault tolerance; Network partition; Computer network; Overlay network; Operating system; The Internet","retraction":null,"screen_n_in":null,"score":{"opus":0.01928882032283902,"gpt":0.2281816390008174,"spread":0.2088928186779784,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000498639,0.0001959042,0.0002734809,0.00009179176,0.00123562,0.0003748587,0.001462023,0.00004591428,0.00005242485],"category_scores_gemma":[0.000002368651,0.0002074918,0.0001460948,0.0007281661,0.0000217116,0.000334771,0.00007790493,0.0003519213,0.0001090929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001236799,"about_ca_system_score_gemma":0.00006173299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009942775,"about_ca_topic_score_gemma":0.000004751311,"domain_scores_codex":[0.9976563,0.0003383973,0.0004515103,0.0005491178,0.000537937,0.0004666723],"domain_scores_gemma":[0.9982873,0.0001348412,0.0001407233,0.001245945,0.00005967277,0.0001314884],"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.000009579667,0.0001392989,0.00006456445,0.00001604124,0.00005684568,0.000038812,0.0002878167,0.9471589,0.00000761501,0.01589181,0.01474912,0.02157959],"study_design_scores_gemma":[0.0004962384,0.0002887349,0.0001741382,0.00004818564,0.00000945004,0.0001990633,0.00004935791,0.6675459,0.00002517259,0.0002757009,0.3305589,0.0003291859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007767909,0.0001958001,0.9846855,0.0006270132,0.01253972,0.0003170333,0.00003852053,0.0004696273,0.0003499806],"genre_scores_gemma":[0.9854962,0.0000037745,0.01224676,0.0004270646,0.0009135474,0.0004526002,0.00001337301,0.00001839015,0.00042835],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9847193,"threshold_uncertainty_score":0.9503511,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124664738","doi":"10.1145/2669364","title":"Mechanistic Modeling of Architectural Vulnerability Factor","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Computer Systems","topic":"Radiation Effects in Electronics","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Vlaamse regering; Fonds Wetenschappelijk Onderzoek; National Science Foundation","keywords":"Computer science; Microarchitecture; Workload; Reliability (semiconductor); Vulnerability (computing); Superscalar; Reliability engineering; Process (computing); Parametric statistics; Computer architecture; Power (physics); Embedded system; Parallel computing; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.03257481618775224,"gpt":0.2403262052901859,"spread":0.2077513891024337,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001685146,0.0001508291,0.0002268291,0.0001221074,0.00003984096,0.00002712718,0.0002521211,0.00007287911,0.00000460781],"category_scores_gemma":[0.00001357604,0.0001472661,0.00007079451,0.0001587694,0.00001297368,0.00007863665,0.000003045518,0.0002293929,0.00001670919],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001969687,"about_ca_system_score_gemma":0.0000330184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000678288,"about_ca_topic_score_gemma":0.00001305969,"domain_scores_codex":[0.9990255,0.00008740449,0.0002970589,0.0001640532,0.0002235367,0.0002024596],"domain_scores_gemma":[0.9991395,0.0001526755,0.00002944728,0.0005086768,0.00007181698,0.0000978917],"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.00000631522,0.00002116384,0.000001829616,0.00008584844,0.00004941826,5.64367e-7,0.0002965906,0.9887078,0.0001150743,0.0001030016,0.00002055923,0.01059188],"study_design_scores_gemma":[0.0002540723,0.0001330556,0.00000981358,0.00003076811,0.00001239697,0.00001835911,0.00001528244,0.9984982,0.0005345845,0.0002741196,0.00008537059,0.0001339938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1436121,0.0001018351,0.8529623,0.00001343757,0.002705661,0.000222799,0.00001939903,0.0002944573,0.00006804145],"genre_scores_gemma":[0.9934558,0.000001709795,0.00630529,0.000006492423,0.0001593492,0.00002871194,0.000002944415,0.00002850277,0.00001116984],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8498437,"threshold_uncertainty_score":0.6005337,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4414260593","doi":"10.1145/3767334","title":"SuperBench: A Proactive Validation System for Improving Reliability of Cloud AI Infrastructure","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Computer Systems","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Microsoft (Canada)","funders":"","keywords":"Testbed; Cloud computing; Benchmark (surveying); Validator; Reliability (semiconductor); Fault tolerance; Root cause","retraction":null,"screen_n_in":null,"score":{"opus":0.008737100156824773,"gpt":0.2430366704539447,"spread":0.2342995702971199,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008776153,0.0002855792,0.0005310242,0.0003015475,0.0003282016,0.0001755502,0.001201177,0.0002463108,0.000001345184],"category_scores_gemma":[0.00004622605,0.0002383263,0.0002583007,0.0007664955,0.00006443061,0.0006753685,0.00004872258,0.0002688937,0.000005467545],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003784215,"about_ca_system_score_gemma":0.0003025142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002074411,"about_ca_topic_score_gemma":0.000005250609,"domain_scores_codex":[0.9974731,0.0002404127,0.0008534361,0.000755712,0.0003510893,0.0003262358],"domain_scores_gemma":[0.9965851,0.0005611692,0.0002379621,0.001874325,0.0006652563,0.00007621131],"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.0006872669,0.001592738,0.01209909,0.0325093,0.001179017,0.000007446297,0.007404676,0.6236452,0.002762303,0.03618328,0.006535175,0.2753945],"study_design_scores_gemma":[0.002515967,0.0009330572,0.00471758,0.001200581,0.0001594797,0.00005206751,0.0005150369,0.9573158,0.02663489,0.001481628,0.003753668,0.0007202569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0255962,0.00004940762,0.9611426,0.0003040765,0.01049824,0.001885525,0.00005080758,0.0004091377,0.00006403676],"genre_scores_gemma":[0.9519133,0.000001789542,0.04733555,0.00005142594,0.0002436727,0.0003694415,0.000008049802,0.00001338932,0.00006338938],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9263171,"threshold_uncertainty_score":0.9718666,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4413060570","doi":"10.1145/3749283","title":"Lining up Garbage Collection and Application for a Far-Memory-Friendly Runtime","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Computer Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":0,"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; Garbage collection; Memory footprint; Flat memory model; Garbage; Physical address; Interleaved memory; Memory map; Memory management; Distributed shared memory; Uniform memory access; Latency (audio); Registered memory; Distributed memory; Shared memory; Operating system; Overlay","retraction":null,"screen_n_in":null,"score":{"opus":0.01002745258094431,"gpt":0.2419621482925572,"spread":0.2319346957116129,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003911989,0.0001964907,0.0002448024,0.0003466229,0.0006543171,0.000322131,0.0006866946,0.00009306008,6.710222e-7],"category_scores_gemma":[0.000008305597,0.0001944902,0.0001020465,0.0006506647,0.00003095615,0.0000372812,0.00006110343,0.0001523919,0.00001116977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000870332,"about_ca_system_score_gemma":0.00004199084,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001154605,"about_ca_topic_score_gemma":0.00001138023,"domain_scores_codex":[0.9984812,0.00008313498,0.0003559953,0.0006334624,0.0001828567,0.0002634065],"domain_scores_gemma":[0.9985282,0.0003243283,0.0001079417,0.0008721679,0.0001021493,0.00006521383],"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.00003970515,0.0001993339,0.00003945941,0.0003089018,0.000233207,0.000002425754,0.001328747,0.1643561,0.000118641,0.009120171,0.004557723,0.8196957],"study_design_scores_gemma":[0.0008174001,0.0002039469,0.00028225,0.0001261071,0.00003069912,0.00001365092,0.00008807956,0.9654835,0.0001492884,0.0002130511,0.03239807,0.0001939647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007526184,0.0001519896,0.9856725,0.001001336,0.003734581,0.0009923789,0.000002848285,0.0004526493,0.0004655169],"genre_scores_gemma":[0.9421244,0.00000826239,0.05129196,0.000400841,0.0002946449,0.0004474633,0.000002848762,0.00001982752,0.005409712],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9345983,"threshold_uncertainty_score":0.7931082,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4415960475","doi":"10.1145/3768140","title":"Introduction to the Special Section on EuroSys 2024","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Computer Systems","topic":"Scientific Measurement and Uncertainty Evaluation","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Special section; Section (typography); Calculus (dental); Term (time)","retraction":null,"screen_n_in":null,"score":{"opus":0.1266716346130623,"gpt":0.3610497217628968,"spread":0.2343780871498346,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00472664,0.0001650162,0.000203841,0.0007372346,0.0006921047,0.0008909767,0.0009296261,0.00007340254,0.0005606093],"category_scores_gemma":[0.0003994392,0.0001056855,0.0001390784,0.002189739,0.00003333919,0.0001766096,0.00001581199,0.0002417859,0.002122643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001914444,"about_ca_system_score_gemma":0.00007409991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004742343,"about_ca_topic_score_gemma":0.0001779115,"domain_scores_codex":[0.9960019,0.0006214415,0.0006088801,0.0007615806,0.001790961,0.0002152446],"domain_scores_gemma":[0.9971862,0.0006542208,0.0001175754,0.001471524,0.0004996865,0.00007072779],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006754529,0.00006415711,0.00002116853,0.000003140286,0.00002249177,3.576098e-7,0.0003461321,0.1844182,0.0001218995,0.0005094772,0.6949471,0.1194784],"study_design_scores_gemma":[0.0003030082,0.0002164316,0.001501609,0.00004826077,0.00002602558,0.000004995361,0.0003845411,0.03458451,0.0004446244,0.00055167,0.9618008,0.0001335125],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007674475,0.00001270105,0.7916218,0.02431101,0.171995,0.0007679251,0.000008373866,0.00007293553,0.003535766],"genre_scores_gemma":[0.7691681,0.000005438376,0.001068717,0.002140092,0.07826494,0.0002284395,0.00001057564,0.00002438134,0.1490893],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7905531,"threshold_uncertainty_score":0.9986543,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}