{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":3,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":3,"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":"0d8cf5e2c2c9","filters":{"venue":"2018 55th ACM/ESDA/IEEE Design Automation Conference (DAC)"}},"results":[{"id":"W2952857977","doi":"10.1109/dac.2018.8465915","title":"Loom: Exploiting Weight and Activation Precisions to Accelerate Convolutional Neural Networks","year":2018,"lang":"en","type":"article","venue":"2018 55th ACM/ESDA/IEEE Design Automation Conference (DAC)","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Convolutional neural network; Computer science; LOOM; Granularity; Inference; Energy (signal processing); Parallel computing; Layer (electronics); Deep neural networks; Artificial neural network; Algorithm; Artificial intelligence; Mathematics; Statistics; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.0962652447524089,"gpt":0.3100672727499506,"spread":0.2138020279975417,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005541524,0.0004413867,0.0003625537,0.0003100263,0.0009289665,0.0006174468,0.001487222,0.0002077877,0.0002163075],"category_scores_gemma":[0.0005183295,0.0004423857,0.00006714933,0.00122324,0.0002348359,0.002480007,0.0004891876,0.0003359485,0.0003574284],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001556882,"about_ca_system_score_gemma":0.0002231726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001571326,"about_ca_topic_score_gemma":0.00001121312,"domain_scores_codex":[0.9965181,0.0003074283,0.0007354688,0.001103579,0.0005714102,0.0007640233],"domain_scores_gemma":[0.9960901,0.000953134,0.0004597888,0.001219319,0.0007814931,0.0004962247],"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.0003278696,0.0004680595,0.001039306,0.00006572155,0.0001759504,0.00001608061,0.004809278,0.09401366,0.1010233,0.1576445,0.06965623,0.5707601],"study_design_scores_gemma":[0.0004694206,0.0002259834,0.004213995,0.00008860181,0.00001294812,0.00002533915,0.00002436312,0.9667928,0.009483896,0.01615021,0.001995761,0.0005166472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03130829,0.00002587893,0.9614086,0.004058058,0.000807172,0.001170256,0.000007453668,0.0007857726,0.0004285006],"genre_scores_gemma":[0.8218268,0.00003217277,0.1750282,0.001797704,0.0006478559,0.0003450539,0.00002958605,0.00003533982,0.0002572543],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8727792,"threshold_uncertainty_score":0.9998028,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4243315213","doi":"10.1109/dac.2018.8465799","title":"An Architecture-Agnostic Integer Linear Programming Approach to CGRA Mapping","year":2018,"lang":"en","type":"article","venue":"2018 55th ACM/ESDA/IEEE Design Automation Conference (DAC)","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Architecture; Computer architecture; Integer programming; Parallel computing; Integer (computer science); Set (abstract data type); Linear programming; Programming language; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.09188084650747681,"gpt":0.3160060538151676,"spread":0.2241252073076908,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002624202,0.0007600157,0.000736952,0.0010328,0.000529895,0.001233414,0.004481961,0.0004318626,0.0000566168],"category_scores_gemma":[0.001054247,0.0007180451,0.0001598622,0.001732898,0.0002959539,0.001634856,0.0004275743,0.0005556006,0.0008097552],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002672644,"about_ca_system_score_gemma":0.0005589885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001143666,"about_ca_topic_score_gemma":0.0000230261,"domain_scores_codex":[0.9936467,0.001122437,0.001196529,0.001690933,0.001101648,0.001241784],"domain_scores_gemma":[0.9940302,0.0005432035,0.0005962786,0.003125284,0.001064104,0.0006409396],"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.0002199078,0.002068201,0.0007581626,0.0009428681,0.0004079404,0.0001027324,0.07718537,0.005056264,0.2480808,0.08560627,0.04576117,0.5338103],"study_design_scores_gemma":[0.0006268617,0.001708993,0.0007166843,0.0006516628,0.00003449108,0.0001882672,0.0002788513,0.9084206,0.06443999,0.01224259,0.008996555,0.001694514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004086748,0.00002720311,0.9852208,0.0005847565,0.0009367045,0.002834744,0.000007847772,0.003873148,0.002428035],"genre_scores_gemma":[0.4790271,0.000002382917,0.5193719,0.0005105961,0.0004038776,0.0004464284,0.00001622791,0.00005179627,0.0001697308],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9033643,"threshold_uncertainty_score":0.9999682,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4238447347","doi":"10.1109/dac.2018.8465835","title":"A Machine Learning Framework to Identify Detailed Routing Short Violations from a Placed Netlist","year":2018,"lang":"en","type":"article","venue":"2018 55th ACM/ESDA/IEEE Design Automation Conference (DAC)","topic":"Integrated Circuits and Semiconductor Failure Analysis","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Microsemi (Canada); University of Calgary","funders":"","keywords":"Netlist; Computer science; Routing (electronic design automation); Router; Network routing; Metrics; Routing domain; Static routing; Machine learning; Distance-vector routing protocol; Artificial neural network; Routing protocol; Distributed computing; Artificial intelligence; Computer network; Embedded system","retraction":null,"screen_n_in":null,"score":{"opus":0.05266024591243023,"gpt":0.29483534799917,"spread":0.2421751020867398,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006557847,0.0005590497,0.0006319854,0.0005256535,0.0005358005,0.0006796609,0.000796452,0.0004528853,0.002677925],"category_scores_gemma":[0.001081685,0.0005616157,0.0001840576,0.001142018,0.00009267716,0.0006503261,0.00006951227,0.0007822081,0.001482455],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002750093,"about_ca_system_score_gemma":0.0001518458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000535973,"about_ca_topic_score_gemma":0.0005145608,"domain_scores_codex":[0.9968249,0.0002901394,0.0009287754,0.0006889671,0.0005275994,0.0007396552],"domain_scores_gemma":[0.9974853,0.0005330545,0.0001871326,0.0008871214,0.0005836335,0.0003237363],"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.0001155903,0.00015087,0.01817404,0.00008748569,0.001585045,0.00003555381,0.02170341,0.06101755,0.8503965,0.0035888,0.01715262,0.02599259],"study_design_scores_gemma":[0.0003270522,0.000119018,0.006506983,0.0003218995,0.0001862845,0.000006387908,0.0005190736,0.9667434,0.02000899,0.002076494,0.00235524,0.0008292039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2764615,0.00006576272,0.7192387,0.000156749,0.0008391432,0.0004681434,0.00005759722,0.001207796,0.00150457],"genre_scores_gemma":[0.97364,0.00002697056,0.02468349,0.0002446717,0.0005853341,0.0001079334,0.0002527648,0.0001059968,0.0003528137],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9057258,"threshold_uncertainty_score":0.9996836,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}