{"id":"W2050619853","doi":"10.1109/pdgc.2014.7030782","title":"Message complexity of distributed algorithms revisited","year":2014,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Northern British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Distributed algorithm; Scalability; Distributed computing; Asynchronous communication; Mutual exclusion; Message passing; Algorithm; Leader election; Computational complexity theory; Metric (unit); Reliability (semiconductor); Theoretical computer science; Computer network","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":[],"consensus_categories":[],"category_scores_codex":[0.0004248242,0.0001173687,0.0002918244,0.00003567264,0.00006206835,0.00006618298,0.0007807452,0.00005066763,0.00004862724],"category_scores_gemma":[0.00005400862,0.00009560103,0.00007834213,0.000420078,0.00009004471,0.0001694889,0.0001578689,0.00007331302,0.00004558501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001564948,"about_ca_system_score_gemma":0.00001527641,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007772765,"about_ca_topic_score_gemma":0.000004939324,"domain_scores_codex":[0.9987827,0.00009583959,0.000347933,0.0002905651,0.0002644492,0.0002185129],"domain_scores_gemma":[0.9988494,0.00005582027,0.0001403452,0.0007020906,0.0001586149,0.0000937257],"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.000003111426,0.00009001652,0.0006312457,0.00005348737,0.00001783377,0.000002876841,0.00005855391,0.00003674617,0.0007540382,0.9677875,0.01241444,0.01815015],"study_design_scores_gemma":[0.001462388,0.0001933631,0.03460812,0.0001565143,0.00001323657,0.00002775774,0.00003333155,0.7351058,0.007143507,0.02235722,0.1982701,0.0006286979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001715785,0.00004953449,0.9792356,0.0004340424,0.0001359848,0.0001044338,0.00007964743,0.0001702804,0.0180747],"genre_scores_gemma":[0.9680815,0.000002703463,0.03139558,0.0001278311,0.00003914679,0.000004632184,0.00005308487,0.000004383724,0.0002911021],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9663658,"threshold_uncertainty_score":0.3898497,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02697507003370973,"score_gpt":0.2572775309768106,"score_spread":0.2303024609431009,"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."}}