{"id":"W2082831697","doi":"10.1109/tit.2011.2145930","title":"Rate-Constrained Simulation and Source Coding i.i.d. Sources","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"Tsinghua University; University of Kansas; John Simon Guggenheim Memorial Foundation; Simons Foundation","keywords":"Source code; Variable-length code; Computer science; Coding (social sciences); Asymptotically optimal algorithm; Algorithm; Shannon–Fano coding; Alphabet; Block code; Theoretical computer science; Code rate; Decoding methods; Mathematics; Statistics","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.0004095203,0.0001142487,0.00008953911,0.0001980052,0.0003287434,0.0001404255,0.0002028062,0.00006293406,0.00009725944],"category_scores_gemma":[0.000009219249,0.000100702,0.00003696643,0.0001638633,0.00006380727,0.003000275,0.000004729043,0.0001279334,0.00009126603],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001644785,"about_ca_system_score_gemma":0.00002192279,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001100036,"about_ca_topic_score_gemma":5.544475e-7,"domain_scores_codex":[0.9992712,0.00008132665,0.0002489688,0.000124203,0.0001338682,0.0001404316],"domain_scores_gemma":[0.9993045,0.0001946154,0.0001066791,0.0002600852,0.00006031536,0.00007379747],"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.0001038037,0.00006080661,0.000009848339,0.000025556,0.00003000537,8.164807e-7,0.01324272,0.06344897,0.0001186033,0.04326682,0.00003974343,0.8796523],"study_design_scores_gemma":[0.0006465371,0.0001286011,0.0002858336,0.00004065208,0.00001397957,0.00001332383,0.0006711918,0.9785454,0.009491703,0.007348174,0.002563876,0.0002507184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007070872,0.000007311035,0.9904364,0.00002970688,0.0002743675,0.0001309517,0.00001030878,0.0002297751,0.001810307],"genre_scores_gemma":[0.9892278,0.000006135189,0.0102931,0.0003159615,0.00001267259,0.00001315231,0.000003505927,0.000004405319,0.0001232948],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9821569,"threshold_uncertainty_score":0.410651,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01999778273778776,"score_gpt":0.2306318751298479,"score_spread":0.2106340923920601,"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."}}