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 "planar 3 sat with a clause variable cycle"):
  Abstract: In a Planar 3-SAT problem, we are given a 3-SAT formula together with its incidence graph, which is planar, and are asked whether this formula is satisfiable. Since Lichtenstein's proof that this problem is NP-complete, it has been used as a starting point for a large number of reductions. In the course of this research, different restrictions on the incidence graph of the formula have been devised, for which the problem also remains hard. #R##N#In this paper, we investigate the restriction in which we require that the incidence graph can be augmented by the edges of a Hamiltonian cycle that first passes through all variables and then through all clauses, in a way that the resulting graph is still planar. We show that the problem of deciding satisfiability of a 3-SAT formula remains NP-complete even if the incidence graph is restricted in that way and the Hamiltonian cycle is given. This complements previous results demanding cycles only through either the variables or clauses. #R##N#The problem remains hard for monotone formulas and instances with exactly three distinct variables per clause. In the course of this investigation, we show that monotone instances of Planar 3-SAT with three distinct variables per clause are always satisfiable, thus settling the question by Darmann, D\"ocker, and Dorn on the complexity of this problem variant in a surprising way.

Includes members:
  Member "the complexity of drawing graphs on few lines and few planes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal curve straightening is exists mathbb r complete")
  Member "on planar variants of the monotone satisfiability problem with bounded variable appearances":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the computational complexity of fire emblem series and similar tactical role playing games")
  Member "flip distance between triangulations of a simple polygon is np complete":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "shortest reconfiguration of perfect matchings via alternating cycles")
  Member "classic nintendo games are computationally hard":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the computational complexity of angry birds")
  Member "minimum weight triangulation is np hard":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "geometry and generation of a new graph planarity game")
  Member "the complexity of planar counting problems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "who witnesses the witness finding witnesses in the witness is hard and sometimes impossible")
  Member "the problem of compatible representatives":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "rock climber distance frogs versus dogs")

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)