{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009705551,0.0001424439,0.0001438251,0.00003982515,0.00006976928,0.0002451762,0.0005532338,0.00003406313,0.0001293109],"category_scores_gemma":[0.000002160949,0.00009495253,0.00003956123,0.0002009898,0.000032958,0.0004134142,0.00009395866,0.00006759819,0.0003875074],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002365758,"about_ca_system_score_gemma":0.000004296818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002222059,"about_ca_topic_score_gemma":0.00001737492,"domain_scores_codex":[0.9988544,0.00002456802,0.0001934981,0.0003732012,0.0002585482,0.0002957883],"domain_scores_gemma":[0.9990883,0.000009092171,0.00006699416,0.0006851461,0.00005454624,0.00009591091],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006706776,0.00299301,0.01940679,0.0005326438,0.0004792947,0.0009909018,0.0161444,0.001329382,0.002291569,0.1772277,0.3687962,0.4097411],"study_design_scores_gemma":[0.00229258,0.0002000294,0.001971321,0.0001192111,0.000007371445,0.0001114397,0.0001661659,0.8097386,0.0004844727,0.00003604974,0.1842497,0.000623112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001724325,0.00008634059,0.9572628,0.001136565,0.0001479264,0.0001950241,0.000003667399,0.0001471181,0.03929626],"genre_scores_gemma":[0.8541885,0.000006517495,0.1026298,0.001344846,0.00004475042,0.0000427281,0.00000282443,0.00001104371,0.041729],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.854633,"threshold_uncertainty_score":0.4980753,"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."}}