{"id":"W4226238874","doi":"10.1016/j.tcs.2022.01.010","title":"Efficient and compact representations of some non-canonical prefix-free codes","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Prefix code; Code word; Lexicographical order; Prefix; ENCODE; Word (group theory); Constant (computer programming); Mathematics; Code (set theory); Decoding methods; Encoding (memory); Combinatorics; Discrete mathematics; Alphabet; Universal code; Order (exchange); Computer science; Arithmetic; Algorithm; Code rate; Linear code; 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.001294247,0.0001431915,0.0002449706,0.0001903211,0.0008070197,0.0001892593,0.003193042,0.00002208776,0.00005710448],"category_scores_gemma":[0.0000769333,0.0001188799,0.00005415276,0.0008941583,0.002244986,0.0003173436,0.006009173,0.0002367225,0.000004519954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005083856,"about_ca_system_score_gemma":0.0001825536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002025007,"about_ca_topic_score_gemma":2.247807e-7,"domain_scores_codex":[0.9973764,0.0001556511,0.0003232674,0.0007040717,0.00103743,0.0004032251],"domain_scores_gemma":[0.9977987,0.0003746118,0.0001092992,0.001369425,0.000103591,0.00024438],"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.00001183138,0.0001496554,0.00009625027,0.000006622972,0.000003979035,0.00000814281,0.0004176255,0.009118673,0.001175176,0.9823152,0.0002400323,0.00645678],"study_design_scores_gemma":[0.0003682112,0.0002924695,0.005921568,0.00001371738,0.000004639947,0.00005292084,0.00001890791,0.935605,0.00154279,0.05594011,0.00008569995,0.00015399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1480243,0.00005760091,0.8490224,0.001067138,0.0004296673,0.0002011065,0.00003817347,0.00008009606,0.001079487],"genre_scores_gemma":[0.9136024,0.000002818086,0.08612484,0.0002035686,0.00004555933,0.000007166676,0.000001704536,0.000005080671,0.000006820521],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9264863,"threshold_uncertainty_score":0.8271743,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01079473506623293,"score_gpt":0.2691636732684782,"score_spread":0.2583689382022453,"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."}}