{"id":"W2974956530","doi":"10.1109/isit.2019.8849433","title":"A Deterministic Algorithm for the Capacity of Finite-State Channels","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Finite state; Polynomial; Gradient descent; Algorithm; State (computer science); Finite-state machine; Exponential function; Computer science; Time complexity; Mathematical optimization; Mathematics; Applied mathematics; Markov chain; Artificial intelligence; Artificial neural network; Mathematical analysis","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.001240743,0.001123385,0.0009227651,0.0009899739,0.0008270946,0.00136853,0.002655531,0.001739286,0.006482711],"category_scores_gemma":[0.009032644,0.0006263987,0.0007947229,0.0009259008,0.001233434,0.002213069,0.001830383,0.002805663,0.00153559],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002052905,"about_ca_system_score_gemma":0.003352703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005650845,"about_ca_topic_score_gemma":0.006183878,"domain_scores_codex":[0.9987578,0.0002490059,0.00006393816,0.0004103794,0.0003579273,0.0001609841],"domain_scores_gemma":[0.9967883,0.001907579,0.0001551433,0.0004672259,0.0005639778,0.000117848],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002075761,0.0001903405,0.0008561702,0.0002173929,0.00009558498,0.0001116703,0.0001435445,0.593348,0.008213576,0.1654177,0.009118553,0.2220799],"study_design_scores_gemma":[0.0000199673,0.000009519968,0.00004621157,0.000006864127,0.000003780608,0.00001646845,0.000004817032,0.9735878,0.00130598,0.0243011,0.0006881759,0.000009296947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003319832,0.00007204551,0.9940909,0.0001513183,0.00004761428,0.00005876338,0.00007381778,0.0009920166,0.001193691],"genre_scores_gemma":[0.2066215,0.0001353044,0.7877058,0.0001788785,0.0001167822,0.0004709218,0.0004756792,0.000460827,0.003834357],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006482711,"threshold_uncertainty_score":0.02168685,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04317571500624921,"score_gpt":0.2687141391959147,"score_spread":0.2255384241896655,"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."}}