{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001607536,0.0002664567,0.0002925251,0.0002574279,0.000191973,0.0002511741,0.001232232,0.0001953824,0.00001874506],"category_scores_gemma":[0.000008076641,0.0002748381,0.00009351535,0.0003735154,0.0004045849,0.0005307748,0.001758569,0.0005427598,0.00003342629],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008895234,"about_ca_system_score_gemma":0.0001162218,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000115115,"about_ca_topic_score_gemma":0.0001218318,"domain_scores_codex":[0.9985494,0.0001481706,0.0001541581,0.0008193437,0.00009139445,0.0002375525],"domain_scores_gemma":[0.9977892,0.0001233722,0.0002205467,0.001622174,0.0001426885,0.0001020253],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002748976,0.0005949707,0.08287898,0.0007505723,0.0007916837,0.0002790305,0.00239079,0.1034576,0.00006903693,0.7249714,0.000499067,0.08304199],"study_design_scores_gemma":[0.001197652,0.0001777119,0.009580114,0.0002731816,0.00008118567,0.00005037785,0.0001591535,0.9498504,0.0001247681,0.03733406,0.0004539803,0.000717454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.299785,0.00007624251,0.6976048,0.0001197195,0.0002611202,0.0002624736,0.00001469891,0.0001340664,0.001741942],"genre_scores_gemma":[0.9672364,0.0002235416,0.03211203,0.00007352863,0.00003522973,0.000001007025,0.00002801086,0.00001376907,0.0002764917],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8463928,"threshold_uncertainty_score":0.9999704,"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."}}