{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001017965,0.0001224984,0.0001168043,0.0002082932,0.0003168291,0.00008158264,0.0009599032,0.00008916791,0.00004641853],"category_scores_gemma":[0.0001410463,0.0000950136,0.0001055125,0.0003666942,0.0001541427,0.001131672,0.000006695668,0.000293392,0.00002730572],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002989352,"about_ca_system_score_gemma":0.0001020932,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001583068,"about_ca_topic_score_gemma":0.00002314243,"domain_scores_codex":[0.9990235,0.00005629068,0.0003717709,0.0001230825,0.0002601829,0.0001651991],"domain_scores_gemma":[0.997515,0.00100731,0.0002228068,0.0008656788,0.0003414591,0.00004769262],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003486138,0.0003702042,0.000008714789,0.0001957697,0.0001025973,5.941391e-7,0.01637016,0.01565681,0.01322585,0.754779,0.003499429,0.1954423],"study_design_scores_gemma":[0.001180016,0.0009826492,0.000275112,0.0001267746,0.00007928116,0.00007009819,0.001451399,0.271079,0.6496122,0.06623662,0.008338404,0.0005684609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01087456,0.000006938168,0.9850923,0.0003548059,0.001694782,0.0005117401,0.00004429227,0.0003499415,0.001070627],"genre_scores_gemma":[0.9745457,0.00001023694,0.0247896,0.000392209,0.0000183581,0.0001347093,0.000004232092,0.000006653755,0.00009830023],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9636711,"threshold_uncertainty_score":0.3874542,"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."}}