{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001909553,0.0006944094,0.0008908652,0.0005537162,0.0004799757,0.000902961,0.00141137,0.001320942,0.0008376166],"category_scores_gemma":[0.005676006,0.0003986695,0.0004068402,0.0007286331,0.001402154,0.001660878,0.001150007,0.001142803,0.0003909628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001037432,"about_ca_system_score_gemma":0.0009044221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007892388,"about_ca_topic_score_gemma":0.0008462802,"domain_scores_codex":[0.9984743,0.0006103215,0.00005109555,0.0002450702,0.0005273331,0.00009189868],"domain_scores_gemma":[0.9977497,0.00144907,0.0002576126,0.0002309581,0.000264236,0.00004827154],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003317755,0.0001351238,0.001623303,0.00042383,0.0001206274,0.0002590624,0.0003831614,0.6842952,0.03553112,0.1098163,0.001876682,0.1652039],"study_design_scores_gemma":[0.00001343345,0.00006194328,0.00009158003,0.000007674332,0.000008917437,0.00006342105,0.00001051995,0.9859515,0.003651158,0.009124362,0.0009999952,0.0000154361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007664165,0.0004009586,0.9907419,0.0001613985,0.00002498436,0.00002628265,0.00001535134,0.0001276616,0.0008373007],"genre_scores_gemma":[0.6386482,0.0007295089,0.3572879,0.0002683375,0.000104501,0.00015614,0.00008251835,0.00004346223,0.002679528],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001909553,"threshold_uncertainty_score":0.01009881,"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."}}