{"id":"W4360605356","doi":"10.1109/icnc57223.2023.10074174","title":"A Novel Information-Directed Tree-Search Algorithm for RIS Phase Optimization in Massive MIMO","year":2023,"lang":"en","type":"article","venue":"","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Cramér–Rao bound; Algorithm; Computer science; MIMO; Mean squared error; Tree traversal; Metric (unit); Upper and lower bounds; Tree (set theory); Pruning; Mathematics; Telecommunications; Estimation theory; Channel (broadcasting); 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.00008637169,0.00009274371,0.00011135,0.0004691149,0.00004436947,0.00002586937,0.0002188969,0.00008691014,0.00002143409],"category_scores_gemma":[0.0001189113,0.00009771979,0.00002476003,0.001008345,0.00002537798,0.0004919628,0.00006063632,0.0001162972,0.00003713161],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006878565,"about_ca_system_score_gemma":0.00001359196,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000121208,"about_ca_topic_score_gemma":0.00001925566,"domain_scores_codex":[0.999395,0.000005821724,0.0002398971,0.00007299503,0.0000901234,0.0001962142],"domain_scores_gemma":[0.9994485,0.0001459859,0.00002516465,0.0002680555,0.00008997945,0.00002226557],"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.000002669376,0.00001601197,0.000007733715,0.00001408974,0.000007681357,1.786175e-7,0.0001443522,0.7652165,0.0003956129,0.000281353,0.0004669167,0.2334469],"study_design_scores_gemma":[0.001219775,0.00001901904,0.00005606472,0.00001172607,0.000001356943,4.044427e-7,0.0006492181,0.9880932,0.008646551,0.00010006,0.001088837,0.0001137971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001166137,0.000024965,0.9938625,0.0002225096,0.00004840748,0.0004108925,0.00005233455,0.003349351,0.000862906],"genre_scores_gemma":[0.0981403,0.000399082,0.9001997,0.00002263288,0.00001025015,0.0005333814,0.0005178868,0.00002941064,0.0001473155],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2333331,"threshold_uncertainty_score":0.3984897,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0238008329703551,"score_gpt":0.2889599975713451,"score_spread":0.26515916460099,"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."}}