{"id":"W1979684554","doi":"10.1145/2484239.2484241","title":"On deterministic abortable objects","year":2013,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Abort; TRACE (psycholinguistics); Mutual exclusion; Object (grammar); Transactional memory; Distributed computing; Concurrency control; Computation; Process (computing); Simple (philosophy); Transaction processing; Parallel computing; Database transaction; Programming language; Operating system; Artificial intelligence","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.00005466111,0.00007887608,0.00009406066,0.00002704216,0.00005884487,0.0001589238,0.0004333501,0.00002932029,0.0001564967],"category_scores_gemma":[0.00001980954,0.00005962227,0.00002676395,0.0001597196,0.00001046693,0.0002943387,0.00004660009,0.00004808606,0.002819248],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001257269,"about_ca_system_score_gemma":0.00002274697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009661575,"about_ca_topic_score_gemma":0.000006884346,"domain_scores_codex":[0.9992861,0.0000144215,0.0001255616,0.000217539,0.0001469048,0.0002094897],"domain_scores_gemma":[0.999371,0.00004927237,0.00001984078,0.0004279871,0.00005009848,0.00008179651],"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.000001674448,0.0001471948,0.0002325955,0.00002471535,0.0000141079,0.00003065361,0.0002595624,0.0002650616,0.00157277,0.7853702,0.1640023,0.04807909],"study_design_scores_gemma":[0.001562668,0.0007598028,0.03925129,0.0001830306,0.000007017574,0.00008992592,0.0001247229,0.7942942,0.005501762,0.06400301,0.09280103,0.001421505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05267853,0.00004902689,0.6358638,0.000578059,0.001005495,0.0003908997,0.000008054631,0.0004940194,0.3089322],"genre_scores_gemma":[0.9921832,7.839029e-7,0.002273561,0.0007556786,0.00002624727,0.00003298584,9.535011e-7,0.000003446341,0.004723133],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9395047,"threshold_uncertainty_score":0.9979572,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005421907608805229,"score_gpt":0.2040879470346327,"score_spread":0.1986660394258274,"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."}}