{"id":"W2613337430","doi":"10.1016/j.tcs.2020.04.008","title":"Step-optimal implementations of large single-writer registers","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Register (sociolinguistics); Algorithm; Arithmetic; Shift register; Upper and lower bounds; Binary logarithm; Time complexity; Bit (key); Discrete mathematics; 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":[],"consensus_categories":[],"category_scores_codex":[0.000560223,0.0001462212,0.0001988715,0.00009404976,0.0002587709,0.0002737178,0.002481792,0.00003083139,0.00008221243],"category_scores_gemma":[0.00004940547,0.0001193163,0.00006746945,0.000960655,0.001035492,0.0009310798,0.002013641,0.0001309443,0.00003637486],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002477234,"about_ca_system_score_gemma":0.00008045917,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002723946,"about_ca_topic_score_gemma":2.361264e-7,"domain_scores_codex":[0.9978054,0.00007477632,0.0003443556,0.0006235917,0.0006824639,0.0004694813],"domain_scores_gemma":[0.9985635,0.0001288014,0.000109343,0.0007058284,0.0001667507,0.0003258132],"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.000008744149,0.00007948405,0.00006332659,0.00001008629,0.000003701212,0.000008278347,0.0009023723,0.00006917977,0.002404725,0.973708,0.0007395682,0.02200249],"study_design_scores_gemma":[0.0004753699,0.0005167177,0.0005242092,0.00002773575,0.000005721764,0.00001310308,0.00003913615,0.9838536,0.007351863,0.0041676,0.002804585,0.0002203249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01118388,0.00001556417,0.9847211,0.002596175,0.00023884,0.0001306254,0.00001959576,0.0001171565,0.000977064],"genre_scores_gemma":[0.6228061,9.87116e-7,0.3759228,0.001189964,0.00006953751,0.000001977818,0.000002689778,0.000004088127,0.000001834209],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9837844,"threshold_uncertainty_score":0.4865576,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02542056911127512,"score_gpt":0.2892463446486127,"score_spread":0.2638257755373375,"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."}}