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: "using crowd sourcing for local topology discovery in wireless networks"
  Abstract: AbstractIn modern wireless networks, the problem of topology discovery is hardto solve, because of the lack of a central intelligence with full knowledgeof the location and parameters of the wireless devices. We introduce theidea of estimating the local topology by means of user reports.We provide a crisp mathematical formulation of the problem in thecase of a simple mobility model, dimensioning the number of users for thediscovery to be eﬀective.Finally, we show that, under certain conditions, our mobility modelcan eﬀectively be used to provide an upper bound on the numberof reportsneeded to discover the local topology, for a wide range of mobility models. 1 Introduction Topology Discovery ( TD ) is a widely studied topic in graph theory [5]. Moti-vated by the need of modeling the Internet, TD has soon become a trendingtopic, see e.g. [1]. In modern wireless networks TD is even more crucial be-cause these networks are often deployed in an unplanned, decentralised manner.The knowledge of the network topology allows to design eﬃcient routing andinterference-avoidance algorithms. In this paper we focus on the problem of Lo-cal Topology Discovery (

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)