{"id":"W4291319443","doi":"10.48550/arxiv.1605.06615","title":"Efficient and Compact Representations of Some Non-Canonical Prefix-Free Codes","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Xunta de Galicia; European Commission; Gruppo Nazionale per il Calcolo Scientifico; Universidade da Coruña; Istituto Nazionale di Alta Matematica \"Francesco Severi\"; Agencia Nacional de Investigación y Desarrollo; Helsingin Yliopisto","keywords":"Prefix code; Code word; Prefix; Lexicographical order; Word (group theory); Code (set theory); Combinatorics; Mathematics; Constant (computer programming); Alphabet; Order (exchange); Decoding methods; Discrete mathematics; Binary logarithm; ENCODE; Sigma; Encoding (memory); Computer science; Algorithm; Linear code; Physics; Block code","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001885728,0.0002269162,0.0003630086,0.0001942087,0.0001334742,0.00007095291,0.001865761,0.0001719745,0.000017193],"category_scores_gemma":[0.00004669576,0.0001982512,0.0001271193,0.0002161177,0.0002379076,0.0002411448,0.004307124,0.0002674188,0.00001353722],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007163765,"about_ca_system_score_gemma":0.0001935767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001849388,"about_ca_topic_score_gemma":0.000008808434,"domain_scores_codex":[0.9983633,0.000102374,0.0002339321,0.0009079835,0.0001375171,0.0002548475],"domain_scores_gemma":[0.9971976,0.0002273687,0.0002821437,0.001978496,0.0001305122,0.0001839038],"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.000139663,0.0006897925,0.009500892,0.0003222029,0.0003165041,0.0002884513,0.0006401938,0.2468301,0.001404518,0.7316478,0.005372598,0.002847255],"study_design_scores_gemma":[0.001124075,0.00008086673,0.0209023,0.0003324787,0.0000602715,0.000006863847,0.00003297276,0.920687,0.0006495997,0.05549192,0.0002195635,0.0004121519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2928275,0.00009557587,0.7038193,0.000204782,0.0003579863,0.0002726582,0.0002369083,0.00009177807,0.00209356],"genre_scores_gemma":[0.9964157,0.0001110791,0.002968593,0.00002281657,0.00005602138,4.874213e-7,0.00001107637,0.000009621857,0.0004046571],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7035882,"threshold_uncertainty_score":0.808445,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05301903942482356,"score_gpt":0.215923996379469,"score_spread":0.1629049569546454,"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."}}