{"id":"W2105361910","doi":"10.1109/cwit.2007.375688","title":"An Efficient User Removal Algorithm for Limited-Power Interference Channels","year":2007,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Constraint (computer-aided design); Interference (communication); Quality of service; Transmitter power output; Algorithm; Power (physics); Boundary (topology); Mathematical optimization; Algorithm design; Transmitter; Computer network; Mathematics; 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.001515894,0.0001387863,0.0001405773,0.0002028485,0.0001806049,0.0002951757,0.002731679,0.00008841413,0.0000426989],"category_scores_gemma":[0.00004311694,0.0001208149,0.00006381033,0.0005876123,0.00007196144,0.0003257678,0.0005979534,0.0002106157,0.00008647289],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007012631,"about_ca_system_score_gemma":0.00005835422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001611998,"about_ca_topic_score_gemma":0.00001385932,"domain_scores_codex":[0.9982499,0.00008709703,0.0002879799,0.0004366774,0.0003647589,0.0005735638],"domain_scores_gemma":[0.9973302,0.0004230107,0.00006056541,0.001593875,0.0003633403,0.0002289697],"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.00002398507,0.0004555956,0.00003156039,0.000006065641,0.00002081925,0.00001904508,0.001137832,0.00436535,0.0008935201,0.1242663,0.002940334,0.8658395],"study_design_scores_gemma":[0.0002747651,0.0001737661,0.0002520914,0.00001455366,9.842178e-7,0.00001936058,0.00006862061,0.9805658,0.003921655,0.0002311371,0.01430005,0.0001771463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007314362,0.00006381052,0.9867504,0.0005303709,0.00040539,0.0003707147,0.000001400392,0.0002770116,0.004286603],"genre_scores_gemma":[0.5851135,0.000007746371,0.4136323,0.0002647691,0.0000734373,0.00002333709,0.000003986275,0.00001180272,0.0008690971],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9762005,"threshold_uncertainty_score":0.5076184,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03602092077636093,"score_gpt":0.3280872643028812,"score_spread":0.2920663435265203,"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."}}