{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00109771,0.0005674011,0.001012202,0.0007378662,0.0007785006,0.0008411265,0.002326215,0.00143287,0.002469565],"category_scores_gemma":[0.003997879,0.0006144143,0.0005393125,0.001345557,0.0008832575,0.00135347,0.001032419,0.001582252,0.001060043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001060795,"about_ca_system_score_gemma":0.001749217,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008195837,"about_ca_topic_score_gemma":0.00679617,"domain_scores_codex":[0.9991826,0.0003220977,0.00003276341,0.0001869986,0.0001894058,0.00008605675],"domain_scores_gemma":[0.9991747,0.0004149385,0.00005797665,0.00009658155,0.0002133828,0.00004244171],"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.0001119929,0.0000686405,0.0003376181,0.00006928382,0.00005124996,0.00003719047,0.00007920743,0.8397716,0.004682522,0.02110496,0.002852186,0.1308335],"study_design_scores_gemma":[0.00001119557,0.00001687333,0.00003943468,0.000002334348,0.000003155149,0.000009970734,0.000004177319,0.9944503,0.000683918,0.004161885,0.0006109193,0.000005826621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003600916,0.0001492897,0.9949226,0.00008202182,0.00003393764,0.00002850873,0.00001920339,0.0003614413,0.0008021381],"genre_scores_gemma":[0.2276398,0.0002873121,0.7653649,0.000263982,0.000103416,0.000293763,0.0002818061,0.0001949658,0.005570043],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008195837,"threshold_uncertainty_score":0.01629627,"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."}}