{"id":"W2963354877","doi":"10.1109/tcomm.2019.2910265","title":"Symbol-by-Symbol Maximum Likelihood Detection for Cooperative Molecular Communication","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Molecular Communication and Nanonetworks","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Molecular communication; Symbol (formal); Algorithm; Detector; Intersymbol interference; Fusion center; Computer science; Transmitter; Detection theory; Interference (communication); Binary number; Sequence (biology); Communications system; Mathematics; Telecommunications; Decoding methods; Arithmetic; Wireless; Channel (broadcasting)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002803519,0.0003040843,0.0002906816,0.0002060095,0.0005603837,0.00009812685,0.001343339,0.0002380168,0.0001361136],"category_scores_gemma":[0.000008079048,0.0003579212,0.0002161342,0.0005405973,0.000113005,0.0002392945,0.00001382737,0.000704778,0.0002788943],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001881107,"about_ca_system_score_gemma":0.00003948482,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002588028,"about_ca_topic_score_gemma":0.0001537802,"domain_scores_codex":[0.9984422,0.0002695273,0.0004785969,0.0002656406,0.0001948218,0.000349179],"domain_scores_gemma":[0.9953876,0.0004049198,0.00008598059,0.003761223,0.0002277865,0.0001325616],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001729153,0.001448008,0.00001630413,0.0001720259,0.000970449,6.341175e-7,0.001801605,0.1590143,0.6156607,0.00224808,0.005605591,0.2128894],"study_design_scores_gemma":[0.002655084,0.0003529066,0.00003235028,0.0001985068,0.0002253917,0.00001550773,0.0007480769,0.5047727,0.4160908,0.001765485,0.07197732,0.001165941],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01094608,0.002176089,0.9763206,0.0008388028,0.000339522,0.001576829,0.0001345233,0.0006629044,0.007004619],"genre_scores_gemma":[0.989583,0.002680727,0.005744081,0.0002792125,0.00000928639,0.001103488,0.0001860959,0.0001065862,0.0003075345],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9786369,"threshold_uncertainty_score":0.9998873,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008568695613415892,"score_gpt":0.2258202230712081,"score_spread":0.2172515274577922,"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."}}