{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":17,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":17,"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","author_layer_release":"2026-06-26"},"query_hash":"1973db5d87c0","filters":{"venue":"Proceedings of the ACM on Measurement and Analysis of Computing Systems"}},"results":[{"id":"W4237357939","doi":"10.1145/3447382","title":"A Look Behind the Curtain: Traffic Classification in an Increasingly Encrypted Web","year":2021,"lang":"en","type":"article","venue":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":65,"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":"","keywords":"Encryption; Computer science; Traffic classification; Feature engineering; Convolutional neural network; Robustness (evolution); Data mining; Provisioning; Artificial intelligence; Header; The Internet; Machine learning; Deep learning; Computer network; World Wide Web","authors":[{"name":"Iman Akbari","is_ca":true},{"name":"Mohammad A. Salahuddin","is_ca":true},{"name":"Leni Ven","is_ca":true},{"name":"Noura Limam","is_ca":true},{"name":"Raouf Boutaba","is_ca":true},{"name":"Bertrand Mathieu","is_ca":false},{"name":"Stéphanie Moteau","is_ca":false},{"name":"Stéphane Tuffin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04126571160893806,"gpt":0.2544348556843851,"spread":0.2131691440754471,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003674307,0.0001899151,0.0005742265,0.0003762934,0.0001810433,0.0002945835,0.001908141,0.00006978406,0.000001271804],"category_scores_gemma":[0.0006611218,0.0001207852,0.000274713,0.001730568,0.00007605051,0.0001942912,0.0003642135,0.0002095313,4.392028e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000810407,"about_ca_system_score_gemma":0.00007883618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002822182,"about_ca_topic_score_gemma":0.00009445783,"domain_scores_codex":[0.9972278,0.0001556852,0.0008306997,0.0004816373,0.001068646,0.0002354748],"domain_scores_gemma":[0.9973891,0.0001402972,0.0008256161,0.0004961132,0.001096218,0.00005262241],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001197291,0.002034952,0.2425545,0.0009070634,0.00688011,0.000006047519,0.0478474,0.268256,0.1085528,0.3008769,0.0007347158,0.02122979],"study_design_scores_gemma":[0.0002301018,0.00005002259,0.02453155,0.000351517,0.0004306734,0.000002828922,0.002130662,0.971418,0.0006825383,0.00001982388,0.00002238624,0.0001299486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.996758,0.0003794912,0.001589498,0.0007849481,0.0001009437,0.000161149,9.290826e-7,0.00003106055,0.0001939235],"genre_scores_gemma":[0.9992769,0.000009925619,0.0005810524,0.00005190539,0.00005428885,0.000002778901,0.000001856028,0.000007508174,0.00001372116],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7031619,"threshold_uncertainty_score":0.4925476,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2951258124","doi":"10.1145/3084460","title":"Optimal Posted Prices for Online Cloud Resource Allocation","year":2017,"lang":"en","type":"article","venue":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":29,"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":"National Natural Science Foundation of China","keywords":"Cloud computing; Resource (disambiguation); Renting; Resource allocation; Computer science; Function (biology); Resource management (computing); Microeconomics; Environmental economics; Operations research; Distributed computing; Economics; Mathematics; Computer network; Operating system; Engineering","authors":[{"name":"Zijun Zhang","is_ca":true},{"name":"Zongpeng Li","is_ca":true},{"name":"Chuan Wu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04488046066421576,"gpt":0.2710387409588013,"spread":0.2261582802945855,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002566593,0.0001803651,0.0005026222,0.0002676568,0.0005826355,0.0003346996,0.003597709,0.0000516903,1.195428e-7],"category_scores_gemma":[0.0009438521,0.000126519,0.0002717729,0.0004165729,0.00008174955,0.0000339327,0.001352025,0.00009194179,1.627798e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004648489,"about_ca_system_score_gemma":0.00001654569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005742242,"about_ca_topic_score_gemma":0.000002321005,"domain_scores_codex":[0.9978834,0.00002219961,0.0005747739,0.0004221989,0.000871442,0.0002259744],"domain_scores_gemma":[0.9964892,0.0001095934,0.001589376,0.00100262,0.0007568889,0.0000523638],"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.0003949779,0.002101302,0.1131644,0.004690329,0.01667065,0.000001067898,0.01099293,0.6021454,0.05022957,0.1165792,0.008158432,0.07487172],"study_design_scores_gemma":[0.0005405826,0.0001783483,0.04768982,0.0006686891,0.0007364742,9.941044e-7,0.0003728281,0.946492,0.00228439,0.0001254663,0.0007105855,0.0001998762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9898183,0.0001903207,0.00639026,0.002559569,0.0002188979,0.0004085254,0.000002805175,0.00005261405,0.0003587055],"genre_scores_gemma":[0.9922288,0.000002066509,0.007494451,0.000039932,0.0001460118,0.000004058611,0.000001037574,0.000008513908,0.00007510098],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3443466,"threshold_uncertainty_score":0.6685499,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3033124768","doi":"10.1145/3366708","title":"Demystifying Complex Workload-DRAM Interactions","year":2019,"lang":"en","type":"article","venue":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":29,"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":"VMware; Semiconductor Research Corporation; National Science Foundation","keywords":"Dram; Computer science; Workload; Dynamic random-access memory; Embedded system; Universal memory; Locality; Key (lock); Parallel computing; Memory management; Computer hardware; Operating system; Semiconductor memory; Interleaved memory","authors":[{"name":"Saugata Ghose","is_ca":false},{"name":"Tianshi Li","is_ca":false},{"name":"Nastaran Hajinazar","is_ca":true},{"name":"Damla Senol Cali","is_ca":false},{"name":"Onur Mutlu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05631712929586027,"gpt":0.2804748909063884,"spread":0.2241577616105281,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001451183,0.0001635437,0.0005168015,0.0004640662,0.0001586665,0.000162628,0.001813256,0.00004145202,0.000001885916],"category_scores_gemma":[0.0003084072,0.0001214765,0.000223051,0.001463745,0.00003967219,0.0001608896,0.0007122115,0.0001381462,0.000001676369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005762932,"about_ca_system_score_gemma":0.00001956361,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000301293,"about_ca_topic_score_gemma":8.187826e-7,"domain_scores_codex":[0.9980925,0.00003914197,0.0005900456,0.0003475463,0.0007433961,0.0001874198],"domain_scores_gemma":[0.9977322,0.0001287758,0.0008242336,0.0005412005,0.0007271824,0.00004636737],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006490457,0.0005895318,0.5547081,0.001244034,0.005526902,3.555843e-7,0.004650339,0.2334757,0.1106539,0.06840264,0.004925411,0.01575826],"study_design_scores_gemma":[0.0002154864,0.00006650883,0.03277957,0.0008697977,0.0002578215,0.000002202099,0.0001460984,0.961045,0.003877723,0.0003797235,0.0001741996,0.0001858194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8672644,0.0003799883,0.124993,0.001296729,0.0004757583,0.0005560351,0.000001697084,0.0002929829,0.004739372],"genre_scores_gemma":[0.9800573,0.000009537865,0.01978588,0.00005098673,0.00002705322,0.000002486532,4.847871e-7,0.000006818618,0.00005948539],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7275693,"threshold_uncertainty_score":0.495367,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3082773235","doi":"10.1145/3392156","title":"Staleness Control for Edge Data Analytics","year":2020,"lang":"en","type":"article","venue":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","topic":"Age of Information Optimization","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Austrian Science Fund","keywords":"Computer science; Analytics; Distributed computing; Generality; Overhead (engineering); Synchronization (alternating current); Enhanced Data Rates for GSM Evolution; Data analysis; Edge computing; Data synchronization; Data modeling; Edge device; Real-time computing; Data science; Data mining; Wireless sensor network; Computer network; Database; Artificial intelligence; Cloud computing","authors":[{"name":"Atakan Aral","is_ca":false},{"name":"Melike Erol‐Kantarci","is_ca":true},{"name":"Ivona Brandić","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09909636978250341,"gpt":0.2650699645050925,"spread":0.165973594722589,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001673939,0.0001134672,0.0003952376,0.0002145021,0.0001071661,0.0001394152,0.002761111,0.00002817078,2.792122e-7],"category_scores_gemma":[0.001532241,0.00008268478,0.0001127709,0.001127713,0.00003151205,0.0003643251,0.0006597553,0.00004992211,2.39589e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002387757,"about_ca_system_score_gemma":0.00003217241,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003180583,"about_ca_topic_score_gemma":2.009178e-7,"domain_scores_codex":[0.9983219,0.00001385338,0.0005638332,0.0002598412,0.0007187951,0.0001217649],"domain_scores_gemma":[0.9973175,0.00008968922,0.0008714962,0.0005667396,0.001091661,0.00006292123],"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.0002030663,0.0002105551,0.07918795,0.003314269,0.006707487,1.799031e-7,0.005920046,0.8029611,0.008111066,0.0782691,0.009276427,0.005838742],"study_design_scores_gemma":[0.0003576691,0.00004489432,0.002136657,0.0001195524,0.0004907038,1.240528e-7,0.0001417616,0.9958894,0.0005524562,0.00004742244,0.0001343201,0.00008502734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03966501,0.0001909693,0.9553734,0.003763173,0.0001339236,0.0005674221,0.00002877793,0.00005682773,0.0002205052],"genre_scores_gemma":[0.9914888,0.000005259554,0.008288132,0.0001546591,0.00004554956,0.0000023408,0.000004820236,0.000004667834,0.000005833883],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9518237,"threshold_uncertainty_score":0.5130876,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4389628379","doi":"10.1145/3626790","title":"A Large Scale Study and Classification of VirusTotal Reports on Phishing and Malware URLs","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","topic":"Spam and Phishing Detection","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":"University of Alberta","funders":"","keywords":"Phishing; Malware; Computer science; Computer security; Classifier (UML); World Wide Web; Artificial intelligence; The Internet","authors":[{"name":"Euijin Choo","is_ca":true},{"name":"Mohamed Nabeel","is_ca":false},{"name":"Doowon Kim","is_ca":false},{"name":"Ravindu De Silva","is_ca":false},{"name":"Ting Yu","is_ca":false},{"name":"Issa Khalil","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04809515265651458,"gpt":0.2658897913176593,"spread":0.2177946386611447,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003486636,0.0001192796,0.0003921752,0.0004255546,0.0001725071,0.0001222221,0.0003992691,0.00004171651,1.432515e-7],"category_scores_gemma":[0.0004755606,0.00008932185,0.00008010998,0.00120944,0.00003534488,0.0001495908,0.0003625664,0.00009030677,1.32982e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002516302,"about_ca_system_score_gemma":0.000009471913,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004748243,"about_ca_topic_score_gemma":0.000007523402,"domain_scores_codex":[0.9981687,0.00003919955,0.0005017937,0.0003637666,0.0007956923,0.0001308341],"domain_scores_gemma":[0.9983891,0.00007918257,0.0007857932,0.0003473847,0.0003595965,0.00003890344],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00003977884,0.0002863178,0.9057496,0.000512647,0.000929612,8.520426e-7,0.01284895,0.0007338057,0.07446596,0.001052148,0.0002703998,0.003109891],"study_design_scores_gemma":[0.0003646137,0.000325846,0.8123959,0.0005625869,0.0004801446,0.000004621219,0.002900153,0.178434,0.004131499,0.0002364276,0.00001759543,0.0001465621],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9988073,0.000105684,0.0003597913,0.0001875755,0.0001348978,0.0002574915,0.000001401166,0.0000445836,0.0001012741],"genre_scores_gemma":[0.9998101,0.000007343403,0.0001259724,0.000007658501,0.00002783557,0.000004006857,4.356405e-7,0.000005484516,0.00001116842],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1777002,"threshold_uncertainty_score":0.3642439,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4322756634","doi":"10.1145/3579445","title":"DaeMon: Architectural Support for Efficient Data Movement in Fully Disaggregated Systems","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","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":"University of Toronto","funders":"","keywords":"Computer science; Daemon; Scalability; Distributed computing; Computer network; Operating system","authors":[{"name":"Christina Giannoula","is_ca":true},{"name":"Kailong Huang","is_ca":true},{"name":"Jonathan Tang","is_ca":true},{"name":"Nectarios Koziris","is_ca":false},{"name":"Georgios Goumas","is_ca":false},{"name":"Zeshan Chishti","is_ca":false},{"name":"Nandita Vijaykumar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06772248920691136,"gpt":0.2901426903970796,"spread":0.2224202011901682,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004543716,0.0001998626,0.0006230355,0.0007649031,0.0001427432,0.0001766627,0.003288666,0.00005237081,1.520018e-7],"category_scores_gemma":[0.0006776591,0.0001445075,0.0001469123,0.002429333,0.00004981373,0.00008717322,0.001550817,0.0001009792,3.807236e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006749133,"about_ca_system_score_gemma":0.00003836194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008194856,"about_ca_topic_score_gemma":0.000002643872,"domain_scores_codex":[0.9972279,0.00004846376,0.0008604061,0.0005636884,0.0009888044,0.0003107121],"domain_scores_gemma":[0.9974655,0.0001631822,0.0008056363,0.0009692956,0.0005421343,0.00005424546],"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.00004410048,0.0001822218,0.03229378,0.000899409,0.0009946581,5.514528e-7,0.00151264,0.9471961,0.004632324,0.007194221,0.002370079,0.002679903],"study_design_scores_gemma":[0.000332791,0.00009294564,0.009199432,0.0005298652,0.0001489717,9.468899e-7,0.0001506974,0.988084,0.001147568,0.0001129722,0.0000481637,0.000151646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8802262,0.0003892809,0.1157515,0.0009496183,0.0005290415,0.001477283,0.00003040875,0.0003835349,0.0002632114],"genre_scores_gemma":[0.9959272,0.00000879095,0.00392742,0.00002433974,0.00003477444,0.00001544677,0.00001287858,0.00001002408,0.00003909721],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1157011,"threshold_uncertainty_score":0.6111214,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4405364446","doi":"10.1145/3700434","title":"PyGim : An Efficient Graph Neural Network Library for Real Processing-In-Memory Architectures","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","topic":"Advanced Graph Neural Networks","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":"Vector Institute; University of Toronto","funders":"","keywords":"Computer science; Bottleneck; Parallel computing; Exploit; Memory model; Computer architecture; Distributed computing; Shared memory; Embedded system","authors":[{"name":"Christina Giannoula","is_ca":true},{"name":"Ivan Fernandez","is_ca":false},{"name":"Jiacheng Yang","is_ca":true},{"name":"Sankeerth Durvasula","is_ca":true},{"name":"Yu Xin Li","is_ca":true},{"name":"Mohammad Sadrosadati","is_ca":false},{"name":"Juan Gómez-Luna","is_ca":false},{"name":"Onur Mutlu","is_ca":false},{"name":"Gennady Pekhimenko","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02534536365896695,"gpt":0.2558282325192865,"spread":0.2304828688603196,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001314006,0.0002381496,0.0005550411,0.0005822764,0.0001880171,0.0002933767,0.001756015,0.00006040431,1.545476e-7],"category_scores_gemma":[0.0001014178,0.0001625591,0.0002953605,0.002812702,0.00008898728,0.0002042465,0.0004559327,0.0001992458,5.312481e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002592487,"about_ca_system_score_gemma":0.00002783164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001115272,"about_ca_topic_score_gemma":0.000003564326,"domain_scores_codex":[0.9976303,0.00004247126,0.0006379142,0.0005905054,0.0007368522,0.0003619401],"domain_scores_gemma":[0.9987221,0.0001447511,0.0004218111,0.0004266142,0.0002109339,0.00007379306],"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.00005788396,0.00009388499,0.01567582,0.0008726814,0.0003150013,8.83063e-7,0.001258318,0.9539201,0.00219641,0.007172967,0.0002894699,0.01814659],"study_design_scores_gemma":[0.0001802841,0.0001502529,0.01363494,0.001022571,0.0002338323,0.000002451451,0.00008178502,0.9816493,0.0006744078,0.0021713,0.00002169005,0.0001772167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9863439,0.002922985,0.008770259,0.000559241,0.0004201053,0.0005826716,0.000003160108,0.0002272808,0.0001703869],"genre_scores_gemma":[0.9943944,0.00001223963,0.005347416,0.00004049447,0.0001628083,0.00001297738,0.000001325091,0.00001971243,0.000008629735],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02772917,"threshold_uncertainty_score":0.6628967,"prediction_status":"machine_predicted_unvalidated"},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"bench_or_experimental","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"not_applicable","genre":"software","about_ca_system":false,"about_ca_topic":false,"confidence":"medium"}],"label_agreement":"split"},{"id":"W3127327396","doi":"10.1145/3379483","title":"User-level Threading","year":2020,"lang":"en","type":"article","venue":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","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":"University of Waterloo","funders":"","keywords":"Computer science; Threading (protein sequence); Concurrency; Thread (computing); Scalability; Multithreading; POSIX Threads; Server; Concurrent object-oriented programming; Programming paradigm; Benchmark (surveying); Software; Distributed computing; Parallel computing; Operating system; Programming language; Reactive programming; Inductive programming","authors":[{"name":"Martin Karsten","is_ca":true},{"name":"Saman Barghi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07892585313572882,"gpt":0.2636646684552663,"spread":0.1847388153195375,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001265165,0.0001541007,0.0004960303,0.0002310389,0.0001414381,0.0001317669,0.002106937,0.00004519078,3.163637e-7],"category_scores_gemma":[0.0006875103,0.0001114353,0.0001987507,0.001521826,0.00004122274,0.0001266253,0.0007705897,0.0001073782,3.897136e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002778318,"about_ca_system_score_gemma":0.00002035819,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001818108,"about_ca_topic_score_gemma":2.699777e-7,"domain_scores_codex":[0.9981288,0.00002840704,0.0005283547,0.0003405044,0.0008068043,0.0001671187],"domain_scores_gemma":[0.9981728,0.00006962855,0.0006879518,0.0003647828,0.0006341194,0.00007078045],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001220268,0.0004693432,0.4077752,0.002010202,0.007477697,0.000001064331,0.01434748,0.2169498,0.08680941,0.2363253,0.01533499,0.01237749],"study_design_scores_gemma":[0.0002528713,0.000149097,0.01371313,0.0004129341,0.0003596519,0.000001004788,0.0001330818,0.9665176,0.01776191,0.0003401471,0.000142129,0.0002164085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4712177,0.0005539831,0.5209413,0.004261514,0.0002145147,0.0004608209,0.000003863607,0.0003887495,0.001957618],"genre_scores_gemma":[0.9762587,0.00001036904,0.0235324,0.0001365869,0.00004014694,0.00000154571,3.205375e-7,0.000006452573,0.00001351156],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7495679,"threshold_uncertainty_score":0.4544199,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3107537640","doi":"10.1145/3392142","title":"Mechanism Design for Online Resource Allocation","year":2020,"lang":"en","type":"article","venue":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","topic":"Optimization and Search Problems","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":"University of Toronto","funders":"","keywords":"Knapsack problem; Competitive analysis; Computer science; Valuation (finance); Payment; Incentive compatibility; Mechanism design; Resource allocation; Incentive; Function (biology); Resource (disambiguation); Allocative efficiency; Mathematical optimization; Operations research; Microeconomics; Business; Economics; Mathematics","authors":[{"name":"Xiaoqi Tan","is_ca":true},{"name":"Bo Sun","is_ca":false},{"name":"Alberto Leon‐Garcia","is_ca":true},{"name":"Yuan Wu","is_ca":false},{"name":"Danny H. K. Tsang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1092157094810895,"gpt":0.2737351367538308,"spread":0.1645194272727413,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00182943,0.0001045231,0.0003277579,0.0001669106,0.0001136508,0.00009504476,0.001300578,0.00003433166,3.099964e-7],"category_scores_gemma":[0.0008973583,0.00007545416,0.0001346303,0.001060209,0.00002235014,0.00009314002,0.000303738,0.00006199633,1.687995e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002369962,"about_ca_system_score_gemma":0.0000236922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005179976,"about_ca_topic_score_gemma":2.446942e-7,"domain_scores_codex":[0.9984555,0.00003650706,0.0004193165,0.0002696954,0.0006849677,0.000134025],"domain_scores_gemma":[0.9983125,0.00009640091,0.0004819592,0.0002382324,0.0008080446,0.00006285329],"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.0001567285,0.0004737351,0.003378125,0.001752908,0.003616452,1.269857e-7,0.009158795,0.5121897,0.1944735,0.2598105,0.005181921,0.0098075],"study_design_scores_gemma":[0.000265042,0.0001594124,0.0003031489,0.0001315308,0.000191187,1.735337e-7,0.0001660575,0.989105,0.008937448,0.0005208398,0.0001391074,0.00008101481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03464177,0.000122726,0.9573528,0.00699141,0.00005564686,0.0006745356,0.000003084463,0.00006281302,0.00009518835],"genre_scores_gemma":[0.9461213,0.000006464378,0.05362034,0.0001911683,0.00003513832,0.000005244392,0.000001413594,0.000005873979,0.0000129993],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9114796,"threshold_uncertainty_score":0.3076932,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4408285114","doi":"10.1145/3711701","title":"Learning-Augmented Competitive Algorithms for Spatiotemporal Online Allocation with Deadline Constraints","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","topic":"Optimization and Search Problems","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 Waterloo","funders":"Universitas Brawijaya; VMware","keywords":"Computer science; Algorithm; Artificial intelligence; Distributed computing","authors":[{"name":"Adam Lechowicz","is_ca":false},{"name":"Nicolas Christianson","is_ca":false},{"name":"Bo Sun","is_ca":true},{"name":"Noman Bashir","is_ca":false},{"name":"Mohammad Hajiesmaili","is_ca":false},{"name":"Adam Wierman","is_ca":false},{"name":"Prashant Shenoy","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03685112968071706,"gpt":0.282232683337481,"spread":0.245381553656764,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001536477,0.0001334805,0.0004012273,0.0003839519,0.0001640904,0.00009872221,0.0007945953,0.00003821133,5.296557e-7],"category_scores_gemma":[0.0004833849,0.00009196901,0.0001065885,0.00131329,0.0001087652,0.00009946864,0.0002155726,0.0001018458,7.86327e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005176695,"about_ca_system_score_gemma":0.00006489363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002598494,"about_ca_topic_score_gemma":0.000006085491,"domain_scores_codex":[0.9984429,0.00003843158,0.000468161,0.0002906437,0.0006016574,0.0001582075],"domain_scores_gemma":[0.9971592,0.0001134529,0.0005772783,0.0002230957,0.001890329,0.00003664976],"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.0003402437,0.001695312,0.2965546,0.002896464,0.01206018,4.026335e-7,0.005400287,0.307089,0.02631287,0.2980981,0.0008180992,0.04873445],"study_design_scores_gemma":[0.0008483701,0.0002710573,0.01073152,0.0008012122,0.0003410559,4.625509e-7,0.0006370861,0.9828104,0.00321609,0.0001401399,0.00008786937,0.0001147371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.262201,0.0001769565,0.7314068,0.003781717,0.0001648988,0.00133399,0.00001288849,0.0001037818,0.000817892],"genre_scores_gemma":[0.9761931,0.000009047114,0.02362876,0.00005090702,0.00001503648,0.00000809033,0.000009444743,0.000004684584,0.00008088469],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7139921,"threshold_uncertainty_score":0.3750388,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3112533016","doi":"10.1145/3379478","title":"Third-Party Data Providers Ruin Simple Mechanisms","year":2020,"lang":"en","type":"article","venue":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; United States-Israel Binational Science Foundation","keywords":"Revenue; Common value auction; Microeconomics; Logarithm; Computer science; Constant (computer programming); Fraction (chemistry); Third party; Order (exchange); Disjoint sets; Econometrics; Business; Economics; Mathematics; Finance; Internet privacy","authors":[{"name":"Yang Cai","is_ca":false},{"name":"Federico Echenique","is_ca":false},{"name":"Hu Fu","is_ca":true},{"name":"Katrina Ligett","is_ca":false},{"name":"Adam Wierman","is_ca":false},{"name":"Juba Ziani","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.247893004297847,"gpt":0.3564475979438947,"spread":0.1085545936460477,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006387318,0.0001356597,0.0005486668,0.0001975322,0.0002434664,0.0001777327,0.003255438,0.00004315023,0.000009118656],"category_scores_gemma":[0.00627237,0.00008289686,0.0001792022,0.001938964,0.00009298674,0.000200259,0.001035307,0.000108104,0.000004984696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001654834,"about_ca_system_score_gemma":0.00002631014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000202457,"about_ca_topic_score_gemma":0.000001882227,"domain_scores_codex":[0.996517,0.00006327694,0.0008857932,0.0005250316,0.001865031,0.0001438704],"domain_scores_gemma":[0.9966499,0.0002853487,0.001222544,0.0009088162,0.0008448249,0.00008861902],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003652344,0.0006093828,0.1232152,0.0006956414,0.006778783,3.532496e-7,0.01068766,0.02862992,0.3942645,0.3104504,0.1102006,0.01410229],"study_design_scores_gemma":[0.001217699,0.0003829586,0.02041261,0.0003985055,0.004160007,0.000003084062,0.02552821,0.7785568,0.06019483,0.09883445,0.009526546,0.0007843082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9590183,0.000245086,0.02623588,0.01156914,0.0001857414,0.0008242368,0.00006669452,0.00009071548,0.00176419],"genre_scores_gemma":[0.999069,0.000002723714,0.0006575408,0.0001653605,0.00005601778,0.00000333891,0.000002888303,0.000006193033,0.00003695962],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7499269,"threshold_uncertainty_score":0.7509065,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4411025495","doi":"10.1145/3727120","title":"Online Allocation with Multi-Class Arrivals: Group Fairness vs Individual Welfare","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of Alberta","funders":"Universitas Brawijaya","keywords":"Welfare; Class (philosophy); Max-min fairness; Group (periodic table); Fairness measure; Computer science; Economics; Microeconomics; Resource allocation; Computer network; Artificial intelligence; Telecommunications; Physics","authors":[{"name":"Faraz Zargari","is_ca":true},{"name":"Hossein Nekouyan","is_ca":true},{"name":"Bo Sun","is_ca":true},{"name":"Xiaoqi Tan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03000968975787506,"gpt":0.244798416466304,"spread":0.214788726708429,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006684111,0.000129786,0.0003414818,0.0003789521,0.00009483608,0.0000387462,0.0004009569,0.00004525354,7.268229e-7],"category_scores_gemma":[0.0001113674,0.00009425524,0.00008426582,0.001314445,0.000042519,0.00006091975,0.00003530953,0.0000965928,6.775485e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004156533,"about_ca_system_score_gemma":0.00001082664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000340391,"about_ca_topic_score_gemma":0.00005396257,"domain_scores_codex":[0.9987805,0.000008605771,0.0004763964,0.0001603206,0.0004683458,0.0001058327],"domain_scores_gemma":[0.9989278,0.00002398053,0.00021171,0.0002049596,0.0006103112,0.0000212907],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00007497137,0.000741206,0.5945668,0.003328175,0.01022434,1.233866e-7,0.002894694,0.3175582,0.03381552,0.03317659,0.0003518837,0.00326747],"study_design_scores_gemma":[0.0007563804,0.00005176789,0.8474427,0.0008750831,0.001890837,2.499235e-7,0.002271668,0.1426395,0.003655788,0.00002731407,0.000215798,0.000172903],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9952195,0.0001156375,0.003549843,0.0005385182,0.00009698483,0.0002530179,0.00001803084,0.00007490206,0.0001336044],"genre_scores_gemma":[0.9992346,0.000005357706,0.0006818321,0.00002056153,0.0000127022,0.000007638629,0.00001875166,0.000007813595,0.00001079466],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2528759,"threshold_uncertainty_score":0.3843617,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4389609027","doi":"10.1145/3626780","title":"Kernel vs. User-Level Networking: Don't Throw Out the Stack with the Interrupts","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Universitas Brawijaya","keywords":"Computer science; Linux kernel; Server; Interrupt; Kernel (algebra); Overhead (engineering); Software deployment; Latency (audio); Computer network; Operating system; Embedded system; Asynchronous communication; Distributed computing; Telecommunications","authors":[{"name":"Peter Cai","is_ca":true},{"name":"Martin Karsten","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0767983168861339,"gpt":0.2624284616411261,"spread":0.1856301447549922,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004953492,0.0002451065,0.0005879443,0.0002333775,0.0004773103,0.0004326428,0.003141035,0.00005991334,7.202294e-7],"category_scores_gemma":[0.0001699339,0.0001082994,0.0002890299,0.002042546,0.0001274324,0.000142302,0.0008858397,0.0002323935,0.000002148312],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005805552,"about_ca_system_score_gemma":0.00002838276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001159053,"about_ca_topic_score_gemma":0.00006663842,"domain_scores_codex":[0.9971384,0.0001055675,0.000647099,0.0004248569,0.001339549,0.0003444804],"domain_scores_gemma":[0.9969894,0.0002674137,0.0009984494,0.0008456733,0.0008507383,0.00004827944],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003612486,0.0003895294,0.451561,0.001410161,0.02098153,0.000003279595,0.05568446,0.1916957,0.006640859,0.09335347,0.1688862,0.009032592],"study_design_scores_gemma":[0.000583105,0.0003077821,0.03681296,0.001724531,0.0008834464,0.000008764023,0.004814228,0.948265,0.000969106,0.0002449795,0.004996075,0.0003900971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9540299,0.0006163736,0.02996707,0.01014316,0.00219558,0.001100127,0.000004515371,0.0002326491,0.001710614],"genre_scores_gemma":[0.9991035,0.00001717655,0.00008036346,0.0001437211,0.0002772343,0.00001289331,5.698643e-7,0.00001385799,0.000350704],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7565693,"threshold_uncertainty_score":0.5836878,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4311079977","doi":"10.1145/3570611","title":"Malcolm: Multi-agent Learning for Cooperative Load Management at Rack Scale","year":2022,"lang":"en","type":"article","venue":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","topic":"Cloud Computing and Resource Management","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":"University of Waterloo","funders":"","keywords":"Computer science; Scalability; Server; Load balancing (electrical power); Distributed computing; Latency (audio); Scheduling (production processes); Nash equilibrium; Price of anarchy; Load management; Throughput; Mathematical optimization; Computer network; Operating system; Engineering","authors":[{"name":"Ali Hossein Abbasi Abyaneh","is_ca":true},{"name":"Maizi Liao","is_ca":true},{"name":"Seyed Majid Zahedi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03638996529677906,"gpt":0.2476713601500177,"spread":0.2112813948532386,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003797847,0.0002267587,0.0005736867,0.0003649779,0.0009697417,0.0001217275,0.002164427,0.00002756872,0.00000191168],"category_scores_gemma":[0.0001731627,0.0001746593,0.0003576253,0.001333549,0.00005474103,0.00001831332,0.00395604,0.0001635848,6.728333e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003815685,"about_ca_system_score_gemma":0.00001893446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002824818,"about_ca_topic_score_gemma":0.000002331476,"domain_scores_codex":[0.9968061,0.00008940549,0.0006493722,0.0005829534,0.001558686,0.0003135066],"domain_scores_gemma":[0.9978482,0.0001012606,0.0008653841,0.0005139336,0.0006099715,0.00006130586],"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.00007850418,0.0004194737,0.02946984,0.0007146106,0.003512582,7.318511e-7,0.004817699,0.9460714,0.004139723,0.003784311,0.001873597,0.00511748],"study_design_scores_gemma":[0.001028369,0.0002753035,0.009891488,0.0002445946,0.00083215,0.000002115307,0.002074643,0.9816942,0.001648263,0.00003572448,0.002009976,0.0002632085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9852977,0.0004417261,0.01136001,0.000682948,0.000332341,0.0009751958,0.000002807816,0.00008580794,0.000821501],"genre_scores_gemma":[0.99547,0.000004338407,0.003248503,0.00006404362,0.00003431562,0.00004553341,9.441583e-7,0.00001275795,0.001119555],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03562272,"threshold_uncertainty_score":0.7458568,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3212399093","doi":"10.1145/3491049","title":"Real-time Bidding for Time Constrained Impression Contracts in First and Second Price Auctions - Theory and Algorithms","year":2021,"lang":"en","type":"article","venue":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bidding; Mathematical optimization; Piecewise; Common value auction; Computer science; Function (biology); Duality (order theory); Simple (philosophy); Optimization problem; Constant (computer programming); Mathematical economics; Mathematics; Economics; Microeconomics","authors":[{"name":"Ryan J. Kinnear","is_ca":true},{"name":"Ravi R. Mazumdar","is_ca":true},{"name":"Peter Marbach","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05118127671577748,"gpt":0.3169993287340497,"spread":0.2658180520182722,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007991686,0.000121603,0.0005229167,0.0003168201,0.0003103216,0.0001435615,0.0003407781,0.00005865003,0.00001717993],"category_scores_gemma":[0.004410303,0.00008346605,0.0001125869,0.0009311071,0.0001507525,0.0001277696,0.0002005687,0.00007656081,5.72082e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002427981,"about_ca_system_score_gemma":0.0000262234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006658328,"about_ca_topic_score_gemma":0.000002553418,"domain_scores_codex":[0.9981514,0.0000912494,0.0006901826,0.0003760009,0.000553611,0.0001376178],"domain_scores_gemma":[0.996422,0.001683251,0.0007582971,0.0002552008,0.0008214456,0.00005983095],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002675318,0.000350607,0.02689125,0.0004204555,0.001714804,4.301575e-7,0.004651501,0.002444948,0.9013503,0.04911145,0.001533456,0.01126326],"study_design_scores_gemma":[0.005125651,0.0003941377,0.1981615,0.003206334,0.003361766,0.0000606088,0.02197208,0.5750626,0.093327,0.09569843,0.002466011,0.001163903],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9969616,0.0002540477,0.001019058,0.00059924,0.00005080287,0.0003303245,0.00002309936,0.00001460405,0.0007472503],"genre_scores_gemma":[0.9987847,0.00002120787,0.0008131649,0.00001585216,0.00003434283,0.000009912015,0.000001528754,0.000005696079,0.0003136306],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8080233,"threshold_uncertainty_score":0.5279863,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3121963283","doi":"10.1145/3392152","title":"Optimal Bidding Strategies for Online Ad Auctions with Overlapping Targeting Criteria","year":2020,"lang":"en","type":"article","venue":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of Toronto","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Ontario Centres of Excellence","keywords":"Bidding; Common value auction; Disjoint sets; Mathematical optimization; Upper and lower bounds; Computer science; Value (mathematics); Microeconomics; Operations research; Mathematics; Economics; Discrete mathematics; Machine learning","authors":[{"name":"Erik Tillberg","is_ca":true},{"name":"Peter Marbach","is_ca":true},{"name":"Ravi R. Mazumdar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1525330733160322,"gpt":0.3569821979820529,"spread":0.2044491246660207,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002601543,0.0001344594,0.0004928698,0.0002373762,0.0003557426,0.0002331757,0.0008525645,0.00003406119,0.000004902921],"category_scores_gemma":[0.002227323,0.0000829468,0.0002023436,0.001611306,0.0000950934,0.0001930634,0.0001774675,0.00008761625,4.081314e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002052567,"about_ca_system_score_gemma":0.00003127991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006258895,"about_ca_topic_score_gemma":0.00000109514,"domain_scores_codex":[0.9977726,0.00003139866,0.0007412385,0.0003573091,0.0009530479,0.0001443468],"domain_scores_gemma":[0.9970627,0.0002927001,0.001034047,0.0002283288,0.001321204,0.00006095546],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004582838,0.0003231759,0.01666257,0.0006122343,0.003596133,1.15165e-7,0.009781833,0.3816019,0.5344638,0.04439665,0.003811519,0.004291747],"study_design_scores_gemma":[0.0008866286,0.0004228532,0.01202859,0.0006751537,0.002026723,0.000002515302,0.06907,0.897665,0.01081599,0.003888071,0.002087095,0.0004313564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9619334,0.0001217122,0.03559034,0.001785682,0.00006775847,0.0002930678,0.00002181537,0.00003138651,0.0001548329],"genre_scores_gemma":[0.9927301,0.000002640912,0.007085047,0.00004479446,0.00009999364,0.000007957063,0.000002067469,0.000007713284,0.00001969648],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5236478,"threshold_uncertainty_score":0.3382472,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4389628447","doi":"10.1145/3626787","title":"GuaNary: Efficient Buffer Overflow Detection In Virtualized Clouds Using Intel EPT-based Sub-Page Write Protection Support","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","topic":"Security and Verification in Computing","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":"McGill University","funders":"Engineering and Physical Sciences Research Council; Universitas Brawijaya; Agence Nationale de la Recherche; Microsoft Research","keywords":"Computer science; Buffer overflow; Operating system; Allocator; Virtualization; Guard (computer science); Hypervisor; Memory footprint; Hardware virtualization; Memory leak; Virtual machine; Embedded system; Cloud computing; Memory management; Overlay","authors":[{"name":"Stella Bitchebe","is_ca":true},{"name":"Yves Kone","is_ca":false},{"name":"Pierre Olivier","is_ca":false},{"name":"Yérom-David Bromberg","is_ca":false},{"name":"Daniel Hagimont","is_ca":false},{"name":"Alain Tchana","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06688120345663011,"gpt":0.2732601271727245,"spread":0.2063789237160944,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004742128,0.000201584,0.0005234417,0.001071506,0.0002441928,0.0001551208,0.001092308,0.00008987921,6.535605e-7],"category_scores_gemma":[0.0007714881,0.000169163,0.0002380308,0.004282582,0.00005943516,0.0001182241,0.0004054371,0.0001995205,0.000001163425],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000191557,"about_ca_system_score_gemma":0.00004862153,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001498333,"about_ca_topic_score_gemma":0.000006337012,"domain_scores_codex":[0.9971822,0.0001008536,0.0008395978,0.0004935647,0.001110067,0.0002737127],"domain_scores_gemma":[0.9978665,0.0001215249,0.0008553094,0.0004863984,0.0006201387,0.00005010534],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001263408,0.0003267576,0.0365759,0.0008810043,0.0007251086,9.646793e-7,0.003505673,0.3672931,0.5813302,0.002619287,0.00006172554,0.006553924],"study_design_scores_gemma":[0.0004052905,0.00009602207,0.01715836,0.0004843513,0.0001464419,0.000001450764,0.0002580768,0.9300313,0.05118133,0.00007184485,0.00001142042,0.0001540905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9496309,0.00004786121,0.04920523,0.0001705403,0.0003618522,0.0004311326,0.000001344353,0.0001120677,0.00003914245],"genre_scores_gemma":[0.9990855,0.00000309284,0.0008187855,0.00002540022,0.00004247006,0.00000942818,0.000001048036,0.00001069732,0.000003604969],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5627382,"threshold_uncertainty_score":0.6898269,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}