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: "fast resource scheduling in hetnets with d2d support"
  Abstract: Resource allocation in LTE networks is known to be an NP-hard problem. In this paper, we address an even more complex scenario: an LTE-based, 2-tier heterogeneous network where D2D mode is supported under the network control. All communications (macrocell, microcell and D2D-based) share the same frequency bands, hence they may interfere. We then determine (i) the network node that should serve each user and (ii) the radio resources to be scheduled for such communication. To this end, we develop an accurate model of the system and apply approximate dynamic programming to solve it. Our algorithms allow us to deal with realistic, large-scale scenarios. In such scenarios, we compare our approach to today's networks where eICIC techniques and proportional fairness scheduling are implemented. Results highlight that our solution increases the system throughput while greatly reducing energy consumption. We also show that D2D mode can effectively support content delivery without significantly harming macrocells or microcells traffic, leading to an increased system capacity. Interestingly, we find that D2D mode can be a low-cost alternative to microcells.

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"
    - "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:
    - "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"
    - "distributed algorithms for spectrum allocation power control routing and congestion control in wireless networks"

Connected through hyperedge HE-3 (induced by source paper "real time scheduling for content broadcasting in lte"):
  with members:
    - "algorithms for enhanced inter cell interference coordination eicic in lte hetnets"

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)