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 "energy efficient resource allocation for hybrid bursty services in multi relay ofdm networks"):
  Abstract: In this paper, we propose mapped two-way water filling (MTWF) scheme to maximize energy efficiency (EE) for hybrid bursty services with quality of services (QoS) requirements in two-way multirelay (TWMR) OFDM networks. The bursty traffic is first analyzed by strictly proved equivalent homogeneous Poisson process, based on which the QoS requirements are converted into sum-rate constraints. The formulated non-convex EE maximization problem, including subcarrier assignment, relay selection (RS) and rate allocation, is NP-hard involving combinatorial optimization. To conduct optimal RS on each subcarrier without priori bursty traffic knowledge, we utilize some approximate relationships under high data rate demands to remove its dependence on two-way data rates, and simplify the whole optimization problem as well. After the optimal channel configuration is obtained, which only depends on channel conditions, subcarrier assignment is attained through elitist selection genetic algorithm (ESGA), and rate allocation of each service is fulfilled by deducing two-way water filling principle. A new equivalent optimization objective function is proposed next as the simple evaluating index in ESGA to reduce complexity. Finally, simulations are carried out to verify the superiority and convergence of our scheme, as well as the applicability for different scenarios.

Includes members:
  Member "spectral and energy spectral efficiency optimization of joint transmit and receive beamforming based multi relay mimo ofdma cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "low complexity downlink user selection for massive mimo systems")
  Member "achieving maximum energy efficiency in multi relay ofdma cellular networks a fractional programming approach":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "twin timescale radio resource management for ultra reliable and low latency vehicular networks")
  Member "relay selection with network coding in two way relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "distributed topology design for network coding deployed large scale sensor networks")
  Member "physical network coding in two way wireless relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "coherent detection for short packet physical layer network coding with fsk modulation")

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)