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 "effective capacity of buffer aided full duplex relay systems with selection relaying"):
  Abstract: In this work, the achievable rate of three-node relay systems with selection relaying under statistical delay constraints, imposed on the limitations of the maximum end-to-end delay violation probabilities, is investigated. It is assumed that there are queues of infinite size at both the source and relay node, and the source can select the relay or destination for data reception. Given selection relaying policy, the effective bandwidth of the arrival processes of the queue at the relay is derived. Then, the maximum constant arrival rate can be identified as the maximum effective capacity as a function of the statistical end-to-end queueing delay constraints, signal-to-noise ratios (SNR) at the source and relay, the fading distributions of the links, and the relay policy. Subsequently, a relay policy that incorporates the statistical delay constraints is proposed. It is shown that the proposed relay policy can achieve better performance than existing protocols. Moreover, it is demonstrated that buffering relay model can still help improve the throughput of relay systems in the presence of statistical delay constraints and source-destination link.

Includes members:
  Member "delay constrained video transmission quality driven resource allocation and scheduling":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "effective capacity in wireless networks a comprehensive survey")
  Member "buffer aided relaying with adaptive link selection fixed and mixed rate transmission":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "performance of energy buffer aided incremental relaying in cooperative networks")
  Member "qos aware base station selections for distributed mimo links in broadband wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "effective capacity in wireless networks a comprehensive survey")
  Member "effective capacity of two hop wireless communication systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the effective capacity of an underwater acoustic channel under impersonation attack")
  Member "transmission strategies in multiple access fading channels with statistical qos constraints":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "downlink analysis of noma enabled cellular networks with 3gpp inspired user ranking")

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)