{"id":"W2569211293","doi":"10.1145/3007748.3007775","title":"Time-communication trade-offs for minimum spanning tree construction","year":2017,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spanning tree; Minimum spanning tree; Binary logarithm; Node (physics); Distributed minimum spanning tree; Upper and lower bounds; Time complexity; Combinatorics; Tree (set theory); Computer science; Communication complexity; Computational complexity theory; K-ary tree; Discrete mathematics; Mathematics; Theoretical computer science; Tree structure; Algorithm; Binary tree; Physics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006846093,0.001277917,0.001771021,0.001393606,0.001808691,0.002554309,0.00247791,0.003038947,0.007392313],"category_scores_gemma":[0.05040642,0.0009126155,0.0009663758,0.00247167,0.002181953,0.009068032,0.002963983,0.002421984,0.001219274],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0020919,"about_ca_system_score_gemma":0.001233049,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006704425,"about_ca_topic_score_gemma":0.000931415,"domain_scores_codex":[0.992541,0.00342277,0.0004327354,0.001030117,0.001768684,0.0008047263],"domain_scores_gemma":[0.9341813,0.05745904,0.001984086,0.003797095,0.001471052,0.001107369],"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.002560517,0.0003175307,0.001889431,0.0009282118,0.0001528343,0.0003607354,0.0007379594,0.5679207,0.01676055,0.2236448,0.008488618,0.1762381],"study_design_scores_gemma":[0.0001577601,0.0004561125,0.0005421839,0.00009935499,0.00009966408,0.0004930284,0.0002105404,0.7787717,0.005397347,0.209281,0.004444968,0.00004634938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1328081,0.007307063,0.8281138,0.005066953,0.0003287675,0.0002212949,0.000373727,0.001255691,0.02452456],"genre_scores_gemma":[0.8070207,0.002934992,0.1828592,0.0006036654,0.0005710859,0.0004387563,0.0003870847,0.0008400914,0.004344365],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007392313,"threshold_uncertainty_score":0.03620601,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02253437708826871,"score_gpt":0.2704835474641938,"score_spread":0.2479491703759251,"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."}}