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: "from invariants to canonization in parallel"
  Abstract: A function $f$ of a graph is called a complete graph invariant if the isomorphism of graphs $G$ and $H$ is equivalent to the equality $f(G)=f(H)$. If, in addition, $f(G)$ is a graph isomorphic to $G$, then $f$ is called a canonical form for graphs. Gurevich proves that graphs have a polynomial-time computable canonical form exactly when they have a polynomial-time computable complete invariant. We extend this equivalence to the polylogarithmic-time model of parallel computation for classes of graphs with bounded rigidity index and for classes of graphs with small separators. In particular, our results apply to three representative classes of graphs embeddable into a fixed surface, namely, to 5-connected graphs, to 3-connected graphs admitting a polyhedral embedding, and 3-connected graphs admitting a large-edge-width embedding. Another application covers graphs with bounded treewidth. Since in the latter case an NC complete-invariant algorithm is known, we conclude that graphs of bounded treewidth have a canonical form (and even a canonical labeling) computable in NC.

Connected through hyperedge HE-1 (induced by source paper "upper bounds on the quantifier depth for graph differentiation in first order logic"):
  with members:
    - "near optimal lower bounds on quantifier depth and weisfeiler leman refinement steps"
    - "graph isomorphism in quasipolynomial time"
    - "graphs identified by logics with counting"
    - "tight lower and upper bounds for the complexity of canonical colour refinement"
    - "universal covers color refinement and two variable counting logic lower bounds for the depth"
    - "the propagation depth of local consistency"
    - "practical graph isomorphism ii"
    - "dimension reduction via colour refinement"

Connected through hyperedge HE-2 (induced by source paper "towards an isomorphism dichotomy for hereditary graph classes"):
  with members:
    - "isomorphism testing for graphs of bounded rank width"
    - "clique width of graph classes defined by two forbidden induced subgraphs"
    - "graph isomorphism for graph classes characterized by two forbidden induced subgraphs"
    - "isomorphism of graph classes related to the circular ones property"
    - "structure theorem and isomorphism test for graphs with excluded topological subgraphs"

Connected through hyperedge HE-3 (induced by source paper "fixed point definability and polynomial time on chordal graphs and line graphs"):
  with members:
    - "capturing polynomial time on interval graphs"
    - "planar graphs logical complexity and parallel isomorphism tests"
    - "testing graph isomorphism in parallel by playing a game"

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)