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 "the lov asz theta function for random regular graphs and community detection in the hard regime"):
  Abstract: We derive upper and lower bounds on the degree $d$ for which the Lov\'asz $\vartheta$ function, or equivalently sum-of-squares proofs with degree two, can refute the existence of a $k$-coloring in random regular graphs $G_{n,d}$. We show that this type of refutation fails well above the $k$-colorability transition, and in particular everywhere below the Kesten-Stigum threshold. This is consistent with the conjecture that refuting $k$-colorability, or distinguishing $G_{n,d}$ from the planted coloring model, is hard in this region. Our results also apply to the disassortative case of the stochastic block model, adding evidence to the conjecture that there is a regime where community detection is computationally hard even though it is information-theoretically possible. Using orthogonal polynomials, we also provide explicit upper bounds on $\vartheta(\overline{G})$ for regular graphs of a given girth, which may be of independent interest.

Includes members:
  Member "charting the replica symmetric phase":
    also connected through other hyperedges:
      (none)
  Member "information theoretic thresholds from the cavity method":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal errors and phase transitions in high dimensional generalized linear models")
  Member "the computer science and physics of community detection landscapes phase transitions and hardness":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "mean field theory of graph neural networks in graph partitioning")
  Member "sum of squares lower bounds for refuting any csp":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sum of squares meets square loss fast rates for agnostic tensor completion")
  Member "improved sum of squares lower bounds for hidden clique and hidden submatrix problems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "broadcast congested clique planted cliques and pseudorandom generators")
  Member "how to refute a random csp":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "time space tradeoffs for distinguishing distributions and applications to security of goldreich s prg")
  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")

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.CC(Computational Complexity)