{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001948896,0.00009255998,0.0001270132,0.00006209334,0.0001437792,0.0002757441,0.0003475075,0.00003912689,0.000033252],"category_scores_gemma":[0.00003322252,0.0000813142,0.00003615978,0.0006767503,0.00002342904,0.0001253169,0.0001353529,0.00004942332,0.0003979209],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006720573,"about_ca_system_score_gemma":0.00008201347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005116588,"about_ca_topic_score_gemma":0.000005832523,"domain_scores_codex":[0.9989308,0.00003862402,0.00018161,0.0003217127,0.0002968295,0.000230463],"domain_scores_gemma":[0.9994025,0.00006386928,0.00005353081,0.0003331289,0.00008598623,0.00006102442],"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.00003876253,0.0002132279,0.003256539,0.000103065,0.0001700473,0.000191187,0.007910306,0.08572123,0.00499673,0.595325,0.0530385,0.2490354],"study_design_scores_gemma":[0.0003188176,0.00002768461,0.005580042,0.00005986855,0.00000233308,0.00000153417,0.000107839,0.9796913,0.0009428216,0.001427631,0.01166614,0.0001739719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06693889,0.00005747913,0.9256414,0.0004439637,0.0003938451,0.0001291406,0.00003567566,0.0007166338,0.005642973],"genre_scores_gemma":[0.9920688,0.000005150658,0.007019227,0.00008877603,0.00005615268,0.00001009972,0.00004339778,0.000006812772,0.0007016181],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9251299,"threshold_uncertainty_score":0.5114601,"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."}}