{"id":"W2104156100","doi":"10.1109/ccece.2005.1557021","title":"Generating diverse pools of Steiner trees for VLSI routing","year":2006,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph","funders":"","keywords":"Steiner tree problem; Very-large-scale integration; Routing (electronic design automation); Computer science; Tree (set theory); Interconnection; Iterated function; Set (abstract data type); Spanning tree; Combinatorics; Algorithm; Mathematics; 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.00007775817,0.0000789062,0.0001124458,0.00004153896,0.00002970942,0.00001408269,0.00005982644,0.00004498292,0.00003020131],"category_scores_gemma":[0.000009162876,0.00007009818,0.00005335455,0.00005396787,0.000008531422,0.00007110822,0.00001155241,0.00003149228,0.000001940849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001411747,"about_ca_system_score_gemma":0.000003062343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007894669,"about_ca_topic_score_gemma":0.00004222673,"domain_scores_codex":[0.9995562,0.000004476008,0.0001744257,0.00007237593,0.00005613564,0.0001363985],"domain_scores_gemma":[0.9998139,0.00003388602,0.00002067363,0.00008898915,0.000028078,0.00001443092],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000002414254,0.00001767212,0.001453709,0.00005936828,0.00002215328,0.000001315186,0.00007438166,0.02679936,0.925726,0.006423405,0.01437717,0.02504307],"study_design_scores_gemma":[0.0002912886,0.00005080779,0.0005386283,0.00002684126,0.00001847322,0.000001420736,0.0001038181,0.2941236,0.7027037,0.0005075401,0.001430006,0.000203899],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2680455,0.0001289603,0.7095246,0.00001217508,0.00007916673,0.0002519992,0.00001556173,0.000760328,0.02118172],"genre_scores_gemma":[0.9435922,0.000002816156,0.05545152,0.00001261363,0.0001320936,0.00001729643,0.000008263629,0.00001822529,0.0007649926],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6755467,"threshold_uncertainty_score":0.2858521,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0132736315981807,"score_gpt":0.2151154598674411,"score_spread":0.2018418282692604,"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."}}