{"id":"W2013154696","doi":"10.1016/j.tcs.2015.01.024","title":"A characterization of oblivious message adversaries for which Consensus is solvable","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Henan Institute of Science and Technology; Agence Nationale de la Recherche","keywords":"Network topology; Adversary; Computer science; Set (abstract data type); Theoretical computer science; Characterization (materials science); Message passing; Consensus algorithm; Topology (electrical circuits); Mathematics; Computer network; Discrete mathematics; Distributed computing; Algorithm; Computer security; Combinatorics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003535792,0.001335942,0.00230455,0.001796532,0.002982384,0.006745408,0.003516235,0.004373813,0.006030617],"category_scores_gemma":[0.03296713,0.00126607,0.001711155,0.001966661,0.005399574,0.0105413,0.005916145,0.006678136,0.0009447288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003023725,"about_ca_system_score_gemma":0.003117233,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000950456,"about_ca_topic_score_gemma":0.0007355568,"domain_scores_codex":[0.9959692,0.0009917517,0.0002600859,0.0009397358,0.0009389519,0.0009003319],"domain_scores_gemma":[0.9585508,0.02991711,0.00435127,0.003131766,0.002045079,0.002003965],"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.000328909,0.000114375,0.0006605996,0.0001327712,0.0000649771,0.0002170275,0.0005671251,0.03271678,0.003521256,0.95336,0.003024575,0.005291645],"study_design_scores_gemma":[0.00007083677,0.00006868053,0.0001474409,0.00002179683,0.00002743709,0.000135539,0.0001475065,0.1560728,0.001266253,0.8407007,0.001314054,0.00002705049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3331357,0.0004351815,0.6022468,0.006355965,0.0002160868,0.0004793845,0.0008094664,0.001336272,0.0549852],"genre_scores_gemma":[0.9668893,0.0002999884,0.02185502,0.0007232455,0.0002177323,0.000298663,0.0005171364,0.0002336074,0.00896528],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006745408,"threshold_uncertainty_score":0.0219388,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01790132295529213,"score_gpt":0.2537304377306758,"score_spread":0.2358291147753837,"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."}}