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: "bounds on the number of discontinuities of morton type space filling curves"
  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. Similar curves have been proposed for triangular and tetrahedral unit domains. In contrast to the Hilbert curve that is continuous, the Morton-type curves produce jumps. #R##N#We prove that any contiguous subinterval of the curve divides the domain into a bounded number of face-connected subdomains. For the hypercube case and arbitrary dimension, the subdomains are star-shaped and the bound is indeed two. For the simplicial case in dimensions 2 and 3, the bound is proportional to the depth of refinement L. We supplement the paper with theoretical and computational studies on the frequency of jumps for a quantitative assessment.

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"
    - "morton curve segments produce no more than two distinct face connected subdomains"
    - "a survey of high level frameworks in block structured adaptive mesh refinement packages"

Connected through hyperedge HE-2 (induced by source paper "enhancing speed and scalability of the parflow simulation code"):
  with members:
    - "recursive algorithms for distributed forests of octrees"
    - "strong scaling for numerical weather prediction at petascale with the atmospheric model numa"
    - "an open source massively parallel solver for richards equation mechanistic modelling of water fluxes at the watershed scale"

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)