{"id":"W2118426586","doi":"10.1109/glocom.2009.5426297","title":"A Graph-Based Resource Allocation Algorithm for Downlink MIMO-OFDMA Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Orthogonal frequency-division multiplexing; Telecommunications link; Orthogonal frequency-division multiple access; MIMO; Resource allocation; Graph coloring; Algorithm; MIMO-OFDM; Frequency-division multiple access; Throughput; Frame (networking); Graph; Mathematical optimization; Computer network; Theoretical computer science; Mathematics; Wireless; Telecommunications","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.00009091481,0.0001706955,0.0001489221,0.00009150595,0.00007415763,0.00002953409,0.000112627,0.0001287712,0.00002194956],"category_scores_gemma":[0.000007493463,0.0001770367,0.00007031349,0.0003445315,0.00001472162,0.0001245832,0.000004426323,0.0001057841,0.000003344936],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005057248,"about_ca_system_score_gemma":0.000007356018,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001255036,"about_ca_topic_score_gemma":0.00000365595,"domain_scores_codex":[0.9991668,0.0000132486,0.0002236789,0.0001953777,0.00009877564,0.0003021368],"domain_scores_gemma":[0.9995462,0.00007318606,0.00003607761,0.00020994,0.00006246819,0.00007210598],"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.000005419599,0.00001258666,0.000004494272,0.000004666826,0.000007244827,2.947772e-7,0.000007787703,0.7093118,0.00006474993,0.0002551751,0.002880264,0.2874455],"study_design_scores_gemma":[0.0005205038,0.0000481184,0.00008606019,0.00002681968,0.00001530714,5.852825e-7,0.000007508303,0.9909901,0.0007616535,0.000364082,0.006961099,0.0002181855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001826752,0.0004755847,0.9967384,0.0003131238,0.0001468771,0.0004176941,0.000005226491,0.0008710108,0.0008494141],"genre_scores_gemma":[0.2312633,0.0002215007,0.7657385,0.001059331,0.000677698,0.0001902038,0.0004557036,0.00008880314,0.0003049446],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2872274,"threshold_uncertainty_score":0.7219346,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005627964591812275,"score_gpt":0.2080356104877419,"score_spread":0.2024076458959297,"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."}}