{"id":"W1570456368","doi":"10.1109/ccece.2001.933590","title":"An efficient rectilinear Steiner tree algorithm for VLSI global routing","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo; University of Guelph","funders":"","keywords":"Steiner tree problem; Routing (electronic design automation); Very-large-scale integration; Heuristics; Computer science; Algorithm; Tree (set theory); Spanning tree; Integrated circuit layout; Mathematics; Topology (electrical circuits); Mathematical optimization; Discrete mathematics; Combinatorics; Integrated circuit; Computer network","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001143479,0.0001358317,0.0001319982,0.000032369,0.000051005,0.0000410439,0.000122505,0.00008610395,0.0001135928],"category_scores_gemma":[0.000009854512,0.000122128,0.00006365863,0.000139377,0.00001116358,0.00006487969,0.00000983482,0.00006247031,0.00003012348],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007223519,"about_ca_system_score_gemma":0.000002233525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001400105,"about_ca_topic_score_gemma":0.00000829903,"domain_scores_codex":[0.9992825,0.00001013745,0.0001698252,0.0001672955,0.00009799407,0.0002722325],"domain_scores_gemma":[0.9996453,0.00002121028,0.00001297992,0.0002077965,0.00003463358,0.00007810469],"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.000001319603,0.00006282231,0.0000481561,0.00001274107,0.0000183687,0.000003262359,0.00008097653,0.004343472,0.001880823,0.0004272123,0.006734548,0.9863863],"study_design_scores_gemma":[0.0002124448,0.0001040186,0.0000517312,0.000007662858,0.000009238879,0.000006777179,0.00003679881,0.9825149,0.01336938,0.0000526635,0.003462367,0.0001720607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008317015,0.0001520134,0.9615506,0.00001899205,0.000181968,0.0002742489,0.0000208178,0.001913884,0.02757046],"genre_scores_gemma":[0.7846047,0.00001290497,0.2144339,0.00005764982,0.0002496646,0.00004447996,0.000007682346,0.00003634293,0.0005527529],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9862142,"threshold_uncertainty_score":0.4980234,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01568185559463069,"score_gpt":0.2371789824378945,"score_spread":0.2214971268432638,"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."}}