{"id":"W2810907219","doi":"","title":"The Distributed Minimum Spanning Tree Problem","year":2018,"lang":"en","type":"article","venue":"Research Padua  Archive (University of Padua)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission; National Science Foundation","keywords":"Distributed minimum spanning tree; Minimum spanning tree; Spanning tree; Computer science; Distributed algorithm; Message passing; Node (physics); Graph; Kruskal's algorithm; Prim's algorithm; Distributed computing; Theoretical computer science; Algorithm; Combinatorics; Mathematics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001380441,0.0007194871,0.00129394,0.0006941441,0.001154126,0.002116316,0.001907895,0.001845385,0.00526569],"category_scores_gemma":[0.00549434,0.0003738189,0.0006267184,0.002042131,0.001013551,0.004802655,0.002406668,0.001588393,0.00144238],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001059247,"about_ca_system_score_gemma":0.001319618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006121595,"about_ca_topic_score_gemma":0.000690548,"domain_scores_codex":[0.9979904,0.0006583768,0.0001200864,0.0005188936,0.0005298146,0.0001825895],"domain_scores_gemma":[0.9982641,0.0009430831,0.0001625586,0.0002999684,0.000197839,0.000132452],"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.0002747404,0.0001997582,0.0009261474,0.0009791488,0.0001572866,0.0003002017,0.0002787861,0.1667168,0.003324453,0.5824752,0.0462858,0.1980817],"study_design_scores_gemma":[0.0001145095,0.0001240447,0.0003979904,0.0001043475,0.00006398637,0.0007415792,0.0002324333,0.2418099,0.001642479,0.6692759,0.08546407,0.00002874443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0212822,0.005678647,0.9306647,0.004426364,0.0007556787,0.0003072404,0.0008714103,0.0004820359,0.03553175],"genre_scores_gemma":[0.5369363,0.01373271,0.4176806,0.001371913,0.001811561,0.0008864353,0.003648571,0.000351714,0.0235802],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00526569,"threshold_uncertainty_score":0.01761544,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05834996165073399,"score_gpt":0.2970416321890664,"score_spread":0.2386916705383324,"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."}}