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: "morton curve segments produce no more than two distinct face connected subdomains"
  Abstract: The Morton- or z-curve is one example for a space filling curve: Given a level of refinement L, it maps the interval [0, 2**dL) one-to-one to a set of d-dimensional cubes of edge length 2**-L that form a subdivision of the unit cube. In contrast to the Hilbert curve that is continuous, the Morton curve produces jumps. We prove that any contiguous subinterval of the curve divides the unit cube into no more than two face-connected, star-shaped subdomains, for arbitrary dimensions d > 0. In other words, there can be at most one jump in the curve that creates a new subdomain. We provide an algorithm for enumerating how many segments of a given length are continuous and prove a lower bound on the fraction of segments of a given length that are continuous. This result should eliminate concerns that the Morton curve may lead to an uncontrolled fragmentation of the domain.

Connected through hyperedge HE-1 (induced by source paper "the peano software parallel automaton based dynamically adaptive grid traversals"):
  with members:
    - "stop talking to me a communication avoiding ader dg realisation"
    - "quasi matrix free hybrid multigrid on dynamically adaptive cartesian grids"
    - "complex additive geometric multilevel solvers for helmholtz equations on spacetrees"
    - "two particle in grid realisations on spacetrees"
    - "algebraic geometric matrix free multigrid on dynamically adaptive cartesian meshes"
    - "how many three dimensional hilbert curves are there"
    - "bounds on the number of discontinuities of morton type space filling curves"
    - "a survey of high level frameworks in block structured adaptive mesh refinement packages"

Connected through hyperedge HE-2 (induced by source paper "a scalable parallel finite element framework for growing geometries application to metal additive manufacturing"):
  with members:
    - "a generic finite element framework on parallel tree based adaptive meshes"
    - "numerical modelling of heat transfer and experimental validation in powder bed fusion with the virtual domain approximation"
    - "the aggregated unfitted finite element method for elliptic problems"
    - "fempar an object oriented parallel finite element framework"
    - "space time balancing domain decomposition"
    - "recursive algorithms for distributed forests of octrees"
    - "locality and bounding box quality of two dimensional space filling curves"

Connected through hyperedge HE-3 (induced by source paper "sixteen space filling curves and traversals for d dimensional cubes and simplices"):
  with members:
    - "how many three dimensional hilbert curves are there"
    - "hyperorthogonal well folded hilbert curves"
    - "recursive tilings and space filling curves with little fragmentation"

Connected through hyperedge HE-4 (induced by source paper "a tetrahedral space filling curve for nonconforming adaptive meshes"):
  with members:
    - "recursive algorithms for distributed forests of octrees"

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