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: "a centralized metropolitan scale radio resource management scheme"
  Abstract: This work studies centralized radio resource management in metropolitan area networks with a very large number of access points and user devices. A central controller collects time-averaged traffic and channel conditions from all access points and coordinates spectrum allocation, user association, and power control throughout the network on an appropriate timescale. The timescale is conceived to be seconds in today's networks, and it is likely to become faster in the future. The coordination problem in each time epoch is formulated as a network utility maximization problem, where any subset of access points may use any parts of the spectrum to serve any subsets of devices. It is proved that the network utility can be maximized by an extremely sparse spectrum allocation. By exploiting this sparsity, an efficient iterative algorithm with guaranteed convergence is developed, each iteration of which is performed in closed form. The proposed centralized optimization framework can incorporate a broad class of utility functions that account for weighted sum rates, average packet delay, and/or energy consumption, along with very general constraints on transmission powers. Numerical results demonstrate the feasibility of the algorithm for networks with up to 1,000 access points and several thousand devices. Moreover, the proposed scheme yields significantly improved throughput region and average packet delay comparing with several well-known competing schemes.

Connected through hyperedge HE-1 (induced by source paper "optimization of mimo device to device networks via matrix fractional programming a minorization maximization approach"):
  with members:
    - "fractional programming for communication systems part i power control and beamforming"
    - "fractional programming for communication systems part ii uplink scheduling via matching"
    - "optimality of treating interference as noise a combinatorial perspective"
    - "fast resource scheduling in hetnets with d2d support"
    - "traffic driven spectrum allocation in heterogeneous networks"
    - "distributed algorithms for spectrum allocation power control routing and congestion control in wireless networks"

Connected through hyperedge HE-2 (induced by source paper "coordinated scheduling and spectrum sharing via matrix fractional programming"):
  with members:
    - "fractional programming for communication systems part i power control and beamforming"
    - "fractional programming for communication systems part ii uplink scheduling via matching"
    - "optimality of treating interference as noise a combinatorial perspective"
    - "fast resource scheduling in hetnets with d2d support"
    - "distributed algorithms for spectrum allocation power control routing and congestion control in wireless networks"

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)