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: "distributed algorithms for spectrum allocation power control routing and congestion control in wireless networks"
  Abstract: We develop distributed algorithms to allocate resources in multi-hop wireless networks with the aim of minimizing the total cost. In order to observe the fundamental duplexing constraint that co-located transmitters and receivers cannot operate simultaneously on the same frequency band, we first devise a spectrum allocation scheme that divides the whole spectrum into multiple sub-bands and activates conflict-free links on each sub-band. We show that the minimum number of required sub-bands grows asymptotically at a logarithmic rate with the chromatic number of network connectivity graph. A simple distributed and asynchronous algorithm is developed to feasibly activate links on the available sub-bands. Given a feasible spectrum allocation, we then develop node-based distributed algorithms for optimally controlling the transmission powers on active links for each sub-band, jointly with traffic routes and user input rates in response to channel states and traffic demands. We show that under specified conditioans, the algorithms asymptotically converge to the optimal operating point.

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:
    - "a centralized metropolitan scale radio resource management scheme"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "coordinated scheduling and spectrum sharing via matrix fractional programming"):
  with members:
    - "a centralized metropolitan scale radio resource management scheme"
    - "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"

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)