{"id":"W4380874976","doi":"10.1145/3583668.3594601","title":"Efficient Bounded Timestamping from Standard Synchronization Primitives","year":2023,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Timestamp; Timestamp-based concurrency control; Computer science; Synchronization (alternating current); Block (permutation group theory); Bounded function; Process (computing); Algorithm; Parallel computing; Theoretical computer science; Real-time computing; Mathematics; Programming language; Concurrency control; Computer network; Combinatorics","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.00208993,0.00140877,0.001580932,0.001582205,0.001108604,0.002432537,0.003236569,0.001082983,0.0134817],"category_scores_gemma":[0.009311121,0.0008444034,0.0008874781,0.003328098,0.001198751,0.006085881,0.006877776,0.002937458,0.004902783],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001164147,"about_ca_system_score_gemma":0.002241623,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009402533,"about_ca_topic_score_gemma":0.00140979,"domain_scores_codex":[0.9959819,0.0006357448,0.0003591165,0.0004799227,0.001988102,0.0005551306],"domain_scores_gemma":[0.9949887,0.001279081,0.0003772308,0.002691561,0.0005022414,0.0001612397],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001787181,0.0001968753,0.000560143,0.0008309875,0.000083525,0.0002982879,0.0004465575,0.05117859,0.03895146,0.4164732,0.03734534,0.451848],"study_design_scores_gemma":[0.0004782406,0.0003215539,0.0002987398,0.0001962097,0.0001027514,0.0004029852,0.0001427695,0.3564538,0.04870303,0.5158718,0.07692654,0.000101601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006626935,0.0008393385,0.9775999,0.0003030616,0.0002768182,0.000197345,0.000440838,0.006643241,0.007072395],"genre_scores_gemma":[0.2897003,0.001218689,0.6960592,0.0003772043,0.0004269152,0.0007457614,0.002091035,0.001020026,0.008360869],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0134817,"threshold_uncertainty_score":0.04510081,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01148182625431453,"score_gpt":0.2427145159222111,"score_spread":0.2312326896678965,"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."}}