{"id":"W1991558558","doi":"10.1007/s00446-015-0261-8","title":"Universal constructions that ensure disjoint-access parallelism and wait-freedom","year":2016,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Disjoint sets; Computer science; Parallelism (grammar); Parallel computing; Data parallelism; Task parallelism; Crash; Degrees of freedom (physics and chemistry); Base (topology); Process (computing); Distributed computing; Programming language; 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":[],"consensus_categories":[],"category_scores_codex":[0.0002412842,0.0002683376,0.0003306292,0.00008312544,0.0004276331,0.0005166475,0.001136836,0.000119568,0.00001357471],"category_scores_gemma":[0.00005967157,0.0002033232,0.00009466748,0.0004534884,0.0002133956,0.0008231215,0.0005961313,0.0001593493,0.00002087445],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008626816,"about_ca_system_score_gemma":0.0000698251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007887979,"about_ca_topic_score_gemma":0.000008159874,"domain_scores_codex":[0.9980437,0.0001057738,0.000347151,0.0006571807,0.0003022648,0.0005439767],"domain_scores_gemma":[0.9984874,0.0002159585,0.0002265353,0.0006755104,0.0001625321,0.0002320783],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008195025,0.0002440748,0.08011099,0.0001076403,0.0003386576,0.0003295927,0.0008510143,0.002690503,0.003391437,0.5542651,0.02103083,0.3365583],"study_design_scores_gemma":[0.01133796,0.0004051459,0.3069931,0.001850755,0.0001236311,0.001571956,0.00116903,0.4772922,0.003581239,0.01292211,0.1787437,0.004009178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06703073,0.0001789338,0.928389,0.00192951,0.0008113922,0.0001787009,0.0003513311,0.0004287565,0.0007016386],"genre_scores_gemma":[0.9960711,0.00002273439,0.003566563,0.00006609613,0.0001641204,0.000004303737,0.00004710778,0.00001203501,0.00004592275],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9290404,"threshold_uncertainty_score":0.8291279,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01891117604027799,"score_gpt":0.2416308932677721,"score_spread":0.2227197172274941,"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."}}