{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003016823,0.0001694936,0.0001525956,0.0003437712,0.0002333667,0.00003835808,0.000115903,0.0001311654,0.00001100357],"category_scores_gemma":[0.00001592543,0.000182659,0.0000682557,0.0002377158,0.00006951667,0.0009284441,0.000001686292,0.0002543414,0.00001160728],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001583461,"about_ca_system_score_gemma":0.00001070367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009060607,"about_ca_topic_score_gemma":0.0000242349,"domain_scores_codex":[0.9991022,0.00004563729,0.0004284095,0.000102884,0.00013832,0.0001825864],"domain_scores_gemma":[0.9991338,0.0002727949,0.0001276619,0.0002908414,0.0001277031,0.00004716863],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001785706,0.00003962444,0.000001646247,0.0001603122,0.00003698913,6.609608e-8,0.001176978,0.2394264,0.02454426,0.0007249913,0.000003563243,0.7337066],"study_design_scores_gemma":[0.0009458076,0.0003085317,0.00005220442,0.0001578541,0.00002750391,0.00002094921,0.0004693479,0.4601133,0.5196575,0.01655692,0.001392067,0.0002979935],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1039883,0.00001822011,0.8941752,0.00001360797,0.000230744,0.00057551,0.00002492628,0.000545904,0.0004275343],"genre_scores_gemma":[0.9957427,0.0001696026,0.003795426,0.00006217377,0.0000120848,0.0001763858,0.000006353882,0.00002636776,0.000008931264],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8917543,"threshold_uncertainty_score":0.7448618,"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."}}