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: "the poisson channel with side information"
  Abstract: The continuous-time, peak-limited, infinite-bandwidth Poisson channel with spurious counts is considered. It is shown that if the times at which the spurious counts occur are known noncausally to the transmitter but not to the receiver, then the capacity is equal to that of the Poisson channel with no spurious counts. Knowing the times at which the spurious counts occur only causally at the transmitter does not increase capacity.

Connected through hyperedge HE-1 (induced by source paper "capacity of electron based communication over bacterial cables the full csi case"):
  with members:
    - "a stochastic model for electron transfer in bacterial cables"
    - "diffusion based nanonetworking a new modulation technique and performance analysis"
    - "an information theoretic characterization of channels that die"
    - "capacity of discrete molecular diffusion channels"

Connected through hyperedge HE-2 (induced by source paper "superposition coding is almost always optimal for the poisson broadcast channel"):
  with members:
    - "a comparison of superposition coding schemes"
    - "on broadcast channels with binary inputs and symmetric outputs"
    - "capacity regions of two new classes of 2 receiver broadcast channels"

Connected through hyperedge HE-3 (induced by source paper "directed information causal estimation and communication in continuous time"):
  with members:
    - "mutual information relative entropy and estimation in the poisson channel"
    - "lecture notes on network information theory"
    - "interpretations of directed information in portfolio theory data compression and hypothesis testing"
    - "feedback capacity of the compound channel"
    - "on directed information and gambling"
    - "a coding theorem for a class of stationary channels with feedback"
    - "finite state channels with time invariant deterministic feedback"
    - "feedback capacity of stationary gaussian channels"

Connected through hyperedge HE-4 (induced by source paper "covering point patterns"):
  with members:
    - "encoding tasks and renyi entropy"
    - "duality between channel capacity and rate distortion with two sided state information"

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)