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 "inside the clustering window for random linear equations"):
  Abstract: We study a random system of cn linear equations over n variables in GF(2), where each equation contains exactly r variables; this is equivalent to r-XORSAT. Previous work has established a clustering threshold, c^*_r for this model: if c=c_r^*-\epsilon for any constant \epsilon>0 then with high probability all solutions form a well-connected cluster; whereas if c=c^*_r+\epsilon, then with high probability the solutions partition into well-connected, well-separated clusters (with probability tending to 1 as n goes to infinity). This is part of a general clustering phenomenon which is hypothesized to arise in most of the commonly studied models of random constraint satisfaction problems, via sophisticated but mostly non-rigorous techniques from statistical physics. We extend that study to the range c=c^*_r+o(1), and prove that the connectivity parameters of the r-XORSAT clusters undergo a smooth transition around the clustering threshold.

Includes members:
  Member "on independent sets in random graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the average case complexity of counting cliques in erdos renyi hypergraphs")
  Member "the set of solutions of random xorsat formulae":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "interactive particle systems on hypergraphs drift analysis and the walksat algorithm")
  Member "chasing the k colorability threshold":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "information theoretic thresholds from the cavity method")
  Member "catching the k naesat threshold":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "general bounds on satisfiability thresholds for random csps via fourier analysis")
  Member "frozen variables in random boolean constraint satisfaction problems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "planting colourings silently")
  Member "the solution space geometry of random linear equations":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "interactive particle systems on hypergraphs drift analysis and the walksat algorithm")
  Member "reconstruction and clustering in random constraint satisfaction problems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "broadcasting on random directed acyclic graphs")
  Member "tight thresholds for cuckoo hashing via xorsat":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "peeling close to the orientability threshold spatial coupling in hashing based data structures")

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)