{"id":"W2178984881","doi":"10.1109/tit.2005.856948","title":"The Universality of Grammar-Based Codes for Sources With Countably Infinite Alphabets","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Alphabet; Combinatorics; Universality (dynamical systems); Discrete mathematics; Countable set; Lambda; Grammar; Physics; Linguistics","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.0005244135,0.00009880756,0.00009443491,0.00009974446,0.000441997,0.0001165263,0.0003796158,0.00004144133,0.00001043052],"category_scores_gemma":[0.000005574639,0.00006339198,0.00005468705,0.0001890353,0.0001153748,0.001706762,0.00000219977,0.00009103943,0.00001211556],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003554425,"about_ca_system_score_gemma":0.00009777715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001675013,"about_ca_topic_score_gemma":0.00002418235,"domain_scores_codex":[0.9992272,0.00005707612,0.000250083,0.00008605673,0.0002363758,0.0001432259],"domain_scores_gemma":[0.9986823,0.0005431763,0.0001739752,0.0003768887,0.0001808802,0.0000427683],"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.0005907377,0.0001066488,0.000006543663,0.0000417844,0.00005474444,1.14621e-7,0.001672574,0.1518051,0.00004907489,0.08352174,0.0002979883,0.761853],"study_design_scores_gemma":[0.003115091,0.0007467738,0.00021639,0.0001088332,0.00005256484,0.00000611289,0.001286367,0.7880044,0.05294117,0.005090082,0.148029,0.0004031931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002879772,0.00001350508,0.9958544,0.0002698222,0.0001310347,0.0002437817,0.0001035005,0.00008502563,0.0004191505],"genre_scores_gemma":[0.971675,0.00001430071,0.02772637,0.000412308,0.00001609823,0.00004631322,0.00001420722,0.000004856727,0.0000904809],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9687953,"threshold_uncertainty_score":0.3399528,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008000919638424399,"score_gpt":0.2201732323105906,"score_spread":0.2121723126721662,"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."}}