{"id":"W2966778654","doi":"10.48550/arxiv.1907.12152","title":"Faster asynchronous MST and low diameter tree construction with sublinear communication","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Sublinear function; Asynchronous communication; Spanning tree; Combinatorics; Time complexity; Tree (set theory); Binary logarithm; Minimum spanning tree; Node (physics); Discrete mathematics; Distributed algorithm; Communication complexity; Computer science; Algorithm; Mathematics; Distributed computing; Computer network; Physics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001048857,0.0007973831,0.0006669644,0.0009910035,0.0009987083,0.001148145,0.001672523,0.0009620938,0.006819772],"category_scores_gemma":[0.005690961,0.0004365653,0.0009387351,0.001294384,0.0006620333,0.004032478,0.001921004,0.001694966,0.002284999],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001315123,"about_ca_system_score_gemma":0.001075186,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001973294,"about_ca_topic_score_gemma":0.002990899,"domain_scores_codex":[0.9988695,0.000260748,0.00007475501,0.0002836762,0.0003720155,0.0001393243],"domain_scores_gemma":[0.9968424,0.001355344,0.000265998,0.0009747153,0.0003980963,0.0001635531],"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.001406992,0.0003379004,0.002266828,0.0006511786,0.00009202136,0.0003901272,0.000623377,0.2520555,0.07281896,0.2836538,0.03421589,0.3514875],"study_design_scores_gemma":[0.0001627074,0.0001625662,0.0005159227,0.00003059844,0.00004103526,0.0002397075,0.00006614831,0.8436939,0.01276222,0.1298049,0.01249416,0.00002615731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02541819,0.0002588569,0.9632007,0.0006898592,0.0001327775,0.00008044834,0.0002491219,0.00242235,0.007547548],"genre_scores_gemma":[0.2738301,0.0003107626,0.7134921,0.0003420355,0.0002361521,0.0003766346,0.001059717,0.00075048,0.009602009],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006819772,"threshold_uncertainty_score":0.02281445,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04062886627540778,"score_gpt":0.1706604096371833,"score_spread":0.1300315433617755,"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."}}