{"id":"W1510678864","doi":"10.1016/j.endm.2007.07.091","title":"A fast algorithm to generate Beckett-Gray codes","year":2007,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Gray code; Heuristics; Gray (unit); Algorithm; Computation; Binary number; Mathematics; Computer science; Combinatorics; Arithmetic; Mathematical optimization","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.0005373296,0.000870122,0.000511696,0.00154839,0.0008191083,0.001019359,0.000764869,0.0008944384,0.01317531],"category_scores_gemma":[0.0026743,0.0003771475,0.0005432558,0.001325594,0.0006055047,0.0009511939,0.002046407,0.001151314,0.004944677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005915871,"about_ca_system_score_gemma":0.001089924,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008277186,"about_ca_topic_score_gemma":0.00161625,"domain_scores_codex":[0.9994709,0.00008617652,0.00003019063,0.00007478247,0.0002711899,0.00006684918],"domain_scores_gemma":[0.9993849,0.000193943,0.00003315573,0.0001515533,0.0001856102,0.00005089988],"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.0004281226,0.0001340808,0.0006903993,0.0001834318,0.00004633178,0.0002225965,0.0002437443,0.02688902,0.03239977,0.2389877,0.01406555,0.6857093],"study_design_scores_gemma":[0.0003453776,0.0003544561,0.0007974908,0.0001234012,0.0000822123,0.0008026005,0.0001635397,0.4669562,0.1019493,0.3660643,0.06224002,0.000121163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0130303,0.0001758063,0.9740937,0.000214182,0.0002058099,0.0002011789,0.0001680866,0.001708988,0.01020187],"genre_scores_gemma":[0.1115673,0.0001619554,0.8750631,0.0001696088,0.00004511549,0.0003000501,0.000446231,0.000478391,0.01176818],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01317531,"threshold_uncertainty_score":0.04407579,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01181243525335988,"score_gpt":0.2756582649566635,"score_spread":0.2638458297033036,"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."}}