{"id":"W2294310578","doi":"10.1007/978-3-319-25258-2_27","title":"A Separation of n-consensus and (n + 1)-consensus Based on Process Scheduling","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Asynchronous communication; Consensus; Distributed computing; Theoretical computer science; Shared memory; Hierarchy; Process (computing); Scheduling (production processes); Set (abstract data type); Asynchronous system; Multi-agent system; Artificial intelligence; Programming language; Parallel computing; Mathematical optimization; Mathematics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001074023,0.0004091208,0.0005681604,0.000532216,0.0001303524,0.0002410906,0.001173358,0.0002735545,0.000002443289],"category_scores_gemma":[0.000170279,0.000366757,0.00006970869,0.0005198903,0.0005461221,0.0001328283,0.0002310987,0.0004597701,0.000007457918],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001326234,"about_ca_system_score_gemma":0.0009268132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000155662,"about_ca_topic_score_gemma":0.00002218889,"domain_scores_codex":[0.9968257,0.00004130746,0.0005814516,0.001156379,0.00099274,0.0004024467],"domain_scores_gemma":[0.9974823,0.0003748333,0.0004422248,0.0009278056,0.000597826,0.0001750085],"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.00004492109,0.00006513454,0.0001255373,0.0002352808,0.00001352852,0.0001082233,0.0008092158,0.7763466,0.0001992173,0.01563573,0.0000485366,0.2063681],"study_design_scores_gemma":[0.0004528375,0.0002431824,0.00005030743,0.0008070249,0.000005770369,0.00005262709,4.179803e-7,0.9713849,0.0008364649,0.02543276,0.0003293747,0.000404302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001960827,0.0004611543,0.9927154,0.0006243758,0.0007379738,0.0004002519,0.00002043643,0.00008397242,0.002995594],"genre_scores_gemma":[0.8758931,0.000002798301,0.1235344,0.0003173672,0.0001395485,0.000007198379,0.000004934911,0.00001862536,0.00008205399],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8739322,"threshold_uncertainty_score":0.9998785,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02694954761347991,"score_gpt":0.2902424270642802,"score_spread":0.2632928794508003,"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."}}