{"id":"W3046970181","doi":"10.1016/j.tcs.2020.07.035","title":"Generating a Gray code for prefix normal words in amortized polylogarithmic time per word","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Guelph","funders":"Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Prefix; Substring; Word (group theory); Amortized analysis; Gray code; Combinatorics; Prefix code; Mathematics; Arithmetic; Time complexity; Computer science; Discrete mathematics; Set (abstract data type); Algorithm; Data structure; Decoding methods; Linear code; Programming language; Linguistics","routes":{"ca_aff":true,"ca_fund":false,"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.001114179,0.0002435775,0.0003279434,0.0001479036,0.000392078,0.0005915668,0.002803581,0.00007049616,0.0000564369],"category_scores_gemma":[0.0002048368,0.0001965766,0.00008485031,0.001047915,0.0008837681,0.001016098,0.001817464,0.0002669534,0.00007842641],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005224565,"about_ca_system_score_gemma":0.0002255529,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004780085,"about_ca_topic_score_gemma":0.000001486935,"domain_scores_codex":[0.9970227,0.0001098913,0.0004337919,0.001034054,0.0006231479,0.0007764128],"domain_scores_gemma":[0.9983882,0.000248554,0.00009504976,0.0006304918,0.0001270178,0.0005106942],"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.0001201504,0.0001750169,0.0001855935,0.00003367738,0.000009356464,0.00003985523,0.002937887,0.005535146,0.02172623,0.7960229,0.0008117808,0.1724024],"study_design_scores_gemma":[0.0006579191,0.0002296102,0.0002477403,0.00003182093,0.000003246678,0.00001419803,0.000004770235,0.9873506,0.001915322,0.008758591,0.000505214,0.0002809531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04205741,0.00002971136,0.9540285,0.002771877,0.0002917629,0.0003762026,0.00001608547,0.0002029412,0.0002255423],"genre_scores_gemma":[0.4587751,0.000001418803,0.5389462,0.001995129,0.0002367259,0.00002363261,0.000004290985,0.000009805843,0.000007679361],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9818155,"threshold_uncertainty_score":0.8016161,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01308467061360846,"score_gpt":0.2519275911630902,"score_spread":0.2388429205494818,"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."}}