{"id":"W2170714987","doi":"10.1109/icvd.2004.1261038","title":"Shrubbery: a new algorithm for quickly growing high-quality Steiner trees","year":2004,"lang":"en","type":"article","venue":"","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph","funders":"","keywords":"Steiner tree problem; Computer science; Tree (set theory); Routing (electronic design automation); Heuristic; Set (abstract data type); Interconnection; Algorithm; Shortest path problem; Path (computing); Approximation algorithm; Mathematics; Mathematical optimization; Combinatorics; Theoretical computer science; Graph; Artificial intelligence; Telecommunications","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002597385,0.0002967268,0.0003451999,0.0001340869,0.00008207485,0.00006803675,0.0002514313,0.0001401153,0.0001227408],"category_scores_gemma":[0.00001615895,0.0002662026,0.0001316592,0.000281982,0.00002675872,0.0007860753,0.00003195123,0.0001501662,0.0001852047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002074091,"about_ca_system_score_gemma":0.00006976115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006405379,"about_ca_topic_score_gemma":0.000123873,"domain_scores_codex":[0.9984617,0.00001333037,0.0004171055,0.0002964349,0.0002563625,0.0005550351],"domain_scores_gemma":[0.9992696,0.00007620761,0.00003453927,0.0003806002,0.00004427049,0.0001947773],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005111481,0.0001849096,0.000238966,0.0003114011,0.0004975717,0.00002714278,0.001342675,0.1929726,0.07442546,0.02295638,0.02337676,0.683615],"study_design_scores_gemma":[0.02181771,0.001069424,0.009491046,0.0003311937,0.0002919626,0.00006117807,0.0005476581,0.2042567,0.6489017,0.01995863,0.08850554,0.004767254],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08997149,0.0002175477,0.9053774,0.000393984,0.0009131385,0.0004521238,0.00001539326,0.001236745,0.001422193],"genre_scores_gemma":[0.7160541,0.00003138352,0.2799907,0.0003929062,0.0008251807,0.00008420907,0.00003295489,0.0001338983,0.002454586],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6788478,"threshold_uncertainty_score":0.999979,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01484288593307164,"score_gpt":0.2387054708610056,"score_spread":0.2238625849279339,"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."}}