human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "a random access g network stability stable throughput and queueing analysis"):
  with members:
    - "stable throughput region of the two user interference channel"
    - "network level cooperation in random access iot networks with aggregators"
    - "optimal energy distribution with energy packet networks"
    - "stable throughput and delay analysis of a random access network with queue aware transmission"
    - "towards a cognitive routing engine for software defined networks"
    - "effect of energy harvesting on stable throughput in cooperative relay systems"
    - "relay assisted multiple access with full duplex multi packet reception"
    - "adaptive dispatching of tasks in the cloud"

Connected through hyperedge HE-2 (induced by source paper "on the benefits of network level cooperation in iot networks with aggregators"):
  with members:
    - "iot u cellular internet of things networks over unlicensed spectrum"
    - "network level cooperation in random access iot networks with aggregators"
    - "performance analysis of uplink cellular iot using different deployments of data aggregators"
    - "on the benefits of network level cooperation in millimeter wave communications"
    - "aggregation and resource scheduling in machine type communication networks a stochastic geometry approach"
    - "wireless network level partial relay cooperation a stable throughput analysis"
    - "massive machine type communication with data aggregation and resource scheduling"
    - "effect of energy harvesting on stable throughput in cooperative relay systems"

Connected through hyperedge HE-3 (induced by source paper "on the analysis of partially homogeneous nearest neighbour random walks in the quarter plane"):
  with members:
    - "stability conditions for a decentralised medium access algorithm single and multi hop networks"
    - "stable throughput and delay analysis of a random access network with queue aware transmission"
    - "queue based random access algorithms fluid limits and stability issues"

Question: Please tell me which class the center node 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)