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 "spectral and energy efficiency in 3 way relay channels with circular message exchanges"):
  Abstract: Spectral and energy efficiency in 3-way relay channels are studied in this paper. First, achievable sum rate expressions for 3-way relay channels are derived for different relaying protocols. Moreover, an outer bound for the capacity of the 3-way relay channel is presented. Next, leveraging the derived achievable sum rate expressions, two algorithms for joint power allocation at the users and at the relay are designed so as to maximize the system energy efficiency. Numerical results are provided to corroborate and provide insight on the theoretical findings.

Includes members:
  Member "energy efficiency optimization in relay assisted mimo systems with perfect and statistical csi":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "energy efficiency fairness for multi pair wireless powered relaying systems")
  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 "the approximate capacity region of the gaussian y channel":
    also connected through other hyperedges:
      (none)
  Member "framework for link level energy efficiency optimization with informed transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "distributed power control with partial channel state information performance characterization and design")
  Member "the multi way relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "multi agent reinforcement learning for energy harvesting two hop communications with full cooperation")
  Member "capacity theorems for the awgn multi way relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "three way channels with multiple unicast sessions capacity approximation via network transformation")
  Member "noisy network coding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "an information theoretic analysis of the gaussian multicast channel with interactive user cooperation")

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)