{"id":"W2131951334","doi":"10.1109/glocom.2008.ecp.788","title":"A Fair Subcarrier Allocation Algorithm for Cooperative Multiuser OFDM Systems with Grouped Users","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Subcarrier; Computer science; Telecommunications link; Orthogonal frequency-division multiplexing; Base station; Resource allocation; Relay; Computer network; Diversity gain; Algorithm; Resource management (computing); MIMO; Channel (broadcasting)","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.0002423428,0.0001742165,0.0001995148,0.00008085035,0.0005042098,0.0001393335,0.0006548261,0.00005273551,0.00001142322],"category_scores_gemma":[0.00002547305,0.0001312517,0.00004322177,0.0004897175,0.00008265127,0.0006653329,0.0001314696,0.0001061154,0.0000198073],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007010167,"about_ca_system_score_gemma":0.0001242304,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000322437,"about_ca_topic_score_gemma":0.00008138677,"domain_scores_codex":[0.9988061,0.0001398414,0.0002376306,0.0003666603,0.0002054485,0.0002443274],"domain_scores_gemma":[0.9983608,0.0001665908,0.0000797899,0.0006539412,0.0006352979,0.0001035613],"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.0001757422,0.0009711976,0.004032324,0.0000827252,0.00070344,0.00005204042,0.03149167,0.016982,0.005133948,0.6047814,0.03944041,0.2961531],"study_design_scores_gemma":[0.001107749,0.000202886,0.0007390026,0.00002664851,0.000005858286,0.00003458033,0.0002251898,0.9819456,0.0009361801,0.0000116158,0.01448802,0.0002766251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005550162,0.0002207581,0.99142,0.0005311938,0.0001643843,0.0007708353,0.000002987519,0.0002386892,0.001100991],"genre_scores_gemma":[0.8246994,0.000217724,0.1699067,0.0005195639,0.00006956123,0.0003392002,0.00002185242,0.00001847947,0.004207538],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9649636,"threshold_uncertainty_score":0.535229,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04306042163336094,"score_gpt":0.2630898722826127,"score_spread":0.2200294506492517,"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."}}