{"id":"W3104359459","doi":"","title":"1Asymptotic Capacity and Optimal Precoding in MIMO Multi-Hop Relay Networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Precoding; Relay; MIMO; Zero-forcing precoding; Fading; Topology (electrical circuits); Mathematics; Mutual information; Relay channel; Singular value; Channel capacity; Channel state information; Computer science; Eigenvalues and eigenvectors; Channel (broadcasting); Mathematical optimization; Telecommunications; Statistics; Wireless; Power (physics); Combinatorics; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000599334,0.0001107183,0.0001284152,0.0000757153,0.0001420093,0.0001004127,0.0004185294,0.00005700336,0.00002555455],"category_scores_gemma":[0.00005086408,0.00009992175,0.0000237179,0.0003181338,0.00004193169,0.000715206,0.0004715336,0.0002287603,0.00001454753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004331562,"about_ca_system_score_gemma":0.00001065862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001143246,"about_ca_topic_score_gemma":0.00009122976,"domain_scores_codex":[0.9990386,0.0001622777,0.0001921252,0.0001974513,0.00007673322,0.0003328308],"domain_scores_gemma":[0.9992269,0.0001689605,0.00004133954,0.0004036242,0.00003566262,0.0001235715],"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.00001721633,0.0007200278,0.2604941,0.00003054059,0.00005536869,0.000005274665,0.01752977,0.02147773,0.001051556,0.3967101,0.002013011,0.2998953],"study_design_scores_gemma":[0.0003220474,0.00001430886,0.05175765,0.00002842055,0.000001748474,0.000009659074,0.00003233077,0.9463884,0.0001134053,0.00001179585,0.001157669,0.000162598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1493725,0.001185763,0.8462374,0.0003915763,0.0002236937,0.0001362468,1.157242e-7,0.0001028952,0.002349821],"genre_scores_gemma":[0.8758135,0.0004837041,0.1231244,0.000257202,0.00004398296,0.00001050137,5.587977e-7,0.000005171364,0.0002609644],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9249107,"threshold_uncertainty_score":0.4074691,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06467812725319336,"score_gpt":0.2797865075468076,"score_spread":0.2151083802936143,"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."}}