{"id":"W2884379947","doi":"10.1109/dcc.2018.00058","title":"Optimal Single- and Multiple-Tree Almost Instantaneous Variable-to-Fixed Codes","year":2018,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"","keywords":"Prefix; Property (philosophy); Variable (mathematics); Computer science; Prefix code; Trie; Tree (set theory); Constraint (computer-aided design); Algorithm; Theoretical computer science; Mathematics; Data structure; Block code; Combinatorics; Linear code; Decoding methods; Programming language","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.0001497869,0.000153832,0.0001585945,0.00007511707,0.0002320199,0.0002918646,0.000660082,0.0000601287,0.00005893777],"category_scores_gemma":[0.00007613633,0.0001213936,0.00001672423,0.0002899936,0.00008340886,0.0004615124,0.001001075,0.00007411939,0.0001000585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002310734,"about_ca_system_score_gemma":0.00003491003,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001271536,"about_ca_topic_score_gemma":0.00004565465,"domain_scores_codex":[0.9987729,0.00003241235,0.0001800964,0.0004834954,0.0002199406,0.0003112228],"domain_scores_gemma":[0.9989102,0.0001487602,0.00004230606,0.0005832307,0.0001101851,0.0002052432],"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.000358531,0.0009322208,0.002695389,0.00005626723,0.0001133784,0.0004168543,0.003538884,0.0009376028,0.2363863,0.1023223,0.04541265,0.6068296],"study_design_scores_gemma":[0.001003045,0.001108313,0.001050336,0.00008176814,0.000009544005,0.0003677423,0.00009301292,0.8877877,0.02200108,0.0007690587,0.08511453,0.0006138997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05727105,0.00004039185,0.9316841,0.0002378686,0.0003557415,0.0001521867,0.00001639138,0.0002377765,0.01000447],"genre_scores_gemma":[0.3818348,0.00000381037,0.6169669,0.0005453918,0.0001270138,0.000002473312,0.000005066905,0.000008206063,0.0005062999],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8868501,"threshold_uncertainty_score":0.4950288,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0166649014752136,"score_gpt":0.2337494488027307,"score_spread":0.2170845473275171,"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."}}