{"id":"W2148654413","doi":"10.1109/iscas.1998.698973","title":"A genetic-algorithm-based multiuser detector for multiple-access communications","year":2002,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Detector; Computer science; Computational complexity theory; Viterbi algorithm; Algorithm; Multiuser detection; Genetic algorithm; Decoding methods; Telecommunications; Machine learning","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":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0002716952,0.0001600298,0.0001694642,0.0001789105,0.000451549,0.000474609,0.008153877,0.00008720123,0.000111636],"category_scores_gemma":[0.0001767786,0.000152061,0.000110108,0.0006890488,0.0001480794,0.0004694369,0.001573584,0.0002219646,0.0001129029],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007004572,"about_ca_system_score_gemma":0.00004693813,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008665854,"about_ca_topic_score_gemma":0.000171916,"domain_scores_codex":[0.9983178,0.0002192297,0.0003337501,0.0003734842,0.0003123982,0.0004433623],"domain_scores_gemma":[0.993278,0.001664055,0.00009323363,0.004425631,0.0003652986,0.000173748],"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.000007619516,0.000635505,0.002179452,0.00002697383,0.00004085624,0.000001943725,0.0002686097,0.005154517,0.0004834812,0.003997701,0.01117529,0.976028],"study_design_scores_gemma":[0.0008429622,0.00004135068,0.002370589,0.00001086004,0.000002629321,0.000001688698,0.00000543284,0.9627485,0.0009192603,0.0001414578,0.03272203,0.0001932806],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000590754,0.0005150724,0.9920493,0.004526522,0.00008184452,0.000832653,0.000009953998,0.0003906142,0.001003317],"genre_scores_gemma":[0.3740305,0.000111813,0.6244601,0.0004378741,0.00003174344,0.0005373842,0.000005031311,0.00001754058,0.0003679821],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9758348,"threshold_uncertainty_score":0.9972125,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1224429135947724,"score_gpt":0.3431484063157603,"score_spread":0.2207054927209879,"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."}}