{"id":"W2005304136","doi":"10.1007/s00224-013-9448-1","title":"Tight Bounds for Adopt-Commit Objects","year":2013,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Commit; Upper and lower bounds; Binary logarithm; Combinatorics; Log-log plot; Matching (statistics); Mathematics; Deterministic algorithm; Discrete mathematics; Class (philosophy); Computer science; Statistics; Database","routes":{"ca_aff":true,"ca_fund":true,"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.001376844,0.0002009867,0.0004747579,0.00009291845,0.0001951411,0.0003022316,0.001155269,0.00009254999,0.00000581019],"category_scores_gemma":[0.00006181602,0.0001742176,0.0001398866,0.0002755438,0.00007448367,0.0003024199,0.0001493108,0.00009809137,0.00007734901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004072948,"about_ca_system_score_gemma":0.00006164124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008232385,"about_ca_topic_score_gemma":0.000001113479,"domain_scores_codex":[0.9980788,0.0002276698,0.0006223055,0.0003646287,0.0002882488,0.0004183301],"domain_scores_gemma":[0.9978759,0.0005189391,0.000399905,0.0007634353,0.0003356107,0.0001062264],"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.000009035865,0.00007989014,0.0002586751,0.0004762822,0.00007558805,0.000001972155,0.002157779,0.001232497,0.001202497,0.9719194,0.008593715,0.01399267],"study_design_scores_gemma":[0.002794512,0.0006431103,0.006704916,0.00202357,0.00004106987,0.0001408752,0.001465078,0.8858272,0.002263507,0.04977811,0.04689555,0.001422532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05570958,0.000818577,0.9303771,0.00009128001,0.002067753,0.0008637592,0.00001168359,0.0002678598,0.009792455],"genre_scores_gemma":[0.9937248,0.000001078387,0.004917585,0.00006650035,0.0002583966,0.00004179386,0.000005376672,0.00001686763,0.00096761],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9380152,"threshold_uncertainty_score":0.7104386,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01309922025277097,"score_gpt":0.2289366031529144,"score_spread":0.2158373829001435,"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."}}