{"id":"W2134091651","doi":"10.1007/s00446-008-0060-6","title":"The space complexity of unbounded timestamps","year":2008,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"ca_institutions":"York University; University of Toronto","funders":"European Commission; University of Toronto; York University","keywords":"Timestamp; Computer science; Asynchronous communication; Upper and lower bounds; Identifier; Time complexity; Theoretical computer science; Set (abstract data type); Algorithm; Discrete mathematics; Mathematics; Programming language; Real-time computing; Computer network","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.006636223,0.0009652716,0.002717498,0.002504025,0.002981099,0.009302873,0.003541145,0.003363438,0.008728581],"category_scores_gemma":[0.06823652,0.001473183,0.001709057,0.005500683,0.006676571,0.03604212,0.00579669,0.006898002,0.001113109],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00400933,"about_ca_system_score_gemma":0.003349597,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002691903,"about_ca_topic_score_gemma":0.001621615,"domain_scores_codex":[0.9907535,0.002838008,0.0005899339,0.001055256,0.003502332,0.001260944],"domain_scores_gemma":[0.8841103,0.09396911,0.005051635,0.01136503,0.003205412,0.002298479],"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.0005676594,0.00006720379,0.001548343,0.000197593,0.00004896025,0.0001842553,0.0005070518,0.07796781,0.001112408,0.8905435,0.007042246,0.02021302],"study_design_scores_gemma":[0.00004878522,0.00001938228,0.0001867961,0.00002314911,0.00002516505,0.00008798986,0.00007883908,0.1029088,0.0004561916,0.8947146,0.001428607,0.00002163382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3620284,0.007801481,0.5494653,0.03039823,0.0008589542,0.0001323064,0.002537496,0.00144249,0.04533524],"genre_scores_gemma":[0.952192,0.002824814,0.03435052,0.0007305803,0.001147881,0.0001562531,0.0007243268,0.0004005486,0.007472984],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009302873,"threshold_uncertainty_score":0.03509611,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03477025260088355,"score_gpt":0.2493674413589699,"score_spread":0.2145971887580864,"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."}}