{"id":"W2963800009","doi":"10.1145/3293611.3331574","title":"The Recoverable Consensus Hierarchy","year":2019,"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 Waterloo","funders":"","keywords":"Hierarchy; Computer science; Consensus; Set (abstract data type); Asynchronous communication; Theoretical computer science; Computability; Process (computing); Crash; Bounded function; Distributed computing; Multi-agent system; Mathematics; Artificial intelligence; Programming language; Computer network","routes":{"ca_aff":true,"ca_fund":false,"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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002678474,0.00005638206,0.0000721845,0.00001062587,0.0001273156,0.0002302035,0.0005717178,0.0000234808,0.00003303762],"category_scores_gemma":[0.00001505075,0.0000326138,0.00003452233,0.0001552286,0.00001791273,0.00009457053,0.00008213905,0.00006605588,0.001125814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001441162,"about_ca_system_score_gemma":0.00003900379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004576247,"about_ca_topic_score_gemma":0.000009704076,"domain_scores_codex":[0.999323,0.00003531556,0.0001252995,0.0001746952,0.0001420868,0.0001996294],"domain_scores_gemma":[0.9991691,0.0001507837,0.00003423199,0.00055769,0.00004827582,0.00003989566],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00000467576,0.00001425267,0.001065056,0.000006777734,0.000012752,0.000005162585,0.00007187366,0.00009834088,0.0003832465,0.8803121,0.07990093,0.03812478],"study_design_scores_gemma":[0.0002245882,0.00003369642,0.0009341053,0.000009175696,4.067814e-7,0.00001771482,0.0000286959,0.04258412,0.0003231065,0.004284158,0.9514578,0.0001024561],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.04558579,0.0006863655,0.1819727,0.01089692,0.003616818,0.0005001165,0.000007327364,0.0003868505,0.7563471],"genre_scores_gemma":[0.927074,0.00001467025,0.003186703,0.0005271927,0.00003607656,0.000007721645,7.784214e-7,0.000003746818,0.06914908],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8814883,"threshold_uncertainty_score":0.9996519,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005280946996092166,"score_gpt":0.2022921862060712,"score_spread":0.197011239209979,"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."}}