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 "an optimized parallel computation of the ghost layer for adaptive hybrid forest meshes"):
  Abstract: We discuss parallel algorithms to gather topological information about off-process mesh neighbor elements. This information is commonly called the ghost layer, whose creation is a fundamental, necessary task in executing most parallel, element-based computer simulations. Approaches differ in that the ghost layer may either be inherently part of the mesh data structure that is maintained and modified, or kept separate and constructed/deleted as needed. #R##N#In this work, we present an updated design following the latter approach, which we favor for its modularity of algorithms and data structures. We target arbitrary adaptive, non-conforming forest-of-(oc)trees meshes of mixed element shapes, such as cubes, prisms, and tetrahedra, and restrict ourselves to face-ghosts. Our algorithm has low complexity and redundancy since we reduce it to generic codimension-1 subalgorithms that can be flexibly combined. We cover several existing solutions as special cases and optimize further using recursive, amortized tree searches and traversals.

Includes members:
  Member "parallel tree algorithms for amr and non standard data access":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the deal ii finite element library design features and insights")
  Member "scalable algorithms for parallel tree based adaptive mesh refinement with general element types":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a generic finite element framework on parallel tree based adaptive meshes")
  Member "massively parallel algorithms for the lattice boltzmann method on nonuniform grids":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "walberla a block structured high performance framework for multiphysics simulations")
  Member "a tetrahedral space filling curve for nonconforming adaptive meshes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a generic finite element framework on parallel tree based adaptive meshes")
  Member "coarse mesh partitioning for tree based amr":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "scalable algorithms for parallel tree based adaptive mesh refinement with general element types")
  Member "recursive algorithms for distributed forests of octrees":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "non conforming mesh refinement for high order finite elements")
  Member "the dune alugrid module":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the unfitted discontinuous galerkin method for solving the eeg forward problem")
  Member "pt scotch a tool for efficient parallel graph ordering":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "nektar enhancing the capability and application of high fidelity spectral hp element methods")

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