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 "simultaneous diagonalization on the dof region of the k user mimo multi way relay channel"):
  Abstract: The K-user MIMO Y-channel consisting of K users which want to exchange messages among each other via a common relay node is studied in this paper. A transmission strategy based on channel diagonalization using zero-forcing beam-forming is proposed. This strategy is then combined with signal-space alignment for network-coding, and the achievable degrees-of-freedom region is derived. A new degrees-of-freedom outer bound is also derived and it is shown that the proposed strategy achieves this outer bound if the users have more antennas than the relay.

Includes members:
  Member "beyond one way communication degrees of freedom of multi way relay mimo interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "degrees of freedom of the mimo three way channel with node intermittency")
  Member "approximate sum capacity of the y channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal dof region for the asymmetric two pair mimo two way relay channel")
  Member "degrees of freedom for the mimo multi way relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "degrees of freedom of the mimo three way channel with node intermittency")
  Member "the deterministic multicast capacity of 4 node relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the capacity region of the deterministic y channel with common and private messages")
  Member "the degrees of freedom of the mimo y channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal dof region for the asymmetric two pair mimo two way relay channel")
  Member "optimal transmit power allocation for mimo two way cognitive relay networks with multiple relays":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "cyclic communication and the inseparability of mimo multi way relay channels")
  Member "divide and conquer approaching the capacity of the two pair bidirectional gaussian relay network":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "degrees of freedom of the mimo three way channel with node intermittency")
  Member "on the equal rate capacity of the awgn multiway relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "degrees of freedom of the mimo three way channel with node intermittency")

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)