{"id":"W2100032763","doi":"10.1109/tcsi.2005.846225","title":"Multiuser detectors for synchronous DS-CDMA systems based on a recursive p-norm convex relaxation approach","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Detector; Semidefinite programming; Code division multiple access; Multiuser detection; Computer science; Convex optimization; Relaxation (psychology); Algorithm; Norm (philosophy); Interference (communication); Mathematical optimization; Regular polygon; Mathematics; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001027664,0.000250036,0.0002868789,0.0002435652,0.001062623,0.0004100549,0.000486397,0.0001580806,0.000005318689],"category_scores_gemma":[0.00000823281,0.0002325133,0.0000838965,0.0003616758,0.0001804461,0.0003339922,0.000007405001,0.0003011606,0.00001882465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002129465,"about_ca_system_score_gemma":0.00006436839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002770106,"about_ca_topic_score_gemma":0.000007128595,"domain_scores_codex":[0.997888,0.0004277485,0.0004335757,0.0006171952,0.000305106,0.0003284035],"domain_scores_gemma":[0.9974028,0.00123041,0.0001936288,0.0008430827,0.0001290255,0.0002010367],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001348013,0.001296403,0.00003057434,0.0004053943,0.0001644898,6.921101e-7,0.001648031,0.209942,0.001462517,0.5062574,0.0001264294,0.2785313],"study_design_scores_gemma":[0.00154835,0.0003637658,0.00009725653,0.0001680835,0.00003998949,0.00003976772,0.001108051,0.9847567,0.0008776538,0.0007115511,0.009834885,0.0004539464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005368451,0.0005192906,0.9893568,0.0001791562,0.0001930907,0.002983862,0.0001025262,0.0001658964,0.00113096],"genre_scores_gemma":[0.9934295,0.00009913601,0.001045701,0.000119709,0.0001171767,0.004687665,0.0000195938,0.00002939163,0.0004520735],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9883111,"threshold_uncertainty_score":0.9481617,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02607812354241723,"score_gpt":0.269264148010722,"score_spread":0.2431860244683047,"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."}}