{"id":"W3136561982","doi":"10.1109/tit.2021.3138769","title":"Zero-Delay Lossy Coding of Linear Vector Markov Sources: Optimality of Stationary Codes and Near Optimality of Finite Memory Codes","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Markov chain; Discrete mathematics; Markov process; Zero (linguistics); Coding (social sciences); Combinatorics; Algorithm; 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":[],"consensus_categories":[],"category_scores_codex":[0.0007475026,0.0001586708,0.0003366185,0.00018872,0.0001123495,0.00002263967,0.0001845836,0.0001300339,0.0001328583],"category_scores_gemma":[0.00005143861,0.0001784936,0.0001047292,0.0002928187,0.0003000369,0.0007454078,0.000007156283,0.0002468947,0.000003364931],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004528163,"about_ca_system_score_gemma":0.00007387232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002906104,"about_ca_topic_score_gemma":0.000005383637,"domain_scores_codex":[0.9984814,0.0002038857,0.0008397251,0.00009250452,0.0002587746,0.0001237185],"domain_scores_gemma":[0.9980225,0.0007941197,0.0002603448,0.0004745204,0.0003965617,0.00005196495],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0004093186,0.000308903,0.00008961327,0.002925341,0.0004202396,0.000001142014,0.02012737,0.9291094,0.01258472,0.01492194,0.000104165,0.01899784],"study_design_scores_gemma":[0.0006600423,0.0001011631,0.0005431216,0.0003487052,0.00008004683,0.00001092285,0.002313539,0.2484318,0.7453045,0.001636187,0.0002829286,0.000286992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1999319,0.000152151,0.7973347,0.0000215863,0.00005557647,0.0001865934,0.0005550808,0.0001554178,0.001607],"genre_scores_gemma":[0.9692634,0.0004922409,0.03007425,0.00003694689,0.000004198096,0.000027551,0.00006527532,0.00001581124,0.00002026071],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7693316,"threshold_uncertainty_score":0.7278757,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01219420957808383,"score_gpt":0.2409598753792961,"score_spread":0.2287656658012122,"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."}}