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: "efficient construction of dominating set in wireless networks"
  Abstract: Considering a communication topology of a wireless network modeled by a graph where an edge exists between two nodes if they are within each other's communication range. A subset $U$ of nodes is a dominating set if each node is either in $U$ or adjacent to some node in $U$. Assume each node has a disparate communication range and is associated with a positive weight, we present a randomized algorithm to find a min-weight dominating set. Considering any orientation of the graph where an arc $\overrightarrow{uv}$ exists if the node $v$ lies in $u$'s communication range. A subset $U$ of nodes is a strongly dominating set if every node except $U$ has both in-neighbor(s) and out-neighbor(s) in $U$. We present a polynomial-time algorithm to find a strongly dominating set of size at most $(2+\epsilon)$ times of the optimum. We also investigate another related problem called $K$-Coverage. Given are a set ${\cal D}$ of disks with positive weight and a set ${\cal P}$ of nodes. Assume all input nodes lie below a horizontal line $l$ and all input disks lie above this line $l$ in the plane. The objective is to find a min-weight subset ${\cal D}'\subseteq {\cal D}$ of disks such that each node is covered at least $K$ disks in ${\cal D}'$. We propose a novel two-approximation algorithm for this problem.

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)