{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00194328,0.00008318783,0.0001486089,0.0001803343,0.0001734261,0.0004735611,0.0005607628,0.0000283931,0.00000275196],"category_scores_gemma":[0.0002091435,0.00006156174,0.00001703212,0.0004033685,0.0001311685,0.0004607827,0.0004223222,0.00009561767,0.00000609296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001655406,"about_ca_system_score_gemma":0.00007079582,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001685371,"about_ca_topic_score_gemma":0.000027807,"domain_scores_codex":[0.9988742,0.00005283816,0.0002009811,0.0002158447,0.0003967069,0.0002594268],"domain_scores_gemma":[0.9987194,0.0002107472,0.0000258025,0.0004902092,0.0004535588,0.0001002839],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003003771,0.0003906277,0.0001663879,0.0002583811,0.0001061281,0.00001449607,0.009370875,0.01404683,0.0002410162,0.9540902,0.008117139,0.01316787],"study_design_scores_gemma":[0.0004363687,0.0002911197,0.00001985786,0.00006742516,0.000006362975,0.00000679088,0.001003812,0.9915059,0.000212183,0.005708503,0.0006495998,0.00009206778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03562225,0.0001008583,0.9605515,0.00112432,0.00003045631,0.0006189868,0.000006092481,0.00002943874,0.001916077],"genre_scores_gemma":[0.3562585,0.0000240158,0.6422391,0.00002469412,0.00004558711,0.0000913683,0.00001485061,0.00001461747,0.001287256],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9774591,"threshold_uncertainty_score":0.4566561,"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."}}