{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001734171,0.00006232487,0.00007580982,0.00002462712,0.0001672017,0.00003230146,0.0003916477,0.00001974727,0.00003812825],"category_scores_gemma":[0.00001659883,0.000034861,0.00002415118,0.0001224884,0.00006002701,0.0001259772,0.00003531062,0.0000360046,0.000004522897],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007856482,"about_ca_system_score_gemma":0.00006014335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007798507,"about_ca_topic_score_gemma":0.00004462415,"domain_scores_codex":[0.9995187,0.00003557798,0.00005125506,0.0001444085,0.0001435136,0.0001065507],"domain_scores_gemma":[0.9991816,0.0003510044,0.00005127696,0.0003204133,0.00006643297,0.00002925086],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001095115,0.0001824721,0.001422357,0.00002377044,0.00003102235,0.000004549845,0.0003890661,0.0026747,0.0002582069,0.9720377,0.01351298,0.009353619],"study_design_scores_gemma":[0.004254859,0.001982442,0.003928419,0.000196154,0.00004004853,0.000006362854,0.001068665,0.5495756,0.0341564,0.01763317,0.3864931,0.0006647058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03432311,0.000014166,0.9628581,0.0002430004,0.00002872615,0.0001326838,0.00001256773,0.0000335591,0.002354112],"genre_scores_gemma":[0.8867326,0.000003250042,0.1124403,0.0004583886,0.00000513575,0.000001315997,0.000004877524,0.000003831067,0.000350201],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9544046,"threshold_uncertainty_score":0.1421591,"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."}}