{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0009417989,0.000527352,0.0006127142,0.0001855754,0.000271635,0.001479458,0.02409089,0.0003835471,9.44951e-7],"category_scores_gemma":[0.002768165,0.000424406,0.00007577778,0.0007623829,0.0002476317,0.0003043342,0.1017846,0.001742117,0.0000012247],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001703464,"about_ca_system_score_gemma":0.0003115117,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001104691,"about_ca_topic_score_gemma":0.00005622126,"domain_scores_codex":[0.9964883,0.0002475088,0.0005300989,0.001456092,0.0005400467,0.0007379834],"domain_scores_gemma":[0.9908155,0.0004738492,0.000399714,0.008091957,0.0001429551,0.00007601028],"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.00007404111,0.001070521,0.04630834,0.001584822,0.0007912315,0.005050738,0.01104493,0.455615,0.0006433479,0.00855449,0.05766161,0.4116009],"study_design_scores_gemma":[0.0004111381,0.0000415082,0.004947098,0.0007287762,0.00002575963,0.0001241711,0.0007426144,0.9813496,0.0001749436,0.01089837,0.00003967462,0.0005162764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2061912,0.00130249,0.7824815,0.00858562,0.0001564335,0.0003537343,0.0001200661,0.0005453258,0.0002636749],"genre_scores_gemma":[0.7657577,0.00005606266,0.2336263,0.0001324869,0.00003690727,0.00002447975,0.0003437817,0.00002104527,0.000001245161],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5595666,"threshold_uncertainty_score":0.9998208,"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."}}