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: "dynamic monopolies in colored tori"
  Abstract: The {\em information diffusion} has been modeled as the spread of an information within a group through a process of social influence, where the diffusion is driven by the so called {\em influential network}. Such a process, which has been intensively studied under the name of {\em viral marketing}, has the goal to select an initial good set of individuals that will promote a new idea (or message) by spreading the "rumor" within the entire social network through the word-of-mouth. Several studies used the {\em linear threshold model} where the group is represented by a graph, nodes have two possible states (active, non-active), and the threshold triggering the adoption (activation) of a new idea to a node is given by the number of the active neighbors. #R##N#The problem of detecting in a graph the presence of the minimal number of nodes that will be able to activate the entire network is called {\em target set selection} (TSS). In this paper we extend TSS by allowing nodes to have more than two colors. The multicolored version of the TSS can be described as follows: let $G$ be a torus where every node is assigned a color from a finite set of colors. At each local time step, each node can recolor itself, depending on the local configurations, with the color held by the majority of its neighbors. We study the initial distributions of colors leading the system to a monochromatic configuration of color $k$, focusing on the minimum number of initial $k$-colored nodes. We conclude the paper by providing the time complexity to achieve the monochromatic configuration.

Connected through hyperedge HE-1 (induced by source paper "minimum weight dynamo and fast opinion spreading"):
  with members:
    - "time varying graphs and dynamic networks"
    - "dynamic monopolies with randomized starting configuration"

Connected through hyperedge HE-2 (induced by source paper "rooting opinions in the minds a cognitive model and a formal account of opinions and their dynamics"):
  with members:
    - "time varying graphs and social network analysis temporal indicators and metrics"
    - "emergence through selection the evolution of a scientific challenge"
    - "time varying graphs and dynamic networks"
    - "multicolored dynamos on toroidal meshes"
    - "selection in scientific networks"

Connected through hyperedge HE-3 (induced by source paper "understanding opinions a cognitive and formal account"):
  with members:
    - "time varying graphs and social network analysis temporal indicators and metrics"
    - "emergence through selection the evolution of a scientific challenge"
    - "time varying graphs and dynamic networks"
    - "multicolored dynamos on toroidal meshes"
    - "selection in scientific networks"

Connected through hyperedge HE-4 (induced by source paper "opinions within media power and gossip"):
  with members:
    - "time varying graphs and social network analysis temporal indicators and metrics"
    - "time varying graphs and dynamic networks"
    - "multicolored dynamos on toroidal meshes"

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)