{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004020205,0.00008459188,0.0000823587,0.0002943069,0.0001076522,0.0001512379,0.0004303874,0.00003207343,0.00002603576],"category_scores_gemma":[0.00009618315,0.00006186063,0.00003829937,0.001617569,0.00001405445,0.0003784077,0.0001136082,0.0001019743,0.00008380975],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004802796,"about_ca_system_score_gemma":0.00005251268,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001109123,"about_ca_topic_score_gemma":0.00009406054,"domain_scores_codex":[0.9991131,0.00004427809,0.0001983443,0.0002382752,0.0002056208,0.0002004047],"domain_scores_gemma":[0.9993346,0.0003196328,0.00004063322,0.000231555,0.00003238445,0.000041228],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004692441,0.0001578444,0.007699752,0.000004099539,0.00001173475,0.00001040886,0.001066033,0.1356131,0.0009000355,0.08579449,0.005680879,0.7630569],"study_design_scores_gemma":[0.0002489273,0.0000381972,0.05321702,0.000009359254,0.000002465937,0.00001648646,0.00003329705,0.9316168,0.001876087,0.001417809,0.01137606,0.0001475243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.378702,0.0002685695,0.6023701,0.004564826,0.0002681804,0.0001546999,3.257774e-7,0.00008673178,0.01358452],"genre_scores_gemma":[0.9584459,0.000007076676,0.03961765,0.0006294769,0.0001762119,0.00001169617,0.00000201456,0.000003341653,0.001106629],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7960037,"threshold_uncertainty_score":0.2522603,"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."}}