{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002212787,0.0001871051,0.0001877828,0.0001068516,0.0002715073,0.0004163623,0.0008816397,0.00007925184,0.00006064138],"category_scores_gemma":[0.00009998817,0.0001505133,0.00001932824,0.0003544307,0.00009931326,0.0005741338,0.001395039,0.00009908196,0.00009412284],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002518681,"about_ca_system_score_gemma":0.00005578472,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001085204,"about_ca_topic_score_gemma":0.00005783862,"domain_scores_codex":[0.9984925,0.00004402092,0.0002252214,0.0005576073,0.0003117616,0.0003688885],"domain_scores_gemma":[0.9987605,0.0001855865,0.00005967775,0.0006251684,0.0001288225,0.0002402144],"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.000298045,0.001046139,0.005696996,0.00005835966,0.0001721699,0.0004068748,0.005929346,0.0006022529,0.1230824,0.08993545,0.03807996,0.734692],"study_design_scores_gemma":[0.002720396,0.003082779,0.006519254,0.0002187214,0.00003233572,0.0008428679,0.0002685483,0.8022671,0.032812,0.002182686,0.1474488,0.001604529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07786515,0.00004394076,0.9115219,0.0002689525,0.0003672552,0.0002033971,0.00003424715,0.0002757644,0.00941947],"genre_scores_gemma":[0.3902832,0.000003881723,0.6084516,0.0007390765,0.0001296509,0.000003300116,0.000009722535,0.00001014524,0.0003694389],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8016648,"threshold_uncertainty_score":0.6137753,"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."}}