{"id":"W2146013153","doi":"10.1145/1314690.1314694","title":"Time lower bounds for implementations of multi-writer snapshots","year":2007,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Snapshot (computer storage); Implementation; Computer science; Swap (finance); Parallel computing; Upper and lower bounds; Shared memory; Theoretical computer science; Arithmetic; Algorithm; Programming language; Mathematics; Operating system","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.0008438322,0.00005577424,0.0001350146,0.0000477382,0.00007336475,0.000047647,0.00176884,0.00002530573,0.00001694076],"category_scores_gemma":[0.0002006691,0.00003489594,0.0001712776,0.0001627747,0.00002714126,0.0002405489,0.000191235,0.00007155233,0.000003795463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000291714,"about_ca_system_score_gemma":0.00004773943,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003645325,"about_ca_topic_score_gemma":0.000006147965,"domain_scores_codex":[0.9991289,0.0000200956,0.0004326456,0.00006456374,0.0002095502,0.0001442083],"domain_scores_gemma":[0.9985682,0.0001151292,0.0004168944,0.000598215,0.0002563473,0.00004515253],"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.0003077646,0.001511227,0.0100292,0.0001605534,0.000665778,0.00005864591,0.006752077,0.001185118,0.1338816,0.01240259,0.7777686,0.05527691],"study_design_scores_gemma":[0.01069425,0.001424269,0.1688011,0.0006529665,0.0001681971,0.0007584433,0.0006647854,0.03060375,0.04791854,0.01713803,0.7203968,0.0007788637],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2044568,0.0002671194,0.7862973,0.006059193,0.002160323,0.000289578,0.00006125793,0.00001086254,0.0003974838],"genre_scores_gemma":[0.937017,0.000002118254,0.06189638,0.0002829199,0.0001611843,0.000001295972,9.023515e-7,0.000004921212,0.00063324],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7325602,"threshold_uncertainty_score":0.3286974,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02924618594040059,"score_gpt":0.3257587309043792,"score_spread":0.2965125449639787,"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."}}