{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001529313,0.0004495977,0.0007029092,0.0003763791,0.0004672238,0.0005037686,0.003270368,0.0001529218,0.00004782117],"category_scores_gemma":[0.0003447177,0.0003535338,0.0005087175,0.000557401,0.0001146918,0.002822591,0.0009752303,0.0006295614,0.00002120804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001811292,"about_ca_system_score_gemma":0.0003332343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003299988,"about_ca_topic_score_gemma":0.00001564058,"domain_scores_codex":[0.9960587,0.0001272298,0.001278236,0.0005992906,0.001062137,0.0008743795],"domain_scores_gemma":[0.9961445,0.0003615006,0.00105596,0.001232861,0.0005445653,0.0006606479],"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.00003272903,0.0001745269,0.00002719195,0.00001964138,0.0001032205,0.0001124202,0.0003721357,0.0003180068,0.0002842608,0.001234826,0.01590019,0.9814209],"study_design_scores_gemma":[0.004619346,0.0007549371,0.0001993441,0.0003556579,0.00009636963,0.0008272882,0.0001355888,0.909557,0.001806571,0.0119943,0.06894996,0.0007035672],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001306102,0.002400312,0.9913648,0.002403541,0.001508461,0.0003127824,0.0001952637,0.0001117923,0.0003968928],"genre_scores_gemma":[0.00381443,0.0002210793,0.9910243,0.0006596695,0.003648366,0.00001868509,0.00002472903,0.00005590096,0.0005328074],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9807173,"threshold_uncertainty_score":0.9998916,"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."}}