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 domino problem of the hyperbolic plane is undecidable"):
  Abstract: In this paper, we prove that the general tiling problem of the hyperbolic plane is undecidable by proving a slightly stronger version using only a regular polygon as the basic shape of the tiles. The problem was raised by a paper of Raphael Robinson in 1971, in his famous simplified proof that the general tiling problem is undecidable for the Euclidean plane, initially proved by Robert Berger in 1966.

Includes members:
  Member "the finite tiling problem is undecidable in the hyperbolic plane":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the domino problem of the hyperbolic plane is undecidable")
  Member "about the domino problem in the hyperbolic plane from an algorithmic point of view":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the injectivity of the global function of a cellular automaton in the hyperbolic plane is undecidable")
  Member "the domino problem of the hyperbolic plane is undecidable":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "row constrained effective sets of colourings in the 2 fold horocyclic tessellations of mathbb h 2 are sofic")
  Member "the periodic domino problem is undecidable in the hyperbolic plane":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the domino problem of the hyperbolic plane is undecidable")
  Member "about the domino problem in the hyperbolic plane a new solution":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "noncooperative algorithms in self assembly")
  Member "aperiodic tilings breaking translational symmetry":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "quantum one way permutation over the finite field of two elements")

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.CG(Computational Geometry)