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 "multi way information exchange over completely connected interference networks with a multi antenna relay"):
  Abstract: This paper considers a fully-connected interference network with a relay in which multiple users equipped with a single antenna want to exchange multiple unicast messages with other users in the network by sharing the relay equipped with multiple antennas. For such a network, the degrees of freedom (DoF) are derived by considering various message exchange scenarios: a multi-user fully-connected Y channel, a two-pair two-way interference channel with the relay, and a two-pair two-way X channel with the relay. Further, considering distributed relays employing a single antenna in the two-way interference channel and the three-user fully-connected Y channel, achievable sum-DoF are also derived in the two-way interference channel and the three-user fully-connected Y channel. A major implication of the derived DoF results is that a relay with multiple antennas or multiple relays employing a single antenna increases the capacity scaling law of the multi-user interference network when multiple directional information flows are considered, even if the networks are fully-connected and all nodes operate in half-duplex. These results reveal that the relay is useful in the multi-way interference network with practical considerations.

Includes members:
  Member "two way interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "two way function computation")
  Member "degrees of freedom of two hop wireless networks everyone gets the entire cake":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "opportunistic network decoupling with virtual full duplex operation in multi source interfering relay networks")
  Member "divide and conquer approaching the capacity of the two pair bidirectional gaussian relay network":
    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 "outer bounds for the capacity region of a gaussian two way relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the dof of two way 2 2 2 relay networks with or without relay caching")
  Member "index coding an interference alignment perspective":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "conditional disclosure of secrets a noise and signal alignment approach")
  Member "not too delayed csit achieves the optimal degrees of freedom":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "degrees of freedom and achievable rate of wide band multi cell multiple access channels with no csit")
  Member "the capacity region of multiway relay channels over finite fields with full data exchange":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the single uniprior index coding problem the single sender case and the multi sender extension")
  Member "on the sum capacity of the y channel":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "space time physical layer network coding")

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)