{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001630055,0.0001587841,0.0002518706,0.000588302,0.0003958412,0.0002147495,0.001313589,0.0001030347,0.000007845084],"category_scores_gemma":[0.0002277801,0.0001578669,0.00003582708,0.002274961,0.0001629259,0.0006356115,0.0002447254,0.00101368,0.000001135692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001704047,"about_ca_system_score_gemma":0.0002348063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001595302,"about_ca_topic_score_gemma":0.0008076815,"domain_scores_codex":[0.9977291,0.0007939523,0.0008153667,0.000200717,0.0001993735,0.0002614805],"domain_scores_gemma":[0.9970047,0.000816589,0.000331132,0.00117472,0.0005700919,0.0001027237],"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.00002428316,0.000377325,0.0008827854,0.000003583639,0.00002366907,0.000005829098,0.00258835,0.9309969,0.001839549,0.05623221,0.0001869704,0.006838566],"study_design_scores_gemma":[0.0008604464,0.000168483,0.01405535,0.0003685874,0.000008148773,0.00004924408,0.0008597228,0.9808584,0.000963067,0.0003623743,0.001181381,0.0002647286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03315001,0.002784351,0.9571506,0.00282949,0.00008368291,0.0002927179,9.423341e-7,0.00005005694,0.003658081],"genre_scores_gemma":[0.9612973,0.005458898,0.03297414,0.0001755587,0.00002761642,0.00001327668,0.00001224285,0.00001200738,0.00002897734],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9281473,"threshold_uncertainty_score":0.6437625,"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."}}