{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000543125,0.0007215387,0.0008096834,0.001070585,0.0003418214,0.001520487,0.001175441,0.0008146112,0.003567418],"category_scores_gemma":[0.003044865,0.0005075422,0.0003437806,0.001877744,0.001444792,0.002857952,0.001361812,0.002144575,0.001396718],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006638194,"about_ca_system_score_gemma":0.0004644323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003980451,"about_ca_topic_score_gemma":0.0003592219,"domain_scores_codex":[0.999576,0.00009313509,0.00002462199,0.00005565727,0.0002102317,0.00004032632],"domain_scores_gemma":[0.9985818,0.0009602931,0.00004460672,0.0002639925,0.000121846,0.00002737416],"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.00006581256,0.00002712615,0.00008228634,0.0003808319,0.00001983451,0.00009498724,0.0001972219,0.03753044,0.007915332,0.6877,0.01223358,0.2537525],"study_design_scores_gemma":[0.00001561167,0.00002641472,0.0001221628,0.0001713707,0.00001646423,0.0002937628,0.00003333298,0.1466527,0.01212987,0.8111857,0.02932503,0.00002751678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007449915,0.01040804,0.9431485,0.0006619573,0.0002714839,0.00003225548,0.000215544,0.0006454149,0.0371669],"genre_scores_gemma":[0.3898681,0.03053344,0.4785424,0.0008665508,0.00135489,0.0003228154,0.001400426,0.0009448271,0.09616652],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003567418,"threshold_uncertainty_score":0.01193422,"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."}}