{"meta":{"query_hash":"0d8cf5e2c2c9","filters":{"venue":"2018 55th ACM/ESDA/IEEE Design Automation Conference (DAC)"},"cohort_total":3,"direct_labels_cover":0,"predictions_cover":3,"exported":3,"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/0d8cf5e2c2c9","api":"https://metacan.xera.ac/api/v1/cohort?venue=2018+55th+ACM%2FESDA%2FIEEE+Design+Automation+Conference+%28DAC%29"},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0962652447524089,"score_gpt":0.3100672727499506,"score_spread":0.21380202799754172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952857977","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.031308293,0.00002587893,0.9614086,0.0040580584,0.000807172,0.0011702558,0.0000074536683,0.0007857726,0.00042850059],"genre_scores_gemma":[0.82182676,0.000032172775,0.17502825,0.0017977038,0.0006478559,0.00034505394,0.000029586046,0.00003533982,0.0002572543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965181,0.00030742833,0.0007354688,0.0011035786,0.0005714102,0.00076402334],"domain_scores_gemma":[0.99609005,0.000953134,0.00045978883,0.0012193188,0.00078149315,0.00049622473],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055415236,0.00044138666,0.00036255372,0.0003100263,0.0009289665,0.0006174468,0.0014872223,0.00020778773,0.00021630747],"category_scores_gemma":[0.0005183295,0.00044238567,0.000067149325,0.0012232397,0.00023483585,0.002480007,0.0004891876,0.00033594848,0.00035742842],"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.00032786955,0.0004680595,0.0010393062,0.00006572155,0.00017595042,0.000016080614,0.0048092776,0.09401366,0.101023346,0.15764445,0.06965623,0.5707601],"study_design_scores_gemma":[0.00046942063,0.00022598343,0.004213995,0.00008860181,0.000012948117,0.00002533915,0.000024363118,0.9667928,0.009483896,0.016150214,0.0019957607,0.0005166472],"about_ca_topic_score_codex":0.000015713264,"about_ca_topic_score_gemma":0.000011213123,"teacher_disagreement_score":0.8727792,"about_ca_system_score_codex":0.00015568822,"about_ca_system_score_gemma":0.0002231726,"threshold_uncertainty_score":0.99980277},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05266024591243023,"score_gpt":0.29483534799917,"score_spread":0.24217510208673976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238447347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27646154,0.000065762724,0.7192387,0.00015674895,0.0008391432,0.00046814344,0.000057597215,0.0012077963,0.0015045701],"genre_scores_gemma":[0.97364,0.000026970556,0.024683489,0.00024467168,0.00058533414,0.00010793345,0.0002527648,0.000105996776,0.0003528137],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99682486,0.0002901394,0.0009287754,0.0006889671,0.00052759936,0.00073965517],"domain_scores_gemma":[0.99748534,0.0005330545,0.00018713255,0.0008871214,0.00058363355,0.00032373625],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006557847,0.00055904966,0.0006319854,0.00052565354,0.00053580053,0.0006796609,0.000796452,0.00045288526,0.002677925],"category_scores_gemma":[0.0010816847,0.00056161574,0.00018405757,0.0011420177,0.00009267716,0.0006503261,0.000069512265,0.00078220805,0.001482455],"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.000115590316,0.00015086996,0.018174043,0.00008748569,0.0015850455,0.000035553814,0.021703415,0.06101755,0.85039645,0.0035887999,0.017152619,0.025992593],"study_design_scores_gemma":[0.00032705223,0.000119018005,0.006506983,0.0003218995,0.00018628452,0.0000063879083,0.0005190736,0.96674335,0.020008992,0.0020764936,0.0023552398,0.00082920387],"about_ca_topic_score_codex":0.000535973,"about_ca_topic_score_gemma":0.00051456084,"teacher_disagreement_score":0.90572584,"about_ca_system_score_codex":0.00027500925,"about_ca_system_score_gemma":0.00015184579,"threshold_uncertainty_score":0.99968356},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09188084650747681,"score_gpt":0.3160060538151676,"score_spread":0.2241252073076908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243315213","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.004086748,0.000027203114,0.9852208,0.0005847565,0.0009367045,0.0028347438,0.000007847772,0.0038731475,0.0024280355],"genre_scores_gemma":[0.4790271,0.000002382917,0.51937187,0.00051059615,0.0004038776,0.00044642837,0.000016227914,0.000051796273,0.00016973083],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936467,0.0011224367,0.0011965295,0.0016909332,0.0011016475,0.0012417836],"domain_scores_gemma":[0.9940302,0.0005432035,0.0005962786,0.0031252836,0.001064104,0.00064093963],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0026242023,0.00076001574,0.000736952,0.0010328004,0.000529895,0.001233414,0.0044819615,0.00043186257,0.000056616802],"category_scores_gemma":[0.0010542466,0.0007180451,0.00015986217,0.0017328984,0.00029595388,0.0016348561,0.00042757427,0.00055560056,0.00080975523],"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.00021990782,0.0020682013,0.0007581626,0.0009428681,0.0004079404,0.000102732374,0.07718537,0.005056264,0.24808079,0.08560627,0.045761168,0.5338103],"study_design_scores_gemma":[0.0006268617,0.0017089929,0.0007166843,0.00065166276,0.000034491077,0.00018826716,0.00027885125,0.90842056,0.06443999,0.012242595,0.008996555,0.0016945142],"about_ca_topic_score_codex":0.00011436662,"about_ca_topic_score_gemma":0.000023026098,"teacher_disagreement_score":0.9033643,"about_ca_system_score_codex":0.0002672644,"about_ca_system_score_gemma":0.00055898854,"threshold_uncertainty_score":0.99996823},"labels":[],"label_agreement":null}]}