{"id":"W2016908520","doi":"10.1016/j.jda.2005.07.003","title":"A loop-free two-close Gray-code algorithm for listing k-ary Dyck words","year":2005,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Gray code; Combinatorics; Mathematics; Suffix; Algorithm; Gray (unit); String (physics); Computer science; Discrete mathematics","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.0003561917,0.0007696746,0.0008183428,0.001477981,0.0009171425,0.001439026,0.001309538,0.001121579,0.01193297],"category_scores_gemma":[0.002279522,0.0003543637,0.0004370373,0.001437943,0.0007085679,0.001442969,0.002095029,0.001196535,0.003656603],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009019081,"about_ca_system_score_gemma":0.001511574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003874868,"about_ca_topic_score_gemma":0.006718839,"domain_scores_codex":[0.9994071,0.00006323073,0.00004457952,0.00009821734,0.0003058106,0.00008109374],"domain_scores_gemma":[0.9991392,0.0002416203,0.00005922266,0.0002322022,0.0002417436,0.00008597023],"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.0006103929,0.000259661,0.0006424834,0.0001903762,0.00003658141,0.0001838826,0.000232289,0.02589227,0.03542344,0.04157244,0.01220783,0.8827483],"study_design_scores_gemma":[0.0007242411,0.0005698985,0.001208337,0.000111034,0.00007648506,0.0008276695,0.0002936693,0.7867868,0.08265976,0.09255932,0.03401443,0.0001683978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02689707,0.0001980135,0.9601197,0.0002132517,0.0001119102,0.0002089312,0.000175183,0.004762619,0.007313314],"genre_scores_gemma":[0.1399024,0.0001000305,0.8506575,0.0001759053,0.00003363152,0.0002497568,0.0005082082,0.0004873581,0.00788515],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01193297,"threshold_uncertainty_score":0.03991973,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01751871827606128,"score_gpt":0.2913363529879703,"score_spread":0.273817634711909,"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."}}