{"id":"W2086070368","doi":"10.1016/j.comgeo.2015.02.004","title":"On full Steiner trees in unit disk graphs","year":2015,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Steiner tree problem; Combinatorics; Mathematics; Gomory–Hu tree; k-minimum spanning tree; K-ary tree; Tree (set theory); Unit disk; Graph; Approximation algorithm; Discrete mathematics; Tree structure; Binary tree","routes":{"ca_aff":true,"ca_fund":true,"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.0003457547,0.0001538877,0.0001688417,0.0007836171,0.00007448826,0.0001189715,0.0007253351,0.00005220086,0.00002418483],"category_scores_gemma":[0.0001067512,0.000148185,0.00007171154,0.002076982,0.00007734434,0.000302187,0.0002246799,0.0002026506,0.0001507003],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004203895,"about_ca_system_score_gemma":0.00009499367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002443131,"about_ca_topic_score_gemma":0.00002473937,"domain_scores_codex":[0.9984786,0.00008178556,0.0002508652,0.0003719502,0.000560707,0.0002560937],"domain_scores_gemma":[0.9989235,0.0004033464,0.00006517048,0.0003130068,0.0001354985,0.0001594661],"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":[0.00002302263,0.0002673855,0.003715233,0.000005191102,0.00001660541,0.00003921955,0.0002947096,0.192039,0.000005615332,0.7757293,0.002009943,0.02585477],"study_design_scores_gemma":[0.0008159732,0.0002105432,0.05158393,0.00002462635,0.000001840696,0.00001690346,0.00004224419,0.2786985,0.0000109852,0.667039,0.001335957,0.0002195261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4581991,0.0002374774,0.5351335,0.0009961776,0.0007758416,0.0001486419,0.00001387831,0.0001937063,0.00430165],"genre_scores_gemma":[0.9601241,0.000002114699,0.03910357,0.000516785,0.00005256255,0.000008996541,0.00002617362,0.000008213688,0.0001575047],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5019249,"threshold_uncertainty_score":0.6042808,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04795850184395449,"score_gpt":0.2820005581469356,"score_spread":0.2340420563029811,"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."}}