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: "a tetrahedral space filling curve for nonconforming adaptive meshes"
  Abstract: We introduce a space-filling curve for triangular and tetrahedral red-refinement that can be computed using bitwise interleaving operations similar to the well-known Z-order or Morton curve for cub...

Connected through hyperedge HE-1 (induced by source paper "an optimized parallel computation of the ghost layer for adaptive hybrid forest meshes"):
  with members:
    - "parallel tree algorithms for amr and non standard data access"
    - "scalable algorithms for parallel tree based adaptive mesh refinement with general element types"
    - "massively parallel algorithms for the lattice boltzmann method on nonuniform grids"
    - "coarse mesh partitioning for tree based amr"
    - "recursive algorithms for distributed forests of octrees"
    - "the dune alugrid module"
    - "pt scotch a tool for efficient parallel graph ordering"

Connected through hyperedge HE-2 (induced by source paper "a generic finite element framework on parallel tree based adaptive meshes"):
  with members:
    - "scalable algorithms for parallel tree based adaptive mesh refinement with general element types"
    - "the aggregated unfitted finite element method for elliptic problems"
    - "simulation of high temperature superconductors and experimental validation"
    - "fempar an object oriented parallel finite element framework"

Connected through hyperedge HE-3 (induced by source paper "parallel tree algorithms for amr and non standard data access"):
  with members:
    - "recursive algorithms for distributed forests of octrees"
    - "enabling highly scalable remote memory access programming with mpi 3 one sided"

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.DC(Distributed, Parallel, and Cluster Computing)