{"id":"W2034956448","doi":"10.1145/2732263","title":"Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity","year":2015,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Snapshot (computer storage); Computer science; Time complexity; Computational complexity theory; Worst-case complexity; Binary logarithm; Upper and lower bounds; Algorithm; Theoretical computer science; Average-case complexity; Combinatorics; Mathematics; 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.0005368216,0.0001134686,0.0002344573,0.00005483421,0.00008416807,0.0002341747,0.003620784,0.00004288147,0.000002676595],"category_scores_gemma":[0.0003154239,0.00006086721,0.0001009187,0.0003265979,0.00007453975,0.0006507066,0.000589741,0.0002709953,0.0000141993],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009468482,"about_ca_system_score_gemma":0.0002041648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005668172,"about_ca_topic_score_gemma":0.00002844961,"domain_scores_codex":[0.9987128,0.000120248,0.000328749,0.0001258074,0.0005111603,0.0002011913],"domain_scores_gemma":[0.9975743,0.00006604038,0.0004718573,0.001365108,0.0003509024,0.0001717611],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0008416292,0.001048941,0.1218066,0.00008124726,0.0007818836,0.00085711,0.004576834,0.002881475,0.002342612,0.07280719,0.7654657,0.02650887],"study_design_scores_gemma":[0.01266334,0.002199722,0.3314326,0.001315455,0.0001767563,0.01387971,0.000734709,0.07002892,0.002754288,0.05248224,0.5108536,0.001478627],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8700023,0.0003754537,0.1149789,0.0119012,0.001862864,0.0001908762,0.0000164529,0.00004081539,0.000631036],"genre_scores_gemma":[0.9700554,0.000003926184,0.02910055,0.0004719888,0.000156988,7.939309e-7,4.393269e-7,0.000006730429,0.0002031704],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.254612,"threshold_uncertainty_score":0.6728378,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07412263790797627,"score_gpt":0.2641435709124288,"score_spread":0.1900209330044526,"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."}}