{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006927394,0.0006319571,0.0006113231,0.001002121,0.0005076755,0.0007997932,0.0008124812,0.0009446209,0.003727204],"category_scores_gemma":[0.002530212,0.0002402488,0.0002865154,0.001074547,0.0006207739,0.001269604,0.0009299602,0.0008474163,0.000930625],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005644159,"about_ca_system_score_gemma":0.001091387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00160337,"about_ca_topic_score_gemma":0.002267009,"domain_scores_codex":[0.9995321,0.0001161916,0.00002191124,0.0000723733,0.0002076713,0.00004970834],"domain_scores_gemma":[0.9994195,0.0002386032,0.00002805715,0.0001214861,0.0001600974,0.00003235838],"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.0004913397,0.00008971799,0.00048522,0.0001367359,0.00003001473,0.000102739,0.0001029019,0.1108239,0.02798438,0.2370778,0.01366497,0.6090102],"study_design_scores_gemma":[0.00008138858,0.00008638317,0.0002167371,0.00005143154,0.00002156741,0.0002837589,0.00002540334,0.8693227,0.01386618,0.1049113,0.011089,0.00004421633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01513151,0.0005945225,0.9743226,0.0004400812,0.0001762689,0.00005573617,0.0001968628,0.0005759486,0.00850645],"genre_scores_gemma":[0.2021653,0.0007442357,0.786244,0.000389631,0.0001652111,0.000160341,0.0004945099,0.0001820547,0.009454715],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003727204,"threshold_uncertainty_score":0.0124687,"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."}}