human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "on the capacity of the half duplex mimo gaussian diamond channel"):
  Abstract: In this paper, we analyze the 2-relay multiple-input multiple-output (MIMO) Gaussian diamond channel. We show that a multihopping decode-and-forward with multiple access (MDF-MAC) protocol achieves rates within a constant gap from capacity when a channel parameter $\Delta$ is greater than zero. We also identify the transmit covariance matrices to be used by each relay in the multiple-access (MAC) state of the MDF-MAC protocol. As done for the single-antenna 2-relay Gaussian diamond channel, the channel parameter $\Delta$ is defined to be the difference between the product of the capacities of the links from the source to the two relays and the product of the capacities of the links from the two relays to the destination.

Includes members:
  Member "approximate capacity of the mimo relay channel":
    also connected through other hyperedges:
      (none)
  Member "gaussian half duplex relay networks improved constant gap and connections with the assignment problem":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "best relay selection in gaussian half duplex diamond networks")
  Member "achieving the capacity of the n relay gaussian diamond network within log n bits":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the arbitrarily varying relay channel")
  Member "gaussian relay channel capacity to within a fixed number of bits":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "capacity bounds for a class of interference relay channels")

Question: Please tell me which class the source paper 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)