{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":5,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":5,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"138633edc4ad","filters":{"venue":"Proceedings of the 59th ACM/IEEE Design Automation Conference"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05894507042106219,"gpt":0.2643404750855726,"spread":0.2053954046645104,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002426707,0.0002902099,0.0003815306,0.0003111119,0.0008829904,0.0004996751,0.003856909,0.00007277443,0.0001823742],"category_scores_gemma":[0.001341664,0.0002558243,0.0001117403,0.001606309,0.000121378,0.0008387743,0.001126287,0.0005368991,0.00001610042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001737842,"about_ca_system_score_gemma":0.0003793579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003328651,"about_ca_topic_score_gemma":0.000001096516,"domain_scores_codex":[0.9963846,0.0002018591,0.0008114756,0.0006570969,0.001419366,0.0005255954],"domain_scores_gemma":[0.9969158,0.0003944549,0.0008466223,0.0005535556,0.001145854,0.0001437696],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002181583,0.0009165673,0.001801187,0.001191862,0.0003784203,0.0000120833,0.02110033,0.3791285,0.3855029,0.1192639,0.005171838,0.08531422],"study_design_scores_gemma":[0.0005856249,0.0001282592,0.0004514934,0.0000806782,0.00001877374,0.00006036066,0.0001014773,0.974335,0.01028099,0.01355655,0.0001201012,0.0002807302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005278253,0.00006245123,0.989927,0.002090639,0.0003606583,0.001179043,0.000007665526,0.000416425,0.0006778891],"genre_scores_gemma":[0.6780068,0.00001224196,0.321335,0.0001523566,0.00002948401,0.000176405,0.00000405953,0.000025268,0.0002583524],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6727285,"threshold_uncertainty_score":0.9999894,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.2154124231501965,"gpt":0.3232421202119612,"spread":0.1078296970617648,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00219364,0.0002242952,0.0004259104,0.0001909441,0.0005706127,0.0002452447,0.002700124,0.00008555021,0.00001688475],"category_scores_gemma":[0.001789125,0.0001998571,0.0001398446,0.0006930914,0.0001175253,0.001031768,0.0007578557,0.000245315,0.000004887909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001625283,"about_ca_system_score_gemma":0.0003098383,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000632262,"about_ca_topic_score_gemma":0.000001375918,"domain_scores_codex":[0.997269,0.00006564418,0.0009400559,0.0005379312,0.0007670313,0.0004203504],"domain_scores_gemma":[0.9968624,0.0005422776,0.0007644544,0.0005354649,0.001187048,0.0001084056],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001279967,0.0005853,0.00501608,0.002995819,0.0002028629,0.000001244238,0.008663551,0.05826518,0.2980146,0.6202388,0.004200079,0.001688436],"study_design_scores_gemma":[0.0005716731,0.000147142,0.001079241,0.0003467032,0.00003973933,0.00003657943,0.0005967828,0.9623318,0.02893198,0.005582814,0.0001215779,0.0002140239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02079269,0.0000638661,0.9752546,0.0005581576,0.0008615133,0.001718723,0.00009118609,0.0002643798,0.0003948876],"genre_scores_gemma":[0.8647203,0.000002248421,0.1342681,0.00002749485,0.00004902498,0.0006641416,0.00000385057,0.00002092041,0.0002439246],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9040666,"threshold_uncertainty_score":0.8149937,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05070908028859344,"gpt":0.2504699652188029,"spread":0.1997608849302095,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008262729,0.0002079177,0.0002296746,0.0002462486,0.0004559717,0.0002114194,0.003852587,0.00005732015,0.0001654059],"category_scores_gemma":[0.0004551145,0.0001825121,0.00009479652,0.001242701,0.00009455914,0.0007321321,0.0009137361,0.0002360497,0.00001527409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000127669,"about_ca_system_score_gemma":0.000203468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009917481,"about_ca_topic_score_gemma":6.018094e-8,"domain_scores_codex":[0.997851,0.00005053554,0.0004647403,0.0004677147,0.0008713733,0.0002946414],"domain_scores_gemma":[0.9979662,0.0001743725,0.0006451257,0.0005208189,0.0006227025,0.00007083506],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005112343,0.0003550191,0.0005556047,0.0001596888,0.00008628927,0.000001273841,0.01377708,0.005218032,0.08488688,0.7961023,0.07854328,0.02026338],"study_design_scores_gemma":[0.0003677612,0.0002945662,0.0004960623,0.00006515597,0.00002362779,0.00003731807,0.0001783016,0.6201645,0.2651253,0.1117939,0.001078581,0.0003749322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003401712,0.00002270126,0.988739,0.003963633,0.0004156941,0.0008498146,0.000008366821,0.0007228415,0.001876313],"genre_scores_gemma":[0.7889418,0.000005342851,0.2097234,0.0006649115,0.00002048043,0.0002549089,9.158662e-7,0.00001572165,0.0003725564],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7855401,"threshold_uncertainty_score":0.7442626,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1000762256450066,"gpt":0.3145328940136646,"spread":0.214456668368658,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002591558,0.0003183309,0.0004546468,0.0002017922,0.001004218,0.0002988287,0.003804501,0.00009326723,0.00007486367],"category_scores_gemma":[0.00129187,0.0002734573,0.0002317005,0.001164356,0.0001160549,0.001091453,0.001008384,0.0004130966,0.00001061331],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002040388,"about_ca_system_score_gemma":0.0004495434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002940606,"about_ca_topic_score_gemma":5.80776e-7,"domain_scores_codex":[0.9973025,0.00025911,0.0005677578,0.0007042554,0.0006811843,0.0004851974],"domain_scores_gemma":[0.9964779,0.0009087205,0.0006693795,0.0006410453,0.001167688,0.0001352492],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002630686,0.0006726029,0.00005903953,0.0003996091,0.0001808056,7.571581e-7,0.005436378,0.004181046,0.1070726,0.7765393,0.04573933,0.05945546],"study_design_scores_gemma":[0.0006090927,0.0003352865,0.0002967228,0.00004145974,0.00005123227,0.00001328609,0.000125361,0.3843115,0.1706656,0.4391473,0.004038402,0.0003647111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002060652,0.00003719159,0.9923527,0.002219822,0.001072504,0.001508333,0.00005956121,0.0004274276,0.0002617639],"genre_scores_gemma":[0.4849,0.000005196135,0.5137642,0.000310541,0.00007853511,0.0006837496,0.000004542182,0.00001942985,0.0002337826],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4828393,"threshold_uncertainty_score":0.9999717,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","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","retraction":null,"screen_n_in":null,"score":{"opus":0.04740336592497874,"gpt":0.2686451311555154,"spread":0.2212417652305367,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007622924,0.000231942,0.0002644683,0.0002195857,0.0006203389,0.0003150865,0.002762644,0.00007248214,0.00004707475],"category_scores_gemma":[0.000235363,0.0002027948,0.00009532896,0.0008819348,0.0000739556,0.000789441,0.0008065214,0.0002949846,0.000002847934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001157533,"about_ca_system_score_gemma":0.0001654765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001067757,"about_ca_topic_score_gemma":2.148211e-7,"domain_scores_codex":[0.9978991,0.0001077489,0.0005224203,0.0004541227,0.0007304946,0.000286085],"domain_scores_gemma":[0.9980158,0.0001573649,0.000819079,0.0004385082,0.0005038025,0.00006548217],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008824256,0.0001669107,0.001747421,0.0001423663,0.00007153695,0.00000102695,0.0058039,0.7774784,0.03637223,0.1549039,0.01432582,0.008898214],"study_design_scores_gemma":[0.0003499795,0.00009600369,0.003275705,0.00004478209,0.00001374933,0.00001778319,0.00006027822,0.94733,0.02368814,0.02468995,0.0001841904,0.0002494382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01961161,0.00004186747,0.9769375,0.0007840999,0.000331446,0.0006940003,0.000005093062,0.0008561659,0.0007382277],"genre_scores_gemma":[0.6328128,0.000006023876,0.3667299,0.000210041,0.00002209057,0.00006558199,0.000003451058,0.00001236704,0.0001376718],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6132012,"threshold_uncertainty_score":0.8269732,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}