{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001103458,0.0002698406,0.0003267872,0.0002246319,0.0001271174,0.0001833685,0.001218159,0.00009154851,0.00002043373],"category_scores_gemma":[0.0001198145,0.0002250287,0.00007359749,0.0007294083,0.00004425202,0.000340429,0.0005620933,0.0003151452,0.00009323099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001878569,"about_ca_system_score_gemma":0.0001082596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005499421,"about_ca_topic_score_gemma":0.0001373791,"domain_scores_codex":[0.9975274,0.00003984029,0.0004932302,0.0004944437,0.0004385986,0.001006441],"domain_scores_gemma":[0.9984522,0.0002834596,0.000122361,0.0009107453,0.00005832403,0.0001728563],"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.00002095963,0.0005140295,0.0001971362,0.0001215857,0.00007261943,0.00009873551,0.006426586,0.001160722,0.007410943,0.250176,0.00112378,0.7326769],"study_design_scores_gemma":[0.0009128785,0.0004706321,0.0004912667,0.000287663,0.0000188298,0.0001007715,0.0001903535,0.8375095,0.04283382,0.1097888,0.006295146,0.001100338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01664731,0.0003282252,0.9815891,0.0003509913,0.000186056,0.0002977345,0.00001143539,0.0001463833,0.0004427816],"genre_scores_gemma":[0.1516299,0.00004195601,0.8476004,0.0002680306,0.000182231,0.00002592718,0.00001621499,0.00003178088,0.0002035074],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8363488,"threshold_uncertainty_score":0.9176404,"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."}}