{"id":"W1982597307","doi":"10.1109/twc.2013.092013.120862","title":"Opportunistic Spectrum Access with Spatial Reuse: Graphical Game and Uncoupled Learning Solutions","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":97,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Cognitive radio; Potential game; Nash equilibrium; Game theory; Channel (broadcasting); Reuse; Computer network; Scheduling (production processes); Mathematical optimization; Channel allocation schemes; Information exchange; Interference (communication); Wireless; Telecommunications; Mathematics; Mathematical economics","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.0001828942,0.0002481647,0.0002656874,0.0002835995,0.001395352,0.000588108,0.001625577,0.00009827223,0.00005047306],"category_scores_gemma":[0.00001169011,0.0002332471,0.00008259338,0.000811506,0.0004397382,0.0007719906,0.00006670522,0.0008815067,0.00002799859],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007538378,"about_ca_system_score_gemma":0.0001257523,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001061172,"about_ca_topic_score_gemma":0.003163906,"domain_scores_codex":[0.9982584,0.0002557231,0.000319701,0.0004452456,0.0002696108,0.0004513267],"domain_scores_gemma":[0.9968798,0.0005775004,0.0001284239,0.002014298,0.0001576645,0.0002423359],"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.0001597936,0.003466254,0.002099565,0.00009832862,0.001052637,0.0000821452,0.004800763,0.06570271,0.005648685,0.1415204,0.0007030535,0.7746657],"study_design_scores_gemma":[0.0007061907,0.0002746409,0.004788708,0.0001284937,0.00007019084,0.0001253879,0.00009658717,0.989133,0.000322581,0.003362137,0.0005097598,0.0004823029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03117606,0.00007517182,0.9567249,0.01061301,0.0001231131,0.0003931543,0.000007025323,0.0003459433,0.0005416545],"genre_scores_gemma":[0.9936081,0.001022985,0.004872668,0.0001937991,0.00003071267,0.0001186956,0.000009293526,0.00002870999,0.0001150699],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.962432,"threshold_uncertainty_score":0.9999047,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03196376893613621,"score_gpt":0.2576382620078482,"score_spread":0.225674493071712,"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."}}