{"id":"W2026680711","doi":"10.1142/s179383091100136x","title":"DIAMETER-CONSTRAINED STEINER TREES","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Bounded function; Gomory–Hu tree; Tree (set theory); k-minimum spanning tree; Connected dominating set; Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; K-ary tree; Minimum spanning tree; Topology (electrical circuits); Tree structure; Computer science; Binary tree; 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":[],"consensus_categories":[],"category_scores_codex":[0.0002100941,0.0001368932,0.0001560622,0.0001002603,0.0001741169,0.00009144992,0.0005739661,0.00003970402,0.0000283133],"category_scores_gemma":[0.00001772555,0.0001114489,0.00005230215,0.0003456922,0.0001871762,0.0002393759,0.0002188696,0.00009835496,0.00003589717],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007868444,"about_ca_system_score_gemma":0.0000179682,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005463134,"about_ca_topic_score_gemma":0.000002656087,"domain_scores_codex":[0.9990246,0.00001934031,0.0002225756,0.0003161625,0.0001744394,0.0002429184],"domain_scores_gemma":[0.9989462,0.0001125683,0.00007898645,0.0006610471,0.00006478653,0.0001363585],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[5.900346e-7,0.00007832289,0.00002301512,0.00001692877,0.00001593386,0.000001444415,0.0009532555,0.000001438209,0.0003752594,0.9338393,0.00001302432,0.06468148],"study_design_scores_gemma":[0.0002915821,0.00007395642,0.000398706,0.00002002687,0.0000148525,0.0000292258,0.0004856212,0.05877356,0.002075222,0.9352109,0.002310838,0.0003155064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000840525,0.00009694803,0.9869114,0.0001171342,0.00001439523,0.0003981974,0.00001788996,0.000128413,0.01147515],"genre_scores_gemma":[0.1101376,0.0000475186,0.8886672,0.00005034462,0.0000415679,0.0004889341,0.000006101825,0.00001935943,0.000541367],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.109297,"threshold_uncertainty_score":0.4544756,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03432157415003299,"score_gpt":0.2854218560093663,"score_spread":0.2511002818593333,"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."}}