{"id":"W2114421280","doi":"10.46298/dmtcs.3513","title":"The Diameter of the Minimum Spanning Tree of a Complete Graph","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Spanning tree; Minimum spanning tree; Graph; Independent and identically distributed random variables; Minimum degree spanning tree; Tree (set theory); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Statistics; Random variable","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":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.002884387,0.0002575507,0.0003941464,0.0001956762,0.0007123595,0.0002811205,0.006629078,0.00005049714,0.000007567035],"category_scores_gemma":[0.0003187997,0.0001349913,0.0002931125,0.002339467,0.01086355,0.0003637483,0.001909756,0.0002836358,0.000006670703],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002611521,"about_ca_system_score_gemma":0.0001091001,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000494302,"about_ca_topic_score_gemma":0.000003367814,"domain_scores_codex":[0.9960195,0.0002597601,0.0007808376,0.0005563636,0.001623056,0.0007604894],"domain_scores_gemma":[0.9948206,0.002057358,0.0003996604,0.002207528,0.0003891453,0.0001257336],"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.000006711389,0.00006566161,0.00009584251,0.00003294402,0.000009600111,0.000001504025,0.0005525217,0.0001640786,0.008682807,0.9882458,0.00002784109,0.002114729],"study_design_scores_gemma":[0.0001590881,0.00009711421,0.0007031282,0.00008814477,0.000008313948,0.00001335551,0.00004501587,0.2507296,0.01447251,0.7335119,0.00002908925,0.0001427766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02467008,0.00007295152,0.969394,0.0007691047,0.0002589255,0.0003867552,0.000007121547,0.00005013288,0.00439094],"genre_scores_gemma":[0.7564095,0.000002956594,0.2434654,0.0000449456,0.00003158033,0.00001139218,3.062776e-7,0.00001238534,0.00002156162],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7317394,"threshold_uncertainty_score":0.9987456,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01833519680599264,"score_gpt":0.2756959081426852,"score_spread":0.2573607113366926,"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."}}