{"id":"W2147730843","doi":"10.1109/jsac.2007.070209","title":"Joint optimization of relay strategies and resource allocations in cooperative cellular networks","year":2007,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":503,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Relay; Computer network; Wireless network; Relay channel; Orthogonal frequency-division multiple access; Node (physics); Resource allocation; Bandwidth (computing); Link Access Procedure for Frame Relay; Physical layer; Wireless; Channel (broadcasting); Telecommunications; Orthogonal frequency-division multiplexing; Power (physics); 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001585634,0.001172397,0.0009872937,0.0005533179,0.0003629868,0.001205053,0.001056375,0.001200294,0.0007482411],"category_scores_gemma":[0.003630189,0.0005159634,0.0003202558,0.001060139,0.001056801,0.001103379,0.0009722568,0.0004345883,0.0002366224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001058544,"about_ca_system_score_gemma":0.0006762909,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002227718,"about_ca_topic_score_gemma":0.001901104,"domain_scores_codex":[0.9989713,0.0005527483,0.0000276386,0.0001388175,0.0001535627,0.0001558034],"domain_scores_gemma":[0.9988403,0.0007459843,0.0001384614,0.00006718307,0.000153544,0.00005446668],"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.00004397777,0.0000215303,0.0001921816,0.00002254532,0.00002443198,0.00006781388,0.00004075238,0.9799009,0.00113532,0.009286179,0.0002192554,0.009045059],"study_design_scores_gemma":[0.00001624952,0.0000434082,0.0000710186,0.000003703492,0.00001165689,0.00001946637,0.00002008244,0.9907739,0.0005171635,0.008229719,0.0002878715,0.000005774148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07674948,0.0007258967,0.9172683,0.0002474042,0.00002270757,0.00004928599,0.00005341817,0.0001283751,0.004754975],"genre_scores_gemma":[0.9685807,0.0003627595,0.02864876,0.00004466397,0.00001745452,0.00009887358,0.00003085668,0.000026189,0.002189727],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002227718,"threshold_uncertainty_score":0.008385718,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04251145398737984,"score_gpt":0.2898647024568767,"score_spread":0.2473532484694969,"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."}}