{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004237179,0.0000801141,0.00008875549,0.00006672351,0.0001493307,0.0002321555,0.0006481655,0.00002973653,0.000009063982],"category_scores_gemma":[0.00009041097,0.00005086312,0.00001790834,0.000463841,0.00002291366,0.0007133845,0.0005024123,0.00009971015,0.00003617174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006106685,"about_ca_system_score_gemma":0.0001232788,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007077369,"about_ca_topic_score_gemma":0.0000470902,"domain_scores_codex":[0.9990638,0.00005054889,0.0001811644,0.0002595574,0.0002370007,0.0002078901],"domain_scores_gemma":[0.9992665,0.00005399132,0.00003766747,0.0004744817,0.00006799379,0.00009934624],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001558353,0.00043273,0.009123448,0.00002662987,0.00004615878,0.0001150072,0.01972601,0.1472607,0.01190959,0.3714106,0.150866,0.2889272],"study_design_scores_gemma":[0.0006149345,0.000106106,0.003156441,0.00016071,0.000004397664,0.00005848995,0.0006947831,0.8156483,0.004172817,0.03761449,0.1373653,0.0004032932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04669769,0.0001860883,0.9427884,0.004368829,0.0007903137,0.0001700587,0.000001451515,0.0001172146,0.004880024],"genre_scores_gemma":[0.3179328,0.00001298309,0.6790772,0.001045576,0.000232818,0.00001446785,0.000003085052,0.00001090808,0.001670106],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6683875,"threshold_uncertainty_score":0.2238681,"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."}}