{"id":"W1992168191","doi":"10.1109/lcomm.2013.062113.130872","title":"Discreteness of Sum-Capacity-Achieving Distributions for Discrete-Time Poisson Multiple Access Channels with Peak Constraints","year":2013,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Poisson distribution; Channel (broadcasting); Channel capacity; Discrete time and continuous time; Computer science; Wireless; Topology (electrical circuits); Mathematics; Computer network; 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.003352948,0.001018821,0.0009587,0.001069805,0.0008524797,0.002435395,0.001822035,0.0008535734,0.003086486],"category_scores_gemma":[0.01725778,0.0006075343,0.000623758,0.001364404,0.002895577,0.003006539,0.002077167,0.002404906,0.0004623315],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002032866,"about_ca_system_score_gemma":0.001041315,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007826374,"about_ca_topic_score_gemma":0.0005107438,"domain_scores_codex":[0.9979254,0.0005818112,0.00008454997,0.000213709,0.0008474545,0.0003470303],"domain_scores_gemma":[0.9870182,0.009775491,0.0009832487,0.0007298743,0.00110178,0.0003914188],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001265838,0.00004002512,0.0004544396,0.0001298825,0.00002899029,0.0002170858,0.0002571816,0.156384,0.005636822,0.8272884,0.000875832,0.008560837],"study_design_scores_gemma":[0.0000232778,0.000060264,0.0002945884,0.00003158052,0.00001120035,0.0002377483,0.00009535735,0.7160946,0.003987885,0.277898,0.001219572,0.00004598525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05139723,0.0004711243,0.9343091,0.0004786319,0.00005166874,0.00006801781,0.0002053241,0.0001905421,0.01282838],"genre_scores_gemma":[0.9415597,0.001024303,0.05287385,0.0002516766,0.0001340418,0.0002826273,0.0001789408,0.0001093112,0.003585456],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003352948,"threshold_uncertainty_score":0.01773232,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03261636023751335,"score_gpt":0.2567350504754751,"score_spread":0.2241186902379617,"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."}}