{"id":"W1967913462","doi":"10.1109/allerton.2010.5706953","title":"On the optimality of successive decoding in compress-and-forward relay schemes","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decodes; Decoding methods; Relay; Computer science; Relay channel; Joint (building); Cover (algebra); Sequential decoding; Process (computing); Algorithm; 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.0004890542,0.00006158043,0.00009564564,0.00004492346,0.0001040816,0.00005802497,0.0007341921,0.00002819382,0.00007052384],"category_scores_gemma":[0.0001967839,0.00003900806,0.00002147275,0.000212081,0.0000803133,0.0001600595,0.0004319616,0.0002545173,0.000004435651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006068112,"about_ca_system_score_gemma":0.00001812601,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000107218,"about_ca_topic_score_gemma":0.000133074,"domain_scores_codex":[0.9994174,0.00009312078,0.0001575658,0.0001403271,0.00009578469,0.00009578277],"domain_scores_gemma":[0.9985419,0.0007866118,0.00005880739,0.0005232647,0.00006147786,0.00002794195],"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.00000240034,0.00002075421,0.002902184,0.000001678347,0.000003163992,3.24782e-7,0.0003077226,0.00004747265,0.002463712,0.9825965,0.000143419,0.01151064],"study_design_scores_gemma":[0.0004789953,0.00005264302,0.03562773,0.00007335428,0.000002596579,0.000002957614,0.0001032517,0.9368535,0.01803093,0.00515463,0.003399645,0.0002197577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8750377,0.0001095576,0.09288416,0.005470559,0.0001145422,0.0001505167,4.289792e-7,0.00004353235,0.02618904],"genre_scores_gemma":[0.9862354,0.00007551206,0.01322008,0.0003625482,0.000006704476,0.000007182823,2.526671e-7,0.000002034214,0.00009032423],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9774419,"threshold_uncertainty_score":0.1590703,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02820962458557981,"score_gpt":0.2918548188501362,"score_spread":0.2636451942645564,"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."}}