{"id":"W1614173561","doi":"10.1287/moor.2014.0706","title":"Euclidean Networks with a Backbone and a Limit Theorem for Minimum Spanning Caterpillars","year":2015,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Euclidean minimum spanning tree; Spanning tree; Minimum spanning tree; Combinatorics; Euclidean geometry; Minimum weight; Discrete mathematics; Shortest path problem; Subadditivity; Euclidean shortest path; Limit (mathematics); Shortest-path tree; Minimum degree spanning tree; Graph; Longest path problem; Geometry; 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.003277894,0.0008100164,0.001219294,0.002421604,0.00126445,0.00243759,0.002828089,0.001900932,0.00576739],"category_scores_gemma":[0.01632253,0.0006333496,0.001392548,0.001478383,0.002546804,0.008438969,0.002675665,0.002666911,0.0007898126],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002121536,"about_ca_system_score_gemma":0.0006552525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001637168,"about_ca_topic_score_gemma":0.001595937,"domain_scores_codex":[0.9988233,0.0004180483,0.00006358346,0.0002949809,0.0002328427,0.0001670986],"domain_scores_gemma":[0.9922855,0.004836227,0.0009901305,0.0004590099,0.0007723067,0.0006568737],"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.00003737396,0.00002118768,0.0004677178,0.00008330082,0.0000245467,0.00009068289,0.0001138888,0.0405123,0.0007611255,0.9492763,0.001486006,0.007125631],"study_design_scores_gemma":[0.00001972953,0.00005720454,0.0004084626,0.00004611803,0.00002005251,0.000161021,0.00007380205,0.2615212,0.0004112647,0.7343642,0.002891238,0.00002576513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08884427,0.002283328,0.8878163,0.001600051,0.0001160784,0.00006488182,0.0003481914,0.0002367401,0.01869028],"genre_scores_gemma":[0.8082572,0.003628684,0.1649568,0.0007651839,0.0004688138,0.0005064066,0.0007240517,0.0002979899,0.02039479],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00576739,"threshold_uncertainty_score":0.01929379,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1421796790829535,"score_gpt":0.3657157497528515,"score_spread":0.223536070669898,"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."}}