{"id":"W2169586192","doi":"10.1109/isit.2001.935941","title":"Efficient universal lossless data compression algorithms based on a greedy context-dependent sequential grammar transform","year":2002,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lossless compression; Computer science; Data compression; Compression (physics); Context (archaeology); Algorithm; Theoretical computer science; Context model; Artificial intelligence","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.001104662,0.0008180548,0.00118178,0.001213035,0.0004921096,0.0008700279,0.001377196,0.001007454,0.001067344],"category_scores_gemma":[0.004442492,0.0003573051,0.0005386088,0.001719048,0.00131728,0.001786656,0.001859586,0.001200264,0.000705947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005401946,"about_ca_system_score_gemma":0.001030314,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001108496,"about_ca_topic_score_gemma":0.001293622,"domain_scores_codex":[0.9990995,0.0002071544,0.00007126308,0.0001606514,0.0003774051,0.00008405768],"domain_scores_gemma":[0.9988746,0.0006269264,0.00008357433,0.0002328312,0.0001419536,0.00004008032],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004587662,0.000163857,0.0007494435,0.0001636618,0.00006776501,0.000361904,0.0002632469,0.2430784,0.03306241,0.06781836,0.005733754,0.6480784],"study_design_scores_gemma":[0.00005098462,0.00008211579,0.0001222134,0.00001150298,0.00001423995,0.0002274339,0.00002784797,0.9494591,0.01170102,0.03684417,0.001445179,0.00001423958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02021446,0.000394463,0.9771265,0.0001741845,0.00005064162,0.00005800412,0.0000584109,0.001251384,0.0006719127],"genre_scores_gemma":[0.3007953,0.0005467455,0.6954784,0.0003426756,0.0001123447,0.0002156421,0.0004489059,0.000208214,0.001851648],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001377196,"threshold_uncertainty_score":0.00584209,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05470251236435772,"score_gpt":0.261412816170819,"score_spread":0.2067103038064613,"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."}}