{"id":"W1969174204","doi":"10.1016/s0306-4573(03)00007-4","title":"A nearly-optimal Fano-based coding algorithm","year":2003,"lang":"en","type":"article","venue":"Information Processing & Management","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University; University of Windsor","funders":"","keywords":"Huffman coding; Fano plane; Algorithm; Lossless compression; Computer science; Shannon–Fano coding; Coding (social sciences); Data compression; Theoretical computer science; Mathematics; Statistics","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":[],"consensus_categories":[],"category_scores_codex":[0.0003870346,0.0001509642,0.0001095882,0.0002223517,0.0003502201,0.00103312,0.0005339948,0.00004140626,0.00002569041],"category_scores_gemma":[0.00001479032,0.000137888,0.0000386567,0.0004716975,0.00002391147,0.004611252,0.0001737779,0.00009905601,0.0001572131],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006350296,"about_ca_system_score_gemma":0.00006659489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004527163,"about_ca_topic_score_gemma":1.073681e-7,"domain_scores_codex":[0.9986721,0.00002870003,0.0003549959,0.0001960958,0.0004618576,0.0002862863],"domain_scores_gemma":[0.9992136,0.00001392626,0.000197045,0.0003837971,0.0001121559,0.0000794831],"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.000001820417,0.00002766205,0.000009163417,0.00008637738,0.00000655625,0.000004492271,0.0003433031,0.002159501,0.000002647096,0.01557544,0.001229006,0.980554],"study_design_scores_gemma":[0.0005388582,0.00002355864,0.0002301631,0.00008889313,0.000007023364,0.000005652603,0.0001268761,0.8058408,0.0004566408,0.0004768281,0.1919979,0.0002068834],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001552316,0.00004712106,0.985248,0.0001591536,0.0002346954,0.0002047314,0.00000277505,0.0002887019,0.01365959],"genre_scores_gemma":[0.08142995,0.000009084544,0.9168441,0.001305021,0.0000226165,0.00005493753,0.00003502975,0.000007534042,0.0002916971],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9803472,"threshold_uncertainty_score":0.9962395,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009329930075609541,"score_gpt":0.2300662805095044,"score_spread":0.2207363504338949,"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."}}