{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001677703,0.0001401933,0.0001960005,0.0003075968,0.00236205,0.0001431192,0.002953121,0.00005227234,0.00003129755],"category_scores_gemma":[0.0001685633,0.0001294048,0.0001534478,0.0013116,0.002400176,0.0003935642,0.002099166,0.0005185927,0.0001246089],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005728204,"about_ca_system_score_gemma":0.0002153889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003540606,"about_ca_topic_score_gemma":0.0008879593,"domain_scores_codex":[0.9969621,0.0006316662,0.0001550073,0.000502583,0.0009524492,0.0007962404],"domain_scores_gemma":[0.9969482,0.001286661,0.0001040309,0.0009096958,0.0005169899,0.0002344488],"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.000327164,0.0004803247,0.002070624,0.0001198466,0.0003079637,0.0002706375,0.01658089,0.00002290834,0.02433913,0.462965,0.1093635,0.3831521],"study_design_scores_gemma":[0.001462192,0.001476551,0.03272478,0.0002384862,0.00001640157,0.00002911765,0.005183976,0.3327685,0.001108027,0.4057027,0.2187646,0.0005247084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00744252,0.00007643209,0.9697556,0.006733215,0.0001327065,0.0003772102,0.00006434968,0.0001162352,0.01530167],"genre_scores_gemma":[0.6122335,0.0003326852,0.3840857,0.00005689726,0.0003333977,0.000004067455,0.00004578483,0.00002556014,0.002882424],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6047909,"threshold_uncertainty_score":0.9989367,"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."}}