{"id":"W4409872544","doi":"10.1007/s00446-025-00478-8","title":"Efficient bounded timestamping from standard synchronization primitives","year":2025,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Synchronization (alternating current); Bounded function; Distributed computing; Parallel computing; Theoretical computer science; Computer network; Mathematics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003428508,0.0002439122,0.0003469608,0.0001087306,0.0004958754,0.0006446888,0.0008815808,0.0001069106,0.000007788533],"category_scores_gemma":[0.000126257,0.0002523017,0.0001001984,0.001196089,0.00006038565,0.0001285583,0.0003156947,0.0002006535,0.00002485874],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003165289,"about_ca_system_score_gemma":0.0002525088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006106487,"about_ca_topic_score_gemma":0.000002309786,"domain_scores_codex":[0.9978482,0.0001300551,0.0005170969,0.000671076,0.0003547418,0.0004788413],"domain_scores_gemma":[0.9985316,0.0002181888,0.000211878,0.0006540683,0.0002911756,0.00009313675],"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.00007133883,0.0004725416,0.01079321,0.0002038176,0.0004292391,0.0001093703,0.001883313,0.309522,0.002313643,0.3927092,0.008766302,0.272726],"study_design_scores_gemma":[0.0006894768,0.00002424962,0.007826874,0.0004198556,0.00001400267,0.000002563978,0.0001100028,0.9822891,0.001246426,0.001549502,0.005545101,0.0002828033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06699106,0.0004699441,0.9287968,0.0004207471,0.0007751121,0.0002487545,0.0002788547,0.0005499628,0.001468733],"genre_scores_gemma":[0.9871686,0.000002469158,0.01218412,0.0001629546,0.00007752328,0.000006366083,0.0003642918,0.000009132787,0.00002453424],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9201775,"threshold_uncertainty_score":0.9999929,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006229300024132849,"score_gpt":0.2439041454820549,"score_spread":0.2376748454579221,"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."}}