human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "contagions in social networks effects of monophilic contagion friendship paradox and reactive networks"):
  Abstract: We consider SIS contagion processes over networks where, a classical assumption is that individuals' decisions to adopt a contagion are based on their immediate neighbors. However, recent literature shows that some attributes are more correlated between two-hop neighbors, a concept referred to as monophily. This motivates us to explore monophilic contagion, the case where a contagion (e.g. a product, disease) is adopted by considering two-hop neighbors instead of immediate neighbors (e.g. you ask your friend about the new iPhone and she recommends you the opinion of one of her friends). We show that the phenomenon called friendship paradox makes it easier for the monophilic contagion to spread widely. We also consider the case where the underlying network stochastically evolves in response to the state of the contagion (e.g. depending on the severity of a flu virus, people restrict their interactions with others to avoid getting infected) and show that the dynamics of such a process can be approximated by a differential equation whose trajectory satisfies an algebraic constraint restricting it to a manifold. Our results shed light on how graph theoretic consequences affect contagions and, provide simple deterministic models to approximate the collective dynamics of contagions over stochastic graph processes.

Includes members:
  Member "what do your friends think efficient polling methods for networks using friendship paradox":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "information diffusion in social networks friendship paradox based models and statistical inference")
  Member "centrality friendship paradoxes when our friends are more important than us":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "information diffusion in social networks friendship paradox based models and statistical inference")
  Member "which friends are more popular than you contact strength and the friendship paradox in social networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "information diffusion in social networks friendship paradox based models and statistical inference")
  Member "influence maximization over markovian graphs a stochastic optimization approach":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "information diffusion in social networks friendship paradox based models and statistical inference")
  Member "the happiness paradox your friends are happier than you":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "information diffusion in social networks friendship paradox based models and statistical inference")
  Member "tracking infection diffusion in social networks filtering algorithms and threshold bounds":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "information diffusion in social networks friendship paradox based models and statistical inference")
  Member "scalable methods for adaptively seeding a social network":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "time constrained adaptive influence maximization")
  Member "friendship paradox redux your friends are more interesting than you":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "information diffusion in social networks friendship paradox based models and statistical inference")

Question: Please tell me which class the source paper 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)