{"id":"W2047041799","doi":"10.1007/s10898-005-4207-8","title":"Approximations and Lower Bounds for the Length of Minimal Euclidean Steiner Trees","year":2006,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Mathematics; Upper and lower bounds; Combinatorics; Conjecture; Euclidean space; Euclidean geometry; Tree (set theory); Discrete mathematics; Space (punctuation); Topology (electrical circuits); Mathematical analysis; Geometry; Computer science","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.0001488906,0.00006600058,0.0001167836,0.00003255801,0.00003792054,0.00003260727,0.00006957608,0.00004459321,0.000006165167],"category_scores_gemma":[0.00002518353,0.00004627747,0.0000574445,0.0001080647,0.00002862286,0.0001714432,0.000006035507,0.00004095364,9.133147e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003739433,"about_ca_system_score_gemma":0.00001301677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004950211,"about_ca_topic_score_gemma":0.000006521983,"domain_scores_codex":[0.9994879,0.000009289892,0.0002926479,0.00003626833,0.0001007603,0.00007316983],"domain_scores_gemma":[0.999622,0.00004685287,0.0001214451,0.00005731778,0.0001337965,0.00001859441],"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.00003792551,0.00004420774,0.0007536155,0.00002663143,0.00005128859,8.921888e-7,0.00003142405,0.9843182,0.0006710169,0.002980242,0.007259214,0.003825354],"study_design_scores_gemma":[0.0007805291,0.0003335305,0.004317738,0.00005558089,0.0001435192,0.00005398973,0.00007700307,0.9885505,0.001261118,0.001599737,0.002689465,0.0001372618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02012637,0.0008043852,0.9773295,0.0001505411,0.000121161,0.0001299916,0.00001892033,0.00002947576,0.001289667],"genre_scores_gemma":[0.9137946,0.0001198192,0.08591913,0.00001053783,0.0001170385,0.000003106069,0.00000312821,0.000008548181,0.00002410906],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8936682,"threshold_uncertainty_score":0.188714,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00582047564380004,"score_gpt":0.2107929045233077,"score_spread":0.2049724288795077,"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."}}