{"id":"W2130433404","doi":"10.1109/tit.2003.818411","title":"Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform-part two: with context models","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Algorithm; Data compression; Lossless compression; Mathematics; Countable set; Entropy encoding; Arithmetic coding; Discrete mathematics; Theoretical computer science; 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.00068594,0.0007808629,0.0007527643,0.0009214964,0.0004177271,0.0007165915,0.00130197,0.000888231,0.001023736],"category_scores_gemma":[0.002780165,0.0003190463,0.0006072923,0.001501455,0.0009607244,0.001654175,0.001600252,0.001232451,0.0005362043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007056578,"about_ca_system_score_gemma":0.0008620404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001035321,"about_ca_topic_score_gemma":0.001246448,"domain_scores_codex":[0.9995431,0.0001045135,0.00003313881,0.0001080484,0.0001666077,0.00004466209],"domain_scores_gemma":[0.9992993,0.0003653319,0.0000661368,0.0001533761,0.000089753,0.00002618106],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002191813,0.0001094587,0.000743768,0.0001817007,0.0000596119,0.0002165274,0.0003066789,0.1979513,0.03225037,0.142262,0.004235264,0.621464],"study_design_scores_gemma":[0.00002213065,0.00005912717,0.0001210735,0.00001373371,0.00001255908,0.000212888,0.00002898576,0.9460542,0.01324189,0.0381138,0.002105585,0.00001402356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01145538,0.0004440444,0.9866229,0.0001172225,0.00002940775,0.00005184708,0.00004909204,0.0004448514,0.0007853],"genre_scores_gemma":[0.2016503,0.0005173312,0.795517,0.00015832,0.00005961966,0.0002066233,0.0002454277,0.00009681933,0.001548511],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00130197,"threshold_uncertainty_score":0.00511992,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02623472200375592,"score_gpt":0.242439027781114,"score_spread":0.2162043057773581,"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."}}