{"id":"W2013094895","doi":"10.1504/ijcnds.2012.046357","title":"A continuous-time Markov chain model and analysis for cognitive radio networks","year":2012,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Cognitive radio; Computer science; Markov chain; Throughput; Markov model; Continuous-time Markov chain; Markov process; State space; Mathematical optimization; Telecommunications; Wireless; Markov property; Machine learning; Statistics; Mathematics","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.0014996,0.000175084,0.0004606927,0.0002216557,0.000190402,0.00046068,0.0005527921,0.0001097772,0.000002596149],"category_scores_gemma":[0.0001027291,0.0001583308,0.0001755768,0.0003167737,0.00008765592,0.0006446705,0.0001984852,0.0002436223,2.651499e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007692615,"about_ca_system_score_gemma":0.0000319642,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001428894,"about_ca_topic_score_gemma":0.000004971928,"domain_scores_codex":[0.9983387,0.0002568515,0.0006645222,0.0001661275,0.0002858582,0.0002879671],"domain_scores_gemma":[0.9968582,0.0009929334,0.000757235,0.0002384938,0.0009430167,0.0002101433],"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.0003933516,0.0002663158,0.03284588,0.0000115956,0.004162001,0.00001060371,0.0007184845,0.8851377,0.00002555632,0.03472916,0.002923616,0.03877575],"study_design_scores_gemma":[0.0009081294,0.00004842895,0.008689483,0.0001433201,0.0002347315,0.0001809824,0.0001167461,0.9886006,0.000001223344,0.0002136901,0.0006959046,0.0001667993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01438109,0.01436501,0.9699164,0.0005588222,0.0003429772,0.0002115382,0.000054467,0.00002293881,0.0001467591],"genre_scores_gemma":[0.9945433,0.001719709,0.002943268,0.0001159949,0.0004462687,0.00001056462,0.0001687309,0.00001073498,0.0000414341],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9801622,"threshold_uncertainty_score":0.6456543,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01384268296598802,"score_gpt":0.2564504263507543,"score_spread":0.2426077433847662,"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."}}