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 "high degree vertices and spread of infections in spatially modelled social networks"):
  Abstract: We examine how the behaviour of high degree vertices in a network affects whether an infection spreads through communities or jumps between them. We study two stochastic susceptible-infected-recovered (SIR) processes and represent our network with a spatial preferential attachment (SPA) network. In one of the two epidemic scenarios we adjust the contagiousness of high degree vertices so that they are less contagious. We show that, for this scenario, the infection travels through communities rather than jumps between them. We conjecture that this is not the case in the other scenario, when contagion is independent of the degree of the originating vertex. Our theoretical results and conjecture are supported by simulations.

Includes members:
  Member "rumours spread slowly in a small world spatial network":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "justifying the small world phenomenon via random recursive trees")
  Member "generalized communities in networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "analysis of large sparse graphs using regular decomposition of graph distance matrices")
  Member "geometric graph properties of the spatial preferred attachment model":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "rumours spread slowly in a small world spatial network")

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)