{"id":"W2068790848","doi":"10.1007/s00454-007-9019-9","title":"Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D","year":2007,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Army Research Office; Tel Aviv University; Deutsche Forschungsgemeinschaft; Deutscher Akademischer Austauschdienst; National Science Foundation","keywords":"Spanning tree; Combinatorics; Minimum spanning tree; Euclidean geometry; Mathematics; Euclidean minimum spanning tree; Planar graph; Graph; Euclidean space; k-minimum spanning tree; Planar; Path (computing); Steiner tree problem; Discrete mathematics; Minimum degree spanning tree; Computer science; Tree structure; Binary tree; Geometry","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.001048458,0.0001618121,0.0002053814,0.0004097447,0.0002252701,0.0001438229,0.0001865259,0.00005620157,0.00000246009],"category_scores_gemma":[0.00009806485,0.0001372169,0.00002875738,0.0007533108,0.0001430359,0.0003500893,0.0002727804,0.0001571698,8.192479e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001986547,"about_ca_system_score_gemma":0.00005314024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004576581,"about_ca_topic_score_gemma":0.00003571593,"domain_scores_codex":[0.9985252,0.0000822915,0.0004331996,0.0003793984,0.0003492188,0.0002307002],"domain_scores_gemma":[0.9985163,0.0009820642,0.0001743722,0.0001341899,0.0001051472,0.00008797925],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0000517898,0.0001000871,0.1480648,0.0001034399,0.00008267302,0.00003081587,0.004954621,0.2808716,0.001193342,0.1548139,0.00007927535,0.4096538],"study_design_scores_gemma":[0.0003444832,0.0000439044,0.5681751,0.0000326294,0.000006218303,0.00004361472,0.0001901106,0.4254461,0.00009878838,0.005428741,0.00007216898,0.0001181276],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5352417,0.0009974395,0.4631998,0.0002837197,0.00006039382,0.000102073,0.000003306915,0.00001770922,0.00009392543],"genre_scores_gemma":[0.943967,0.00002917058,0.05568005,0.0002031207,0.0000730519,0.000001942926,0.00002117452,0.000007233175,0.0000172662],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4201104,"threshold_uncertainty_score":0.5595544,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01198783087499152,"score_gpt":0.2639476584860729,"score_spread":0.2519598276110814,"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."}}