{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002443445,0.0000851533,0.0001324302,0.00002625761,0.0005861719,0.0004371582,0.00114352,0.00005713329,0.000008337785],"category_scores_gemma":[0.00004786797,0.00007717475,0.00006297111,0.00003933595,0.00008614366,0.0007275158,0.0001078827,0.00005344236,0.00003944954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001922153,"about_ca_system_score_gemma":0.0000261894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002485198,"about_ca_topic_score_gemma":0.00001087202,"domain_scores_codex":[0.9992975,0.00002301671,0.0001882018,0.000219363,0.0001071653,0.0001647748],"domain_scores_gemma":[0.9984766,0.00005121419,0.0001888238,0.001187745,0.00004638821,0.00004922595],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001996276,0.00008351252,0.001064643,0.0000423557,0.00004849494,0.000002297597,0.0008382371,0.00005477087,0.004640268,0.301063,0.042376,0.6497665],"study_design_scores_gemma":[0.00210214,0.0001322804,0.01856747,0.0001520219,0.00001733846,0.00006109423,0.0002029916,0.7682636,0.005033973,0.007878434,0.1970079,0.0005807127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01006183,0.000103312,0.9360521,0.005159722,0.0005070447,0.0003383824,0.00001283966,0.0001992165,0.04756556],"genre_scores_gemma":[0.9034825,0.000005712933,0.09418988,0.0000883942,0.00007995855,0.00003705375,0.00001267317,0.000006242255,0.002097594],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8934206,"threshold_uncertainty_score":0.450842,"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."}}