{"meta":{"query_hash":"138633edc4ad","filters":{"venue":"Proceedings of the 59th ACM/IEEE Design Automation Conference"},"cohort_total":5,"direct_labels_cover":0,"predictions_cover":5,"exported":5,"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/138633edc4ad","api":"https://metacan.xera.ac/api/v1/cohort?venue=Proceedings+of+the+59th+ACM%2FIEEE+Design+Automation+Conference"},"results":[{"id":"W4224318715","doi":"10.1145/3489517.3530614","title":"Predictable sharing of last-level cache partitions for multi-core safety-critical systems","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 59th ACM/IEEE Design Automation Conference","topic":"Real-Time Systems Scheduling","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":"","keywords":"Cache; Computer science; Partition (number theory); Parallel computing; Multi-core processor; Latency (audio); Cache pollution; Cache algorithms; CPU cache; Distributed computing; Cache invalidation; Mathematics","score_opus":0.21541242315019649,"score_gpt":0.32324212021196125,"score_spread":0.10782969706176476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224318715","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.020792685,0.0000638661,0.9752546,0.00055815757,0.00086151325,0.0017187225,0.00009118609,0.0002643798,0.00039488755],"genre_scores_gemma":[0.86472034,0.0000022484205,0.13426808,0.00002749485,0.00004902498,0.0006641416,0.0000038505705,0.000020920408,0.00024392463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997269,0.00006564418,0.0009400559,0.0005379312,0.0007670313,0.0004203504],"domain_scores_gemma":[0.99686235,0.00054227764,0.0007644544,0.0005354649,0.0011870484,0.000108405555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021936398,0.00022429517,0.00042591037,0.00019094415,0.0005706127,0.00024524468,0.0027001242,0.000085550215,0.000016884747],"category_scores_gemma":[0.0017891254,0.00019985714,0.00013984456,0.00069309137,0.000117525255,0.0010317676,0.00075785565,0.000245315,0.0000048879087],"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.00012799668,0.0005853,0.0050160796,0.002995819,0.0002028629,0.0000012442379,0.008663551,0.058265176,0.2980146,0.62023884,0.0042000795,0.0016884357],"study_design_scores_gemma":[0.0005716731,0.000147142,0.001079241,0.0003467032,0.00003973933,0.000036579433,0.00059678283,0.9623318,0.02893198,0.0055828136,0.00012157791,0.00021402394],"about_ca_topic_score_codex":0.0000632262,"about_ca_topic_score_gemma":0.0000013759185,"teacher_disagreement_score":0.90406656,"about_ca_system_score_codex":0.00016252826,"about_ca_system_score_gemma":0.00030983827,"threshold_uncertainty_score":0.81499374},"labels":[],"label_agreement":null},{"id":"W4293023448","doi":"10.1145/3489517.3530595","title":"Solving traveling salesman problems via a parallel fully connected ising machine","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 59th ACM/IEEE Design Automation Conference","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":20,"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":"Travelling salesman problem; Simulated annealing; Computer science; Ising model; Exponential function; Combinatorial optimization; Medoid; Mathematical optimization; Cluster analysis; Adaptive simulated annealing; Annealing (glass); Algorithm; Mathematics; Artificial intelligence; Materials science; Physics; Statistical physics","score_opus":0.05894507042106219,"score_gpt":0.26434047508557257,"score_spread":0.2053954046645104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293023448","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.0052782525,0.00006245123,0.989927,0.0020906385,0.00036065828,0.001179043,0.000007665526,0.00041642497,0.0006778891],"genre_scores_gemma":[0.67800677,0.000012241956,0.32133505,0.00015235656,0.000029484007,0.00017640501,0.0000040595296,0.000025267998,0.0002583524],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963846,0.0002018591,0.00081147556,0.0006570969,0.0014193665,0.0005255954],"domain_scores_gemma":[0.99691576,0.00039445492,0.0008466223,0.0005535556,0.0011458541,0.00014376963],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024267067,0.00029020986,0.00038153058,0.0003111119,0.0008829904,0.0004996751,0.0038569092,0.000072774434,0.00018237418],"category_scores_gemma":[0.0013416637,0.0002558243,0.00011174028,0.0016063094,0.00012137805,0.00083877426,0.001126287,0.00053689914,0.000016100419],"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.00021815834,0.0009165673,0.0018011874,0.0011918619,0.00037842029,0.000012083298,0.021100335,0.3791285,0.38550293,0.11926391,0.0051718378,0.08531422],"study_design_scores_gemma":[0.00058562495,0.0001282592,0.00045149337,0.000080678205,0.000018773735,0.000060360657,0.000101477344,0.97433496,0.010280988,0.013556554,0.00012010118,0.00028073022],"about_ca_topic_score_codex":0.000033286513,"about_ca_topic_score_gemma":0.0000010965164,"teacher_disagreement_score":0.67272854,"about_ca_system_score_codex":0.00017378418,"about_ca_system_score_gemma":0.0003793579,"threshold_uncertainty_score":0.9999894},"labels":[],"label_agreement":null},{"id":"W4293024962","doi":"10.1145/3489517.3530610","title":"Optimizing parallel PREM compilation over nested loop structures","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 59th ACM/IEEE Design Automation Conference","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"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","keywords":"Computer science; Parallel computing; Loop tiling; Nested loop join; Benchmark (surveying); Kernel (algebra); Suite; Thread (computing); Loop (graph theory); Scheduling (production processes); Operating system; Compiler","score_opus":0.047403365924978735,"score_gpt":0.2686451311555154,"score_spread":0.22124176523053668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293024962","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.01961161,0.00004186747,0.9769375,0.0007840999,0.000331446,0.0006940003,0.0000050930616,0.0008561659,0.00073822774],"genre_scores_gemma":[0.6328128,0.0000060238763,0.36672994,0.00021004105,0.000022090566,0.00006558199,0.0000034510576,0.000012367036,0.00013767178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978991,0.000107748914,0.00052242033,0.00045412272,0.0007304946,0.00028608504],"domain_scores_gemma":[0.99801576,0.00015736489,0.000819079,0.0004385082,0.0005038025,0.00006548217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076229236,0.00023194197,0.00026446834,0.00021958567,0.00062033895,0.00031508654,0.0027626439,0.000072482144,0.00004707475],"category_scores_gemma":[0.00023536304,0.0002027948,0.000095328964,0.00088193483,0.0000739556,0.000789441,0.00080652145,0.00029498464,0.000002847934],"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.00008824256,0.00016691066,0.0017474206,0.00014236633,0.00007153695,0.0000010269498,0.0058039,0.7774784,0.036372226,0.15490393,0.014325816,0.0088982135],"study_design_scores_gemma":[0.0003499795,0.000096003685,0.0032757053,0.00004478209,0.000013749325,0.000017783192,0.000060278224,0.94733,0.023688145,0.02468995,0.00018419036,0.00024943825],"about_ca_topic_score_codex":0.000010677567,"about_ca_topic_score_gemma":2.148211e-7,"teacher_disagreement_score":0.6132012,"about_ca_system_score_codex":0.00011575328,"about_ca_system_score_gemma":0.0001654765,"threshold_uncertainty_score":0.8269732},"labels":[],"label_agreement":null},{"id":"W4293025003","doi":"10.1145/3489517.3530417","title":"Sign bit is enough","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 59th ACM/IEEE Design Automation Conference","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","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 British Columbia","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer science; Compression (physics); Sign (mathematics); Synchronization (alternating current); Data compression; Convergence (economics); Process (computing); Stochastic gradient descent; Rate of convergence; Compression ratio; Algorithm; Computer engineering; Artificial intelligence; Artificial neural network; Key (lock); Computer network; Mathematics; Engineering","score_opus":0.050709080288593444,"score_gpt":0.25046996521880294,"score_spread":0.1997608849302095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293025003","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.0034017116,0.000022701255,0.98873895,0.0039636325,0.00041569406,0.00084981456,0.000008366821,0.0007228415,0.0018763129],"genre_scores_gemma":[0.7889418,0.0000053428507,0.20972335,0.0006649115,0.00002048043,0.0002549089,9.1586617e-7,0.000015721645,0.00037255642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997851,0.00005053554,0.00046474027,0.0004677147,0.0008713733,0.00029464136],"domain_scores_gemma":[0.9979662,0.0001743725,0.0006451257,0.0005208189,0.00062270253,0.00007083506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008262729,0.00020791772,0.00022967462,0.00024624862,0.00045597172,0.00021141938,0.0038525874,0.00005732015,0.0001654059],"category_scores_gemma":[0.00045511452,0.00018251206,0.00009479652,0.0012427011,0.00009455914,0.00073213206,0.00091373606,0.00023604975,0.00001527409],"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.00005112343,0.0003550191,0.0005556047,0.00015968882,0.00008628927,0.0000012738413,0.013777076,0.005218032,0.08488688,0.79610234,0.07854328,0.020263376],"study_design_scores_gemma":[0.00036776115,0.0002945662,0.0004960623,0.000065155975,0.000023627787,0.000037318066,0.00017830156,0.6201645,0.2651253,0.111793876,0.0010785807,0.00037493216],"about_ca_topic_score_codex":0.000009917481,"about_ca_topic_score_gemma":6.0180945e-8,"teacher_disagreement_score":0.7855401,"about_ca_system_score_codex":0.00012766903,"about_ca_system_score_gemma":0.00020346796,"threshold_uncertainty_score":0.7442626},"labels":[],"label_agreement":null},{"id":"W4293025108","doi":"10.1145/3489517.3530635","title":"High-level design methods for hardware security","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 59th ACM/IEEE Design Automation Conference","topic":"Physical Unclonable Functions (PUFs) and Hardware Security","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 Calgary","funders":"Office of Naval Research; New York University Abu Dhabi; National Science Foundation","keywords":"Hardware security module; Modular design; Computer science; Intellectual property; Embedded system; Electronics; State (computer science); Complement (music); Computer hardware; Computer security; Operating system; Cryptography; Engineering; Electrical engineering","score_opus":0.10007622564500662,"score_gpt":0.31453289401366463,"score_spread":0.214456668368658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293025108","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020606522,0.000037191592,0.9923527,0.0022198223,0.0010725037,0.0015083329,0.000059561215,0.00042742759,0.00026176387],"genre_scores_gemma":[0.4849,0.000005196135,0.5137642,0.00031054104,0.000078535115,0.00068374956,0.000004542182,0.00001942985,0.00023378259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973025,0.00025910998,0.00056775776,0.00070425536,0.00068118435,0.0004851974],"domain_scores_gemma":[0.9964779,0.00090872054,0.00066937954,0.00064104534,0.0011676884,0.00013524924],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025915583,0.00031833092,0.00045464683,0.00020179215,0.0010042182,0.00029882873,0.0038045014,0.00009326723,0.000074863674],"category_scores_gemma":[0.0012918697,0.00027345735,0.00023170045,0.0011643562,0.000116054856,0.0010914525,0.0010083839,0.0004130966,0.000010613308],"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.0002630686,0.00067260285,0.000059039532,0.00039960913,0.00018080555,7.571581e-7,0.005436378,0.004181046,0.10707261,0.77653927,0.045739334,0.05945546],"study_design_scores_gemma":[0.0006090927,0.00033528646,0.0002967228,0.000041459738,0.00005123227,0.0000132860905,0.00012536101,0.38431153,0.17066562,0.4391473,0.004038402,0.00036471113],"about_ca_topic_score_codex":0.000029406065,"about_ca_topic_score_gemma":5.80776e-7,"teacher_disagreement_score":0.48283935,"about_ca_system_score_codex":0.00020403878,"about_ca_system_score_gemma":0.00044954338,"threshold_uncertainty_score":0.99997175},"labels":[],"label_agreement":null}]}