{"id":"W2784110166","doi":"10.48550/arxiv.1801.02890","title":"Symbol-by-Symbol Maximum Likelihood Detection for Cooperative Molecular Communication","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Molecular Communication and Nanonetworks","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University","funders":"","keywords":"Molecular communication; Symbol (formal); Algorithm; Detector; Computer science; Fusion center; Transmitter; Intersymbol interference; Sequence (biology); Binary number; Interference (communication); Detection theory; Mathematics; Telecommunications; Channel (broadcasting); Arithmetic; Decoding methods; Wireless; Chemistry","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002336628,0.0003749271,0.0003415509,0.0001702842,0.0002335775,0.00008122149,0.0009992588,0.0005348343,0.00005117344],"category_scores_gemma":[0.00002962302,0.0004920072,0.0002259568,0.000341188,0.0001214606,0.0001228354,0.0005262258,0.0006580177,0.00006421506],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002747141,"about_ca_system_score_gemma":0.00005107316,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003502727,"about_ca_topic_score_gemma":0.0000784126,"domain_scores_codex":[0.9986203,0.0002001455,0.0002627906,0.0005046712,0.00006958656,0.0003424594],"domain_scores_gemma":[0.997647,0.00008544103,0.0001374245,0.001683361,0.0003026132,0.0001440878],"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.0003594713,0.0004222126,0.0002286041,0.0007119167,0.001869246,0.0000408308,0.001047426,0.9185803,0.03672116,0.00890722,0.01825525,0.01285635],"study_design_scores_gemma":[0.001198712,0.0001156466,0.00004752217,0.0002132965,0.0002926076,0.000003531868,0.00019704,0.9415128,0.03183955,0.01420812,0.009371486,0.0009996302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1436059,0.001186154,0.8501599,0.00004407158,0.0003361293,0.0009318503,0.00006795225,0.0004775361,0.003190455],"genre_scores_gemma":[0.9967363,0.001500597,0.0009011365,0.0000788947,0.00004867684,0.0000249594,0.0004229958,0.00008754952,0.0001988217],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8531305,"threshold_uncertainty_score":0.9997532,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02646402227852829,"score_gpt":0.17575284155066,"score_spread":0.1492888192721317,"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."}}