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 "performance analysis of a cooperative wireless network with adaptive relays"):
  Abstract: Abstract   In this work, we investigate a slotted-time relay assisted cooperative random access wireless network with multipacket (MPR) reception capabilities. MPR refers to the capability of a wireless node to successfully receive packets from more than two other modes that transmit simultaneously at the same slot. We consider a network of N saturated sources that transmit packets to a common destination node with the cooperation of two infinite capacity relay nodes. The relays assist the sources by forwarding the packets that failed to reach the destination. Moreover, the relays have also packets of their own to transmit to the destination. We further assume that the relays employ a state-dependent retransmission control mechanism. In particular, a relay node accordingly adapts its transmission probability based on the status of the other relay. Such a protocol is towards self-aware networks and leads to substantial performance gains in terms of delay. We investigate the stability region and the throughput performance for the full MPR model. Moreover, for the asymmetric two-sources, two-relay case we derive the generating function of the stationary joint queue-length distribution with the aid of the theory of boundary value problems. For the symmetric case, we obtain explicit expressions for the average queueing delay in a relay node without solving a boundary value problem. Extensive numerical examples are presented and provide insights on the system performance.

Includes members:
  Member "network level cooperation in random access iot networks with aggregators":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a random access g network stability stable throughput and queueing analysis")
  Member "stable throughput and delay analysis of a random access network with queue aware transmission":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a random access g network stability stable throughput and queueing analysis")
  Member "wireless network level partial relay cooperation a stable throughput analysis":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cooperative asynchronous non orthogonal multiple access with power minimization under qos constraints")
  Member "random access in c ran for user activity detection with limited capacity fronthaul":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a dimension reduction based joint activity detection and channel estimation algorithm for massive access")
  Member "relay assisted multiple access with full duplex multi packet reception":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "wireless caching helper system with heterogeneous traffic and random availability")
  Member "analysis of an offloading scheme for data centers in the framework of fog computing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "all one needs to know about fog computing and related edge computing paradigms a complete survey")
  Member "network level performance evaluation of a two relay cooperative random access wireless system":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the benefits of network level cooperation in millimeter wave communications")
  Member "network level cooperation in energy harvesting wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the benefits of network level cooperation in iot networks with aggregators")

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)