{"meta":{"query_hash":"1973db5d87c0","filters":{"venue":"Proceedings of the ACM on Measurement and Analysis of Computing Systems"},"cohort_total":17,"direct_labels_cover":1,"predictions_cover":17,"exported":17,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/1973db5d87c0","api":"https://metacan.xera.ac/api/v1/cohort?venue=Proceedings+of+the+ACM+on+Measurement+and+Analysis+of+Computing+Systems"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04488046066421576,"score_gpt":0.27103874095880126,"score_spread":0.2261582802945855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951258124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9898183,0.0001903207,0.00639026,0.0025595694,0.00021889785,0.00040852543,0.0000028051752,0.000052614047,0.00035870547],"genre_scores_gemma":[0.9922288,0.0000020665093,0.007494451,0.000039932,0.00014601176,0.0000040586106,0.0000010375741,0.000008513908,0.00007510098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788344,0.000022199612,0.0005747739,0.00042219888,0.000871442,0.00022597439],"domain_scores_gemma":[0.99648917,0.000109593355,0.0015893755,0.0010026203,0.00075688894,0.0000523638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025665925,0.00018036508,0.0005026222,0.00026765678,0.0005826355,0.00033469964,0.0035977094,0.0000516903,1.1954282e-7],"category_scores_gemma":[0.0009438521,0.00012651896,0.00027177294,0.00041657288,0.00008174955,0.000033932698,0.001352025,0.000091941794,1.6277981e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039497792,0.0021013017,0.11316438,0.004690329,0.016670652,0.0000010678978,0.010992935,0.6021454,0.050229568,0.11657925,0.008158432,0.07487172],"study_design_scores_gemma":[0.0005405826,0.00017834829,0.04768982,0.00066868914,0.00073647423,9.941044e-7,0.00037282807,0.94649196,0.0022843904,0.00012546634,0.0007105855,0.00019987617],"about_ca_topic_score_codex":0.000057422418,"about_ca_topic_score_gemma":0.0000023210048,"teacher_disagreement_score":0.34434655,"about_ca_system_score_codex":0.00004648489,"about_ca_system_score_gemma":0.000016545691,"threshold_uncertainty_score":0.6685499},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.056317129295860274,"score_gpt":0.2804748909063884,"score_spread":0.2241577616105281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033124768","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8672644,0.00037998825,0.12499302,0.0012967286,0.00047575825,0.0005560351,0.0000016970839,0.00029298288,0.004739372],"genre_scores_gemma":[0.9800573,0.000009537865,0.019785875,0.00005098673,0.000027053216,0.0000024865321,4.8478705e-7,0.000006818618,0.00005948539],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980925,0.000039141967,0.00059004565,0.00034754627,0.00074339606,0.00018741985],"domain_scores_gemma":[0.9977322,0.00012877576,0.0008242336,0.00054120045,0.0007271824,0.00004636737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014511826,0.00016354371,0.0005168015,0.0004640662,0.00015866649,0.00016262801,0.0018132564,0.00004145202,0.0000018859159],"category_scores_gemma":[0.0003084072,0.00012147654,0.000223051,0.0014637453,0.000039672188,0.0001608896,0.0007122115,0.00013814618,0.0000016763695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006490457,0.0005895318,0.55470806,0.0012440336,0.005526902,3.5558432e-7,0.0046503386,0.2334757,0.11065387,0.06840264,0.004925411,0.015758265],"study_design_scores_gemma":[0.00021548638,0.00006650883,0.032779567,0.0008697977,0.00025782155,0.0000022020995,0.00014609843,0.961045,0.0038777227,0.00037972347,0.00017419955,0.00018581943],"about_ca_topic_score_codex":0.0000301293,"about_ca_topic_score_gemma":8.187826e-7,"teacher_disagreement_score":0.72756934,"about_ca_system_score_codex":0.00005762932,"about_ca_system_score_gemma":0.000019563608,"threshold_uncertainty_score":0.49536696},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09909636978250341,"score_gpt":0.26506996450509246,"score_spread":0.16597359472258905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082773235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039665014,0.00019096928,0.9553734,0.0037631732,0.00013392365,0.0005674221,0.000028777931,0.000056827732,0.0002205052],"genre_scores_gemma":[0.99148875,0.000005259554,0.008288132,0.00015465914,0.00004554956,0.0000023407997,0.0000048202364,0.0000046678338,0.000005833883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983219,0.000013853384,0.00056383316,0.00025984115,0.0007187951,0.000121764926],"domain_scores_gemma":[0.9973175,0.000089689216,0.0008714962,0.00056673965,0.0010916609,0.00006292123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016739387,0.00011346724,0.00039523764,0.00021450208,0.000107166125,0.00013941516,0.0027611107,0.000028170782,2.7921223e-7],"category_scores_gemma":[0.0015322411,0.00008268478,0.00011277085,0.0011277132,0.000031512052,0.00036432513,0.00065975526,0.00004992211,2.3958896e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020306626,0.00021055505,0.07918795,0.003314269,0.006707487,1.7990313e-7,0.0059200455,0.8029611,0.008111066,0.0782691,0.009276427,0.0058387415],"study_design_scores_gemma":[0.00035766905,0.00004489432,0.0021366565,0.00011955237,0.0004907038,1.2405278e-7,0.0001417616,0.9958894,0.00055245624,0.00004742244,0.00013432009,0.000085027335],"about_ca_topic_score_codex":0.0000031805828,"about_ca_topic_score_gemma":2.0091778e-7,"teacher_disagreement_score":0.9518237,"about_ca_system_score_codex":0.000023877568,"about_ca_system_score_gemma":0.00003217241,"threshold_uncertainty_score":0.51308763},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.10921570948108951,"score_gpt":0.2737351367538308,"score_spread":0.16451942727274133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107537640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034641765,0.00012272598,0.9573528,0.0069914097,0.000055646862,0.0006745356,0.0000030844628,0.00006281302,0.00009518835],"genre_scores_gemma":[0.94612134,0.0000064643777,0.05362034,0.00019116826,0.000035138317,0.0000052443925,0.0000014135942,0.000005873979,0.000012999296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845546,0.000036507055,0.00041931646,0.00026969536,0.0006849677,0.00013402503],"domain_scores_gemma":[0.99831253,0.00009640091,0.00048195917,0.0002382324,0.0008080446,0.000062853294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018294305,0.00010452309,0.00032775788,0.00016691063,0.00011365081,0.000095044765,0.0013005777,0.000034331664,3.099964e-7],"category_scores_gemma":[0.00089735835,0.00007545416,0.0001346303,0.0010602094,0.000022350143,0.00009314002,0.00030373802,0.00006199633,1.6879953e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015672846,0.00047373507,0.0033781254,0.0017529075,0.0036164522,1.2698567e-7,0.009158795,0.51218975,0.19447346,0.2598105,0.005181921,0.0098075],"study_design_scores_gemma":[0.00026504198,0.00015941238,0.00030314893,0.00013153079,0.000191187,1.7353366e-7,0.0001660575,0.98910505,0.008937448,0.00052083976,0.00013910745,0.00008101481],"about_ca_topic_score_codex":0.0000051799757,"about_ca_topic_score_gemma":2.446942e-7,"teacher_disagreement_score":0.9114796,"about_ca_system_score_codex":0.000023699618,"about_ca_system_score_gemma":0.000023692202,"threshold_uncertainty_score":0.30769315},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.247893004297847,"score_gpt":0.3564475979438947,"score_spread":0.10855459364604769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112533016","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9590183,0.000245086,0.026235878,0.011569139,0.00018574142,0.00082423683,0.00006669452,0.00009071548,0.0017641897],"genre_scores_gemma":[0.999069,0.0000027237143,0.0006575408,0.00016536053,0.00005601778,0.0000033389103,0.0000028883032,0.0000061930327,0.000036959616],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996517,0.00006327694,0.0008857932,0.0005250316,0.0018650312,0.00014387042],"domain_scores_gemma":[0.99664986,0.00028534868,0.001222544,0.00090881623,0.0008448249,0.00008861902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006387318,0.00013565973,0.00054866675,0.00019753221,0.00024346638,0.00017773271,0.0032554378,0.000043150227,0.000009118656],"category_scores_gemma":[0.0062723695,0.00008289686,0.0001792022,0.0019389642,0.00009298674,0.00020025896,0.0010353067,0.00010810395,0.0000049846963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036523442,0.0006093828,0.123215176,0.0006956414,0.0067787827,3.5324965e-7,0.010687657,0.028629921,0.39426452,0.31045043,0.11020061,0.014102293],"study_design_scores_gemma":[0.0012176988,0.00038295865,0.020412609,0.00039850554,0.0041600075,0.0000030840617,0.02552821,0.7785568,0.060194828,0.09883445,0.009526546,0.00078430824],"about_ca_topic_score_codex":0.000020245698,"about_ca_topic_score_gemma":0.0000018822266,"teacher_disagreement_score":0.74992687,"about_ca_system_score_codex":0.000016548336,"about_ca_system_score_gemma":0.00002631014,"threshold_uncertainty_score":0.7509065},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.1525330733160322,"score_gpt":0.3569821979820529,"score_spread":0.2044491246660207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121963283","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96193343,0.000121712204,0.035590336,0.0017856822,0.00006775847,0.00029306777,0.000021815365,0.00003138651,0.00015483292],"genre_scores_gemma":[0.9927301,0.0000026409123,0.007085047,0.00004479446,0.00009999364,0.000007957063,0.0000020674693,0.000007713284,0.000019696476],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777263,0.00003139866,0.00074123853,0.00035730912,0.0009530479,0.00014434679],"domain_scores_gemma":[0.99706274,0.00029270013,0.001034047,0.0002283288,0.001321204,0.000060955463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026015425,0.00013445939,0.0004928698,0.00023737621,0.0003557426,0.00023317566,0.0008525645,0.00003406119,0.0000049029213],"category_scores_gemma":[0.0022273231,0.0000829468,0.00020234357,0.0016113057,0.000095093405,0.0001930634,0.00017746749,0.00008761625,4.081314e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004582838,0.00032317586,0.016662568,0.0006122343,0.003596133,1.1516497e-7,0.009781833,0.38160193,0.5344638,0.044396654,0.0038115187,0.004291747],"study_design_scores_gemma":[0.00088662864,0.00042285322,0.01202859,0.0006751537,0.0020267235,0.0000025153017,0.069070004,0.897665,0.010815991,0.003888071,0.0020870946,0.00043135643],"about_ca_topic_score_codex":0.000006258895,"about_ca_topic_score_gemma":0.00000109514,"teacher_disagreement_score":0.5236478,"about_ca_system_score_codex":0.000020525673,"about_ca_system_score_gemma":0.000031279913,"threshold_uncertainty_score":0.33824724},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07892585313572882,"score_gpt":0.26366466845526626,"score_spread":0.18473881531953745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127327396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4712177,0.00055398315,0.52094126,0.0042615137,0.00021451473,0.00046082088,0.000003863607,0.00038874953,0.001957618],"genre_scores_gemma":[0.9762587,0.000010369037,0.023532402,0.00013658691,0.000040146937,0.00000154571,3.2053754e-7,0.000006452573,0.000013511563],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812883,0.00002840704,0.00052835466,0.00034050443,0.00080680434,0.00016711868],"domain_scores_gemma":[0.99817276,0.00006962855,0.0006879518,0.00036478275,0.0006341194,0.00007078045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012651648,0.00015410071,0.0004960303,0.00023103891,0.00014143805,0.00013176691,0.0021069369,0.00004519078,3.163637e-7],"category_scores_gemma":[0.0006875103,0.00011143528,0.0001987507,0.0015218257,0.000041222742,0.00012662527,0.0007705897,0.00010737819,3.8971365e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012202684,0.00046934318,0.4077752,0.0020102023,0.0074776975,0.0000010643311,0.014347477,0.21694978,0.08680941,0.23632534,0.015334989,0.012377487],"study_design_scores_gemma":[0.0002528713,0.00014909705,0.01371313,0.0004129341,0.00035965192,0.0000010047878,0.00013308179,0.9665176,0.01776191,0.00034014712,0.00014212896,0.00021640847],"about_ca_topic_score_codex":0.000018181077,"about_ca_topic_score_gemma":2.699777e-7,"teacher_disagreement_score":0.74956787,"about_ca_system_score_codex":0.00002778318,"about_ca_system_score_gemma":0.000020358191,"threshold_uncertainty_score":0.45441988},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.05118127671577748,"score_gpt":0.31699932873404973,"score_spread":0.26581805201827224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212399093","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9969616,0.00025404766,0.0010190576,0.00059923995,0.00005080287,0.0003303245,0.00002309936,0.0000146040475,0.00074725033],"genre_scores_gemma":[0.99878466,0.00002120787,0.0008131649,0.000015852162,0.00003434283,0.000009912015,0.0000015287541,0.000005696079,0.00031363056],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815136,0.0000912494,0.0006901826,0.0003760009,0.000553611,0.00013761784],"domain_scores_gemma":[0.996422,0.0016832508,0.0007582971,0.0002552008,0.0008214456,0.000059830945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007991686,0.000121602956,0.0005229167,0.00031682008,0.00031032157,0.0001435615,0.00034077815,0.00005865003,0.000017179927],"category_scores_gemma":[0.004410303,0.000083466046,0.000112586866,0.00093110715,0.00015075254,0.00012776957,0.00020056865,0.000076560806,5.72082e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026753175,0.00035060698,0.026891248,0.00042045553,0.0017148036,4.3015746e-7,0.004651501,0.0024449483,0.9013503,0.04911145,0.0015334556,0.01126326],"study_design_scores_gemma":[0.005125651,0.00039413766,0.19816147,0.0032063336,0.0033617655,0.0000606088,0.021972079,0.57506263,0.093327,0.09569843,0.002466011,0.0011639027],"about_ca_topic_score_codex":0.0000066583284,"about_ca_topic_score_gemma":0.0000025534177,"teacher_disagreement_score":0.80802333,"about_ca_system_score_codex":0.000024279807,"about_ca_system_score_gemma":0.000026223399,"threshold_uncertainty_score":0.52798635},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.041265711608938056,"score_gpt":0.2544348556843851,"score_spread":0.21316914407544707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237357939","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99675804,0.00037949122,0.0015894977,0.00078494806,0.000100943675,0.00016114896,9.290826e-7,0.00003106055,0.00019392351],"genre_scores_gemma":[0.99927694,0.000009925619,0.00058105245,0.000051905386,0.000054288852,0.0000027789008,0.0000018560276,0.000007508174,0.000013721156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722785,0.0001556852,0.00083069975,0.00048163734,0.0010686464,0.0002354748],"domain_scores_gemma":[0.99738914,0.00014029715,0.0008256161,0.0004961132,0.0010962179,0.000052622407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036743067,0.00018991508,0.00057422655,0.00037629338,0.00018104329,0.00029458353,0.0019081413,0.00006978406,0.0000012718037],"category_scores_gemma":[0.0006611218,0.000120785175,0.00027471303,0.0017305678,0.00007605051,0.0001942912,0.00036421354,0.00020953125,4.392028e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011972912,0.0020349524,0.24255446,0.0009070634,0.0068801097,0.0000060475195,0.047847398,0.26825604,0.108552754,0.30087695,0.00073471584,0.021229789],"study_design_scores_gemma":[0.00023010181,0.00005002259,0.024531545,0.00035151697,0.00043067345,0.0000028289223,0.0021306619,0.97141796,0.00068253826,0.000019823883,0.000022386237,0.00012994865],"about_ca_topic_score_codex":0.000028221823,"about_ca_topic_score_gemma":0.00009445783,"teacher_disagreement_score":0.7031619,"about_ca_system_score_codex":0.0000810407,"about_ca_system_score_gemma":0.00007883618,"threshold_uncertainty_score":0.49254763},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03638996529677906,"score_gpt":0.2476713601500177,"score_spread":0.21128139485323863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311079977","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9852977,0.00044172612,0.011360012,0.00068294804,0.00033234098,0.0009751958,0.0000028078164,0.000085807944,0.00082150096],"genre_scores_gemma":[0.99547,0.000004338407,0.0032485032,0.00006404362,0.00003431562,0.000045533412,9.4415833e-7,0.000012757952,0.0011195554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968061,0.00008940549,0.00064937223,0.00058295345,0.0015586859,0.00031350664],"domain_scores_gemma":[0.99784815,0.00010126059,0.0008653841,0.0005139336,0.0006099715,0.00006130586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037978466,0.00022675873,0.00057368673,0.00036497792,0.0009697417,0.000121727455,0.0021644267,0.000027568723,0.00000191168],"category_scores_gemma":[0.00017316274,0.0001746593,0.0003576253,0.0013335488,0.000054741035,0.000018313322,0.00395604,0.00016358476,6.728333e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007850418,0.0004194737,0.029469842,0.00071461056,0.0035125823,7.318511e-7,0.0048176986,0.94607145,0.004139723,0.0037843105,0.0018735968,0.0051174797],"study_design_scores_gemma":[0.0010283692,0.00027530352,0.009891488,0.00024459456,0.00083215,0.000002115307,0.002074643,0.98169416,0.0016482626,0.000035724475,0.0020099762,0.00026320852],"about_ca_topic_score_codex":0.000028248181,"about_ca_topic_score_gemma":0.0000023314765,"teacher_disagreement_score":0.035622716,"about_ca_system_score_codex":0.0003815685,"about_ca_system_score_gemma":0.000018934457,"threshold_uncertainty_score":0.74585676},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Daemon; Scalability; Distributed computing; Computer network; Operating system","score_opus":0.06772248920691136,"score_gpt":0.2901426903970796,"score_spread":0.2224202011901682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322756634","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8802262,0.00038928087,0.11575145,0.00094961835,0.00052904146,0.0014772827,0.000030408753,0.00038353493,0.00026321143],"genre_scores_gemma":[0.9959272,0.00000879095,0.0039274204,0.000024339735,0.000034774443,0.000015446773,0.000012878584,0.000010024083,0.000039097213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972279,0.00004846376,0.0008604061,0.0005636884,0.0009888044,0.0003107121],"domain_scores_gemma":[0.9974655,0.00016318222,0.00080563634,0.00096929556,0.0005421343,0.00005424546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004543716,0.00019986255,0.0006230355,0.00076490315,0.00014274317,0.00017666268,0.0032886658,0.00005237081,1.5200182e-7],"category_scores_gemma":[0.00067765906,0.00014450755,0.00014691227,0.002429333,0.00004981373,0.00008717322,0.0015508167,0.00010097915,3.8072358e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044100485,0.00018222182,0.032293778,0.000899409,0.0009946581,5.5145284e-7,0.0015126403,0.9471961,0.0046323244,0.007194221,0.0023700793,0.0026799033],"study_design_scores_gemma":[0.00033279095,0.00009294564,0.009199432,0.0005298652,0.00014897171,9.468899e-7,0.00015069736,0.988084,0.001147568,0.000112972244,0.000048163703,0.00015164602],"about_ca_topic_score_codex":0.00008194856,"about_ca_topic_score_gemma":0.0000026438722,"teacher_disagreement_score":0.115701064,"about_ca_system_score_codex":0.00006749133,"about_ca_system_score_gemma":0.000038361937,"threshold_uncertainty_score":0.61112136},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0767983168861339,"score_gpt":0.2624284616411261,"score_spread":0.1856301447549922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389609027","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9540299,0.0006163736,0.02996707,0.010143164,0.0021955802,0.0011001275,0.0000045153706,0.00023264911,0.0017106141],"genre_scores_gemma":[0.9991035,0.00001717655,0.00008036346,0.00014372112,0.00027723427,0.000012893314,5.698643e-7,0.000013857986,0.00035070404],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99713844,0.00010556747,0.000647099,0.0004248569,0.0013395488,0.00034448045],"domain_scores_gemma":[0.9969894,0.0002674137,0.0009984494,0.0008456733,0.00085073826,0.00004827944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049534915,0.00024510646,0.00058794435,0.00023337753,0.00047731027,0.0004326428,0.0031410353,0.00005991334,7.202294e-7],"category_scores_gemma":[0.00016993393,0.0001082994,0.00028902994,0.0020425462,0.00012743236,0.00014230197,0.0008858397,0.00023239349,0.0000021483124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036124862,0.0003895294,0.451561,0.0014101614,0.020981528,0.0000032795954,0.055684462,0.19169568,0.006640859,0.09335347,0.1688862,0.009032592],"study_design_scores_gemma":[0.000583105,0.00030778215,0.036812957,0.001724531,0.0008834464,0.000008764023,0.0048142276,0.94826496,0.000969106,0.00024497948,0.004996075,0.00039009715],"about_ca_topic_score_codex":0.0001159053,"about_ca_topic_score_gemma":0.00006663842,"teacher_disagreement_score":0.75656927,"about_ca_system_score_codex":0.00005805552,"about_ca_system_score_gemma":0.000028382763,"threshold_uncertainty_score":0.5836878},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04809515265651458,"score_gpt":0.26588979131765933,"score_spread":0.21779463866114473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389628379","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9988073,0.00010568402,0.00035979127,0.00018757553,0.00013489777,0.0002574915,0.0000014011664,0.0000445836,0.00010127413],"genre_scores_gemma":[0.9998101,0.0000073434026,0.00012597242,0.000007658501,0.000027835573,0.0000040068567,4.3564054e-7,0.0000054845164,0.000011168423],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9981687,0.000039199545,0.0005017937,0.0003637666,0.0007956923,0.00013083407],"domain_scores_gemma":[0.9983891,0.000079182566,0.0007857932,0.00034738475,0.00035959648,0.00003890344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034866359,0.00011927956,0.0003921752,0.00042555455,0.00017250713,0.00012222209,0.00039926913,0.00004171651,1.4325146e-7],"category_scores_gemma":[0.0004755606,0.00008932185,0.00008010998,0.0012094403,0.000035344878,0.00014959076,0.00036256644,0.00009030677,1.3298201e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003977884,0.00028631784,0.9057496,0.000512647,0.000929612,8.520426e-7,0.012848954,0.0007338057,0.07446596,0.0010521477,0.00027039976,0.0031098912],"study_design_scores_gemma":[0.00036461375,0.00032584596,0.81239593,0.00056258694,0.0004801446,0.000004621219,0.002900153,0.17843404,0.004131499,0.00023642762,0.000017595428,0.0001465621],"about_ca_topic_score_codex":0.00004748243,"about_ca_topic_score_gemma":0.0000075234025,"teacher_disagreement_score":0.17770024,"about_ca_system_score_codex":0.000025163019,"about_ca_system_score_gemma":0.0000094719135,"threshold_uncertainty_score":0.36424392},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06688120345663011,"score_gpt":0.2732601271727245,"score_spread":0.2063789237160944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389628447","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94963086,0.00004786121,0.04920523,0.00017054028,0.00036185223,0.0004311326,0.000001344353,0.00011206772,0.00003914245],"genre_scores_gemma":[0.9990855,0.00000309284,0.0008187855,0.000025400223,0.000042470056,0.00000942818,0.0000010480363,0.00001069732,0.0000036049692],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971822,0.00010085356,0.00083959784,0.0004935647,0.0011100675,0.0002737127],"domain_scores_gemma":[0.9978665,0.000121524885,0.00085530936,0.0004863984,0.00062013866,0.000050105336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047421283,0.000201584,0.0005234417,0.0010715061,0.0002441928,0.00015512084,0.0010923076,0.00008987921,6.535605e-7],"category_scores_gemma":[0.00077148806,0.00016916305,0.0002380308,0.0042825816,0.00005943516,0.00011822405,0.00040543705,0.00019952051,0.0000011634254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012634083,0.00032675758,0.036575902,0.00088100426,0.0007251086,9.646793e-7,0.0035056733,0.36729312,0.5813302,0.0026192875,0.00006172554,0.0065539237],"study_design_scores_gemma":[0.00040529054,0.00009602207,0.017158365,0.0004843513,0.00014644186,0.0000014507644,0.00025807676,0.9300313,0.051181328,0.00007184485,0.000011420419,0.00015409049],"about_ca_topic_score_codex":0.00014983327,"about_ca_topic_score_gemma":0.0000063370117,"teacher_disagreement_score":0.5627382,"about_ca_system_score_codex":0.000191557,"about_ca_system_score_gemma":0.00004862153,"threshold_uncertainty_score":0.6898269},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.025345363658966946,"score_gpt":0.25582823251928655,"score_spread":0.2304828688603196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405364446","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9863439,0.0029229852,0.008770259,0.00055924105,0.00042010527,0.0005826716,0.0000031601082,0.00022728076,0.0001703869],"genre_scores_gemma":[0.9943944,0.000012239627,0.005347416,0.00004049447,0.00016280834,0.00001297738,0.000001325091,0.000019712432,0.000008629735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976303,0.000042471256,0.00063791417,0.0005905054,0.0007368522,0.0003619401],"domain_scores_gemma":[0.9987221,0.0001447511,0.0004218111,0.00042661416,0.00021093385,0.00007379306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013140056,0.00023814965,0.00055504113,0.00058227644,0.00018801712,0.00029337668,0.0017560155,0.000060404305,1.5454758e-7],"category_scores_gemma":[0.00010141778,0.00016255908,0.00029536054,0.0028127022,0.00008898728,0.00020424652,0.0004559327,0.0001992458,5.3124808e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057883964,0.00009388499,0.01567582,0.00087268144,0.00031500126,8.8306297e-7,0.0012583178,0.95392007,0.0021964104,0.007172967,0.00028946993,0.018146588],"study_design_scores_gemma":[0.00018028411,0.00015025292,0.013634942,0.0010225713,0.00023383231,0.000002451451,0.000081785016,0.9816493,0.00067440775,0.0021713001,0.000021690048,0.0001772167],"about_ca_topic_score_codex":0.000011152722,"about_ca_topic_score_gemma":0.0000035643259,"teacher_disagreement_score":0.027729174,"about_ca_system_score_codex":0.000025924868,"about_ca_system_score_gemma":0.00002783164,"threshold_uncertainty_score":0.6628967},"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":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Universitas Brawijaya; VMware","keywords":"Computer science; Algorithm; Artificial intelligence; Distributed computing","score_opus":0.036851129680717055,"score_gpt":0.282232683337481,"score_spread":0.24538155365676398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408285114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26220104,0.00017695647,0.7314068,0.0037817173,0.0001648988,0.0013339899,0.0000128884885,0.00010378178,0.00081789197],"genre_scores_gemma":[0.97619313,0.000009047114,0.023628756,0.000050907016,0.000015036482,0.00000809033,0.000009444743,0.000004684584,0.00008088469],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984429,0.00003843158,0.000468161,0.00029064371,0.00060165743,0.00015820753],"domain_scores_gemma":[0.9971592,0.00011345289,0.0005772783,0.0002230957,0.0018903292,0.000036649762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015364774,0.00013348053,0.0004012273,0.00038395193,0.00016409044,0.00009872221,0.0007945953,0.000038211332,5.2965567e-7],"category_scores_gemma":[0.00048338494,0.000091969014,0.00010658846,0.0013132902,0.000108765205,0.00009946864,0.00021557257,0.00010184579,7.86327e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034024366,0.0016953119,0.2965546,0.0028964644,0.012060181,4.0263348e-7,0.005400287,0.30708903,0.026312867,0.2980981,0.00081809924,0.048734445],"study_design_scores_gemma":[0.0008483701,0.00027105727,0.010731516,0.00080121215,0.00034105591,4.6255087e-7,0.00063708605,0.9828104,0.0032160904,0.00014013992,0.00008786937,0.0001147371],"about_ca_topic_score_codex":0.000025984937,"about_ca_topic_score_gemma":0.0000060854913,"teacher_disagreement_score":0.7139921,"about_ca_system_score_codex":0.000051766954,"about_ca_system_score_gemma":0.000064893626,"threshold_uncertainty_score":0.37503877},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.030009689757875057,"score_gpt":0.24479841646630401,"score_spread":0.21478872670842897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411025495","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99521947,0.000115637486,0.0035498433,0.00053851824,0.000096984826,0.0002530179,0.000018030843,0.00007490206,0.00013360444],"genre_scores_gemma":[0.99923456,0.0000053577064,0.00068183214,0.000020561529,0.000012702205,0.000007638629,0.000018751656,0.000007813595,0.0000107946635],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9987805,0.000008605771,0.00047639638,0.00016032057,0.00046834577,0.00010583271],"domain_scores_gemma":[0.9989278,0.000023980532,0.00021171,0.00020495961,0.00061031117,0.000021290696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066841114,0.00012978601,0.00034148185,0.0003789521,0.00009483608,0.000038746202,0.0004009569,0.00004525354,7.2682286e-7],"category_scores_gemma":[0.00011136742,0.00009425524,0.00008426582,0.001314445,0.000042519,0.000060919745,0.00003530953,0.000096592805,6.7754854e-8],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074971365,0.000741206,0.5945668,0.0033281748,0.010224343,1.2338661e-7,0.0028946938,0.3175582,0.033815518,0.033176593,0.00035188367,0.0032674698],"study_design_scores_gemma":[0.00075638044,0.000051767893,0.84744275,0.0008750831,0.0018908371,2.499235e-7,0.002271668,0.14263946,0.003655788,0.000027314067,0.00021579798,0.00017290305],"about_ca_topic_score_codex":0.000034039098,"about_ca_topic_score_gemma":0.00005396257,"teacher_disagreement_score":0.25287592,"about_ca_system_score_codex":0.00004156533,"about_ca_system_score_gemma":0.000010826645,"threshold_uncertainty_score":0.3843617},"labels":[],"label_agreement":null}]}