{"id":"W4309258626","doi":"10.32920/21576666","title":"A Viterbi-Like Algorithm With Adaptive Clustering for Channel Assignment in Cellular Radio Networks","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Viterbi algorithm; Algorithm; Bandwidth (computing); Channel (broadcasting); Benchmark (surveying); Cluster analysis; Channel allocation schemes; Computer network; Wireless; Telecommunications; Decoding methods; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00146153,0.0004509366,0.0005786307,0.0004130926,0.000266875,0.000433737,0.004681732,0.0002525128,0.00005951335],"category_scores_gemma":[0.000008179079,0.0004248331,0.0001576042,0.0006751576,0.00007930307,0.0002551383,0.01132818,0.001783648,0.000002984301],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008505858,"about_ca_system_score_gemma":0.0003289009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002464418,"about_ca_topic_score_gemma":0.0001917169,"domain_scores_codex":[0.9960026,0.0005398025,0.0005520813,0.001224388,0.0008219433,0.0008592125],"domain_scores_gemma":[0.9962549,0.0004733568,0.0002801651,0.002646132,0.0001536731,0.0001918089],"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.00004626168,0.0001411424,0.00001344577,0.00004179322,0.00008127223,0.00004020942,0.0007662728,0.9457313,0.000004361271,0.0009320985,0.000845532,0.05135626],"study_design_scores_gemma":[0.0007588189,0.0002463501,0.00005850675,0.0001656525,0.000007044347,0.000005926905,0.0001645795,0.9950878,0.00003019237,0.0005924318,0.002374541,0.0005081565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000584589,0.001070651,0.993868,0.000911272,0.0006048832,0.002310738,0.00001222099,0.00021998,0.0009437794],"genre_scores_gemma":[0.337892,0.0005324213,0.6503785,0.0004345276,0.0003472458,0.007447488,0.0001944573,0.000131905,0.002641405],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3434895,"threshold_uncertainty_score":0.9998204,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04048917138322558,"score_gpt":0.276440276299287,"score_spread":0.2359511049160614,"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."}}