{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0003993213,0.0002902971,0.0002785367,0.0001763283,0.002459155,0.00009289649,0.002156392,0.0002057637,0.0000516715],"category_scores_gemma":[0.0001082363,0.0002572783,0.0002214721,0.0005570071,0.0005403986,0.0002427531,0.00004280268,0.000860962,0.00018381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001621028,"about_ca_system_score_gemma":0.00002058701,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000232028,"about_ca_topic_score_gemma":0.0001378306,"domain_scores_codex":[0.9985756,0.0001561763,0.0004614124,0.0002307282,0.0001749887,0.000401061],"domain_scores_gemma":[0.9934955,0.001984607,0.00007820714,0.004207977,0.0001338745,0.00009982684],"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.0001204896,0.00320927,0.00002238634,0.0003337547,0.001381749,2.375572e-7,0.003371259,0.5877982,0.07509638,0.1633125,0.01909349,0.1462602],"study_design_scores_gemma":[0.0008606108,0.0002938861,0.0002050673,0.0002488765,0.0002747825,0.00001178967,0.0001859271,0.5552717,0.01955302,0.005272602,0.4167792,0.001042561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00508568,0.000505153,0.968466,0.02090659,0.0003500596,0.0006995141,0.0004771334,0.001824689,0.001685197],"genre_scores_gemma":[0.9784551,0.001483364,0.01814611,0.00009984995,0.00003761333,0.001250296,0.0001027621,0.00006921409,0.0003556867],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9733694,"threshold_uncertainty_score":0.999988,"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."}}