{"id":"W2162694675","doi":"10.1109/iccd.2008.4751836","title":"A parallel Steiner tree heuristic for macro cell routing","year":2008,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph","funders":"","keywords":"Steiner tree problem; Computer science; Routing (electronic design automation); Tree (set theory); Heuristic; Parameterized complexity; Very-large-scale integration; Macro; Set (abstract data type); Parallel computing; Algorithm; Mathematical optimization; Mathematics; Computer network; Combinatorics; Artificial intelligence; Embedded system","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.00005042623,0.0001088931,0.0001211975,0.00003817118,0.00005341394,0.00001054128,0.00008844523,0.00005731401,0.00005045989],"category_scores_gemma":[0.000009534999,0.00009726642,0.00006018504,0.00005573535,0.00001226359,0.00004966074,0.00001053604,0.00006206301,0.00003305015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001981854,"about_ca_system_score_gemma":0.000005998113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001000691,"about_ca_topic_score_gemma":0.000004780598,"domain_scores_codex":[0.99947,0.000004651774,0.000143205,0.0001043752,0.00005938769,0.0002183755],"domain_scores_gemma":[0.9997418,0.0000480193,0.00001144362,0.0001357968,0.00001808374,0.00004487493],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007952838,0.0002769577,0.003344393,0.0008365722,0.0001615991,0.0002026457,0.002778647,0.01238731,0.1529019,0.009485995,0.7579129,0.05963146],"study_design_scores_gemma":[0.002993535,0.0004622868,0.002221229,0.00006648734,0.00007296682,0.0001234556,0.000189157,0.6246073,0.2989949,0.003500613,0.065042,0.001726088],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01785623,0.0001833924,0.9055771,0.00001953426,0.0000785944,0.0002668332,0.000005437093,0.001345049,0.07466789],"genre_scores_gemma":[0.9413224,0.00004587207,0.05338778,0.00005285998,0.00008296061,0.00006036725,0.000005286512,0.00003506808,0.005007404],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9234661,"threshold_uncertainty_score":0.396641,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01818645157864015,"score_gpt":0.2069256173150415,"score_spread":0.1887391657364013,"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."}}