{"id":"W2132750713","doi":"10.1109/18.959286","title":"On computing Verdu's upper bound for a class of maximum-likelihood multiuser detection and sequence detection problems","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Upper and lower bounds; Multiuser detection; Computer science; Sequence (biology); Code division multiple access; Detector; Algorithm; Decoding methods; Mathematics; Theoretical computer science; Computer network; 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.02014426,0.003402753,0.003668146,0.006165277,0.002765146,0.005436637,0.004026737,0.003064452,0.005906448],"category_scores_gemma":[0.1063336,0.001106411,0.00200296,0.004767381,0.005816763,0.01057615,0.006442132,0.006103107,0.001647534],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005695302,"about_ca_system_score_gemma":0.003747555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003497833,"about_ca_topic_score_gemma":0.003227377,"domain_scores_codex":[0.9839101,0.008060025,0.0007474046,0.001714669,0.004096375,0.001471436],"domain_scores_gemma":[0.8981411,0.08703475,0.002852013,0.005759554,0.005283706,0.0009287526],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003922416,0.00008969762,0.001225578,0.0003366137,0.0001345211,0.000192016,0.0002523237,0.4459245,0.001404456,0.4696986,0.007991868,0.07235759],"study_design_scores_gemma":[0.00003760808,0.00009463782,0.00034848,0.00009780878,0.00003105564,0.0001765799,0.00003821782,0.7002343,0.001683266,0.2946546,0.00253591,0.0000675642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01015927,0.003347407,0.9735889,0.0008649592,0.0001845747,0.0001483757,0.0002667815,0.0003140862,0.01112551],"genre_scores_gemma":[0.4152049,0.005236376,0.5658221,0.001338561,0.0009260438,0.001234462,0.001569255,0.0007046817,0.00796369],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02014426,"threshold_uncertainty_score":0.1065342,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01148477658421933,"score_gpt":0.238168862175082,"score_spread":0.2266840855908627,"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."}}