{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002502147,0.0001532484,0.000227646,0.00005139431,0.00007614813,0.0001271108,0.00163239,0.00008316858,0.00001033587],"category_scores_gemma":[0.00003149046,0.0001052346,0.0001765883,0.0001038233,0.00005862703,0.00004542759,0.000982941,0.0001642711,0.00003684392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001516499,"about_ca_system_score_gemma":0.0001174577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008821614,"about_ca_topic_score_gemma":0.00000534932,"domain_scores_codex":[0.9989796,0.00002169278,0.0002672293,0.0003927298,0.0001578839,0.0001808475],"domain_scores_gemma":[0.9975564,0.0007247608,0.0002000311,0.001366539,0.0001147333,0.00003746732],"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.000003665157,0.000276047,0.00001067137,0.0006252264,0.0002348075,0.000004981739,0.003066554,0.03286991,0.0004754085,0.05686253,0.002920572,0.9026496],"study_design_scores_gemma":[0.00009484495,0.00002117416,0.00003384953,0.00002096375,0.00001734355,0.000003101787,0.000005951085,0.9748762,0.002222463,0.01755686,0.005014711,0.000132553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005708833,0.00005678536,0.9967086,0.0004130755,0.0006379444,0.0009678758,0.0001468475,0.00009158385,0.0004064048],"genre_scores_gemma":[0.626264,0.00005174276,0.3685144,0.0002813301,0.000130521,0.0007796566,0.00004380878,0.00002401578,0.003910495],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9420063,"threshold_uncertainty_score":0.4291343,"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."}}