{"id":"W1982067419","doi":"10.1109/tit.2013.2241818","title":"On the Optimal Compressions in the Compress-and-Forward Relay Schemes","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decodes; Decoding methods; Relay; Computer science; Joint (building); Relay channel; Data compression; Compression (physics); Sequential decoding; Process (computing); Algorithm; List decoding; Theoretical computer science; Block code; Engineering","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.0006520568,0.0001152905,0.00008691514,0.0001350737,0.0006427827,0.0003105334,0.0008532505,0.00004473012,0.0002006461],"category_scores_gemma":[0.00002156837,0.0000646628,0.00004838668,0.0003357227,0.0001060614,0.001229047,0.00001124655,0.0004394601,0.0003026656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002353806,"about_ca_system_score_gemma":0.00002080206,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004525666,"about_ca_topic_score_gemma":0.00000316594,"domain_scores_codex":[0.9988707,0.0004127538,0.0002667709,0.00009419117,0.0002081588,0.000147424],"domain_scores_gemma":[0.9978942,0.001274267,0.00007559741,0.0006430409,0.0000752135,0.00003771315],"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.00001904689,0.00008437553,0.000002412637,0.000004839037,0.00001824389,1.727431e-7,0.009516767,0.0312597,0.0000519676,0.7979029,0.002646396,0.1584932],"study_design_scores_gemma":[0.001234822,0.0002251512,0.001402768,0.0002119533,0.00001591773,0.00002436984,0.00364857,0.9347857,0.004429307,0.01829767,0.03522273,0.0005010325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0168377,0.00003920431,0.9699339,0.005924365,0.0001575325,0.0004306882,0.000002961898,0.00008118436,0.006592457],"genre_scores_gemma":[0.9938194,0.0001266268,0.001240073,0.004464582,0.000007190411,0.0002207576,0.000001657041,0.000003345574,0.000116337],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9769818,"threshold_uncertainty_score":0.494383,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01978531512295761,"score_gpt":0.247033011842768,"score_spread":0.2272476967198103,"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."}}