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: "topological fidelity in sensor networks"
  Abstract: Sensor Networks are inherently complex networks, and many of their associated problems require analysis of some of their global characteristics. These are primarily affected by the topology of the network. We present in this paper, a general framework for a topological analysis of a network, and develop distributed algorithms in a generalized combinatorial setting in order to solve two seemingly unrelated problems, 1) Coverage hole detection and Localization and 2) Worm hole attack detection and Localization. We also note these solutions remain coordinate free as no priori localization information of the nodes is assumed. For the coverage hole problem, we follow a "divide and conquer approach", by strategically dissecting the network so that the overall topology is preserved, while efficiently pursuing the detection and localization of failures. The detection of holes, is enabled by first attributing a combinatorial object called a "Rips Complex" to each network segment, and by subsequently checking the existence/non-existence of holes by way of triviality of the first homology class of this complex. Our estimate exponentially approaches the location of potential holes with each iteration, yielding a very fast convergence coupled with optimal usage of valuable resources such as power and memory. We then show a simple extension of the above problem to address a well known problem in networks, namely the localization of a worm hole attack. We demonstrate the effectiveness of the presented algorithm with several substantiating examples.

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)