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: "slow adaptive ofdma systems through chance constrained programming"
  Abstract: Adaptive orthogonal frequency division multiple access (OFDMA) has recently been recognized as a promising technique for providing high spectral efficiency in future broadband wireless systems. The research over the last decade on adaptive OFDMA systems has focused on adapting the allocation of radio resources, such as subcarriers and power, to the instantaneous channel conditions of all users. However, such “fast” adaptation requires high computational complexity and excessive signaling overhead. This hinders the deployment of adaptive OFDMA systems worldwide. This paper proposes a slow adaptive OFDMA scheme, in which the subcarrier allocation is updated on a much slower timescale than that of the fluctuation of instantaneous channel conditions. Meanwhile, the data rate requirements of individual users are accommodated on the fast timescale with high probability, thereby meeting the requirements except occasional outage. Such an objective has a natural chance constrained programming formulation, which is known to be intractable. To circumvent this difficulty, we formulate safe tractable constraints for the problem based on recent advances in chance constrained programming. We then develop a polynomial-time algorithm for computing an optimal solution to the reformulated problem. Our results show that the proposed slow adaptation scheme drastically reduces both computational cost and control signaling overhead when compared with the conventional fast adaptive OFDMA. Our work can be viewed as an initial attempt to apply the chance constrained programming methodology to wireless system designs. Given that most wireless systems can tolerate an occasional dip in the quality of service, we hope that the proposed methodology will find further applications in wireless communications.

Connected through hyperedge HE-1 (induced by source paper "energy efficient scheduling and power allocation in downlink ofdma networks with base station coordination"):
  with members:
    - "what will 5g be"
    - "fundamental limits of cooperation"
    - "framework for link level energy efficiency optimization with informed transmitter"
    - "energy efficient precoding for multiple antenna terminals"
    - "introducing hierarchy in energy games"
    - "energy efficient communications in cdma networks a game theoretic analysis considering operating costs"

Connected through hyperedge HE-2 (induced by source paper "optimal stochastic coordinated beamforming for wireless cooperative networks with csi uncertainty"):
  with members:
    - "topological interference management through index coding"
    - "group sparse beamforming for green cloud ran"
    - "low complexity delay constrained beamforming for multi user mimo systems with imperfect csit"
    - "network mimo with linear zero forcing beamforming large system analysis impact of channel estimation and reduced complexity scheduling"
    - "fundamental limits of cooperation"
    - "robust monotonic optimization framework for multicell miso systems"
    - "mimo interference alignment over correlated channels with imperfect csi"
    - "completely stale transmitter channel state information is still very useful"

Connected through hyperedge HE-3 (induced by source paper "low complexity delay constrained beamforming for multi user mimo systems with imperfect csit"):
  with members:
    - "solving pomdps by searching the space of finite policies"
    - "delay aware bs discontinuous transmission control and user scheduling for energy harvesting downlink coordinated mimo systems"
    - "a survey on delay aware resource control for wireless systems large deviation theory stochastic lyapunov drift and distributed stochastic learning"
    - "queue aware dynamic clustering and power allocation for network mimo systems via distributed stochastic learning"
    - "probabilistic sinr constrained robust transmit beamforming a bernstein type inequality based conservative approach"
    - "a convex approximation approach to weighted sum rate maximization of multiuser miso interference channel under outage constraints"

Connected through hyperedge HE-4 (induced by source paper "robust power allocation for energy efficient location aware networks"):
  with members:
    - "performance analysis of heterogeneous feedback design in an ofdma downlink with partial and imperfect feedback"
    - "target localization accuracy gain in mimo radar based systems"
    - "fundamental limits of wideband localization part ii cooperative networks"
    - "fundamental limits of wideband localization part i a general framework"
    - "distributed sensor localization in random environments using minimal number of anchor nodes"

Connected through hyperedge HE-5 (induced by source paper "probability constrained power optimization for multiuser miso systems with imperfect csi a bernstein approximation approach"):
  with members:
    - "robust linear precoder design for multi cell downlink transmission"

Connected through hyperedge HE-6 (induced by source paper "feedback allocation for ofdma systems with slow frequency domain scheduling"):
  with members:
    - "opportunistic scheduling and beamforming for mimo ofdma downlink systems with reduced feedback"

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.NI(Networking and Internet Architecture)