{"id":"W1536432301","doi":"10.1007/s00453-001-0050-6","title":"Grade of Service Steiner Minimum Trees in the Euclidean Plane","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Euclidean geometry; Euclidean distance; Approximation algorithm; Generalization; Path (computing); Spanning tree; Terminal (telecommunication); Discrete mathematics; Point (geometry); Computer science; Geometry","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.0001364213,0.0001058207,0.0001403055,0.00007929237,0.00001444686,0.00001046471,0.0002577003,0.00006516009,0.00003168652],"category_scores_gemma":[0.000005105235,0.00007884363,0.00003166763,0.0002999537,0.00001654273,0.0000583817,0.00001409037,0.000127406,0.00001659117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001230361,"about_ca_system_score_gemma":0.000004626245,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001442109,"about_ca_topic_score_gemma":0.0001492807,"domain_scores_codex":[0.9993891,0.00002822833,0.0001903493,0.00009149097,0.0001247562,0.0001760355],"domain_scores_gemma":[0.9996346,0.00007805866,0.00001976849,0.0002293656,0.00001501826,0.00002316957],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00009243035,0.001097266,0.008294899,0.000559472,0.0004066793,0.001004676,0.01971262,0.005385638,0.44386,0.00491455,0.09348953,0.4211822],"study_design_scores_gemma":[0.004711686,0.0009804132,0.06002128,0.0006003001,0.0002142203,0.0007458843,0.004400763,0.2694767,0.3991078,0.0164461,0.2405568,0.00273808],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9643119,0.001042464,0.01040287,0.002068665,0.0002509815,0.0006002351,0.00004477038,0.0007677412,0.02051035],"genre_scores_gemma":[0.9976276,0.00008756427,0.001852685,0.0002227598,0.00008962265,0.00001856613,0.0000122581,0.00002009488,0.00006888965],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4184442,"threshold_uncertainty_score":0.321515,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0152213491867486,"score_gpt":0.2221644785660194,"score_spread":0.2069431293792708,"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."}}