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 "analysis of contagion maps on a class of networks that are spatially embedded in a torus"):
  Abstract: A spreading process on a network is influenced by the network's underlying spatial structure, and it is insightful to study the extent to which a spreading process follows such structure. We consider a threshold contagion on a network whose nodes are embedded in a manifold and which has both `geometric edges', which respect the geometry of the underlying manifold, and `non-geometric edges' that are not constrained by that geometry. Building on ideas from Taylor et al. \cite{Taylor2015}, we examine when a contagion propagates as a wave along a network whose nodes are embedded in a torus and when it jumps via long non-geometric edges to remote areas of the network. We build a `contagion map' for a contagion spreading on such a `noisy geometric network' to produce a point cloud; and we study the dimensionality, geometry, and topology of this point cloud to examine qualitative properties of this spreading process. We identify a region in parameter space in which the contagion propagates predominantly via wavefront propagation. We consider different probability distributions for constructing non-geometric edges --- reflecting different decay rates with respect to the distance between nodes in the underlying manifold --- and examine how qualitative spreading dynamics are affected by these choices. Our work generalizes the analysis in Taylor et al. and consolidates contagion maps both as a tool for investigating spreading behavior on spatial networks and as a technique for manifold learning. Moreover, we incorporate an approach for calibrating persistent-homology barcodes of different scales. This approach is applicable in various other applications that use persistent homology, and the Wasserstein distance between barcodes in particular.

Includes members:
  Member "geometry helps to compare persistence diagrams":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "progressive wasserstein barycenters of persistence diagrams")
  Member "complex contagions in kleinberg s small world model":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the routing of complex contagion in kleinberg s small world networks")
  Member "multi stage complex contagions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "computational human dynamics")
  Member "sustaining the internet with hyperbolic mapping":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "hyperkg hyperbolic knowledge graph embeddings for knowledge base completion")

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)