{"id":"W2963652650","doi":"","title":"On the Optimality of Successive Decoding in Compress-and-Forward Relay Schemes","year":2010,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decoding methods; Relay; Encoding (memory); Computer science; Joint (building); Sequential decoding; Algorithm; List decoding; Process (computing); Block (permutation group theory); Theoretical computer science; Mathematics; Block code; Artificial intelligence; Combinatorics; Power (physics); Concatenated error correction 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.0003306579,0.00007920233,0.0001093747,0.00008149471,0.0001503558,0.00003453554,0.0008996021,0.0000411769,0.00003148278],"category_scores_gemma":[0.0001174642,0.00006574814,0.00003509222,0.000465711,0.0001363448,0.0002562119,0.0004689296,0.0002942507,0.000006386885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001741218,"about_ca_system_score_gemma":0.00002571809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000150425,"about_ca_topic_score_gemma":0.0001207555,"domain_scores_codex":[0.9993721,0.0001247524,0.0001067362,0.0002331719,0.00004189538,0.0001213029],"domain_scores_gemma":[0.9986206,0.0005877964,0.00008477604,0.0005898473,0.00007309292,0.00004384686],"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.000008789478,0.0000296977,0.007491012,0.000002521083,0.000006910532,0.000005423538,0.000214022,0.002961806,0.0006736493,0.987504,0.00003618071,0.001065986],"study_design_scores_gemma":[0.0005011874,0.00004117357,0.01318654,0.00005072492,0.000006287171,0.000001570183,0.0000910431,0.9743271,0.00258256,0.008228783,0.0008053062,0.0001777017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9105802,0.0000287899,0.08521403,0.0004342126,0.000063582,0.00008616307,6.47091e-7,0.00002687243,0.003565514],"genre_scores_gemma":[0.9986293,0.0001244769,0.000996487,0.0001142474,0.000006035649,4.006716e-7,3.956004e-7,0.000002720177,0.000125942],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9792752,"threshold_uncertainty_score":0.2681131,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07162757057344256,"score_gpt":0.2139959597698551,"score_spread":0.1423683891964125,"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."}}