{"id":"W2157550063","doi":"10.1145/2559904","title":"The Space Complexity of Long-Lived and One-Shot Timestamp Implementations","year":2014,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Timestamp; Timestamp-based concurrency control; Computer science; Upper and lower bounds; Identifier; Time complexity; Asynchronous communication; Spacetime; Theoretical computer science; Algorithm; Mathematics; Programming language; Real-time computing; Concurrency control; Physics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003814912,0.0009250878,0.001394676,0.0006802421,0.001408309,0.00496734,0.003995446,0.002256479,0.007353243],"category_scores_gemma":[0.02230693,0.0008785868,0.001434474,0.001952822,0.002412067,0.01455376,0.004195832,0.003215912,0.0009489729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003011154,"about_ca_system_score_gemma":0.004447415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002309281,"about_ca_topic_score_gemma":0.002527432,"domain_scores_codex":[0.991423,0.002189372,0.0009248178,0.00139568,0.002316031,0.001751222],"domain_scores_gemma":[0.9768644,0.01411433,0.001767904,0.005324091,0.001267299,0.0006620535],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003536073,0.0005982547,0.006500008,0.001200271,0.000244113,0.0004305292,0.002163267,0.3493868,0.03179149,0.3879841,0.007260339,0.2089049],"study_design_scores_gemma":[0.0004044504,0.000633555,0.00127152,0.0001287584,0.0001898107,0.0003308647,0.0006643719,0.6589398,0.02406331,0.3085051,0.004759699,0.0001087874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.45843,0.001269854,0.5238885,0.002092561,0.0001270746,0.0002920672,0.0006032384,0.003056156,0.01024057],"genre_scores_gemma":[0.8612788,0.0004066711,0.1317786,0.0002381421,0.00006392841,0.0003345191,0.0005671378,0.0003206928,0.005011496],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007353243,"threshold_uncertainty_score":0.02459908,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09217044298558189,"score_gpt":0.322475716615051,"score_spread":0.2303052736294691,"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."}}