{"id":"W2911101083","doi":"10.1109/tit.2021.3132675","title":"A Deterministic Algorithm for the Capacity of Finite-State Channels","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China; Research Grants Council, University Grants Committee; William and Flora Hewlett Foundation; National Science Foundation","keywords":"Mathematics; Algorithm; Polynomial; Mutual information; Channel (broadcasting); Finite state; Regular polygon; Exponential function; Channel capacity; Euclidean space; Mathematical optimization; Applied mathematics; Computer science; Markov chain; Combinatorics; Mathematical analysis; Statistics","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.0006138308,0.0001062942,0.000119457,0.0001363988,0.0002328041,0.00008853118,0.0004039336,0.00004897905,0.00001567256],"category_scores_gemma":[0.00007058481,0.00008676874,0.0001238126,0.0003363986,0.00006439572,0.0007730399,0.000003742208,0.0001559992,0.00001948546],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003576972,"about_ca_system_score_gemma":0.0000901785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007403698,"about_ca_topic_score_gemma":0.000004210435,"domain_scores_codex":[0.9991339,0.00008599509,0.0003366401,0.000108579,0.0001817087,0.0001531358],"domain_scores_gemma":[0.9975738,0.001460675,0.0001613398,0.0004746865,0.00029561,0.00003388247],"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.00001670078,0.00005296105,1.335744e-7,0.0000403562,0.00003579641,0.000001026427,0.005552219,0.0165309,0.0001245484,0.007179935,0.0000643414,0.9704011],"study_design_scores_gemma":[0.0002656356,0.0001329975,0.000004601601,0.00004361555,0.00002140663,0.00003635865,0.0002586702,0.7516728,0.2226818,0.02348711,0.001247336,0.0001476585],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000392742,0.000008173351,0.9975461,0.0001406662,0.001075025,0.0002703639,0.00005664021,0.0002244583,0.0002858281],"genre_scores_gemma":[0.9001238,0.00002067136,0.09880713,0.0005720504,0.00001760918,0.0002069914,0.00000249138,0.000008057864,0.0002411381],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9702534,"threshold_uncertainty_score":0.3538326,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02146117482327438,"score_gpt":0.2500111541727967,"score_spread":0.2285499793495224,"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."}}