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: "extended formulation for csp that is compact for instances of bounded treewidth"
  Abstract: In this paper we provide an extended formulation for the class of constraint satisfaction problems and prove that its size is polynomial for instances whose constraint graph has bounded treewidth. This implies new upper bounds on extension complexity of several important NP-hard problems on graphs of bounded treewidth.

Connected through hyperedge HE-1 (induced by source paper "extension complexity of the correlation polytope"):
  with members:
    - "improved bounds for the excluded grid theorem"
    - "extension complexity of independent set polytopes"
    - "communication complexity for algorithm designers"
    - "polynomial bounds for the grid minor theorem"

Connected through hyperedge HE-2 (induced by source paper "the complexity of general valued csps seen from the other side"):
  with members:
    - "a dichotomy theorem for nonuniform csps"
    - "the proof of csp dichotomy conjecture"
    - "algebraic properties of valued constraint satisfaction problem"
    - "the complexity of general valued csps"
    - "a trichotomy in the complexity of counting answers to conjunctive queries"
    - "the power of linear programming for valued csps"
    - "tractable optimization problems through hypergraph based structural restrictions"
    - "tractable hypergraph properties for constraint satisfaction and conjunctive queries"

Connected through hyperedge HE-3 (induced by source paper "extension complexity mso logic and treewidth"):
  with members:
    - "lower bounds on the size of semidefinite programming relaxations"
    - "approximation limits of linear programs beyond hierarchies"
    - "courcelle s theorem a game theoretic approach"
    - "algorithmic meta theorems"
    - "monadic datalog over finite structures with bounded treewidth"

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)