{"id":"W1978359440","doi":"10.1109/lcomm.2012.100812.121258","title":"Optimal User Pairing for Asymmetric Multi-Way Relay Channels with Pairwise Relaying","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Pairing; Pairwise comparison; Computer science; Pairwise error probability; Relay channel; Computer network; Channel (broadcasting); Transmission (telecommunications); Upper and lower bounds; Topology (electrical circuits); Telecommunications; Mathematics; Power (physics); MIMO; Physics; Combinatorics","routes":{"ca_aff":true,"ca_fund":true,"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.003391743,0.001856616,0.001662318,0.0007832436,0.000853983,0.001892843,0.001087913,0.001391153,0.001934355],"category_scores_gemma":[0.008567564,0.0008391317,0.000856233,0.00102916,0.002358354,0.002423886,0.002481449,0.001316652,0.0005547429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001170064,"about_ca_system_score_gemma":0.001011075,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005925713,"about_ca_topic_score_gemma":0.0004985345,"domain_scores_codex":[0.9967837,0.001920892,0.00009558824,0.0002458865,0.000462919,0.0004910202],"domain_scores_gemma":[0.9933503,0.004820372,0.0007103356,0.0003993177,0.0003974556,0.0003222094],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000317558,0.0001112909,0.0005416484,0.0001536688,0.0000647855,0.0005659143,0.0002294868,0.8029753,0.004738532,0.1803432,0.0009065576,0.009052115],"study_design_scores_gemma":[0.00003356114,0.000104606,0.0001059875,0.00001897767,0.0000219571,0.0001630824,0.00008294058,0.9303011,0.001527533,0.06718586,0.0004277707,0.00002664025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1519241,0.0007594504,0.8314006,0.0004961738,0.00006889009,0.0001083072,0.0001400365,0.0001175393,0.01498492],"genre_scores_gemma":[0.9618809,0.0006550627,0.03523256,0.00007641258,0.00005848362,0.0001425608,0.00006833008,0.00003847766,0.001847242],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003391743,"threshold_uncertainty_score":0.01793748,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08821356770550323,"score_gpt":0.3049077257556221,"score_spread":0.2166941580501189,"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."}}