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: "parallel tree algorithms for amr and non standard data access"
  Abstract: We introduce several parallel algorithms operating on a distributed forest of adaptive quadtrees/octrees. They are targeted at large-scale applications relying on data layouts that are more complex than required for standard finite elements. Such applications appear in various contexts, examples being the hp-adaptive discontinuous Galerkin method, element-based particle tracking, and in-situ post-processing and visualization. Specifically, we design algorithms to derive an adapted worker forest based on sparse data, to identify owner processes in a top-down search of remote objects, and to allow for variable process counts and per-element data sizes in partitioning and parallel file I/O. We demonstrate the algorithms' usability and performance in the context of a particle tracking example that we scale to 21e9 particles and 64Ki MPI processes on the Juqueen supercomputer.

Connected through hyperedge HE-1 (induced by source paper "the deal ii finite element library design features and insights"):
  with members:
    - "fast matrix free evaluation of discontinuous galerkin finite element operators"
    - "efficient expression templates for operator overloading based automatic differentiation"

Connected through hyperedge HE-2 (induced by source paper "an optimized parallel computation of the ghost layer for adaptive hybrid forest meshes"):
  with members:
    - "scalable algorithms for parallel tree based adaptive mesh refinement with general element types"
    - "massively parallel algorithms for the lattice boltzmann method on nonuniform grids"
    - "a tetrahedral space filling curve for nonconforming adaptive meshes"
    - "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-3 (induced by source paper "distributed memory forest of octrees raycasting"):
  with members:
    - "coarse mesh partitioning for tree based amr"
    - "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.DC(Distributed, Parallel, and Cluster Computing)