{"id":"W2143461819","doi":"10.1109/isita.2008.4895395","title":"On the capability of the Harada-Kobayashi algorithm in finding fix-free codewords","year":2008,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Simple (philosophy); Algorithm; Combinatorics; Kraft paper; Mathematics; Computer science; Discrete mathematics; Engineering","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.0004943117,0.0001149591,0.0001421363,0.00004138733,0.0002469773,0.00003196919,0.002326605,0.0000521872,0.00006792178],"category_scores_gemma":[0.0002063657,0.00005489411,0.00007058479,0.0004644949,0.0001365135,0.0003019733,0.0009674933,0.0002334713,0.00001197764],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004200985,"about_ca_system_score_gemma":0.00007965008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004549641,"about_ca_topic_score_gemma":0.00007509155,"domain_scores_codex":[0.9986599,0.0001497415,0.0002459287,0.0002975722,0.0004340767,0.0002127828],"domain_scores_gemma":[0.9976135,0.0004714252,0.00008540857,0.001751717,0.00004136925,0.00003655017],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004473008,0.001411681,0.02774307,0.00004681078,0.0000497093,0.00007026361,0.006985169,0.001506284,0.0009004563,0.5847008,0.1605548,0.2159863],"study_design_scores_gemma":[0.00112057,0.0001589909,0.2335661,0.0001479482,0.000004493032,0.00004415598,0.0001195854,0.6912671,0.00936499,0.05773203,0.006063923,0.0004101378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.354444,0.00008739028,0.6296407,0.006084633,0.00118158,0.0005709988,0.00004916083,0.000110565,0.007831011],"genre_scores_gemma":[0.9535505,0.00001784219,0.04465963,0.0008292932,0.00005023342,0.00001671275,0.000001742671,0.000007628005,0.0008664838],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6897607,"threshold_uncertainty_score":0.432345,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0267231363013425,"score_gpt":0.233530814563744,"score_spread":0.2068076782624015,"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."}}