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: "transmitter optimization in slow fading miso wiretap channel"
  Abstract: In this paper, we consider the transmitter optimization problem in slow fading multiple-input-single-output (MISO) wiretap channel. The source transmits a secret message intended for $K$ users in the presence of $J$ non-colluding eavesdroppers, and operates under a total power constraint. The channels between the source and all users and eavesdroppers are assumed to be slow fading, and only statistical channel state information (CSI) is known at the source. For a given code rate and secrecy rate pair of the wiretap code, denoted by $(R_{D}, R_{s})$, we define the non-outage event as the joint event of the link information rates to $K$ users be greater than or equal to $R_{D}$ and the link information rates to $J$ eavesdroppers be less than or equal to $(R_{D} - R_{s})$. We minimize the transmit power subject to the total power constraint and satisfying the probability of the non-outage event to be greater than or equal to a desired threshold $(1-\epsilon)$.

Connected through hyperedge HE-1 (induced by source paper "a generalized expression for the gradient of mutual information with the application in multiple access channels"):
  with members:
    - "sum rate capacity for symmetric gaussian multiple access channels with feedback"
    - "generalized i mmse for k user gaussian channels"
    - "pointwise relations between information and estimation in gaussian noise"
    - "mutual information relative entropy and estimation in the poisson channel"
    - "mutual information and minimum mean square error in gaussian channels"

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)