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: "an alternative proof for the capacity region of the degraded gaussian mimo broadcast channel"
  Abstract: We provide an alternative proof for the capacity region of the degraded Gaussian multiple-input multiple-output (MIMO) broadcast channel. Our proof does not use the channel enhancement technique as opposed to the original proof of Weingertan {\it et. al.} and the alternative proof of Liu {\it et. al}. Our proof starts with the single-letter description of the capacity region of the degraded broadcast channel, and directly evaluates it for the degraded Gaussian MIMO broadcast channel by using two main technical tools. The first one is the generalized de Bruijn identity due to Palomar \emph{et. al.} which provides a connection between the differential entropy and the Fisher information matrix. The second tool we use is an inequality due to Dembo which lower bounds the differential entropy in terms of the Fisher information matrix.

Connected through hyperedge HE-1 (induced by source paper "achieving large sum rate and good fairness in miso broadcast communication"):
  with members:
    - "a generalized zero forcing precoder with successive dirty paper coding in miso broadcast channels"
    - "improving the performance of the zero forcing multiuser miso downlink precoder through user grouping"
    - "a low complexity channel shortening receiver with diversity support for evolved 2g device"
    - "an axiomatic theory of fairness in network resource allocation"
    - "a quantitative measure of fairness and discrimination for resource allocation in shared computer systems"

Connected through hyperedge HE-2 (induced by source paper "piggybacking codes for network coding the high low snr regime"):
  with members:
    - "generalized i mmse for k user gaussian channels"
    - "multiuser i mmse"
    - "wireless network information flow a deterministic approach"
    - "pipelined encoding for deterministic and noisy relay networks"

Connected through hyperedge HE-3 (induced by source paper "an outer bound for the vector gaussian ceo problem"):
  with members:
    - "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel"
    - "an extremal inequality motivated by multiterminal information theoretic problems"

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)