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: "qos aware base station selections for distributed mimo links in broadband wireless networks"
  Abstract: We propose the QoS-aware BS-selection schemes for the distributed wireless MIMO links, which aim at minimizing the BS usages and reducing the interfering range, while satisfying diverse statistical delay-QoS constraints characterized by the delay-bound violation probability and the effective capacity technique. In particular, based on the channel state information (CSI) and QoS requirements, a subset of BS with variable cardinality for the distributed MIMO transmission is dynamically selected, where the selections are controlled by a central server. For the single-user scenario, we develop two optimization frameworks, respectively, to derive the efficient BS-selection schemes and the corresponding resource allocation algorithms. One framework uses the incremental BS-selection and time-sharing (IBS-TS) strategies, and the other employs the ordered-gain based BS-selection and probabilistic transmissions (OGBS-PT). The IBS-TS framework can yield better performance, while the scheme developed under the OGBS-PT framework is easier to implement. For the multi-user scenario, we propose the optimization framework applying the priority BS-selection, block-diagonalization precoding, and probabilistic transmission (PBS-BD-PT) techniques. We also propose the optimization framework applying the priority BS-selection, time-division-multiple-access, and probabilistic transmission (PBS-TDMA-PT) techniques. We derive the optimal transmission schemes for all the aforementioned frameworks, respectively. Also conducted is a set of simulation evaluations which compare our proposed schemes with several baseline schemes and show the impact of the delay-QoS requirements, transmit power, and traffic loads on the performances of BS selections for distributed MIMO systems.

Connected through hyperedge HE-1 (induced by source paper "effective capacity in wireless networks a comprehensive survey"):
  with members:
    - "ultra reliable and low latency wireless communication tail risk and scale"
    - "performance analysis of noma for ultra reliable and low latency communications"
    - "wireless access for ultra reliable low latency communication urllc principles and building blocks"
    - "secure transmission of delay sensitive data over wireless fading channels"
    - "energy efficient ofdma networks maintaining statistical qos guarantees for delay sensitive traffic"
    - "statistical qos analysis of full duplex and half duplex heterogeneous cellular networks"
    - "effective capacity of retransmission schemes a recurrence relation approach"
    - "backlog and delay reasoning in harq systems"

Connected through hyperedge HE-2 (induced by source paper "joint spectrum allocation and structure optimization in green powered heterogeneous cognitive radio networks"):
  with members:
    - "backhaul aware user association and resource allocation for energy constrained hetnets"
    - "toward hierarchical mobile edge computing an auction based profit maximization approach"
    - "wireless networks with energy harvesting and power transfer joint power and time allocation"
    - "optimal cooperative power allocation for energy harvesting enabled relay networks"
    - "joint spectrum and power allocation for multi node cooperative wireless systems"
    - "on green energy powered cognitive radio networks"
    - "maximizing system throughput by cooperative sensing in cognitive radio networks"

Connected through hyperedge HE-3 (induced by source paper "energy efficient ofdma networks maintaining statistical qos guarantees for delay sensitive traffic"):
  with members:
    - "distributed energy spectral efficiency optimization for partial full interference alignment in multi user multi relay multi cell mimo systems"
    - "large scale mimo is capable of eliminating power thirsty channel coding for wireless transmission of hevc h 265 video"
    - "spectral and energy spectral efficiency optimization of joint transmit and receive beamforming based multi relay mimo ofdma cellular networks"
    - "maximizing energy efficiency in multi relay ofdma cellular networks"
    - "achieving maximum energy efficiency in multi relay ofdma cellular networks a fractional programming approach"
    - "statistical delay control and qos driven power allocation over two hop wireless relay links"
    - "the impact of qos constraints on the energy efficiency of fixed rate wireless transmissions"

Connected through hyperedge HE-4 (induced by source paper "effective capacity of buffer aided full duplex relay systems with selection relaying"):
  with members:
    - "delay constrained video transmission quality driven resource allocation and scheduling"
    - "buffer aided relaying with adaptive link selection fixed and mixed rate transmission"
    - "effective capacity of two hop wireless communication systems"
    - "transmission strategies in multiple access fading channels with statistical qos constraints"

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)