{"id":"W2974997458","doi":"10.1109/isit.2019.8849410","title":"Universal D-Semifaithfull Coding for Countably Infinite Alphabets","year":2019,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Variable-length code; Universality (dynamical systems); Shannon–Fano coding; Coding (social sciences); Impossibility; Mathematics; Minimax; Converse; Discrete mathematics; Source code; Theoretical computer science; Computer science; Physics; Mathematical optimization; Quantum mechanics","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.001552212,0.0004293773,0.0006615991,0.0009766439,0.0004325909,0.001052549,0.00096572,0.0006588707,0.001163021],"category_scores_gemma":[0.009660499,0.0003219807,0.0005335782,0.0006754394,0.001808307,0.002803487,0.002457403,0.001186206,0.0001573348],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009091703,"about_ca_system_score_gemma":0.0005859394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005115543,"about_ca_topic_score_gemma":0.0003362457,"domain_scores_codex":[0.9992238,0.0002100116,0.00008673286,0.0001517069,0.0002191361,0.0001085127],"domain_scores_gemma":[0.9937173,0.004528051,0.0004789506,0.0007305591,0.0003536852,0.0001913574],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000189612,0.00003468704,0.0009231039,0.0001680693,0.000033566,0.0003117276,0.0002707393,0.1062843,0.01339572,0.8459719,0.0006790148,0.03173772],"study_design_scores_gemma":[0.00002390226,0.00006764743,0.000444516,0.00005505259,0.0000120974,0.0002934077,0.00007862476,0.495076,0.01116957,0.4915143,0.001231274,0.0000336207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1997212,0.0007589168,0.7925053,0.0004995075,0.00003198537,0.00002697083,0.0002176879,0.0002243234,0.006014199],"genre_scores_gemma":[0.9573845,0.000498563,0.0400311,0.0001268101,0.00004132884,0.00005419539,0.0001819786,0.00004073729,0.001640828],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001552212,"threshold_uncertainty_score":0.00820899,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01168022105320477,"score_gpt":0.2344119380088826,"score_spread":0.2227317169556779,"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."}}