{"id":"W4408324641","doi":"10.1109/tcomm.2025.3550371","title":"Optimizing Multi-User Uplink Cooperative Rate-Splitting Multiple Access: Efficient User Pairing and Resource Allocation With Gradient-Based Meta Learning","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Telecommunications link; Computer science; Pairing; Resource allocation; Computer network; Resource management (computing); Resource (disambiguation); Distributed computing","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003700728,0.0002992171,0.0003166416,0.0003669471,0.00105277,0.0001736403,0.0004401735,0.0001077504,0.000008687775],"category_scores_gemma":[0.00004674159,0.0002933675,0.00008199106,0.0008205232,0.0001286483,0.0003404874,0.00001376886,0.0006171344,0.000005234413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002021213,"about_ca_system_score_gemma":0.00004940838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004701973,"about_ca_topic_score_gemma":0.0002984598,"domain_scores_codex":[0.9985641,0.0002658622,0.0004505327,0.0003425683,0.0001048274,0.0002721476],"domain_scores_gemma":[0.9977248,0.0008953122,0.000103358,0.0009970042,0.0002105088,0.00006902339],"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.00002481846,0.0001130673,0.00007741723,0.00006229482,0.0003086576,3.510219e-7,0.0006278197,0.9954298,0.002015691,0.000153633,0.00000872324,0.001177705],"study_design_scores_gemma":[0.0010914,0.00003084889,0.0000668469,0.0002473709,0.0003399492,0.000001404794,0.0005933404,0.9820758,0.01378393,0.000001507685,0.001486116,0.0002815218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005472232,0.0005797824,0.9917836,0.0003397086,0.00008792624,0.0007845459,0.00001200044,0.0006703424,0.0002698927],"genre_scores_gemma":[0.8933859,0.0001549101,0.1052019,0.00006653256,0.000005937846,0.0006068937,0.00003596433,0.00006487256,0.0004771159],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8879136,"threshold_uncertainty_score":0.9999518,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03390401326356322,"score_gpt":0.2748008926803368,"score_spread":0.2408968794167735,"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."}}