{"id":"W2146033716","doi":"10.1109/isit.2008.4595034","title":"An achievable rate region for the two-way two-relay channel","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Relay channel; Computer science; Channel (broadcasting); Deadlock; Computer network; Decoding methods; Constraint (computer-aided design); Coding (social sciences); Block (permutation group theory); Topology (electrical circuits); Algorithm; Distributed computing; Mathematics; Engineering; Electrical 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.0004712551,0.000104771,0.00009891638,0.00003945657,0.0009548197,0.0001119725,0.001326536,0.00002203504,0.00001646282],"category_scores_gemma":[0.00002817845,0.0000678186,0.00005534401,0.0003082347,0.00006012561,0.0004535762,0.0002125735,0.0001136015,0.00003468144],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002106498,"about_ca_system_score_gemma":0.00003948918,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000187988,"about_ca_topic_score_gemma":0.0001017588,"domain_scores_codex":[0.9991292,0.0001615329,0.0001513043,0.0002456709,0.0000916036,0.0002206483],"domain_scores_gemma":[0.9983338,0.0003147278,0.00005436649,0.001093616,0.0001365016,0.00006699568],"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.00005876956,0.000293132,0.0003070365,0.000006642487,0.00006435873,0.00001088498,0.007125013,0.03173453,0.003741488,0.7678427,0.05558598,0.1332294],"study_design_scores_gemma":[0.0006319627,0.00008912454,0.0005437687,0.00000736316,0.000003366307,0.00002558786,0.00003723752,0.96168,0.001451913,0.0006463113,0.03473149,0.0001518943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00466666,0.0004113517,0.9828573,0.006506066,0.0002488597,0.0003059501,2.550328e-7,0.0001853219,0.004818174],"genre_scores_gemma":[0.9811437,0.0007665282,0.01102195,0.002533393,0.0001392496,0.00006994234,0.000002818429,0.000009045362,0.004313401],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.976477,"threshold_uncertainty_score":0.7343798,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08881703475877845,"score_gpt":0.3099541103962624,"score_spread":0.221137075637484,"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."}}