{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003078586,0.002491602,0.001680055,0.001578133,0.0009135193,0.001694012,0.001370842,0.001461561,0.00261596],"category_scores_gemma":[0.01428058,0.0007962082,0.0006220997,0.001702823,0.003801019,0.003577809,0.002628498,0.002849821,0.0006696491],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002474103,"about_ca_system_score_gemma":0.002051746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001746376,"about_ca_topic_score_gemma":0.001574899,"domain_scores_codex":[0.9971759,0.001241278,0.0001226414,0.0003900628,0.0007508554,0.0003192232],"domain_scores_gemma":[0.9947894,0.00360762,0.000427434,0.000576528,0.0004660249,0.0001330482],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006584324,0.00007742533,0.00038281,0.0003074061,0.00007495294,0.000277302,0.0003565157,0.274538,0.00681186,0.6617453,0.003637133,0.0511331],"study_design_scores_gemma":[0.0001211527,0.0002567294,0.000359276,0.0002185917,0.00006958781,0.0004006137,0.0001283689,0.6980817,0.008422479,0.2863822,0.005433863,0.0001254064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07092773,0.008340939,0.874218,0.002359403,0.0002340711,0.0002832185,0.0004961624,0.0003284994,0.04281196],"genre_scores_gemma":[0.8568704,0.008240173,0.1262243,0.0005859863,0.000339293,0.0004018343,0.0002980031,0.0001168885,0.006923094],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003078586,"threshold_uncertainty_score":0.01795095,"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."}}