{"id":"W2886760888","doi":"10.1109/isit.2018.8437665","title":"Individually 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":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"","keywords":"Prefix; Computer science; String (physics); Prefix code; Variable (mathematics); Tree (set theory); Dynamic programming; Algorithm; Parsing; Constraint (computer-aided design); Property (philosophy); Trie; Theoretical computer science; Block code; Mathematics; Data structure; Linear code; Combinatorics; Artificial intelligence; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006671539,0.0004733347,0.0006493959,0.0007175985,0.0005564611,0.0008475944,0.0009461165,0.0008043656,0.002840961],"category_scores_gemma":[0.004694236,0.0002760592,0.000435434,0.001270564,0.00089543,0.001972428,0.00134886,0.001258573,0.0007594654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005310962,"about_ca_system_score_gemma":0.001240635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008805068,"about_ca_topic_score_gemma":0.002184777,"domain_scores_codex":[0.99929,0.0001506213,0.00005076683,0.0001608338,0.0002250343,0.0001227454],"domain_scores_gemma":[0.9981717,0.0008108474,0.0001231372,0.0005473721,0.0002590082,0.00008794077],"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.0002625354,0.00007807867,0.00141604,0.0001540337,0.00004520205,0.0002426007,0.0002023645,0.2436781,0.01693669,0.3149779,0.006630756,0.4153757],"study_design_scores_gemma":[0.0000291715,0.0001323582,0.0004032686,0.00005393492,0.00003050647,0.000477864,0.00008801994,0.8355629,0.02112087,0.1338267,0.008227412,0.00004696031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02777549,0.0003057837,0.9666061,0.000168913,0.0000848972,0.00003284339,0.0001353735,0.0003955592,0.004495086],"genre_scores_gemma":[0.377149,0.0003921661,0.6172633,0.0001694188,0.00007851329,0.00007754657,0.0003591152,0.0002784903,0.004232503],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002840961,"threshold_uncertainty_score":0.009503961,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0173720346367076,"score_gpt":0.2329649323319181,"score_spread":0.2155928976952105,"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."}}