{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008079119,0.0007409931,0.0005744636,0.001196078,0.0003544274,0.000665286,0.001511398,0.0007958501,0.001653737],"category_scores_gemma":[0.003807034,0.0002680963,0.0005156231,0.001191603,0.001047259,0.001207621,0.001037071,0.0007853043,0.0006705489],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004534026,"about_ca_system_score_gemma":0.0005337012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000758304,"about_ca_topic_score_gemma":0.0005839248,"domain_scores_codex":[0.9989826,0.0002406532,0.00007037251,0.0001672072,0.0004124103,0.0001267552],"domain_scores_gemma":[0.9977762,0.0006227254,0.0002163169,0.0007456201,0.0006003024,0.00003873089],"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.0006254725,0.000235862,0.00207943,0.0003548507,0.0000932157,0.0004816895,0.0002277988,0.1178117,0.3207128,0.06174075,0.002096534,0.49354],"study_design_scores_gemma":[0.00003959852,0.0004393265,0.001430239,0.00007248885,0.00009334126,0.001050594,0.00005207977,0.6707436,0.2965882,0.0177419,0.01164856,0.0001001349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08449233,0.0009375956,0.9045852,0.0001977405,0.0001281222,0.0002078609,0.00005637314,0.001770253,0.007624544],"genre_scores_gemma":[0.6146771,0.0007594842,0.3789023,0.0002834683,0.0001106333,0.0001942142,0.0001531247,0.0002926915,0.004626959],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001653737,"threshold_uncertainty_score":0.005532265,"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."}}