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: "spectral analysis of virus spreading in random geometric networks"
  Abstract: In this paper, we study the dynamics of a viral spreading process in random geometric graphs (RGG). The spreading of the viral process we consider in this paper is closely related with the eigenvalues of the adjacency matrix of the graph. We deduce new explicit expressions for all the moments of the eigenvalue distribution of the adjacency matrix as a function of the spatial density of nodes and the radius of connection. We apply these expressions to study the behavior of the viral infection in an RGG. Based on our results, we deduce an analytical condition that can be used to design RGG's in order to tame an initial viral infection. Numerical simulations are in accordance with our analytical predictions.

Connected through hyperedge HE-1 (induced by source paper "optimal containment of epidemics in temporal and adaptive networks"):
  with members:
    - "efficient containment of exact sir markovian processes on networks"
    - "stability of spreading processes over time varying large scale networks"
    - "epidemic processes over adaptive state dependent networks"
    - "decentralized protection strategies against sis epidemics in networks"
    - "co evolutionary dynamics in social networks a case study of twitter"
    - "an efficient curing policy for epidemics on graphs"
    - "a convex framework for optimal investment on disease awareness in social networks"
    - "optimal vaccine allocation to control epidemic outbreaks in arbitrary networks"

Connected through hyperedge HE-2 (induced by source paper "bio inspired framework for allocation of protection resources in cyber physical networks"):
  with members:
    - "stability of spreading processes over time varying large scale networks"
    - "epidemic processes over adaptive state dependent networks"
    - "worst case scenarios for greedy centrality based network protection strategies"
    - "a convex framework for optimal investment on disease awareness in social networks"
    - "optimal vaccine allocation to control epidemic outbreaks in arbitrary networks"

Connected through hyperedge HE-3 (induced by source paper "optimal vaccine allocation to control epidemic outbreaks in arbitrary networks"):
  with members:
    - "moment based spectral analysis of large scale networks using local structural information"

Connected through hyperedge HE-4 (induced by source paper "spectral control of mobile robot networks"):
  with members:
    - "distributed control of the laplacian spectral moments of a network"
    - "target assignment for robotic networks asymptotic performance under limited communication"

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.MA(Multiagent Systems)