{"id":"W2132943603","doi":"10.1007/978-1-4757-6048-4_36","title":"Universal Lossless Coding of Sources with Large and Unbounded Alphabets","year":2000,"lang":"en","type":"book-chapter","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Adaptive coding; Algorithm; Huffman coding; Arithmetic coding; Lossless compression; Data compression; ENCODE; Computer science; Mathematics; Coding (social sciences); Theoretical computer science; Context-adaptive binary arithmetic coding","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.00007660755,0.0002146469,0.0002936287,0.000116957,0.0001073352,0.00009841458,0.0005273721,0.000131495,0.0001944384],"category_scores_gemma":[8.199415e-7,0.0001575465,0.00003565985,0.00003297548,0.0001071079,0.0003320549,0.0003999733,0.000151125,0.00001097616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001563385,"about_ca_system_score_gemma":0.00006493297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004332394,"about_ca_topic_score_gemma":0.00003050789,"domain_scores_codex":[0.9989602,0.000008841581,0.0001648233,0.0004058247,0.0002824295,0.0001778961],"domain_scores_gemma":[0.999215,0.00004813392,0.000139164,0.0004623462,0.00005127047,0.00008408308],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000019963,0.00001915442,0.00003020981,0.00003607354,0.00005156169,0.00005371145,0.0002115348,0.000005874967,0.00001100757,0.9712532,0.0006321161,0.0276756],"study_design_scores_gemma":[0.003673035,0.0008460457,0.0003902394,0.002183285,0.0001471682,0.0001917224,0.0001544461,0.04112399,0.0008188767,0.06528763,0.8831276,0.002055932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0007704883,0.0006893136,0.3581496,0.00008173221,0.0001017508,0.0001908241,0.00008079049,0.0001379545,0.6397976],"genre_scores_gemma":[0.1506851,0.002537081,0.1149625,0.0005081877,0.0003315575,0.000004178366,0.0001680672,0.0001362802,0.7306671],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.9059656,"threshold_uncertainty_score":0.6424562,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00975808768726935,"score_gpt":0.1977759511295121,"score_spread":0.1880178634422428,"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."}}