{"id":"W2808433750","doi":"10.1007/s00446-020-00387-y","title":"Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model","year":2021,"lang":"en","type":"preprint","venue":"Distributed Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Asynchronous communication; Spanning tree; Computer science; Minimum spanning tree; Binary logarithm; Graph; Distributed algorithm; Tree (set theory); Combinatorics; Omega; Distributed minimum spanning tree; Theoretical computer science; Algorithm; Mathematics; Distributed computing; Computer network; 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.002862544,0.0005893377,0.001610767,0.0008467343,0.001578487,0.002581885,0.002162639,0.001771671,0.004175472],"category_scores_gemma":[0.01364241,0.0006670026,0.0007399223,0.001482178,0.002015127,0.006312758,0.002302956,0.002184293,0.0004492771],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002313335,"about_ca_system_score_gemma":0.001624032,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003407316,"about_ca_topic_score_gemma":0.003482969,"domain_scores_codex":[0.9980199,0.0008896042,0.00007771355,0.0003320333,0.0003359187,0.000344927],"domain_scores_gemma":[0.988848,0.008162046,0.0008895294,0.001013032,0.0004838345,0.0006037041],"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.0007272472,0.0001350738,0.0007802522,0.0001825003,0.00005610421,0.0002149847,0.0003958921,0.3865323,0.002619545,0.5876343,0.007347795,0.01337418],"study_design_scores_gemma":[0.00005657605,0.00003446216,0.0001486594,0.000009798645,0.00002325373,0.00006056251,0.00006595401,0.7533996,0.0003846922,0.2448819,0.000920387,0.0000141139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2243111,0.001274272,0.7517684,0.004519503,0.0001609025,0.0001141297,0.0006796536,0.0005685834,0.01660343],"genre_scores_gemma":[0.9464611,0.0006395985,0.04478683,0.0002750874,0.0002311838,0.0001237504,0.0002291118,0.0001671313,0.007086232],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004175472,"threshold_uncertainty_score":0.01678449,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03099239851985214,"score_gpt":0.2679055455920573,"score_spread":0.2369131470722052,"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."}}