{"id":"W2920074752","doi":"10.1109/tmbmc.2019.2902143","title":"Capacity Limits of Diffusion-Based Molecular Timing Channels With Finite Particle Lifetime","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Molecular Biological and Multi-Scale Communications","topic":"Molecular Communication and Nanonetworks","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University","funders":"","keywords":"Channel (broadcasting); Upper and lower bounds; Channel capacity; Diffusion; Molecular communication; Noise (video); Topology (electrical circuits); Transmitter; Particle number; Particle (ecology); Interval (graph theory); Statistical physics; Detector; Physics; Computer science; Algorithm; Telecommunications; Mathematics; Mathematical analysis; Combinatorics; Quantum mechanics","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.0001457008,0.0002291798,0.000249731,0.00009047647,0.0002860945,0.00002579428,0.0005094814,0.0001809541,0.00005355502],"category_scores_gemma":[0.00001495444,0.0001907955,0.0001127707,0.0003633148,0.0006576764,0.00004210765,0.00001370654,0.0003409586,0.00002006912],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002126641,"about_ca_system_score_gemma":0.00001618039,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001698121,"about_ca_topic_score_gemma":0.00005141626,"domain_scores_codex":[0.9988179,0.0002304204,0.0003235236,0.0002358037,0.0001329017,0.0002594622],"domain_scores_gemma":[0.9981505,0.0002175059,0.00006321784,0.001266136,0.0001383182,0.0001643591],"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.0001124895,0.001174448,0.0003056338,0.00003636926,0.0001818251,0.000005052012,0.0004174224,0.09152258,0.8794557,0.0002721359,0.00001074465,0.02650553],"study_design_scores_gemma":[0.0008695663,0.0003407366,0.0004138193,0.00009363603,0.00005419126,0.000005249647,0.00003367278,0.6248677,0.372504,0.0000343406,0.0004885058,0.0002945576],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2582599,0.0004103388,0.740277,0.0003346348,0.00004506277,0.0002507003,0.00002525534,0.0001221205,0.0002750119],"genre_scores_gemma":[0.948373,0.0004026087,0.05079369,0.0002622201,0.000006828581,0.00009895107,0.00001828455,0.00002781497,0.00001662655],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6901131,"threshold_uncertainty_score":0.7780414,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05548058142917568,"score_gpt":0.2598546814441304,"score_spread":0.2043741000149548,"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."}}