{"id":"W1479984205","doi":"10.1109/dcc.1994.305931","title":"Highly efficient universal coding with classifying to subdictionaries for text compression","year":2002,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Computer science; Parsing; Data compression; Compression ratio; Hash function; String (physics); Compression (physics); Algorithm; Speech recognition; Artificial intelligence; Pattern recognition (psychology); Natural language processing; Data mining; Mathematics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008150462,0.0001229646,0.0001214004,0.000109379,0.0004242653,0.0001835902,0.0004670301,0.00003796651,0.00004919071],"category_scores_gemma":[0.00001064233,0.00008597223,0.00003026188,0.0002739709,0.00002977354,0.0003465339,0.0002849982,0.00006757709,0.00004368636],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005103138,"about_ca_system_score_gemma":0.00001513421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002445257,"about_ca_topic_score_gemma":0.000004544842,"domain_scores_codex":[0.9989594,0.00001852607,0.0001285731,0.0003749476,0.0002626108,0.0002559365],"domain_scores_gemma":[0.9992508,0.0001246962,0.00004746603,0.0003514429,0.00009115215,0.0001344238],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001920054,0.0006058291,0.000689134,0.00007509677,0.00006016207,0.00004621494,0.00468302,0.04763513,0.009118794,0.5995228,0.1553673,0.1820045],"study_design_scores_gemma":[0.0005407068,0.0001846853,0.0004043048,0.00006626861,0.000004181798,0.000009472988,0.0001231482,0.9341149,0.001810043,0.00006868833,0.06249511,0.0001784977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006076414,0.00003748843,0.9887516,0.001440655,0.000268116,0.0002474329,0.000008049975,0.0002397224,0.002930457],"genre_scores_gemma":[0.7354812,0.000005087579,0.2627501,0.0003259075,0.00007238529,0.00001765288,0.000006078782,0.000009804098,0.001331834],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8864797,"threshold_uncertainty_score":0.3505846,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02783632000063993,"score_gpt":0.2304418808840361,"score_spread":0.2026055608833962,"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."}}