{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009030479,0.0008940605,0.0004675909,0.001102909,0.0004940757,0.001498933,0.0008624697,0.001183966,0.0005675412],"category_scores_gemma":[0.003486495,0.000223531,0.0004539975,0.0009125925,0.0007729793,0.00294241,0.0008714488,0.001929985,0.0006204294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001035725,"about_ca_system_score_gemma":0.0005117045,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006880007,"about_ca_topic_score_gemma":0.005200786,"domain_scores_codex":[0.9994107,0.0001310165,0.00003042239,0.0001622384,0.0001794061,0.00008621326],"domain_scores_gemma":[0.9988961,0.0003345999,0.0001489095,0.000205597,0.0003468553,0.00006779694],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0007549627,0.0006501666,0.0581613,0.0001555503,0.0001478508,0.0008604469,0.0003273198,0.3495344,0.03332871,0.009433215,0.01736452,0.5292817],"study_design_scores_gemma":[0.000006235191,0.00003750717,0.002408931,0.00001332239,0.00001139331,0.0001389015,0.000066186,0.9834573,0.006960327,0.005587662,0.001301718,0.00001043756],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6442949,0.001051019,0.33871,0.004405459,0.0003131043,0.00009418128,0.0008552333,0.004723293,0.005552799],"genre_scores_gemma":[0.9525113,0.00031616,0.04325226,0.0006163419,0.0001389079,0.00002355091,0.0009672042,0.0001203302,0.002054021],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006880007,"threshold_uncertainty_score":0.01367992,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005469402,0.001617625,0.002175613,0.001139983,0.00104527,0.003359552,0.002731656,0.002354187,0.004611899],"category_scores_gemma":[0.02834164,0.001261153,0.0009336522,0.00130214,0.002273869,0.005241479,0.001739233,0.002388045,0.0006118553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004331578,"about_ca_system_score_gemma":0.003075953,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00328995,"about_ca_topic_score_gemma":0.002291644,"domain_scores_codex":[0.9966946,0.001549683,0.0001336294,0.0003728055,0.000601106,0.0006481542],"domain_scores_gemma":[0.9815777,0.01442449,0.0011542,0.0007256349,0.001182438,0.0009355534],"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.0003013513,0.0002835416,0.0007661124,0.0001397874,0.00005200489,0.0001437386,0.0001043805,0.8753264,0.001871404,0.1004616,0.002002255,0.01854746],"study_design_scores_gemma":[0.00001742191,0.00004133856,0.00008675422,0.000006768288,0.00001005962,0.00001908806,0.00001874455,0.9772319,0.0003091699,0.02187427,0.0003735897,0.00001093377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1287977,0.0009500708,0.8529154,0.001208863,0.0002978639,0.0003117797,0.0002076285,0.0004724282,0.01483829],"genre_scores_gemma":[0.9379153,0.0004511048,0.05555822,0.0001581328,0.0001454842,0.0001631511,0.00009784468,0.0001503171,0.005360406],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005469402,"threshold_uncertainty_score":0.03142792,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009335179,0.000921672,0.000521927,0.001112266,0.000541601,0.001293284,0.0008174852,0.0005762109,0.00239598],"category_scores_gemma":[0.004441581,0.0003988784,0.0004968439,0.0008101047,0.0006994175,0.002080962,0.001044281,0.001536894,0.0003963339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005987376,"about_ca_system_score_gemma":0.0007010217,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002463732,"about_ca_topic_score_gemma":0.002897986,"domain_scores_codex":[0.9986086,0.0003037064,0.00007580295,0.000294626,0.000467633,0.0002496389],"domain_scores_gemma":[0.9964036,0.001993751,0.0004043751,0.0006022208,0.000453475,0.0001426378],"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.001720882,0.001897658,0.1295664,0.001033479,0.0004033085,0.001730218,0.001879029,0.3295885,0.3628445,0.02319084,0.009123554,0.1370216],"study_design_scores_gemma":[0.0000448756,0.0007422125,0.05366025,0.00004861812,0.0001123648,0.0005057006,0.0007996615,0.8719315,0.05643164,0.01014751,0.005482341,0.00009335368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9565513,0.0008299235,0.03532169,0.0003699205,0.00006915636,0.0001427696,0.0008965692,0.001138422,0.004680325],"genre_scores_gemma":[0.9880357,0.0002147229,0.01003329,0.0001125442,0.00003019903,0.00008723501,0.0006580889,0.0001450935,0.0006830927],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002463732,"threshold_uncertainty_score":0.008015394,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001766048,0.0006543622,0.00073799,0.0006651852,0.000634448,0.001258822,0.001716526,0.0005982202,0.001754893],"category_scores_gemma":[0.006846575,0.0003440713,0.0004628611,0.0005347665,0.001337461,0.001999048,0.002362414,0.001939185,0.0003276802],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001055962,"about_ca_system_score_gemma":0.00119182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002627087,"about_ca_topic_score_gemma":0.001997596,"domain_scores_codex":[0.9987363,0.0002661151,0.00007211712,0.0004049455,0.0003619498,0.0001585197],"domain_scores_gemma":[0.9970119,0.001341989,0.0005489163,0.0004811764,0.0004203936,0.0001957259],"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.0004058076,0.0001390287,0.001701618,0.0001255888,0.00005809558,0.0001509281,0.0003082861,0.8025354,0.01272935,0.109831,0.002667292,0.06934758],"study_design_scores_gemma":[0.000009083135,0.00003467834,0.0000788361,0.000003664441,0.000003355428,0.000008695619,0.000007725124,0.9862234,0.001002708,0.0121589,0.0004635022,0.000005561599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02226954,0.0001583683,0.9747425,0.0001890732,0.00004945297,0.00004019386,0.00004402988,0.0005389559,0.001967903],"genre_scores_gemma":[0.9554911,0.0001190262,0.04271785,0.0001482982,0.00003534484,0.00007936194,0.00007823325,0.0000568707,0.001273895],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002627087,"threshold_uncertainty_score":0.009339809,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003241325,0.0004090817,0.0004251552,0.01103485,0.0008195158,0.001302404,0.0005015884,0.0008082345,0.000619451],"category_scores_gemma":[0.01997625,0.000257452,0.0004742418,0.006098134,0.000849365,0.002500161,0.001354581,0.0009403013,0.0008532124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000554295,"about_ca_system_score_gemma":0.0004603546,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004050327,"about_ca_topic_score_gemma":0.005953555,"domain_scores_codex":[0.9959293,0.001067525,0.0004464862,0.0009128785,0.001355913,0.0002877631],"domain_scores_gemma":[0.9579546,0.01727939,0.01275598,0.003606556,0.006796991,0.001606574],"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.0001041071,0.0002146218,0.9592955,0.0002111943,0.000145692,0.0004008707,0.004391697,0.0004054158,0.002856505,0.0002737985,0.002564379,0.02913639],"study_design_scores_gemma":[0.000004972932,0.0001615595,0.9885479,0.00007092267,0.00004380308,0.0007205777,0.00247403,0.003745037,0.001338565,0.0001470369,0.002709028,0.00003651134],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9959003,0.0003165257,0.0008475244,0.00007573208,0.00001881268,0.0000702613,0.002004828,0.00009655752,0.0006695024],"genre_scores_gemma":[0.9916546,0.0002723207,0.002123607,0.00006696203,0.00005754141,0.00007536753,0.005051774,0.0000419407,0.0006558588],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01103485,"threshold_uncertainty_score":0.017142,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001189737,0.0009248529,0.0005187023,0.0005091504,0.0005628252,0.001447122,0.002798507,0.000504012,0.001675501],"category_scores_gemma":[0.003688319,0.0008650561,0.0004487791,0.0004671982,0.0007392404,0.002698566,0.002216137,0.001425941,0.0004959478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007217846,"about_ca_system_score_gemma":0.001985447,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004267393,"about_ca_topic_score_gemma":0.004827525,"domain_scores_codex":[0.998958,0.0001915695,0.0001174098,0.0001725132,0.0003980147,0.0001625615],"domain_scores_gemma":[0.9974508,0.0005383252,0.0002440478,0.001118156,0.000429142,0.0002196277],"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.002184207,0.0009118228,0.03262645,0.001116667,0.0005430417,0.0005404146,0.001573073,0.4298013,0.2243295,0.02325248,0.036205,0.246916],"study_design_scores_gemma":[0.000151319,0.00034948,0.004624253,0.00003505312,0.00006031954,0.0001324849,0.00008193363,0.9421443,0.03104361,0.003302868,0.01800309,0.00007132318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4572512,0.00177591,0.4811354,0.0007032982,0.0003453355,0.0004621858,0.0007198734,0.05090309,0.006703732],"genre_scores_gemma":[0.8387369,0.0003935947,0.1560611,0.000309441,0.00005800408,0.0002024227,0.0009115339,0.001239744,0.002087211],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004267393,"threshold_uncertainty_score":0.008485138,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005711145,0.002116333,0.0007357502,0.001099971,0.0004634826,0.001081029,0.004574954,0.001029458,0.02006195],"category_scores_gemma":[0.002994014,0.001113877,0.001540231,0.001282878,0.0005486839,0.002305907,0.001456494,0.002509244,0.008330466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001301185,"about_ca_system_score_gemma":0.002197566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01091142,"about_ca_topic_score_gemma":0.01959682,"domain_scores_codex":[0.9995831,0.00005818656,0.00003049649,0.00009357011,0.0001756998,0.00005900352],"domain_scores_gemma":[0.9994354,0.0002191574,0.0000553371,0.0001153136,0.0001342205,0.00004062479],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0007348487,0.0003683843,0.004922668,0.003048072,0.0005778768,0.0005966239,0.0003098042,0.3075615,0.01962541,0.02824629,0.2839243,0.3500843],"study_design_scores_gemma":[0.0001433615,0.00006792947,0.0009277136,0.00007211001,0.00004951971,0.0001215257,0.000030675,0.9153718,0.01313176,0.01849501,0.05153197,0.00005669839],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0137833,0.001185657,0.5496829,0.0004396158,0.0002719688,0.0002621684,0.009118283,0.4153,0.009956152],"genre_scores_gemma":[0.1662675,0.001904533,0.7261498,0.001161807,0.00008756957,0.001494367,0.03973888,0.04254032,0.02065522],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02006195,"threshold_uncertainty_score":0.06711388,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003478758,0.0008073101,0.0008118717,0.0003404109,0.0007158745,0.002153506,0.003047768,0.0007164109,0.006725467],"category_scores_gemma":[0.009047232,0.0007616375,0.0008289764,0.0003749362,0.0009845218,0.002862239,0.002510377,0.002272422,0.002132861],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007976328,"about_ca_system_score_gemma":0.001850621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001064013,"about_ca_topic_score_gemma":0.001306293,"domain_scores_codex":[0.9973678,0.0006408059,0.0002546411,0.0005850244,0.0008005179,0.0003512017],"domain_scores_gemma":[0.9930153,0.001396474,0.0003070064,0.003987255,0.00094295,0.0003509776],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.002923322,0.0009198093,0.02150058,0.001105899,0.0003536977,0.0006221495,0.003554639,0.0437668,0.1781543,0.1029445,0.03743102,0.6067232],"study_design_scores_gemma":[0.0002998439,0.0008932097,0.004478594,0.0001671085,0.0002556861,0.0008296165,0.0002234835,0.516051,0.1878806,0.047237,0.2414528,0.0002311249],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05651143,0.0004541167,0.8887262,0.000190917,0.0001925304,0.0004750087,0.0001756718,0.03780475,0.01546938],"genre_scores_gemma":[0.5756847,0.0003358224,0.3905256,0.0005264216,0.0001692744,0.0007324539,0.0007608536,0.00746634,0.02379844],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006725467,"threshold_uncertainty_score":0.02249891,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01106062,0.002164219,0.002945191,0.001448621,0.001094597,0.004456908,0.004705864,0.003766629,0.008476414],"category_scores_gemma":[0.02009818,0.001396804,0.001923562,0.002651615,0.002701499,0.00652244,0.002990381,0.004049574,0.001519644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003140562,"about_ca_system_score_gemma":0.003717586,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009894331,"about_ca_topic_score_gemma":0.0008160461,"domain_scores_codex":[0.988536,0.006959621,0.0005561474,0.001483899,0.001639957,0.000824442],"domain_scores_gemma":[0.9873668,0.009246275,0.001073511,0.001188457,0.0007650314,0.0003599746],"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.0001651973,0.0002209153,0.000262106,0.0006764961,0.0001713312,0.0001811543,0.000130903,0.252552,0.001724813,0.6928656,0.004399282,0.04665019],"study_design_scores_gemma":[0.0001576659,0.0001546204,0.00007779215,0.00008087506,0.00005702478,0.0001686018,0.00003925151,0.6014552,0.0008481334,0.3876946,0.00922719,0.00003904833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003217291,0.0009849321,0.9879878,0.0005246925,0.0001177609,0.0002396723,0.00008540743,0.0002199533,0.006622533],"genre_scores_gemma":[0.4860119,0.003038078,0.4954511,0.00104752,0.0005379821,0.002419777,0.0003261855,0.0001832303,0.01098412],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01106062,"threshold_uncertainty_score":0.05849487,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002563193,0.001901906,0.002866975,0.001072854,0.0009501654,0.002107,0.003670493,0.0025696,0.004287738],"category_scores_gemma":[0.01178895,0.000742309,0.0008426604,0.002334519,0.001512913,0.002766817,0.002052757,0.002532976,0.0008052721],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001990864,"about_ca_system_score_gemma":0.003434679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009734629,"about_ca_topic_score_gemma":0.007777941,"domain_scores_codex":[0.9982511,0.0006317853,0.00009646579,0.0004046436,0.0003387949,0.0002771516],"domain_scores_gemma":[0.9919992,0.005997475,0.0005592026,0.0004348082,0.0006495593,0.0003597761],"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.0001545568,0.0001969871,0.0006090199,0.000148128,0.00005875878,0.00004955333,0.00005973904,0.918707,0.0004474673,0.02457758,0.00300286,0.05198839],"study_design_scores_gemma":[0.00001937737,0.00003206191,0.00003916206,0.000004799017,0.000004176346,0.000009855726,0.000008117954,0.9898168,0.0001005259,0.009519941,0.0004411899,0.000004071513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01582966,0.0007395843,0.9777077,0.0005315898,0.000116501,0.0001262232,0.0001468561,0.0004809852,0.00432087],"genre_scores_gemma":[0.5784683,0.0007250328,0.4129678,0.000687952,0.0003364967,0.0005721087,0.0007176158,0.0002710901,0.005253568],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009734629,"threshold_uncertainty_score":0.01935595,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04723687,0.001701851,0.003600442,0.002043002,0.00252593,0.007572205,0.005610866,0.005745647,0.004880313],"category_scores_gemma":[0.1124276,0.002331041,0.003419029,0.001954639,0.007686611,0.02563807,0.008471069,0.008162975,0.001619774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002787928,"about_ca_system_score_gemma":0.003169778,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006185631,"about_ca_topic_score_gemma":0.0003817227,"domain_scores_codex":[0.9532955,0.02871794,0.002081183,0.003628491,0.009244733,0.003032],"domain_scores_gemma":[0.8011366,0.1223777,0.01680287,0.05126749,0.0057222,0.002693204],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007142075,0.0003144385,0.002534602,0.0005661448,0.0004701784,0.0004716141,0.0005618065,0.06191485,0.004181158,0.8703842,0.001872604,0.05601417],"study_design_scores_gemma":[0.000590776,0.0006765507,0.0008545928,0.0002297718,0.0003117499,0.001127778,0.0002398467,0.2176367,0.007772457,0.752538,0.01788346,0.000138275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1239135,0.002175036,0.8472282,0.005474666,0.0002617303,0.0005254236,0.0001006174,0.0006546745,0.01966623],"genre_scores_gemma":[0.852009,0.001278042,0.1407891,0.0009725511,0.0002926942,0.0004476822,0.00005629834,0.0001197896,0.004034896],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04723687,"threshold_uncertainty_score":0.2498155,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007844454,0.001149394,0.002624801,0.0007988818,0.001361832,0.003050537,0.003978449,0.00267251,0.003215734],"category_scores_gemma":[0.01852221,0.0004892092,0.0008703542,0.001508374,0.001883334,0.00528747,0.001949167,0.002232854,0.0004541748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002692088,"about_ca_system_score_gemma":0.002429503,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002795181,"about_ca_topic_score_gemma":0.001770486,"domain_scores_codex":[0.9958973,0.001777887,0.0001373753,0.0008752523,0.0006257198,0.0006864524],"domain_scores_gemma":[0.9872001,0.008846908,0.001146836,0.00125423,0.0007095486,0.0008423849],"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.0005743296,0.000552355,0.003030776,0.0001571026,0.0001053993,0.000217942,0.000288177,0.8115925,0.002280221,0.1119439,0.003360864,0.06589647],"study_design_scores_gemma":[0.00002760163,0.00005176673,0.000225079,0.000007725311,0.0000100925,0.00004933058,0.00003933929,0.9651905,0.000528009,0.03322041,0.000641047,0.000009043793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04886623,0.0002396861,0.9465274,0.0008318021,0.00008681184,0.0001525254,0.00009636295,0.0001975584,0.003001564],"genre_scores_gemma":[0.8550892,0.0002184259,0.139913,0.0003506423,0.0002068429,0.0002810209,0.0001090135,0.0001471578,0.003684742],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007844454,"threshold_uncertainty_score":0.04148591,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001615475,0.0006580257,0.0005022455,0.0007117877,0.0007009235,0.002421954,0.001539719,0.000445326,0.001424037],"category_scores_gemma":[0.005888679,0.0002938994,0.0002541578,0.0008843944,0.000858903,0.00306247,0.0008662014,0.0007922393,0.0004580135],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001195509,"about_ca_system_score_gemma":0.0007980924,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001593609,"about_ca_topic_score_gemma":0.001498527,"domain_scores_codex":[0.9985003,0.0002126456,0.00008134294,0.0001924806,0.0006519234,0.0003613396],"domain_scores_gemma":[0.9964804,0.001121684,0.000584689,0.0007981894,0.0008147719,0.000200303],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.002542449,0.0006231558,0.06024254,0.001507113,0.0001895879,0.0005167092,0.00176116,0.06206385,0.1696756,0.09554464,0.00518919,0.600144],"study_design_scores_gemma":[0.0001192094,0.005150588,0.07626224,0.0004022238,0.0005064868,0.003372553,0.001299992,0.4824806,0.3143758,0.03713532,0.07856253,0.0003324657],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7257596,0.008870657,0.2277103,0.000721815,0.0002454902,0.0001532964,0.000113518,0.002978396,0.0334469],"genre_scores_gemma":[0.9773946,0.0010924,0.01931617,0.00009562684,0.00008303214,0.00003406524,0.00006275639,0.0002266467,0.001694733],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002421954,"threshold_uncertainty_score":0.008674026,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001092094,0.00101801,0.0009542906,0.00048042,0.0008206145,0.0009106034,0.002301717,0.001380616,0.002783105],"category_scores_gemma":[0.003043395,0.0003703508,0.0004218449,0.0004534923,0.0009535459,0.001426676,0.001971938,0.001530789,0.0005675518],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001105437,"about_ca_system_score_gemma":0.001365762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005322833,"about_ca_topic_score_gemma":0.006711333,"domain_scores_codex":[0.9994796,0.0001559567,0.00001622201,0.0001290341,0.0001232789,0.00009597061],"domain_scores_gemma":[0.9988185,0.000567047,0.0001466876,0.0001692922,0.0001655575,0.0001329323],"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.0001305629,0.0001782737,0.000957038,0.00005801344,0.00005189966,0.00009117679,0.00005594688,0.9228342,0.00199271,0.007218664,0.003333515,0.06309804],"study_design_scores_gemma":[0.00001509086,0.00001819562,0.00004378448,0.000001317802,0.000001968567,0.000005320009,0.000005085667,0.9971734,0.0002646206,0.002016941,0.0004518191,0.000002425742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04550326,0.0003814134,0.9455054,0.000800918,0.0001174068,0.0001674005,0.00008871837,0.002779507,0.004655995],"genre_scores_gemma":[0.7595623,0.0001804769,0.2334488,0.0004513148,0.00009035494,0.0003147793,0.000180008,0.0001620657,0.005609897],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005322833,"threshold_uncertainty_score":0.0105837,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009616321,0.001375354,0.003354604,0.001467095,0.001150797,0.005984495,0.003870749,0.003001616,0.005823042],"category_scores_gemma":[0.02814658,0.001577508,0.002008429,0.002905708,0.003295672,0.008261649,0.002540274,0.00374988,0.0007666335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003939535,"about_ca_system_score_gemma":0.002939212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005197945,"about_ca_topic_score_gemma":0.002955294,"domain_scores_codex":[0.99589,0.002242184,0.0001684833,0.0004278221,0.0007280904,0.0005434518],"domain_scores_gemma":[0.9840685,0.01262339,0.001255264,0.0007361391,0.0007698596,0.0005468696],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001150647,0.0001646689,0.0005602614,0.0001337912,0.00004951525,0.0001027779,0.0001976333,0.6738682,0.0004765986,0.3011913,0.001394776,0.02174544],"study_design_scores_gemma":[0.00002575093,0.00002650595,0.00007752,0.0000126796,0.000006248735,0.00003581261,0.0000414863,0.9070038,0.0001606581,0.09210028,0.0004938939,0.00001543892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02007905,0.000486098,0.9745233,0.0004710942,0.00006099375,0.0001072347,0.00004664634,0.0001036414,0.004121874],"genre_scores_gemma":[0.614819,0.001335751,0.3718151,0.0002562457,0.0001869695,0.0005222294,0.0002189922,0.0002138605,0.01063193],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009616321,"threshold_uncertainty_score":0.05085653,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004761597,0.001463865,0.002448239,0.001204702,0.0007364639,0.004535057,0.002214026,0.001979062,0.002754427],"category_scores_gemma":[0.01909806,0.001155179,0.001114357,0.001469353,0.0015384,0.005731925,0.001797636,0.001603022,0.0005553047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002126432,"about_ca_system_score_gemma":0.001623066,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001180827,"about_ca_topic_score_gemma":0.001017842,"domain_scores_codex":[0.9944208,0.003224193,0.0003057288,0.0004740068,0.0008187924,0.0007565059],"domain_scores_gemma":[0.98971,0.007334551,0.0009240986,0.0005673288,0.0007799737,0.0006840306],"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.0006346711,0.0007854719,0.002650389,0.0003905391,0.0002347668,0.0002215568,0.0005736243,0.7082043,0.006282568,0.2154252,0.002524562,0.0620724],"study_design_scores_gemma":[0.00005230862,0.0001141974,0.0003709952,0.00001849077,0.00002633333,0.0000676891,0.0001400213,0.9015937,0.000805787,0.09607888,0.0007113722,0.00002024875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1754097,0.0004386691,0.8123034,0.0005418878,0.00002815438,0.0003219899,0.000151258,0.0001463077,0.01065867],"genre_scores_gemma":[0.8523341,0.0003423665,0.1430297,0.0001637692,0.00005354895,0.0004196615,0.0001967634,0.00009997195,0.003360123],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004761597,"threshold_uncertainty_score":0.02518201,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001016199,0.001547288,0.0006444108,0.0007975386,0.0007666711,0.001799837,0.003091393,0.0005570146,0.003373865],"category_scores_gemma":[0.003688133,0.0005603734,0.0005195452,0.0005870216,0.001004008,0.003118369,0.003269024,0.001189239,0.001631495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001022771,"about_ca_system_score_gemma":0.002360271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004855016,"about_ca_topic_score_gemma":0.004679932,"domain_scores_codex":[0.9982684,0.0002252769,0.0001446933,0.0002961748,0.0005980135,0.0004674697],"domain_scores_gemma":[0.997871,0.000346385,0.000329564,0.0008694662,0.0003077724,0.000275902],"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.009451689,0.001303901,0.04094002,0.001492305,0.0004938064,0.001118464,0.001252065,0.04952547,0.1925312,0.01811021,0.09883414,0.5849467],"study_design_scores_gemma":[0.0007755073,0.001794523,0.0114087,0.0001864332,0.0003287368,0.0008245755,0.0003504013,0.6121319,0.3053869,0.009404478,0.05705319,0.0003545588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4128812,0.007856739,0.28558,0.0007942266,0.0009641882,0.0007603401,0.00200158,0.2718682,0.01729337],"genre_scores_gemma":[0.918083,0.0005040661,0.0739122,0.0004979209,0.00007435719,0.0001483754,0.001669429,0.002092825,0.003017965],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004855016,"threshold_uncertainty_score":0.01128668,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}