{"id":"W1969997664","doi":"10.1007/s00373-010-0887-z","title":"Diameter-Preserving Spanning Trees in Sparse Weighted Graphs","year":2009,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Spanning tree; Mathematics; Weight function; Vertex (graph theory); Graph; Shortest-path tree; Simple graph; Connectivity; Discrete mathematics; Mathematical analysis","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.0005164623,0.0002288719,0.0002814264,0.0007367166,0.0002012636,0.0001989719,0.001029889,0.00008111979,0.000004781507],"category_scores_gemma":[0.00006122672,0.0002185583,0.000088829,0.002523846,0.00009155236,0.0007347103,0.0003059259,0.0003736868,0.000003930241],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002859015,"about_ca_system_score_gemma":0.00002636422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002761845,"about_ca_topic_score_gemma":0.00001513187,"domain_scores_codex":[0.9980052,0.0001398998,0.0002883236,0.0005585293,0.0004000508,0.0006079884],"domain_scores_gemma":[0.9987382,0.0001921621,0.00007969762,0.0007050735,0.00008370823,0.0002011797],"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.00001229026,0.0001345162,0.01771726,0.000007316175,0.000007977891,0.00009134135,0.0003873548,0.00001619269,0.0004453048,0.95848,0.00009288538,0.02260758],"study_design_scores_gemma":[0.0006720624,0.0002403995,0.04675842,0.00004222411,0.000003026364,0.00001296707,0.00005601055,0.008166027,0.0005397507,0.9429286,0.0003181976,0.0002622884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.967194,0.002417763,0.02572315,0.0006869569,0.0003212801,0.000290371,0.000001856552,0.0002819506,0.003082721],"genre_scores_gemma":[0.9940994,0.0004152988,0.005196056,0.0001628686,0.000005797019,0.00001398445,0.000001639556,0.00001167893,0.00009322524],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02904115,"threshold_uncertainty_score":0.891255,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02022319712371703,"score_gpt":0.2652129367781776,"score_spread":0.2449897396544606,"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."}}