{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001491717,0.00009346657,0.0001148115,0.00005821113,0.00008167597,0.0001323755,0.0006290919,0.00004459811,0.0001067256],"category_scores_gemma":[0.000009098384,0.00007705531,0.00004115279,0.0001371602,0.00001173101,0.0008570251,0.0003084959,0.00005795551,0.0002069283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002765157,"about_ca_system_score_gemma":0.00004820085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004228938,"about_ca_topic_score_gemma":0.000004461226,"domain_scores_codex":[0.9991921,0.00001152537,0.0001160249,0.0002920842,0.000163709,0.0002245239],"domain_scores_gemma":[0.9992429,0.00013612,0.00004851299,0.0004347237,0.00007099297,0.00006675199],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000397641,0.00009245518,0.002518787,0.00005905825,0.00003708153,0.000009070865,0.0004746901,0.000279499,0.007929923,0.8344213,0.06703311,0.08710529],"study_design_scores_gemma":[0.001164149,0.0001809907,0.0009525609,0.00004184377,0.000004667565,0.000007792295,0.00009166522,0.6567854,0.002779177,0.002105372,0.3355881,0.0002983102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01068833,0.00002777498,0.9746276,0.0002274283,0.0005690603,0.0002311647,0.00001505397,0.0001659697,0.0134477],"genre_scores_gemma":[0.6337588,0.0000278324,0.3554315,0.001460993,0.0001622697,0.00001411216,0.00004617427,0.00002025523,0.00907812],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8323159,"threshold_uncertainty_score":0.3142224,"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."}}