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: "planar graphs logical complexity and parallel isomorphism tests"
  Abstract: We prove that every triconnected planar graph is definable by a first order sentence that uses at most 15 variables and has quantifier depth at most $11\log_2 n+43$. As a consequence, a canonic form of such graphs is computable in $AC^1$ by the 14-dimensional Weisfeiler-Lehman algorithm. This provides another way to show that the planar graph isomorphism is solvable in $AC^1$.

Connected through hyperedge HE-1 (induced by source paper "distributed testing of graph isomorphism in the congest model"):
  with members:
    - "distributed detection of cliques in dynamic networks"
    - "property testing of planarity in the congest model"
    - "distributed triangle detection via expander decomposition"
    - "detecting cliques in congest networks"
    - "distributed subgraph detection"
    - "fooling views a new lower bound technique for distributed computations under congestion"
    - "distributed detection of cycles"
    - "faster and simpler distributed algorithms for testing and correcting graph properties in the congest model"

Connected through hyperedge HE-2 (induced by source paper "the weisfeiler leman dimension of planar graphs is at most 3"):
  with members:
    - "near optimal lower bounds on quantifier depth and weisfeiler leman refinement steps"
    - "upper bounds on the quantifier depth for graph differentiation in first order logic"
    - "tangled up in blue a survey on connectivity decompositions and tangles"
    - "graphs identified by logics with counting"
    - "dynamic complexity of planar 3 connected graph isomorphism"
    - "practical graph isomorphism ii"
    - "pebble games and linear equations"
    - "testing graph isomorphism in parallel by playing a game"

Connected through hyperedge HE-3 (induced by source paper "on the dynamic width of the 3 colorability problem"):
  with members:
    - "lower bounds for existential pebble games and k consistency tests"
    - "on the speed of constraint propagation and the time complexity of arc consistency testing"
    - "3 coloring in time o 1 3289 n"

Connected through hyperedge HE-4 (induced by source paper "fixed point definability and polynomial time on chordal graphs and line graphs"):
  with members:
    - "capturing polynomial time on interval graphs"
    - "from invariants to canonization in parallel"
    - "testing graph isomorphism in parallel by playing a game"

Connected through hyperedge HE-5 (induced by source paper "the isomorphism problem for planar 3 connected graphs is in unambiguous logspace"):
  with members:
    - "a log space algorithm for canonization of planar graphs"
    - "3 connected planar graph isomorphism is in log space"
    - "testing graph isomorphism in parallel by playing a game"

Connected through hyperedge HE-6 (induced by source paper "a log space algorithm for canonization of planar graphs"):
  with members:
    - "the isomorphism problem for planar 3 connected graphs is in unambiguous logspace"

Connected through hyperedge HE-7 (induced by source paper "3 connected planar graph isomorphism is in log space"):
  with members:
    - "the isomorphism problem for planar 3 connected graphs is in unambiguous logspace"

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)