{"id":"W2067172197","doi":"10.5555/1070432.1070561","title":"Finding the shortest bottleneck edge in a parametric minimum spanning tree","year":2005,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Spanning tree; Minimum spanning tree; Combinatorics; Mathematics; Parametric statistics; Enhanced Data Rates for GSM Evolution; Time complexity; Connected dominating set; Shortest-path tree; Ranging; Bottleneck; Minimum degree spanning tree; Discrete mathematics; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000596341,0.0006412599,0.0008498977,0.001092545,0.0006686918,0.0008995836,0.001210582,0.001014807,0.003878908],"category_scores_gemma":[0.004594867,0.0004183041,0.0004848914,0.00121403,0.00059622,0.003117081,0.001158425,0.0006905217,0.0007706768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005858913,"about_ca_system_score_gemma":0.000714031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009297995,"about_ca_topic_score_gemma":0.001092633,"domain_scores_codex":[0.9994435,0.0001063277,0.00004295249,0.0002090234,0.0001262124,0.00007201508],"domain_scores_gemma":[0.998906,0.0005784918,0.0001738312,0.0001284496,0.0001417018,0.00007146937],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006205228,0.0002863147,0.004996296,0.001194873,0.0001565957,0.0007313532,0.0006612061,0.5540157,0.03611775,0.05652278,0.01262051,0.3320761],"study_design_scores_gemma":[0.00002885156,0.0002192768,0.001118768,0.00005204873,0.00004076983,0.0004554063,0.0001809082,0.9228627,0.007071323,0.06231585,0.005627458,0.00002660441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1134458,0.0006752161,0.8777888,0.0006168354,0.00005326276,0.0001703503,0.000649959,0.0006361864,0.005963617],"genre_scores_gemma":[0.6186085,0.0005117132,0.3750766,0.000142221,0.00006372319,0.0001979071,0.001336663,0.0001489824,0.003913689],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003878908,"threshold_uncertainty_score":0.01297629,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03045350493991561,"score_gpt":0.2718885037294417,"score_spread":0.2414349987895261,"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."}}