{"id":"W2291488275","doi":"","title":"A separation of (n -1)-consensus and n-consensus in read-write shared-memory systems","year":2014,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Asynchronous communication; Shared memory; Hierarchy; Theoretical computer science; Consensus; Universality (dynamical systems); Asynchronous system; Object (grammar); Distributed computing; Set (abstract data type); Process (computing); Multi-agent system; Artificial intelligence; Programming language; Parallel computing","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003106676,0.0006225636,0.001412404,0.000480145,0.001302775,0.001970237,0.001401228,0.001790734,0.003117657],"category_scores_gemma":[0.00962573,0.000531798,0.000917047,0.0005874066,0.003948671,0.00684346,0.004143781,0.003719422,0.0004300429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001379186,"about_ca_system_score_gemma":0.001831785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008163432,"about_ca_topic_score_gemma":0.0008576514,"domain_scores_codex":[0.996069,0.001208918,0.0003825571,0.0009673657,0.0009945458,0.000377637],"domain_scores_gemma":[0.9910103,0.004966111,0.0008973096,0.001653198,0.0008613852,0.0006117282],"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.0001582829,0.00004723591,0.000479997,0.0002160108,0.00002761323,0.0002478175,0.0008891236,0.01777041,0.004816739,0.9609824,0.001110455,0.01325384],"study_design_scores_gemma":[0.0001082061,0.0002264337,0.0006112445,0.00006836835,0.00002996695,0.0002341854,0.0002233641,0.1635721,0.003164966,0.8255171,0.006198162,0.00004575925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0570449,0.0007403285,0.9207684,0.001896338,0.0002017875,0.0001412878,0.00009853081,0.0002260037,0.01888241],"genre_scores_gemma":[0.8619933,0.0003862304,0.1306987,0.0005785269,0.0003959469,0.0002816204,0.0001257983,0.00007068134,0.005469269],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003117657,"threshold_uncertainty_score":0.01642984,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01377987166866633,"score_gpt":0.2422380155899022,"score_spread":0.2284581439212359,"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."}}