{"id":"W2114590489","doi":"10.1109/aero.2002.1036115","title":"Greedy adaptive Fano coding","year":2003,"lang":"en","type":"article","venue":"Proceedings - IEEE Aerospace Conference","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Huffman coding; Computer science; Algorithm; Decoding methods; Greedy algorithm; Adaptive coding; Binary number; Binary code; Theoretical computer science; Coding (social sciences); Shannon–Fano coding; Data compression; Lossless compression; Mathematics","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.0003631201,0.0003122784,0.0002924593,0.0001020742,0.0003420184,0.000635725,0.001217063,0.000121666,0.00006210546],"category_scores_gemma":[0.0001361141,0.0002839713,0.00006874162,0.000536537,0.0001039509,0.001856902,0.0002655911,0.0003220744,0.0001591586],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006769785,"about_ca_system_score_gemma":0.000146067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003814148,"about_ca_topic_score_gemma":0.000005028959,"domain_scores_codex":[0.9978279,0.00002054282,0.0002612207,0.0008085739,0.0004872823,0.0005944764],"domain_scores_gemma":[0.9986207,0.00006105482,0.0002049294,0.0003622472,0.0004977246,0.0002532858],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001412224,0.00009797959,0.001590644,0.00003741655,0.00002515992,0.00001368009,0.001842754,0.000009505169,0.02894102,0.9442399,0.01241445,0.01077337],"study_design_scores_gemma":[0.003966164,0.001505755,0.005812238,0.001195502,0.00008440037,0.0004307616,0.002481062,0.338587,0.4879591,0.06862348,0.08487515,0.004479347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01832241,0.00014243,0.935679,0.0005763733,0.0008587122,0.0003361953,0.000006843827,0.0004892977,0.04358873],"genre_scores_gemma":[0.9188123,0.0000728739,0.07974502,0.0002101369,0.00007141451,0.00003797869,0.000001181199,0.00001774555,0.001031386],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9004899,"threshold_uncertainty_score":0.9999613,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03740021934181804,"score_gpt":0.2436075039690208,"score_spread":0.2062072846272028,"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."}}