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: "globally optimal selection of ground stations in satellite systems with site diversity"
  Abstract: The availability of satellite communication systems is extremely limited by atmospheric impairments, such as rain (for radio frequencies) and cloud coverage (for optical frequencies). A solution to this problem is the site diversity technique, where a network of geographically distributed ground stations (GSs) can ensure, with high probability, that at least one GS is available for connection to the satellite at each time period. However, the installation of redundant GSs induces unnecessary additional costs for the network operator. In this context, we study an optimization problem that minimizes the number of required GSs, subject to availability constraints. First, the problem is transformed into a binary-integer-linear-programming (BILP) problem, which is proven to be NP-hard. Subsequently, we design a branch-and-bound (B&B) algorithm, with global-optimization guarantee, based on the linear-programming (LP) relaxation and a greedy method as well. Finally, numerical results show that the proposed algorithm significantly outperforms state-of-the-art methods, and has low complexity in the average case.

Connected through hyperedge HE-1 (induced by source paper "on the computation and approximation of outage probability in satellite networks with smart gateway diversity"):
  with members:
    - "dynamic energy efficient power allocation in multibeam satellite systems"

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)