{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001299906,0.00008705493,0.0001206802,0.00003765235,0.00005626852,0.0000272104,0.0001453638,0.0000529591,5.667986e-7],"category_scores_gemma":[0.00002145923,0.00005782321,0.00008547163,0.0001083278,0.00002618707,0.00000143461,0.000008246433,0.00006749638,3.903012e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001562984,"about_ca_system_score_gemma":0.00008170851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001286336,"about_ca_topic_score_gemma":0.0001097569,"domain_scores_codex":[0.99942,0.00001484454,0.0002019259,0.00009923903,0.0000489301,0.000214984],"domain_scores_gemma":[0.9995985,0.00005504876,0.00006844397,0.00006559083,0.00007525191,0.0001371573],"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.00005708044,0.00005480119,0.005795104,0.00002932459,0.00006370789,0.00002308428,0.000009487556,0.9138175,0.05792167,0.001472182,0.0003206068,0.02043544],"study_design_scores_gemma":[0.0005815696,0.001193219,0.01770568,0.00002743517,0.00003614741,0.00005264826,0.000002861251,0.9617284,0.01667417,0.00007788302,0.001747668,0.0001723193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5803035,0.0007734157,0.4187346,0.0000297282,0.0001005637,0.00004355728,0.000005232419,0.000001914016,0.000007510194],"genre_scores_gemma":[0.9964545,0.000002097288,0.003092194,0.00006448914,0.0003754897,6.68299e-7,0.000003614854,0.000004890067,0.000002083694],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.416151,"threshold_uncertainty_score":0.2357962,"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."}}