{"id":"W2166346249","doi":"10.1109/tcomm.2013.112513.130143","title":"Capacity-Achieving Distributions for the Discrete-Time Poisson Channel—Part II: Binary Inputs","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Binary number; Poisson distribution; Channel (broadcasting); Current (fluid); Channel capacity; Mathematics; Applied mathematics; Binary Independence Model; Topology (electrical circuits); Work (physics); Probability mass function; Mathematical optimization; Computer science; Probability distribution; Statistical physics; Algorithm; Physics; Telecommunications; Statistics; Combinatorics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002265979,0.000624826,0.0006046089,0.0008247564,0.0006777756,0.002045785,0.0009851172,0.0008408978,0.005809265],"category_scores_gemma":[0.01026352,0.0003391255,0.0004476008,0.001264332,0.001913425,0.001478213,0.00109456,0.001326506,0.0006670846],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002327324,"about_ca_system_score_gemma":0.001155257,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001389734,"about_ca_topic_score_gemma":0.001004487,"domain_scores_codex":[0.9990637,0.0002986099,0.00003001507,0.00007903755,0.0003016859,0.0002269959],"domain_scores_gemma":[0.9920039,0.006028742,0.0006792264,0.0003239591,0.0007426898,0.000221542],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001914804,0.00007396498,0.0008551086,0.0002391436,0.00002353537,0.0002170482,0.0002305062,0.4003191,0.00488999,0.5743582,0.003148544,0.01545355],"study_design_scores_gemma":[0.00002323908,0.0000447158,0.0004034734,0.00004090622,0.000008835386,0.0001620301,0.0001272615,0.8848978,0.002894086,0.1100757,0.001288773,0.00003317974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1467983,0.001395807,0.7854422,0.001581023,0.0001248518,0.0001688009,0.000870184,0.0003640277,0.06325466],"genre_scores_gemma":[0.9652399,0.0008527806,0.02840694,0.0001593296,0.00008189899,0.000136736,0.0001778944,0.00005294553,0.004891574],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005809265,"threshold_uncertainty_score":0.01943398,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03810030262917415,"score_gpt":0.2596301644287842,"score_spread":0.2215298617996101,"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."}}