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: "parameterized extension complexity of independent set and related problems"
  Abstract: Let $G$ be a graph on $n$ vertices and $STAB_k(G)$ be the convex hull of characteristic vectors of its independent sets of size at most $k$. It is known that optimizing over $STAB_k(G)$ is $W[1]$-hard and is $FPT$ tractable for graphs of bounded expansion. We show analogous results for the extension complexity of $STAB_k(G)$. In particular, we show that when $G$ is a graph from a class of bounded expansion then $xc(STAB_k(G))\leqslant O(f(k)\cdot n)$ for some function $f$ (depending only on the class). This result can be extended in a simple way to a wide range of similarly defined graph polytopes. In case of general graphs we show that there is \emph{no function} $f$ such that, for all natural numbers $k$ and for all graphs on $n$ vertices, the extension complexity of $STAB_k(G)$ is at most $f(k)\cdot n^{O(1)}.$

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)