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: "optimal vaccine allocation to control epidemic outbreaks in arbitrary networks"
  Abstract: We consider the problem of controlling the propagation of an epidemic outbreak in an arbitrary contact network by distributing vaccination resources throughout the network. We analyze a networked version of the Susceptible-Infected-Susceptible (SIS) epidemic model when individuals in the network present different levels of susceptibility to the epidemic. In this context, controlling the spread of an epidemic outbreak can be written as a spectral condition involving the eigenvalues of a matrix that depends on the network structure and the parameters of the model. We study the problem of finding the optimal distribution of vaccines throughout the network to control the spread of an epidemic outbreak. We propose a convex framework to find cost-optimal distribution of vaccination resources when different levels of vaccination are allowed. We also propose a greedy approach with quality guarantees for the case of all-or-nothing vaccination. We illustrate our approaches with numerical simulations in a real social network.

Connected through hyperedge HE-1 (induced by source paper "transient dynamics of epidemic spreading and its mitigation on large networks"):
  with members:
    - "on the dynamics of deterministic epidemic propagation over networks"
    - "campaigning in heterogeneous social networks optimal control of si information epidemics"
    - "analysis of exact and approximated epidemic models over complex networks"
    - "optimal patching in clustered malware epidemics"
    - "optimal energy aware epidemic routing in dtns"
    - "approximation algorithms for reducing the spectral radius to control epidemic spread"

Connected through hyperedge HE-2 (induced by source paper "optimal control of complex systems through variational inference with a discrete event decision process"):
  with members:
    - "reinforcement learning and control as probabilistic inference tutorial and review"
    - "continuous control with deep reinforcement learning"
    - "coevolve a joint point process model for information diffusion and network co evolution"
    - "belief propagation for structured decision making"
    - "new inference strategies for solving markov decision processes using reversible jump mcmc"
    - "efficient inference in markov control problems"

Connected through hyperedge HE-3 (induced by source paper "efficient containment of exact sir markovian processes on networks"):
  with members:
    - "stability of spreading processes over time varying large scale networks"
    - "epidemic processes over adaptive state dependent networks"
    - "optimal patching in clustered malware epidemics"
    - "when is a network epidemic hard to eliminate"

Connected through hyperedge HE-4 (induced by source paper "priority maps for surveillance and intervention of wildfires and other spreading processes"):
  with members:
    - "minimum energy control for complex networks"
    - "on existence of separable contraction metrics for monotone nonlinear systems"
    - "persistent robotic tasks monitoring and sweeping in changing environments"

Connected through hyperedge HE-5 (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"
    - "spectral analysis of virus spreading in random geometric networks"

Connected through hyperedge HE-6 (induced by source paper "outward influence and cascade size estimation in billion scale networks"):
  with members:
    - "stop and stare optimal sampling algorithms for viral marketing in billion scale networks"
    - "multiple infection sources identification with provable guarantees"
    - "influence maximization near optimal time complexity meets practical efficiency"
    - "sketch based influence maximization and computation scaling up with guarantees"
    - "scalable influence estimation in continuous time diffusion networks"
    - "maximizing social influence in nearly optimal time"

Connected through hyperedge HE-7 (induced by source paper "the stochastic firefighter problem"):
  with members:
    - "when is a network epidemic hard to eliminate"

Connected through hyperedge HE-8 (induced by source paper "protection of complex networks against sir spreading processes"):
  with members:
    - "stability of spreading processes over time varying large scale networks"
    - "epidemic processes over adaptive state dependent networks"
    - "optimal patching in clustered malware epidemics"
    - "cost optimal switching protection strategy in adaptive networks"
    - "when is a network epidemic hard to eliminate"

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.SI(Social and Information Networks)