{"id":"W4248081385","doi":"10.1109/iccad.1990.129931","title":"A detailed router for field-programmable gate arrays","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Field-programmable gate array; Router; Routing (electronic design automation); Computer science; Interconnection; Routing algorithm; Gate array; Parallel computing; Field (mathematics); Embedded system; Computer network; Routing protocol; Mathematics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002197783,0.0004410927,0.0003242701,0.0005278896,0.000318509,0.0007147299,0.0008779948,0.0005380961,0.01411562],"category_scores_gemma":[0.0005856789,0.0003101246,0.0003672922,0.0004870275,0.0002079499,0.001077709,0.0003894685,0.0005494333,0.00287452],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004815788,"about_ca_system_score_gemma":0.0005370938,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001371996,"about_ca_topic_score_gemma":0.003561375,"domain_scores_codex":[0.9998003,0.00003633174,0.00001496226,0.00004203204,0.00008282866,0.00002358002],"domain_scores_gemma":[0.9997558,0.00005568215,0.00001845854,0.00008686259,0.00006991297,0.00001317471],"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.0003378834,0.0001152948,0.001097625,0.0003338654,0.0001155115,0.0002879058,0.0000743311,0.1503025,0.06307656,0.09054792,0.05276528,0.6409453],"study_design_scores_gemma":[0.0001762422,0.0006700429,0.001556682,0.00005251982,0.0001088972,0.0008530684,0.00002943775,0.7104483,0.05454309,0.03819715,0.1932699,0.00009469367],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01134133,0.0004844848,0.9654029,0.0001658236,0.0001252469,0.0001674866,0.0004842365,0.01152622,0.01030219],"genre_scores_gemma":[0.1511229,0.0005448443,0.8113464,0.000273196,0.00008012912,0.0002644669,0.002962735,0.0004188424,0.03298655],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01411562,"threshold_uncertainty_score":0.04722148,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01919086254441044,"score_gpt":0.2065523698714564,"score_spread":0.187361507327046,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}