{"id":"W2149489229","doi":"10.37236/1720","title":"Binary Gray Codes with Long Bit Runs","year":2003,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Mathematics; Gray code; Combinatorics; Subsequence; Hamming distance; Binary number; Hamming code; Gray (unit); Discrete mathematics; Arithmetic; Algorithm; Block code; Decoding methods","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.001797187,0.0001543319,0.0002153816,0.0001648998,0.0002507334,0.0001063272,0.001239404,0.00004134137,0.000007545525],"category_scores_gemma":[0.00004253545,0.00009103895,0.0001310009,0.001082631,0.00009122722,0.0003352697,0.00005131245,0.0006467851,0.000004972134],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007583398,"about_ca_system_score_gemma":0.0004352376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001189939,"about_ca_topic_score_gemma":0.00000235081,"domain_scores_codex":[0.9983612,0.0003029658,0.0002617173,0.0001310765,0.0004176118,0.0005253893],"domain_scores_gemma":[0.9987514,0.0002323611,0.000300462,0.000435846,0.0001932887,0.00008661823],"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.0000319944,0.0001168738,0.0009377996,0.000004778644,0.00008273413,0.00002154698,0.000217728,0.0000837365,0.0001079083,0.9977846,0.0001801193,0.0004302283],"study_design_scores_gemma":[0.0008091916,0.00187505,0.0006120375,0.00004051337,0.00005134096,0.001006038,0.00006894457,0.0001141146,0.002095212,0.983494,0.009647385,0.0001862169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3563646,0.007481368,0.6313527,0.0009927199,0.0007779092,0.00012482,2.129958e-7,0.00006314934,0.002842493],"genre_scores_gemma":[0.9992102,0.0003725084,0.0001768523,0.00008918033,0.00003430069,0.000001538392,9.208674e-8,0.00001136171,0.0001039225],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6428456,"threshold_uncertainty_score":0.3712461,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005235754770155271,"score_gpt":0.2027874407928435,"score_spread":0.1975516860226882,"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."}}