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: "coarse mesh partitioning for tree based amr"
  Abstract: In tree based adaptive mesh refinement, elements are partitioned between processes using a space filling curve. The curve establishes an ordering between all elements that derive from the same root element, the tree. When representing more complex geometries by patching together several trees, the roots of these trees form an unstructured coarse mesh. We present an algorithm to partition the elements of the coarse mesh such that (a) the fine mesh can be load-balanced to equal element counts per process regardless of the element-to-tree map and (b) each process that holds fine mesh elements has access to the meta data of all relevant trees. As an additional feature, the algorithm partitions the meta data of relevant ghost (halo) trees as well. We develop in detail how each process computes the communication pattern for the partition routine without handshaking and with minimal data movement. We demonstrate the scalability of this approach on up to 917e3 MPI ranks and .37e12 coarse mesh elements, measuring run times of one second or less.

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"
    - "a tetrahedral space filling curve for nonconforming adaptive meshes"
    - "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 "scalable algorithms for parallel tree based adaptive mesh refinement with general element types"):
  with members:
    - "sixteen space filling curves and traversals for d dimensional cubes and simplices"
    - "recursive algorithms for distributed forests of octrees"

Connected through hyperedge HE-3 (induced by source paper "distributed memory forest of octrees raycasting"):
  with members:
    - "parallel tree algorithms for amr and non standard data access"
    - "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)