{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002104593,0.001306222,0.00126249,0.0007722313,0.0004120297,0.0014058,0.001153132,0.001690899,0.003050798],"category_scores_gemma":[0.01546303,0.0007517784,0.0007532825,0.0009516979,0.002018488,0.001925182,0.001665761,0.001760459,0.0007655844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001531489,"about_ca_system_score_gemma":0.001344459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001466446,"about_ca_topic_score_gemma":0.0009172392,"domain_scores_codex":[0.9982564,0.0007844843,0.00008705866,0.0002374686,0.0004959349,0.0001387047],"domain_scores_gemma":[0.9893352,0.008244451,0.0008283608,0.0007255636,0.0007397833,0.0001265372],"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.0001389393,0.00001872871,0.0002351242,0.00007871979,0.00002915417,0.00009926612,0.00005668281,0.7018458,0.003889462,0.2825713,0.000502529,0.01053431],"study_design_scores_gemma":[0.00001427188,0.00002332504,0.00004062974,0.0000148502,0.000005763523,0.0000449317,0.000005042284,0.9580213,0.002236972,0.03916655,0.0004110289,0.00001527299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006355675,0.000148827,0.9904361,0.0001576524,0.00002301725,0.00003529703,0.00007549801,0.0001305888,0.002637296],"genre_scores_gemma":[0.7651293,0.001002574,0.2242288,0.0002827111,0.00008729353,0.0004532309,0.0004532975,0.0001701796,0.008192617],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003050798,"threshold_uncertainty_score":0.01113027,"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."}}