{"id":"W2149258547","doi":"10.1109/tit.2010.2046244","title":"A Kraft-Type Sufficient Condition for the Existence of $D$-Ary Fix-Free Codes","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Code (set theory); Combinatorics; Discrete mathematics; Computer science; Algorithm; Mathematics; 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.002767252,0.001495111,0.001953544,0.002462903,0.002379999,0.002619859,0.002107701,0.002743897,0.008104042],"category_scores_gemma":[0.0262813,0.001257594,0.001470219,0.002218493,0.003987046,0.004109744,0.003845365,0.003409249,0.003663905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001901222,"about_ca_system_score_gemma":0.005489944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002412941,"about_ca_topic_score_gemma":0.002076808,"domain_scores_codex":[0.9955364,0.0005650326,0.0003664548,0.001305419,0.001186298,0.001040317],"domain_scores_gemma":[0.9753238,0.01322645,0.002200078,0.002727031,0.005024224,0.001498267],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008066755,0.0001248203,0.00184045,0.0004306251,0.00009136843,0.0006376535,0.0004437848,0.04569046,0.02096715,0.8927217,0.007074027,0.02917137],"study_design_scores_gemma":[0.0004249798,0.0005685088,0.001043644,0.0002063617,0.0000774625,0.001404016,0.0002769285,0.2581803,0.02718613,0.6963915,0.01395959,0.0002805804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1377195,0.0005883063,0.8325463,0.002014754,0.0002873753,0.0002955877,0.002246642,0.001447338,0.02285434],"genre_scores_gemma":[0.784961,0.0007208071,0.1952884,0.0009337206,0.0003013939,0.0009642692,0.002736168,0.0003443192,0.01374989],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008104042,"threshold_uncertainty_score":0.02711076,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01272115827869365,"score_gpt":0.261712197880996,"score_spread":0.2489910396023023,"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."}}