{"id":"W1518570358","doi":"10.1109/cwit.2015.7255153","title":"Using bit recycling to reduce the redundancy in plurally parsable dictionaries","year":2015,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"","keywords":"Redundancy (engineering); Computer science; Binary number; Algorithm; Coding (social sciences); Binary code; Theoretical computer science; Random variable; Arithmetic; 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.0009859143,0.0004736444,0.0006455671,0.0009864208,0.0006698064,0.0009800429,0.0009600217,0.0007205959,0.001626821],"category_scores_gemma":[0.007310892,0.0002956055,0.0003841439,0.001335845,0.001385919,0.002157036,0.001612707,0.0009598823,0.0007480237],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00040807,"about_ca_system_score_gemma":0.0007168542,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006043735,"about_ca_topic_score_gemma":0.001109243,"domain_scores_codex":[0.9991425,0.0001729438,0.0001084164,0.0001500554,0.0003376669,0.00008838834],"domain_scores_gemma":[0.9961786,0.00143703,0.0003746837,0.001371074,0.0005662459,0.00007244485],"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.001081016,0.0001213442,0.002351736,0.0002316172,0.00006278315,0.0003696009,0.0005669289,0.09118922,0.1117906,0.1911368,0.002471793,0.5986266],"study_design_scores_gemma":[0.00007185419,0.000434519,0.0006460454,0.00009636993,0.00005354048,0.0009462181,0.0001544317,0.6712454,0.2389953,0.07666701,0.01059702,0.00009234967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09912688,0.0002975754,0.8965181,0.0001606109,0.00004713345,0.00004755616,0.00004712285,0.0007621805,0.002992867],"genre_scores_gemma":[0.4072596,0.0002374615,0.5878567,0.0001568078,0.0000389171,0.00007760432,0.0001410226,0.0002095986,0.004022352],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001626821,"threshold_uncertainty_score":0.005442262,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1349926033390749,"score_gpt":0.3387667235743752,"score_spread":0.2037741202353003,"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."}}