{"id":"W2075517750","doi":"10.1109/ita.2010.5454073","title":"Universal relaying for the interference channel","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; Relay channel; Computer science; Interference (communication); Channel (broadcasting); Quantization (signal processing); Decoding methods; Code word; Gaussian; Computer network; Algorithm","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.0002062051,0.00004219301,0.00003545623,0.00001955767,0.0002692198,0.00009551566,0.001086335,0.0000176933,0.00003176684],"category_scores_gemma":[0.0000478876,0.00002661715,0.00002510011,0.0001258037,0.00003036789,0.0001763967,0.0003191161,0.0001396417,0.00001498354],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000552867,"about_ca_system_score_gemma":0.00002129056,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002868621,"about_ca_topic_score_gemma":0.0001026319,"domain_scores_codex":[0.9996907,0.00001563058,0.00005882052,0.0001037668,0.00003860015,0.00009250263],"domain_scores_gemma":[0.9990985,0.0003082431,0.00002007616,0.0004748353,0.00007442616,0.00002394465],"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.000001572407,0.000006979551,0.00001873092,6.019255e-7,0.000004424431,1.140459e-7,0.0005837194,0.00001942931,0.001974122,0.9051536,0.002198717,0.09003799],"study_design_scores_gemma":[0.0001962458,0.00003112938,0.0004313783,0.000006368273,0.000002318463,0.000003996328,0.0001124797,0.907326,0.001623694,0.002146015,0.08801433,0.0001060654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008954947,0.00004843414,0.9817869,0.006969493,0.0004284209,0.0001043903,1.590025e-7,0.00008011061,0.009686602],"genre_scores_gemma":[0.9826607,0.00006897929,0.01529367,0.0005723429,0.00004203763,0.00001269625,2.90501e-7,0.000002226777,0.001347074],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9817652,"threshold_uncertainty_score":0.2070648,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05235168561177095,"score_gpt":0.2828954404960186,"score_spread":0.2305437548842476,"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."}}