{"id":"W2060572307","doi":"10.1109/cjece.2006.259174","title":"An efficient graph-based steiner tree heuristic for the global routing of macro cells","year":2006,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph","funders":"","keywords":"Steiner tree problem; Macro; Heuristic; Computer science; Tree (set theory); Graph; Routing (electronic design automation); Theoretical computer science; Combinatorics; Mathematics; Artificial intelligence; Computer network","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"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.0003912273,0.000703453,0.0008335838,0.000938369,0.0004628016,0.0004072375,0.001043223,0.0006982184,0.002210082],"category_scores_gemma":[0.0006483946,0.000461094,0.0006575941,0.0009847234,0.0004089224,0.001006422,0.0006566666,0.0004403075,0.0003990105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005478833,"about_ca_system_score_gemma":0.001075659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001682565,"about_ca_topic_score_gemma":0.003371183,"domain_scores_codex":[0.9998498,0.00004301145,0.00000846503,0.00003143233,0.00004035622,0.00002680992],"domain_scores_gemma":[0.9997671,0.0001134825,0.00003229967,0.00002553602,0.00004074453,0.00002082159],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000146259,0.00008198796,0.0007523136,0.0001399632,0.00006233117,0.0002121768,0.0001246584,0.827452,0.01578022,0.009372034,0.003480667,0.1423953],"study_design_scores_gemma":[0.00004021144,0.0001268314,0.0001902413,0.000008231607,0.00002163522,0.00008315603,0.00003528514,0.9918716,0.002513422,0.003673014,0.001426447,0.0000100104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05698368,0.00037341,0.9390784,0.0001123629,0.00002745286,0.0001513559,0.0001136348,0.0005834649,0.002576245],"genre_scores_gemma":[0.2460415,0.000252395,0.7506214,0.00008199051,0.00001943189,0.0002139624,0.0004545735,0.0001668731,0.002147845],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002210082,"threshold_uncertainty_score":0.007393479,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.003440906801038219,"score_gpt":0.1780704800521457,"score_spread":0.1746295732511075,"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."}}