{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007547612,0.0003337759,0.00025153,0.0003782393,0.0006146493,0.0002733529,0.001061294,0.00011443,0.0001050994],"category_scores_gemma":[0.00000443987,0.0002632742,0.00008998843,0.0004744696,0.0001407143,0.002882619,0.00001066499,0.0004082618,0.00009999248],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001221869,"about_ca_system_score_gemma":0.0002376845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004636192,"about_ca_topic_score_gemma":0.00001124604,"domain_scores_codex":[0.9976165,0.0002843662,0.0004727748,0.0004467329,0.0007892936,0.0003903871],"domain_scores_gemma":[0.9977238,0.0002014363,0.0001908916,0.001509619,0.0001677308,0.0002065648],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003698326,0.0002791502,2.209975e-7,0.00002094687,0.00003250262,0.000006175139,0.0005973238,0.8354628,0.00001880876,0.03389608,0.0002113354,0.1291048],"study_design_scores_gemma":[0.003094454,0.0003289031,0.000001408187,0.0001541711,0.00003324141,0.00002383309,0.0003017697,0.9864451,0.003205988,0.0009907171,0.005062479,0.0003579881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006721205,0.00001045508,0.993987,0.0001193114,0.001019409,0.0005672753,0.0004517245,0.0002774289,0.002895279],"genre_scores_gemma":[0.9728691,0.000009045784,0.02600628,0.000740456,0.00002944634,0.0000468834,0.0001804809,0.00002130278,0.0000969985],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.972197,"threshold_uncertainty_score":0.9999819,"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."}}