{"id":"W3010268208","doi":"10.1109/tcomm.2020.2979113","title":"Design of General Entropy-Constrained Successively Refinable Unrestricted Polar Quantizer","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Entropy (arrow of time); Combinatorics; Algorithm; Mathematics; Minification; Discrete mathematics; Computer science; Mathematical optimization; Physics","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.0001384865,0.000189749,0.0002591024,0.0001928573,0.0003850239,0.00006351862,0.003259404,0.00009032678,0.00004159831],"category_scores_gemma":[0.00003372698,0.0001912156,0.00009556574,0.001079674,0.0002006095,0.0007038853,0.00004513126,0.0004204863,0.00003248245],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004593086,"about_ca_system_score_gemma":0.0001716654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009968862,"about_ca_topic_score_gemma":0.000003604861,"domain_scores_codex":[0.998285,0.0003828877,0.0004768883,0.0003493644,0.0002647954,0.000241049],"domain_scores_gemma":[0.9965013,0.000457521,0.0002347059,0.002441087,0.0002112608,0.0001540694],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001724494,0.002028133,0.00004223683,0.00007031216,0.0002571004,0.00001726091,0.0018686,0.07807079,0.6999377,0.1423357,0.006485785,0.06871388],"study_design_scores_gemma":[0.0009548779,0.0004083972,0.00009594383,0.0000824519,0.00004965799,0.00001480465,0.00005783486,0.5670186,0.4198743,0.003473745,0.007480225,0.0004891786],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001836322,0.0001375315,0.9933797,0.004835171,0.00007376374,0.000365072,0.00009854306,0.0005791215,0.0003474936],"genre_scores_gemma":[0.4942214,0.0003347488,0.5049701,0.000308937,0.000006882366,0.00007039993,0.00001008144,0.00001333261,0.00006410659],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4940377,"threshold_uncertainty_score":0.7797546,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06519810886652606,"score_gpt":0.3038234316019515,"score_spread":0.2386253227354254,"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."}}