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 "the descriptive complexity of subgraph isomorphism in the absence of order"):
  Abstract: Let $C$ be a class of graphs and $\pi$ be a graph parameter. Let $\Phi$ be a formula in the first-order language containing only the adjacency and the equality relations. We say that $\Phi$ \emph{defines $C$ on connected graphs with sufficiently large $\pi$} if there is a constant $k$ such that, for every connected graph $G$ with $\pi(G)\ge k$, $\Phi$ is true on $G$ exactly when $G$ belongs to $C$. For a fixed connected graph $F$, let $S(F)$ denote the class of all graphs containing $F$ as a subgraph. Let $D_\pi(F)$ denote the minimum quantifier depth of a formula $\Phi$ defining $S(F)$ on connected graphs with sufficiently large $\pi$. We have $D_v(F)\ge D_{tw}(F)\ge D_\kappa(F)$, where $v(G)$ denotes the number of vertices in a graph $G$, $tw(G)$ is the treewidth of $G$, and $\kappa(G)$ is the connectivity of~$G$. We obtain the following results. #R##N#- There are graphs $F$ such that $D_v(F)$ is strictly smaller than the number $n$ of vertices in $F$. In particular, $D_v(P_n)=n-1$ for the path graphs on $n\ge4$ vertices. Moreover, there are some trees $F$ such that $D_v(F)\le n-3$. #R##N#- On the other hand, $D_v(F)=D_{tw}(F)=n$ if $F$ has no vertex of degree 1. In general, $D_v(F)>n/2$ unless $F=P_2$ or $P_3$. #R##N#- $D_{tw}(F)\ge tw(F)$ for every $F$. Over trees $F$ with $n$ vertices, the values of $D_{tw}(F)$ occupy the almost full spectrum $\{1,5,\ldots,n\}$. The minimum value $D_{tw}(F)=1$ is attained if $F$ is a subtree of a subdivided 3-star $K_{1,3}$. The maximum $D_{tw}(K_{1,n-1})=n$ is attained for the star graphs on $n\ge5$ vertices. #R##N#- $D_\kappa(F)\ge\frac mn+2$ whenever the number $m$ of edges in $F$ is larger than the number $n$ of vertices. Over graphs $F$ with $n$ vertices, the values of $D_\kappa(F)$ occupy the almost full spectrum $\{1,3,\ldots,n\}$.

Includes members:
  Member "an improved homomorphism preservation theorem from lower bounds in circuit complexity":
    also connected through other hyperedges:
      (none)
  Member "powers of tensors and fast matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs")
  Member "polynomial bounds for the grid minor theorem":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "hitting topological minors is fpt")

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)