human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "relationship between clustering and algorithmic phase transitions in the random k xorsat model and its np complete extensions"
  Abstract: We study the performances of stochastic heuristic search algorithms on Uniquely Extendible Constraint Satisfaction Problems with random inputs. We show that, for any heuristic preserving the Poissonian nature of the underlying instance, the (heuristic-dependent) largest ratio αa of constraints per variables for which a search algorithm is likely to find solutions is smaller than the critical ratio αd above which solutions are clustered and highly correlated. In addition we show that the clustering ratio can be reached when the number k of variables per constraints goes to infinity by the so-called Generalized Unit Clause heuristic.

Connected through hyperedge HE-1 (induced by source paper "interactive particle systems on hypergraphs drift analysis and the walksat algorithm"):
  with members:
    - "the set of solutions of random xorsat formulae"
    - "coalescing random walks and voting on connected graphs"
    - "the solution space geometry of random linear equations"
    - "on the dynamics of social balance on general networks with an application to xor sat"
    - "spines of random constraint satisfaction problems definition and connection with computational complexity"

Connected through hyperedge HE-2 (induced by source paper "the satisfiability threshold for a seemingly intractable random constraint satisfaction problem"):
  with members:
    - "tight thresholds for cuckoo hashing via xorsat"
    - "a new upper bound for 3 sat"
    - "exact phase transitions in random constraint satisfaction problems"

Connected through hyperedge HE-3 (induced by source paper "is sp bp"):
  with members:
    - "lossy source encoding via message passing and decimation over generalized codewords of ldgm codes"
    - "a new look at survey propagation and its generalizations"
    - "typical random 3 sat formulae and the satisfiability threshold"
    - "survey propagation an algorithm for satisfiability"

Question: Please tell me which class the center node 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)