{"id":"W4253565581","doi":"10.1109/isit.2003.1228064","title":"On the university of grammar-based codes for sources with countably infinite alphabets","year":2003,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lossless compression; Computer science; Grammar; Data compression; Alphabet; Theoretical computer science; Mathematics; Discrete mathematics; Algorithm; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002199692,0.0007360587,0.001022009,0.002578796,0.001258566,0.002222125,0.0011943,0.001811589,0.002598796],"category_scores_gemma":[0.02056351,0.0006068688,0.001085338,0.001908226,0.005688413,0.00584552,0.00344893,0.003451505,0.0005981569],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001859447,"about_ca_system_score_gemma":0.001107963,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001342484,"about_ca_topic_score_gemma":0.0007155942,"domain_scores_codex":[0.9976803,0.0006020271,0.0001624753,0.0004457603,0.0009088499,0.000200517],"domain_scores_gemma":[0.9825824,0.01298665,0.0009133148,0.001977556,0.001233886,0.0003062108],"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.00003222239,0.00001102216,0.0002273517,0.00005929058,0.000008467488,0.00008169594,0.0001825121,0.01442475,0.0006761879,0.9680738,0.0009909429,0.01523171],"study_design_scores_gemma":[0.00000920693,0.0000198654,0.0001031914,0.00003912686,0.000007117937,0.0001228146,0.00002156459,0.05856308,0.0007970526,0.9360036,0.004295577,0.00001787571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0626888,0.005578245,0.8920828,0.00317629,0.0003544484,0.00005624401,0.0002530349,0.0004205503,0.03538964],"genre_scores_gemma":[0.7339701,0.008089681,0.2363,0.001666592,0.001857924,0.0002673456,0.0006345968,0.0005232978,0.01669047],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002598796,"threshold_uncertainty_score":0.01349127,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01393414140988762,"score_gpt":0.2007942788477141,"score_spread":0.1868601374378265,"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."}}