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 "charting the replica symmetric phase"):
  Abstract: Diluted mean-field models are spin systems whose geometry of interactions is induced by a sparse random graph or hypergraph. Such models play an eminent role in the statistical mechanics of disordered systems as well as in combinatorics and computer science. In a path-breaking paper based on the non-rigorous ‘cavity method’, physicists predicted not only the existence of a replica symmetry breaking phase transition in such models but also sketched a detailed picture of the evolution of the Gibbs measure within the replica symmetric phase and its impact on important problems in combinatorics, computer science and physics (Krzakala et al. in Proc Natl Acad Sci 104:10318–10323, 2007). In this paper we rigorise this picture completely for a broad class of models, encompassing the Potts antiferromagnet on the random graph, the k-XORSAT model and the diluted k-spin model for even k. We also prove a conjecture about the detection problem in the stochastic block model that has received considerable attention (Decelle et al. in Phys Rev E 84:066106, 2011).

Includes members:
  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 "planting colourings silently":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "information theoretic thresholds from the cavity method")
  Member "the condensation phase transition in random graph coloring":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "information theoretic thresholds from the cavity method")
  Member "the phase transition in random regular exact cover":
    also connected through other hyperedges:
      (none)
  Member "on the complexity of random satisfiability problems with planted solutions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "sum of squares meets square loss fast rates for agnostic tensor completion")
  Member "community detection thresholds and the weak ramanujan property":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "from tree matching to sparse graph alignment")
  Member "on the chromatic number of a random hypergraph":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "information theoretic thresholds from the cavity method")

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.DM(Discrete Mathematics)