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 "robustness and algebraic connectivity of random interdependent networks"):
  Abstract: We investigate certain structural properties of random interdependent networks. We start by studying a property known as $r$-robustness, which is a strong indicator of the ability of a network to tolerate structural perturbations and dynamical attacks. We show that random $k$-partite graphs exhibit a threshold for $r$-robustness, and that this threshold is the same as the one for the graph to have minimum degree $r$. We then extend this characterization to random interdependent networks with arbitrary intra-layer topologies. Finally, we characterize the algebraic connectivity of such networks, and provide an asymptotically tight rate of growth of this quantity for a certain range of inter-layer edge formation probabilities. Our results arise from a characterization of the isoperimetric constant of random interdependent networks, and yield new insights into the structure and robustness properties of such networks.

Includes members:
  Member "on the strengths of connectivity and robustness in general random intersection graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "k connectivity in random key graphs with unreliable links")
  Member "exact recovery in the stochastic block model":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "renyi entropy bounds on the active learning cost performance tradeoff")
  Member "improved cheeger s inequality analysis of spectral partitioning algorithms through higher order spectral gap":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "efficient algorithms for the potts model on small set expanders")
  Member "graph spectra and the detectability of community structure in networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fragility of spectral clustering for networks with an overlapping structure")
  Member "iterative approximate byzantine consensus in arbitrary directed graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "grand challenges of resilience autonomous system resilience through design and runtime measures")

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)