{"id":"W2089955911","doi":"10.1049/iet-com.2013.0119","title":"Decode and forward relaying for energy‐efficient multiuser cooperative cognitive radio network with outage constraints","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cognitive radio; Computer science; Mathematical optimization; Fractional programming; Telecommunications link; Convergence (economics); Interference (communication); Iterative method; Convex optimization; Constraint (computer-aided design); Power (physics); Telecommunications; Wireless; Nonlinear programming; Algorithm; Regular polygon; Mathematics; Nonlinear system; Channel (broadcasting)","routes":{"ca_aff":true,"ca_fund":true,"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":["sts"],"consensus_categories":[],"category_scores_codex":[0.0006724555,0.0002162073,0.0002686305,0.00007782044,0.001328386,0.0002460529,0.001433393,0.00006924449,0.000008382897],"category_scores_gemma":[0.0002358621,0.0001920118,0.00005655595,0.0004367761,0.0005455819,0.000244886,0.0008678083,0.000248694,0.000006705191],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004571006,"about_ca_system_score_gemma":0.00009165671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007965408,"about_ca_topic_score_gemma":0.0003054069,"domain_scores_codex":[0.9983307,0.0004912562,0.0003202097,0.0003785935,0.0001408162,0.0003384598],"domain_scores_gemma":[0.995258,0.002203085,0.0001676901,0.001720701,0.0005018759,0.0001486654],"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.00003871604,0.0001972746,0.0009072882,0.00001010621,0.0001446478,6.819398e-7,0.00372467,0.006102188,0.0001551051,0.8463002,0.001083929,0.1413352],"study_design_scores_gemma":[0.001673158,0.0001927388,0.001094518,0.0002114924,0.00004222694,0.00002007491,0.0003187844,0.9580772,0.000174455,0.0008454504,0.03693189,0.000418018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003169698,0.001327563,0.9861695,0.002660194,0.00007229421,0.0004906535,0.00001498336,0.0001644885,0.005930695],"genre_scores_gemma":[0.8698859,0.0007593666,0.1279675,0.0008757971,0.00003741088,0.0002952436,0.00004488795,0.00001957044,0.0001144005],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.951975,"threshold_uncertainty_score":0.9999717,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03348406342322219,"score_gpt":0.2844413529154395,"score_spread":0.2509572894922174,"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."}}