{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":2,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":2,"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":"34e9ba243374","filters":{"venue":"Proceedings EURO-DAC '92: European Design Automation Conference"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jens Lienig","is_ca":true},{"name":"K. Thulasiraman","is_ca":true},{"name":"M.N.S. Swamy","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09028723337086844,"gpt":0.2670350396055092,"spread":0.1767478062346408,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007326221,0.0008555423,0.0006046777,0.001283043,0.000672564,0.001580665,0.00131489,0.0009667551,0.01243526],"category_scores_gemma":[0.002069066,0.0004636677,0.0008968936,0.001354269,0.0004607199,0.001745225,0.0009762318,0.0009965317,0.004602552],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001022074,"about_ca_system_score_gemma":0.0007635626,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001472563,"about_ca_topic_score_gemma":0.00248556,"domain_scores_codex":[0.9994339,0.0001294713,0.00005893202,0.0001034035,0.0002246825,0.00004950506],"domain_scores_gemma":[0.9994329,0.0001696972,0.00005097349,0.0001296991,0.0002022002,0.0000146001],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00006068149,0.00003169478,0.0003226474,0.0003043154,0.00005978443,0.00007475569,0.0001338821,0.265717,0.004878058,0.1348906,0.009741073,0.5837854],"study_design_scores_gemma":[0.00006047834,0.00006130046,0.0002501983,0.00009779489,0.00003668393,0.0002169143,0.00004711756,0.7803332,0.005348907,0.1445297,0.06898212,0.00003556586],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00165465,0.000624831,0.9925274,0.00008857564,0.00007306045,0.00006423717,0.00007913463,0.0008405461,0.004047582],"genre_scores_gemma":[0.04110168,0.001024181,0.9465088,0.0001154942,0.00006625149,0.000331268,0.0004905603,0.0003782703,0.009983471],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01243526,"threshold_uncertainty_score":0.04160011,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"C.-J. Shi","is_ca":true},{"name":"J.A. Brzozowski","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05243470574356956,"gpt":0.2420089333845209,"spread":0.1895742276409513,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000468886,0.0005437106,0.0004161096,0.0007343727,0.0004354068,0.0007753134,0.0007822176,0.0003959311,0.006976691],"category_scores_gemma":[0.001739522,0.0002836385,0.0003590514,0.001121038,0.0004485297,0.001186791,0.0008333661,0.0005974222,0.0007498293],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000830373,"about_ca_system_score_gemma":0.001223551,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001688554,"about_ca_topic_score_gemma":0.003883818,"domain_scores_codex":[0.9994895,0.0001729135,0.00003471738,0.00006465669,0.000174671,0.00006351118],"domain_scores_gemma":[0.9993962,0.0003422577,0.00005075978,0.00009925912,0.00009361902,0.00001787257],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0004186183,0.0001412483,0.0004850716,0.0002924925,0.00002863906,0.0001938086,0.0001174904,0.2918775,0.02692104,0.1303606,0.008344969,0.5408185],"study_design_scores_gemma":[0.0000662742,0.000132542,0.0001361226,0.00003824643,0.0000139797,0.00009381361,0.00003636812,0.922774,0.01176563,0.05753153,0.007394338,0.00001721234],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03054941,0.000283772,0.9593801,0.0001715553,0.00003181229,0.00009770023,0.0002235042,0.001284251,0.007977864],"genre_scores_gemma":[0.3379218,0.0002299049,0.6566384,0.0001394161,0.00002541399,0.0002778742,0.0008012694,0.0002319346,0.003733995],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006976691,"threshold_uncertainty_score":0.02333939,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}