{"id":"W2298220966","doi":"10.1016/j.disopt.2017.09.003","title":"The quadratic minimum spanning tree problem and its variations","year":2017,"lang":"en","type":"preprint","venue":"Discrete Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spanning tree; Minimum spanning tree; Distributed minimum spanning tree; Combinatorics; Euclidean minimum spanning tree; Matroid; Mathematics; Context (archaeology); Kruskal's algorithm; Bottleneck; k-minimum spanning tree; Quadratic equation; Tree (set theory); Simple (philosophy); Minimum degree spanning tree; Discrete mathematics; Binary tree; K-ary tree; Computer science; Tree structure","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006945721,0.0003660784,0.0003197145,0.0001174658,0.0008214271,0.0009088439,0.0004407455,0.0003393145,0.00001897872],"category_scores_gemma":[0.0004677134,0.0003223426,0.00008110269,0.000118628,0.00006120301,0.0002726191,0.000323547,0.0005012257,0.000006870364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009122933,"about_ca_system_score_gemma":0.00007506086,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000089929,"about_ca_topic_score_gemma":0.00001082115,"domain_scores_codex":[0.9983207,0.0001738504,0.0005105073,0.0004056765,0.0002537406,0.0003355063],"domain_scores_gemma":[0.9984717,0.0002176262,0.0003263941,0.0006976426,0.0001835646,0.000103077],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000395813,0.000004333208,0.00006444554,0.0001461101,0.00007646427,9.494647e-7,0.0005631446,0.9946676,0.00003810318,0.001587335,0.0001682936,0.002679262],"study_design_scores_gemma":[0.0002175669,0.00001068669,0.0001855217,0.0001978063,0.0001055496,0.000003095239,0.0000477612,0.9975507,0.00006232171,0.001075516,0.0001821417,0.0003613483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005528744,0.001464627,0.9811206,0.0006831628,0.0008009821,0.0008484052,0.00003914095,0.0005100598,0.01398011],"genre_scores_gemma":[0.2928974,0.003093948,0.7005507,0.00003327843,0.0004383675,0.0004028483,0.000568462,0.000274865,0.001740054],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2923445,"threshold_uncertainty_score":0.9999229,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02206177484825251,"score_gpt":0.2821296063690162,"score_spread":0.2600678315207637,"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."}}