{"id":"W2024716053","doi":"10.1109/icc.2014.6883518","title":"Efficient channel assignment for cooperative sensing based on convex bipartite matching","year":2014,"lang":"en","type":"article","venue":"","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bipartite graph; Channel (broadcasting); Computer science; Cognitive radio; Assignment problem; Matching (statistics); Integer programming; Channel allocation schemes; Mathematical optimization; Convex optimization; Transformation (genetics); Interference (communication); Linear programming; Algorithm; Regular polygon; Graph; Theoretical computer science; Mathematics; Computer network; Wireless; Telecommunications","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001302325,0.0009644102,0.001371767,0.0009140649,0.0006530993,0.001020334,0.00162453,0.001113806,0.003025406],"category_scores_gemma":[0.003861687,0.0005705721,0.0006280291,0.001634899,0.0009869745,0.001672171,0.001719387,0.001047784,0.0006163045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001048244,"about_ca_system_score_gemma":0.001277835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002959139,"about_ca_topic_score_gemma":0.002581424,"domain_scores_codex":[0.9986596,0.0005922758,0.00003606926,0.0002601674,0.000255314,0.0001965434],"domain_scores_gemma":[0.9988538,0.0007336885,0.0001062486,0.0001117036,0.0001303611,0.0000641466],"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.0001264829,0.0001164413,0.0002412897,0.00007867385,0.00003200768,0.00006680765,0.00007584824,0.8997777,0.002488906,0.03285556,0.001818637,0.06232169],"study_design_scores_gemma":[0.000007571982,0.0000138468,0.00003018153,0.000002469627,0.000002690995,0.00001210964,0.00001100645,0.9884695,0.0003148403,0.01093258,0.0001997209,0.000003550565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007493543,0.00004324617,0.9908832,0.00005970295,0.00001130555,0.00003750416,0.00002846393,0.0001311008,0.001311949],"genre_scores_gemma":[0.5751939,0.0001942694,0.4202067,0.000153961,0.00004040762,0.0003434546,0.0002772455,0.0001225017,0.003467493],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003025406,"threshold_uncertainty_score":0.01012099,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01509950026454053,"score_gpt":0.2379623502200312,"score_spread":0.2228628499554907,"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."}}