{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000484259,0.0001978829,0.0003167807,0.00003535399,0.0009827146,0.0001401503,0.001552341,0.0000677904,0.000002888926],"category_scores_gemma":[0.0001012763,0.0001520731,0.0001380387,0.0008539768,0.0004517062,0.0001737513,0.0002995945,0.0002091825,0.00002853056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006407315,"about_ca_system_score_gemma":0.0001368898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009183156,"about_ca_topic_score_gemma":0.000005048153,"domain_scores_codex":[0.9980043,0.0001414661,0.0005399531,0.0003735162,0.00043818,0.0005025897],"domain_scores_gemma":[0.9980024,0.000289141,0.000359044,0.0009374224,0.0002958891,0.0001161136],"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.0000272114,0.0002686932,0.007636001,0.00005711116,0.0001311681,0.00009885328,0.001126831,0.00433863,0.00124856,0.9432564,0.02631694,0.01549365],"study_design_scores_gemma":[0.001495926,0.0001667871,0.08345161,0.0001654074,0.00001463856,0.000379652,0.0002621538,0.8220555,0.005157233,0.009829465,0.07622456,0.0007971154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06306172,0.0003473524,0.9330612,0.0008899411,0.0005909764,0.000187013,0.00008881169,0.0002446239,0.001528287],"genre_scores_gemma":[0.9941561,0.00001378417,0.005602382,0.00004119021,0.0000730219,0.000003067386,0.00005287365,0.00000840376,0.000049212],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9334269,"threshold_uncertainty_score":0.7558345,"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."}}