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 "community detection in hypergraphs spiked tensor models and sum of squares"):
  Abstract: We study the problem of community detection in hypergraphs under a stochastic block model. Similarly to how the stochastic block model in graphs suggests studying spiked random matrices, our model motivates investigating statistical and computational limits of exact recovery in a certain spiked tensor model. In contrast with the matrix case, the spiked model naturally arising from community detection in hypergraphs is different from the one arising in the so-called tensor Principal Component Analysis model. We investigate the effectiveness of algorithms in the Sum-of-Squares hierarchy on these models. Interestingly, our results suggest that these two apparently similar models exhibit significantly different computational to statistical gaps.

Includes members:
  Member "community recovery in hypergraphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "crowdsourced classification with xor queries fundamental limits and an efficient algorithm")
  Member "certifying random polynomials over the unit sphere via sum of squares hierarchy":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "strongly refuting random csps below the spectral threshold")
  Member "semidefinite programs on sparse random graphs and their application to community detection":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "computational hardness of certifying bounds on constrained pca problems")
  Member "tensor principal component analysis via sum of squares proofs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "computational hardness of certifying bounds on constrained pca problems")
  Member "a statistical model for tensor pca":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "community detection on mixture multi layer networks via regularized tensor decomposition")
  Member "exact recovery in the stochastic block model":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "renyi entropy bounds on the active learning cost performance tradeoff")
  Member "sum of squares proofs and the quest toward optimal algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "sum of squares bounds for the ordering principle")
  Member "community detection thresholds and the weak ramanujan property":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "from tree matching to sparse graph alignment")

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.DS(Data Structures and Algorithms)