{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008208182,0.0004468253,0.0006456025,0.0008079257,0.0005638852,0.0009880182,0.0009345476,0.0008126558,0.002852407],"category_scores_gemma":[0.00703662,0.0003216438,0.0004422484,0.001450013,0.0009758138,0.002481717,0.00137963,0.001404526,0.0009247974],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005290781,"about_ca_system_score_gemma":0.001310032,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009674628,"about_ca_topic_score_gemma":0.002174285,"domain_scores_codex":[0.9991052,0.000202121,0.00007109568,0.0001815372,0.0003214234,0.0001186471],"domain_scores_gemma":[0.9971825,0.001296545,0.000172592,0.0008540117,0.0003974569,0.00009682624],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002309153,0.00008190126,0.001414328,0.000175669,0.00004331124,0.0002178756,0.0002423087,0.1603443,0.01675217,0.3500622,0.007651768,0.4627833],"study_design_scores_gemma":[0.00003930854,0.0001149249,0.0004200868,0.00006777141,0.00002652296,0.0005443244,0.0001070832,0.7749171,0.0302,0.1809218,0.01259412,0.00004697519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01558436,0.0002444047,0.9807667,0.0001803756,0.00007521798,0.00002747184,0.0001141626,0.0003740582,0.002633271],"genre_scores_gemma":[0.1997685,0.0003470138,0.7956854,0.0001651527,0.00007221232,0.0000757209,0.0003543137,0.0003272564,0.003204576],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002852407,"threshold_uncertainty_score":0.009542286,"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."}}