{"id":"W2171587977","doi":"10.1109/sfcs.1995.492673","title":"Faster approximate agreement with multi-writer registers","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Agreement; Asynchronous communication; Matching (statistics); Upper and lower bounds; Computational complexity theory; Arithmetic; Algorithm; Parallel computing; Theoretical computer science; Mathematics; Telecommunications; Statistics","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.003289788,0.0006146324,0.001675034,0.0003418993,0.001020139,0.002535654,0.002448733,0.001498996,0.005899872],"category_scores_gemma":[0.01578155,0.0004841056,0.0008618335,0.0008869362,0.001436493,0.008415285,0.002748528,0.002432349,0.000633933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001158373,"about_ca_system_score_gemma":0.001153598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001392878,"about_ca_topic_score_gemma":0.001125601,"domain_scores_codex":[0.9966916,0.0009531034,0.0001774502,0.0006674612,0.0008782573,0.0006320016],"domain_scores_gemma":[0.9805782,0.01394356,0.001210083,0.003019874,0.0007733864,0.0004749323],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003017005,0.0003136763,0.002860415,0.00039478,0.0001289853,0.0005088758,0.0007709158,0.7033733,0.02505425,0.2101134,0.002139973,0.05132446],"study_design_scores_gemma":[0.0001135204,0.0001066235,0.0001545671,0.000006366193,0.00002304206,0.00005497837,0.00005754731,0.9157764,0.006518804,0.07657297,0.0006001181,0.00001498952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3717917,0.0004663304,0.6199899,0.0009706405,0.00009486653,0.00009311765,0.0001301858,0.000952516,0.005510719],"genre_scores_gemma":[0.9513445,0.000112323,0.04517015,0.00008026364,0.00004541569,0.00009209118,0.00009240288,0.00008703408,0.002975689],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005899872,"threshold_uncertainty_score":0.01973706,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03450754894609512,"score_gpt":0.2246097772111796,"score_spread":0.1901022282650845,"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."}}