{"id":"W1971684295","doi":"10.1109/wosspa.2013.6602411","title":"Adaptation of bit recycling to arithmetic coding","year":2013,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Huffman coding; Arithmetic coding; Computer science; Data compression; Redundancy (engineering); Arithmetic; Context-adaptive binary arithmetic coding; Coding (social sciences); Lossless compression; Adaptation (eye); Compression ratio; Encoding (memory); Algorithm; Parallel computing; Theoretical computer science; Mathematics; Artificial intelligence; Engineering","routes":{"ca_aff":true,"ca_fund":true,"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.0001021531,0.00004540218,0.00007050481,0.0000733268,0.00003939948,0.00006636557,0.0003183061,0.0000181884,0.00006229043],"category_scores_gemma":[0.00003119597,0.00003562407,0.00001674017,0.0002098918,0.000005802996,0.000470088,0.0001869586,0.00003158606,0.0001408938],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007759741,"about_ca_system_score_gemma":0.00001189437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004682379,"about_ca_topic_score_gemma":0.000005171884,"domain_scores_codex":[0.9994565,0.00001468975,0.0001409283,0.0001516351,0.0001370862,0.00009914294],"domain_scores_gemma":[0.9995147,0.00005437919,0.0000386541,0.0002605389,0.00007449864,0.00005720312],"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.000001200498,0.00003822692,0.0002243561,0.00001132384,0.000004751493,0.000001041165,0.0006117529,0.001740437,0.01210556,0.04005811,0.002788886,0.9424143],"study_design_scores_gemma":[0.00008970611,0.0000502303,0.002665943,0.00003435928,0.000001077287,0.000001740504,0.00007182391,0.9865146,0.0062853,0.002202952,0.002001044,0.00008123432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01903833,0.00001794057,0.9785351,0.0003934748,0.0001345519,0.0001018419,4.572284e-7,0.00005399322,0.001724374],"genre_scores_gemma":[0.4536893,0.0000038585,0.5459118,0.0001399691,0.00001819586,0.000006583224,9.617273e-7,0.000002102447,0.0002272079],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9847742,"threshold_uncertainty_score":0.1810951,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02803285727302798,"score_gpt":0.2491283674095716,"score_spread":0.2210955101365436,"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."}}