{"id":"W2070295459","doi":"10.3390/e17031379","title":"The Optimal Fix-Free Code for Anti-Uniform Sources","year":2015,"lang":"en","type":"article","venue":"Entropy","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Huffman coding; Code (set theory); Canonical Huffman code; Source code; Symbol (formal); Class (philosophy); Prefix code; Universal code; Computer science; Mathematics; Combinatorics; Programming language; Algorithm; Code rate; Linear code; Decoding methods; Systematic code; Block code","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.0002641981,0.00007987794,0.0000816139,0.000017031,0.0002626859,0.0002609473,0.00142373,0.00002806885,0.000003926255],"category_scores_gemma":[0.00009583118,0.0000474264,0.00004232296,0.00006653785,0.00003953884,0.0002487467,0.0005467806,0.00006038032,0.00003828824],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001835026,"about_ca_system_score_gemma":0.0000477579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001447212,"about_ca_topic_score_gemma":0.00000428543,"domain_scores_codex":[0.9992194,0.00001931271,0.0001140796,0.0001866789,0.0002182521,0.0002422832],"domain_scores_gemma":[0.9989729,0.0001072508,0.00005616528,0.0006941922,0.00006830854,0.0001011844],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005346362,0.00008946738,0.0004481293,0.00000789318,0.00003202568,0.00001099565,0.001128076,0.002311958,0.0002698886,0.3172272,0.6331931,0.04522778],"study_design_scores_gemma":[0.0005824999,0.0000910915,0.000178261,0.000005538096,0.000002730827,0.000004394649,0.00006152588,0.3788518,0.0009775213,0.006197751,0.6129591,0.0000877342],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009551016,0.0003700251,0.9864548,0.002074343,0.0006746746,0.0001565094,0.00003583611,0.0001032814,0.0005795301],"genre_scores_gemma":[0.1522565,0.00007557673,0.8407701,0.0007228519,0.001320623,0.00008618008,0.00003784775,0.00003227597,0.004698017],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3765398,"threshold_uncertainty_score":0.2645668,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02572240566034025,"score_gpt":0.262229856858203,"score_spread":0.2365074511978627,"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."}}