human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "on the achievable rate of a sample based practical photon counting receiver"
  Abstract: We investigate the achievable rate for a practical receiver under on-off keying modulation based on Kullback-Leibler (KL) divergence and Chernoff $\alpha$-divergence. The asymptotic tightness of the derived bounds is analyzed for large symbol duration and large peak power. We prove the tightness of the derived bounds for large symbol duration, large peak power with zero background radiation with exponential convergence rate, and for low peak power of order two. For large peak power with fixed background radiation and low background radiation with fixed peak power, the proposed bound gap is a small positive value for low background radiation and large peak power, respectively. Moreover, we propose an approximation on the achievable rate in the low background radiation and large symbol duration regime, which is more accurate compared with the derived upper and lower bounds in the medium signal to noise ratio (SNR) regime. The proposed bounds and the approximations are evaluated by the numerical results.

Connected through hyperedge HE-1 (induced by source paper "on the sum rate capacity of poisson multiple access channel with non perfect photon counting receiver"):
  with members:
    - "clipping noise and power allocation for ofdm based optical wireless communication using photon detection"
    - "a refined analysis of the poisson channel in the high photon efficiency regime"

Question: Please tell me which class the center node belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.IT(Information Theory)