{"meta":{"query_hash":"34e9ba243374","filters":{"venue":"Proceedings EURO-DAC '92: European Design Automation Conference"},"cohort_total":2,"direct_labels_cover":0,"predictions_cover":2,"exported":2,"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/34e9ba243374","api":"https://metacan.xera.ac/api/v1/cohort?venue=Proceedings+EURO-DAC+%2792%3A+European+Design+Automation+Conference"},"results":[{"id":"W4229764280","doi":"10.1109/eurdac.1992.246233","title":"Efficient constrained encoding for VLSI sequential logic synthesis","year":2003,"lang":"en","type":"article","venue":"Proceedings EURO-DAC '92: European Design Automation Conference","topic":"VLSI and FPGA Design Techniques","field":"Engineering","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 Waterloo","funders":"","keywords":"Encoding (memory); Heuristic; Computer science; Asynchronous communication; Sequential logic; Variety (cybernetics); Algorithm; State (computer science); Theoretical computer science; Parallel computing; Arithmetic; Logic gate; Artificial intelligence; Mathematics","score_opus":0.05243470574356956,"score_gpt":0.24200893338452087,"score_spread":0.1895742276409513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229764280","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.030549405,0.00028377195,0.95938015,0.00017155528,0.00003181229,0.00009770023,0.00022350416,0.0012842508,0.007977864],"genre_scores_gemma":[0.3379218,0.0002299049,0.65663844,0.00013941606,0.000025413994,0.0002778742,0.0008012694,0.00023193457,0.0037339947],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99948955,0.00017291347,0.000034717385,0.00006465669,0.00017467099,0.00006351118],"domain_scores_gemma":[0.9993962,0.0003422577,0.00005075978,0.00009925912,0.00009361902,0.000017872566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000468886,0.0005437106,0.00041610957,0.0007343727,0.00043540684,0.0007753134,0.0007822176,0.0003959311,0.006976691],"category_scores_gemma":[0.0017395217,0.00028363854,0.00035905142,0.0011210375,0.00044852972,0.0011867915,0.0008333661,0.0005974222,0.00074982934],"study_design_candidate":"bench_or_experimental","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.00041861832,0.00014124831,0.00048507162,0.0002924925,0.00002863906,0.00019380865,0.000117490374,0.29187748,0.026921041,0.13036062,0.008344969,0.5408185],"study_design_scores_gemma":[0.0000662742,0.00013254202,0.00013612259,0.000038246435,0.0000139797,0.000093813615,0.000036368117,0.922774,0.011765631,0.057531532,0.0073943385,0.00001721234],"about_ca_topic_score_codex":0.0016885543,"about_ca_topic_score_gemma":0.0038838177,"teacher_disagreement_score":0.006976691,"about_ca_system_score_codex":0.000830373,"about_ca_system_score_gemma":0.0012235508,"threshold_uncertainty_score":0.02333939},"labels":[],"label_agreement":null},{"id":"W4251343752","doi":"10.1109/eurdac.1992.246230","title":"Routing algorithms for multi-chip modules","year":2003,"lang":"en","type":"article","venue":"Proceedings EURO-DAC '92: European Design Automation Conference","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Static routing; Routing (electronic design automation); Link-state routing protocol; Equal-cost multi-path routing; Policy-based routing; Placement; Multipath routing; Dynamic Source Routing; Destination-Sequenced Distance Vector routing; Algorithm; Channel (broadcasting); Distributed computing; Computer network; Physical design; Routing protocol; Embedded system; Circuit design","score_opus":0.09028723337086844,"score_gpt":0.26703503960550923,"score_spread":0.1767478062346408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251343752","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.0016546499,0.00062483095,0.99252737,0.00008857564,0.00007306045,0.000064237174,0.00007913463,0.0008405461,0.004047582],"genre_scores_gemma":[0.04110168,0.0010241809,0.94650877,0.00011549418,0.00006625149,0.00033126798,0.00049056025,0.00037827028,0.009983471],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99943393,0.00012947134,0.000058932015,0.000103403465,0.00022468246,0.000049505055],"domain_scores_gemma":[0.99943286,0.00016969725,0.000050973493,0.00012969908,0.0002022002,0.000014600098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073262205,0.0008555423,0.0006046777,0.0012830427,0.00067256397,0.0015806652,0.0013148899,0.00096675515,0.012435257],"category_scores_gemma":[0.0020690656,0.00046366773,0.00089689356,0.0013542688,0.00046071986,0.0017452253,0.00097623176,0.0009965317,0.004602552],"study_design_candidate":"bench_or_experimental","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.000060681494,0.000031694784,0.0003226474,0.00030431536,0.000059784426,0.00007475569,0.0001338821,0.26571703,0.0048780576,0.1348906,0.009741073,0.5837854],"study_design_scores_gemma":[0.00006047834,0.00006130046,0.00025019833,0.00009779489,0.000036683927,0.00021691427,0.000047117563,0.78033316,0.0053489073,0.14452972,0.06898212,0.000035565863],"about_ca_topic_score_codex":0.0014725631,"about_ca_topic_score_gemma":0.00248556,"teacher_disagreement_score":0.012435257,"about_ca_system_score_codex":0.0010220737,"about_ca_system_score_gemma":0.00076356257,"threshold_uncertainty_score":0.04160011},"labels":[],"label_agreement":null}]}