{"id":"W2044404558","doi":"10.1109/tcomm.2013.112513.130142","title":"Capacity-Achieving Distributions for the Discrete-Time Poisson Channel—Part I: General Properties and Numerical Techniques","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Network Technologies","field":"Engineering","cited_by":72,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Poisson distribution; Channel capacity; Mathematics; Channel (broadcasting); Constraint (computer-aided design); Envelope (radar); Applied mathematics; Mathematical optimization; Topology (electrical circuits); Computer science; Statistics; Telecommunications; Geometry","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.0001761991,0.0001701793,0.0001726085,0.00006371003,0.0008524511,0.00007689151,0.0005482245,0.0001129534,0.000007507997],"category_scores_gemma":[0.00003378288,0.000130007,0.00008508237,0.0002157217,0.0003776009,0.0001308308,0.00001127839,0.0004196406,0.00001216698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005985501,"about_ca_system_score_gemma":0.000006739109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002052262,"about_ca_topic_score_gemma":0.0000249972,"domain_scores_codex":[0.9992335,0.0000620092,0.0002229276,0.0001476513,0.00008380633,0.000250062],"domain_scores_gemma":[0.9982904,0.0004927423,0.00002580888,0.001087777,0.00004958713,0.00005365016],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001213466,0.001211607,0.00004503212,0.0003503282,0.001182912,4.729274e-7,0.001680831,0.2675426,0.06137247,0.1086391,0.01002173,0.5478315],"study_design_scores_gemma":[0.0001371606,0.0001176587,0.00006415159,0.0000730115,0.0001000627,0.000007566332,0.00005800877,0.9438397,0.01821393,0.001146267,0.03596054,0.0002819842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003248864,0.000351091,0.9867586,0.007065384,0.0001209517,0.0005368224,0.0001209222,0.001297781,0.000499617],"genre_scores_gemma":[0.9650746,0.0006532277,0.03308123,0.00004663015,0.00004848792,0.0009369981,0.00001319869,0.0000352258,0.0001104056],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9618257,"threshold_uncertainty_score":0.6556451,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03614595243466399,"score_gpt":0.2362534376391824,"score_spread":0.2001074852045185,"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."}}