{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1287977,0.0009500708,0.8529154,0.0012088631,0.00029786394,0.0003117797,0.00020762846,0.0004724282,0.0148382895],"genre_scores_gemma":[0.9379153,0.00045110477,0.055558216,0.0001581328,0.00014548424,0.00016315108,0.00009784468,0.00015031714,0.005360406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669456,0.0015496829,0.00013362936,0.00037280546,0.000601106,0.00064815424],"domain_scores_gemma":[0.9815777,0.014424493,0.0011542004,0.0007256349,0.0011824383,0.0009355534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005469402,0.0016176254,0.002175613,0.0011399828,0.0010452699,0.0033595515,0.0027316564,0.002354187,0.0046118987],"category_scores_gemma":[0.028341636,0.0012611528,0.0009336522,0.0013021401,0.0022738685,0.0052414793,0.0017392335,0.0023880452,0.0006118553],"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.00030135128,0.0002835416,0.00076611235,0.00013978737,0.000052004892,0.00014373862,0.00010438048,0.8753264,0.0018714042,0.10046156,0.0020022548,0.018547462],"study_design_scores_gemma":[0.00001742191,0.00004133856,0.00008675422,0.000006768288,0.000010059621,0.000019088058,0.000018744551,0.97723186,0.00030916993,0.021874271,0.00037358975,0.000010933766],"about_ca_topic_score_codex":0.0032899496,"about_ca_topic_score_gemma":0.0022916442,"teacher_disagreement_score":0.005469402,"about_ca_system_score_codex":0.004331578,"about_ca_system_score_gemma":0.003075953,"threshold_uncertainty_score":0.03142792},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95655125,0.0008299235,0.035321686,0.0003699205,0.00006915636,0.00014276961,0.00089656917,0.0011384219,0.004680325],"genre_scores_gemma":[0.98803574,0.00021472287,0.010033289,0.00011254423,0.000030199031,0.00008723501,0.0006580889,0.00014509351,0.0006830927],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860865,0.0003037064,0.00007580295,0.00029462602,0.000467633,0.0002496389],"domain_scores_gemma":[0.9964036,0.0019937507,0.00040437514,0.00060222077,0.00045347505,0.00014263784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009335179,0.00092167204,0.00052192697,0.0011122661,0.00054160104,0.0012932842,0.00081748515,0.0005762109,0.0023959796],"category_scores_gemma":[0.004441581,0.00039887836,0.00049684395,0.0008101047,0.0006994175,0.0020809616,0.001044281,0.0015368939,0.00039633387],"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.0017208816,0.0018976583,0.12956645,0.001033479,0.00040330854,0.0017302177,0.0018790294,0.3295885,0.3628445,0.023190843,0.009123554,0.13702159],"study_design_scores_gemma":[0.000044875604,0.0007422125,0.05366025,0.000048618116,0.000112364774,0.0005057006,0.0007996615,0.8719315,0.056431636,0.010147513,0.005482341,0.00009335368],"about_ca_topic_score_codex":0.0024637324,"about_ca_topic_score_gemma":0.0028979862,"teacher_disagreement_score":0.0024637324,"about_ca_system_score_codex":0.00059873756,"about_ca_system_score_gemma":0.0007010217,"threshold_uncertainty_score":0.008015394},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022269536,0.00015836832,0.97474253,0.0001890732,0.000049452967,0.00004019386,0.000044029875,0.0005389559,0.0019679025],"genre_scores_gemma":[0.9554911,0.00011902622,0.04271785,0.00014829816,0.000035344838,0.00007936194,0.00007823325,0.000056870704,0.0012738949],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987363,0.0002661151,0.00007211712,0.00040494552,0.0003619498,0.00015851966],"domain_scores_gemma":[0.9970119,0.0013419887,0.00054891634,0.00048117642,0.00042039357,0.00019572586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017660478,0.0006543622,0.00073798996,0.00066518516,0.00063444796,0.0012588222,0.0017165256,0.00059822015,0.0017548933],"category_scores_gemma":[0.006846575,0.0003440713,0.00046286115,0.0005347665,0.0013374608,0.0019990478,0.0023624136,0.0019391848,0.00032768017],"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.0004058076,0.00013902874,0.0017016177,0.00012558882,0.000058095582,0.00015092808,0.0003082861,0.8025354,0.01272935,0.10983101,0.0026672918,0.06934758],"study_design_scores_gemma":[0.0000090831345,0.00003467834,0.0000788361,0.0000036644415,0.0000033554281,0.000008695619,0.000007725124,0.9862234,0.0010027084,0.012158898,0.0004635022,0.0000055615988],"about_ca_topic_score_codex":0.0026270873,"about_ca_topic_score_gemma":0.0019975957,"teacher_disagreement_score":0.0026270873,"about_ca_system_score_codex":0.0010559618,"about_ca_system_score_gemma":0.0011918197,"threshold_uncertainty_score":0.009339809},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032172913,0.0009849321,0.98798776,0.00052469247,0.000117760916,0.0002396723,0.00008540743,0.00021995329,0.006622533],"genre_scores_gemma":[0.48601192,0.0030380778,0.49545106,0.0010475197,0.0005379821,0.002419777,0.0003261855,0.00018323027,0.010984118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.988536,0.006959621,0.0005561474,0.0014838993,0.0016399567,0.000824442],"domain_scores_gemma":[0.9873668,0.009246275,0.0010735107,0.0011884567,0.0007650314,0.0003599746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0110606225,0.0021642188,0.0029451908,0.0014486208,0.0010945972,0.0044569084,0.0047058635,0.0037666287,0.008476414],"category_scores_gemma":[0.02009818,0.001396804,0.0019235617,0.002651615,0.0027014986,0.0065224404,0.0029903813,0.0040495736,0.0015196444],"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.0001651973,0.00022091529,0.00026210598,0.00067649607,0.00017133121,0.00018115435,0.00013090296,0.252552,0.0017248132,0.69286555,0.0043992824,0.046650194],"study_design_scores_gemma":[0.00015766594,0.00015462039,0.000077792145,0.00008087506,0.000057024783,0.00016860184,0.00003925151,0.6014552,0.0008481334,0.3876946,0.00922719,0.000039048326],"about_ca_topic_score_codex":0.0009894331,"about_ca_topic_score_gemma":0.00081604614,"teacher_disagreement_score":0.0110606225,"about_ca_system_score_codex":0.0031405615,"about_ca_system_score_gemma":0.003717586,"threshold_uncertainty_score":0.058494866},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123913474,0.0021750357,0.84722817,0.005474666,0.00026173025,0.0005254236,0.000100617435,0.00065467454,0.01966623],"genre_scores_gemma":[0.852009,0.001278042,0.14078906,0.00097255106,0.00029269417,0.00044768222,0.000056298344,0.00011978958,0.0040348964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9532955,0.028717935,0.002081183,0.0036284914,0.009244733,0.003032],"domain_scores_gemma":[0.80113655,0.122377716,0.016802872,0.05126749,0.0057221996,0.0026932044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.047236867,0.0017018513,0.0036004419,0.0020430018,0.0025259303,0.007572205,0.0056108665,0.0057456465,0.004880313],"category_scores_gemma":[0.1124276,0.0023310415,0.0034190286,0.0019546389,0.0076866113,0.025638074,0.008471069,0.008162975,0.0016197737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.0007142075,0.0003144385,0.0025346016,0.0005661448,0.00047017843,0.00047161413,0.0005618065,0.061914854,0.004181158,0.8703842,0.0018726045,0.056014165],"study_design_scores_gemma":[0.000590776,0.00067655067,0.0008545928,0.0002297718,0.00031174993,0.0011277776,0.00023984672,0.21763675,0.007772457,0.75253797,0.017883455,0.000138275],"about_ca_topic_score_codex":0.0006185631,"about_ca_topic_score_gemma":0.00038172273,"teacher_disagreement_score":0.047236867,"about_ca_system_score_codex":0.0027879276,"about_ca_system_score_gemma":0.003169778,"threshold_uncertainty_score":0.24981546},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17540966,0.00043866909,0.8123034,0.0005418878,0.000028154383,0.0003219899,0.000151258,0.00014630775,0.010658668],"genre_scores_gemma":[0.8523341,0.00034236652,0.14302973,0.00016376917,0.000053548953,0.0004196615,0.00019676343,0.00009997195,0.0033601234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944208,0.0032241927,0.00030572875,0.00047400678,0.0008187924,0.0007565059],"domain_scores_gemma":[0.98971003,0.007334551,0.0009240986,0.0005673288,0.0007799737,0.00068403065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004761597,0.0014638647,0.0024482394,0.0012047017,0.00073646393,0.004535057,0.0022140257,0.001979062,0.0027544273],"category_scores_gemma":[0.019098064,0.0011551792,0.0011143569,0.0014693526,0.0015383997,0.0057319254,0.0017976364,0.001603022,0.0005553047],"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.00063467113,0.0007854719,0.002650389,0.0003905391,0.00023476678,0.00022155675,0.00057362433,0.70820427,0.006282568,0.21542521,0.0025245622,0.0620724],"study_design_scores_gemma":[0.000052308624,0.00011419742,0.00037099517,0.000018490775,0.000026333326,0.0000676891,0.00014002132,0.9015937,0.00080578704,0.09607888,0.0007113722,0.000020248754],"about_ca_topic_score_codex":0.0011808269,"about_ca_topic_score_gemma":0.0010178423,"teacher_disagreement_score":0.004761597,"about_ca_system_score_codex":0.0021264318,"about_ca_system_score_gemma":0.0016230659,"threshold_uncertainty_score":0.025182009},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05651143,0.00045411667,0.8887262,0.00019091704,0.00019253042,0.0004750087,0.00017567181,0.03780475,0.015469384],"genre_scores_gemma":[0.5756847,0.00033582238,0.3905256,0.0005264216,0.00016927444,0.0007324539,0.00076085364,0.0074663395,0.023798436],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973678,0.00064080587,0.00025464105,0.00058502436,0.00080051785,0.00035120166],"domain_scores_gemma":[0.9930153,0.0013964736,0.00030700638,0.003987255,0.00094295,0.0003509776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034787578,0.0008073101,0.0008118717,0.00034041086,0.0007158745,0.0021535063,0.0030477685,0.00071641087,0.0067254673],"category_scores_gemma":[0.009047232,0.0007616375,0.0008289764,0.00037493624,0.0009845218,0.0028622388,0.0025103765,0.0022724224,0.0021328614],"study_design_candidate":"not_applicable","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.0029233221,0.00091980933,0.021500584,0.001105899,0.0003536977,0.0006221495,0.003554639,0.0437668,0.17815432,0.102944516,0.037431024,0.60672325],"study_design_scores_gemma":[0.0002998439,0.00089320965,0.0044785943,0.00016710849,0.0002556861,0.0008296165,0.0002234835,0.516051,0.18788056,0.047237,0.24145278,0.00023112494],"about_ca_topic_score_codex":0.0010640135,"about_ca_topic_score_gemma":0.0013062932,"teacher_disagreement_score":0.0067254673,"about_ca_system_score_codex":0.0007976328,"about_ca_system_score_gemma":0.0018506206,"threshold_uncertainty_score":0.022498906},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02007905,0.00048609797,0.9745233,0.00047109424,0.000060993745,0.000107234664,0.000046646335,0.000103641425,0.004121874],"genre_scores_gemma":[0.61481905,0.0013357511,0.37181506,0.00025624566,0.00018696947,0.00052222935,0.00021899217,0.00021386048,0.010631931],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99588996,0.0022421842,0.00016848334,0.00042782206,0.00072809035,0.00054345175],"domain_scores_gemma":[0.98406845,0.01262339,0.0012552639,0.00073613913,0.0007698596,0.00054686965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009616321,0.0013753538,0.0033546044,0.0014670946,0.0011507965,0.0059844954,0.0038707494,0.0030016163,0.0058230422],"category_scores_gemma":[0.028146584,0.0015775077,0.0020084288,0.0029057083,0.0032956724,0.008261649,0.0025402738,0.0037498805,0.00076663354],"study_design_candidate":"theoretical_or_conceptual","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.00011506473,0.00016466895,0.0005602614,0.00013379118,0.000049515253,0.000102777885,0.0001976333,0.6738682,0.0004765986,0.3011913,0.0013947758,0.021745438],"study_design_scores_gemma":[0.000025750935,0.000026505946,0.00007752,0.000012679605,0.0000062487347,0.000035812613,0.000041486303,0.9070038,0.00016065812,0.09210028,0.0004938939,0.000015438918],"about_ca_topic_score_codex":0.0051979446,"about_ca_topic_score_gemma":0.002955294,"teacher_disagreement_score":0.009616321,"about_ca_system_score_codex":0.0039395345,"about_ca_system_score_gemma":0.0029392121,"threshold_uncertainty_score":0.05085653},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6442949,0.0010510193,0.33870998,0.004405459,0.00031310428,0.000094181276,0.0008552333,0.004723293,0.0055527994],"genre_scores_gemma":[0.9525113,0.00031616,0.043252256,0.00061634195,0.00013890791,0.00002355091,0.0009672042,0.000120330165,0.0020540205],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99941075,0.00013101647,0.000030422392,0.00016223844,0.00017940612,0.00008621326],"domain_scores_gemma":[0.9988961,0.0003345999,0.00014890946,0.00020559697,0.00034685526,0.00006779694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009030479,0.0008940605,0.0004675909,0.001102909,0.0004940757,0.0014989333,0.00086246966,0.0011839664,0.0005675412],"category_scores_gemma":[0.0034864945,0.00022353101,0.00045399752,0.00091259246,0.00077297934,0.0029424098,0.0008714488,0.0019299852,0.0006204294],"study_design_candidate":"observational","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.00075496273,0.0006501666,0.058161296,0.00015555025,0.00014785083,0.00086044695,0.00032731984,0.3495344,0.033328712,0.0094332155,0.017364517,0.5292817],"study_design_scores_gemma":[0.0000062351905,0.00003750717,0.0024089315,0.000013322395,0.000011393315,0.00013890147,0.000066186,0.9834573,0.0069603273,0.005587662,0.0013017183,0.000010437559],"about_ca_topic_score_codex":0.0068800068,"about_ca_topic_score_gemma":0.0052007856,"teacher_disagreement_score":0.0068800068,"about_ca_system_score_codex":0.001035725,"about_ca_system_score_gemma":0.0005117045,"threshold_uncertainty_score":0.013679922},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04550326,0.00038141344,0.9455054,0.00080091803,0.000117406824,0.00016740047,0.00008871837,0.002779507,0.004655995],"genre_scores_gemma":[0.75956225,0.00018047694,0.23344879,0.00045131482,0.00009035494,0.0003147793,0.00018000802,0.00016206573,0.005609897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994796,0.00015595672,0.000016222015,0.0001290341,0.00012327889,0.00009597061],"domain_scores_gemma":[0.99881846,0.000567047,0.0001466876,0.0001692922,0.00016555753,0.00013293233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010920942,0.0010180101,0.0009542906,0.00048041996,0.0008206145,0.0009106034,0.0023017172,0.0013806163,0.002783105],"category_scores_gemma":[0.0030433945,0.00037035075,0.00042184486,0.0004534923,0.00095354585,0.0014266764,0.0019719377,0.0015307887,0.00056755176],"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.00013056287,0.00017827372,0.00095703796,0.000058013444,0.000051899664,0.000091176786,0.000055946883,0.9228342,0.0019927104,0.007218664,0.003333515,0.063098036],"study_design_scores_gemma":[0.000015090856,0.000018195618,0.00004378448,0.0000013178022,0.000001968567,0.000005320009,0.0000050856675,0.9971734,0.00026462064,0.0020169413,0.0004518191,0.0000024257424],"about_ca_topic_score_codex":0.005322833,"about_ca_topic_score_gemma":0.0067113326,"teacher_disagreement_score":0.005322833,"about_ca_system_score_codex":0.0011054366,"about_ca_system_score_gemma":0.0013657615,"threshold_uncertainty_score":0.010583699},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45725122,0.0017759098,0.4811354,0.0007032982,0.00034533552,0.00046218577,0.0007198734,0.050903093,0.006703732],"genre_scores_gemma":[0.8387369,0.00039359473,0.15606113,0.000309441,0.000058004083,0.00020242269,0.0009115339,0.001239744,0.0020872105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998958,0.00019156946,0.00011740979,0.00017251325,0.00039801467,0.00016256148],"domain_scores_gemma":[0.99745077,0.0005383252,0.00024404784,0.0011181559,0.00042914198,0.00021962766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011897365,0.0009248529,0.0005187023,0.00050915044,0.00056282524,0.0014471222,0.0027985068,0.00050401204,0.0016755013],"category_scores_gemma":[0.0036883187,0.0008650561,0.0004487791,0.0004671982,0.0007392404,0.0026985658,0.0022161365,0.0014259408,0.0004959478],"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.0021842066,0.0009118228,0.03262645,0.0011166666,0.00054304174,0.0005404146,0.0015730734,0.42980126,0.22432952,0.023252478,0.036205005,0.24691601],"study_design_scores_gemma":[0.00015131898,0.00034947996,0.004624253,0.00003505312,0.000060319537,0.00013248491,0.00008193363,0.94214433,0.031043613,0.0033028685,0.018003091,0.00007132318],"about_ca_topic_score_codex":0.004267393,"about_ca_topic_score_gemma":0.0048275245,"teacher_disagreement_score":0.004267393,"about_ca_system_score_codex":0.0007217846,"about_ca_system_score_gemma":0.0019854465,"threshold_uncertainty_score":0.008485138},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7257596,0.008870657,0.22771028,0.000721815,0.00024549023,0.00015329641,0.00011351797,0.002978396,0.033446904],"genre_scores_gemma":[0.9773946,0.0010923997,0.019316169,0.00009562684,0.000083032144,0.00003406524,0.00006275639,0.00022664672,0.001694733],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99850035,0.00021264558,0.000081342936,0.00019248061,0.0006519234,0.0003613396],"domain_scores_gemma":[0.9964804,0.0011216835,0.00058468897,0.00079818943,0.00081477186,0.00020030297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016154752,0.00065802573,0.0005022455,0.00071178767,0.0007009235,0.002421954,0.0015397194,0.000445326,0.0014240369],"category_scores_gemma":[0.0058886786,0.00029389941,0.00025415784,0.0008843944,0.00085890305,0.0030624704,0.0008662014,0.0007922393,0.0004580135],"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.002542449,0.0006231558,0.060242545,0.0015071129,0.0001895879,0.0005167092,0.00176116,0.06206385,0.16967563,0.095544636,0.00518919,0.60014397],"study_design_scores_gemma":[0.00011920945,0.0051505878,0.076262236,0.00040222376,0.0005064868,0.0033725528,0.0012999924,0.4824806,0.31437585,0.037135318,0.07856253,0.00033246574],"about_ca_topic_score_codex":0.0015936093,"about_ca_topic_score_gemma":0.0014985271,"teacher_disagreement_score":0.002421954,"about_ca_system_score_codex":0.0011955088,"about_ca_system_score_gemma":0.0007980924,"threshold_uncertainty_score":0.008674026},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99590033,0.0003165257,0.00084752444,0.00007573208,0.000018812683,0.000070261296,0.0020048278,0.000096557524,0.00066950236],"genre_scores_gemma":[0.99165463,0.00027232073,0.0021236069,0.00006696203,0.000057541405,0.00007536753,0.0050517735,0.000041940704,0.0006558588],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9959293,0.0010675251,0.00044648623,0.0009128785,0.0013559129,0.0002877631],"domain_scores_gemma":[0.9579546,0.017279394,0.012755983,0.0036065558,0.0067969905,0.0016065737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032413246,0.00040908167,0.00042515525,0.011034845,0.0008195158,0.0013024036,0.0005015884,0.0008082345,0.000619451],"category_scores_gemma":[0.019976253,0.00025745205,0.00047424177,0.006098134,0.000849365,0.002500161,0.0013545809,0.00094030134,0.0008532124],"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.00010410708,0.00021462177,0.95929545,0.00021119426,0.000145692,0.0004008707,0.0043916972,0.0004054158,0.0028565046,0.00027379848,0.0025643785,0.02913639],"study_design_scores_gemma":[0.0000049729324,0.00016155945,0.9885479,0.000070922666,0.00004380308,0.0007205777,0.0024740295,0.0037450367,0.0013385654,0.0001470369,0.0027090276,0.000036511345],"about_ca_topic_score_codex":0.0040503275,"about_ca_topic_score_gemma":0.005953555,"teacher_disagreement_score":0.011034845,"about_ca_system_score_codex":0.00055429497,"about_ca_system_score_gemma":0.0004603546,"threshold_uncertainty_score":0.017141998},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4128812,0.007856739,0.28558,0.0007942266,0.00096418825,0.00076034013,0.0020015803,0.27186823,0.017293368],"genre_scores_gemma":[0.918083,0.00050406606,0.073912196,0.0004979209,0.000074357195,0.00014837545,0.0016694294,0.0020928255,0.0030179655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826837,0.00022527686,0.0001446933,0.00029617478,0.00059801346,0.00046746965],"domain_scores_gemma":[0.99787104,0.000346385,0.00032956398,0.0008694662,0.0003077724,0.00027590198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010161995,0.0015472878,0.00064441084,0.00079753855,0.00076667115,0.0017998369,0.003091393,0.0005570146,0.0033738648],"category_scores_gemma":[0.003688133,0.00056037336,0.0005195452,0.0005870216,0.0010040083,0.0031183686,0.0032690242,0.0011892386,0.0016314952],"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.009451689,0.001303901,0.04094002,0.0014923053,0.00049380644,0.0011184639,0.0012520647,0.04952547,0.19253118,0.01811021,0.09883414,0.5849467],"study_design_scores_gemma":[0.0007755073,0.0017945225,0.011408703,0.00018643317,0.00032873676,0.00082457555,0.0003504013,0.6121319,0.30538693,0.009404478,0.05705319,0.00035455878],"about_ca_topic_score_codex":0.0048550162,"about_ca_topic_score_gemma":0.0046799323,"teacher_disagreement_score":0.0048550162,"about_ca_system_score_codex":0.0010227711,"about_ca_system_score_gemma":0.0023602713,"threshold_uncertainty_score":0.011286676},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013783304,0.0011856566,0.5496829,0.00043961583,0.00027196878,0.00026216838,0.009118283,0.4153,0.009956152],"genre_scores_gemma":[0.16626751,0.0019045328,0.7261498,0.0011618072,0.00008756957,0.0014943675,0.03973888,0.042540323,0.020655224],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99958307,0.00005818656,0.000030496487,0.00009357011,0.00017569981,0.00005900352],"domain_scores_gemma":[0.99943537,0.00021915737,0.000055337096,0.000115313596,0.00013422052,0.000040624793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057111453,0.0021163328,0.0007357502,0.001099971,0.00046348257,0.0010810286,0.004574954,0.0010294581,0.020061947],"category_scores_gemma":[0.0029940144,0.0011138768,0.0015402312,0.0012828783,0.0005486839,0.0023059072,0.0014564943,0.0025092438,0.008330466],"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.00073484867,0.00036838432,0.004922668,0.0030480716,0.0005778768,0.00059662387,0.0003098042,0.3075615,0.019625412,0.028246285,0.28392425,0.3500843],"study_design_scores_gemma":[0.00014336153,0.00006792947,0.0009277136,0.00007211001,0.000049519713,0.00012152566,0.000030674997,0.9153718,0.013131765,0.01849501,0.051531967,0.000056698394],"about_ca_topic_score_codex":0.010911417,"about_ca_topic_score_gemma":0.019596817,"teacher_disagreement_score":0.020061947,"about_ca_system_score_codex":0.0013011855,"about_ca_system_score_gemma":0.0021975657,"threshold_uncertainty_score":0.06711388},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015829658,0.00073958427,0.9777077,0.00053158985,0.00011650105,0.00012622321,0.00014685612,0.00048098524,0.0043208697],"genre_scores_gemma":[0.57846826,0.0007250328,0.41296783,0.00068795204,0.00033649668,0.00057210866,0.0007176158,0.00027109013,0.0052535683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825114,0.00063178525,0.00009646579,0.00040464362,0.0003387949,0.00027715156],"domain_scores_gemma":[0.9919992,0.0059974752,0.0005592026,0.00043480817,0.00064955925,0.00035977608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025631934,0.0019019064,0.0028669746,0.0010728539,0.0009501654,0.0021070002,0.0036704927,0.0025696005,0.004287738],"category_scores_gemma":[0.011788948,0.000742309,0.00084266043,0.0023345193,0.001512913,0.0027668169,0.0020527567,0.0025329755,0.0008052721],"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.0001545568,0.00019698711,0.0006090199,0.00014812796,0.00005875878,0.000049553335,0.000059739043,0.918707,0.00044746726,0.024577577,0.00300286,0.051988386],"study_design_scores_gemma":[0.000019377367,0.000032061907,0.00003916206,0.0000047990166,0.000004176346,0.000009855726,0.000008117954,0.9898168,0.00010052591,0.009519941,0.00044118986,0.000004071513],"about_ca_topic_score_codex":0.009734629,"about_ca_topic_score_gemma":0.0077779414,"teacher_disagreement_score":0.009734629,"about_ca_system_score_codex":0.0019908643,"about_ca_system_score_gemma":0.0034346795,"threshold_uncertainty_score":0.019355953},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048866235,0.00023968607,0.9465274,0.0008318021,0.000086811844,0.0001525254,0.00009636295,0.00019755843,0.0030015637],"genre_scores_gemma":[0.8550892,0.00021842586,0.139913,0.00035064228,0.00020684287,0.00028102094,0.000109013505,0.00014715777,0.0036847417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958973,0.001777887,0.00013737535,0.0008752523,0.00062571984,0.00068645243],"domain_scores_gemma":[0.98720014,0.008846908,0.001146836,0.0012542296,0.0007095486,0.0008423849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007844454,0.0011493936,0.0026248007,0.0007988818,0.0013618317,0.0030505368,0.0039784494,0.0026725105,0.003215734],"category_scores_gemma":[0.018522207,0.0004892092,0.0008703542,0.001508374,0.0018833338,0.00528747,0.0019491675,0.0022328545,0.00045417476],"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.00057432964,0.000552355,0.0030307763,0.00015710262,0.0001053993,0.00021794197,0.000288177,0.81159246,0.0022802213,0.111943945,0.0033608638,0.06589647],"study_design_scores_gemma":[0.000027601629,0.000051766732,0.00022507898,0.000007725311,0.000010092497,0.00004933058,0.000039339295,0.96519053,0.000528009,0.033220414,0.00064104697,0.000009043793],"about_ca_topic_score_codex":0.0027951805,"about_ca_topic_score_gemma":0.0017704859,"teacher_disagreement_score":0.007844454,"about_ca_system_score_codex":0.002692088,"about_ca_system_score_gemma":0.0024295035,"threshold_uncertainty_score":0.041485906},"labels":[],"label_agreement":null}]}