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: "on planar variants of the monotone satisfiability problem with bounded variable appearances"
  Abstract: We show NP-completeness for several planar variants of the monotone satisfiability problem with bounded variable appearances. With one exception the presented variants have an associated bipartite graph where the vertex degree is bounded by at most four. Hence, a planar and orthogonal drawing for these graphs can be computed efficiently, which may turn out to be useful in reductions using these variants as a starting point for proving some decision problem to be NP-hard.

Connected through hyperedge HE-1 (induced by source paper "the computational complexity of fire emblem series and similar tactical role playing games"):
  with members:
    - "computational complexity of games and puzzles"
    - "trainyard is np hard"
    - "the computational complexity of portal and other 3d video games"
    - "candy crush is np hard"
    - "classic nintendo games are computationally hard"
    - "lemmings is pspace complete"
    - "the complexity of the puzzles of final fantasy xiii 2"
    - "gaming is a hard job but someone has to do it"

Connected through hyperedge HE-2 (induced by source paper "reconstruction of weakly simple polygons from their edges"):
  with members:
    - "recognizing weakly simple polygons"
    - "detecting weakly simple polygons"

Connected through hyperedge HE-3 (induced by source paper "planar 3 sat with a clause variable cycle"):
  with members:
    - "the complexity of drawing graphs on few lines and few planes"
    - "flip distance between triangulations of a simple polygon is np complete"
    - "classic nintendo games are computationally hard"
    - "minimum weight triangulation is np hard"
    - "the complexity of planar counting problems"
    - "the problem of compatible representatives"

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)