{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007680766,0.001019969,0.001060714,0.001174734,0.0009577519,0.001795311,0.001303265,0.001523882,0.009474707],"category_scores_gemma":[0.007393398,0.0004527544,0.001002329,0.001883963,0.001670691,0.002687107,0.003665763,0.001418915,0.002782856],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001735187,"about_ca_system_score_gemma":0.002405534,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001948037,"about_ca_topic_score_gemma":0.003082978,"domain_scores_codex":[0.9978903,0.0003233161,0.0001549379,0.0003924561,0.0008636196,0.0003754598],"domain_scores_gemma":[0.9948101,0.002516174,0.0002675183,0.001419458,0.0007759392,0.0002107475],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002263838,0.0005585189,0.003829373,0.000628882,0.0001627463,0.001009526,0.0007963806,0.1087785,0.09206615,0.2123016,0.03335883,0.5442456],"study_design_scores_gemma":[0.0004199234,0.0004226677,0.0008880025,0.0000951818,0.0001261353,0.0006042342,0.0002047327,0.5563811,0.06212835,0.3672874,0.01136391,0.00007832974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2814513,0.0006316224,0.6844762,0.002113505,0.0005199558,0.0005071468,0.001156262,0.007784642,0.02135938],"genre_scores_gemma":[0.6250413,0.0002558017,0.3543617,0.0007338035,0.0001946536,0.0005667023,0.001884016,0.001342736,0.01561932],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009474707,"threshold_uncertainty_score":0.03169602,"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."}}