{"id":"W2003321312","doi":"10.1109/wcl.2012.101812.120671","title":"On Approximating the Cognitive Radio Aggregate Interference} \\IEEEaftertitletextvspace{-1\\baselineskip","year":2012,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Interference (communication); Cognitive radio; Rayleigh fading; Path loss; Log-distance path loss model; Shadow mapping; Moment (physics); Fading; Aggregate (composite); Power control; Upper and lower bounds; Computer science; Power (physics); Topology (electrical circuits); Telecommunications; Mathematics; Physics; Mathematical analysis; Wireless; Combinatorics; 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.0006920359,0.000260372,0.0002360611,0.0001359144,0.000749229,0.0002738473,0.001941387,0.00005864997,0.000009461342],"category_scores_gemma":[0.00009676195,0.000199795,0.0001295663,0.0005444478,0.0003385479,0.0005164349,0.0003707548,0.0006024313,0.0001683752],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001002731,"about_ca_system_score_gemma":0.00002967396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004264857,"about_ca_topic_score_gemma":0.00003367313,"domain_scores_codex":[0.9979394,0.00054915,0.0003716819,0.0003056417,0.0002681499,0.0005659575],"domain_scores_gemma":[0.9958171,0.001784583,0.0002451889,0.001924358,0.0001016729,0.0001271104],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009218149,0.0009724515,0.002134348,0.00004978523,0.000483929,0.00002424287,0.02143799,0.0006995882,0.02011702,0.1568476,0.01780167,0.7793392],"study_design_scores_gemma":[0.00202264,0.0001864198,0.003792181,0.001796104,0.0001622769,0.0002769992,0.00129631,0.9656529,0.01553653,0.001809575,0.005494814,0.001973262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2541489,0.0006415339,0.7185106,0.02262422,0.0007925112,0.0004122653,0.000007075188,0.0002488525,0.002614102],"genre_scores_gemma":[0.9870133,0.0001284451,0.006109012,0.006294437,0.0003081378,0.00007074448,0.0000110329,0.00002685126,0.00003799286],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9649533,"threshold_uncertainty_score":0.8147403,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03075117861100972,"score_gpt":0.2677428271350691,"score_spread":0.2369916485240594,"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."}}