{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Qichao Tao","is_ca":true},{"name":"Jie Han","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002890624,0.0004137466,0.0006279575,0.0004516285,0.0007322148,0.0006845816,0.0009888677,0.0009168045,0.002140787],"category_scores_gemma":[0.001139906,0.0003679473,0.0006827527,0.0006720729,0.0004605069,0.001063777,0.0006121875,0.0007748883,0.0003037439],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005527338,"about_ca_system_score_gemma":0.0009013081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003545063,"about_ca_topic_score_gemma":0.004376349,"domain_scores_codex":[0.9997674,0.00006283099,0.00001817221,0.00005070953,0.00007405234,0.00002700544],"domain_scores_gemma":[0.9996805,0.0001563233,0.00002826504,0.00006387005,0.00005425276,0.00001687791],"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.00005654809,0.00006136808,0.0003088418,0.00006331311,0.00004564471,0.00006453857,0.00005879107,0.9065208,0.006046705,0.02146396,0.0009251458,0.0643843],"study_design_scores_gemma":[0.000006622135,0.00001295785,0.00004477235,0.0000018172,0.000004347784,0.00001121613,0.000004304559,0.9924868,0.0005826926,0.006387893,0.000453328,0.000003313005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0673499,0.0002506332,0.9215895,0.0002825636,0.00006981962,0.00008649805,0.00007167652,0.00102054,0.009278909],"genre_scores_gemma":[0.507656,0.0002613402,0.4881983,0.0001206434,0.00003448603,0.0002012219,0.0001586694,0.00008779667,0.003281548],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003545063,"threshold_uncertainty_score":0.007161677,"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","authors":[{"name":"Zhuanhao Wu","is_ca":true},{"name":"Hiren Patel","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001018263,0.0003450869,0.0003437171,0.0004492491,0.0008778609,0.0008234277,0.001052375,0.0002919682,0.001060509],"category_scores_gemma":[0.002002994,0.0003045497,0.0003023121,0.0003992154,0.0005337302,0.001109625,0.00102437,0.0005907909,0.0002408038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009227102,"about_ca_system_score_gemma":0.001383918,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001197663,"about_ca_topic_score_gemma":0.003549525,"domain_scores_codex":[0.9991223,0.0001915356,0.000061682,0.0001073033,0.0003510426,0.0001661982],"domain_scores_gemma":[0.9983967,0.0003328096,0.0002602073,0.0005523624,0.0003202098,0.0001377397],"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.0008437824,0.0002521156,0.005804624,0.0002450058,0.0001051383,0.0004949168,0.0007331385,0.6513233,0.145716,0.0340726,0.003340585,0.1570687],"study_design_scores_gemma":[0.00005117128,0.0005794737,0.001592756,0.00003445833,0.00005371994,0.0002609679,0.0001388252,0.9307106,0.043283,0.01498303,0.008273289,0.00003875111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2163129,0.001376402,0.775766,0.000396626,0.000114147,0.0000892906,0.00007586303,0.001311499,0.004557197],"genre_scores_gemma":[0.9511394,0.0001297081,0.04773875,0.00006256095,0.00003125273,0.0000449085,0.00005084371,0.00006084006,0.0007417511],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001197663,"threshold_uncertainty_score":0.006694734,"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","authors":[{"name":"Feijie Wu","is_ca":false},{"name":"Shiqi He","is_ca":true},{"name":"Song Guo","is_ca":false},{"name":"Zhihao Qu","is_ca":false},{"name":"Haozhao Wang","is_ca":false},{"name":"Weihua Zhuang","is_ca":true},{"name":"Jie Zhang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007899164,0.0006927767,0.0007396787,0.0003397864,0.0008166058,0.001581239,0.0007970284,0.001099737,0.01006864],"category_scores_gemma":[0.006340688,0.0002929399,0.0002744963,0.0004836616,0.001227048,0.002710477,0.001574974,0.0020619,0.003795117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004075315,"about_ca_system_score_gemma":0.001279893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007273077,"about_ca_topic_score_gemma":0.001113912,"domain_scores_codex":[0.9990497,0.0001562603,0.00006408024,0.0002156244,0.0003629408,0.0001514683],"domain_scores_gemma":[0.9979562,0.0004394083,0.0001556178,0.0008659976,0.0004663845,0.0001164741],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002115381,0.0002754832,0.003736516,0.000333803,0.00009847005,0.0005203619,0.0003936402,0.06526573,0.1271008,0.1244511,0.02578003,0.6499288],"study_design_scores_gemma":[0.0002155814,0.000878587,0.0031116,0.0002162734,0.0001097914,0.001316269,0.0003125283,0.5573424,0.2439205,0.1246997,0.06774889,0.0001280049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1051301,0.0009641745,0.8413607,0.004532269,0.001973893,0.0002366749,0.0004523119,0.00538734,0.03996244],"genre_scores_gemma":[0.8791035,0.0003797152,0.0986724,0.001854179,0.0003650801,0.0001548305,0.0005143744,0.0005505332,0.01840536],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01006864,"threshold_uncertainty_score":0.03368288,"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","authors":[{"name":"Christian Pilato","is_ca":false},{"name":"Donatella Sciuto","is_ca":false},{"name":"Benjamin Tan","is_ca":true},{"name":"Siddharth Garg","is_ca":false},{"name":"Ramesh Karri","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003823661,0.001453163,0.0005502609,0.001485021,0.0007889336,0.003119902,0.00200536,0.001436943,0.01011936],"category_scores_gemma":[0.005354538,0.0008350959,0.001572723,0.0009381925,0.003245694,0.003226153,0.001979267,0.003895879,0.003993395],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001286294,"about_ca_system_score_gemma":0.001761447,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007127557,"about_ca_topic_score_gemma":0.001045118,"domain_scores_codex":[0.9972658,0.0008182465,0.0002078714,0.0002811513,0.001270825,0.0001559699],"domain_scores_gemma":[0.9972895,0.001234741,0.0001500087,0.0008666241,0.0004040856,0.0000549447],"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.00001342834,0.00002525327,0.0000908152,0.0003119661,0.00002469024,0.00005599927,0.0001830187,0.01098416,0.002418285,0.9251935,0.003617286,0.05708161],"study_design_scores_gemma":[0.00004737151,0.00004788276,0.00006890266,0.0002938549,0.00004238607,0.0001640231,0.00005124588,0.06089827,0.005054947,0.7445852,0.1887148,0.00003121013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003964269,0.0008207153,0.9901715,0.0002845205,0.0001082493,0.0000575489,0.00004101409,0.000405637,0.007714533],"genre_scores_gemma":[0.03497631,0.002540755,0.9499645,0.0003573607,0.0002532267,0.0004944811,0.0001970233,0.0003939697,0.01082242],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01011936,"threshold_uncertainty_score":0.03385258,"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","authors":[{"name":"Zhao Gu","is_ca":true},{"name":"Rodolfo Pellizzoni","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000613113,0.0007411414,0.0004270821,0.0003984848,0.0003486415,0.0005569975,0.0008137317,0.0002820895,0.001075237],"category_scores_gemma":[0.001877789,0.0003093162,0.0004425947,0.0004507829,0.0005515188,0.0006337832,0.0006089627,0.0004293169,0.0003119578],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006094699,"about_ca_system_score_gemma":0.001147523,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001852644,"about_ca_topic_score_gemma":0.003754905,"domain_scores_codex":[0.9995531,0.0001162057,0.00002323501,0.00009529582,0.00009564525,0.0001163741],"domain_scores_gemma":[0.9991217,0.0004083476,0.0001200768,0.0001884283,0.0001246623,0.00003672584],"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.0004797651,0.000230138,0.004419034,0.0003091746,0.00005444884,0.0002952105,0.0001887295,0.8082675,0.05748026,0.01104707,0.002720629,0.1145081],"study_design_scores_gemma":[0.00003061298,0.0001642977,0.000429196,0.000009254009,0.00001626197,0.00003976172,0.00003707005,0.9735748,0.0200244,0.004535248,0.001131901,0.000007253559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4766907,0.0004187512,0.5056067,0.0001391712,0.00006044962,0.0001122426,0.0002247155,0.008084094,0.008663271],"genre_scores_gemma":[0.7803825,0.0001034525,0.2166436,0.0000666874,0.00001723801,0.0001038783,0.0003654315,0.0007395261,0.001577743],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001852644,"threshold_uncertainty_score":0.004422069,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}