{"id":"W1994156427","doi":"10.1016/j.disc.2009.04.002","title":"Research problems on Gray codes and universal cycles","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Gray code; Gray (unit); Mathematics; De Bruijn sequence; Discrete mathematics; Combinatorics; Algorithm","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.0007583498,0.0001003971,0.0001215566,0.0001703621,0.0002122646,0.0001921937,0.000486632,0.00004012009,0.000005379832],"category_scores_gemma":[0.00003714881,0.00007895949,0.00004106176,0.0003837371,0.0001142472,0.0001625651,0.0001071009,0.0001639197,0.00002059257],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001123448,"about_ca_system_score_gemma":0.00001272917,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000237879,"about_ca_topic_score_gemma":0.000001767496,"domain_scores_codex":[0.9990265,0.00008797003,0.0001206465,0.0002213037,0.0002980796,0.0002454709],"domain_scores_gemma":[0.9991718,0.0002521018,0.00003690864,0.0004146959,0.00004625119,0.00007827449],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003516765,0.00005898318,0.00002764201,0.00002803876,0.000006204104,0.000003750993,0.002456127,0.00001495114,0.0002990456,0.9916816,0.0002940829,0.005126015],"study_design_scores_gemma":[0.0001720024,0.0003666319,0.0005509959,0.0001501444,0.000004668693,0.000009210498,0.0005353812,0.01024353,0.0006777412,0.9862179,0.0009181858,0.0001536165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4689785,0.0002374546,0.4397287,0.005128279,0.0001744795,0.0006606765,0.00001006655,0.0005968165,0.08448502],"genre_scores_gemma":[0.9763072,0.0000405481,0.02341123,0.00007972316,0.0000246017,0.000003270259,0.00000102845,0.000005535577,0.0001268436],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5073287,"threshold_uncertainty_score":0.3219875,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03984690121705148,"score_gpt":0.308250311010599,"score_spread":0.2684034097935475,"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."}}