{"id":"W2153447124","doi":"","title":"Faster Algorithm for Designing Optimal Prefix-Free Codes with Unequal Letter Costs","year":2006,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Prefix; Prefix code; Alphabet; Encoding (memory); Algorithm; Time complexity; Integer (computer science); Function (biology); Generalization; Binary logarithm; Binary number; Mathematics; Computer science; Discrete mathematics; Property (philosophy); Computational complexity theory; Combinatorics; Arithmetic; Block code; Decoding methods; Linear code","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.000269817,0.0002525466,0.0002436637,0.0001133821,0.0002863692,0.0006706013,0.001107128,0.00006900134,0.00002978129],"category_scores_gemma":[0.00001019331,0.0001868056,0.00006198089,0.0001826745,0.00007574542,0.002454659,0.000562812,0.0001357352,0.00006824345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009902658,"about_ca_system_score_gemma":0.00005746938,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000573399,"about_ca_topic_score_gemma":0.000006610564,"domain_scores_codex":[0.9982507,0.00002775344,0.0004622072,0.0002766233,0.0004631713,0.0005195759],"domain_scores_gemma":[0.9986615,0.0001500462,0.0001942333,0.0007950633,0.00009358105,0.0001055848],"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.0001388104,0.0004323289,0.0007259273,0.0002187868,0.0001684236,0.00003720715,0.002351824,0.003936161,0.0006317357,0.02344756,0.3062085,0.6617028],"study_design_scores_gemma":[0.002861339,0.0006212944,0.0004124246,0.000162854,0.00002518286,0.00003969649,0.0001830584,0.9051784,0.004300634,0.0004557791,0.08518252,0.0005768078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003003925,0.00002215469,0.9934957,0.0003697396,0.0002023043,0.0005620244,0.000119046,0.0001757353,0.002049366],"genre_scores_gemma":[0.008902159,0.000001457886,0.9887053,0.001504309,0.0002136254,0.0001399722,0.0001545687,0.00001816787,0.0003604103],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9012423,"threshold_uncertainty_score":0.7617712,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01264968380471236,"score_gpt":0.2293029668300164,"score_spread":0.2166532830253041,"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."}}