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 "wireless network level partial relay cooperation a stable throughput analysis"):
  Abstract: In this work, we study the benefit of partial relay cooperation. We consider a two-node system consisting of one source and one relay node transmitting information to a common destination. The source and the relay have external traffic and in addition, the relay is equipped with a flow controller to regulate the incoming traffic from the source node. The cooperation is performed at the network level. A collision channel with erasures is considered. We provide an exact characterization of the stability region of the system and we also prove that the system with partial cooperation is always better or at least equal to the system without the flow controller.

Includes members:
  Member "relay selection in cooperative power line communication a multi armed bandit approach":
    also connected through other hyperedges:
      (none)
  Member "wireless energy harvesting in a cognitive relay network":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "interplay between noma and other emerging technologies a survey")
  Member "energy aware wireless relay selection in load coupled ofdma cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a note on decoding order in optimizing multi cell noma")
  Member "probabilistic cooperation of a full duplex relay in random access networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "secure communications for the two user broadcast channel with random traffic")
  Member "on the stability of random multiple access with stochastic energy harvesting":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "proportional fairness in aloha networks with rf energy harvesting")
  Member "effect of energy harvesting on stable throughput in cooperative relay systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a random access g network stability stable throughput and queueing analysis")
  Member "relay assisted multiple access with full duplex multi packet reception":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "wireless caching helper system with heterogeneous traffic and random availability")
  Member "5g cellular key enabling technologies and research challenges":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "distributed artificial intelligence solution for d2d communication in 5g networks")

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)