{"id":"W2504591244","doi":"10.1109/icc.2016.7511007","title":"An asymptotically capacity-achieving scheme for the Gaussian multiple-access relay channel","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Relay channel; Decoding methods; Computer science; Decodes; User equipment; Telecommunications link; Upper and lower bounds; Computer network; Transmission (telecommunications); Base station; Channel (broadcasting); Topology (electrical circuits); Mathematics; Algorithm; Telecommunications; Power (physics)","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.002019547,0.001281257,0.0009183427,0.0008563151,0.0009201124,0.001450769,0.001575878,0.001041364,0.002039606],"category_scores_gemma":[0.00574996,0.0003704954,0.0006045054,0.001139563,0.002192679,0.001546153,0.00195238,0.001315426,0.0005769974],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002273902,"about_ca_system_score_gemma":0.001893829,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003174952,"about_ca_topic_score_gemma":0.00261936,"domain_scores_codex":[0.9987078,0.0005265708,0.00003405133,0.0001430597,0.0003402278,0.0002482669],"domain_scores_gemma":[0.9969636,0.001916329,0.0002587816,0.0002646517,0.0004993019,0.0000974703],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003093886,0.00009734352,0.0004633537,0.0002471685,0.00007783724,0.0003595089,0.0004835407,0.552536,0.01392891,0.3924578,0.004060127,0.03497901],"study_design_scores_gemma":[0.00002456486,0.00009366033,0.00008634864,0.00002171031,0.00002228395,0.0001613919,0.00004355772,0.9590339,0.002227344,0.03714997,0.001101918,0.00003343348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04773445,0.001093276,0.9368152,0.0004812718,0.00008278891,0.0001086165,0.0001563863,0.0004153079,0.01311261],"genre_scores_gemma":[0.9316221,0.0008078652,0.06471849,0.0001920864,0.00005225896,0.0001537867,0.0001104747,0.00004982591,0.002293057],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003174952,"threshold_uncertainty_score":0.01649839,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08568209216851011,"score_gpt":0.319025493911018,"score_spread":0.2333434017425079,"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."}}