{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006629233,0.0005046767,0.0008527015,0.00128423,0.001020706,0.001711976,0.001344111,0.0009805887,0.00221809],"category_scores_gemma":[0.00822238,0.0008550705,0.0005956427,0.002253353,0.0008431543,0.003550926,0.001503635,0.001240401,0.0004775845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000531406,"about_ca_system_score_gemma":0.000506099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006309091,"about_ca_topic_score_gemma":0.001209405,"domain_scores_codex":[0.9994059,0.0001312388,0.00004971382,0.0001451934,0.0001693134,0.00009879299],"domain_scores_gemma":[0.9946386,0.00271106,0.0008697795,0.0007082305,0.0004808301,0.0005914232],"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.0007229322,0.0003725673,0.006336288,0.0006805677,0.0001308766,0.0007713365,0.00185271,0.08288621,0.05095538,0.6817079,0.009126199,0.164457],"study_design_scores_gemma":[0.00007973915,0.0001625188,0.002152306,0.00005792317,0.0001173606,0.0009180905,0.0005464531,0.1407025,0.0117625,0.8373385,0.006133575,0.00002851716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6639323,0.0005907408,0.318574,0.0008619213,0.0001008567,0.0001503852,0.0006493945,0.0004772381,0.01466319],"genre_scores_gemma":[0.8950121,0.001106127,0.09288923,0.0002483926,0.0001433893,0.0001664904,0.001097232,0.0002584607,0.009078605],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00221809,"threshold_uncertainty_score":0.007420301,"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."}}