{"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":"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.21631294,0.0013764015,0.77576596,0.00039662595,0.00011414704,0.0000892906,0.000075863034,0.001311499,0.0045571965],"genre_scores_gemma":[0.9511394,0.00012970809,0.047738746,0.000062560954,0.00003125273,0.000044908502,0.00005084371,0.000060840055,0.0007417511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991223,0.00019153558,0.000061681996,0.00010730327,0.00035104257,0.00016619821],"domain_scores_gemma":[0.9983967,0.0003328096,0.00026020734,0.0005523624,0.0003202098,0.0001377397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010182633,0.00034508685,0.00034371705,0.00044924906,0.0008778609,0.00082342775,0.0010523751,0.0002919682,0.0010605095],"category_scores_gemma":[0.002002994,0.0003045497,0.00030231208,0.00039921538,0.0005337302,0.0011096251,0.0010243698,0.0005907909,0.00024080375],"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.00084378244,0.00025211563,0.0058046244,0.00024500582,0.00010513834,0.0004949168,0.00073313847,0.6513233,0.14571595,0.034072604,0.0033405852,0.15706874],"study_design_scores_gemma":[0.000051171282,0.00057947374,0.0015927559,0.000034458328,0.000053719945,0.00026096794,0.00013882521,0.93071055,0.043283004,0.014983033,0.008273289,0.000038751114],"about_ca_topic_score_codex":0.0011976635,"about_ca_topic_score_gemma":0.0035495246,"teacher_disagreement_score":0.0011976635,"about_ca_system_score_codex":0.00092271017,"about_ca_system_score_gemma":0.0013839179,"threshold_uncertainty_score":0.006694734},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067349896,0.0002506332,0.9215895,0.0002825636,0.00006981962,0.000086498054,0.00007167652,0.0010205399,0.009278909],"genre_scores_gemma":[0.50765604,0.00026134017,0.48819825,0.00012064344,0.000034486035,0.00020122193,0.00015866935,0.000087796674,0.0032815484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976736,0.000062830986,0.000018172208,0.000050709532,0.00007405234,0.00002700544],"domain_scores_gemma":[0.9996805,0.0001563233,0.000028265044,0.00006387005,0.000054252763,0.00001687791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028906245,0.0004137466,0.0006279575,0.00045162847,0.0007322148,0.00068458164,0.0009888677,0.0009168045,0.002140787],"category_scores_gemma":[0.0011399058,0.00036794733,0.0006827527,0.00067207287,0.00046050688,0.0010637773,0.0006121875,0.0007748883,0.00030374387],"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.000056548088,0.00006136808,0.0003088418,0.000063313106,0.000045644705,0.00006453857,0.000058791065,0.9065208,0.006046705,0.021463964,0.0009251458,0.0643843],"study_design_scores_gemma":[0.000006622135,0.0000129578475,0.00004477235,0.0000018171995,0.0000043477844,0.000011216125,0.000004304559,0.99248683,0.0005826926,0.0063878926,0.00045332804,0.0000033130054],"about_ca_topic_score_codex":0.003545063,"about_ca_topic_score_gemma":0.0043763486,"teacher_disagreement_score":0.003545063,"about_ca_system_score_codex":0.00055273384,"about_ca_system_score_gemma":0.0009013081,"threshold_uncertainty_score":0.007161677},"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":"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.4766907,0.00041875124,0.50560665,0.00013917121,0.000060449616,0.00011224263,0.0002247155,0.008084094,0.008663271],"genre_scores_gemma":[0.78038245,0.0001034525,0.2166436,0.000066687404,0.000017238006,0.000103878294,0.0003654315,0.0007395261,0.001577743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955314,0.00011620566,0.000023235014,0.00009529582,0.00009564525,0.000116374125],"domain_scores_gemma":[0.9991217,0.00040834755,0.00012007675,0.00018842827,0.0001246623,0.000036725844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000613113,0.0007411414,0.0004270821,0.0003984848,0.0003486415,0.00055699755,0.00081373175,0.00028208946,0.0010752374],"category_scores_gemma":[0.001877789,0.00030931615,0.00044259467,0.00045078286,0.00055151875,0.0006337832,0.00060896267,0.0004293169,0.00031195785],"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.00047976506,0.00023013803,0.004419034,0.00030917465,0.000054448843,0.00029521054,0.00018872954,0.80826753,0.05748026,0.011047074,0.0027206293,0.11450807],"study_design_scores_gemma":[0.00003061298,0.0001642977,0.000429196,0.0000092540095,0.000016261967,0.000039761715,0.00003707005,0.9735748,0.020024402,0.0045352476,0.0011319013,0.000007253559],"about_ca_topic_score_codex":0.001852644,"about_ca_topic_score_gemma":0.0037549054,"teacher_disagreement_score":0.001852644,"about_ca_system_score_codex":0.0006094699,"about_ca_system_score_gemma":0.0011475234,"threshold_uncertainty_score":0.0044220686},"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":"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.10513012,0.00096417445,0.84136075,0.0045322687,0.0019738928,0.00023667487,0.00045231188,0.0053873397,0.039962437],"genre_scores_gemma":[0.87910354,0.00037971523,0.098672405,0.0018541786,0.00036508014,0.00015483046,0.0005143744,0.00055053324,0.018405357],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990497,0.00015626027,0.00006408024,0.00021562436,0.0003629408,0.00015146825],"domain_scores_gemma":[0.99795616,0.00043940832,0.00015561776,0.0008659976,0.0004663845,0.00011647409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007899164,0.0006927767,0.0007396787,0.00033978638,0.0008166058,0.0015812387,0.00079702836,0.0010997369,0.010068639],"category_scores_gemma":[0.006340688,0.0002929399,0.00027449627,0.0004836616,0.0012270479,0.0027104768,0.0015749744,0.0020619004,0.003795117],"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.0021153812,0.0002754832,0.0037365162,0.00033380298,0.000098470045,0.0005203619,0.00039364025,0.06526573,0.1271008,0.12445108,0.025780033,0.6499288],"study_design_scores_gemma":[0.00021558139,0.00087858696,0.0031115997,0.00021627339,0.00010979142,0.0013162694,0.0003125283,0.55734235,0.24392048,0.12469965,0.06774889,0.00012800492],"about_ca_topic_score_codex":0.00072730775,"about_ca_topic_score_gemma":0.0011139117,"teacher_disagreement_score":0.010068639,"about_ca_system_score_codex":0.00040753154,"about_ca_system_score_gemma":0.0012798925,"threshold_uncertainty_score":0.033682883},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039642694,0.00082071533,0.9901715,0.00028452047,0.00010824927,0.0000575489,0.00004101409,0.00040563697,0.0077145332],"genre_scores_gemma":[0.03497631,0.0025407553,0.94996446,0.0003573607,0.00025322667,0.00049448106,0.00019702328,0.00039396973,0.010822422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972658,0.0008182465,0.0002078714,0.0002811513,0.001270825,0.00015596994],"domain_scores_gemma":[0.99728954,0.0012347407,0.0001500087,0.00086662406,0.0004040856,0.000054944703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038236608,0.0014531625,0.00055026094,0.0014850209,0.0007889336,0.0031199018,0.00200536,0.0014369431,0.010119362],"category_scores_gemma":[0.0053545376,0.0008350959,0.0015727234,0.0009381925,0.0032456936,0.0032261529,0.0019792665,0.0038958795,0.0039933953],"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.000013428345,0.00002525327,0.0000908152,0.00031196608,0.000024690238,0.000055999266,0.00018301872,0.010984155,0.002418285,0.9251935,0.0036172864,0.05708161],"study_design_scores_gemma":[0.000047371508,0.00004788276,0.000068902664,0.0002938549,0.00004238607,0.00016402309,0.000051245883,0.06089827,0.005054947,0.74458516,0.1887148,0.00003121013],"about_ca_topic_score_codex":0.00071275566,"about_ca_topic_score_gemma":0.0010451175,"teacher_disagreement_score":0.010119362,"about_ca_system_score_codex":0.0012862938,"about_ca_system_score_gemma":0.0017614472,"threshold_uncertainty_score":0.033852577},"labels":[],"label_agreement":null}]}