{"id":"W2467251259","doi":"10.1109/tit.2017.2692215","title":"Optimal Zero Delay Coding of Markov Sources: Stationary and Finite Memory Codes","year":2017,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain; Mathematics; Markov process; Aperiodic graph; Markov model; Mathematical optimization; Applied mathematics; Combinatorics; Statistics","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006531393,0.0002859157,0.0003430403,0.000516536,0.0002597565,0.0001407917,0.0005059621,0.0003365915,0.00008476138],"category_scores_gemma":[0.00002669197,0.0003259007,0.0001209196,0.00006558629,0.0002228359,0.0009315909,0.00001842731,0.0007880813,0.00001779537],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009265559,"about_ca_system_score_gemma":0.00006329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001920692,"about_ca_topic_score_gemma":0.000004207893,"domain_scores_codex":[0.9986529,0.0001163692,0.0006746575,0.000129071,0.000262566,0.0001643798],"domain_scores_gemma":[0.997972,0.0005213204,0.0003530234,0.0009022909,0.0001814752,0.00006985792],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001009375,0.00003970111,0.00000252721,0.001106849,0.0002180904,5.275785e-7,0.009704026,0.9299611,0.0001158146,0.002893518,0.0003187902,0.05553808],"study_design_scores_gemma":[0.001821428,0.000201703,0.0002974176,0.003156422,0.0004064349,0.00004811114,0.003799834,0.8101599,0.137702,0.03520926,0.004970707,0.002226725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02532068,0.0002144655,0.9661028,0.0000324042,0.0003303956,0.0004311798,0.0006441052,0.0005616715,0.006362282],"genre_scores_gemma":[0.9849464,0.00187191,0.01267335,0.00006728186,0.00001324696,0.0001855632,0.0001303944,0.00003484674,0.00007698886],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9596257,"threshold_uncertainty_score":0.9999193,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01424160728089567,"score_gpt":0.2452975965840599,"score_spread":0.2310559893031642,"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."}}